-------------------------------------------------------------------------------
 Notes for LEDA-7
-------------------------------------------------------------------------------

LEDA-WEB

 Animations & Demos
 API for solving (optimization) problems (server)
 Platform for Code &  Problems
 Parallel Algorithms (multi-core)


 new LEDA features
 -- lambda functions (e.g. defining linear order)
 --kk


 

TODO

- node oriented search trees (bin_tree, avl_tree, ...)
  
- hashing with open addressing (--> map)


- item concept
  no global item types like  dic_item
  use local item types instead like  dictionary<int,int>::item
  operator * and ->  return a (pointer to) pair e.g. pair<int,int> 


- parameterized data types 
  use templates and inheritance instead of void* data fields


- memory management


- string::scanf(...)
  int x;
  s.scanf("%d",x);

  int x = s.atoi();
  double x = s.atof();

  s = strtod(x)


- C++11 features 
  move constructor 
  lambda functions (e.g. for defining linear orders)
  threads

  std::initializer_list     list<int> L({1,2,3,4,5});


- node oriented binary trees
  (leaf-oriented: improve handling of copies of keys in inner nodes)


- INT_SORT for 64 bit numbers
- Sorting of objects (integer keys)



DONE
  move constructors for  list & array
  default compare/smaller/ ... defined by a function template


REMOVED

string_manip.h


Modified/Improved

string

 - string::index
 - string::last_index
 - string::expand

 - Iteration
   forall_words(x,s)
   forall_lines(x,s)

