stringlist.e

/*

string list class that manages the freeing of its own strings and hides access to the underlying list implementation

*/

OPT MODULE

EXPORT OBJECT stringlist
  PRIVATE items:PTR TO LONG
  PRIVATE initialMax:LONG
ENDOBJECT

EXPORT PROC end() OF stringlist       -> destructor
  self.clear()
  DisposeLink(self.items)
ENDPROC

EXPORT PROC stringlist(maxSize=-1) OF stringlist  ->constructor
  IF maxSize=-1 THEN maxSize:=100
  self.initialMax:=maxSize
  self.items:=List(maxSize)
ENDPROC

EXPORT PROC item(n) OF stringlist
  ->IF (n<0) OR (n>=ListLen(self.items)) THEN WriteF('stringlist index error \d',n)
ENDPROC self.items[n]

EXPORT PROC clear() OF stringlist
  DEF i
  FOR i:=0 TO ListLen(self.items)-1
    DisposeLink(self.items[i])
  ENDFOR
  IF ListMax(self.items)>self.initialMax
    DisposeLink(self.items)
    self.items:=List(self.initialMax)
  ELSE  
    SetList(self.items,0)
  ENDIF
ENDPROC

EXPORT PROC expand() OF stringlist
  DEF old,len,inc
  old:=self.items
  len:=ListLen(old)
  inc:=Shr(len,2)
  IF inc<5 THEN inc:=5
  len:=len+inc
  self.items:=List(len)
  ListAdd(self.items,old)
  DisposeLink(old)
ENDPROC len

EXPORT PROC insert(pos,stringVal:PTR TO CHAR) OF stringlist
  DEF s,c,i
  
  c:=ListLen(self.items)
  IF c=ListMax(self.items) THEN self.expand()
  ListAdd(self.items,[NIL])
  
  FOR i:=ListLen(self.items)-1 TO (pos+1) STEP -1
    self.items[i]:=self.items[i-1]
  ENDFOR
  s:=String(StrLen(stringVal))
  StrCopy(s,stringVal)
  self.items[pos]:=s
ENDPROC

EXPORT PROC contains(stringVal:PTR TO CHAR) OF stringlist
  DEF i
  FOR i:=0 TO ListLen(self.items)-1
    IF StriCmp(self.items[i],stringVal) THEN RETURN TRUE
  ENDFOR
ENDPROC FALSE

EXPORT PROC add(stringVal:PTR TO CHAR) OF stringlist
  DEF s,c
  
  c:=ListLen(self.items)
  IF c=ListMax(self.items) THEN self.expand()
  
  s:=String(StrLen(stringVal))
  StrCopy(s,stringVal)
  ListAddItem(self.items,s)
ENDPROC c

EXPORT PROC setItem(n,stringVal:PTR TO CHAR) OF stringlist
  DEF s
  
  WHILE n>=ListLen(self.items) DO self.add('')
  s:=String(StrLen(stringVal))
  StrCopy(s,stringVal)
  DisposeLink(self.items[n])
  self.items[n]:=s
ENDPROC
  
EXPORT PROC remove(n) OF stringlist
  DEF i,t
  DisposeLink(self.items[n])
  t:=ListLen(self.items)
  FOR i:=n TO t-2
    self.items[i]:=self.items[i+1]
  ENDFOR
  SetList(self.items,t-1)
ENDPROC

EXPORT PROC setSize(n) OF stringlist
  DEF i
  FOR i:=n TO ListLen(self.items)-1
    DisposeLink(self.items[i])
  ENDFOR
  SetList(self.items,n)
ENDPROC

EXPORT PROC makeTextString(sep=0:PTR TO CHAR) OF stringlist
  DEF res,i,len=0

  FOR i:=0 TO ListLen(self.items)-1
    len:=len+StrLen(self.items[i])
    IF i THEN len:=len+2
  ENDFOR
  
  res:=String(len)
  FOR i:=0 TO ListLen(self.items)-1
    IF i THEN StrAdd(res,IF sep THEN sep ELSE '\n')
    StrAdd(res,self.items[i])
  ENDFOR
ENDPROC res

