/haiku/src/tests/kits/app/bmessage/ |
H A D | MessageItemTest.h | 61 static SizeType Size(ArrayType& array) { return array.size(); } argument
|
H A D | MessageMessageItemTest.h | 124 ArrayType() : array(NULL), size(0) {;} 125 ArrayType(const ArrayType& rhs) : array(NULL), size(0) 127 ArrayType(BMessage* data, uint32 len) : array(NULL), size(0) 129 ~ArrayType() { if (array) delete[] array; } 134 Assign(rhs.array, rhs.size); 142 return array[index]; 150 if (array) 151 delete[] array; 152 array 156 BMessage* array; member in class:ArrayTypeBase::ArrayType 161 Size(ArrayType& array) argument 185 BMessage array[3]; local [all...] |
H A D | MessageMessengerItemTest.h | 64 ArrayType array; local 65 array.push_back(Zero()); 66 array.push_back(Test1()); 67 array.push_back(Test2()); 68 return array;
|
H A D | MessagePointerItemTest.h | 58 ArrayType array; local 59 array.push_back(Zero()); 60 array.push_back(Test1()); 61 array.push_back(Test2()); 62 return array;
|
H A D | MessageRefItemTest.h | 141 ArrayType array; local 142 array.push_back(Zero()); 143 array.push_back(Test1()); 144 array.push_back(Test2()); 145 return array;
|
/haiku/src/tests/kits/app/bmessenger/ |
H A D | Helpers.h | 41 inline AutoDeleter(T *object, bool array = false) 42 : fObject(object), fArray(array) {}
|
/haiku/src/tests/system/boot/heap/ |
H A D | heapTest.cpp | 123 random_allocations(void* array[], size_t maxSize) argument 132 array[i] = test_malloc(size); 133 if (array[i] == NULL) { 141 dump_allocated_chunk(i, array[i]); 176 void* array[100]; local 178 array[i] = test_malloc(128); 179 dump_allocated_chunk(i, array[i]); 190 test_free(array[i]); 191 array[i] = NULL; 200 test_free(array[ [all...] |
/haiku/src/libs/stdc++/legacy/ |
H A D | ioextend.cc | 63 // We implement this as a single array, each of whose element is 65 // We also specify that (the i field of) the 0'th element of the array 66 // contains the allocated length of the array (not counting that 79 register struct ptr_and_long *array = (ptr_and_long*)io._arrays; local 80 int old_length = array == NULL ? 0 : array[0].i; 87 if (array != NULL) 90 new_array[i] = array[i]; 91 delete [] array; 101 array [all...] |
/haiku/src/servers/mail/ |
H A D | DeskbarViewIcons.rdef | 11 resource(kIconNoMail) #'VICN' array { 46 resource(kIconNewMail) #'VICN' array {
|
/haiku/src/servers/media/ |
H A D | media_server.rdef | 21 resource vector_icon array {
|
/haiku/src/servers/media_addon/ |
H A D | media_addon_server.rdef | 21 resource vector_icon array {
|
/haiku/src/servers/mount/ |
H A D | mount_server.rdef | 21 resource vector_icon array {
|
/haiku/src/servers/registrar/ |
H A D | registrar.rdef | 27 resource vector_icon array { 42 resource large_icon array { 77 resource mini_icon array {
|
/haiku/src/system/boot/platform/pxe_ia32/ |
H A D | pxe_undi.h | 194 uint8 array[4]; member in union:__anon5317
|
/haiku/src/libs/mapm/ |
H A D | mapmfact.c | 31 * facilitate 'gcov' code coverage tool by making an array smaller 37 * increase size of DOS array 80 * Store this temp product into an array. 85 * Store this temp product into the next element of the array. 89 * We now have an array of numbers with approx the same number 91 * ended.) Now multiply each of the array elements together to 94 * The array multiplies are done as follows (assume we used 11 95 * array elements for this example, indicated by [0] - [10] ) : 132 /* define size of local array for temp storage */ 140 M_APM array[NDI local [all...] |
/haiku/src/bin/rc/ |
H A D | lexer.l | 88 array return ARRAY;
|
H A D | parser.y | 131 %type <d> archive array arrayfields data expr message msgfield 290 array 454 | array { $$ = cast($1.type, $1); } 464 | typecast array { $$ = cast($1, $2); }
|
/haiku/src/bin/rc/tests/ |
H A D | builtin.rdef | 80 array icon[1024] 86 array icon[256]
|
/haiku/src/bin/mail_utils/ |
H A D | mail2mbox.rdef | 18 resource large_icon array { 53 resource mini_icon array {
|
H A D | spamdbm.rdef | 24 resource(1, "Busy Cursor") #'CURS' array { 30 resource(0, "BEOS:L:text/x-vnd.agmsmith.spam_probability_database") #'ICON' array { 65 resource large_icon array { 100 resource(0, "BEOS:M:text/x-vnd.agmsmith.spam_probability_database") #'MICN' array { 119 resource mini_icon array {
|
/haiku/src/apps/networkstatus/ |
H A D | NetworkStatusIcons.rdef | 11 resource(kNetworkStatusNoDevice) #'VICN' array { 31 resource(kNetworkStatusNoConnection) #'VICN' array { 53 resource(kNetworkStatusNoSettings) #'VICN' array { 74 resource(kNetworkStatusConnecting) #'VICN' array { 96 resource(kNetworkStatusReady) #'VICN' array {
|
/haiku/src/add-ons/kernel/file_systems/netfs/authentication_server/ |
H A D | authentication_server.rdef | 21 resource vector_icon array {
|
/haiku/src/add-ons/kernel/file_systems/reiserfs/ |
H A D | Settings.h | 119 contains(const char **array, size_t size, const char *value) argument 122 if (!strcmp(array[i], value))
|
/haiku/src/add-ons/print/drivers/gutenprint/ |
H A D | GPCapabilityExtractor.cpp | 310 struct BaseCap** array = fCapabilities->fDriverSpecificCategories.Array(); local 314 array[index] = *it; 319 GPCapabilityExtractor::AddCapability(GPArray<struct BaseCap>& array, argument 323 array.Array()[fIndex] = capability; 338 GPArray<struct BaseCap>& array = fCapabilities->fDriverSpecificCapabilities local 340 array.SetSize(1); 341 array.Array()[0] = capability;
|
H A D | GPCapabilityExtractor.h | 63 void AddCapability(GPArray<struct BaseCap>& array, EnumCap* capability,
|