/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | InverseBiMapTest.java | 22 * Unit test covering the inverse view of a {@code BiMap}. 29 BiMap<String, Integer> inverse = HashBiMap.create(); 30 return inverse.inverse();
|
H A D | SynchronizedBiMapTest.java | 61 public BiMap<V, K> inverse() { method in class:SynchronizedBiMapTest.TestBiMap 63 return delegate.inverse(); 80 BiMap<Integer, String> inverse = bimap.inverse(); 81 assertSame(bimap, inverse.inverse()); 82 assertTrue(inverse instanceof SynchronizedBiMap); 83 assertSame(mutex, ((SynchronizedBiMap<?, ?>) inverse).mutex); 104 * If you serialize a synchronized bimap and its inverse together, the 107 * inverse o [all...] |
H A D | BiMapMapInterfaceTest.java | 63 BiMap<Integer, String> inverse = bimap.inverse(); 64 assertEquals(bimap.size(), inverse.size()); 66 assertEquals(entry.getKey(), inverse.get(entry.getValue())); 68 for (Entry<Integer, String> entry : inverse.entrySet()) { 89 return HashBiMap.<Integer, String>create().inverse();
|
H A D | HashBiMapTest.java | 44 assertEquals("canada", bimap.inverse().get("dollar")); 55 assertEquals("canada", bimap.inverse().get("dollar")); 62 BiMap<Integer, Integer> inverse = bimap.inverse(); 71 assertEquals(2 * i, (int) inverse.get(2 * i + 1)); 81 assertEquals(2 * i, (int) inverse.get(2 * i - 1)); 106 assertEquals(1, bimap.inverse().size()); 121 assertEquals(1, bimap.inverse().size());
|
H A D | AbstractBiMapTest.java | 114 BiMap<String, Integer> inverse = bimap.inverse(); 117 assertEquals(ImmutableMap.of("one", 1, "two", 2), inverse); 120 assertSame(bimap, inverse.inverse()); 124 BiMap<String, Integer> inverse = bimap.inverse(); 126 bimap.inverse().put("two", 2); 127 assertEquals(ImmutableMap.of("one", 1, "two", 2), inverse); 325 assertEquals(2, bimap.inverse() [all...] |
H A D | ImmutableBiMapTest.java | 96 .named("ImmutableBiMap.inverse.keys") 103 .named("ImmutableBiMap.inverse.entrySet") 110 .named("ImmutableBiMap.inverse.values") 162 assertEquals(entry.getKey(), bimap.inverse().get(entry.getValue())); 204 return ImmutableBiMap.of(1, "one", 2, "two", 3, "three").inverse(); 221 assertEquals(Collections.<Integer, String>emptyMap(), map.inverse()); 230 assertMapEquals(map.inverse(), 1, "one"); 244 assertMapEquals(map.inverse(), 270 assertMapEquals(map.inverse(), 286 assertMapEquals(mapOne.inverse(), [all...] |
H A D | EnumHashBiMapTest.java | 47 assertEquals(Currency.DOLLAR, bimap.inverse().get("dollar")); 59 assertEquals(Currency.DOLLAR, bimap.inverse().get("dollar")); 90 bimap2.inverse().put("franc", Currency.FRANC); 112 bimap2.inverse().put("franc", Currency.FRANC); 142 assertEquals(bimap.inverse(), copy.inverse()); 154 assertEquals(Currency.PESO, bimap.inverse().get("dollar")); 156 assertEquals(1, bimap.inverse().size());
|
H A D | EnumBiMapTest.java | 50 assertEquals(Currency.DOLLAR, bimap.inverse().get(Country.CANADA)); 61 assertEquals(Currency.DOLLAR, bimap.inverse().get(Country.CANADA)); 90 bimap2.inverse().put(Country.SWITZERLAND, Currency.FRANC); 125 assertEquals(bimap.inverse(), copy.inverse()); 129 // The enum orderings are alphabetical, leading to the bimap and its inverse 144 ASSERT.that(bimap.inverse().keySet()) 147 ASSERT.that(bimap.inverse().values())
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | RegularImmutableBiMap.java | 30 private ImmutableBiMap<V, K> inverse; field in class:RegularImmutableBiMap 40 this.inverse = new RegularImmutableBiMap<V, K>(backwardMap, this); 44 ImmutableBiMap<V, K> inverse) { 46 this.inverse = inverse; 49 @Override public ImmutableBiMap<V, K> inverse() { method in class:RegularImmutableBiMap 50 return inverse; 43 RegularImmutableBiMap(ImmutableMap<K, V> delegate, ImmutableBiMap<V, K> inverse) argument
|
H A D | AbstractBiMap.java | 48 private transient AbstractBiMap<V, K> inverse; field in class:AbstractBiMap 55 /** Private constructor for inverse bimap. */ 58 inverse = forward; 71 checkState(inverse == null); 76 inverse = new Inverse<V, K>(backward, this); 79 void setInverse(AbstractBiMap<V, K> inverse) { argument 80 this.inverse = inverse; 86 return inverse.containsKey(value); 106 inverse() 153 public BiMap<V, K> inverse() { method in class:AbstractBiMap [all...] |
H A D | ImmutableBiMap.java | 112 public abstract ImmutableBiMap<V, K> inverse(); method in class:ImmutableBiMap 115 return inverse().keySet(); 127 @Override public ImmutableBiMap<Object, Object> inverse() { method in class:ImmutableBiMap.EmptyBiMap
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | RegularImmutableBiMap.java | 30 final transient ImmutableBiMap<V, K> inverse; field in class:RegularImmutableBiMap 40 this.inverse = new RegularImmutableBiMap<V, K>(backwardMap, this); 44 ImmutableBiMap<V, K> inverse) { 46 this.inverse = inverse; 53 @Override public ImmutableBiMap<V, K> inverse() { method in class:RegularImmutableBiMap 54 return inverse; 58 return delegate.isPartialView() || inverse.delegate().isPartialView(); 43 RegularImmutableBiMap(ImmutableMap<K, V> delegate, ImmutableBiMap<V, K> inverse) argument
|
H A D | AbstractBiMap.java | 52 private transient AbstractBiMap<V, K> inverse; field in class:AbstractBiMap 59 /** Private constructor for inverse bimap. */ 62 inverse = forward; 75 checkState(inverse == null); 80 inverse = new Inverse<V, K>(backward, this); 83 void setInverse(AbstractBiMap<V, K> inverse) { argument 84 this.inverse = inverse; 90 return inverse.containsKey(value); 110 inverse() 157 public BiMap<V, K> inverse() { method in class:AbstractBiMap [all...] |
H A D | BiMap.java | 29 * support an "inverse view", which is another bimap containing the same entries 96 * Returns the inverse view of this bimap, which maps each of this bimap's 101 * order of a bimap and that of its inverse. 103 * @return the inverse view of this bimap 105 BiMap<V, K> inverse(); method in interface:BiMap
|
/external/iptables/include/linux/netfilter/ |
H A D | xt_connlimit.h | 22 unsigned int inverse; member in union:xt_connlimit_info::__anon6469
|
/external/skia/src/pdf/ |
H A D | SkPDFFormXObject.cpp | 38 SkMatrix inverse; local 39 inverse.reset(); 40 device->initialTransform().invert(&inverse); 41 insert("Matrix", SkPDFUtils::MatrixToArray(inverse))->unref();
|
/external/skia/tests/ |
H A D | Matrix44Test.cpp | 81 SkMatrix44 mat, inverse, iden1, iden2, rot; local 85 mat.invert(&inverse); 86 iden1.setConcat(mat, inverse); 90 mat.invert(&inverse); 91 iden1.setConcat(mat, inverse); 95 mat.invert(&inverse); 96 iden1.setConcat(mat, inverse); 107 mat.invert(&inverse); 108 iden1.setConcat(mat, inverse); 110 iden2.setConcat(inverse, ma [all...] |
H A D | MatrixTest.cpp | 149 SkMatrix mat, inverse, iden1, iden2; local 153 mat.invert(&inverse); 154 iden1.setConcat(mat, inverse); 158 mat.invert(&inverse); 159 iden1.setConcat(mat, inverse); 164 mat.invert(&inverse); 165 iden1.setConcat(mat, inverse); 172 mat.invert(&inverse); 173 iden1.setConcat(mat, inverse); 175 iden2.setConcat(inverse, ma [all...] |
/external/webp/src/utils/ |
H A D | filters.c | 33 uint8_t* dst, int length, int inverse) { 35 if (inverse) { 46 int width, int height, int bpp, int stride, int inverse, uint8_t* out) { 48 const uint8_t* preds = (inverse ? out : in); 57 PredictLine(in, preds - stride, out, bpp, inverse); 59 PredictLine(in + bpp, preds, out + bpp, bpp * (width - 1), inverse); 80 int width, int height, int bpp, int stride, int inverse, uint8_t* out) { 82 const uint8_t* preds = (inverse ? out : in); 88 PredictLine(in + bpp, preds, out + bpp, bpp * (width - 1), inverse); 94 PredictLine(in, preds, out, bpp * width, inverse); 32 PredictLine(const uint8_t* src, const uint8_t* pred, uint8_t* dst, int length, int inverse) argument 45 DoHorizontalFilter(const uint8_t* in, int width, int height, int bpp, int stride, int inverse, uint8_t* out) argument 79 DoVerticalFilter(const uint8_t* in, int width, int height, int bpp, int stride, int inverse, uint8_t* out) argument 118 DoGradientFilter(const uint8_t* in, int width, int height, int bpp, int stride, int inverse, uint8_t* out) argument [all...] |
/external/webkit/Source/WebCore/rendering/ |
H A D | TransformState.cpp | 96 return m_accumulatedTransform->inverse().projectPoint(m_lastPlanarPoint); 107 return m_accumulatedTransform->inverse().projectQuad(m_lastPlanarQuad); 117 TransformationMatrix inverseTransform = t.inverse(); 157 TransformationMatrix inverseTransform = t.inverse(); 167 return m_accumulatedTransform.inverse().projectPoint(m_lastPlanarPoint); 172 return m_accumulatedTransform.inverse().projectQuad(m_lastPlanarQuad);
|
/external/srec/srec/clib/ |
H A D | imeld_rd.c | 64 prep->inverse = create_matrix(matdim); 81 ASSERT(prep->inverse); 83 delete_matrix(prep->inverse, prep->dim); 85 prep->inverse = NULL; 157 /* The inverse imelda matrix 167 invert_matrix(prep->imelda, prep->inverse, prep->dim); 177 prep->inverse[ii][jj] = (covdata)(onerow[jj] / scale); 182 prep->inverse, matdim);
|
/external/iproute2/netem/ |
H A D | maketable.c | 7 * From this, create the inverse distribution table used to approximate 85 /* Since entries in the inverse are scaled by TABLEFACTOR, and can't be bigger 138 short *inverse; local 141 inverse = (short *)malloc(inversesize*sizeof(short)); 143 inverse[i] = MINSHORT; 152 inverse[inverseindex] = inversevalue; 154 return inverse; 203 short *inverse; local 228 inverse = inverttable(table, TABLESIZE, DISTTABLESIZE, total); 229 interpolatetable(inverse, TABLESIZ [all...] |
/external/libvorbis/doc/ |
H A D | 10-tables.tex | 6 \subsection{floor1\_inverse\_dB\_table} \label{vorbis:spec:floor1:inverse:dB:table}
|
/external/libvorbis/lib/ |
H A D | backends.h | 100 int (*inverse) (struct vorbis_block *,vorbis_look_residue *, member in struct:__anon8120 128 int (*inverse) (struct vorbis_block *vb,vorbis_info_mapping *); member in struct:__anon8121
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
H A D | BiMapGenerators.java | 77 return ImmutableBiMap.copyOf(map).inverse().entrySet(); 88 return ImmutableBiMap.copyOf(map).inverse().keySet(); 99 return ImmutableBiMap.copyOf(map).inverse().values();
|