EXPORT PROC setFromTextString(newText:PTR TO CHAR) OF stringlist
  DEF pos,n,str

  self.clear()
  pos:=0
  WHILE (n:=InStr(newText+pos,'\n'))>=0
    IF n THEN str:=AstrClone(newText+pos,n) ELSE str:=String(0)
    self.add(str)
    DisposeLink(str)
    pos:=pos+n+1
  ENDWHILE
  IF StrLen(newText+pos) 
    self.add(newText+pos)
  ENDIF
ENDPROC

EXPORT PROC count() OF stringlist IS ListLen(self.items)

EXPORT PROC maxSize() OF stringlist IS ListMax(self.items)

PROC partition(first, last) OF stringlist
  DEF splitv, up, down, i
  splitv:=self.items[first]
  up:=first
  down:=last
  REPEAT
    WHILE (StrCompare(self.items[up],splitv)<=0) AND (up<last) DO up++
    WHILE (StrCompare(self.items[down],splitv)>0) AND (down>first) DO down--
    IF up<down
      i:=self.items[up]
      self.items[up]:=self.items[down]
      self.items[down]:=i
    ENDIF
  UNTIL up>=down
  i:=self.items[first]
  self.items[first]:=self.items[down]
  self.items[down]:=i
ENDPROC down
  
PROC quicksort(first, last) OF stringlist
  DEF index
  IF first<last
    index:=self.partition(first, last)
    self.quicksort(first, index-1)
    self.quicksort(index+1, last)
  ENDIF
ENDPROC

EXPORT PROC sort() OF stringlist
  self. quicksort(0,ListLen(self.items)-1)
ENDPROC

/*

 list class that holds long values

*/

EXPORT OBJECT stdlist
  PRIVATE items:PTR TO LONG
  PRIVATE initialMax:LONG
ENDOBJECT

EXPORT PROC end() OF stdlist        -> destructor
  DisposeLink(self.items)
ENDPROC

EXPORT PROC stdlist(maxSize=-1) OF stdlist  ->constructor
  IF maxSize=-1 THEN maxSize:=100
  self.initialMax:=maxSize
  self.items:=List(maxSize)
ENDPROC

EXPORT PROC item(n) OF stdlist
  ->IF (n<0) OR (n>=ListLen(self.items)) THEN WriteF('stdlist index error \d',n)
ENDPROC self.items[n]

EXPORT PROC clear() OF stdlist
  IF ListMax(self.items)>self.initialMax
    DisposeLink(self.items)
    self.items:=List(self.initialMax)
  ELSE  
    SetList(self.items,0)
  ENDIF
ENDPROC

EXPORT PROC expand() OF stdlist
  DEF old,len,inc
  old:=self.items
  len:=ListLen(old)
  inc:=Shr(len,2)
  IF inc<5 THEN inc:=5
  len:=len+inc
  self.items:=List(len)
  ListAdd(self.items,old)
  DisposeLink(old)
ENDPROC len

EXPORT PROC insert(pos,v:LONG) OF stdlist
  DEF s,c,i
  
  c:=ListLen(self.items)
  IF c=ListMax(self.items) THEN self.expand()
  ListAdd(self.items,[NIL])
  
  FOR i:=ListLen(self.items)-1 TO (pos+1) STEP -1
    self.items[i]:=self.items[i-1]
  ENDFOR
  self.items[pos]:=v
ENDPROC

EXPORT PROC add(v:LONG) OF stdlist
  DEF c
  
  c:=ListLen(self.items)
  IF c=ListMax(self.items) THEN self.expand()
  
  ListAdd(self.items,[0])
  self.items[c]:=v
ENDPROC c

EXPORT PROC setItem(n,v) OF stdlist  
  WHILE n>=ListLen(self.items) DO self.add(0)
  self.items[n]:=v
ENDPROC

EXPORT PROC remove(n) OF stdlist
  DEF i,t
  t:=ListLen(self.items)
  FOR i:=n TO t-2
    self.items[i]:=self.items[i+1]
  ENDFOR
  SetList(self.items,t-1)
ENDPROC

EXPORT PROC setSize(n) OF stdlist
  SetList(self.items,n)
ENDPROC

EXPORT PROC count() OF stdlist IS ListLen(self.items)

EXPORT PROC maxSize() OF stdlist IS ListMax(self.items)