Searched refs:elements (Results 1 - 25 of 673) sorted by relevance

1234567891011>>

/macosx-10.10.1/ruby-106/ruby/test/rss/
H A Dtest_setup_maker_slash.rb8 elements = {
20 item.slash_section = elements["section"]
21 item.slash_department = elements["department"]
22 item.slash_comments = elements["comments"]
23 item.slash_hit_parade = elements["hit_parades"].join(",")
35 assert_slash_elements(elements, item)
H A Dtest_maker_trackback.rb11 @elements = {
26 item.trackback_ping = @elements[:ping]
27 @elements[:abouts].each do |about|
33 assert_trackback(@elements, rss.items.last)
H A Dtest_maker_content.rb11 @elements = {
22 @elements.each do |name, value|
26 assert_content(@elements, rss.items.last)
35 @elements.each do |name, value|
39 assert_content(@elements, rss.items.last)
/macosx-10.10.1/tcl-105/tcl_ext/tclxml/tclxslt/library/
H A Dtclxslt.tcl25 set elements {}
31 lappend elements $name
35 return [list $elements $functions]
/macosx-10.10.1/cxxfilt-11/cxxfilt/libiberty/
H A Dpartition.c39 /* Creates a partition of NUM_ELEMENTS elements. Initially each
53 part->elements[e].class_element = e;
54 part->elements[e].next = &(part->elements[e]);
55 part->elements[e].class_count = 1;
77 struct partition_elem *elements = part->elements; local
83 int class_element = elements[elem1].class_element;
86 if (class_element == elements[elem2].class_element)
91 if (elements[elem
144 struct partition_elem *elements = part->elements; local
[all...]
/macosx-10.10.1/ICU-531.30/icuSources/i18n/
H A Dcollationrootelements.h25 * Container and access methods for collation elements and weights
34 : elements(rootElements), length(rootElementsLength) {}
54 * Same as the start of the compact root elements table.
79 * Currently the same as elements[IX_FIRST_TERTIARY_INDEX].
91 return (elements[IX_SEC_TER_BOUNDARIES] << 8) & 0xff00;
98 return elements[elements[IX_FIRST_TERTIARY_INDEX]] & ~SEC_TER_DELTA_FLAG;
105 return elements[elements[IX_FIRST_SECONDARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG;
113 return (elements[IX_SEC_TER_BOUNDARIE
247 const uint32_t *elements; member in class:CollationRootElements
[all...]
H A Dcollationrootelements.cpp25 U_ASSERT(p > elements[elements[IX_FIRST_PRIMARY_INDEX]]);
27 uint32_t q = elements[index];
30 // p == elements[index] is a root primary. Find the CE before it.
33 secTer = elements[index - 1];
42 p = elements[index];
51 // p > elements[index] which is the previous primary.
56 q = elements[++index];
72 if(p != (elements[index] & 0xffffff00)) {
74 p = elements[
[all...]
/macosx-10.10.1/ruby-106/ruby/test/rexml/
H A Dtest_elements.rb8 assert_equal 'b', doc.root.elements[1].name
9 assert_equal '1', doc.root.elements['c'].attributes['id']
10 assert_equal '2', doc.root.elements[2,'c'].attributes['id']
15 doc.root.elements[10] = Element.new('b')
16 assert_equal 'b', doc.root.elements[1].name
17 doc.root.elements[1] = Element.new('c')
18 assert_equal 'c', doc.root.elements[1].name
19 doc.root.elements['c'] = Element.new('d')
20 assert_equal 'd', doc.root.elements[1].name
30 b = doc.root.elements[
[all...]
/macosx-10.10.1/eap8021x-198/eapolclient.tproj/
H A DKeyValue.c48 KeyValue * elements; member in struct:KeyValueList_s
63 printf("%2d. %10s=%-10s\n", i, list->elements[i].key,
64 list->elements[i].value);
81 if (strcmp(list->elements[i].key, key) == 0) {
85 return (list->elements[i].value);
103 /* Note: "list" is part of the same malloc chunk as "list->elements" */
104 chunk = list->elements;
106 list->elements = NULL;
118 KeyValue * elements = NULL; local
132 elements
[all...]
/macosx-10.10.1/xnu-2782.1.97/iokit/Kernel/
H A DIORangeAllocator.cpp81 elements = 0;
114 if( elements)
115 IODelete( elements, IORangeAllocatorElement, capacity );
143 || (!elements)) {
150 if( elements) {
151 bcopy( elements,
154 bcopy( elements + index,
158 IODelete( elements, IORangeAllocatorElement, capacity );
161 elements = newElements;
166 bcopy( elements
[all...]
/macosx-10.10.1/Heimdal-398.1.2/lib/gssapi/mech/
H A Dgss_duplicate_oid.c56 (*dest_oid)->elements = malloc(src_oid->length);
57 if ((*dest_oid)->elements == NULL) {
63 memcpy((*dest_oid)->elements, src_oid->elements, src_oid->length);
H A Dgss_oid_equal.c57 return memcmp(a->elements, b->elements, a->length) == 0;
H A Dgss_release_oid_set.c38 if ((*set)->elements)
39 free((*set)->elements);
H A Dgss_buffer_set.c49 set->elements = NULL;
76 set->elements = realloc(set->elements,
77 (set->count + 1) * sizeof(set->elements[0]));
78 if (set->elements == NULL) {
83 p = &set->elements[set->count];
112 gss_release_buffer(&minor, &((*buffer_set)->elements[i]));
114 free((*buffer_set)->elements);
116 (*buffer_set)->elements = NULL;
H A Dgss_add_oid_set_member.c74 tmp = realloc ((*oid_set)->elements, n * sizeof(gss_OID_desc));
79 (*oid_set)->elements = tmp;
81 (*oid_set)->elements[n-1] = *member_oid;
/macosx-10.10.1/ICU-531.30/icuSources/common/
H A Duvector.cpp33 elements(0),
43 elements(0),
53 elements(0),
63 elements(0),
78 elements = (UElement *)uprv_malloc(sizeof(UElement)*initialCapacity);
79 if (elements == 0) {
88 uprv_free(elements);
89 elements = 0;
101 if (elements[i].pointer != 0 && deleter != 0) {
102 (*deleter)(elements[
[all...]
H A Duvectr32.cpp31 elements(NULL)
40 elements(0)
58 elements = (int32_t *)uprv_malloc(sizeof(int32_t)*initialCapacity);
59 if (elements == 0) {
67 uprv_free(elements);
68 elements = 0;
78 elements[i] = other.elements[i];
88 if (elements[i] != other.elements[
[all...]
H A Duvectr64.cpp28 elements(NULL)
37 elements(0)
55 elements = (int64_t *)uprv_malloc(sizeof(int64_t)*initialCapacity);
56 if (elements == 0) {
64 uprv_free(elements);
65 elements = 0;
75 elements[i] = other.elements[i];
85 if (elements[i] != other.elements[
[all...]
/macosx-10.10.1/WebKit2-7600.1.25/Shared/API/c/
H A DWKArray.cpp41 Vector<RefPtr<API::Object>> elements; local
42 elements.reserveInitialCapacity(numberOfValues);
45 elements.uncheckedAppend(const_cast<API::Object*>(static_cast<const API::Object*>(values[i])));
47 return toAPI(API::Array::create(WTF::move(elements)).leakRef());
52 Vector<RefPtr<API::Object>> elements; local
53 elements.reserveInitialCapacity(numberOfValues);
56 elements.uncheckedAppend(adoptRef(const_cast<API::Object*>(static_cast<const API::Object*>(values[i]))));
58 return toAPI(API::Array::create(WTF::move(elements)).leakRef());
H A DWKMutableArray.cpp41 toImpl(arrayRef)->elements().append(toImpl(itemRef));
46 toImpl(arrayRef)->elements().remove(index);
/macosx-10.10.1/WebKit2-7600.1.25/Shared/
H A DAPIArray.cpp38 PassRefPtr<Array> Array::create(Vector<RefPtr<Object>> elements) argument
40 return adoptRef(new Array(WTF::move(elements)));
45 Vector<RefPtr<Object>> elements; local
46 elements.reserveInitialCapacity(strings.size());
49 elements.uncheckedAppend(API::String::create(string));
51 return create(WTF::move(elements));
68 Array::Array(Vector<RefPtr<Object>> elements) argument
69 : m_elements(WTF::move(elements))
/macosx-10.10.1/cxxfilt-11/cxxfilt/include/
H A Dpartition.h23 elements are partitioned into classes. Each class is represented
24 by one of its elements, the canonical element, which is chosen
25 arbitrarily from elements in the class. The principal operations
28 which unites the two classes that contain two given elements into a
54 /* The number of elements in this class. Valid only if this is the
61 /* The number of elements in this partition. */
63 /* The elements in the partition. */
64 struct partition_elem elements[1]; member in struct:partition_def
76 ((partition__)->elements[(element__)].class_element)
/macosx-10.10.1/libffi-18.1/tests/testsuite/libffi.call/
H A Dpyobjc-tc.c50 point_type.elements = malloc(3 * sizeof(ffi_type*));
51 point_type.elements[0] = &ffi_type_float;
52 point_type.elements[1] = &ffi_type_float;
53 point_type.elements[2] = NULL;
58 size_type.elements = malloc(3 * sizeof(ffi_type*));
59 size_type.elements[0] = &ffi_type_float;
60 size_type.elements[1] = &ffi_type_float;
61 size_type.elements[2] = NULL;
66 rect_type.elements = malloc(3 * sizeof(ffi_type*));
67 rect_type.elements[
[all...]
/macosx-10.10.1/pyobjc-45/2.5/pyobjc/pyobjc-core/libffi-src/tests/testsuite/libffi.call/
H A Dpyobjc-tc.c50 point_type.elements = malloc(3 * sizeof(ffi_type*));
51 point_type.elements[0] = &ffi_type_float;
52 point_type.elements[1] = &ffi_type_float;
53 point_type.elements[2] = NULL;
58 size_type.elements = malloc(3 * sizeof(ffi_type*));
59 size_type.elements[0] = &ffi_type_float;
60 size_type.elements[1] = &ffi_type_float;
61 size_type.elements[2] = NULL;
66 rect_type.elements = malloc(3 * sizeof(ffi_type*));
67 rect_type.elements[
[all...]
/macosx-10.10.1/pyobjc-45/2.6/pyobjc/pyobjc-core/libffi-src/tests/testsuite/libffi.call/
H A Dpyobjc-tc.c50 point_type.elements = malloc(3 * sizeof(ffi_type*));
51 point_type.elements[0] = &ffi_type_float;
52 point_type.elements[1] = &ffi_type_float;
53 point_type.elements[2] = NULL;
58 size_type.elements = malloc(3 * sizeof(ffi_type*));
59 size_type.elements[0] = &ffi_type_float;
60 size_type.elements[1] = &ffi_type_float;
61 size_type.elements[2] = NULL;
66 rect_type.elements = malloc(3 * sizeof(ffi_type*));
67 rect_type.elements[
[all...]

Completed in 234 milliseconds

1234567891011>>