new ArrayList:myList = NewArrayList<INTEGER>(5);
new ArrayList:myList = NewArrayList<INTEGER>(5);
ArrayList::Destroy(myList);
if (ArrayList::IsValid(myList))
print ("List exist");
else
print ("List not exist");
new ArrayList:myList = NewArrayList<INTEGER>(5);
ArrayList::Add (myList, 45641234);
new ArrayList:floatList = NewArrayList<FLOAT>(2);
ArrayList::Add (floatList, 55.0564495);
new ArrayList:myList = NewArrayList<INTEGER>(5);
ArrayList::Add (myList, 45641234);
ArrayList::Add (myList, 123);
ArrayList::Add (myList, 687654);
ArrayList::Remove (myList, 1); //123
// this is better and safely
ArrayList::Remove (myList, ArrayList::IndexOf (myList, 123); // This will remove index where is value '123'
new ArrayList:myList = NewArrayList<INTEGER>(5);
ArrayList::Add (myList, 45641234);
ArrayList::Add (myList, 123);
ArrayList::Add (myList, 687654);
new size = ArrayList::Size (myList);
print (size); // This will print 3
new ArrayList:myList = NewArrayList<INTEGER>(5);
ArrayList::Add (myList, 45641234);
ArrayList::Add (myList, 123);
ArrayList::Add (myList, 687654);
new capacity = ArrayList::Capacity(myList);
print (capacity); // This will print 5
new ArrayList:myList = NewArrayList<INTEGER>(5);
ArrayList::Add (myList, 45641234);
ArrayList::Add (myList, 123);
ArrayList::Add (myList, 687654);
new index2 = ArrayList::Get (myList, 2);
print (index2); // This will print 687654
new ArrayList:myList = NewArrayList<INTEGER>(5); // Capacity now is 5
ArrayList::Add (myList, 45641234);
ArrayList::Add (myList, 123);
ArrayList::Add (myList, 687654);
ArrayList::EnsureCapacity (myList, 15); // Now capacity of myList is 15
new ArrayList:myList = NewArrayList<INTEGER>(5); // Capacity now is 5
ArrayList::Add (myList, 45641234);
ArrayList::Add (myList, 123);
ArrayList::Add (myList, 687654);
// This will clear all values in this list
ArrayList::Clear(myList);
new ArrayList:myList = NewArrayList<INTEGER>(5);
ArrayList::Add (myList, 45641234); // index 0
ArrayList::Add (myList, 123); // index 1
ArrayList::Add (myList, 687654); //index 2 - we want this
new index = ArrayList::IndexOf (myList, 687654); // now index variable is 2
[14:41:15] Test with 1000 items [14:41:15] Created and inserted items in 2ms, Readed in 2ms
[14:41:26] Test with 10000 items [14:41:26] Created and inserted items in 151ms, Readed in 149ms
[14:41:44] Test with 15000 items [14:41:44] Created and inserted items in 341ms, Readed in 335ms
Yea man.. i will probably release it tomorrow. there is a speed with inserting and reading data from arraylist 1000 items [22:51:23] Test with 1000 items [22:51:23] Created and inserted items in 3ms, Readed in 128ms 15000 [22:52:57] Test with 15000 items [22:52:57] Created and inserted items in 353ms, Readed in 1401ms 65535 [22:54:27] Test with 65535 items [22:54:27] Created and inserted items in 6530ms, Readed in 11748ms |
[22:54:27] Test with 65535 items [22:54:27] Created and inserted items in 6530ms, Readed in 11748ms |
// 65535 // change test to number which you want new test = 0xFFFF; new t1 = GetTickCount(); new ArrayList:l = NewArrayList<INTEGER>(test); for (new i = 0; i < test; i++) ArrayList::Add(l, i); new t1end = GetTickCount() - t1; new t2 = GetTickCount(); for (new i = 0; i < test; i++) printf ("%d", ArrayList::Get(l, i)); new t2end = GetTickCount() - t2; printf ("Test with %d items", test); printf ("Created and inserted items in %dms, Readed in %dms", t1end, t2end);
Код:
// 65535 // change test to number which you want new test = 0xFFFF; new t1 = GetTickCount(); new ArrayList:l = NewArrayList<INTEGER>(test); for (new i = 0; i < test; i++) ArrayList::Add(l, i); new t1end = GetTickCount() - t1; new t2 = GetTickCount(); for (new i = 0; i < test; i++) printf ("%d", ArrayList::Get(l, i)); new t2end = GetTickCount() - t2; printf ("Test with %d items", test); printf ("Created and inserted items in %dms, Readed in %dms", t1end, t2end); |