Searched refs:sort (Results 1 - 25 of 42) sorted by relevance

12

/ast/src/cmd/dsslib/sort/
H A Dlib.c24 DSSLIB(sort)
H A DMakefile7 sort plugin=dss :LIBRARY: sort.c lib.c -lrecsort -ldss
H A Dsort.c24 "[+DESCRIPTION?The sort query writes the sorted input records to the"
26 " next query, if any. The sort keys are the \afield\a operands,"
54 Rs_t* sort; member in struct:State_s
164 if (!(state->sort = rsnew(state->sortkey->disc)))
267 (*disc->errorf)(cx, disc, ERROR_SYSTEM|2, "sort key error");
280 if (rsinit(state->sort, state->sortkey->meth, state->sortkey->procsize, state->sortkey->type, state->sortkey))
283 (*disc->errorf)(cx, disc, ERROR_SYSTEM|2, "sort initialization error");
291 if (state->sort)
292 rsclose(state->sort);
324 if (rsprocess(state->sort,
[all...]
/ast/src/lib/libvcodex/Vchuff/
H A Dvchbits.c27 /* sort by code lengths */
53 ssize_t **sort; local
56 if(!(sort = (ssize_t**)malloc(nsym*sizeof(ssize_t*))) )
62 sort[notz++] = size+i;
64 vcqsort(sort, notz, sizeof(ssize_t*), sizecmp, 0);
67 { s = *sort[i];
68 for(k = i; k < notz && *sort[k] == s; ++k)
69 bits[sort[k]-size] = (b++) << (VC_BITSIZE - s);
71 b <<= (*sort[k] - s);
75 s = notz <= 0 ? 0 : *sort[not
[all...]
H A Dvchtrie.c43 Node_t* root, ssize_t len, Vcbit_t** sort, ssize_t ns, ssize_t lev)
45 static int bldtrie(trie, clen, bits, root, len, sort, ns, lev)
51 Vcbit_t** sort; /* list of codes sharing prefix */
52 ssize_t ns; /* # of elts in sort[] */
62 if((s = clen[sort[k]-bits]) > m)
98 s = (*sort[k] >> (VC_BITSIZE-len)) & msk;
100 z = clen[m = sort[k]-bits];
110 { if(len >= clen[sort[m]-bits])
112 if(s != ((*sort[m] >> (VC_BITSIZE-len)) & msk) )
117 if(bldtrie(trie,clen,bits,&nd,len,sort
42 bldtrie(Vchtrie_t* trie, ssize_t* clen, Vcbit_t* bits, Node_t* root, ssize_t len, Vcbit_t** sort, ssize_t ns, ssize_t lev) argument
159 Vcbit_t **sort; local
[all...]
H A Dvchsize.c40 /* sort by frequencies */
70 Vchtree_t *tree, **sort; local
74 !(sort = (Vchtree_t**)malloc(nsym*sizeof(Vchtree_t*))) )
92 sort[notz++] = f;
99 *runb = (int)(sort[0]-tree);
101 free(sort);
108 sort[k]->freq = (sort[k]->freq - min)*(VCH_MAXWEIGHT/max) + 1;
111 vcqsort(sort, notz, sizeof(Vchtree_t*), huffcmp, 0);
112 for(f = sort[
[all...]
H A Dvchuffgroup.c57 ssize_t* sort; /* for sorting part positions */ member in struct:_group_s
162 grp->sort = grp->ppos + npts+1;
186 /* sort by code lengths */
241 ssize_t npts = grp->npts, *ppos = grp->ppos, *sort = grp->sort; local
250 { /* sort parts so that similar prefixes group together */
252 sort[k] = k;
253 vcqsort(sort, npts, sizeof(ssize_t), partcmp, grp);
260 { k = sort[p];
/ast/src/cmd/sortlib/glean/
H A DMakefile9 glean plugin=sort :LIBRARY: glean.c -lrecsort
11 :TEST: sort
/ast/src/cmd/sortlib/sum/
H A DMakefile7 sum plugin=sort :LIBRARY: sortsum.c -lrecsort -ldss
9 :TEST: sort
/ast/src/cmd/sortlib/vcodex/
H A DMakefile7 vcodex plugin=sort :LIBRARY: vcodex.c -lrecsort -lvcodex
9 :TEST: sort
/ast/src/cmd/sort/
H A DMakefile5 sort :: README RELEASE PROMO.mm main.c sfopen.c \
14 :TEST: sort
16 script :TEST: testsort.sh sort
H A Dmain.c25 * sort main
40 "[-n?\n@(#)$Id: sort (AT&T Research) 2010-08-11 $\n]"
42 "[+NAME?sort - sort and/or merge files]"
46 "[+?The default sort key is an entire line. Default ordering is "
53 "[k:key?Restrict the sort key to a string beginning at \apos1\a and "
114 "[J:shuffle|jumble?Do a random shuffle of the sort keys. \aseed\a "
130 "is out of sort then write one diagnostic line on the standard error "
133 "[j:processes|nproc|jobs?Use up to \ajobs\a separate processes to sort "
139 "[s:stable?Stable sort
1672 Sort_t sort; local
[all...]
/ast/src/cmd/sortlib/sync/
H A DMakefile7 sync plugin=sort :LIBRARY: sync.c ss.c -lrecsort
9 test plugin=sort :LIBRARY: test.c
13 :TEST: sort
/ast/src/lib/libpz/
H A Dpzwrite.c71 if (!pz->sort.order)
74 pz->sort.freedisc.link = offsetof(Pzelt_t, link);
75 pz->sort.orderdisc.link = offsetof(Pzelt_t, link);
76 pz->sort.orderdisc.key = offsetof(Pzelt_t, buf);
77 pz->sort.orderdisc.size = pp->row;
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)))
82 dtinsert(pz->sort
[all...]
H A Dpzdeflate.c121 if (!pz->sort.order)
124 pz->sort.freedisc.link = offsetof(Pzelt_t, link);
125 pz->sort.orderdisc.link = offsetof(Pzelt_t, link);
126 pz->sort.orderdisc.key = offsetof(Pzelt_t, buf);
127 pz->sort.orderdisc.size = pp->row;
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)))
132 dtinsert(pz->sort
[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);
62 dtinsert(pz->sort.free, old);
/ast/src/lib/libcs/
H A Dgenshare.sh62 s="`df 2>/dev/null | sed -e 's/^[^(]*(//' -e '/^[abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_]*:/!d' -e 's/:.*//' -e '/^.$/d' | sort -u`"
82 done) | sort | uniq -c | sort -bnr | sed -e 's/^[ ]*[0-9]*[ ]*//'`
H A Dgenlocal.sh142 sort -u
188 done | sort -b +2n -3 | {
245 } | sort -b +1 -2 +2.7n -3 +0 -1 | while read host type attr
/ast/src/lib/libvcodex/
H A Dvcbcktsort.c22 /* Counting bucket sort.
37 Vcchar_t* data; /* data used to sort */
46 if(list) /* sort using secondary predictor */
81 ssize_t vcbcktsort(ssize_t* sort, ssize_t* list, ssize_t n, Vcchar_t* data, ssize_t* bckt)
83 ssize_t vcbcktsort(sort, list, n, data, bckt)
84 ssize_t* sort; /* to output sorted elements */
113 /* now sort them into place */
116 sort[bckt[data[i]]++] = i;
/ast/src/cmd/cs/vcs_src/
H A Dvcs_search.c107 int sort = 0; local
133 if (!sort)
136 sort++;
143 if (!sort)
146 sort++;
/ast/src/cmd/tw/
H A Dfind.c462 "Reverse the \b-sort\b sense.",
469 "sort", SORT, Str, 0, "option", 0,
470 "Search each directory in \a-option\a sort order, e.g., \b-name\b"
1186 error(2, "%s: invalid sort key", b);
1694 error(1, "invalid sort key -- name assumed");
1714 find(State_t* state, char** paths, int flags, Sort_f sort) argument
1721 if (fts = fts_open(paths, flags, sort))
1743 Sort_f sort; local
1760 sort = 0;
1814 error(1, "-sort ignore
[all...]
H A Dtw.h179 int icase; /* ignore case in sort */
190 int reverse; /* reverse sort sense */
194 int (*sort)(Ftw_t*, Ftw_t*); /* sorter */ member in struct:__anon239
195 Exnode_t* sortkey; /* sort key list */
/ast/src/cmd/mam/
H A Dmamexec.sh136 then mamstate $_state_list_ < $_state_list_ | sort > $_tmp_
334 mamstate $_state_list_ < $_state_list_ | sort > $_state_time_
/ast/src/cmd/ss/
H A Dss.c33 " to the standard output. The option order determines the listing sort"
49 "[r:reverse?Reverse the sort order.]"
130 * sys sort
134 sort(const char* pa, const char* pb) function
243 strsort((char**)state.base, n, sort);
/ast/src/lib/libcmd/
H A Dcksum.c134 int (*sort)(FTSENT* const*, FTSENT* const*); member in struct:State_s
496 state.sort = order;
592 else if (!(fts = fts_open(argv, flags, state.sort)))

Completed in 65 milliseconds

12