HomeSort by relevance Sort by last modified time
    Searched full:pos1 (Results 1 - 25 of 74) sorted by null

1 2 3

  /external/v8/test/mjsunit/
debug-liveedit-diff.js 36 var pos1 = 0;
44 var similar_length = diff_array[i] - pos1;
45 assertEquals(s1.substring(pos1, pos1 + similar_length),
48 print(s1.substring(pos1, pos1 + similar_length));
49 pos1 += similar_length;
51 print("<<< " + pos1 + " " + diff_array[i + 1]);
52 print(s1.substring(pos1, diff_array[i + 1]));
56 pos1 = diff_array[i + 1]
    [all...]
  /external/v8/test/cctest/
test-liveedit.cc 67 : pos1(pos1_param), pos2(pos2_param),
69 int pos1; member in class:__anon14483::DiffChunkStruct
83 void AddChunk(int pos1, int pos2, int len1, int len2) {
84 current_chunk_ = new DiffChunkStruct(pos1, pos2, len1, len2);
108 int pos1 = 0; local
116 int diff_pos1 = chunk->pos1;
117 int similar_part_length = diff_pos1 - pos1;
123 ASSERT(pos1 + j < len1);
125 ASSERT_EQ(s1[pos1 + j], s2[pos2 + j]);
128 pos1 = diff_pos1 + chunk->len1
    [all...]
  /frameworks/av/media/libstagefright/codecs/amrwbenc/src/
q_pulse.c 52 Word16 pos1, /* (i) position of the pulse 1 */
62 if (((pos2 ^ pos1) & NB_POS) == 0)
65 if(pos1 <= pos2) /* ((pos1 - pos2) <= 0) */
67 /* index = ((pos1 & mask) << N) + (pos2 & mask); */
68 index = L_deposit_l(add1((((Word16) (pos1 & mask)) << N), ((Word16) (pos2 & mask))));
71 /* ((pos2 & mask) << N) + (pos1 & mask); */
72 index = L_deposit_l(add1((((Word16) (pos2 & mask)) << N), ((Word16) (pos1 & mask))));
74 if ((pos1 & NB_POS) != 0)
82 if (vo_sub((Word16) (pos1 & mask), (Word16) (pos2 & mask)) <= 0
    [all...]
  /external/freetype/src/truetype/
ttpload.c 177 FT_ULong pos1, pos2; local
182 pos1 = pos2 = 0;
191 pos1 = FT_NEXT_ULONG( p );
192 pos2 = pos1;
202 pos1 = FT_NEXT_USHORT( p );
203 pos2 = pos1;
208 pos1 <<= 1;
214 if ( pos1 > face->glyf_len )
219 pos1, gindex, face->glyf_len ));
241 if ( pos2 >= pos1 )
    [all...]
  /external/oprofile/libutil++/
child_reader.cpp 30 pos1(0), end1(0),
172 if (pos1 >= end1) {
173 pos1 = 0;
178 ssize_t temp_pos = pos1;
186 result.append(&buf1[pos1], (temp_pos - pos1) - !ok);
197 pos1 = temp_pos;
child_reader.h 94 ssize_t pos1; member in class:child_reader
  /external/icu4c/samples/uciter8/
uciter8.c 47 int32_t i, pos1, pos2, middle, length; local
61 pos1=iter1->move(iter1, middle, UITER_ZERO);
62 if(pos1!=middle) {
63 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n1, middle, pos1);
102 pos1=iter1->move(iter1, 0, UITER_START);
103 if(pos1<0) {
141 pos1=iter1->move(iter1, middle, UITER_ZERO);
142 if(pos1!=middle) {
143 log_err("%s->move(from end to middle %d)=%d does not move to the middle\n", n1, middle, pos1);
154 pos1=iter1->move(iter1, 1, UITER_ZERO)
    [all...]
  /external/svox/pico/lib/
picotrns.h 41 * if the sequence pos1/sym1, pos2/sym2 should be tranduced to x/sym3, y/sym4, z/sym5, then x must be pos1 or pos2
46 * - The input to the transducer is then pos1/phon1 , pos2/phon2
47 * - The output is pos1/phon1' -1/phon_ins pos2/phon2' [assuming -1 is the special insertion pos]
50 * pos1/phon1' pos2/phon_ins -1/phon2'
picowa.h 63 - WORDINDEX(POSes,NA)pos1|ind1...posN|indN
64 - graph in lex - {1,4} entries with phone, pos1...posN from lex,
77 - pos1|ind1, pos2|ind2, ..., posN|indN
picoklex.h 80 POS1-byte, IND1-bytes, POS2-byte, IND2-bytes, etc.
  /external/quake/quake/src/QW/progs/
buttons.qc 24 SUB_CalcMove (self.pos1, self.speed, button_done);
138 self.pos1 = self.origin;
139 self.pos2 = self.pos1 + self.movedir*(fabs(self.movedir*self.size) - self.lip);
plats.qc 70 SUB_CalcMove (self.pos1, self.speed, plat_hit_top);
193 // pos1 is the top position, pos2 is the bottom
194 self.pos1 = self.origin;
  /frameworks/av/media/libstagefright/codecs/amrwbenc/inc/
q_pulse.h 35 Word16 pos1, /* (i) position of the pulse 1 */
40 Word16 pos1, /* (i) position of the pulse 1 */
46 Word16 pos1, /* (i) position of the pulse 1 */
  /external/webkit/Source/WebCore/manual-tests/
interrupted-compound-transform.html 25 #pos1 {
70 <div id="pos1">
  /external/oprofile/opjitconv/
opjitconv.c 106 struct list_head * pos1, * pos2; local
107 list_for_each_safe(pos1, pos2, list) {
108 struct pathname * pname = list_entry(pos1, struct pathname,
441 struct list_head * pos1, * pos2; local
442 list_for_each_safe(pos1, pos2, anon_dirs) {
443 struct pathname * pname = list_entry(pos1, struct pathname,
483 struct list_head * pos1, * pos2; local
555 list_for_each_safe(pos1, pos2, &jd_fnames) {
557 list_entry(pos1, struct pathname, neighbor);
  /external/v8/src/
liveedit-debugger.js 446 function DiffChunk(pos1, pos2, len1, len2) {
447 this.pos1 = pos1;
473 if (array.length == 0 || pos < array[0].pos1) {
481 if (pos < array[middle_index + 1].pos1) {
488 if (pos >= chunk.pos1 + chunk.len1) {
489 return pos + chunk.pos2 + chunk.len2 - chunk.pos1 - chunk.len1;
506 return pos - diff_chunk.pos1 + diff_chunk.pos2;
592 pos_diff = chunk.pos2 + chunk.len2 - (chunk.pos1 + chunk.len1);
610 chunk_it.current().pos1 < info_node.info.end_position)
    [all...]
liveedit.cc 92 int pos1 = 0; local
95 if (pos1 < len1_) {
97 Direction dir = get_direction(pos1, pos2);
101 pos1++;
106 pos1++;
117 writer.skip1(len1_ - pos1);
147 int CompareUpToTail(int pos1, int pos2) {
148 if (pos1 < len1_) {
150 int cached_res = get_value4(pos1, pos2);
154 if (input_->Equals(pos1, pos2))
    [all...]
liveedit.h 136 // of array of triplets (pos1, pos1_end, pos2_end) describing list
163 virtual void AddChunk(int pos1, int pos2, int len1, int len2) = 0;
  /frameworks/av/media/libstagefright/codecs/amrwb/src/
dec_alg_codebook.cpp 120 int16 pos1; local
127 pos1 = ((index & mask) + offset);
133 pos1 += NB_POS;
135 pos[0] = pos1;
147 int16 pos1, pos2, tmp; local
154 /* pos1 = (((index >> N) & mask) + offset); */
155 pos1 = (int16)(add_int32((shr_int32(index, N) & mask), (int32)(offset)));
160 if (pos2 < pos1) /* ((pos2 - pos1) < 0) */
164 pos1 += NB_POS; /* pos1 += NB_POS; *
    [all...]
  /libcore/luni/src/test/java/tests/api/java/util/
BitSetTest.java 155 // pos1 and pos2 are in the same bitset element
170 // pos1 and pos2 is in the same bitset element, boundry testing
208 // pos1 and pos2 are in two sequential bitset elements
236 // pos1 and pos2 are in two non-sequential bitset elements
367 // pos1 and pos2 are in the same bitset element, at index0
373 // pos1 and pos2 are in the same bitset element, at index 1
379 // pos1 in bitset element at index 0, and pos2 in bitset element at
388 // pos1 in bitset element at index 1, and pos2 in bitset element at
397 // pos1 in bitset element at index 0, and pos2 in bitset element at
408 // pos1 in bitset element at index 0, and pos2 in bitset element a
    [all...]
  /external/icu4c/test/cintltst/
cnumtst.c 162 UFieldPosition pos1; local
259 pos1.field = 0; /* Integer Section */
260 resultlengthneeded=unum_format(cur_def, l, NULL, resultlength, &pos1, &status);
268 unum_format(cur_def, l, result, resultlength, &pos1, &status);
280 if(pos1.beginIndex == 1 && pos1.endIndex == 12)
284 pos1.beginIndex, pos1.endIndex);
316 pos1.beginIndex, pos1.endIndex)
1274 UFieldPosition pos1; local
    [all...]
  /packages/apps/Nfc/nci/jni/
RouteDataSet.cpp 46 std::string::size_type pos1 = 0; local
56 sscanf (aid.substr(pos1).c_str(), "%x", &num);
63 sscanf (aid.substr(pos1, pos2-pos1+1).c_str(), "%x", &num);
66 pos1 = pos2 + 1;
67 pos2 = aid.find_first_of (delimiter, pos1);
  /frameworks/av/media/libstagefright/codecs/amrnb/dec/src/
d1035pf.cpp 134 Word16 i, j, pos1, pos2, sign, tmp;
152 pos1 = add (i, j); // position of pulse "j"
164 cod[pos1] = sign;
174 if (sub (pos2, pos1) < 0)
212 register Word16 i, j, pos1, pos2; local
231 pos1 = i + j; /* position of pulse "j" */
244 *(cod + pos1) = sign;
255 if (pos2 < pos1)
  /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/
BitSetTest.java 213 // pos1 and pos2 are in the same bitset element
243 // pos1 and pos2 is in the same bitset element, boundary testing
281 // pos1 and pos2 are in two sequential bitset elements
309 // pos1 and pos2 are in two non-sequential bitset elements
460 // pos1 and pos2 are in the same bitset element, at index0
466 // pos1 and pos2 are in the same bitset element, at index 1
472 // pos1 in bitset element at index 0, and pos2 in bitset element at
481 // pos1 in bitset element at index 1, and pos2 in bitset element at
490 // pos1 in bitset element at index 0, and pos2 in bitset element at
501 // pos1 in bitset element at index 0, and pos2 in bitset element a
    [all...]
  /external/antlr/antlr-3.4/gunit/src/main/antlr3/org/antlr/gunit/
gUnit.g 85 int pos1, pos2;
86 if ( (pos1=$ACTION.text.indexOf("package"))!=-1 && (pos2=$ACTION.text.indexOf(';'))!=-1 ) {
87 grammarInfo.setGrammarPackage($ACTION.text.substring(pos1+8, pos2).trim()); // substring the package path

Completed in 1345 milliseconds

1 2 3