mod/maxgui.mod/fltkmaxgui.mod/src/Fl_Tree_Item.cxx
Fl_Tree_Item *Fl_Tree_Item::add(const Fl_Tree_Prefs &prefs, char **arr) {
  int t = find_child(*arr);
  Fl_Tree_Item *item;
  if ( t == -1 ) {
    item = (Fl_Tree_Item*)add(prefs, *arr);
  } else {
    item = (Fl_Tree_Item*)child(t);
  }
  if ( *(arr+1) ) {		// descend?
    return(item->add(prefs, arr+1));
  } else {
    return(item);		// end? done
  }
}
/// Descend into the path specified by \p arr, and add a new child there.
/// Should be used only by Fl_Tree's internals.
/// Adds the item based on the value of prefs.sortorder().
/// \returns the item added.
///
Descend into the path specified by \p arr, and add a new child there.
Should be used only by Fl_Tree's internals.
Adds the item based on the value of prefs.sortorder().
\returns the item added.
Descend into the path specified by \ p arr and add a new child there . Should be used only by Fl_Tree ' s internals . Adds the item based on the value of prefs . sortorder () . \ returns the item added .
Fl_Tree_Item *Fl_Tree_Item::add(const Fl_Tree_Prefs &prefs, char **arr) {
  int t = find_child(*arr);
  Fl_Tree_Item *item;
  if ( t == -1 ) {
    item = (Fl_Tree_Item*)add(prefs, *arr);
  } else {
    item = (Fl_Tree_Item*)child(t);
  }
  if ( *(arr+1) ) {		
    return(item->add(prefs, arr+1));
  } else {
    return(item);		
  }
}
Fl_Tree_Item * Fl_Tree_Item :: add ( const Fl_Tree_Prefs & prefs , char * * arr ) { int t = find_child ( * arr ) ; Fl_Tree_Item * item ; if ( t == -1 ) { item = ( Fl_Tree_Item * ) add ( prefs , * arr ) ; } else { item = ( Fl_Tree_Item * ) child ( t ) ; } if ( * ( arr + 1 ) ) { return ( item -> add ( prefs , arr + 1 ) ) ; } else { return ( item ) ; } }
Descend into the path specified by \p arr, and add a new child there.
Descend into the path specified by \ p arr and add a new child there .
// descend? // end? done