/[ascend]/trunk/base/generic/general/list.h
ViewVC logotype

Diff of /trunk/base/generic/general/list.h

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1067 by johnpye, Sun Jan 7 07:54:06 2007 UTC revision 1068 by johnpye, Mon Jan 8 04:45:47 2007 UTC
# Line 297  ASC_DLLSPEC void gl_store(struct gl_list Line 297  ASC_DLLSPEC void gl_store(struct gl_list
297    
298  ASC_DLLSPEC void gl_append_ptr(struct gl_list_t *list, VOIDPTR ptr);  ASC_DLLSPEC void gl_append_ptr(struct gl_list_t *list, VOIDPTR ptr);
299  /**<  /**<
  *  <!--  PROCEDURE gl_append_ptr(list,ptr);                           -->  
  *  <!--  struct gl_list_t *list;                                      -->  
  *  <!--  VOIDPTR ptr;                                                 -->  
  *  
300   *  Appends ptr to the end of the list.  If the addition of ptr exceeds   *  Appends ptr to the end of the list.  If the addition of ptr exceeds
301   *  the list capacity, the list capacity is increased.  This and   *  the list capacity, the list capacity is increased.  This and
302   *  gl_append_list() are the only procedures that will expand the   *  gl_append_list() are the only procedures that will expand the
# Line 445  ASC_DLLSPEC int gl_sorted(CONST struct g Line 441  ASC_DLLSPEC int gl_sorted(CONST struct g
441  #if LISTIMPLEMENTED  #if LISTIMPLEMENTED
442  extern void gl_ptr_sort(struct gl_list_t *list, int inc);  extern void gl_ptr_sort(struct gl_list_t *list, int inc);
443  /**<  /**<
  *  <!--  PROCEDURE gl_ptr_sort(list,inc);                             -->  
  *  <!--  struct gl_list_t *list;                                      -->  
  *  <!--  int inc;                                                     -->  
  *  
444   *  This will sort the list data using Quick Sort.  It   *  This will sort the list data using Quick Sort.  It
445   *  uses a somewhat intelligent pivot choice, so it is unlikely that the   *  uses a somewhat intelligent pivot choice, so it is unlikely that the
446   *  worst case of O(n^2) will arise.  I however will not guarantee that.   *  worst case of O(n^2) will arise.  I however will not guarantee that.
# Line 487  ASC_DLLSPEC void gl_sort(struct gl_list_ Line 479  ASC_DLLSPEC void gl_sort(struct gl_list_
479  #if LISTIMPLEMENTED  #if LISTIMPLEMENTED
480  extern void gl_insert_ptr_sorted(struct gl_list_t *list, VOIDPTR ptr, int inc);  extern void gl_insert_ptr_sorted(struct gl_list_t *list, VOIDPTR ptr, int inc);
481  /**<  /**<
  *  <!--  PROCEDURE gl_insert_ptr_sorted(list,ptr,inc);                -->  
  *  <!--  struct gl_list_t *list;                                      -->  
  *  <!--  VOIDPTR ptr;                                                 -->  
  *  <!--  int inc;                                                     -->  
  *  
482   *  This procedure will insert an item into the list in the position   *  This procedure will insert an item into the list in the position
483   *  where it belongs to keep the list sorted. If inc != 0,   *  where it belongs to keep the list sorted. If inc != 0,
484   *  sort will be in increasing order of address, else it will be   *  sort will be in increasing order of address, else it will be

Legend:
Removed from v.1067  
changed lines
  Added in v.1068

john.pye@anu.edu.au
ViewVC Help
Powered by ViewVC 1.1.22