/external/guava/src/com/google/common/collect/ |
D | AbstractBiMap.java | 50 private transient AbstractBiMap<V, K> inverse; field in AbstractBiMap 60 inverse = forward; in AbstractBiMap() 73 checkState(inverse == null); in setDelegates() 78 inverse = new Inverse<V, K>(backward, this); in setDelegates() 81 void setInverse(AbstractBiMap<V, K> inverse) { in setInverse() argument 82 this.inverse = inverse; in setInverse() 88 return inverse.containsKey(value); in containsValue() 107 inverse().remove(value); in putInBothMaps() 121 inverse.delegate.put(newValue, key); in updateInverseMap() 135 inverse.delegate.remove(oldValue); in removeFromInverseMap() [all …]
|
D | RegularImmutableBiMap.java | 30 final transient ImmutableBiMap<V, K> inverse; field in RegularImmutableBiMap 40 this.inverse = new RegularImmutableBiMap<V, K>(backwardMap, this); in RegularImmutableBiMap() 44 ImmutableBiMap<V, K> inverse) { in RegularImmutableBiMap() argument 46 this.inverse = inverse; in RegularImmutableBiMap() 53 @Override public ImmutableBiMap<V, K> inverse() { in inverse() method in RegularImmutableBiMap 54 return inverse; in inverse()
|
D | ImmutableBiMap.java | 216 public abstract ImmutableBiMap<V, K> inverse(); in inverse() method in ImmutableBiMap 223 return inverse().containsKey(value); in containsValue() 243 return inverse().keySet(); in values() 281 @Override public ImmutableBiMap<Object, Object> inverse() { in inverse() method in ImmutableBiMap.EmptyBiMap
|
D | Synchronized.java | 1256 private transient BiMap<V, K> inverse; 1260 @Nullable BiMap<V, K> inverse) { 1262 this.inverse = inverse; 1284 public BiMap<V, K> inverse() { 1286 if (inverse == null) { 1287 inverse 1288 = new SynchronizedBiMap<V, K>(delegate().inverse(), mutex, this); 1290 return inverse;
|
D | Maps.java | 624 transient BiMap<V, K> inverse; 628 @Nullable BiMap<V, K> inverse) { 631 this.inverse = inverse; 642 public BiMap<V, K> inverse() { 643 BiMap<V, K> result = inverse; 645 ? inverse = new UnmodifiableBiMap<V, K>(delegate.inverse(), this)
|
D | BiMap.java | 102 BiMap<V, K> inverse(); in inverse() method
|
/external/skia/tests/ |
D | MatrixTest.cpp | 50 SkMatrix mat, inverse, iden1, iden2; in TestMatrix() local 54 mat.invert(&inverse); in TestMatrix() 55 iden1.setConcat(mat, inverse); in TestMatrix() 59 mat.invert(&inverse); in TestMatrix() 60 iden1.setConcat(mat, inverse); in TestMatrix() 65 mat.invert(&inverse); in TestMatrix() 66 iden1.setConcat(mat, inverse); in TestMatrix() 73 mat.invert(&inverse); in TestMatrix() 74 iden1.setConcat(mat, inverse); in TestMatrix() 76 iden2.setConcat(inverse, mat); in TestMatrix()
|
/external/iproute2/netem/ |
D | maketable.c | 138 short *inverse; in inverttable() local 141 inverse = (short *)malloc(inversesize*sizeof(short)); in inverttable() 143 inverse[i] = MINSHORT; in inverttable() 152 inverse[inverseindex] = inversevalue; in inverttable() 154 return inverse; in inverttable() 203 short *inverse; in main() local 228 inverse = inverttable(table, TABLESIZE, DISTTABLESIZE, total); in main() 229 interpolatetable(inverse, TABLESIZE); in main() 230 printtable(inverse, TABLESIZE); in main()
|
D | README.distribution | 6 translated, inverse to the cumulative distribution function. 17 F is monotonically increasing, so has an inverse function G, with range 35 -- since G and F are inverse functions (and F is 44 simple expression which allows evaluating its inverse directly. The 65 for the ("normalized") inverse of size TABLESIZE, covering its domain 0 69 inverse's table, filling in any missing entries by linear interpolation.
|
/external/srec/srec/clib/ |
D | imeld_rd.c | 64 prep->inverse = create_matrix(matdim); in create_linear_transform() 81 ASSERT(prep->inverse); in free_linear_transform() 83 delete_matrix(prep->inverse, prep->dim); in free_linear_transform() 85 prep->inverse = NULL; in free_linear_transform() 167 invert_matrix(prep->imelda, prep->inverse, prep->dim); in init_newton_transform() 177 prep->inverse[ii][jj] = (covdata)(onerow[jj] / scale); in init_newton_transform() 182 prep->inverse, matdim); in init_newton_transform()
|
/external/webkit/WebCore/rendering/ |
D | TransformState.cpp | 96 return m_accumulatedTransform->inverse().projectPoint(m_lastPlanarPoint); in mappedPoint() 107 return m_accumulatedTransform->inverse().projectQuad(m_lastPlanarQuad); in mappedQuad() 117 TransformationMatrix inverseTransform = t.inverse(); in flattenWithTransform() 157 TransformationMatrix inverseTransform = t.inverse(); in flattenWithTransform() 167 return m_accumulatedTransform.inverse().projectPoint(m_lastPlanarPoint); in mappedPoint() 172 return m_accumulatedTransform.inverse().projectQuad(m_lastPlanarQuad); in mappedQuad()
|
/external/speex/libspeex/ |
D | kiss_fft.c | 41 if (!st->inverse) { in kf_bfly2() 101 if (st->inverse) in kf_bfly4() 185 if (!st->inverse) { in kf_bfly3() 238 if (!st->inverse) { in kf_bfly5() 300 if (!st->inverse) { in kf_bfly_generic() 480 st->inverse = inverse_fft; in kiss_fft_alloc() 484 if (!st->inverse) in kiss_fft_alloc() 492 if (st->inverse) in kiss_fft_alloc()
|
D | kiss_fftr.c | 87 if ( st->substate->inverse) { in kiss_fftr() 141 if (st->substate->inverse == 0) { in kiss_fftri() 180 if ( st->substate->inverse) { in kiss_fftr2() 266 if (st->substate->inverse == 0) { in kiss_fftri2()
|
/external/iproute2/ |
D | README.distribution | 4 translated, inverse to the cumulative distribution function. 15 F is monotonically increasing, so has an inverse function G, with range 33 -- since G and F are inverse functions (and F is 42 simple expression which allows evaluating its inverse directly. The 63 for the ("normalized") inverse of size TABLESIZE, covering its domain 0 67 inverse's table, filling in any missing entries by linear interpolation.
|
/external/webkit/WebCore/bindings/js/ |
D | JSSVGMatrixCustom.cpp | 51 JSValue JSSVGMatrix::inverse(ExecState* exec, const ArgList&) in inverse() function in WebCore::JSSVGMatrix 56 …, globalObject(), JSSVGStaticPODTypeWrapper<AffineTransform>::create(imp.inverse()).get(), context… in inverse()
|
/external/skia/src/gl/ |
D | SkGLDevice.cpp | 192 SkMatrix inverse; in setupGLPaintShader() local 193 if (localM.invert(&inverse)) { in setupGLPaintShader() 194 matrix.preConcat(inverse); in setupGLPaintShader() 225 SkMatrix inverse; in drawPaint() local 226 if (draw.fMatrix->invert(&inverse)) { in drawPaint() 227 inverse.mapRect(&r); in drawPaint()
|
/external/bouncycastle/src/main/java/org/bouncycastle/crypto/encodings/ |
D | ISO9796d1Encoding.java | 21 private static byte[] inverse = { 0x8, 0xf, 0x6, 0x1, 0x5, 0x2, 0xb, 0xc, field in ISO9796d1Encoding 211 …block[block.length - 1] = (byte)(((block[block.length - 1] & 0xff) >>> 4) | ((inverse[(block[block… in decodeBlock()
|
/external/webkit/WebCore/css/ |
D | WebKitCSSMatrix.cpp | 107 PassRefPtr<WebKitCSSMatrix> WebKitCSSMatrix::inverse(ExceptionCode& ec) const in inverse() function in WebCore::WebKitCSSMatrix 114 return WebKitCSSMatrix::create(m_matrix.inverse()); in inverse()
|
D | WebKitCSSMatrix.idl | 61 // Return the inverse of this matrix. Throw an exception if the matrix is not invertible 62 [Immutable] WebKitCSSMatrix inverse() raises (DOMException);
|
/external/iptables/include/linux/netfilter_ipv4/ |
D | ipt_rpc.h | 28 int inverse; member
|
D | ipt_connlimit.h | 8 int inverse; member
|
/external/freetype/src/autofit/ |
D | afloader.c | 106 FT_Matrix inverse; in af_loader_load_g() local 112 inverse = loader->trans_matrix; in af_loader_load_g() 113 FT_Matrix_Invert( &inverse ); in af_loader_load_g() 114 FT_Vector_Transform( &loader->trans_delta, &inverse ); in af_loader_load_g()
|
/external/libvpx/vp8/encoder/ppc/ |
D | fdct_altivec.asm | 21 ;# Forward and inverse DCTs are nearly identical; only differences are 57 ;# For inverse transform, frequencies then positions. 76 ;# Vertical xf on two rows. DCT values in comments are for inverse transform;
|
/external/skia/src/svg/ |
D | SkSVGPaintState.cpp | 238 SkMatrix inverse; in setSave() local 239 bool success = parser.fLastTransform.invert(&inverse); in setSave() 242 output.setConcat(inverse, sum); in setSave()
|
/external/openssl/crypto/rc2/ |
D | rrc2.doc | 33 1. Two's-complement addition of words, denoted by "+". The inverse operation, 39 x <<< y. The inverse operation, right-rotation, is denoted x >>> y. 123 The decryption operation is simply the inverse of the encryption operation.
|