Searched refs:first (Results 1 - 25 of 857) sorted by relevance

1234567891011>>

/external/easymock/src/org/easymock/internal/matchers/
H A DNot.java26 private final IArgumentMatcher first; field in class:Not
28 public Not(IArgumentMatcher first) { argument
29 this.first = first;
33 return !first.matches(actual);
38 first.appendTo(buffer);
/external/elfutils/lib/
H A Dlist.h18 #define CDBL_LIST_ADD_REAR(first, newp) \
23 if (unlikely ((first) == NULL)) \
24 (first) = _newp->next = _newp->previous = _newp; \
27 _newp->next = (first); \
28 _newp->previous = (first)->previous; \
34 #define CDBL_LIST_DEL(first, elem) \
38 assert (first != NULL && _elem != NULL \
39 && (first != elem \
40 || ({ __typeof (elem) _runp = first->next; \
41 while (_runp != first) \
[all...]
H A Ddynamicsizehash.c76 htab->table[idx].next = htab->first;
77 htab->first = &htab->table[idx];
80 if (htab->first == NULL)
81 htab->first = htab->table[idx].next = &htab->table[idx];
84 htab->table[idx].next = htab->first->next;
85 htab->first = htab->first->next = &htab->table[idx];
99 __typeof__ (htab->first) first;
101 __typeof__ (htab->first) run
[all...]
/external/webkit/WebCore/css/
H A DPair.h40 static PassRefPtr<Pair> create(PassRefPtr<CSSPrimitiveValue> first, PassRefPtr<CSSPrimitiveValue> second) argument
42 return adoptRef(new Pair(first, second));
46 CSSPrimitiveValue* first() const { return m_first.get(); } function in class:WebCore::Pair
49 void setFirst(PassRefPtr<CSSPrimitiveValue> first) { m_first = first; } argument
54 Pair(PassRefPtr<CSSPrimitiveValue> first, PassRefPtr<CSSPrimitiveValue> second) argument
55 : m_first(first), m_second(second) { }
/external/qemu/distrib/sdl-1.2.12/src/stdlib/
H A DSDL_qsort.c92 typedef struct { char * first; char * last; } stack_entry; member in struct:__anon4458
93 #define pushLeft {stack[stacktop].first=ffirst;stack[stacktop++].last=last;}
94 #define pushRight {stack[stacktop].first=first;stack[stacktop++].last=llast;}
95 #define doLeft {first=ffirst;llast=last;continue;}
96 #define doRight {ffirst=first;last=llast;continue;}
98 first=ffirst=stack[stacktop].first;\
115 * 3. We choose a pivot by looking at the first, last
169 { size_t l=last-ffirst,r=llast-first; \
264 pivot_big(char *first, char *mid, char *last, size_t size, int compare(const void *, const void *)) argument
307 char *first,*last; local
338 char *first,*last; local
369 char *first,*last; local
[all...]
/external/clearsilver/cs/
H A Dtest_first_last.cs4 is_first: <?cs var:first(num) ?>
10 is_first: <?cs var:first(day) ?>
11 is_first: <?cs var:first(day.Abbr) ?> -> never
16 Only one, so should be first and last
18 is_first: <?cs var:first(test) ?>
25 is_first: <?cs var:first(x) ?>
26 is_first: <?cs var:first(x.foo) ?> -> never
/external/openssl/crypto/asn1/
H A Dt_x509a.c70 char oidstr[80], first; local
74 first = 1;
78 if(!first) BIO_puts(out, ", ");
79 else first = 0;
87 first = 1;
91 if(!first) BIO_puts(out, ", ");
92 else first = 0;
H A Dt_bitst.c68 char first = 1; local
72 if(!first) BIO_puts(out, ", ");
74 first = 0;
/external/v8/test/mjsunit/
H A Dcyrillic.js34 first: "\u0430", // a
49 first: "\u03b1", // alpha
69 var first = lc ? chars.first : chars.FIRST;
72 var first_other_case = lc ? chars.FIRST : chars.first;
76 assertTrue(Range(first, last).test(first), 1);
77 assertTrue(Range(first, last).test(middle), 2);
78 assertTrue(Range(first, last).test(last), 3);
80 assertFalse(Range(first, las
[all...]
/external/stlport/test/unit/
H A Dalg_test.cpp229 vector<int>::iterator first; local
230 first = find_first_of(intv.begin(), intv.end(), intsl.begin(), intsl.end());
231 CPPUNIT_ASSERT( first != intv.end() );
232 CPPUNIT_ASSERT( *first == 1 );
241 vector<int>::iterator first; local
242 first = find_first_of(intv.begin(), intv.end(), intsl.begin(), intsl.end());
243 CPPUNIT_ASSERT( first != intv.end() );
244 CPPUNIT_ASSERT( *first == 2 );
259 vector<int>::iterator first; local
260 first
271 vector<int>::iterator first; local
285 vector<int>::iterator first; local
299 vector<int>::iterator first; local
314 vector<int>::iterator first; local
328 vector<MyIntComparable>::iterator first; local
[all...]
H A Dmismatch_test.cpp45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5));
48 CPPUNIT_ASSERT(!(result.first ==(n1 + 5) && result.second ==(n3 + 5)));
49 CPPUNIT_ASSERT((result.first - n1)==3);
60 CPPUNIT_ASSERT(result.first == v1.end() && result.second == v2.end());
64 CPPUNIT_ASSERT(!(result.first == v1.end() && result.second == v2.end()));
65 CPPUNIT_ASSERT((result.first - v1.begin())==5);
76 CPPUNIT_ASSERT(result.first == n1 + size && result.second == n2 + size);
80 CPPUNIT_ASSERT(!(result.first == n2 + size && result.second == n2 + size));
81 CPPUNIT_ASSERT((result.first - n1)==2);
/external/skia/src/core/
H A DSkDeque.cpp112 Head* first = fFront; local
115 if (NULL == first->fBegin) {
117 first->fEnd = first->fStop;
118 begin = first->fStop - fElemSize;
120 begin = first->fBegin - fElemSize;
121 if (begin < first->start()) { // no more room in this chunk
125 first = (Head*)sk_malloc_throw(size);
126 first->init(size);
127 first
178 Head* first = fFront; local
[all...]
/external/e2fsprogs/lib/e2p/
H A Dpf.c55 int first = 1; local
60 if (first)
61 first = 0;
72 if (long_opt && first)
/external/webkit/JavaScriptCore/tests/mozilla/js1_2/Array/
H A Dsplice1.js43 function mySplice(testArray, splicedArray, first, len, elements)
46 var adjustedFirst = first;
49 if (adjustedFirst < 0) adjustedFirst = testArray.length + first;
78 for (var first = -(testArray.length+2); first <= 2 + testArray.length; first++)
93 actualRemoved = actualSpliced.splice(first,len);
94 expectedRemoved = mySplice(testArray,expectedSpliced,first,len,[]);
96 var adjustedFirst = first;
97 if (adjustedFirst < 0) adjustedFirst = testArray.length + first;
[all...]
H A Dsplice2.js43 function mySplice(testArray, splicedArray, first, len, elements)
46 var adjustedFirst = first;
49 if (adjustedFirst < 0) adjustedFirst = testArray.length + first;
74 for (var first = -(testArray.length+2); first <= 2 + testArray.length; first++)
89 actualRemoved = actualSpliced.splice(first,len,-97,new String("test arg"),[],9.8);
90 expectedRemoved = mySplice(testArray,expectedSpliced,first,len,[-97,new String("test arg"),[],9.8]);
92 var adjustedFirst = first;
93 if (adjustedFirst < 0) adjustedFirst = testArray.length + first;
[all...]
/external/astl/tests/
H A Dtest_set.cpp64 EXPECT_TRUE(res.first == s.begin());
66 EXPECT_TRUE(*(res.first) == 10);
67 set<int>::iterator elt_in_set = res.first;
83 EXPECT_TRUE(res.first == elt_in_set);
103 EXPECT_TRUE(res.first == s.begin());
104 set<string>::iterator marker = res.first;
106 EXPECT_TRUE(*(res.first) == str);
123 EXPECT_TRUE(res.first == marker);
/external/chromium/third_party/icu/source/tools/genprops/misc/
H A Ducdmerge.c35 /* return the first character position after the end of the data */
58 /* find the first semicolon in each line - there must be one */
75 long first, last, c; local
78 first=last=-1;
98 if(first==last) {
107 first, last, /* code point range */
108 strchr(firstLine, ';'));/* first line starting from the first ; */
110 /* no comment in first line */
112 first, las
[all...]
/external/icu4c/tools/genprops/misc/
H A Ducdmerge.c35 /* return the first character position after the end of the data */
58 /* find the first semicolon in each line - there must be one */
75 long first, last, c; local
78 first=last=-1;
98 if(first==last) {
107 first, last, /* code point range */
108 strchr(firstLine, ';'));/* first line starting from the first ; */
110 /* no comment in first line */
112 first, las
[all...]
/external/icu4c/tools/genprops/
H A Ducdmerge.c35 /* return the first character position after the end of the data */
58 /* find the first semicolon in each line - there must be one */
75 long first, last, c; local
78 first=last=-1;
98 if(first==last) {
107 first, last, /* code point range */
108 strchr(firstLine, ';'));/* first line starting from the first ; */
110 /* no comment in first line */
112 first, las
[all...]
/external/webkit/WebCore/bridge/
H A DIdentifierRep.cpp71 ASSERT(!result.first->second);
72 result.first->second = new IdentifierRep(intID);
74 identifierSet().add(result.first->second);
77 return result.first->second;
97 ASSERT(!result.first->second);
98 result.first->second = new IdentifierRep(name);
100 identifierSet().add(result.first->second);
103 return result.first->second;
/external/webkit/WebKitTools/android/flex-2.5.4a/
H A Dnfa.c281 * new = link_machines( first, last );
283 * new - a machine constructed by connecting first to last
284 * first - the machine whose successor is to be last
285 * last - the machine whose predecessor is to be first
287 * note: this routine concatenates the machine first with the machine
288 * last to produce a machine new which will pattern-match first first
293 int link_machines( first, last )
294 int first, last;
296 if ( first
[all...]
/external/icu4c/common/
H A Dfilterednormalizer2.cpp85 FilteredNormalizer2::normalizeSecondAndAppend(UnicodeString &first, argument
88 return normalizeSecondAndAppend(first, second, TRUE, errorCode);
92 FilteredNormalizer2::append(UnicodeString &first, argument
95 return normalizeSecondAndAppend(first, second, FALSE, errorCode);
99 FilteredNormalizer2::normalizeSecondAndAppend(UnicodeString &first, argument
103 uprv_checkCanGetBuffer(first, errorCode);
106 return first;
108 if(&first==&second) {
110 return first;
112 if(first
[all...]
/external/elfutils/libebl/
H A Deblmachineflagname.c38 int first = 1; local
44 if (! first)
68 first = 0;
/external/protobuf/java/src/main/java/com/google/protobuf/
H A DUninitializedMessageException.java88 boolean first = true;
90 if (first) {
91 first = false;
/external/stlport/src/
H A Dnum_put.cpp28 // space in the buffer to extend the number past [first, last).
31 __insert_grouping_aux(Char* first, Char* last, const string& grouping, argument
36 if (first == last)
41 if (*first == Plus || *first == Minus) {
43 ++first;
46 first += basechars;
57 if ((groupsize <= 0) || (groupsize >= cur_group - first) || (groupsize == CHAR_MAX)) {
68 return (last - first) + sign + basechars;
135 __insert_grouping(char * first, cha argument
149 __insert_grouping(wchar_t* first, wchar_t* last, const string& grouping, wchar_t separator, wchar_t Plus, wchar_t Minus, int basechars) argument
[all...]

Completed in 488 milliseconds

1234567891011>>