HomeSort by relevance Sort by last modified time
    Searched defs:offsets (Results 26 - 50 of 128) sorted by null

12 3 4 5 6

  /external/icu4c/test/intltest/
convtest.h 42 const int32_t *offsets; member in struct:ConversionCase
  /libcore/luni/src/main/java/java/nio/
IoVec.java 36 private final int[] offsets; field in class:IoVec
47 this.offsets = new int[bufferCount];
61 offsets[i] = b.position();
64 offsets[i] = NioUtils.unsafeArrayOffset(b) + b.position();
75 int result = Libcore.os.readv(fd, ioBuffers, offsets, byteCounts);
81 return Libcore.os.writev(fd, ioBuffers, offsets, byteCounts);
  /libcore/luni/src/test/java/libcore/java/text/
CollatorTest.java 118 private void assertCollationElementIterator(CollationElementIterator it, Integer... offsets) {
119 for (int offset : offsets) {
126 private void assertGetCollationElementIteratorString(Locale l, String s, Integer... offsets) {
128 assertCollationElementIterator(coll.getCollationElementIterator(s), offsets); local
131 private void assertGetCollationElementIteratorCharacterIterator(Locale l, String s, Integer... offsets) {
134 assertCollationElementIterator(coll.getCollationElementIterator(it), offsets); local
  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
multiway_mergesort.h 83 /** @brief Offsets to add to the found positions. */
84 difference_type* offsets; member in struct:__gnu_parallel::PMWMSSortingData
150 std::vector<SortingPlacesIterator> offsets(sd->num_threads);
155 sd->starts[iam + 1], offsets.begin(), comp);
161 sd->pieces[iam][seq].end = offsets[seq] - seqs[seq].first;
443 sd.offsets = new difference_type[num_threads - 1];
470 delete[] sd.offsets;
multiway_merge.h 1199 std::vector<RandomAccessIterator1>* offsets = local
    [all...]
  /dalvik/dx/src/com/android/dx/cf/cst/
ConstantPoolParser.java 59 /** {@code non-null;} byte offsets to each cst */
60 private final int[] offsets; field in class:ConstantPoolParser
82 this.offsets = new int[size];
133 "constant_pool_count: " + Hex.u2(offsets.length));
142 BitSet wasUtf8 = new BitSet(offsets.length);
144 for (int i = 1; i < offsets.length; i++) {
145 int offset = offsets[i];
152 for (int i = 1; i < offsets.length; i++) {
157 int offset = offsets[i];
159 for (int j = i + 1; j < offsets.length; j++)
    [all...]
  /external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/
CollationElementIteratorTest.java 46 int[] offsets = { 0, 1, 2, 3 }; local
49 assertEquals(offsets[i++], offset);
53 assertEquals(offsets[i++], offset);
  /external/chromium/chrome/browser/history/
in_memory_url_index_unittest.cc 378 std::vector<size_t> offsets = local
381 ASSERT_EQ(offsets.size(), arraysize(expected_offsets_a));
382 for (size_t i = 0; i < offsets.size(); ++i)
383 EXPECT_EQ(expected_offsets_a[i], offsets[i]);
386 offsets[2] = string16::npos;
388 InMemoryURLIndex::ReplaceOffsetsInTermMatches(matches_a, offsets);
  /external/chromium/chrome/browser/notifications/
balloon_collection_impl.cc 340 // Layout schemes that grow up from the bottom require offsets;
341 // schemes that grow down do not require offsets.
342 bool offsets = (placement_ == VERTICALLY_FROM_BOTTOM_LEFT || local
348 offsets = !offsets;
351 return offsets;
  /external/chromium/chrome/browser/translate/
translate_infobar_delegate.cc 291 std::vector<size_t> offsets; local
294 string16(), string16(), &offsets);
295 DCHECK_EQ(2U, offsets.size());
297 *swap_languages = (offsets[0] > offsets[1]);
299 std::swap(offsets[0], offsets[1]);
301 strings->push_back(text.substr(0, offsets[0]));
302 strings->push_back(text.substr(offsets[0], offsets[1] - offsets[0]))
    [all...]
  /external/chromium/net/base/
escape.cc 184 std::vector<size_t> offsets; local
186 offsets.push_back(*offset_for_adjustment);
187 STR result = UnescapeURLWithOffsetsImpl(escaped_text, rules, &offsets);
189 *offset_for_adjustment = offsets[0];
275 std::vector<size_t> offsets; local
277 offsets.push_back(*offset_for_adjustment);
279 UnescapeAndDecodeUTF8URLComponentWithOffsets(text, rules, &offsets);
281 *offset_for_adjustment = offsets[0];
  /external/icu4c/common/
ucnv_u16.c 53 int32_t *offsets; local
74 &pArgs->offsets, -1,
86 offsets=pArgs->offsets;
101 if(offsets!=NULL) {
102 *offsets++=-1;
103 *offsets++=-1;
104 *offsets++=-1;
105 *offsets++=-1;
122 if(offsets==NULL)
257 int32_t *offsets; local
652 int32_t *offsets; local
856 int32_t *offsets; local
1328 int32_t *offsets=pArgs->offsets; local
    [all...]
ucnv_u32.c 128 int32_t *myOffsets = args->offsets;
206 args->offsets = myOffsets;
232 &args->offsets, -1,
335 &args->offsets, -1,
341 myOffsets = args->offsets;
414 args->offsets = myOffsets;
596 int32_t *myOffsets = args->offsets;
684 args->offsets = myOffsets;
710 &args->offsets, -1,
821 &args->offsets, -1
1049 int32_t *offsets=pArgs->offsets; local
    [all...]
ucnv_u7.c 211 int32_t *offsets; local
235 offsets=pArgs->offsets;
277 if(offsets!=NULL) {
278 *offsets++=sourceIndex++;
333 if(offsets!=NULL) {
334 *offsets++=sourceIndex;
344 if(offsets!=NULL) {
345 *offsets++=sourceIndex;
355 if(offsets!=NULL)
449 int32_t *offsets; local
868 int32_t *offsets; local
1135 int32_t *offsets; local
    [all...]
ucnvhz.c 13 * 10/31/2000 Ram Implemented offsets logic function
42 if(args->offsets!=NULL){ \
43 *(offsets++) = sourceIndex-1; \
186 if(args->offsets) {
187 args->offsets[myTarget - args->target]=(int32_t)(mySource - args->source - 2);
297 if(args->offsets) {
298 args->offsets[myTarget - args->target]=(int32_t)(mySource - args->source - 1-(myData->isStateDBCS));
338 int32_t* offsets = args->offsets; local
413 if(offsets){
    [all...]
ucnvbocu.c 391 int32_t *offsets; local
405 offsets=pArgs->offsets;
436 *offsets++=nextSourceIndex++;
444 *offsets++=nextSourceIndex++;
454 sourceIndex=nextSourceIndex; /* wrong if offsets==NULL but does not matter */
472 *offsets++=sourceIndex;
509 *offsets++=sourceIndex;
531 *offsets++=sourceIndex;
532 *offsets++=sourceIndex
940 int32_t *offsets; local
    [all...]
unisetspan.cpp 27 * List of offsets from the current position from where to try matching
29 * Store offsets rather than indexes to simplify the code and use the same list
32 * Assumption: The maximum offset is limited, and the offsets that are stored
38 * This avoids inserting into a sorted list of offsets (or absolute indexes) and
50 * the integer would simply be shifted when lower offsets are removed.
86 // Reduce all stored offsets by delta, used when the current position
88 // There must not be any offsets lower than delta.
124 // and reduce all other offsets by this minimum.
640 OffsetList offsets; local
643 offsets.setMaxLength(maxLength16)
801 OffsetList offsets; local
962 OffsetList offsets; local
1143 OffsetList offsets; local
    [all...]
  /external/protobuf/src/google/protobuf/
dynamic_message.cc 178 // important (the prototype must be deleted *before* the offsets).
179 scoped_array<int> offsets; member in struct:google::protobuf::DynamicMessage::TypeInfo
244 void* field_ptr = OffsetToPointer(type_info_->offsets[i]);
283 type_info_->offsets[i]));
324 void* field_ptr = OffsetToPointer(type_info_->offsets[i]);
391 void* field_ptr = OffsetToPointer(type_info_->offsets[i]);
486 // Compute size and offsets.
487 int* offsets = new int[type->field_count()]; local
488 type_info->offsets.reset(offsets);
    [all...]
  /external/qemu/block/
dmg.c 32 * offsets[i] is the offset in the .dmg file,
34 * sectors[i] is the sector beginning at offsets[i],
41 uint64_t* offsets; member in struct:BDRVDMGState
85 s->offsets = s->lengths = s->sectors = s->sectorcounts = NULL;
111 /* read offsets */
131 s->offsets = qemu_realloc(s->offsets, new_size);
141 last_in_offset = s->offsets[i-1]+s->lengths[i-1];
157 s->offsets[i] = last_in_offset+read_off(bs, offset);
231 ret = bdrv_pread(bs->file, s->offsets[chunk] + i
    [all...]
  /external/qemu/distrib/sdl-1.2.12/src/video/Xext/extensions/
Xvlib.h 160 int *offsets; /* bytes */ member in struct:__anon9685
  /external/webkit/Source/WebCore/platform/text/
TextCodecICU.cpp 251 int TextCodecICU::decodeToBuffer(UChar* target, UChar* targetLimit, const char*& source, const char* sourceLimit, int32_t* offsets, bool flush, UErrorCode& err)
255 ucnv_toUnicode(m_converterICU, &target, targetLimit, &source, sourceLimit, offsets, flush, &err);
315 int32_t* offsets = NULL; local
319 int ucharsDecoded = decodeToBuffer(buffer, bufferLimit, source, sourceLimit, offsets, flush, err);
326 decodeToBuffer(buffer, bufferLimit, source, sourceLimit, offsets, true, err);
  /external/chromium/base/
string_util_unittest.cc 847 std::vector<size_t> offsets; local
851 &offsets);
852 EXPECT_EQ(2U, offsets.size());
853 EXPECT_EQ(7U, offsets[0]);
854 EXPECT_EQ(25U, offsets[1]);
855 offsets.clear();
859 &offsets);
860 EXPECT_EQ(2U, offsets.size());
861 EXPECT_EQ(25U, offsets[0]);
862 EXPECT_EQ(7U, offsets[1])
    [all...]
  /frameworks/base/core/java/android/view/animation/
AnimationSet.java 493 final long[] offsets = mStoredOffsets; local
494 if (offsets == null) return;
500 children.get(i).setStartOffset(offsets[i]);
  /packages/inputmethods/PinyinIME/jni/include/
userdict.h 262 uint32 offsets[kUserDictCacheSize]; member in struct:ime_pinyin::UserDict::UserDictCache
  /bionic/libc/kernel/common/linux/
binder.h 97 const void *offsets; member in struct:binder_transaction_data::__anon205::__anon206

Completed in 1468 milliseconds

12 3 4 5 6