/dports/graphics/icoutils/icoutils-0.32.3/common/ |
H A D | llist.h | 25 typedef struct _LList LList; typedef 37 LList *llist_new(void); 38 void llist_free(LList *list); 39 uint32_t llist_size(LList *list); 40 bool llist_is_empty(LList *list); 41 void llist_clear(LList *list); 50 void llist_add_all(LList *list, LList *list2); 61 void *llist_get_first(LList *list); 62 void *llist_get_last(LList *list); 67 LList *llist_clone(LList *list); [all …]
|
H A D | llist.c | 50 LList *list; 66 LList * 69 LList *list = xmalloc(sizeof(LList)); in llist_new() 79 llist_free(LList *list) in llist_free() 99 llist_get_last(LList *list) in llist_get_last() 259 llist_size(LList *list) in llist_size() 265 llist_clear(LList *list) in llist_clear() 307 llist_add_all(LList *list, LList *list2) in llist_add_all() 385 LList * 386 llist_clone(LList *list) in llist_clone() [all …]
|
/dports/sysutils/renameutils/renameutils-0.12.0/src/common/ |
H A D | llist.h | 25 typedef struct _LList LList; typedef 37 LList *llist_new(void); 38 void llist_free(LList *list); 39 uint32_t llist_size(LList *list); 40 bool llist_is_empty(LList *list); 41 void llist_clear(LList *list); 50 void llist_add_all(LList *list, LList *list2); 61 void *llist_get_first(LList *list); 62 void *llist_get_last(LList *list); 67 LList *llist_clone(LList *list); [all …]
|
H A D | llist.c | 50 LList *list; 66 LList * 69 LList *list = xmalloc(sizeof(LList)); in llist_new() 79 llist_free(LList *list) in llist_free() 99 llist_get_last(LList *list) in llist_get_last() 259 llist_size(LList *list) in llist_size() 265 llist_clear(LList *list) in llist_clear() 307 llist_add_all(LList *list, LList *list2) in llist_add_all() 385 LList * 386 llist_clone(LList *list) in llist_clone() [all …]
|
/dports/games/biloba/biloba-0.9.3/src/ |
H A D | llist.c | 42 LList *llist_append(LList *list, void *data) in llist_append() 44 LList *result = malloc(sizeof(LList)); in llist_append() 45 LList *orig = list; in llist_append() 65 LList *llist_copy(LList *list) in llist_copy() 68 LList *o_cur; in llist_copy() 70 LList *c_cur; in llist_copy() 95 LList *llist_reverse(LList *list) in llist_reverse() 115 LList *llist_prepend(LList *list, void *data) in llist_prepend() 117 LList *result = malloc(sizeof(LList)); in llist_prepend() 132 LList *llist_remove(LList *list, void *data) in llist_remove() [all …]
|
H A D | llist.h | 23 typedef struct _LList LList; typedef 27 LList *next; 30 LList *llist_append(LList *list, void *data); 31 LList *llist_prepend(LList *list, void *data); 32 LList *llist_remove(LList *list, void *data); 33 LList *llist_copy(LList *list); 34 LList *llist_reverse(LList *list); 35 LList *llist_find(LList *list, void *data); 36 void llist_free(LList *list); 37 int llist_length(LList *list); [all …]
|
H A D | player.c | 46 LList *cur = my_players; in player_find() 81 LList *player_can_eat_soon(Player *player, int now_too, LList *allowed_pawns) in player_can_eat_soon() 83 LList *eatables = NULL; in player_can_eat_soon() 85 LList *cur = NULL; in player_can_eat_soon() 90 LList *surrounding = NULL; in player_can_eat_soon() 91 LList *surr_cur; in player_can_eat_soon() 172 LList *player_can_be_eaten(Player *player, int now_too, LList *allowed_pawns) in player_can_be_eaten() 174 LList *eatables = NULL; in player_can_be_eaten() 176 LList *cur = NULL; in player_can_be_eaten() 181 LList *surrounding = NULL; in player_can_be_eaten() [all …]
|
H A D | computer.c | 54 LList *pawns; in computer_defend() 55 LList *cur; in computer_defend() 57 LList *max_eaten_pawns = NULL; in computer_defend() 81 LList *curpos = positions; in computer_defend() 85 LList *can_be_eaten = NULL; in computer_defend() 134 LList *eater_dest = NULL; in finish_move() 166 LList *cur = destinations; in finish_move() 190 LList *pawns, *cur; in prepare_move() 230 LList *curpos = positions; in prepare_move() 234 LList *eatables = NULL; in prepare_move() [all …]
|
/dports/graphics/geomview/geomview-1.9.5/src/bin/geomview/ |
H A D | clang.c | 364 LList * retval; in gv_stereowin() 683 LList * retval; in gv_ND_axes() 694 LList * retval; in gv_dimension() 736 LList * gv_ND_color(int a1, LList * a2) in gv_ND_color() 742 LList * retval; in gv_ND_color() 895 LList * retval; in gv_look_encompass_size() 977 LList * gv_load_path(LList * a1) in gv_load_path() 982 LList * retval; in gv_load_path() 1000 LList * retval; in gv_rehash_emodule_path() 1010 LList * retval; in gv_emodule_path() [all …]
|
/dports/math/singular/Singular-Release-4-2-1/kernel/GBEngine/ |
H A D | f5gb.h | 44 LList* F5inc(int i, poly f_i, LList* gPrev,LList* reducers, ideal gbPrev, poly ONE, LTagList* lTag,… 56 void criticalPair(LList* gPrev, CListOld* critPairs, LTagList* lTag, RTagList* rTag, RList* RuleOld… 59 bool checkDGB(LList* gPrev); 81 void criticalPair2(LList* gPrev, CListOld* critPairs, LTagList* lTag, RTagList* rTag, RList* RuleOl… 88 inline bool criterion1(LList* gPrev, poly t, LNode* l, LTagList* lTag); 114 inline void computeSPols(CNode* first, RTagList* rTag, RList* RuleOlds, LList* sPolyList, PList* re… 121 inline void reduction(LList* sPolyList, CListOld* critPairs, LList* gPrev, RList* RuleOlds, LTagLis… 129 inline void newReduction(LList* sPolyList, CListOld* critPairs, LList* gPrev, LList* reducers, RLis… 143 void findReducers(LNode* l, LList* sPolyList, ideal gbPrev, LList* gPrev, LList* reducers, CListOld… 151 inline void topReduction(LNode* l, LList* sPolyList, LList* gPrev, CListOld* critPairs, RList* Rule… [all …]
|
/dports/lang/asis/asis-gpl-2016-src/asis/ |
H A D | asis-text-set_get.adb | 215 LList (LN).Rel_Sloc := LList (LN).Sloc + Sloc_Move; 221 S := LList (LN + 1).Sloc - 1; 227 S >= LList (LN).Sloc 234 LList (LN).Length := 0; 236 LList (LN).Length := 243 S := LList (Last_Line).Sloc; 252 LList (Last_Line).Length := 261 if LList (LN).Length /= 0 then 263 S := LList (LN).Sloc; 269 while S < LList (LN).Sloc + Source_Ptr (LList (LN).Length) loop [all …]
|
/dports/emulators/jzintv/jzintv-20200712-src/src/imasm/ |
H A D | llist.h | 39 class LList 42 LList(); 43 ~LList(); 44 LList<T> &operator=(LList<T> &); 73 LList<T>::LList() in LList() function 82 LList<T>::~LList() in ~LList() 88 LList<T> &LList<T>::operator=(LList<T> &l) 173 T *LList<T>::GetLastNode() in GetLastNode() 261 void LList<T>::Empty() in Empty() 286 T LList<T>::pop() in pop() [all …]
|
/dports/graphics/geomview/geomview-1.9.5/src/lib/oogl/lisp/ |
H A D | clisp.c | 23 LObject * l_lambda(LList * a1, LList * a2) in l_lambda() 35 LObject * l_let(LList * a1) in l_let() 46 LObject * l_defun(char * a1, LList * a2, LList * a3) in l_defun() 255 LObject * l_progn(LList * a1) in l_progn() 278 LObject * l_EvalDefun(LList * a1) in l_EvalDefun() 289 LObject * l_car(LList * a1) in l_car() 300 LObject * l_cdr(LList * a1) in l_cdr() 323 void l_interest(LList * a1) in l_interest() 331 void l_uninterest(LList * a1) in l_uninterest() 381 extern LObject *Lif(Lake *, LList *); [all …]
|
H A D | clisp.h | 3 LObject * l_lambda(LList * a1, LList * a2); 4 LObject * l_let(LList * a1); 5 LObject * l_defun(char * a1, LList * a2, LList * a3); 23 LObject * l_progn(LList * a1); 24 LObject * l_EvalLambda(LObject * a1, LList * a2); 25 LObject * l_EvalDefun(LList * a1); 26 LObject * l_car(LList * a1); 27 LObject * l_cdr(LList * a1); 28 LObject * l_cons(LObject * a1, LList * a2); 29 void l_interest(LList * a1); [all …]
|
H A D | lisp2.h | 110 typedef struct LList { struct 112 struct LList *cdr; argument 113 } LList; typedef 119 LList *filter; 220 LList * LListNew(); 221 LList * LListAppend(LList *list, LObject *obj); 222 void LListFree(LList *list); 223 LList * LListCopy(LList *list); 225 int LListLength(LList *list); 228 void LListWrite(FILE *fp, LList *list); [all …]
|
H A D | lisp.h | 135 typedef struct LList { struct 137 struct LList *cdr; argument 138 } LList; typedef 144 LList *filter; 313 LList * LListNew(); 314 LList * LListAppend(LList *list, LObject *obj); 315 void LListFree(LList *list); 316 LList * LListCopy(LList *list); 318 int LListLength(LList *list); 328 const char * LListSummarize(LList *list); [all …]
|
/dports/lang/kawa/kawa-3.1.1/gnu/lists/ |
H A D | LListPosition.java | 27 class LListPosition extends ExtPosition<Object, LList> 48 public void set (LList seq, int index, boolean isAfter) in set() 80 return sequence != LList.Empty; in hasNext() 81 return ((Pair) sequence).getCdr() != LList.Empty; in hasNext() 87 return next != LList.Empty; in hasNext() 118 if (next == LList.Empty) in getNextPair() 144 if (p == LList.Empty) in getPreviousPair() 182 if (((Pair) xp).getCdr() == LList.Empty) in gotoNext() 189 if (sequence == LList.Empty) in gotoNext() 196 if (((Pair) xp).getCdr() == LList.Empty) in gotoNext() [all …]
|
H A D | LList.java | 21 public class LList extends ExtSequence<Object> class 25 public LList () { } in LList() method in LList 249 if (list != LList.Empty && list != null) in hashCode() 257 LList result = LList.Empty; in makeList() 273 LList result = LList.Empty; in makeList() 291 LList result = LList.Empty; in makeList() 355 return new Pair(arg1, LList.Empty); in list1() 372 LList.Empty)))); in list4() 378 Pair p1 = new Pair(arg1, LList.Empty); in chain1() 387 Pair p4 = new Pair(arg4, LList.Empty); in chain4() [all …]
|
/dports/sysutils/renameutils/renameutils-0.12.0/src/ |
H A D | qcmd.h | 46 void (*output)(FILE *, LList *); 47 bool (*input)(FILE *, LList *); 63 LList *ok; 64 LList *error; 65 LList *no_change; 71 extern LList *work_files; /* contains FileSpec * */ 83 extern LList *edit_file_list; 97 void free_files(LList *files); 101 void dump_spec_list(LList *list); 122 ApplyPlan *make_plan(LList *file_names);
|
/dports/lang/fpc-source/fpc-3.2.2/packages/rtl-generics/tests/ |
H A D | tests.generics.stdcollections.pas | 729 LList.Add(O[0]); 738 LList.Clear; 753 LList.Remove(O[0]); 754 LList.Delete(0); 772 LList[0] := O[7]; 780 LList.Free; 884 LList: TList<Integer>; 895 CheckNotEquals(LList.Capacity, LList.Count); 896 LList.TrimExcess; 897 AssertEquals(LList.Capacity, LList.Count); [all …]
|
/dports/lang/fpc-rtl-generics/fpc-3.2.2/packages/rtl-generics/tests/ |
H A D | tests.generics.stdcollections.pas | 729 LList.Add(O[0]); 738 LList.Clear; 753 LList.Remove(O[0]); 754 LList.Delete(0); 772 LList[0] := O[7]; 780 LList.Free; 884 LList: TList<Integer>; 895 CheckNotEquals(LList.Capacity, LList.Count); 896 LList.TrimExcess; 897 AssertEquals(LList.Capacity, LList.Count); [all …]
|
/dports/lang/kawa/kawa-3.1.1/gnu/q2/lang/ |
H A D | Operator.java | 77 LList args; in combine() 81 if (largs instanceof Pair && ((Pair) largs).getCdr() == LList.Empty) in combine() 83 ((Pair) largs).setCdrBackdoor(LList.list1(rargs)); in combine() 87 args = LList.list2(largs, rargs); in combine() 99 if (largs == LList.Empty && rargs == LList.Empty) in combine() 105 args = new Pair(this.function, LList.list1(rargs)); in combine() 107 else if (largs == LList.Empty) in combine() 108 args = LList.list1(rargs); in combine() 109 else if (rargs == LList.Empty) in combine() 110 args = LList.list1(largs); in combine() [all …]
|
/dports/games/abuse_sdl/abuse-0.8/src/lisp/ |
H A D | lisp.cpp | 422 LList *LList::Create() in Create() 913 LList *cell = LList::Create(); in pairlis() 1078 LList *c = LList::Create(); in push_onto_list() 1284 LList *cs = (LList *)this; in Print() 1475 LList *tmp = LList::Create(); in EvalFunction() 1550 LList *list_on=(LList *)CDR(arg_list); in mapcar() 1595 LList *c = LList::Create(); in mapcar() 1638 LList *char_list=(LList *)str_eval[i]; in concatenate() 1671 LList *char_list=(LList *)str_eval[i]; in concatenate() 1812 LList *c = LList::Create(); in EvalFunction() [all …]
|
/dports/lang/kawa/kawa-3.1.1/gnu/kawa/functions/ |
H A D | Map.java | 33 static public Object map1(Procedure proc, LList list) throws Throwable { in map1() 35 Object result = LList.Empty; in map1() 37 while (cur != LList.Empty) { in map1() 51 if (list instanceof LList) in map1() 52 return map1(proc, (LList) list); in map1() 54 Object result = LList.Empty; in map1() 70 for (Object cur = list; cur != LList.Empty; ) { in forEach1() 79 if (list instanceof LList) in forEach1() 80 forEach1(proc, (LList) list); in forEach1() 111 result = LList.Empty; in applyN() [all …]
|
/dports/deskutils/xcalendar/xcalendar/ |
H A D | lists.c | 75 LList * 79 LList *list; 81 LList *new; 83 new = (LList *) XtMalloc(sizeof(struct _llist)); 101 LList * 105 LList *list; 107 LList *ptr, *lookup(); 130 LList * 134 LList *list; 136 LList *ptr = NULL; [all …]
|