| /dports/textproc/ebook-tools/ebook-tools-0.2.2/src/libepub/ |
| H A D | linklist.h | 147 typedef struct LList struct
149 listnodePtr Current, /* Last Accessed Node */
150 Head, /* Head of List, Root of Binary Tree */
151 Tail; /* Tail of List */
152 int Size, /* Number of nodes in List or Binary Tree */
153 Flags; /* Flags associated with List/Tree */
154 ListAlloc memalloc; /* malloc()-type procedure to use */
155 ListFreeFunc memfree; /* free()-type procedure to use */
156 NodeCompareFunc compare; /* Function to use to compare nodes */
|
| /dports/x11-wm/afterstep/AfterStep-1.0/modules/Wharf/ASSound/ |
| H A D | ASSound.c | 21 typedef struct LList { struct
22 struct LList *next; argument
23 struct LList *prev; argument
26 } LList; argument
|
| /dports/x11-wm/afterstep-stable/afterstep-devel-2.2.12/src/Sound/ |
| H A D | ASSound.c | 50 typedef struct LList struct
52 struct LList *next; argument
53 struct LList *prev; argument
57 LList; argument
|
| /dports/games/biloba/biloba-0.9.3/src/ |
| H A D | llist.h | 23 typedef struct _LList LList; typedef
|
| /dports/games/excido/excido-0.1.5c/src/ |
| H A D | LList.h | 23 LList() in LList() function
|
| /dports/graphics/geomview/geomview-1.9.5/src/lib/oogl/lisp/ |
| H A D | lisp2.h | 110 typedef struct LList { struct
112 struct LList *cdr; argument
113 } LList; typedef
|
| H A D | lisp.h | 135 typedef struct LList { struct
137 struct LList *cdr; argument
138 } LList; typedef
|
| /dports/games/abuse_sdl/abuse-0.8/src/lisp/ |
| H A D | lisp.h | 70 struct LList : LObject struct
79 LObject *cdr, *car;
|
| /dports/graphics/icoutils/icoutils-0.32.3/common/ |
| H A D | llist.h | 25 typedef struct _LList LList; typedef
|
| /dports/sysutils/renameutils/renameutils-0.12.0/src/common/ |
| H A D | llist.h | 25 typedef struct _LList LList; typedef
|
| /dports/math/singular/Singular-Release-4-2-1/kernel/GBEngine/ |
| H A D | f5lists.h | 22 class LList; variable
|
| H A D | f5lists.cc | 429 LList::LList() { in LList() function in LList
434 LList::LList(LPolyOld* lp) { in LList() function in LList
440 LList::LList(poly t,int i,poly p,RuleOld* r) { in LList() function in LList
|
| /dports/devel/antlr/antlr-2.7.7/antlr/collections/impl/ |
| H A D | LList.java | 21 public class LList implements List, Stack { class
|
| /dports/lang/asis/asis-gpl-2016-src/asis/ |
| H A D | asis-text.adb | 389 LList : constant Asis.Text.Line_List := Lines (Element); constant
879 LList : Asis.Text.Line_List := variable
|
| /dports/lang/kawa/kawa-3.1.1/gnu/lists/ |
| H A D | LList.java | 21 public class LList extends ExtSequence<Object> class
25 public LList () { } in LList() method in LList
|
| /dports/emulators/jzintv/jzintv-20200712-src/src/imasm/ |
| H A D | llist.h | 73 LList<T>::LList() in LList() function
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/skia/tests/ |
| H A D | LListTest.cpp | 320 DEF_TEST(LList, reporter) { in DEF_TEST() argument
|
| /dports/devel/sope2/SOPE/sope-core/NGExtensions/ |
| H A D | NGHashMap.m | 36 } LList; typedef
162 static inline void _removeAllObjectsInList(LList *list) { category
|
| /dports/devel/sope/SOPE/sope-core/NGExtensions/ |
| H A D | NGHashMap.m | 36 } LList; typedef
162 static inline void _removeAllObjectsInList(LList *list) { category
|
| /dports/devel/app-builder/app-builder-3.4.2/vendor/github.com/pkg/xattr/ |
| H A D | xattr.go | 190 func LList(path string) ([]string, error) { func
|
| /dports/www/minio-client/mc-RELEASE.2021-12-10T00-14-28Z/vendor/github.com/pkg/xattr/ |
| H A D | xattr.go | 190 func LList(path string) ([]string, error) { func
|
| /dports/sysutils/restic/restic-0.12.1/vendor/github.com/pkg/xattr/ |
| H A D | xattr.go | 190 func LList(path string) ([]string, error) { func
|
| /dports/deskutils/xcalendar/xcalendar/ |
| H A D | xcalendar.h | 132 } LList; typedef
|
| /dports/net/tcpview/tcpview-1.0/ |
| H A D | callbacks.c | 133 static XmString *LList=NULL; /* list for summary widget. size is Packet_Count */ variable
|
| /dports/databases/grass7/grass-7.8.6/lib/vector/Vlib/ |
| H A D | net_analyze.c | 733 static struct ilist *LList; in find_shortest_path_coor() local
|