Searched refs:array (Results 26 - 50 of 103) sorted by relevance

12345

/haiku/src/tests/kits/app/bmessage/
H A DMessageBPointItemTest.h42 ArrayType array; local
43 array.push_back(BPoint(30.0, 30.0));
44 array.push_back(BPoint(40.0, 40.0));
45 array.push_back(BPoint(50.0, 50.0));
46 return array;
H A DMessageBRectItemTest.h42 ArrayType array; local
43 array.push_back(BRect(1, 2, 3, 4));
44 array.push_back(BRect(4, 5, 6, 7));
45 array.push_back(BRect(7, 8, 9, 10));
46 return array;
H A DMessageCStringItemTest.h45 ArrayType array; local
46 array.push_back(Zero());
47 array.push_back(Test1());
48 array.push_back(Test2());
49 return array;
H A DMessageMessageItemTest.h124 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 DMessagePointerItemTest.h58 ArrayType array; local
59 array.push_back(Zero());
60 array.push_back(Test1());
61 array.push_back(Test2());
62 return array;
H A DMessageMessengerItemTest.h64 ArrayType array; local
65 array.push_back(Zero());
66 array.push_back(Test1());
67 array.push_back(Test2());
68 return array;
H A DMessageBStringItemTest.h116 ArrayType array; local
117 array.push_back(Zero());
118 array.push_back(Test1());
119 array.push_back(Test2());
120 return array;
H A DMessageFlattenableItemTest.h152 ArrayType array; local
153 array.push_back(Zero());
154 array.push_back(Test1());
155 array.push_back(Test2());
156 return array;
H A DMessageRefItemTest.h141 ArrayType array; local
142 array.push_back(Zero());
143 array.push_back(Test1());
144 array.push_back(Test2());
145 return array;
/haiku/src/apps/terminal/
H A DThemeView.cpp147 text_run_array *array = (text_run_array*)malloc(sizeof(text_run_array) local
151 array->count = 16;
152 array->runs[0].offset = offset;
153 array->runs[0].font = *be_fixed_font;
154 array->runs[0].color = prefHandler->getRGB(PREF_ANSI_BLACK_COLOR);
156 array->runs[1].offset = offset;
157 array->runs[1].font = *be_fixed_font;
158 array->runs[1].color = prefHandler->getRGB(PREF_ANSI_RED_COLOR);
160 array->runs[2].offset = offset;
161 array
[all...]
/haiku/src/libs/stdc++/legacy/
H A Dioextend.cc63 // 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/bin/rc/tests/
H A Dbuiltin.rdef80 array icon[1024]
86 array icon[256]
/haiku/src/tests/add-ons/kernel/file_systems/bfs/array/
H A Darray.cpp18 printf(" items in array: %ld\n",gArray.CountItems());
29 // insert numbers in the array
39 printf("Could not insert entry in array, but it's not in there either...\n");
45 // check for numbers in the array
51 printf("could not found entry %ld in array!\n",num);
56 // iterate through the array
58 sorted_array *array = gArray.Array(); local
59 for (int32 i = 0;i < array->count;i++) {
60 if (!gList.HasItem((void *)array->values[i])) {
61 printf("Could not find entry %lld at %ld in list!\n",array
[all...]
/haiku/src/tests/kits/app/bmessenger/
H A DHelpers.h41 inline AutoDeleter(T *object, bool array = false)
42 : fObject(object), fArray(array) {}
/haiku/src/add-ons/kernel/file_systems/udf/
H A DArray.h13 /*! \brief Slightly more typesafe static array type than built-in arrays,
14 with array length information stored implicitly (i.e. consuming no
19 struct array { struct
36 /*! \brief \c uint8 specialization of the \c array template struct. */
38 struct array<uint8, arrayLength> { struct
43 sprintf(classname, "array<uint8, %" B_PRIu32 ">", arrayLength);
63 /*! \brief \c char specialization of the \c array template struct. */
65 struct array<char, arrayLength> { struct
70 sprintf(classname, "array<uint8, %" B_PRIu32 ">", arrayLength);
H A DUdfStructures.h181 array<uint8, 4> _reserved;
200 array<uint8, 6> _implementation_use;
246 array<uint8, 5> _reserved;
284 const array<uint8, kIdentifierSuffixLength>& identifier_suffix() const { return _identifier_suffix; }
285 array<uint8, kIdentifierSuffixLength>& identifier_suffix() { return _identifier_suffix; }
292 array<uint8, kIdentifierSuffixLength> _identifier_suffix;
506 const array<uint8, 6>& implementation_use() const { return _implementation_use; }
507 array<uint8, 6>& implementation_use() { return _implementation_use; }
558 array<uint8, 6> _implementation_use;
707 const array<cha
[all...]
/haiku/src/add-ons/kernel/drivers/input/i2c_hid/
H A DDriver.cpp69 acpi_object_type array[4]; local
72 acpi_objects.pointer = array;
74 array[0].object_type = ACPI_TYPE_BUFFER;
75 array[0].buffer.buffer = (void*)guid;
76 array[0].buffer.length = 16;
78 array[1].object_type = ACPI_TYPE_INTEGER;
79 array[1].integer.integer = revision;
81 array[2].object_type = ACPI_TYPE_INTEGER;
82 array[2].integer.integer = function;
84 array[
[all...]
/haiku/src/servers/mail/
H A DErrorLogWindow.cpp154 text_run_array array; local
155 array.count = 1;
156 array.runs[0].offset = 0;
157 array.runs[0].font = *be_bold_font;
158 array.runs[0].color = HighColor();
176 view->Insert(0, tagString.String(), tagString.Length(), &array);
180 array.runs[0].color = tint_color(ui_color(B_PANEL_BACKGROUND_COLOR),B_DARKEN_2_TINT);
181 array.runs[0].font.SetSize(9);
187 view->Insert(view->TextLength(),atime.String(),atime.Length(),&array);
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DJournal.cpp200 /*! Inserts the block_run into the array. You will have to make sure the
201 array is large enough to contain the entry before calling this function.
224 // For whatever reason, BFS restricts the maximum array size
292 run_array* array; local
293 while (fArrays.Pop(&array))
294 free(array);
302 run_array* array = ArrayAt(i); local
304 for (int32 j = 0; j < array->CountRuns(); j++) {
305 block_run& arrayRun = array->runs[j];
320 /*! Adds the specified block_run into the array
346 run_array* array = (run_array*)malloc(blockSize); local
449 _CheckRunArray(const run_array* array) argument
491 const run_array* array = (const run_array*)cachedArray.Block(); local
811 run_array* array = runArrays.ArrayAt(k); local
[all...]
H A DBPlusTree.cpp34 /*! Simple array used for the duplicate handling in the B+Tree. This is an
1061 // binary search in the key array
1179 duplicate_array* array = fragment->FragmentAt(j); local
1181 if (array->IsEmpty()) {
1218 duplicate_array* array = duplicate->FragmentAt(
1220 int32 arrayCount = array->Count();
1222 FATAL(("_InsertDuplicate: Invalid array[%d] size in fragment "
1231 array->Insert(value);
1240 memmove(duplicate->DuplicateArray(), array,
1245 array
1286 duplicate_array* array; local
1350 duplicate_array* array = fragment->FragmentAt(fragmentIndex); local
1844 duplicate_array* array = duplicate->FragmentAt( local
1885 duplicate_array* array = NULL; local
2420 duplicate_array* array; local
2986 duplicate_array* array = FragmentAt(i); local
[all...]
/haiku/src/add-ons/translators/psd/
H A DDataArray.cpp159 BDataArray::Append(BDataArray& array) argument
161 return Append(array.Buffer(), array.Length());
262 BDataArray::operator<<(BDataArray& array) argument
264 Append(array);
/haiku/src/add-ons/print/drivers/gutenprint/
H A DGPCapabilityExtractor.cpp310 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;
/haiku/src/add-ons/input_server/filters/shortcut_catcher/
H A DParseCommandLine.cpp197 // terminate the array
220 // Make new, independent clone of an argv array and its strings.
242 char* array = NULL; local
244 // make our own copy of the array...
258 array = new char[strlen(beginWord) + 1];
259 strcpy(array, beginWord);
260 UnGunk(array);
264 BString string(array != NULL ? array : "");
265 delete[] array;
[all...]
/haiku/headers/private/fs_shell/
H A Dfssh_auto_deleter.h10 ArrayDeleter - deletes an array
99 inline void operator()(C *array) argument
101 delete[] array;
109 ArrayDeleter(C *array) : AutoDeleter<C, ArrayDelete<C> >(array) {} argument
/haiku/src/servers/app/drawing/interface/remote/
H A DRemoteMessage.h167 void AddList(const T* array, int32 count);
189 status_t ReadList(T* array, int32 count);
295 RemoteMessage::AddList(const T* array, int32 count) argument
298 Add(array[i]);
347 RemoteMessage::ReadList(T* array, int32 count) argument
350 status_t result = Read(array[i]);

Completed in 100 milliseconds

12345