Searched refs:right (Results 1 - 25 of 91) sorted by relevance

1234

/ast/src/cmd/mailx/port/
H A Ddtrenew.c95 { if(!(r = e->right) )
107 *slot = e->right;
109 { for(; t->right != e; t = t->right)
111 t->right = e->right;
118 { /* set r to elt right before class of e */
120 for(t = dt->data->head->left; t != e->left; r = t, t = t->right->left)
123 if(e == (t = r ? r->right : dt->data->head) )
125 r->right
[all...]
H A Ddttree.c106 t = root->right;
120 { while((t = root->right) )
144 /* note that link.right is LEFT tree and link.left is RIGHT tree */
161 else /* left,right */
163 t = t->right;
168 else /* right turn */
169 { if((t = root->right) )
175 t = root->right;
177 else /* right, left */
189 l->right
[all...]
H A Ddtflatten.c96 last->right = t;
98 while((t = last->right) )
107 last = last ? (last->right = r) : (list = r);
108 r = last->right;
H A Ddthash.c110 next = t->right;
111 t->right = *chain;
153 { r = t->right;
170 for(; t->right; t = t->right)
197 for(; t; prev = t, t = t->right)
239 t->right = *slot; *slot = t;
246 { prev->right = t->right;
247 t->right
[all...]
H A Ddtstkq.c96 dt->data->head = t->right;
97 if(t->right) /* head->left always points to last element */
98 t->right->left = t->left;
116 { t = r->right;
152 t->right = NIL(Dtlink_t*);
156 { t->right = r;
163 r->right = t;
164 t->right = NIL(Dtlink_t*);
176 for(t = dt->data->head; t; t = t->right)
186 t = t->right;
[all...]
H A Ddtlist.c96 { t = r->right;
109 while(r->right)
110 r = r->right;
129 { for(t = dt->data->head; t; prev = t->left, t = prev->right)
138 { dt->data->here = t = t->right;
145 if((r = prev->right->left) == t->left)
150 { t = prev->right;
151 prev->right = t->left->right;
152 t->left->right
[all...]
H A Ddtsize.c81 { return !here ? 0 : dtcount(here->left) + dtcount(here->right) + 1;
101 for(size = 0; t; t = t->right)
H A Ddtrestore.c110 list = t->right;
111 t->right = NIL(Dtlink_t*);
117 { t = list->right;
H A Ddthdr.h121 #define RROTATE(x,y) ((x)->left = (y)->right, (y)->right = (x), (x) = (y))
122 #define LROTATE(x,y) ((x)->right = (y)->left, (y)->left = (x), (x) = (y))
124 #define LLINK(l,x) (l = l->right = x )
H A Ddtextract.c96 last->right = t;
98 while((t = last->right) )
H A Ddtdisc.c144 next->right = t;
146 while((t = next->right) )
155 { next = root->right;
172 next = root->right;
181 { t = root->right;
/ast/src/lib/librecsort/
H A Drs-radix.c49 r->left->right = obj;
75 work->left->right = NIL(Rsobj_t*);
81 { next = work->left->right; work->left->right = NIL(Rsobj_t*);
85 { for(; work; work = work->right)
96 endl = list ? (endl->right = *lo) : (list = *lo);
102 endl = (endl->right = r);
109 { for(; work; work = work->right)
112 r->left->right = work;
129 t->right
[all...]
H A Drs-splay.c49 { obj->left = obj->right = NIL(Rsobj_t*);
60 { if(!root->right)
62 obj->right = NIL(Rsobj_t*);
69 { obj->right = root;
93 if(!(root = t->right))
103 { if((t = root->right))
108 if(!(root = root->right))
135 l->right = root->left;
136 r->left = root->right;
138 root->left = link.right;
[all...]
H A Drs-rasp.c90 r->left->right = obj;
112 obj->left = obj->right = NIL(Rsobj_t*);
139 if(!(root = t->right))
149 { if((t = root->right))
154 if(!(root = root->right))
181 l->right = root->left;
182 r->left = root->right;
184 root->left = link.right;
185 root->right = link.left;
190 l->right
[all...]
H A Drslist.c35 #define ADDOBJ(list,tail,obj) (tail = tail ? (tail->right = obj) : (list = obj) )
120 for(obj = objlist[p]; obj; obj = obj->right)
136 { obj = un->obj; un->obj = obj->right;
145 o = u->obj; u->obj = o->right;
147 e->left->right = o;
150 if((o->right = o->equal) )
154 obj->equal->left->right = NIL(Rsobj_t*);
159 tail->right = NIL(Rsobj_t*);
164 { un->obj = obj->right;
238 { for(r = list; r; r = r->right)
[all...]
H A Drs-copy.c46 copy->tail->right = obj;
64 copy->tail->right = 0;
H A Drswrite.c123 { for(; r; r = r->right)
135 usr.right = r;
149 { for(; r; r = r->right)
160 for(; r; r = r->right)
171 { for(; r; r = r->right)
178 for(e = r->equal; e; e = e->right)
190 for(; r; r = r->right)
196 for(e = r->equal; e; e = e->right)
215 for(n = 0, e = r; e; e = e->right)
225 { for(; r; r = r->right)
[all...]
/ast/src/lib/libtk/library/demos/
H A Dlabel.tcl15 label $w.msg -font $font -wraplength 4i -justify left -text "Five labels are displayed below: three textual ones on the left, and a bitmap label and a text label on the right. Labels are pretty boring because you can't do anything with them."
25 frame $w.right
26 pack $w.left $w.right -side left -expand yes -padx 10 -pady 10 -fill both
33 label $w.right.bitmap -borderwidth 2 -relief sunken \
35 label $w.right.caption -text "Tcl/Tk Proprietor"
36 pack $w.right.bitmap $w.right.caption -side top
H A Dmsgbox.tcl26 frame $w.right
27 pack $w.left $w.right -side left -expand yes -fill y -pady .5c -padx .5c
41 label $w.right.label -text "Type"
42 frame $w.right.sep -relief ridge -bd 1 -height 2
43 pack $w.right.label -side top
44 pack $w.right.sep -side top -fill x -expand no
48 radiobutton $w.right.$t -text $t -variable msgboxType \
50 pack $w.right.$t -side top -pady 2 -anchor w -fill x
H A Dradio.tcl26 frame $w.right
27 pack $w.left $w.right -side left -expand yes -pady .5c -padx .5c
37 radiobutton $w.right.$lower -text $color -variable color \
39 pack $w.right.$lower -side top -pady 2 -anchor w
H A Dtimer20 pack .stop -side right -fill both -expand yes
/ast/src/lib/libexpr/
H A Dexeval.c148 else if (!(fmt->actuals = fmt->actuals->data.operand.right))
335 if (fmt.actuals->data.operand.right)
392 fmt->actuals = fmt->actuals->data.operand.right;
633 eval(ex, expr->data.operand.right->data.operand.left, env);
635 eval(ex, expr->data.operand.right->data.operand.right, env);
640 expr = expr->data.operand.right;
649 if (expr->data.operand.right)
651 eval(ex, expr->data.operand.right, env);
666 x = expr->data.operand.right;
[all...]
/ast/src/lib/libast/misc/
H A Dfts.c86 FTSENT* right; /* right child */ \
254 #define RROTATE(r) (t = r->left, r->left = t->right, t->right = r, r = t)
255 #define LROTATE(r) (t = r->right, r->right = t->left, t->left = r, r = t)
263 register FTSENT* right; local
267 left = right = lroot = rroot = 0;
286 * stick all things > e to the right tree
289 if (right)
350 register FTSENT* right; local
[all...]
/ast/src/cmd/ksh93/bltins/
H A Dtest.c464 int test_binop(Shell_t *shp,register int op,const char *left,const char *right) argument
471 while(*right=='0')
472 right++;
474 rnum = sh_arith(shp,right);
483 return(test_strmatch(shp, left, right));
485 return(!test_strmatch(shp, left, right));
487 return(strcoll(left, right)>0);
489 return(strcoll(left, right)<0);
491 return(strcmp(left, right)==0);
493 return(strcmp(left, right)!
[all...]
/ast/src/lib/libcmd/
H A Dexpr.c401 register char *left,*right; local
414 right = rp.str;
416 sfsprintf(right=buff2,sizeof(buff2),"%d",rp.num);
421 np->num = streq(left,right);
424 np->num = (strcoll(left,right)>0);
427 np->num = (strcoll(left,right)<0);
430 np->num = (strcoll(left,right)>=0);
433 np->num = (strcoll(left,right)<=0);
436 np->num = !streq(left,right);

Completed in 38 milliseconds

1234