sllist_basic.sleela
impl/examples/sllist_basic.sleela · 34 line(s) · sleela
#sleela 2.1
// SLList checks: ordered string storage, bounds, mutation, reuse, recursion.
class SLListBasic {
int recursiveLength(SLList list, int depth) {
if (depth <= 0) { return list.length(); }
return recursiveLength(list, depth - 1);
}
void main() {
SLList names = new SLList();
names.add("Ada");
names.add("Grace");
names.add("Edsger");
print(names.length()); // 3
print(names.get(0)); // Ada
print(names.get(1)); // Grace
print(names.set(1, "Katherine")); // true
print(names.get(1)); // Katherine
print(names.removeAt(0)); // true
print(names.get(0)); // Katherine
print(names.length()); // 2
print(names.get(8) == null);// true
print(names.removeAt(8)); // false
print(recursiveLength(names, 4)); // 2: same list reference crosses recursive calls
names.remove(); // remove last item
print(names.length()); // 1
names.clear();
print(names.empty()); // true
names.add("reused capacity");
print(names.get(0)); // reused capacity
}
}