| /src/external/gpl3/binutils/dist/include/ |
| partition.h | 23 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
48 /* The next element in this class. Elements in each class form 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
[all...] |
| partition.h | 23 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
48 /* The next element in this class. Elements in each class form 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
[all...] |
| /src/external/gpl3/binutils.old/dist/include/ |
| partition.h | 23 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
48 /* The next element in this class. Elements in each class form 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
[all...] |
| partition.h | 23 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
48 /* The next element in this class. Elements in each class form 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
[all...] |
| /src/external/gpl3/gcc/dist/include/ |
| partition.h | 23 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
48 /* The next element in this class. Elements in each class form 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
[all...] |
| partition.h | 23 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
48 /* The next element in this class. Elements in each class form 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
[all...] |
| /src/external/gpl3/gcc.old/dist/include/ |
| partition.h | 23 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
48 /* The next element in this class. Elements in each class form 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
[all...] |
| partition.h | 23 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
48 /* The next element in this class. Elements in each class form 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
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.python/ |
| py-bad-printers.c | 25 int *elements; member in struct:container
35 result.elements = 0;
44 c->elements = array;
45 c->elements[c->len] = val;
|
| py-bad-printers.c | 25 int *elements; member in struct:container
35 result.elements = 0;
44 c->elements = array;
45 c->elements[c->len] = val;
|
| /src/external/gpl3/gdb.old/dist/include/ |
| partition.h | 23 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
48 /* The next element in this class. Elements in each class form 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
[all...] |
| partition.h | 23 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
48 /* The next element in this class. Elements in each class form 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
[all...] |
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.python/ |
| py-bad-printers.c | 25 int *elements; member in struct:container
35 result.elements = 0;
44 c->elements = array;
45 c->elements[c->len] = val;
|
| py-bad-printers.c | 25 int *elements; member in struct:container
35 result.elements = 0;
44 c->elements = array;
45 c->elements[c->len] = val;
|
| /src/external/gpl3/gdb/dist/include/ |
| partition.h | 23 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
48 /* The next element in this class. Elements in each class form 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
[all...] |
| partition.h | 23 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
48 /* The next element in this class. Elements in each class form 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
[all...] |
| /src/sys/external/bsd/drm2/include/linux/ |
| nbsd-namespace-acpi.h | 34 #define elements Elements macro
|
| nbsd-namespace-acpi.h | 34 #define elements Elements macro
|
| /src/tests/include/sys/ |
| t_pslist.c | 60 } elements[] = { local
78 PSLIST_ENTRY_DESTROY(&elements[0], entry);
80 for (i = 0; i < __arraycount(elements); i++)
81 PSLIST_ENTRY_INIT(&elements[i], entry);
83 PSLIST_WRITER_INSERT_HEAD(&h, &elements[4], entry);
84 PSLIST_WRITER_INSERT_BEFORE(&elements[4], &elements[2], entry);
85 PSLIST_WRITER_INSERT_BEFORE(&elements[4], &elements[3], entry);
86 PSLIST_WRITER_INSERT_BEFORE(&elements[2], &elements[1], entry)
[all...] |
| t_pslist.c | 60 } elements[] = { local
78 PSLIST_ENTRY_DESTROY(&elements[0], entry);
80 for (i = 0; i < __arraycount(elements); i++)
81 PSLIST_ENTRY_INIT(&elements[i], entry);
83 PSLIST_WRITER_INSERT_HEAD(&h, &elements[4], entry);
84 PSLIST_WRITER_INSERT_BEFORE(&elements[4], &elements[2], entry);
85 PSLIST_WRITER_INSERT_BEFORE(&elements[4], &elements[3], entry);
86 PSLIST_WRITER_INSERT_BEFORE(&elements[2], &elements[1], entry)
[all...] |
| /src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/src/ |
| csv_reporter.cc | 34 std::vector<std::string> elements = { member in namespace:benchmark::__anon3654
59 for (auto B = elements.begin(); B != elements.end();) {
61 if (B != elements.end()) Out << ",";
99 Out << std::string(elements.size() - 3, ',');
|
| csv_reporter.cc | 34 std::vector<std::string> elements = { member in namespace:benchmark::__anon3654
59 for (auto B = elements.begin(); B != elements.end();) {
61 if (B != elements.end()) Out << ",";
99 Out << std::string(elements.size() - 3, ',');
|
| /src/external/apache2/llvm/dist/llvm/utils/benchmark/src/ |
| csv_reporter.cc | 34 std::vector<std::string> elements = { member in namespace:benchmark::__anon5830
57 for (auto B = elements.begin(); B != elements.end();) {
59 if (B != elements.end()) Out << ",";
95 Out << std::string(elements.size() - 3, ',');
|
| /src/external/gpl3/binutils/dist/ld/ |
| ldctor.h | 38 size_t count; /* Number of elements. */
39 struct set_element *elements; /* Elements in set. */ member in struct:set_info
|
| /src/external/gpl3/binutils.old/dist/ld/ |
| ldctor.h | 38 size_t count; /* Number of elements. */
39 struct set_element *elements; /* Elements in set. */ member in struct:set_info
|
