OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:fFirst
(Results
1 - 10
of
10
) sorted by null
/external/chromium_org/third_party/skia/include/core/
SkPathEffect.h
95
SkPath
fFirst
; // If not empty, contains geometry for first point
/external/chromium_org/third_party/skia/src/gpu/gl/
GrGLNameAllocator.cpp
13
* names within the half-open range [
fFirst
, fEnd). The inner nodes can be
15
* but the bounds are tight, so
fFirst
*is* guaranteed to be allocated, and so
27
GrGLuint first() const { return
fFirst
; }
50
* range [
fFirst
, fEnd).
98
* the very beginning or very end of the range, the boundaries [
fFirst
, fEnd)
117
GrGLuint
fFirst
;
181
SkASSERT(
fFirst
> count); // We can't allocate at or below 0.
183
SkASSERT(fLeft->first() ==
fFirst
- count);
261
fFirst
= fLeft->first();
278
fFirst
= first
[
all
...]
/external/skia/include/core/
SkPathEffect.h
95
SkPath
fFirst
; // If not empty, contains geometry for first point
/external/skia/src/gpu/gl/
GrGLNameAllocator.cpp
13
* names within the half-open range [
fFirst
, fEnd). The inner nodes can be
15
* but the bounds are tight, so
fFirst
*is* guaranteed to be allocated, and so
27
GrGLuint first() const { return
fFirst
; }
50
* range [
fFirst
, fEnd).
98
* the very beginning or very end of the range, the boundaries [
fFirst
, fEnd)
117
GrGLuint
fFirst
;
181
SkASSERT(
fFirst
> count); // We can't allocate at or below 0.
183
SkASSERT(fLeft->first() ==
fFirst
- count);
261
fFirst
= fLeft->first();
278
fFirst
= first
[
all
...]
/external/chromium_org/third_party/icu/source/tools/genrb/
reslist.h
109
struct SResource *
fFirst
;
118
struct SResource *
fFirst
;
/external/icu/icu4c/source/tools/genrb/
reslist.h
107
struct SResource *
fFirst
;
116
struct SResource *
fFirst
;
/external/stlport/test/eh/
test_insert.h
500
:
fFirst
( first ),
520
// prepare_insert_range( c, fPos,
fFirst
, fLast );
521
do_insert_range( c, fPos,
fFirst
, fLast, container_category(c) );
526
VerifyInsertion( original, c,
fFirst
, fLast, fPos );
529
Iter
fFirst
, fLast;
/external/chromium_org/third_party/icu/source/i18n/
zstrfmt.h
519
ZSFCacheEntry *
fFirst
;
/external/chromium_org/third_party/skia/src/gpu/
GrRedBlackTree.h
177
Node*
fFirst
;
228
fFirst
= NULL;
241
return Iter(
fFirst
, this);
337
fFirst
= NULL;
376
fFirst
= x;
599
SkASSERT(
fFirst
!= x);
624
} else if (x ==
fFirst
) {
626
fFirst
= fRoot;
629
SkASSERT(
fFirst
== fLast && x ==
fFirst
);
[
all
...]
/external/skia/src/gpu/
GrRedBlackTree.h
177
Node*
fFirst
;
228
fFirst
= NULL;
241
return Iter(
fFirst
, this);
337
fFirst
= NULL;
376
fFirst
= x;
599
SkASSERT(
fFirst
!= x);
624
} else if (x ==
fFirst
) {
626
fFirst
= fRoot;
629
SkASSERT(
fFirst
== fLast && x ==
fFirst
);
[
all
...]
Completed in 462 milliseconds