/external/freetype/src/autofit/ |
H A D | afloader.c | 127 FT_Matrix inverse; local 133 inverse = loader->trans_matrix; 134 FT_Matrix_Invert( &inverse ); 135 FT_Vector_Transform( &loader->trans_delta, &inverse );
|
/external/guava/guava/src/com/google/common/collect/ |
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 | ImmutableBiMap.java | 27 * not permit null keys or values. An {@code ImmutableBiMap} and its inverse 220 * <p>The inverse of an {@code ImmutableBiMap} is another 224 public abstract ImmutableBiMap<V, K> inverse(); method in class:ImmutableBiMap 231 return inverse().containsKey(value); 251 return inverse().keySet(); 291 @Override public ImmutableBiMap<Object, Object> inverse() { method in class:ImmutableBiMap.EmptyBiMap 308 * for keeping the bimap and its inverse in sync during serialization, the way
|
H A D | ImmutableListMultimap.java | 286 private transient ImmutableListMultimap<V, K> inverse; field in class:ImmutableListMultimap 291 * <p>Because an inverse of a list multimap can contain multiple pairs with the same key and 298 public ImmutableListMultimap<V, K> inverse() { method in class:ImmutableListMultimap 299 ImmutableListMultimap<V, K> result = inverse; 300 return (result == null) ? (inverse = invert()) : result; 309 invertedMultimap.inverse = this;
|
H A D | ImmutableSetMultimap.java | 368 private transient ImmutableSetMultimap<V, K> inverse; field in class:ImmutableSetMultimap 373 * <p>Because an inverse of a set multimap cannot contain multiple pairs with the same key and 380 public ImmutableSetMultimap<V, K> inverse() { method in class:ImmutableSetMultimap 381 ImmutableSetMultimap<V, K> result = inverse; 382 return (result == null) ? (inverse = invert()) : result; 391 invertedMultimap.inverse = this;
|
H A D | ImmutableMultimap.java | 53 * <p>In addition to methods defined by {@link Multimap}, an {@link #inverse} 365 * Returns an immutable multimap which is the inverse of this one. For every 372 public abstract ImmutableMultimap<V, K> inverse(); method in class:ImmutableMultimap
|
H A D | MapConstraints.java | 343 * inverse BiMap could occur after inverse()'s read of the field's initial 344 * null value, leading inverse() to overwrite the existing inverse with a 351 volatile BiMap<V, K> inverse; field in class:MapConstraints.ConstrainedBiMap 353 ConstrainedBiMap(BiMap<K, V> delegate, @Nullable BiMap<V, K> inverse, argument 356 this.inverse = inverse; 370 public BiMap<V, K> inverse() { method in class:MapConstraints.ConstrainedBiMap 371 if (inverse [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
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 | ImmutableMultimap.java | 52 * <p>In addition to methods defined by {@link Multimap}, an {@link #inverse} 355 * Returns an immutable multimap which is the inverse of this one. For every 362 public abstract ImmutableMultimap<V, K> inverse(); method in class:ImmutableMultimap
|
H A D | ImmutableSetMultimap.java | 363 private transient ImmutableSetMultimap<V, K> inverse; field in class:ImmutableSetMultimap 368 * <p>Because an inverse of a set multimap cannot contain multiple pairs with the same key and 375 public ImmutableSetMultimap<V, K> inverse() { method in class:ImmutableSetMultimap 376 ImmutableSetMultimap<V, K> result = inverse; 377 return (result == null) ? (inverse = invert()) : result; 386 invertedMultimap.inverse = this;
|
/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/lib/ |
H A D | backends.h | 100 int (*inverse) (struct vorbis_block *,vorbis_look_residue *, member in struct:__anon24738 128 int (*inverse) (struct vorbis_block *vb,vorbis_info_mapping *); member in struct:__anon24739
|
/external/llvm/lib/IR/ |
H A D | ConstantRange.cpp | 253 return intersectWith(CR.inverse()); 711 ConstantRange ConstantRange::inverse() const { function in class:ConstantRange
|
/external/skia/src/views/ |
H A D | SkWindow.cpp | 81 SkMatrix inverse; local 82 if (!fMatrix.invert(&inverse)) {
|
/external/webp/src/dsp/ |
H A D | alpha_processing.c | 125 static WEBP_INLINE uint32_t GetScale(uint32_t a, int inverse) { argument 126 return kMultTables[!inverse][a]; 131 static WEBP_INLINE uint32_t GetScale(uint32_t a, int inverse) { argument 132 return inverse ? (255u << MFIX) / a : a * KINV_255; 137 static void MultARGBRow(uint32_t* const ptr, int width, int inverse) { argument 146 const uint32_t scale = GetScale(alpha, inverse); 158 int width, int inverse) { 166 const uint32_t scale = GetScale(a, inverse); 177 void (*WebPMultARGBRow)(uint32_t* const ptr, int width, int inverse); 179 int width, int inverse); 157 MultRow(uint8_t* const ptr, const uint8_t* const alpha, int width, int inverse) argument 184 WebPMultARGBRows(uint8_t* ptr, int stride, int width, int num_rows, int inverse) argument 193 WebPMultRows(uint8_t* ptr, int stride, const uint8_t* alpha, int alpha_stride, int width, int num_rows, int inverse) argument [all...] |
/external/webp/src/utils/ |
H A D | filters.c | 32 uint8_t* dst, int length, int inverse) { 34 if (inverse) { 47 int inverse, uint8_t* out) { 54 preds = inverse ? out : in; 59 PredictLine(in + 1, preds, out + 1, width - 1, inverse); 69 PredictLine(in, preds - stride, out, 1, inverse); 70 PredictLine(in + 1, preds, out + 1, width - 1, inverse); 94 int inverse, uint8_t* out) { 101 preds = inverse ? out : in; 107 PredictLine(in + 1, preds, out + 1, width - 1, inverse); 31 PredictLine(const uint8_t* src, const uint8_t* pred, uint8_t* dst, int length, int inverse) argument 44 DoHorizontalFilter(const uint8_t* in, int width, int height, int stride, int row, int num_rows, int inverse, uint8_t* out) argument 91 DoVerticalFilter(const uint8_t* in, int width, int height, int stride, int row, int num_rows, int inverse, uint8_t* out) argument 144 DoGradientFilter(const uint8_t* in, int width, int height, int stride, int row, int num_rows, int inverse, uint8_t* out) argument [all...] |
/external/eigen/Eigen/src/Core/ |
H A D | PermutationMatrix.h | 197 /** \returns the inverse permutation matrix. 201 inline Transpose<PermutationBase> inverse() const function in class:Eigen::PermutationBase 238 /** \returns the product of a permutation with another inverse permutation. 246 /** \returns the product of an inverse permutation with another permutation. 605 /* Template partial specialization for transposed/inverse permutations */ 657 /** \returns the matrix with the inverse permutation applied to the columns. 666 /** \returns the matrix with the inverse permutation applied to the rows.
|
/external/eigen/Eigen/src/Eigen2Support/Geometry/ |
H A D | Quaternion.h | 173 Quaternion inverse(void) const; 368 /** \returns the multiplicative inverse of \c *this 375 inline Quaternion<Scalar> Quaternion<Scalar>::inverse() const function in class:Eigen::Quaternion 377 // FIXME should this function be called multiplicativeInverse and conjugate() be called inverse() or opposite() ?? 388 /** \returns the conjugate of the \c *this which is equal to the multiplicative inverse 392 * \sa Quaternion::inverse()
|
H A D | Transform.h | 245 inline const MatrixType inverse(TransformTraits traits = Affine) const; 687 * \returns the inverse transformation matrix according to some given knowledge 699 * requires the generic inverse method of MatrixBase defined in the LU module. If 702 * \sa MatrixBase::inverse() 706 Transform<Scalar,Dim>::inverse(TransformTraits traits) const function in class:Eigen::Transform 710 return m_matrix.inverse(); 717 res.template corner<Dim,Dim>(TopLeft) = linear().inverse(); 725 ei_assert("invalid traits value in Transform::inverse()");
|
/external/eigen/Eigen/src/LU/ |
H A D | FullPivLU.h | 30 * the rank, invertibility, inverse, kernel, and determinant. 44 * \sa MatrixBase::fullPivLu(), MatrixBase::determinant(), MatrixBase::inverse() 211 * \sa TriangularView::solve(), kernel(), inverse() 356 /** \returns the inverse of the matrix of which *this is the LU decomposition. 361 * \sa MatrixBase::inverse() 363 inline const internal::solve_retval<FullPivLU,typename MatrixType::IdentityReturnType> inverse() const function in class:Eigen::FullPivLU 366 eigen_assert(m_lu.rows() == m_lu.cols() && "You can't take the inverse of a non-square matrix!"); 531 res = m_p.inverse() * res; 534 res = res * m_q.inverse();
|
/external/eigen/Eigen/src/QR/ |
H A D | ColPivHouseholderQR.h | 282 /** \returns the inverse of the matrix of which *this is the QR decomposition. 289 inverse() const function in class:Eigen::ColPivHouseholderQR 540 // Note that the matrix Q = H_0^* H_1^*... so its inverse is Q^* = (H_0 H_1 ...)^T
|
H A D | FullPivHouseholderQR.h | 279 /** \returns the inverse of the matrix of which *this is the QR decomposition. 285 inverse() const function in class:Eigen::FullPivHouseholderQR
|
/external/fio/ |
H A D | parse.h | 67 const char *inverse; /* if set, apply opposite action to this option */ member in struct:fio_option
|
/external/skia/src/effects/ |
H A D | SkBicubicImageFilter.cpp | 117 SkMatrix inverse; local 118 inverse.setRectToRect(dstRect, srcRect, SkMatrix::kFill_ScaleToFit); 119 inverse.postTranslate(-0.5f, -0.5f); 125 inverse.mapPoints(&srcPt, &dstPt, 1);
|
/external/chromium_org/cc/resources/ |
H A D | picture_layer_tiling_unittest.cc | 28 gfx::Transform inverse; local 29 if (!transform.GetInverse(&inverse)) 33 inverse, gfx::RectF(gfx::Point(0, 0), device_viewport));
|