Home
last modified time | relevance | path

Searched refs:sel (Results 1 – 25 of 9607) sorted by relevance

12345678910>>...385

/dports/x11/mlterm/mlterm-3.9.1/uitoolkit/
H A Dui_selection.c33 (*sel->sel_listener->restore_color)(sel->sel_listener->self, sel->beg_col, sel->beg_row, in update_sel_region()
78 (*sel->sel_listener->reverse_color)(sel->sel_listener->self, sel->beg_col, sel->beg_row, in update_sel_region()
98 (sel->end_row == sel->base_row_r && sel->end_col >= sel->base_col_r)) { in update_sel_region()
140 (sel->beg_row == sel->base_row_l && sel->beg_col <= sel->base_col_l)) { in update_sel_region()
173 (sel->end_row == sel->lock_row && sel->end_col < sel->lock_col))) { in update_sel_region()
180 (sel->beg_row == sel->lock_row && sel->beg_col > sel->lock_col))) { in update_sel_region()
216 sel->base_col_r = sel->beg_col = sel->end_col = sel->prev_col = col_r; in ui_start_selection()
217 sel->base_row_r = sel->beg_row = sel->end_row = sel->prev_row = row_r; in ui_start_selection()
221 (*sel->sel_listener->reverse_color)(sel->sel_listener->self, sel->beg_col, sel->beg_row, in ui_start_selection()
360 sel->beg_row, sel->end_col, sel->end_row); in ui_restore_selected_region_color()
[all …]
/dports/devel/p5-Test-WWW-Selenium/Test-WWW-Selenium-1.36/t/
H A Dselenium-core.t14 my $sel = t::WWW::Selenium->new;
15 isa_ok $sel, 't::WWW::Selenium';
16 $sel->open;
18 $sel->_method_exists("click");
21 $sel->_method_exists("click_at");
25 $sel->_method_exists("focus");
36 $sel->_method_exists("key_up");
49 $sel->_method_exists("type");
53 $sel->_method_exists("check");
60 $sel->_method_exists("open");
[all …]
/dports/math/py-or-tools/or-tools-9.2/examples/flatzinc/
H A Dcoins_problem.fzn611 constraint int_le(sel[1], num[1]);
612 constraint int_le(sel[2], num[2]);
613 constraint int_le(sel[3], num[3]);
614 constraint int_le(sel[4], num[4]);
615 constraint int_le(sel[5], num[5]);
616 constraint int_le(sel[6], num[6]);
617 constraint int_le(sel[7], num[1]);
618 constraint int_le(sel[8], num[2]);
619 constraint int_le(sel[9], num[3]);
620 constraint int_le(sel[10], num[4]);
[all …]
/dports/cad/verilator/verilator-4.216/test_regress/t/
H A Dt_math_cond_huge.v34 .sel (sel[7:0]),
351 = (sel==8'h00) ? i0 : (sel==8'h01) ? i1 : (sel==8'h02) ? i2 : (sel==8'h03) ? i3
352 : (sel==8'h04) ? i4 : (sel==8'h05) ? i5 : (sel==8'h06) ? i6 : (sel==8'h07) ? i7
353 : (sel==8'h08) ? i8 : (sel==8'h09) ? i9 : (sel==8'h0a) ? i10 : (sel==8'h0b) ? i11
354 : (sel==8'h0c) ? i12 : (sel==8'h0d) ? i13 : (sel==8'h0e) ? i14 : (sel==8'h0f) ? i15
355 : (sel==8'h10) ? i16 : (sel==8'h11) ? i17 : (sel==8'h12) ? i18 : (sel==8'h13) ? i19
356 : (sel==8'h14) ? i20 : (sel==8'h15) ? i21 : (sel==8'h16) ? i22 : (sel==8'h17) ? i23
357 : (sel==8'h18) ? i24 : (sel==8'h19) ? i25 : (sel==8'h1a) ? i26 : (sel==8'h1b) ? i27
358 : (sel==8'h1c) ? i28 : (sel==8'h1d) ? i29 : (sel==8'h1e) ? i30 : (sel==8'h1f) ? i31
359 : (sel==8'h20) ? i32 : (sel==8'h21) ? i33 : (sel==8'h22) ? i34 : (sel==8'h23) ? i35
[all …]
/dports/sysutils/openipmi/OpenIPMI-2.0.29/lib/
H A Dsel.c210 sel->os_hnd->lock(sel->os_hnd, sel->sel_lock); in sel_lock()
216 sel->os_hnd->unlock(sel->os_hnd, sel->sel_lock); in sel_unlock()
304 memset(sel, 0, sizeof(*sel)); in ipmi_sel_alloc()
336 rv = sel->os_hnd->create_lock(sel->os_hnd, &sel->sel_lock); in ipmi_sel_alloc()
349 sel->os_hnd->destroy_lock(sel->os_hnd, sel->sel_lock); in ipmi_sel_alloc()
412 sel->os_hnd->destroy_lock(sel->os_hnd, sel->sel_lock); in internal_destroy_sel()
442 sel->destroy_handler(sel, sel->destroy_cb_data); in internal_destroy_sel()
1255 elem->sel = sel; in ipmi_sel_get()
1905 data->sel = sel; in sel_del_event_cb()
1947 info.sel = sel; in sel_del_event()
[all …]
/dports/net-mgmt/bosun/bosun-0.9.0-preview/vendor/github.com/PuerkitoBio/goquery/
H A Dtraversal_test.go10 assertLength(t, sel.Nodes, 9)
15 sel2 := sel.Find("a").End()
16 assertEqual(t, sel, sel2)
153 sel = sel.ParentsUntilSelection(sel2)
167 sel = sel.ParentsUntilNodes(sel2.Nodes...)
192 sel = sel.ParentsFilteredUntilSelection("div", sel2)
206 sel = sel.ParentsFilteredUntilNodes("body", sel2.Nodes...)
512 sel = sel.NextFilteredUntilSelection(".even", sel2)
527 sel = sel.NextFilteredUntilNodes(".odd", sel2.Nodes...)
554 sel = sel.PrevFilteredUntilSelection(".odd", sel2)
[all …]
/dports/www/beehive/beehive-0.4.0/vendor/github.com/PuerkitoBio/goquery/
H A Dtraversal_test.go16 assertEqual(t, sel, sel2)
25 sel := Doc().Find(":+ ^")
31 sel := doc.Find("li")
193 sel = sel.ParentsUntilSelection(sel2)
207 sel = sel.ParentsUntilNodes(sel2.Nodes...)
237 sel = sel.ParentsFilteredUntilSelection("div", sel2)
251 sel = sel.ParentsFilteredUntilNodes("body", sel2.Nodes...)
597 sel = sel.NextFilteredUntilSelection(".even", sel2)
612 sel = sel.NextFilteredUntilNodes(".odd", sel2.Nodes...)
644 sel = sel.PrevFilteredUntilSelection(".odd", sel2)
[all …]
H A Dfilter_test.go9 assertLength(t, sel.Nodes, 1)
14 assertLength(t, sel.Nodes, 0)
25 assertEqual(t, sel, sel2)
40 assertEqual(t, sel, sel2)
45 sel2 := sel.FilterNodes(sel.Nodes[2])
51 sel2 := sel.FilterNodes(sel.Nodes[2]).End()
115 sel2 := sel.NotNodes(sel.Nodes[2])
121 sel2 := sel.NotNodes(sel.Nodes[2]).End()
172 sel = sel.HasNodes(sel2.Nodes...)
185 sel := Doc().Find("p")
[all …]
/dports/security/go-cve-dictionary/go-cve-dictionary-0.5.5/vendor/github.com/PuerkitoBio/goquery/
H A Dtraversal_test.go16 assertEqual(t, sel, sel2)
25 sel := Doc().Find(":+ ^")
31 sel := doc.Find("li")
193 sel = sel.ParentsUntilSelection(sel2)
207 sel = sel.ParentsUntilNodes(sel2.Nodes...)
237 sel = sel.ParentsFilteredUntilSelection("div", sel2)
251 sel = sel.ParentsFilteredUntilNodes("body", sel2.Nodes...)
597 sel = sel.NextFilteredUntilSelection(".even", sel2)
612 sel = sel.NextFilteredUntilNodes(".odd", sel2.Nodes...)
644 sel = sel.PrevFilteredUntilSelection(".odd", sel2)
[all …]
/dports/www/aquatone/aquatone-1.7.0/vendor/github.com/PuerkitoBio/goquery/
H A Dtraversal_test.go16 assertEqual(t, sel, sel2)
25 sel := Doc().Find(":+ ^")
31 sel := doc.Find("li")
193 sel = sel.ParentsUntilSelection(sel2)
207 sel = sel.ParentsUntilNodes(sel2.Nodes...)
237 sel = sel.ParentsFilteredUntilSelection("div", sel2)
251 sel = sel.ParentsFilteredUntilNodes("body", sel2.Nodes...)
597 sel = sel.NextFilteredUntilSelection(".even", sel2)
612 sel = sel.NextFilteredUntilNodes(".odd", sel2.Nodes...)
644 sel = sel.PrevFilteredUntilSelection(".odd", sel2)
[all …]
/dports/www/wuzz/wuzz-0.5.0/vendor/github.com/PuerkitoBio/goquery/
H A Dtraversal_test.go16 assertEqual(t, sel, sel2)
25 sel := Doc().Find(":+ ^")
31 sel := doc.Find("li")
193 sel = sel.ParentsUntilSelection(sel2)
207 sel = sel.ParentsUntilNodes(sel2.Nodes...)
237 sel = sel.ParentsFilteredUntilSelection("div", sel2)
251 sel = sel.ParentsFilteredUntilNodes("body", sel2.Nodes...)
597 sel = sel.NextFilteredUntilSelection(".even", sel2)
612 sel = sel.NextFilteredUntilNodes(".odd", sel2.Nodes...)
644 sel = sel.PrevFilteredUntilSelection(".odd", sel2)
[all …]
/dports/www/miniflux/v2-2.0.35/vendor/github.com/PuerkitoBio/goquery/
H A Dtraversal_test.go16 assertEqual(t, sel, sel2)
25 sel := Doc().Find(":+ ^")
31 sel := doc.Find("li")
193 sel = sel.ParentsUntilSelection(sel2)
207 sel = sel.ParentsUntilNodes(sel2.Nodes...)
237 sel = sel.ParentsFilteredUntilSelection("div", sel2)
251 sel = sel.ParentsFilteredUntilNodes("body", sel2.Nodes...)
597 sel = sel.NextFilteredUntilSelection(".even", sel2)
612 sel = sel.NextFilteredUntilNodes(".odd", sel2.Nodes...)
644 sel = sel.PrevFilteredUntilSelection(".odd", sel2)
[all …]
/dports/www/colly/colly-2.1.0/vendor/github.com/PuerkitoBio/goquery/
H A Dtraversal_test.go16 assertEqual(t, sel, sel2)
25 sel := Doc().Find(":+ ^")
31 sel := doc.Find("li")
193 sel = sel.ParentsUntilSelection(sel2)
207 sel = sel.ParentsUntilNodes(sel2.Nodes...)
237 sel = sel.ParentsFilteredUntilSelection("div", sel2)
251 sel = sel.ParentsFilteredUntilNodes("body", sel2.Nodes...)
597 sel = sel.NextFilteredUntilSelection(".even", sel2)
612 sel = sel.NextFilteredUntilNodes(".odd", sel2.Nodes...)
644 sel = sel.PrevFilteredUntilSelection(".odd", sel2)
[all …]
/dports/sysutils/go-wtf/wtf-0.21.0/vendor/github.com/PuerkitoBio/goquery/goquery-1.5.0/
H A Dtraversal_test.go16 assertEqual(t, sel, sel2)
25 sel := Doc().Find(":+ ^")
31 sel := doc.Find("li")
193 sel = sel.ParentsUntilSelection(sel2)
207 sel = sel.ParentsUntilNodes(sel2.Nodes...)
237 sel = sel.ParentsFilteredUntilSelection("div", sel2)
251 sel = sel.ParentsFilteredUntilNodes("body", sel2.Nodes...)
597 sel = sel.NextFilteredUntilSelection(".even", sel2)
612 sel = sel.NextFilteredUntilNodes(".odd", sel2.Nodes...)
644 sel = sel.PrevFilteredUntilSelection(".odd", sel2)
[all …]
/dports/comms/ser2net/ser2net-3.5.1/
H A Dselector.c219 sel->sel_lock(sel->timer_lock); in sel_timer_lock()
226 sel->sel_unlock(sel->timer_lock); in sel_timer_unlock()
233 sel->sel_lock(sel->fd_lock); in sel_fd_lock()
240 sel->sel_unlock(sel->fd_lock); in sel_fd_unlock()
439 while ((sel->maxfd >= 0) && (! sel->fds[sel->maxfd].state)) { in sel_clear_fd_handlers()
582 timer->val.sel = sel; in sel_alloc_timer()
782 runner->sel = sel; in sel_alloc_runner()
1053 sel = malloc(sizeof(*sel)); in sel_alloc_selector_thread()
1056 memset(sel, 0, sizeof(*sel)); in sel_alloc_selector_thread()
1108 sel->sel_lock_free(sel->fd_lock); in sel_alloc_selector_thread()
[all …]
/dports/science/gromacs/gromacs-2021.4/src/gromacs/selection/
H A Dcompiler.cpp1146 sel->cdata->evaluate = sel->evaluate; in init_item_evalfunc()
1214 sel->cdata->evaluate = sel->evaluate; in init_item_evaloutput()
1266 sel->cdata->evaluate = sel->evaluate; in init_item_compilerdata()
1525 sel->cdata->gmin = sel->v.u.g; in init_item_minmax_groups()
1526 sel->cdata->gmax = sel->v.u.g; in init_item_minmax_groups()
1697 gmx_ana_index_set(&sel->u.cgrp, sel->v.u.g->isize, sel->v.u.g->index, 0); in make_static()
1793 sel->u.expr.method->outinit(top, &sel->v, sel->u.expr.mdata); in init_method()
1863 sel->cdata->evaluate(data, sel, g); in evaluate_boolean_static_part()
2123 sel->cdata->evaluate(data, sel, sel->child->v.u.g); in analyze_static()
2442 sel->cdata->evaluate = sel->evaluate; in postprocess_item_subexpressions()
[all …]
H A Devaluate.cpp399 sel = sel->next; in init_frame_eval()
452 sel = sel->next; in evaluate()
516 sel->child->evaluate(data, sel->child, sel->u.cgrp.isize < 0 ? nullptr : &sel->u.cgrp); in _gmx_sel_evaluate_root()
563 sel->v.nr = sel->child->v.nr; in _gmx_sel_evaluate_subexpr_simple()
589 sel->v.nr = sel->child->v.nr; in _gmx_sel_evaluate_subexpr_staticeval()
650 gmx_ana_index_merge(sel->v.u.g, sel->child->v.u.g, sel->v.u.g); in _gmx_sel_evaluate_subexpr()
743 sel->v.nr = sel->child->v.nr; in _gmx_sel_evaluate_subexprref_simple()
746 sel->u.param->val.nr = sel->v.nr; in _gmx_sel_evaluate_subexprref_simple()
870 sel->u.param->val.nr = sel->v.nr; in _gmx_sel_evaluate_subexprref()
948 sel->u.expr.method->pupdate(context, sel->u.expr.pos, &sel->v, sel->u.expr.mdata); in _gmx_sel_evaluate_method()
[all …]
/dports/sysutils/openipmi/OpenIPMI-2.0.29/unix/
H A Dselector.c229 sel->sel_lock(sel->timer_lock); in sel_timer_lock()
236 sel->sel_unlock(sel->timer_lock); in sel_timer_unlock()
243 sel->sel_lock(sel->fd_lock); in sel_fd_lock()
250 sel->sel_unlock(sel->fd_lock); in sel_fd_unlock()
410 state->done_runner.sel = sel; in sel_set_fd_handlers()
483 while ((sel->maxfd >= 0) && (! sel->fds[sel->maxfd].state)) { in i_sel_clear_fd_handler()
653 timer->val.sel = sel; in sel_alloc_timer()
875 runner->sel = sel; in sel_alloc_runner()
1303 sel = malloc(sizeof(*sel)); in sel_alloc_selector_thread()
1306 memset(sel, 0, sizeof(*sel)); in sel_alloc_selector_thread()
[all …]
/dports/graphics/leptonica/leptonica-1.76.0/src/
H A Dsel2.c96 SEL *sel; in selaAddBasic() local
136 selSetElement(sel, 0, 0, 0); in selaAddBasic()
149 selSetOrigin(sel, 2, 2); in selaAddBasic()
159 selSetOrigin(sel, 2, 2); in selaAddBasic()
183 SEL *sel; in selaAddHitMiss() local
323 SEL *sel; in selaAddDwaLinear() local
436 SEL *sel; in selaAddCrossJunctions() local
561 SEL *sel; in selaAddTJunctions() local
751 SEL *sel; in sela4ccThin() local
792 SEL *sel; in sela8ccThin() local
[all …]
/dports/games/kevedit/kevedit-0.5.1/src/structures/
H A Dselection.c45 sel->width = sel->fieldwidth * fieldunitsize; in initselection()
48 sel->fieldlength = sel->fieldwidth * sel->height; in initselection()
59 free(sel->field); in deleteselection()
62 sel->width = sel->height = sel->fieldwidth = sel->fieldlength = 0; in deleteselection()
119 if (x < 0 || y < 0 || x >= sel.width || y >= sel.height) return; in selectpos()
120 sel.field[(x / fieldunitsize) + (y * sel.fieldwidth)] in selectpos()
127 if (x < 0 || y < 0 || x >= sel.width || y >= sel.height) return; in unselectpos()
128 sel.field[(x / fieldunitsize) + (y * sel.fieldwidth)] in unselectpos()
136 return sel.field[(x / fieldunitsize) + (y * sel.fieldwidth)] in isselected()
184 while (position < sel.fieldlength && !sel.field[position]) in nextselected()
[all …]
/dports/math/abs/abs-src-0.908/Database/
H A Dselection.c63 Selection *sel; in newselection() local
67 sel->objnum = 0; in newselection()
68 sel->ret = 0; in newselection()
69 return sel; in newselection()
77 if (sel == NULL)
93 sel->objnum++;
96 sel->objects[sel->objnum - 1] = o;
128 if (sel->ret < sel->objnum) in selection_getobjects()
131 return sel->objects[sel->ret - 1]; in selection_getobjects()
133 sel->ret = 0; in selection_getobjects()
[all …]
/dports/devel/libgnt/libgnt-2.14.3/
H A Dgntfilesel.c65 if (sel->tags) { in gnt_file_sel_destroy()
111 tmp = sel->suggest ? sel->suggest : in update_location()
112 …(const char*)gnt_tree_get_selection_data(sel->dirsonly ? GNT_TREE(sel->dirs) : GNT_TREE(sel->files… in update_location()
198 if (!sel->dirs) in location_changed()
218 success = sel->read_fn(sel->current, &files, err); in location_changed()
234 if (sel->multiselect && sel->dirsonly && is_tagged(sel, str)) in location_changed()
242 if (sel->multiselect && is_tagged(sel, str)) in location_changed()
411 tree = sel->dirsonly ? sel->dirs : sel->files; in toggle_tag_selection()
421 sel->tags = g_list_delete_link(sel->tags, find); in toggle_tag_selection()
425 sel->tags = g_list_prepend(sel->tags, str); in toggle_tag_selection()
[all …]
/dports/sysutils/burp/burp-2.4.0/src/client/monitor/
H A Dstatus_client_ncurses.c440 if(!sel->logop) sel->logop=bit; in print_logs_list_line()
1014 static void left(struct sel *sel) in left() argument
1064 sel->client=sel->client->prev; in up_client()
1070 sel->client=sel->client->next; in down_client()
1076 sel->backup=sel->backup->prev; in up_backup()
1082 sel->backup=sel->backup->next; in down_backup()
1118 sel->lline=sel->lline->prev; in up_view_log()
1124 sel->lline=sel->lline->next; in down_view_log()
1127 static void up(struct sel *sel) in up() argument
1416 sel->client=sel->clist; in status_client_ncurses_main_loop()
[all …]
/dports/sysutils/burp-devel/burp-2.5.4/src/client/monitor/
H A Dstatus_client_ncurses.c440 if(!sel->logop) sel->logop=bit; in print_logs_list_line()
1014 static void left(struct sel *sel) in left() argument
1064 sel->client=sel->client->prev; in up_client()
1070 sel->client=sel->client->next; in down_client()
1076 sel->backup=sel->backup->prev; in up_backup()
1082 sel->backup=sel->backup->next; in down_backup()
1118 sel->lline=sel->lline->prev; in up_view_log()
1124 sel->lline=sel->lline->next; in down_view_log()
1127 static void up(struct sel *sel) in up() argument
1416 sel->client=sel->clist; in status_client_ncurses_main_loop()
[all …]
/dports/devel/pear-HTML_QuickForm2/HTML_QuickForm2-2.2.2/tests/QuickForm2/Element/
H A DSelectTest.php55 $sel->__toString()
63 $this->assertSame($sel, $sel->setValue('Value'));
66 $this->assertSame($sel, $sel->setValue('Nonextistent'));
85 $this->assertSame($sel, $sel->setValue('Other Value'));
88 $this->assertSame($sel, $sel->setValue('Nonexistent'));
91 $this->assertSame($sel, $sel->setValue(['Value', 'Different Value', 'Nonexistent']));
120 $sel->__toString()
146 $sel->__toString()
165 $sel->__toString()
189 $this->assertSame($sel, $sel->loadOptions(['one' => 'First', 'two' => 'Second']));
[all …]

12345678910>>...385