| /minix3/external/bsd/libc++/dist/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
| H A D | stable_partition.pass.cpp | 42 P array[] = in test() local
55 const unsigned size = sizeof(array)/sizeof(array[0]); in test()
56 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first()); in test()
57 assert(base(r) == array + 4); in test()
58 assert(array[0] == P(1, 1)); in test()
59 assert(array[1] == P(1, 2)); in test()
60 assert(array[2] == P(3, 1)); in test()
61 assert(array[3] == P(3, 2)); in test()
62 assert(array[4] == P(0, 1)); in test()
63 assert(array[5] == P(0, 2)); in test()
[all …]
|
| /minix3/external/bsd/libc++/dist/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/ |
| H A D | stable_partition.pass.cpp | 43 P array[] = in test() local
56 const unsigned size = sizeof(array)/sizeof(array[0]); in test()
57 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first()); in test()
58 assert(base(r) == array + 4); in test()
59 assert(array[0] == P(1, 1)); in test()
60 assert(array[1] == P(1, 2)); in test()
61 assert(array[2] == P(3, 1)); in test()
62 assert(array[3] == P(3, 2)); in test()
63 assert(array[4] == P(0, 1)); in test()
64 assert(array[5] == P(0, 2)); in test()
[all …]
|
| /minix3/crypto/external/bsd/heimdal/dist/base/ |
| H A D | array.c | 52 heim_array_t array = ptr; in array_dealloc() local
54 for (n = 0; n < array->len; n++) in array_dealloc()
55 heim_release(array->val[n]); in array_dealloc()
56 free(array->val); in array_dealloc()
78 heim_array_t array; in heim_array_create() local
80 array = _heim_alloc_object(&array_object, sizeof(*array)); in heim_array_create()
81 if (array == NULL) in heim_array_create()
84 array->val = NULL; in heim_array_create()
85 array->len = 0; in heim_array_create()
87 return array; in heim_array_create()
[all …]
|
| /minix3/external/bsd/llvm/dist/clang/test/CXX/dcl.decl/dcl.meaning/dcl.array/ |
| H A D | p3.cpp | 9 extern "C" int array[];
10 void declare() { extern int array[100]; } in declare()
11 …int value1 = sizeof(array); // expected-error {{invalid application of 'sizeof' to an incomplete t…
12 extern "C" int array[];
13 …int value2 = sizeof(array); // expected-error {{invalid application of 'sizeof' to an incomplete t…
17 extern "C" int array[];
19 { extern int array[100]; } in test()
20 extern int array[]; in test()
21 …int x = sizeof(array); // expected-error {{invalid application of 'sizeof' to an incomplete type '… in test()
26 void declare() { extern int array[100]; } in declare()
[all …]
|
| /minix3/external/bsd/llvm/dist/clang/test/Sema/ |
| H A D | warn-tautological-compare.c | 23 int array[2]; variable
26 if (!array) { // expected-warning {{address of array 'array' will always evaluate to 'true'}} in test1()
27 return array[0]; in test1()
28 …} else if (array != 0) { // expected-warning {{comparison of array 'array' not equal to a null poi… in test1()
29 return array[1]; in test1()
31 …if (array == 0) // expected-warning {{comparison of array 'array' equal to a null pointer is alway… in test1()
55 if (array) { } // expected-warning {{address of array 'array' will always evaluate to 'true'}} in test3()
56 …if (array != 0) {} // expected-warning {{comparison of array 'array' not equal to a null pointer i… in test3()
57 if (!array) { } // expected-warning {{address of array 'array' will always evaluate to 'true'}} in test3()
58 …if (array == 0) {} // expected-warning {{comparison of array 'array' equal to a null pointer is al… in test3()
[all …]
|
| H A D | warn-char-subscripts.c | 4 int array[1] = { 0 }; in t1() local
6 int val = array[subscript]; // expected-warning{{array subscript is of type 'char'}} in t1()
10 int array[1] = { 0 }; in t2() local
12 int val = subscript[array]; // expected-warning{{array subscript is of type 'char'}} in t2()
16 int *array = 0; in t3() local
18 int val = array[subscript]; // expected-warning{{array subscript is of type 'char'}} in t3()
22 int *array = 0; in t4() local
24 int val = subscript[array]; // expected-warning{{array subscript is of type 'char'}} in t4()
29 int *array = 0; in t5() local
30 int val = array[returnsChar()]; // expected-warning{{array subscript is of type 'char'}} in t5()
[all …]
|
| /minix3/external/bsd/dhcp/dist/omapip/ |
| H A D | array.c | 39 isc_result_t omapi_array_allocate (omapi_array_t **array, in omapi_array_allocate() argument
46 if (!array || *array) in omapi_array_allocate()
51 *array = aptr; in omapi_array_allocate()
57 isc_result_t omapi_array_free (omapi_array_t **array, in omapi_array_free() argument
63 if (!array || !*array) in omapi_array_free()
65 aptr = *array; in omapi_array_free()
71 *array = (omapi_array_t *)0; in omapi_array_free()
78 isc_result_t omapi_array_extend (omapi_array_t *array, char *ptr, in omapi_array_extend() argument
82 int new = array -> count; in omapi_array_extend()
83 status = omapi_array_set (array, ptr, new, file, line); in omapi_array_extend()
[all …]
|
| /minix3/external/bsd/libc++/dist/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/ |
| H A D | sort.pass.cpp | 80 int* array = new int[N]; in test_larger_sorts() local
84 array[i] = x; in test_larger_sorts()
89 std::sort(array, array+N); in test_larger_sorts()
90 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
92 std::random_shuffle(array, array+N); in test_larger_sorts()
93 std::sort(array, array+N); in test_larger_sorts()
94 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
96 std::sort(array, array+N); in test_larger_sorts()
97 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
99 std::reverse(array, array+N); in test_larger_sorts()
[all …]
|
| /minix3/external/bsd/libc++/dist/libcxx/test/algorithms/alg.sorting/alg.sort/stable.sort/ |
| H A D | stable_sort.pass.cpp | 80 int* array = new int[N]; in test_larger_sorts() local
84 array[i] = x; in test_larger_sorts()
89 std::stable_sort(array, array+N); in test_larger_sorts()
90 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
92 std::random_shuffle(array, array+N); in test_larger_sorts()
93 std::stable_sort(array, array+N); in test_larger_sorts()
94 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
96 std::stable_sort(array, array+N); in test_larger_sorts()
97 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
99 std::reverse(array, array+N); in test_larger_sorts()
[all …]
|
| /minix3/external/bsd/libc++/dist/libcxx/test/algorithms/alg.sorting/alg.sort/sort/ |
| H A D | sort.pass.cpp | 80 int* array = new int[N]; in test_larger_sorts() local
84 array[i] = x; in test_larger_sorts()
89 std::sort(array, array+N); in test_larger_sorts()
90 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
92 std::random_shuffle(array, array+N); in test_larger_sorts()
93 std::sort(array, array+N); in test_larger_sorts()
94 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
96 std::sort(array, array+N); in test_larger_sorts()
97 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
99 std::reverse(array, array+N); in test_larger_sorts()
[all …]
|
| /minix3/external/bsd/libc++/dist/libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/ |
| H A D | stable_sort.pass.cpp | 80 int* array = new int[N]; in test_larger_sorts() local
84 array[i] = x; in test_larger_sorts()
89 std::stable_sort(array, array+N); in test_larger_sorts()
90 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
92 std::random_shuffle(array, array+N); in test_larger_sorts()
93 std::stable_sort(array, array+N); in test_larger_sorts()
94 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
96 std::stable_sort(array, array+N); in test_larger_sorts()
97 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
99 std::reverse(array, array+N); in test_larger_sorts()
[all …]
|
| /minix3/external/bsd/llvm/dist/clang/test/SemaTemplate/ |
| H A D | function-template-specialization.cpp | 4 void f0(int (&array)[N]); // expected-note {{candidate template ignored: could not match 'int' agai…
7 template<> void f0(int (&array)[1]);
15 template<> void f0(char (&array)[1]); // expected-error{{no function template matches}}
16 template<> void f0<2>(int (&array)[2]) { } in f0()
19 template<typename T, int N> void f1(T (&array)[N]); // expected-note{{matches}}
20 template<int N> void f1(int (&array)[N]); // expected-note{{matches}}
22 template<> void f1(float (&array)[1]);
23 template<> void f1(int (&array)[1]);
26 template<typename T> void f1(T (&array)[17]); // expected-note{{matches}}
27 template<> void f1(int (&array)[17]); // expected-error{{ambiguous}}
[all …]
|
| /minix3/external/bsd/bind/dist/lib/isc/ |
| H A D | heap.c | 62 ! heap->compare(heap->array[(i)], \
63 heap->array[heap_parent(i)]))
72 void **array; member
99 heap->array = NULL; in isc_heap_create()
116 if (heap->array != NULL) in isc_heap_destroy()
117 isc_mem_put(heap->mctx, heap->array, in isc_heap_destroy()
136 if (heap->array != NULL) { in resize()
137 memmove(new_array, heap->array, heap->size * sizeof(void *)); in resize()
138 isc_mem_put(heap->mctx, heap->array, in resize()
142 heap->array = new_array; in resize()
[all …]
|
| /minix3/external/bsd/dhcpcd/dist/ |
| H A D | dhcpcd-definitions.conf | 20 define 33 request array ipaddress static_routes
21 define 3 request array ipaddress routers
23 define 4 array ipaddress time_servers
24 define 5 array ipaddress ien116_name_servers
25 define 6 array ipaddress domain_name_servers
26 define 7 array ipaddress log_servers
27 define 8 array ipaddress cookie_servers
28 define 9 array ipaddress lpr_servers
29 define 10 array ipaddress impress_servers
30 define 11 array ipaddress resource_location_servers
[all …]
|
| /minix3/common/lib/libprop/ |
| H A D | prop_array_util.c | 45 prop_array_get_bool(prop_array_t array, in prop_array_get_bool() argument
51 b = prop_array_get(array, indx); in prop_array_get_bool()
61 prop_array_set_bool(prop_array_t array, in prop_array_set_bool() argument
71 rv = prop_array_set(array, indx, b); in prop_array_set_bool()
79 prop_array_get_int ## size (prop_array_t array, \
85 num = prop_array_get(array, indx); \
106 prop_array_get_uint ## size (prop_array_t array, \
112 num = prop_array_get(array, indx); \
131 prop_array_set_int ## size (prop_array_t array, \
141 rv = prop_array_set(array, indx, num); \
[all …]
|
| /minix3/external/bsd/libc++/dist/libcxx/test/std/algorithms/alg.sorting/alg.nth.element/ |
| H A D | nth_element.pass.cpp | 26 int* array = new int[N]; in test_one() local
28 array[i] = i; in test_one()
29 std::random_shuffle(array, array+N); in test_one()
30 std::nth_element(array, array+M, array+N); in test_one()
31 assert(array[M] == M); in test_one()
32 std::nth_element(array, array+N, array+N); // begin, end, end in test_one()
33 delete [] array; in test_one()
|
| H A D | nth_element_comp.pass.cpp | 39 int* array = new int[N]; in test_one() local
41 array[i] = i; in test_one()
42 std::random_shuffle(array, array+N); in test_one()
43 std::nth_element(array, array+M, array+N, std::greater<int>()); in test_one()
44 assert(array[M] == N-M-1); in test_one()
45 std::nth_element(array, array+N, array+N, std::greater<int>()); // begin, end, end in test_one()
46 delete [] array; in test_one()
|
| /minix3/external/bsd/libc++/dist/libcxx/test/algorithms/alg.sorting/alg.nth.element/ |
| H A D | nth_element.pass.cpp | 26 int* array = new int[N]; in test_one() local
28 array[i] = i; in test_one()
29 std::random_shuffle(array, array+N); in test_one()
30 std::nth_element(array, array+M, array+N); in test_one()
31 assert(array[M] == M); in test_one()
32 std::nth_element(array, array+N, array+N); // begin, end, end in test_one()
33 delete [] array; in test_one()
|
| H A D | nth_element_comp.pass.cpp | 39 int* array = new int[N]; in test_one() local
41 array[i] = i; in test_one()
42 std::random_shuffle(array, array+N); in test_one()
43 std::nth_element(array, array+M, array+N, std::greater<int>()); in test_one()
44 assert(array[M] == N-M-1); in test_one()
45 std::nth_element(array, array+N, array+N, std::greater<int>()); // begin, end, end in test_one()
46 delete [] array; in test_one()
|
| /minix3/external/bsd/libc++/dist/libcxx/include/ |
| H A D | array | 2 //===---------------------------- array -----------------------------------===//
15 array synopsis
20 struct array
37 void swap(array& a) noexcept(noexcept(swap(declval<T&>(), declval<T&>())));
76 bool operator==(const array<T,N>& x, const array<T,N>& y);
78 bool operator!=(const array<T,N>& x, const array<T,N>& y);
80 bool operator<(const array<T,N>& x, const array<T,N>& y);
82 bool operator>(const array<T,N>& x, const array<T,N>& y);
84 bool operator<=(const array<T,N>& x, const array<T,N>& y);
86 bool operator>=(const array<T,N>& x, const array<T,N>& y);
[all …]
|
| /minix3/external/bsd/libc++/dist/libcxx/test/iterators/iterator.range/ |
| H A D | begin-end.pass.cpp | 108 void test_const_array( const T (&array)[Sz] ) { in test_const_array()
109 assert ( std::begin(array) == array ); in test_const_array()
110 assert (*std::begin(array) == array[0] ); in test_const_array()
111 assert ( std::begin(array) != std::end(array)); in test_const_array()
112 assert ( std::end(array) == array + Sz); in test_const_array()
114 assert ( std::cbegin(array) == array ); in test_const_array()
115 assert (*std::cbegin(array) == array[0] ); in test_const_array()
116 assert ( std::cbegin(array) != std::cend(array)); in test_const_array()
117 assert ( std::cend(array) == array + Sz); in test_const_array()
124 std::array<int, 1> a; a[0] = 3; in main()
|
| /minix3/external/bsd/libc++/dist/libcxx/test/std/iterators/iterator.range/ |
| H A D | begin-end.pass.cpp | 106 void test_const_array( const T (&array)[Sz] ) { in test_const_array()
107 assert ( std::begin(array) == array ); in test_const_array()
108 assert (*std::begin(array) == array[0] ); in test_const_array()
109 assert ( std::begin(array) != std::end(array)); in test_const_array()
110 assert ( std::end(array) == array + Sz); in test_const_array()
112 assert ( std::cbegin(array) == array ); in test_const_array()
113 assert (*std::cbegin(array) == array[0] ); in test_const_array()
114 assert ( std::cbegin(array) != std::cend(array)); in test_const_array()
115 assert ( std::cend(array) == array + Sz); in test_const_array()
122 std::array<int, 1> a; a[0] = 3; in main()
|
| /minix3/external/bsd/libc++/dist/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort/ |
| H A D | partial_sort.pass.cpp | 25 int* array = new int[N]; in test_larger_sorts() local
27 array[i] = i; in test_larger_sorts()
28 std::random_shuffle(array, array+N); in test_larger_sorts()
29 std::partial_sort(array, array+M, array+N); in test_larger_sorts()
31 assert(array[i] == i); in test_larger_sorts()
32 delete [] array; in test_larger_sorts()
|
| /minix3/external/bsd/libc++/dist/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort/ |
| H A D | partial_sort.pass.cpp | 25 int* array = new int[N]; in test_larger_sorts() local
27 array[i] = i; in test_larger_sorts()
28 std::random_shuffle(array, array+N); in test_larger_sorts()
29 std::partial_sort(array, array+M, array+N); in test_larger_sorts()
31 assert(array[i] == i); in test_larger_sorts()
32 delete [] array; in test_larger_sorts()
|
| /minix3/external/bsd/llvm/dist/clang/test/SemaObjC/ |
| H A D | conditional-expr-6.m | 25 NSArray *array = ((void*)0);
27 return (argc) ? set : array ;
32 NSArray *array = ((void*)0);
34 id <MyProtocol> instance = (argc) ? array : set;
35 id <MyProtocol> instance1 = (argc) ? set : array;
39 id <MyProtocol> instance3 = (argc) ? n1 : array;
42 id <MyProtocol> instance4 = (argc) ? array : qual_array;
43 id <MyProtocol> instance5 = (argc) ? qual_array : array;
46 id <MyProtocol> instance7 = (argc) ? qual_set : array;
51 return (argc) ? array : set;
|