Class TDynArray_11

AppendItem = IncLength and set last element to Item

Copies contents of Source to this object.

This is equivalent to doing Length := 0 and AppendDynarray(Source). Maybe some day I will make TDynArray_11 descendant of TPersistent, then I will make Assign compatible with the TPersistent.Assign interface.

Remember that this is *not* a so-called deep copy, because if Source contains some pointers we're simply copying these pointers (not duplicating their content constructing new objects or something like that). This is just a simple copy of memory contents (well, with proper Initialize/Finalize in case DYNARRAY_11_IS_INIT_FINI_TYPE).

This is equivalent to Count := 0 and then AppendArray(NewItems).

Returns -1 if not found

Returns -1 if not found, searches within Items[BeginIndex] .. Items[EndIndex]. BeginIndex may be < 0 and EndIndex may be > High, it doesn't matter, the range will be "clamped" as it should.

Searches for and deletes first item equal to Value.

Searches for and deletes all items equal to Value.

Just like Delete from Pascal's RTL on strings: deletes Count items starting from position Index. Length of array will be decreased by Count items, and the last items of array will be shifted to the left to take positions of deleted items.

Note that Index and DelCount parameters will be checked for correctness and eventually corrected. So if Index is >= Count then nothing will be removed. And if DelCount items from Index would be larger than Count then DelCount will be corrected to be smaller.

Inserts Item at position Index into array. Index must be in range 0 .. Count (yes, we can insert element at the end of the array). After insertion array has Count increased by 1, Items[Index] = Item and all items that were on positions [Index..old High] are now at [Index+1..new High].

Sorts items. All you have to do is to pass some IsSmallerFunc – see KambiUtils.Sort for specification what it should do, but note that TDynArrayItemIsSmallerFunc_11 here gets parameter types already casted to TDynArrayItem_11, instead of dirty pointers (like IsSmallerFunc that must be passed to KambiUtils.Sort).

If you don't give First/LastIndex it assumes FirstIndex = 0 and LastIndex = High, so the whole array will be sorted.

This is a comfortable Items property, that allows you to both read and write items in this array.

Note that it has different types: for Delphi (and FPC Delphi mode) it has PInfiniteArray_11 type, for ObjFpc mode is has PDynArrayItem_11. This way you can always access items like Items[Index] (no need to write Itemsˆ[Index]).

This is like Items, but it has always (both for FPC ObjFpc mode and Delphi) type PInfiniteArray_11. This means that you can always read/write items like ItemsArrayˆ[Index]. Under ObjFpc you will not be able to write ItemsArray[Index] (i.e. omit this ˆ character).