| /external/fio/lib/ |
| prio_tree.c | 78 struct prio_tree_node *first = NULL, *prev, *last = NULL; local
89 if (first == NULL) {
90 first = root->prio_tree_node;
92 INIT_PRIO_TREE_NODE(first);
93 last = first;
106 if (first) {
107 node->left = first;
108 first->parent = node;
395 * Get the first prio_tree_node that overlaps with the interval [radix_index,
|
| /external/freetype/src/cache/ |
| ftccmap.c | 73 FT_UInt32 first; /* first character in node */ member in struct:FTC_CMapNodeRec_
124 node->first = (query->char_code / FTC_CMAP_INDICES_MAX) *
165 FT_UInt32 offset = (FT_UInt32)( query->char_code - node->first );
280 FT_ASSERT( (FT_UInt)( char_code - FTC_CMAP_NODE( node )->first ) <
284 if ( (FT_UInt)( char_code - FTC_CMAP_NODE( node )->first >=
289 FTC_CMAP_NODE( node )->first];
321 FTC_CMAP_NODE( node )->first]
|
| /external/google-breakpad/src/client/ |
| minidump_file_writer_unittest.cc | 80 const char *first = "First String"; local
81 ASSERT_TRUE(writer.WriteString(first, 0, &strings.get()->first_string));
|
| /external/guava/guava/src/com/google/common/collect/ |
| EmptyContiguousSet.java | 37 @Override public C first() { method in class:EmptyContiguousSet
|
| Lists.java | 287 // We copy elements to an ArrayList first, rather than incurring the
296 * Returns an unmodifiable list containing the specified first element and
307 * @param first the first element
311 public static <E> List<E> asList(@Nullable E first, E[] rest) {
312 return new OnePlusArrayList<E>(first, rest);
318 final E first; field in class:Lists.OnePlusArrayList
321 OnePlusArrayList(@Nullable E first, E[] rest) {
322 this.first = first;
361 final E first; field in class:Lists.TwoPlusArrayList
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| Lists.java | 262 * Returns an unmodifiable list containing the specified first element and
273 * @param first the first element
277 public static <E> List<E> asList(@Nullable E first, E[] rest) {
278 return new OnePlusArrayList<E>(first, rest);
284 final E first; field in class:Lists.OnePlusArrayList
287 OnePlusArrayList(@Nullable E first, E[] rest) {
288 this.first = first;
297 return (index == 0) ? first : rest[index - 1]
327 final E first; field in class:Lists.TwoPlusArrayList
[all...] |
| RegularContiguousSet.java | 68 return new AbstractSequentialIterator<C>(first()) {
86 @Override public C first() { method
95 long distance = domain.distance(first(), last());
124 C lowerEndpoint = Ordering.natural().max(this.first(), other.first());
147 return this.first().equals(that.first())
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
| SortedSetNavigationTester.java | 68 sortedSet.first();
85 assertEquals(a, sortedSet.first());
95 assertEquals(a, sortedSet.first());
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| SynchronizedNavigableSetTest.java | 138 @Override public E first() { method in class:SynchronizedNavigableSetTest.TestSet
140 return delegate().first();
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| PluralRanges.java | 93 StandardPlural first = null; local
99 if (first == null) {
100 first = item;
103 if (first != item) {
107 return first;
117 StandardPlural first = null; local
123 if (first == null) {
124 first = item;
127 if (first != item) {
135 return first;
[all...] |
| /external/icu/icu4c/source/common/ |
| normlzr.cpp | 299 * Return the first character in the normalized text. This resets
302 UChar32 Normalizer::first() { function in class:Normalizer
|
| uchriter.cpp | 96 UCharCharacterIterator::first() { function in class:UCharCharacterIterator
|
| /external/icu/icu4c/source/i18n/ |
| search.cpp | 198 int32_t SearchIterator::first(UErrorCode &status) function in class:SearchIterator
|
| /external/icu/icu4j/eclipse-build/plugins.template/com.ibm.icu.base/src/com/ibm/icu/text/ |
| BreakIterator.java | 51 * has a concept of a "current position" and methods like first(), last(), next(),
63 * them. Thus, under normal circumstances, the position before the first character
64 * is 0, the position after the first character is 1, and the position after the
109 * int start = boundary.first();
133 * Print first element
137 * int start = boundary.first();
241 * Return the first boundary position. This is always the beginning
250 public abstract int first(); method in class:BreakIterator
287 * @return The position of the first boundary position following the
297 * the current position is equal to the value returned by first(), or t
758 public int first() { method in class:BreakIterator.BreakIteratorHandle
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| PluralRanges.java | 91 StandardPlural first = null; local
97 if (first == null) {
98 first = item;
101 if (first != item) {
105 return first;
115 StandardPlural first = null; local
121 if (first == null) {
122 first = item;
125 if (first != item) {
133 return first;
[all...] |
| /external/jacoco/org.jacoco.core/src/org/jacoco/core/internal/flow/ |
| LabelFlowAnalyzer.java | 51 * <code>true</code> for the very first instruction only. Accessible for
54 boolean first = true; field in class:LabelFlowAnalyzer
88 first = false;
93 if (first) {
126 first = false;
154 first = false;
160 first = false;
166 first = false;
172 first = false;
179 first = false
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/data/ |
| ChainedData.java | 30 * Note: If you have elements foo.1, foo.2, foo.3 in first Data object and foo.4, foo.5, foo.6 in
31 * second Data object, then fetching children of foo will return only foo.1 foo.2 foo.3 from first
73 Data first = dataList[0]; local
74 if (first == null) {
77 return first;
84 Data first = dataList.get(0); local
85 if (first == null) {
88 return first;
94 Data first = null; local
99 // If not in debug mode just return the first match. This assumes we are using the ne
[all...] |
| /external/libvncserver/client_examples/ |
| vnc2mpg.c | 318 static rfbBool first=TRUE; local
319 if(!first) {
|
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pt.c | 67 unsigned first, incr; local
68 draw_pt_split_prim(prim, &first, &incr);
69 count = draw_pt_trim_count(count, first, incr);
70 if (count < first)
115 * lines are active but first drawn with triangles and then with
220 * Debug- print the first 'count' vertices.
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_debug_symbol.c | 223 static boolean first = TRUE; local
225 if (first) {
227 first = FALSE;
|
| /external/mesa3d/src/gallium/auxiliary/vl/ |
| vl_matrix_filter.c | 87 bool first; local
127 for (i = 0, first = true; i < num_offsets; ++i) {
129 if (first) {
133 first = false;
139 if (first)
|
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_test_format.c | 137 boolean first = TRUE; local
154 if (first) {
157 first = FALSE;
222 boolean first = TRUE; local
239 if (first) {
242 first = FALSE;
|
| /external/mesa3d/src/gallium/winsys/svga/drm/ |
| vmw_screen_svga.c | 237 int numCaps, first, last; local
270 for (first = 0, last = numCaps - 1; first <= last; ) {
271 int mid = (first + last) / 2;
287 first = mid + 1;
|
| /external/mesa3d/src/mesa/drivers/dri/intel/ |
| intel_pixel_bitmap.c | 115 GLint first, last; local
123 first = h-1;
128 first = 0;
135 for (row = first; row != (last+incr); row += incr) {
|
| /external/mesa3d/src/mesa/main/ |
| arbprogram.c | 221 GLuint first; local
234 first = _mesa_HashFindFreeKeyBlock(ctx->Shared->Programs, n);
238 _mesa_HashInsert(ctx->Shared->Programs, first + i, &_mesa_DummyProgram);
243 ids[i] = first + i;
359 /* The first couple cases are complicated. The same enum value is used for
|
