Changeset 747 for trunk/doc/pslib/psDataGroup.tex

Timestamp:

May 19, 2004, 5:41:50 PM (22 years ago)

Author:

eugene

Message:

extensive edits based on MHPCC comments, see ChangeLogSDRS.tex

File:

• trunk/doc/pslib/psDataGroup.tex (modified) (2 diffs)

trunk/doc/pslib/psDataGroup.tex

@@ -11 +11 @@
 void $\ast$ {\bf ps\-Dlist\-Remove} ({\bf ps\-Dlist} $\ast$list, void $\ast$data, int which)
 \begin{CompactList}\small\item\em Remove from a list.\item\end{CompactList}\item 
-void $\ast$ {\bf ps\-Dlist\-Get} (const {\bf ps\-Dlist} $\ast$list, void $\ast$data, int which)
+void $\ast$ {\bf ps\-Dlist\-Get} (const {\bf ps\-Dlist} $\ast$list, int which)
 \begin{CompactList}\small\item\em Retrieve from a list.\item\end{CompactList}\item 
-void {\bf ps\-Dlist\-Set\-Iterator} ({\bf ps\-Dlist} $\ast$list, int where)
+void {\bf ps\-Dlist\-Set\-Iterator} ({\bf ps\-Dlist} $\ast$list, int where, int which)
 \begin{CompactList}\small\item\em Set the iterator.\item\end{CompactList}\item 
-void $\ast$ {\bf ps\-Dlist\-Get\-Next} ({\bf ps\-Dlist} $\ast$list)
+void $\ast$ {\bf ps\-Dlist\-Get\-Next} ({\bf ps\-Dlist} $\ast$list, int which)
 \begin{CompactList}\small\item\em Get next element relative to iter.\item\end{CompactList}\item 
-void $\ast$ {\bf ps\-Dlist\-Get\-Prev} ({\bf ps\-Dlist} $\ast$list)
+void $\ast$ {\bf ps\-Dlist\-Get\-Prev} ({\bf ps\-Dlist} $\ast$list, int which)
 \begin{CompactList}\small\item\em Get prev element relative to iter.\item\end{CompactList}\item 
-{\bf ps\-Void\-Ptr\-Array} $\ast$ {\bf ps\-Dlist\-To\-Array} ({\bf ps\-Dlist} $\ast$dlist)
-\begin{CompactList}\small\item\em Convert doubly-linked list to an array.\item\end{CompactList}\item 
-{\bf ps\-Dlist} $\ast$ {\bf ps\-Array\-To\-Dlist} ({\bf ps\-Void\-Ptr\-Array} $\ast$arr)
+{\bf ps\-Vector} $\ast$ {\bf ps\-Dlist\-To\-Vector} ({\bf ps\-Dlist} $\ast$dlist)
+\begin{CompactList}\small\item\em Convert doubly-linked list to a vector of (void $\ast$).\item\end{CompactList}\item 
+{\bf ps\-Dlist} $\ast$ {\bf ps\-Array\-To\-Dlist} ({\bf ps\-Vector} $\ast$vector)
 \begin{CompactList}\small\item\em Convert array to a doubly-linked list.\item\end{CompactList}\item 
+{\bf ps\-Dlist} $\ast$ {\bf ps\-Dlist\-Sort} ({\bf ps\-Dlist} $\ast$list, int($\ast$compare)(const void $\ast$a, const void $\ast$b))
+\begin{CompactList}\small\item\em Sort a list.\item\end{CompactList}\item 
 {\bf ps\-Hash} $\ast$ {\bf ps\-Hash\-Alloc} (void)
 \begin{CompactList}\small\item\em Allocate hash buckets in table.\item\end{CompactList}\item 
@@ -33 +35 @@
 void $\ast$ {\bf ps\-Hash\-Remove} ({\bf ps\-Hash} $\ast$table, const char $\ast$key)
 \begin{CompactList}\small\item\em Remove key from table.\item\end{CompactList}\item 
