g++ [flags ...] file ... -l /isip/tools/lib/$ISIP_BINARY/lib_io.a

#include <SofList.h>

SofList();
SofList(const SofList& arg);
boolean add(long name, long tag, long pos, long size);
long first(long name);
long last(long name);
long getCount();

SofList list;

// setup a simple symbol table
//
SofSymbolTable table;      
SysString n1(L"Long");
long i1 = table.add(n1);

// add a node to the soflist
//
list.setTable(table);
list.add(i1, 0, -1, sizeof(long));
list.debug(L"added nodes");
      
long tag = list.prev(i1, 1000);
if (tag != 0) {
  Console::put(L"Error in previous");
}

• if y is a node in the left subtree of x, then key[y] <= key[x],
• if y is a node in the right subtree of x, then key[x] <= key[y]

T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, McGraw-Hill, New York, New York, USA, pp. 140-149, 1997.

• This is a simple example wherein we define nodes. Then these nodes are added to the list of objects and we use search methods to test random access to the data.

  SofList list;
  
  // setup a simple symbol table
  //
  SofSymbolTable table;
       
  SysString n1(L"Long");    long i1 = table.add(n1);
  SysString n2(L"Short");   long i2 = table.add(n2);
  SysString n3(L"Float");   long i3 = table.add(n3);
  SysString n4(L"Char");    long i4 = table.add(n4);
  
  list.add(i1, 0, -1, sizeof(long));
  list.add(i2, 0, -1, sizeof(short));
  list.add(i3, 0, -1, sizeof(float));
  list.add(i4, 0, -1, sizeof(char));
  
  list.add(i2, 1, -1, sizeof(short));
  list.add(i1, -1, -1, sizeof(long));
  list.add(i4, 3, -1, sizeof(char));
  list.add(i4, 2, -1, sizeof(char));
         
  long tag = list.first(i4);
  if (tag != 0) {
   Console::put(L"Error in first");
  }
  
  tag = list.next(i4, tag);
  if (tag != 2) {
   Console::put(L"Error in next");
  }
  
  tag = list.next(i2, -100);
  if (tag != 0) {
   Console::put(L"Error in next");
  }
  
  tag = list.prev(i1, 1000);
  if (tag != 0) {
   Console::put(L"Error in first");
  }

• none