100 this->
free = first_entry;
101 size_t i = first_entry;
103 while (entry_count-- > 0)
136 for (
size_t i = 0; i < this->
size; i++)
147 size_t new_index = this->
free;
209 size_t item_index = integer_index->
getValue();
210 if (item_index >= this->
size)
232 if (item_index >= this->
size)
285 return element->
value;
367 while (counter-- > 0)
392 size_t new_index = this->
getFree();
416 this->
first = new_index;
417 this->
last = new_index;
428 element->
next = new_index;
429 this->
last = new_index;
439 this->
first = new_index;
462 size_t new_index = this->
getFree();
470 this->
first = new_index;
471 this->
last = new_index;
481 new_element->
next = new_index;
482 this->
last = new_index;
492 size_t new_index = this->
getFree();
500 this->
first = new_index;
501 this->
last = new_index;
513 this->
first = new_index;
527 return this->
insert(_value, _index);
557 size_t new_index = this->
getFree();
592 this->
first = new_index;
593 this->
last = new_index;
605 this->
first = new_index;
615 this->
last = new_index;
622 element->
next = new_index;
815 return element->
next;
892 size_t nextEntry = this->
first;
893 for (
size_t i = 1; i <= this->
count; i++)
897 nextEntry = element->
next;
945 size_t nextEntry = this->
first;
946 for (
size_t i = 1; i <= this->
count; i++)
950 nextEntry = element->
next;
970 size_t nextEntry = this->
first;
971 for (
size_t i = 1; i <= this->
count; i++)
979 nextEntry = element->
next;
1000 size_t nextEntry = this->
first;
1001 for (
size_t i = 1; i <= this->
count; i++)
1009 nextEntry = element->
next;
1029 size_t nextEntry = this->
first;
1031 for (
size_t i = 1; i <= this->
count; i++)
1040 nextEntry = element->
next;
1064 size_t nextEntry = this->
first;
1066 for (
size_t i = 1; i <= this->
count; i++)
1070 if (target == element->
value)
1075 nextEntry = element->
next;
1099 ((this_value = this->
value(_index)) != _value) && _index != last_index;
1100 _index = this->
next(_index));
1104 if (this_value == _value)
1120 size_t nextEntry = this->
first;
1121 for (
size_t i = 1; i <= this->
count; i++)
1126 nextEntry = element->
next;
1185 size_t itemCount = this->
count;
1213 void *RexxList::operator
new(
size_t size)
1229 size_t named_argCount)
1257 newList->
sendMessage(OREF_INIT, init_args, argCount, named_argCount);
1264 size_t named_argCount)
1273 size_t _size = argCount;
1276 for (
size_t i = 0; i < _size; i++)
1290 size_t _size = argCount;
1295 for (
size_t i = 0; i < _size; i++)
void reportException(wholenumber_t error)
RexxArray * new_array(size_t s)
RexxInteger * new_integer(wholenumber_t v)
#define INITIAL_LIST_SIZE
void requiredArgument(RexxObject *object, RexxString *kind, size_t position)
RexxInteger * REQUEST_INTEGER(RexxObject *obj)
#define Error_Incorrect_method_noarg
#define Error_Incorrect_method_index
#define memory_mark(oref)
#define flatten_reference(oref, envel)
#define CLASS_CREATE(name, id, className)
#define memory_mark_general(oref)
#define setUpFlatten(type)
RexxSupplier * new_supplier(RexxArray *c, RexxArray *f)
void put(RexxObject *eref, size_t pos)
size_t append(RexxObject *)
RexxClass * getOwningClass()
RexxBehaviour * getInstanceBehaviour()
RexxObject * getValue(RexxActivation *)
void setBehaviour(RexxBehaviour *b)
virtual RexxObject * copy()
RexxBehaviour * behaviour
size_t previousIndex(size_t i)
RexxObject * append(RexxObject *)
RexxObject * value(RexxObject *)
void partitionBuffer(size_t, size_t)
RexxArray * makeArrayIndices()
RexxObject * next(RexxObject *)
RexxObject * removeObject(RexxObject *)
RexxObject * sectionSubclass(LISTENTRY *, size_t)
size_t nextIndex(size_t i)
RexxObject * hasIndex(RexxObject *)
void flatten(RexxEnvelope *)
RexxObject * insert(RexxObject *, RexxObject *)
RexxObject * previous(RexxObject *)
RexxObject * removeItem(RexxObject *)
RexxObject * primitiveRemove(LISTENTRY *)
LISTENTRY * getEntry(RexxObject *, RexxObject *)
RexxList * classOf(RexxObject **, size_t, size_t)
RexxArray * weakReferenceArray()
RexxObject * add(RexxObject *, RexxObject *)
RexxObject * hasItem(RexxObject *)
void liveGeneral(int reason)
RexxObject * put(RexxObject *, RexxObject *)
RexxObject * index(RexxObject *)
RexxObject * remove(RexxObject *)
RexxList * newRexx(RexxObject **, size_t, size_t)
RexxArray * requestArray()
RexxObject * section(RexxObject *, RexxObject *)
static RexxClass * classInstance
RexxObject * indexOfValue(RexxObject *)
static void createInstance()
RexxObject * insertRexx(RexxObject *, RexxObject *)
RexxObject * getValue(size_t i)
void addLast(RexxObject *value)
RexxSupplier * supplier()
void addFirst(RexxObject *value)
stringsize_t requiredNonNegative(RexxString *kind, size_t position, size_t precision=Numerics::ARGUMENT_DIGITS)
bool equalValue(RexxObject *other)
void sendMessage(RexxString *, RexxArray *, RexxDirectory *, ProtectedObject &)