Searched refs:order (Results 1 - 25 of 35) sorted by relevance

12

/ast/src/cmd/mam/
H A Dmamold.sh43 typeset rule list order target variable
63 [[ " $order " != *" $arg "* ]] && order="$order $arg"
74 for rule in $order
/ast/src/lib/librecsort/
H A Drs-verify.c48 p = &verify->obj; ph = p->order;
50 OBJHEAD(obj); oh = obj->order;
68 obj->order = oh; p->order = ph;
73 /* out of order */
85 obj->order = verify->n;
86 p->order = verify->o;
90 obj->order = oh; p->order = ph;
110 p->order
[all...]
H A Drs-radix.c80 for(work->order = 0; work; )
84 if((ph = (ssize_t)work->order) == maxph)
124 work->order = ph;
128 r->order = ph;
150 { for(work->order = 0; work; )
154 ph = (ssize_t)work->order;
188 work->order = ph;
194 r->order = ph;
H A Drshdr.h118 case 0 : obj->order = h; \
129 case 0 : obj->order = h; \
135 { if((one)->order != (two)->order ) \
136 cmp = (one)->order < (two)->order ? -1 : 1; \
H A Drs-rasp.c43 { if(one->order != two->order) \
44 cr = one->order < two->order ? -1 : 1; \
97 obj->order = (((ulong)k[1]) << (CHAR_BIT*7)) |
106 obj->order = (k[1] << (CHAR_BIT*3)) | (k[2] << (CHAR_BIT*2)) |
219 for(work->order = 1; work; )
223 if((ph = (ssize_t)work->order) == maxph)
265 work->order = ph;
270 r->order
[all...]
H A Drsmerge.c113 rs->sorted->order = n;
296 OBJHEAD(obj); /* set up obj->order for quick comparison */
447 ((one)->order == (two)->order ? mgcompare(rs,one,two,reverse) : \
448 (one)->order < (two)->order ? (reverse ? 1 : -1) : (reverse ? -1 : 1) )
497 /* The stream list is kept in reverse order to ease data movement.
856 o->order = obj->order;
877 obj->order
[all...]
H A Drecsort.h72 { unsigned long order; /* for fast compare or ordinal */ member in struct:_rsobj_s
73 Rsobj_t* left; /* left/last link or out of order */
94 unsigned char rflag; /* reverse order */
154 #define RS_VERIFY 0000100 /* objects out of order */
174 #define RS_REVERSE 000002 /* reverse sort order */
220 extern Rsmethod_t* Rscopy; /* copy original order */
224 extern Rsmethod_t* Rsverify; /* verify order */
H A Drswrite.c208 { n = (ssize_t)r->order; /* chain size already calculated */
/ast/src/lib/libpz/
H A Dpzdeflate.c43 Dt_t* order; local
121 if (!pz->sort.order)
128 if (!(elt = (Pzelt_t*)vmnewof(pz->vm, 0, char, pp->col * m, 0)) || !(pz->sort.order = dtnew(pz->vm, &pz->sort.orderdisc, Dtobag)) || !(pz->sort.free = dtnew(pz->vm, &pz->sort.freedisc, Dtlist)))
139 order = pz->sort.order;
156 if (order)
163 dtinsert(order, elt);
165 for (i = dtsize(order); i < pp->col; i++)
174 dtinsert(order, elt);
176 elt = (Pzelt_t*)dtfirst(order);
[all...]
H A Dpzsync.c55 elt = (Pzelt_t*)dtfirst(pz->sort.order);
60 elt = (Pzelt_t*)dtnext(pz->sort.order, elt);
61 dtdelete(pz->sort.order, old);
H A Dpzwrite.c71 if (!pz->sort.order)
78 if (!(elt = (Pzelt_t*)vmnewof(pz->vm, 0, char, pp->col * k, 0)) || !(pz->sort.order = dtnew(pz->vm, &pz->sort.orderdisc, Dtobag)) || !(pz->sort.free = dtnew(pz->vm, &pz->sort.freedisc, Dtlist)))
99 dtinsert(pz->sort.order, pz->ws.se);
117 dtinsert(pz->sort.order, elt);
H A Dpzlib.h47 typedef struct Pzelt_s /* window row order element */
108 Dt_t* order; /* order dictionary */ \
110 Dtdisc_t orderdisc; /* order discipline */ \
/ast/src/lib/libtksh/tcl/
H A DtclCmdIL.c49 static int sortIncreasing; /* 0 means sort in decreasing order,
50 * 1 means increasing order. */
983 int order;
987 order = 0;
994 return order;
997 order = strcmp(firstString, secondString);
1006 return order;
1009 order = 1;
1011 order = -1;
1021 return order;
971 int order; local
[all...]
/ast/src/cmd/std/
H A Dls.c66 " the name found in each slot in the physical directory order. Turns"
149 "[r:reverse?Reverse order while sorting.]"
232 #define LS_ACROSS (LS_USER<<0) /* multi-column row order */
235 #define LS_COLUMNS (LS_USER<<3) /* multi-column column order */
354 Order_f order; /* sort comparison function */ member in struct:__anon232
834 * pr() ftw directory child list in column order
1040 * order() helpers
1142 * order child entries
1146 order(register Ftw_t* f1, register Ftw_t* f2) function
1160 n = (*state.order)(f
[all...]
/ast/src/lib/libtk/library/demos/
H A Dpuzzle.tcl40 label $w.msg -font $font -wraplength 4i -justify left -text "A 15-puzzle appears below as a collection of buttons. Click on any of the pieces next to the space, and that piece will slide over the space. Continue this until the pieces are arranged in numerical order from upper-left to lower-right."
58 set order {3 1 6 2 5 7 15 13 4 11 8 9 14 10 12}
60 set num [lindex $order $i]
/ast/src/cmd/dsslib/merge/
H A Dmerge.c28 "[k:key?\afield\a is a sort key in normal order.]:[field]"
29 "[r:reverse?\afield\a is a sort key in reverse order.]:[field]"
59 Dt_t* order; member in struct:State_s
114 dtdelete(state->order, file);
123 dtinsert(state->order, file);
232 if (!(state->order = dtnew(vm, &state->orderdisc, Dtoset)))
267 while (file = (File_t*)dtfirst(state->order))
/ast/src/cmd/dsslib/bgp/
H A DMakefile1 :PACKAGE: ast ip_t:order
/ast/src/lib/libz/
H A Dinfback.c260 static const unsigned short order[19] = /* permutation of code lengths */ local
371 state->lens[order[state->have++]] = (unsigned short)BITS(3);
375 state->lens[order[state->have++]] = 0;
H A Dinflate.c509 PULLBYTE() directly in order to pull just enough bytes to decode the next
536 during that inflate() call in order to return the proper return code.
574 static const unsigned short order[19] = /* permutation of code lengths */ local
858 state->lens[order[state->have++]] = (unsigned short)BITS(3);
862 state->lens[order[state->have++]] = 0;
1231 found in order so far, in 0..3. On return *have is updated to the new
/ast/src/lib/libcmd/
H A Dcksum.c38 " \batt\b method is a true sum, all others are order dependent.]"
420 * order child entries
424 order(FTSENT* const* f1, FTSENT* const* f2) function
496 state.sort = order;
/ast/src/cmd/mailx/port/
H A Dmime.c149 order(Dt_t* dt, void* a, void* b, Dtdisc_t* disc) function
754 mp->dict.comparf = order;
/ast/src/cmd/pax/
H A Dtestpax.sh101 else : directory link order matters!
/ast/src/cmd/cs/
H A Dcs.c167 * order by name
171 order(register Ftw_t* f1, register Ftw_t* f2) function
646 ftwalk((char*)av, list, FTW_MULTIPLE|FTW_PHYSICAL, order);
/ast/src/cmd/tw/
H A Dtw.c66 "\b--directory\b directories are traversed in order from left to right. "
70 "traversal. Multiple \b--expr\b expressions are parsed in order from "
85 "default directories are visited pre-order.]"
178 "If any identifier is preceded by \b!\b then the sort order is "
236 "[+NOPOST?cancel any post order visit to this file]"
327 "[+NOTES?In order to access the \bslocate\b(1) database the \btw\b "
597 * order child entries
601 order(register Ftw_t* f1, register Ftw_t* f2) function
666 message((-2, "order(%s,%s) = %d [n1=%ld n2=%ld]", f1->name, f2->name, v, n1, n2));
918 state.sort = order;
[all...]
/ast/src/lib/libast/misc/
H A Dfts.c685 * order fts->todo if fts->comparf != 0
689 order(FTS* fts) function
872 order(fts);
1202 * perform post-order processing
1485 order(fts);

Completed in 84 milliseconds

12