Home
last modified time | relevance | path

Searched refs:elements (Results 1 – 25 of 2215) sorted by relevance

12345678910>>...89

/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/coll/
DCollationRootElements.java27 elements = rootElements; in CollationRootElements()
83 return ((int)elements[IX_SEC_TER_BOUNDARIES] << 8) & 0xff00; in getTertiaryBoundary()
90 return elements[(int)elements[IX_FIRST_TERTIARY_INDEX]] & ~SEC_TER_DELTA_FLAG; in getFirstTertiaryCE()
97 return elements[(int)elements[IX_FIRST_SECONDARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG; in getLastTertiaryCE()
105 return ((int)elements[IX_SEC_TER_BOUNDARIES] >> 16) & 0xff00; in getLastCommonSecondary()
115 return ((int)elements[IX_SEC_TER_BOUNDARIES] >> 8) & 0xff00; in getSecondaryBoundary()
122 return elements[(int)elements[IX_FIRST_SECONDARY_INDEX]] & ~SEC_TER_DELTA_FLAG; in getFirstSecondaryCE()
129 return elements[(int)elements[IX_FIRST_PRIMARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG; in getLastSecondaryCE()
136 return elements[(int)elements[IX_FIRST_PRIMARY_INDEX]]; // step=0: cannot be a range end in getFirstPrimary()
152 assert(p > elements[(int)elements[IX_FIRST_PRIMARY_INDEX]]); in lastCEWithPrimaryBefore()
[all …]
/third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
DCollationRootElements.java25 elements = rootElements; in CollationRootElements()
81 return ((int)elements[IX_SEC_TER_BOUNDARIES] << 8) & 0xff00; in getTertiaryBoundary()
88 return elements[(int)elements[IX_FIRST_TERTIARY_INDEX]] & ~SEC_TER_DELTA_FLAG; in getFirstTertiaryCE()
95 return elements[(int)elements[IX_FIRST_SECONDARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG; in getLastTertiaryCE()
103 return ((int)elements[IX_SEC_TER_BOUNDARIES] >> 16) & 0xff00; in getLastCommonSecondary()
113 return ((int)elements[IX_SEC_TER_BOUNDARIES] >> 8) & 0xff00; in getSecondaryBoundary()
120 return elements[(int)elements[IX_FIRST_SECONDARY_INDEX]] & ~SEC_TER_DELTA_FLAG; in getFirstSecondaryCE()
127 return elements[(int)elements[IX_FIRST_PRIMARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG; in getLastSecondaryCE()
134 return elements[(int)elements[IX_FIRST_PRIMARY_INDEX]]; // step=0: cannot be a range end in getFirstPrimary()
150 assert(p > elements[(int)elements[IX_FIRST_PRIMARY_INDEX]]); in lastCEWithPrimaryBefore()
[all …]
/third_party/skia/tests/
DLListTest.cpp30 ListElement elements[4]) { in check_list()
36 REPORTER_ASSERT(reporter, in0 == list.isInList(&elements[0])); in check_list()
37 REPORTER_ASSERT(reporter, in1 == list.isInList(&elements[1])); in check_list()
38 REPORTER_ASSERT(reporter, in2 == list.isInList(&elements[2])); in check_list()
39 REPORTER_ASSERT(reporter, in3 == list.isInList(&elements[3])); in check_list()
45 ListElement elements[4] = { in DEF_TEST() local
53 check_list(list, reporter, true, 0, false, false, false, false, elements); in DEF_TEST()
55 list.addToHead(&elements[0]); in DEF_TEST()
57 check_list(list, reporter, false, 1, true, false, false, false, elements); in DEF_TEST()
59 list.addToHead(&elements[1]); in DEF_TEST()
[all …]
/third_party/icu/icu4c/source/i18n/
Dcollationrootelements.cpp27 U_ASSERT(p > elements[elements[IX_FIRST_PRIMARY_INDEX]]); in lastCEWithPrimaryBefore()
29 uint32_t q = elements[index]; in lastCEWithPrimaryBefore()
35 secTer = elements[index - 1]; in lastCEWithPrimaryBefore()
44 p = elements[index]; in lastCEWithPrimaryBefore()
58 q = elements[++index]; in lastCEWithPrimaryBefore()
74 if(p != (elements[index] & 0xffffff00)) { in firstCEWithPrimaryAtLeast()
76 p = elements[++index]; in firstCEWithPrimaryAtLeast()
92 uint32_t q = elements[index]; in getPrimaryBefore()
100 p = elements[--index]; in getPrimaryBefore()
106 uint32_t nextElement = elements[index + 1]; in getPrimaryBefore()
[all …]
Dcollationrootelements.h36 : elements(rootElements), length(rootElementsLength) {} in CollationRootElements()
93 return (elements[IX_SEC_TER_BOUNDARIES] << 8) & 0xff00; in getTertiaryBoundary()
100 return elements[elements[IX_FIRST_TERTIARY_INDEX]] & ~SEC_TER_DELTA_FLAG; in getFirstTertiaryCE()
107 return elements[elements[IX_FIRST_SECONDARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG; in getLastTertiaryCE()
115 return (elements[IX_SEC_TER_BOUNDARIES] >> 16) & 0xff00; in getLastCommonSecondary()
125 return (elements[IX_SEC_TER_BOUNDARIES] >> 8) & 0xff00; in getSecondaryBoundary()
132 return elements[elements[IX_FIRST_SECONDARY_INDEX]] & ~SEC_TER_DELTA_FLAG; in getFirstSecondaryCE()
139 return elements[elements[IX_FIRST_PRIMARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG; in getLastSecondaryCE()
146 return elements[elements[IX_FIRST_PRIMARY_INDEX]]; // step=0: cannot be a range end in getFirstPrimary()
269 const uint32_t *elements; variable
/third_party/node/deps/icu-small/source/i18n/
Dcollationrootelements.cpp27 U_ASSERT(p > elements[elements[IX_FIRST_PRIMARY_INDEX]]); in lastCEWithPrimaryBefore()
29 uint32_t q = elements[index]; in lastCEWithPrimaryBefore()
35 secTer = elements[index - 1]; in lastCEWithPrimaryBefore()
44 p = elements[index]; in lastCEWithPrimaryBefore()
58 q = elements[++index]; in lastCEWithPrimaryBefore()
74 if(p != (elements[index] & 0xffffff00)) { in firstCEWithPrimaryAtLeast()
76 p = elements[++index]; in firstCEWithPrimaryAtLeast()
92 uint32_t q = elements[index]; in getPrimaryBefore()
100 p = elements[--index]; in getPrimaryBefore()
106 uint32_t nextElement = elements[index + 1]; in getPrimaryBefore()
[all …]
Dcollationrootelements.h36 : elements(rootElements), length(rootElementsLength) {} in CollationRootElements()
93 return (elements[IX_SEC_TER_BOUNDARIES] << 8) & 0xff00; in getTertiaryBoundary()
100 return elements[elements[IX_FIRST_TERTIARY_INDEX]] & ~SEC_TER_DELTA_FLAG; in getFirstTertiaryCE()
107 return elements[elements[IX_FIRST_SECONDARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG; in getLastTertiaryCE()
115 return (elements[IX_SEC_TER_BOUNDARIES] >> 16) & 0xff00; in getLastCommonSecondary()
125 return (elements[IX_SEC_TER_BOUNDARIES] >> 8) & 0xff00; in getSecondaryBoundary()
132 return elements[elements[IX_FIRST_SECONDARY_INDEX]] & ~SEC_TER_DELTA_FLAG; in getFirstSecondaryCE()
139 return elements[elements[IX_FIRST_PRIMARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG; in getLastSecondaryCE()
146 return elements[elements[IX_FIRST_PRIMARY_INDEX]]; // step=0: cannot be a range end in getFirstPrimary()
269 const uint32_t *elements; variable
/third_party/skia/third_party/externals/icu/source/i18n/
Dcollationrootelements.cpp27 U_ASSERT(p > elements[elements[IX_FIRST_PRIMARY_INDEX]]); in lastCEWithPrimaryBefore()
29 uint32_t q = elements[index]; in lastCEWithPrimaryBefore()
35 secTer = elements[index - 1]; in lastCEWithPrimaryBefore()
44 p = elements[index]; in lastCEWithPrimaryBefore()
58 q = elements[++index]; in lastCEWithPrimaryBefore()
74 if(p != (elements[index] & 0xffffff00)) { in firstCEWithPrimaryAtLeast()
76 p = elements[++index]; in firstCEWithPrimaryAtLeast()
92 uint32_t q = elements[index]; in getPrimaryBefore()
100 p = elements[--index]; in getPrimaryBefore()
106 uint32_t nextElement = elements[index + 1]; in getPrimaryBefore()
[all …]
Dcollationrootelements.h36 : elements(rootElements), length(rootElementsLength) {} in CollationRootElements()
93 return (elements[IX_SEC_TER_BOUNDARIES] << 8) & 0xff00; in getTertiaryBoundary()
100 return elements[elements[IX_FIRST_TERTIARY_INDEX]] & ~SEC_TER_DELTA_FLAG; in getFirstTertiaryCE()
107 return elements[elements[IX_FIRST_SECONDARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG; in getLastTertiaryCE()
115 return (elements[IX_SEC_TER_BOUNDARIES] >> 16) & 0xff00; in getLastCommonSecondary()
125 return (elements[IX_SEC_TER_BOUNDARIES] >> 8) & 0xff00; in getSecondaryBoundary()
132 return elements[elements[IX_FIRST_SECONDARY_INDEX]] & ~SEC_TER_DELTA_FLAG; in getFirstSecondaryCE()
139 return elements[elements[IX_FIRST_PRIMARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG; in getLastSecondaryCE()
146 return elements[elements[IX_FIRST_PRIMARY_INDEX]]; // step=0: cannot be a range end in getFirstPrimary()
269 const uint32_t *elements; variable
/third_party/skia/third_party/externals/icu/source/common/
Duvector.cpp35 elements(0), in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()
45 elements(0), in UVector()
55 elements(0), in UVector()
65 elements(0), in UVector()
80 elements = (UElement *)uprv_malloc(sizeof(UElement)*initialCapacity); in _init()
81 if (elements == 0) { in _init()
90 uprv_free(elements); in ~UVector()
91 elements = 0; in ~UVector()
103 if (elements[i].pointer != 0 && deleter != 0) { in assign()
104 (*deleter)(elements[i].pointer); in assign()
[all …]
Duvectr32.cpp33 elements(NULL) in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()
42 elements(0) in UVector32()
60 elements = (int32_t *)uprv_malloc(sizeof(int32_t)*initialCapacity); in _init()
61 if (elements == 0) { in _init()
69 uprv_free(elements); in ~UVector32()
70 elements = 0; in ~UVector32()
80 elements[i] = other.elements[i]; in assign()
90 if (elements[i] != other.elements[i]) { in operator ==()
100 elements[index] = elem; in setElementAt()
109 elements[i] = elements[i-1]; in insertElementAt()
[all …]
Duvectr64.cpp30 elements(NULL) in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()
39 elements(0) in UVector64()
57 elements = (int64_t *)uprv_malloc(sizeof(int64_t)*initialCapacity); in _init()
58 if (elements == 0) { in _init()
66 uprv_free(elements); in ~UVector64()
67 elements = 0; in ~UVector64()
77 elements[i] = other.elements[i]; in assign()
87 if (elements[i] != other.elements[i]) { in operator ==()
97 elements[index] = elem; in setElementAt()
106 elements[i] = elements[i-1]; in insertElementAt()
[all …]
/third_party/icu/icu4c/source/common/
Duvector.cpp55 elements = (UElement *)uprv_malloc(sizeof(UElement)*initialCapacity); in UVector()
56 if (elements == nullptr) { in UVector()
65 uprv_free(elements); in ~UVector()
66 elements = nullptr; in ~UVector()
78 if (elements[i].pointer != nullptr && deleter != nullptr) { in assign()
79 (*deleter)(elements[i].pointer); in assign()
81 (*assign)(&elements[i], &other.elements[i]); in assign()
94 if (!(*comparer)(elements[i], other.elements[i])) { in operator ==()
105 elements[count++].pointer = obj; in addElement()
112 elements[count++].pointer = obj; in adoptElement()
[all …]
Duvectr32.cpp33 elements(NULL) in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()
42 elements(0) in UVector32()
60 elements = (int32_t *)uprv_malloc(sizeof(int32_t)*initialCapacity); in _init()
61 if (elements == 0) { in _init()
69 uprv_free(elements); in ~UVector32()
70 elements = 0; in ~UVector32()
80 elements[i] = other.elements[i]; in assign()
90 if (elements[i] != other.elements[i]) { in operator ==()
100 elements[index] = elem; in setElementAt()
109 elements[i] = elements[i-1]; in insertElementAt()
[all …]
Duvectr64.cpp30 elements(NULL) in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()
39 elements(0) in UVector64()
57 elements = (int64_t *)uprv_malloc(sizeof(int64_t)*initialCapacity); in _init()
58 if (elements == 0) { in _init()
66 uprv_free(elements); in ~UVector64()
67 elements = 0; in ~UVector64()
77 elements[i] = other.elements[i]; in assign()
87 if (elements[i] != other.elements[i]) { in operator ==()
97 elements[index] = elem; in setElementAt()
106 elements[i] = elements[i-1]; in insertElementAt()
[all …]
/third_party/node/deps/icu-small/source/common/
Duvector.cpp55 elements = (UElement *)uprv_malloc(sizeof(UElement)*initialCapacity); in UVector()
56 if (elements == nullptr) { in UVector()
65 uprv_free(elements); in ~UVector()
66 elements = nullptr; in ~UVector()
78 if (elements[i].pointer != nullptr && deleter != nullptr) { in assign()
79 (*deleter)(elements[i].pointer); in assign()
81 (*assign)(&elements[i], &other.elements[i]); in assign()
94 if (!(*comparer)(elements[i], other.elements[i])) { in operator ==()
105 elements[count++].pointer = obj; in addElement()
112 elements[count++].pointer = obj; in adoptElement()
[all …]
Duvectr32.cpp33 elements(nullptr) in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()
42 elements(0) in UVector32()
60 elements = (int32_t *)uprv_malloc(sizeof(int32_t)*initialCapacity); in _init()
61 if (elements == 0) { in _init()
69 uprv_free(elements); in ~UVector32()
70 elements = 0; in ~UVector32()
80 elements[i] = other.elements[i]; in assign()
90 if (elements[i] != other.elements[i]) { in operator ==()
100 elements[index] = elem; in setElementAt()
109 elements[i] = elements[i-1]; in insertElementAt()
[all …]
Duvectr64.cpp30 elements(nullptr) in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()
39 elements(0) in UVector64()
57 elements = (int64_t *)uprv_malloc(sizeof(int64_t)*initialCapacity); in _init()
58 if (elements == 0) { in _init()
66 uprv_free(elements); in ~UVector64()
67 elements = 0; in ~UVector64()
77 elements[i] = other.elements[i]; in assign()
87 if (elements[i] != other.elements[i]) { in operator ==()
97 elements[index] = elem; in setElementAt()
106 elements[i] = elements[i-1]; in insertElementAt()
[all …]
/third_party/icu/tools/cldr/cldr-to-icu/src/main/java/org/unicode/icu/tool/cldrtoicu/
DRbValue.java20 private final ImmutableList<String> elements; field in RbValue
24 public static RbValue of(String... elements) { in of() argument
25 return new RbValue(ImmutableList.copyOf(elements), 1); in of()
29 public static RbValue of(Iterable<String> elements) { in of() argument
30 return new RbValue(ImmutableList.copyOf(elements), 1); in of()
34 public static RbValue of(Stream<String> elements) { in of() argument
35 return new RbValue(elements.collect(toImmutableList()), 1); in of()
38 private RbValue(ImmutableList<String> elements, int elementsPerLine) { in RbValue() argument
39 checkArgument(!elements.isEmpty(), "Resource bundle values cannot be empty"); in RbValue()
41 this.elements = elements; in RbValue()
[all …]
/third_party/vk-gl-cts/framework/delibs/decpp/
DdeBlockBuffer.hpp57 void write (int numElements, const T* elements);
58 int tryWrite (int numElements, const T* elements);
62 void read (int numElements, T* elements);
63 int tryRead (int numElements, T* elements);
72 int writeToCurrentBlock (int numElements, const T* elements, bool blocking);
73 int readFromCurrentBlock(int numElements, T* elements, bool blocking);
175 int BlockBuffer<T>::writeToCurrentBlock (int numElements, const T* elements, bool blocking) in writeToCurrentBlock() argument
177 DE_ASSERT(numElements > 0 && elements != DE_NULL); in writeToCurrentBlock()
207 block[m_writePos+ndx] = elements[ndx]; in writeToCurrentBlock()
218 int BlockBuffer<T>::readFromCurrentBlock (int numElements, T* elements, bool blocking) in readFromCurrentBlock() argument
[all …]
/third_party/node/deps/v8/src/builtins/
Darray-reverse.tq7 elements: FixedArrayBase, index: Smi): T;
10 elements: FixedArrayBase, index: Smi): Smi {
11 const elements: FixedArray = UnsafeCast<FixedArray>(elements);
12 return UnsafeCast<Smi>(elements.objects[index]);
16 elements: FixedArrayBase, index: Smi): JSAny {
17 const elements: FixedArray = UnsafeCast<FixedArray>(elements);
18 return UnsafeCast<JSAny>(elements.objects[index]);
22 implicit context: Context)(elements: FixedArrayBase, index: Smi): float64 {
23 const elements: FixedDoubleArray = UnsafeCast<FixedDoubleArray>(elements);
26 return elements.floats[index].Value() otherwise unreachable;
[all …]
/third_party/node/deps/v8/src/objects/
Djs-array.tq45 elements: kEmptyFixedArray,
64 map: Map, elements: FixedArrayBase): JSArray {
68 elements,
69 length: elements.length
77 elements: kEmptyFixedArray,
82 // A HeapObject with a JSArray map, and either fast packed elements, or fast
83 // holey elements when the global NoElementsProtector is not invalidated.
86 // A HeapObject with a JSArray map, and either fast packed elements, or fast
87 // holey elements or frozen, sealed elements when the global NoElementsProtector
120 const elements: FixedArray =
[all …]
Darguments.tq31 // For clarity SloppyArgumentsElements fields are qualified with "elements."
36 // are stored in the context at indexes given by elements.mapped_entries[key].
38 // array which can be accessed from elements.arguments.
40 // elements.length is min(number_of_actual_arguments,
44 // |key| in |elements| works as follows:
46 // If key >= elements.length then attempt to look in the unmapped arguments
48 // arguments array is not a fixed array or if key >= elements.arguments.length.
50 // Otherwise, t = elements.mapped_entries[key]. If t is the hole, then the
53 // index into the context array specified at elements.context, and the return
54 // value is elements.context[t].
[all …]
/third_party/protobuf/src/google/protobuf/
Drepeated_field.cc55 return &rep_->elements[current_size_]; in InternalExtend()
62 sizeof(old_rep->elements[0])) in InternalExtend()
64 size_t bytes = kRepHeaderSize + sizeof(old_rep->elements[0]) * new_size; in InternalExtend()
75 memcpy(rep_->elements, old_rep->elements, in InternalExtend()
76 old_rep->allocated_size * sizeof(rep_->elements[0])); in InternalExtend()
84 old_total_size * sizeof(rep_->elements[0]) + kRepHeaderSize; in InternalExtend()
90 return &rep_->elements[current_size_]; in InternalExtend()
103 rep_->elements[i - num] = rep_->elements[i]; in CloseGap()
110 return reinterpret_cast<MessageLite*>(rep_->elements[current_size_++]); in AddWeak()
119 rep_->elements[current_size_++] = result; in AddWeak()
/third_party/typescript/src/compiler/transformers/
Ddestructuring.ts11 …createArrayBindingOrAssignmentPattern: (elements: BindingOrAssignmentElement[]) => ArrayBindingOrA…
12 …createObjectBindingOrAssignmentPattern: (elements: BindingOrAssignmentElement[]) => ObjectBindingO…
63 …createArrayBindingOrAssignmentPattern: elements => makeArrayAssignmentPattern(context.factory, ele…
64 …createObjectBindingOrAssignmentPattern: elements => makeObjectAssignmentPattern(context.factory, e…
139 const elements = getElementsOfBindingOrAssignmentPattern(pattern); constant
140 for (const element of elements) {
190 …createArrayBindingOrAssignmentPattern: elements => makeArrayBindingPattern(context.factory, elemen…
191 …createObjectBindingOrAssignmentPattern: elements => makeObjectBindingPattern(context.factory, elem…
311 const elements = getElementsOfBindingOrAssignmentPattern(pattern); constant
312 const numElements = elements.length;
[all …]

12345678910>>...89