HomeSort by relevance Sort by last modified time
    Searched refs:fArray (Results 1 - 25 of 49) sorted by null

1 2

  /external/skia/src/core/
SkTDPQueue.h 33 SkTDPQueue(int reserve) { fArray.setReserve(reserve); }
42 int count() const { return fArray.count(); }
45 const T& peek() const { return fArray[0]; }
46 T& peek() { return fArray[0]; }
51 SkDEBUGCODE(if (SkToBool(INDEX)) { *INDEX(fArray[0]) = -1; })
52 if (1 == fArray.count()) {
53 fArray.pop();
57 fArray[0] = fArray[fArray.count() - 1]
    [all...]
SkPictureFlat.cpp 20 fArray.reset(new sk_sp<SkTypeface>[count]);
SkTDynamicHash.h 25 SkTDynamicHash() : fCount(0), fDeleted(0), fCapacity(0), fArray(nullptr) {
30 sk_free(fArray);
54 T* current() const { return fHash->fArray[fCurrentIndex]; }
81 const T* current() const { return fHash->fArray[fCurrentIndex]; }
94 T* candidate = fArray[index];
123 if (fArray) {
124 sk_bzero(fArray, sizeof(T*)* fCapacity);
134 sk_free(fArray);
135 fArray = nullptr;
148 const T* candidate = fArray[index]
    [all...]
SkPictureFlat.h 170 SkTypefacePlayback() : fCount(0), fArray(nullptr) {}
179 return fArray[index];
183 buffer.setTypefaceArray(fArray.get(), fCount);
188 std::unique_ptr<sk_sp<SkTypeface>[]> fArray;
193 SkFactoryPlayback(int count) : fCount(count) { fArray = new SkFlattenable::Factory[count]; }
195 ~SkFactoryPlayback() { delete[] fArray; }
197 SkFlattenable::Factory* base() const { return fArray; }
200 buffer.setFactoryPlayback(fArray, fCount);
205 SkFlattenable::Factory* fArray;
  /external/skqp/src/core/
SkTDPQueue.h 33 SkTDPQueue(int reserve) { fArray.setReserve(reserve); }
42 int count() const { return fArray.count(); }
45 const T& peek() const { return fArray[0]; }
46 T& peek() { return fArray[0]; }
51 SkDEBUGCODE(if (SkToBool(INDEX)) { *INDEX(fArray[0]) = -1; })
52 if (1 == fArray.count()) {
53 fArray.pop();
57 fArray[0] = fArray[fArray.count() - 1]
    [all...]
SkPictureFlat.cpp 20 fArray.reset(new sk_sp<SkTypeface>[count]);
SkTDynamicHash.h 25 SkTDynamicHash() : fCount(0), fDeleted(0), fCapacity(0), fArray(nullptr) {
30 sk_free(fArray);
54 T* current() const { return fHash->fArray[fCurrentIndex]; }
81 const T* current() const { return fHash->fArray[fCurrentIndex]; }
94 T* candidate = fArray[index];
123 if (fArray) {
124 sk_bzero(fArray, sizeof(T*)* fCapacity);
134 sk_free(fArray);
135 fArray = nullptr;
148 const T* candidate = fArray[index]
    [all...]
SkPictureFlat.h 168 SkTypefacePlayback() : fCount(0), fArray(nullptr) {}
177 return fArray[index];
181 buffer.setTypefaceArray(fArray.get(), fCount);
186 std::unique_ptr<sk_sp<SkTypeface>[]> fArray;
191 SkFactoryPlayback(int count) : fCount(count) { fArray = new SkFlattenable::Factory[count]; }
193 ~SkFactoryPlayback() { delete[] fArray; }
195 SkFlattenable::Factory* base() const { return fArray; }
198 buffer.setFactoryPlayback(fArray, fCount);
203 SkFlattenable::Factory* fArray;
  /external/skia/include/private/
SkTDArray.h 21 SkTDArray() : fArray(nullptr), fReserve(0), fCount(0) {}
26 fArray = nullptr;
28 fArray = (T*)sk_malloc_throw(count * sizeof(T));
29 memcpy(fArray, src, sizeof(T) * count);
34 SkTDArray(const SkTDArray<T>& src) : fArray(nullptr), fReserve(0), fCount(0) {
35 SkTDArray<T> tmp(src.fArray, src.fCount);
38 SkTDArray(SkTDArray<T>&& src) : fArray(nullptr), fReserve(0), fCount(0) {
42 sk_free(fArray);
48 SkTDArray<T> tmp(src.fArray, src.fCount);
51 sk_careful_memcpy(fArray, src.fArray, sizeof(T) * src.fCount)
    [all...]
SkTemplates.h 79 fArray.reset(new T[count]);
84 SkAutoTArray(SkAutoTArray&& other) : fArray(std::move(other.fArray)) {
89 fArray = std::move(other.fArray);
101 T* get() const { return fArray.get(); }
107 return fArray[index];
111 std::unique_ptr<T[]> fArray;
126 fArray = nullptr;
133 fArray = nullptr
    [all...]
  /external/skqp/include/private/
SkTDArray.h 21 SkTDArray() : fArray(nullptr), fReserve(0), fCount(0) {}
26 fArray = nullptr;
28 fArray = (T*)sk_malloc_throw(count * sizeof(T));
29 memcpy(fArray, src, sizeof(T) * count);
34 SkTDArray(const SkTDArray<T>& src) : fArray(nullptr), fReserve(0), fCount(0) {
35 SkTDArray<T> tmp(src.fArray, src.fCount);
38 SkTDArray(SkTDArray<T>&& src) : fArray(nullptr), fReserve(0), fCount(0) {
42 sk_free(fArray);
48 SkTDArray<T> tmp(src.fArray, src.fCount);
51 sk_careful_memcpy(fArray, src.fArray, sizeof(T) * src.fCount)
    [all...]
SkTemplates.h 79 fArray.reset(new T[count]);
84 SkAutoTArray(SkAutoTArray&& other) : fArray(std::move(other.fArray)) {
89 fArray = std::move(other.fArray);
101 T* get() const { return fArray.get(); }
107 return fArray[index];
111 std::unique_ptr<T[]> fArray;
126 fArray = nullptr;
133 fArray = nullptr
    [all...]
  /external/skia/bench/
ScalarBench.cpp 56 init9(fArray);
63 junk ^= (fArray[6] != 0.0f || fArray[7] != 0.0f || fArray[8] != 1.0f);
64 junk ^= (fArray[2] != 0.0f || fArray[5] != 0.0f);
67 float fArray[9];
75 init9(fArray);
82 junk ^= (SkScalarAs2sCompliment(fArray[6]) |
83 SkScalarAs2sCompliment(fArray[7])
    [all...]
MatrixBench.cpp 100 fArray[0] = (float) fRnd.nextS();
101 fArray[1] = (float) fRnd.nextS();
102 fArray[2] = (float) fRnd.nextS();
103 fArray[3] = (float) fRnd.nextS();
104 fArray[4] = (float) fRnd.nextS();
105 fArray[5] = (float) fRnd.nextS();
106 fArray[6] = (float) fRnd.nextS();
107 fArray[7] = (float) fRnd.nextS();
108 fArray[8] = (float) fRnd.nextS();
115 fMatrix.setAll(fArray[0], fArray[1], fArray[2]
    [all...]
  /external/skqp/bench/
ScalarBench.cpp 56 init9(fArray);
63 junk ^= (fArray[6] != 0.0f || fArray[7] != 0.0f || fArray[8] != 1.0f);
64 junk ^= (fArray[2] != 0.0f || fArray[5] != 0.0f);
67 float fArray[9];
75 init9(fArray);
82 junk ^= (SkScalarAs2sCompliment(fArray[6]) |
83 SkScalarAs2sCompliment(fArray[7])
    [all...]
MatrixBench.cpp 100 fArray[0] = (float) fRnd.nextS();
101 fArray[1] = (float) fRnd.nextS();
102 fArray[2] = (float) fRnd.nextS();
103 fArray[3] = (float) fRnd.nextS();
104 fArray[4] = (float) fRnd.nextS();
105 fArray[5] = (float) fRnd.nextS();
106 fArray[6] = (float) fRnd.nextS();
107 fArray[7] = (float) fRnd.nextS();
108 fArray[8] = (float) fRnd.nextS();
115 fMatrix.setAll(fArray[0], fArray[1], fArray[2]
    [all...]
  /external/skia/samplecode/
SampleHT.cpp 127 Rec fArray[N];
137 fArray[i].fDrawable = new HTDrawable(rand);
138 canvas->drawDrawable(fArray[i].fDrawable);
139 fArray[i].fDrawable->unref();
160 fArray[i].fDrawable->setTime(fTime);
168 if (fArray[i].fDrawable->hitTest(x, y)) {
169 fArray[i].fDrawable->spawnAnimation(fTime);
  /external/skqp/samplecode/
SampleHT.cpp 127 Rec fArray[N];
137 fArray[i].fDrawable = new HTDrawable(rand);
138 canvas->drawDrawable(fArray[i].fDrawable);
139 fArray[i].fDrawable->unref();
160 fArray[i].fDrawable->setTime(fTime);
168 if (fArray[i].fDrawable->hitTest(x, y)) {
169 fArray[i].fDrawable->spawnAnimation(fTime);
  /cts/tests/tests/graphics/src/android/graphics/cts/
ColorMatrixTest.java 87 float[] fArray = new float[] {
94 mColorMatrix.set(fArray);
96 assertArrayEquals(fArray, ret, 0.0f);
104 float[] fArray = new float[] {
111 mColorMatrix.set(new ColorMatrix(fArray));
113 assertArrayEquals(fArray, ret, 0.0f);
  /external/skia/tests/
SerialProcsTest.cpp 108 SkTDArray<SkPicture*> fArray;
117 *c->fArray.append() = pic;
128 int index = c->fArray.find(pic);
130 c->fArray.removeShuffle(index);
144 REPORTER_ASSERT(reporter, ctx.fArray.count() == count);
147 REPORTER_ASSERT(reporter, ctx.fArray.count() == 0);
  /external/skqp/tests/
SerialProcsTest.cpp 108 SkTDArray<SkPicture*> fArray;
117 *c->fArray.append() = pic;
128 int index = c->fArray.find(pic);
130 c->fArray.removeShuffle(index);
144 REPORTER_ASSERT(reporter, ctx.fArray.count() == count);
147 REPORTER_ASSERT(reporter, ctx.fArray.count() == 0);
  /external/libchrome/mojo/public/java/system/javatests/src/org/chromium/mojo/bindings/
BindingsVersioningTest.java 49 struct.fArray = new byte[] {10, 9, 8};
108 v5.fArray = new byte[] {10, 9, 8};
113 expected.fArray = new byte[] {10, 9, 8};
127 v7.fArray = new byte[] {10, 9, 8};
136 expected.fArray = new byte[] {10, 9, 8};
193 expected.fArray = new byte[] {10, 9, 8};
206 expected.fArray = new byte[] {10, 9, 8};
  /external/skia/tools/bookmaker/
parserCommon.h 260 const skjson::ArrayValue* fArray;
274 fArrayIter = fArray ? fArray->begin() : nullptr;
279 if (fArray) {
280 return fArrayIter == fArray->end();
  /external/icu/icu4c/source/tools/gennorm2/
norms.h 39 UChar32 charAt(int32_t i) const { return fArray[i]>>8; }
40 uint8_t ccAt(int32_t i) const { return (uint8_t)fArray[i]; }
47 int32_t fArray[Normalizer2Impl::MAPPING_LENGTH_MASK];
  /external/icu/icu4c/source/i18n/
fmtable.cpp 203 fValue.fArrayAndCount.fArray = createArrayCopy(arrayToCopy, count);
236 fValue.fArrayAndCount.fArray = createArrayCopy(source.fValue.fArrayAndCount.fArray,
311 if (fValue.fArrayAndCount.fArray[i] != that.fValue.fArrayAndCount.fArray[i]) {
347 delete[] fValue.fArrayAndCount.fArray;
591 fValue.fArrayAndCount.fArray = createArrayCopy(array, count);
614 fValue.fArrayAndCount.fArray = array;
682 return fValue.fArrayAndCount.fArray;

Completed in 1582 milliseconds

1 2