CS202
6- ‹#›
+ Operators
list operator + (const
list & l1, const list & l2) {
//remember, neither l1
nor l2 should be modified!
list temp(l1); //positions tail at the end of l1
temp += l2; //how efficient is this?
return temp;
}
Or, should we instead:
list operator + (const
list & l1, const list & l2) {
list temp(l1); //positions tail at the end of l1
if (!temp.head) temp =
l2;
else {
node * dest = temp.tail;
node * source = l2.head;
while (source) {
dest->next = new node;
dest = dest->next;
dest->obj = source->obj;
source = source->next;
}
dest->next = NULL; temp.tail = dest;
temp.ptr = temp.head;
} return temp;
}
n
n
n