/external/opencv3/3rdparty/openexr/IlmImf/ |
ImfOutputFile.cpp | 330 int startY, endY; // The first and last scanlines in 478 // First copy the pixel data from the 922 int first = (_data->currentScanLine - _data->minY) / local 925 int nextWriteBuffer = first; 957 last - first + 1), 963 (new LineBufferTask (&taskGroup, _data, first + i, 967 nextCompressBuffer = first + numTasks; 980 first - last + 1), 986 (new LineBufferTask (&taskGroup, _data, first - i, 990 nextCompressBuffer = first - numTasks [all...] |
/external/opencv3/modules/imgproc/src/ |
segmentation.cpp | 62 WSQueue() { first = last = 0; } 63 int first, last; member in struct:cv::WSQueue 131 q[idx].first = node; \ 138 node = q[idx].first; \ 139 q[idx].first = storage[node].next; \ 223 // find the first non-empty queue 225 if( q[i].first ) 246 if( q[active_queue].first == 0 ) 249 if( q[i].first )
|
/external/pdfium/third_party/freetype/src/cff/ |
cffload.c | 420 " invalid first offset value %d set to zero\n", 729 /* first, compare to the cache */ 742 FT_UInt first, limit; local 745 first = FT_NEXT_USHORT( p ); 748 if ( glyph_index < first ) 759 fdselect->cache_first = first; 760 fdselect->cache_count = limit - first; 764 first = limit; 921 /* Read the first glyph sid of the range. */ 966 /* the first num_glyphs. * [all...] |
/external/pdfium/xfa/src/fxbarcode/qrcode/ |
BC_QRCoderEncoder.cpp | 257 Make_Pair* first = NULL;
local 262 first = (Make_Pair*)result[i];
264 if (first->m_mode == CBC_QRCoderMode::sALPHANUMERIC) {
269 (first->m_string.GetLength() < tmp)) {
270 CFX_ByteString str = first->m_string + second->m_string;
272 delete first;
277 } else if (first->m_mode == CBC_QRCoderMode::sBYTE) {
279 first->m_string += second->m_string;
285 } else if (first->m_mode == CBC_QRCoderMode::sNUMERIC) {
290 (first->m_string.GetLength() < tmp)) { [all...] |
/external/ppp/pppd/ |
tty.c | 167 /* device name must be first, or change connect_tty() below! */ 385 int first = 1; local 391 if (!first) 394 first = 0; 398 if (first) 556 * First we open it in non-blocking mode so we can set the [all...] |
/external/robolectric/v1/src/test/java/com/xtremelabs/robolectric/shadows/ |
ContentResolverTest.java | 286 PeriodicSync first = syncs.get(0); local 287 assertThat(first.account, equalTo(a)); 288 assertThat(first.authority, equalTo(AUTHORITY)); 289 assertThat(first.period, equalTo(6000l)); 290 assertNotNull(first.extras);
|
/external/skia/src/gpu/ |
GrPathUtils.cpp | 166 bool first = true; local 194 if (!first) { 201 first = false; 252 // first row 358 // a is the first control point of the cubic.
|
/external/skia/src/gpu/batches/ |
GrDefaultPathRenderer.cpp | 91 // stencil. First we draw the front faces and inc, then we draw the back faces 147 // buffer without having to first resolve the interior / exterior. 198 // first pt of quad is the pt we ended on in previous step 450 bool first = true; local 460 if (!first) { 494 // first pt of cubic is the pt we ended on in previous step 513 first = false;
|
/external/snakeyaml/src/main/java/org/yaml/snakeyaml/constructor/ |
SafeConstructor.java | 184 char first = value.charAt(0); local 185 if (first == '-') { 188 } else if (first == '+') { 240 char first = value.charAt(0); local 241 if (first == '-') { 244 } else if (first == '+') {
|
/external/svox/pico/lib/ |
picosa.c | 103 previous punc-phrase, then BOUND item output as first item 153 all but the first will be treated as an (empty) phrase containing just this item. 162 first one) from right-to-left. The boundary types mark the phrase 519 picoos_int32 first; /* index of first item with POS(es) */ local 530 first = 0; 532 while ((first < sa->headxLen) && 533 (sa->headx[first].head.type != PICODATA_ITEM_WORDGRAPH) && 534 (sa->headx[first].head.type != PICODATA_ITEM_WORDINDEX) && 535 (sa->headx[first].head.type != PICODATA_ITEM_WORDPHON)) [all...] |
/external/v8/src/compiler/arm/ |
code-generator-arm.cc | 1118 uint32_t first = base::bits::CountTrailingZeros32(saves_fp); local 1154 uint32_t first = base::bits::CountTrailingZeros32(saves_fp); local [all...] |
/external/v8/src/compiler/ |
instruction.cc | 320 bool first = true; local 323 if (!first) os << " "; 324 first = false; 342 bool first = true; local 347 if (!first) { 350 first = false; 901 os << "CST#" << i << ": v" << it->first << " = " << it->second << "\n";
|
/external/v8/src/regexp/ |
regexp-parser.cc | 886 uc32 first = current(); local 887 if (first == '\\') { 907 return CharacterRange::Singleton(first); 943 CharacterRange first = ParseClassAtom(&char_class CHECK_FAILED); local 951 AddRangeOrEscape(ranges, char_class, first, zone()); 959 AddRangeOrEscape(ranges, char_class, first, zone()); 964 if (first.from() > next.to()) { 967 ranges->Add(CharacterRange::Range(first.from(), next.to()), zone()); 969 AddRangeOrEscape(ranges, char_class, first, zone()); [all...] |
/external/valgrind/coregrind/ |
m_options.c | 318 executable itself; iow child_argv[0] must be the first arg, if any, 333 // Otherwise, look for other reasons to say NO. First, 342 HChar const* first = consume_commas(last); local 343 last = consume_field(first); 344 if (first == last) 346 vg_assert(last > first); 349 patt = VG_(calloc)("m_options.swttc.1", last - first + 1, 1); 350 VG_(memcpy)(patt, first, last - first); 351 vg_assert(patt[last-first] == 0) 367 HChar const* first = consume_commas(last); local [all...] |
/external/webp/src/dec/ |
vp8.c | 116 return 0; // first frame is invisible! 462 int first; local 477 first = 1; 480 first = 0; 491 const int nz = GetCoeffs(token_br, ac_proba, ctx, q->y1_mat_, first, dst); 492 l = (nz > first);
|
/external/webrtc/talk/media/sctp/ |
sctpdataengine.cc | 50 bool first = true; local 52 if (!first) { 56 first = false; 66 bool first = true; local 67 // Skip past the first 12 chars (strlen("SCTP_STREAM_")) 82 if (!first) result << " | "; 84 first = false; 253 // First argument is udp_encapsulation_port, which is not releveant for our [all...] |
/frameworks/base/core/java/android/widget/ |
ExpandableListConnector.java | 171 * Subtract the first child's flat list position from the 205 * This would occur in the first conditional, so the flat list 334 * This would occur in the first conditional, so the flat list 665 // TODO: Collapse something not on the screen instead of the first one? 798 // first position scanned so far 799 int first = seedGroupPosition; local 807 // True when we have looked at the first item in the data 828 hitFirst = first == 0; [all...] |
/frameworks/compile/mclinker/lib/Target/ARM/ |
ARMLDBackend.cpp | 601 // setup the reached list, if we first add the element to reached list 717 // Move the first fragment (align fragment) and last fragment (null fragment) 721 SectionData::iterator first = sectData->begin(); local 725 assert(first->getKind() == Fragment::Alignment); 728 tmp.splice(tmp.end(), list, first); 787 // Add the first and the last fragment back. 899 // find the first fragment w/ invalid offset due to stub insertion [all...] |
/frameworks/support/v7/recyclerview/tests/src/android/support/v7/widget/ |
StaggeredGridLayoutManagerBaseConfigSetTest.java | 131 assertTrue(logPrefix + " second child should be to the left of first child", 133 assertEquals(logPrefix + " first child should be right aligned", 136 assertTrue(logPrefix + " first child should be to the left of second child", 138 assertEquals(logPrefix + " first child should be left aligned", 667 final View first = mLayoutManager.getChildAt(0); local 672 scrollDist = primaryOrientation.getDecoratedMeasurement(first) / 2; 674 scrollDist = -primaryOrientation.getDecoratedMeasurement(first) / 2; [all...] |
/libcore/luni/src/main/java/java/util/concurrent/ |
ConcurrentLinkedQueue.java | 26 * This queue orders elements FIFO (first-in-first-out). 126 * to be two or more steps away from the first/last node. 180 * A node from which the first live (non-deleted) node (if any) 353 * Returns the first live (non-deleted) node on list, or null if none. 355 * first node, not element. We could make peek() a wrapper around 356 * first(), but that would cost an extra volatile read of item, 360 Node<E> first() { method in class:ConcurrentLinkedQueue 383 return first() == null; 405 for (Node<E> p = first(); p != null;) [all...] |
LinkedBlockingQueue.java | 27 * This queue orders elements FIFO (first-in-first-out). 74 * this gives visibility to the first n items. 184 Node<E> first = h.next; local 186 head = first; 187 E x = first.item; 188 first.item = null; 686 // count.get provides visibility to first n Nodes 716 * The elements will be returned in order from first (head) to last (tail). [all...] |
/libcore/luni/src/main/java/libcore/icu/ |
ICU.java | 79 final int first = string.indexOf('_'); local 80 final int second = string.indexOf('_', first + 1); 83 if (first == -1) { 90 outputArray[IDX_LANGUAGE] = string.substring(0, first); 91 final String secondString = string.substring(first + 1); 111 outputArray[IDX_LANGUAGE] = string.substring(0, first); 112 final String secondString = string.substring(first + 1, second); 134 outputArray[IDX_VARIANT] = string.substring(first + 1); 141 outputArray[IDX_LANGUAGE] = string.substring(0, first); 142 final String secondString = string.substring(first + 1, second) [all...] |
/libcore/ojluni/src/main/java/java/lang/ |
String.java | 182 * index of the first character of the subarray and the {@code count} 207 * argument. The {@code offset} argument is the index of the first code 240 * <p> The {@code offset} argument is the index of the first byte of the 330 * The index of the first byte to decode 368 * The index of the first byte to decode 454 * The index of the first byte to decode 559 * <code>length() - 1</code>. The first <code>char</code> value of the sequence 569 * The first <code>char</code> value is at index <code>0</code>. 646 * @param beginIndex the index to the first <code>char</code> of 696 * The first character to be copied is at index <code>srcBegin</code> 1641 char first = target.charAt(0); local 1692 char first = target[targetOffset]; local [all...] |
/libcore/ojluni/src/main/java/java/sql/ |
ResultSet.java | 40 * before the first row. The <code>next</code> method moves the 48 * iterate through it only once and only from the first row to the 84 * the value of the first matching column will be returned. 127 * // first column of the insert row to be <code>AINSWORTH</code> 154 * before the first row; the first call to the method 155 * <code>next</code> makes the first row the current row; the 213 * Note that you must first call one of the getter methods 232 * @param columnIndex the first column is 1, the second is 2, ... 253 * @param columnIndex the first column is 1, the second is 2, .. 1143 boolean first() throws SQLException; method in interface:ResultSet [all...] |
/libcore/ojluni/src/main/java/java/util/ |
LinkedList.java | 90 * Pointer to first node. 91 * Invariant: (first == null && last == null) || 92 * (first.prev == null && first.item != null) 94 transient Node<E> first; field in class:LinkedList 98 * Invariant: (first == null && last == null) || 123 * Links e as first element. 126 final Node<E> f = first; 128 first = newNode; 145 first = newNode [all...] |