-{\bf ps\-Float\-Array} $\ast$ {\bf ps\-Float\-Array\-Alloc} (int nalloc)
-\begin{CompactList}\small\item\em Constructor.\item\end{CompactList}\item 
-{\bf ps\-Float\-Array} $\ast$ {\bf ps\-Float\-Array\-Realloc} ({\bf ps\-Float\-Array} $\ast$my\-Array, int nalloc)
-\begin{CompactList}\small\item\em Reallocator.\item\end{CompactList}\item 
-void {\bf ps\-Float\-Array\-Free} ({\bf ps\-Float\-Array} $\ast$restrict my\-Array)
-\begin{CompactList}\small\item\em Destructor.\item\end{CompactList}\item 
-{\bf ps\-Complex\-Array} $\ast$ {\bf ps\-Complex\-Array\-Alloc} (int nalloc)
-\begin{CompactList}\small\item\em Constructor.\item\end{CompactList}\item 
-{\bf ps\-Complex\-Array} $\ast$ {\bf ps\-Complex\-Array\-Realloc} ({\bf ps\-Complex\-Array} $\ast$my\-Array, int nalloc)
-\begin{CompactList}\small\item\em Reallocator.\item\end{CompactList}\item 
-void {\bf ps\-Complex\-Array\-Free} ({\bf ps\-Complex\-Array} $\ast$restrict my\-Array)
-\begin{CompactList}\small\item\em Destructor.\item\end{CompactList}\item 
-{\bf ps\-Int\-Array} $\ast$ {\bf ps\-Int\-Array\-Alloc} (int nalloc)
-\begin{CompactList}\small\item\em Constructor.\item\end{CompactList}\item 
-{\bf ps\-Int\-Array} $\ast$ {\bf ps\-Int\-Array\-Realloc} ({\bf ps\-Int\-Array} $\ast$my\-Array, int nalloc)
-\begin{CompactList}\small\item\em Reallocator.\item\end{CompactList}\item 
-void {\bf ps\-Int\-Array\-Free} ({\bf ps\-Int\-Array} $\ast$restrict my\-Array)
-\begin{CompactList}\small\item\em Destructor.\item\end{CompactList}\item 
-{\bf ps\-Double\-Array} $\ast$ {\bf ps\-Double\-Array\-Alloc} (int nalloc)
-\begin{CompactList}\small\item\em Constructor.\item\end{CompactList}\item 
-{\bf ps\-Double\-Array} $\ast$ {\bf ps\-Double\-Array\-Realloc} ({\bf ps\-Double\-Array} $\ast$my\-Array, int nalloc)
-\begin{CompactList}\small\item\em Reallocator.\item\end{CompactList}\item 
-void {\bf ps\-Double\-Array\-Free} ({\bf ps\-Double\-Array} $\ast$restrict my\-Array)
-\begin{CompactList}\small\item\em Destructor.\item\end{CompactList}\item 
-{\bf ps\-Vector\-Array} $\ast$ {\bf ps\-Vector\-Array\-Alloc} (int nalloc)
-\begin{CompactList}\small\item\em Constructor.\item\end{CompactList}\item 
-{\bf ps\-Vector\-Array} $\ast$ {\bf ps\-Vector\-Array\-Realloc} ({\bf ps\-Vector\-Array} $\ast$my\-Array int nalloc)
-\begin{CompactList}\small\item\em Reallocator.\item\end{CompactList}\item 
-void {\bf ps\-Vector\-Array\-Free} ({\bf ps\-Vector\-Array} $\ast$restrict my\-Array)
-\begin{CompactList}\small\item\em Destructor.\item\end{CompactList}\item 
-{\bf ps\-Void\-Ptr\-Array} $\ast$ {\bf ps\-Void\-Ptr\-Array\-Alloc} (int nalloc)
-\begin{CompactList}\small\item\em Constructor.\item\end{CompactList}\item 
-{\bf ps\-Void\-Ptr\-Array} $\ast$ {\bf ps\-Void\-Ptr\-Array\-Realloc} ({\bf ps\-Void\-Ptr\-Array} $\ast$arr, int nalloc)
-\begin{CompactList}\small\item\em Reallocate.\item\end{CompactList}\item 
-void {\bf ps\-Void\-Ptr\-Array\-Free} ({\bf ps\-Void\-Ptr\-Array} $\ast$arr, void($\ast$elem\-Free)(void $\ast$))
-\begin{CompactList}\small\item\em Destructor.\item\end{CompactList}\end{CompactItemize}
+{\bf ps\-Vector} $\ast$ {\bf ps\-Vector\-Alloc} (int nalloc, {\bf ps\-Elem\-Type} type)
+\begin{CompactList}\small\item\em Create a vector of the specified size and type.\item\end{CompactList}\item 
+{\bf ps\-Vector} $\ast$ {\bf ps\-Vector\-Realloc} (const {\bf ps\-Vector} $\ast$vector, int nalloc)
+\begin{CompactList}\small\item\em Extend a vector.\item\end{CompactList}\item 
+{\bf ps\-Vector} $\ast$ {\bf ps\-Vector\-Subset} (const {\bf ps\-Vector} $\ast$vector, int start, int end)
+\begin{CompactList}\small\item\em Create a subvector of the specified range.\item\end{CompactList}\item 
+void {\bf ps\-Vector\-Free} ({\bf ps\-Vector} $\ast$restrict vector, void($\ast$elem\-Free)(void $\ast$))
+\begin{CompactList}\small\item\em Destroy the specified vector.\item\end{CompactList}\item 
+{\bf ps\-Vector} $\ast$ {\bf ps\-Vector\-Transpose} ({\bf ps\-Vector} $\ast$out, {\bf ps\-Vector} $\ast$my\-Vector)
+\begin{CompactList}\small\item\em Transpose a vector.\item\end{CompactList}\end{CompactItemize}