Home
last modified time | relevance | path

Searched refs:mylist (Results 1 – 25 of 1250) sorted by relevance

12345678910>>...50

/dports/databases/redis6/redis-6.0.16/tests/unit/type/
H A Dlist-2.tcl12 set mylist {}
14 r del mylist
18 r rpush mylist $large
19 lappend mylist $large
23 r rpush mylist $str
24 lappend mylist $str
32 set mylist [lrange $mylist $min $max]
34 assert_equal $mylist [r lrange mylist 0 -1] "failed trim"
39 r rpush mylist $str
40 lappend mylist $str
[all …]
H A Dlist.tcl10 r DEL mylist
11 r RPUSH mylist a b c 1 2 3 c c
12 assert {[r LPOS mylist a] == 0}
54 r DEL mylist
120 r del mylist
611 r del mylist
633 r del mylist
634 r set mylist foobar
672 assert_equal c [r rpoplpush mylist mylist]
744 r del mylist
[all …]
/dports/databases/redis5/redis-5.0.14/tests/unit/type/
H A Dlist-2.tcl12 set mylist {}
14 r del mylist
18 r rpush mylist $large
19 lappend mylist $large
23 r rpush mylist $str
24 lappend mylist $str
32 set mylist [lrange $mylist $min $max]
34 assert_equal $mylist [r lrange mylist 0 -1] "failed trim"
39 r rpush mylist $str
40 lappend mylist $str
[all …]
/dports/databases/redis-devel/redis-0e5b813/tests/unit/type/
H A Dlist-2.tcl12 set mylist {}
14 r del mylist
18 r rpush mylist $large
19 lappend mylist $large
23 r rpush mylist $str
24 lappend mylist $str
33 set mylist [lrange $mylist $min $max]
35 assert_equal $mylist [r lrange mylist 0 -1] "failed trim"
39 r rpush mylist $str
40 lappend mylist $str
[all …]
H A Dlist.tcl419 r DEL mylist
463 r DEL mylist
464 r LPUSH mylist a
545 r del mylist
1312 r del mylist
1334 r del mylist
1396 assert_equal c [r rpoplpush mylist{t} mylist{t}]
1505 assert_equal {mylist {2 1}} [r lmpop 2 mylist mylist right count 2]
1581 assert_equal {mylist{t} {a b}} [r lmpop 2 mylist{t} mylist{t} left count 2]
1582 assert_equal {mylist{t} {f e}} [r lmpop 2 mylist{t} mylist{t} right count 2]
[all …]
/dports/devel/py-PyUtilib/PyUtilib-6.0.0/pyutilib/math/
H A Dmedian3.py11 def median(mylist): argument
15 mylist = list(mylist)
16 mylist.sort()
17 if (len(mylist) == 0):
20 elif (len(mylist) == 1):
21 return mylist[0]
22 elif (divmod(len(mylist), 2)[1] == 1):
23 return mylist[(len(mylist) - 1) // 2]
24 ndx = len(mylist) // 2
25 return (mylist[ndx - 1] + mylist[ndx]) / 2.0
H A Dmedian2.py11 def median(mylist): argument
15 mylist = list(mylist)
16 mylist.sort()
17 if (len(mylist) == 0):
20 elif (len(mylist) == 1):
21 return mylist[0]
22 elif (divmod(len(mylist), 2)[1] == 1):
23 return mylist[(len(mylist) - 1) / 2]
24 ndx = len(mylist) / 2
25 return (mylist[ndx - 1] + mylist[ndx]) / 2.0
/dports/lang/lafontaine/lafontaine-0.4/src/
H A Dlist.c46 CLASS(mylist)->classtype = CLASS_LIST; in list_alloc()
47 CLASS(mylist)->refcnt = 0; in list_alloc()
49 mylist->GTKList = NULL; in list_alloc()
50 mylist->free = free; in list_alloc()
51 return(mylist); in list_alloc()
63 void list_free(struct s_list *mylist) in list_free() argument
65 if(--(CLASS(mylist)->refcnt) == 0) in list_free()
67 g_slist_foreach(mylist->GTKList, mylist->free, NULL); in list_free()
68 g_slist_free(mylist->GTKList); in list_free()
70 _XFREE(mylist); in list_free()
[all …]
/dports/security/py-exscript/exscript-2.6/tests/templates/stdlib.list/
H A Dtest.exscript2 mylist = list.new()
3 append "abc" to mylist
4 append "def" to mylist
5 append "ghi" to mylist
6 append "ghi" to mylist
8 fail "list.length (before unique)" if list.length(mylist) is not 4
9 fail "list.get" if list.get(mylist, 0) is not "abc"
10 fail "list.get" if list.get(mylist, 1) is not "def"
11 fail "list.get" if list.get(mylist, 2) is not "ghi"
12 fail "list.get" if list.get(mylist, 3) is not "ghi"
[all …]
/dports/lang/fpc-source/fpc-3.2.2/packages/amunits/examples/otherlibs/
H A Dlinklib.pas19 mylist : pList;
40 IF Assigned(mylist) THEN DestroyList(mylist);
50 IF NodesInList(mylist) > 0 THEN dummy := 0
66 temp := GetFirstNode(mylist);
68 temp := GetLastNode(mylist);
105 mynode := GetNodeNumber(mylist,num);
132 ClearList(mylist);
152 mynode := GetNodeNumber(mylist,num);
154 MoveNodeDown(mylist,mynode);
170 MoveNodeUp(mylist,mynode);
[all …]
/dports/net-mgmt/netdisco/App-Netdisco-2.047002/share/views/ajax/admintask/
H A Dusers_csv.tt7 [% mylist = [] %]
8 [% mylist.push(row.fullname) %]
9 [% mylist.push(row.username) %]
10 [% mylist.push(row.ldap) %]
11 [% mylist.push(row.radius) %]
12 [% mylist.push(row.tacacs) %]
14 [% mylist.push(row.admin) %]
15 [% mylist.push(row.created) %]
16 [% mylist.push(row.last_seen) %]
17 [% mylist.push(row.note) %]
[all …]
/dports/net-mgmt/nagios-check_bacula11/bacula-11.0.5/src/lib/
H A Dflist.c88 flist mylist; member
107 fileset->mylist.init(); in main()
111 fileset->mylist.queue((void*)"first"); in main()
112 fileset->mylist.queue((void*)"second"); in main()
113 fileset->mylist.queue((void*)"third"); in main()
114 q = (char*)fileset->mylist.dequeue(); in main()
116 q = (char*)fileset->mylist.dequeue(); in main()
118 q = (char*)fileset->mylist.dequeue(); in main()
130 if (!fileset->mylist.queue(p)) { in main()
137 if (!fileset->mylist.queue(p)) { in main()
[all …]
/dports/net-mgmt/nagios-check_bacula9/bacula-9.6.7/src/lib/
H A Dflist.c88 flist mylist; member
107 fileset->mylist.init(); in main()
111 fileset->mylist.queue((void*)"first"); in main()
112 fileset->mylist.queue((void*)"second"); in main()
113 fileset->mylist.queue((void*)"third"); in main()
114 q = (char*)fileset->mylist.dequeue(); in main()
116 q = (char*)fileset->mylist.dequeue(); in main()
118 q = (char*)fileset->mylist.dequeue(); in main()
130 if (!fileset->mylist.queue(p)) { in main()
137 if (!fileset->mylist.queue(p)) { in main()
[all …]
/dports/sysutils/bacula11-server/bacula-11.0.5/src/lib/
H A Dflist.c88 flist mylist; member
107 fileset->mylist.init(); in main()
111 fileset->mylist.queue((void*)"first"); in main()
112 fileset->mylist.queue((void*)"second"); in main()
113 fileset->mylist.queue((void*)"third"); in main()
114 q = (char*)fileset->mylist.dequeue(); in main()
116 q = (char*)fileset->mylist.dequeue(); in main()
118 q = (char*)fileset->mylist.dequeue(); in main()
130 if (!fileset->mylist.queue(p)) { in main()
137 if (!fileset->mylist.queue(p)) { in main()
[all …]
/dports/sysutils/bacula11-client-static/bacula-11.0.5/src/lib/
H A Dflist.c88 flist mylist; member
107 fileset->mylist.init(); in main()
111 fileset->mylist.queue((void*)"first"); in main()
112 fileset->mylist.queue((void*)"second"); in main()
113 fileset->mylist.queue((void*)"third"); in main()
114 q = (char*)fileset->mylist.dequeue(); in main()
116 q = (char*)fileset->mylist.dequeue(); in main()
118 q = (char*)fileset->mylist.dequeue(); in main()
130 if (!fileset->mylist.queue(p)) { in main()
137 if (!fileset->mylist.queue(p)) { in main()
[all …]
/dports/sysutils/bacula9-client/bacula-9.6.7/src/lib/
H A Dflist.c88 flist mylist; member
107 fileset->mylist.init(); in main()
111 fileset->mylist.queue((void*)"first"); in main()
112 fileset->mylist.queue((void*)"second"); in main()
113 fileset->mylist.queue((void*)"third"); in main()
114 q = (char*)fileset->mylist.dequeue(); in main()
116 q = (char*)fileset->mylist.dequeue(); in main()
118 q = (char*)fileset->mylist.dequeue(); in main()
130 if (!fileset->mylist.queue(p)) { in main()
137 if (!fileset->mylist.queue(p)) { in main()
[all …]
/dports/sysutils/bacula9-client-static/bacula-9.6.7/src/lib/
H A Dflist.c88 flist mylist; member
107 fileset->mylist.init(); in main()
111 fileset->mylist.queue((void*)"first"); in main()
112 fileset->mylist.queue((void*)"second"); in main()
113 fileset->mylist.queue((void*)"third"); in main()
114 q = (char*)fileset->mylist.dequeue(); in main()
116 q = (char*)fileset->mylist.dequeue(); in main()
118 q = (char*)fileset->mylist.dequeue(); in main()
130 if (!fileset->mylist.queue(p)) { in main()
137 if (!fileset->mylist.queue(p)) { in main()
[all …]
/dports/sysutils/bacula9-server/bacula-9.6.7/src/lib/
H A Dflist.c88 flist mylist; member
107 fileset->mylist.init(); in main()
111 fileset->mylist.queue((void*)"first"); in main()
112 fileset->mylist.queue((void*)"second"); in main()
113 fileset->mylist.queue((void*)"third"); in main()
114 q = (char*)fileset->mylist.dequeue(); in main()
116 q = (char*)fileset->mylist.dequeue(); in main()
118 q = (char*)fileset->mylist.dequeue(); in main()
130 if (!fileset->mylist.queue(p)) { in main()
137 if (!fileset->mylist.queue(p)) { in main()
[all …]
/dports/sysutils/bacula11-client/bacula-11.0.5/src/lib/
H A Dflist.c88 flist mylist; member
107 fileset->mylist.init(); in main()
111 fileset->mylist.queue((void*)"first"); in main()
112 fileset->mylist.queue((void*)"second"); in main()
113 fileset->mylist.queue((void*)"third"); in main()
114 q = (char*)fileset->mylist.dequeue(); in main()
116 q = (char*)fileset->mylist.dequeue(); in main()
118 q = (char*)fileset->mylist.dequeue(); in main()
130 if (!fileset->mylist.queue(p)) { in main()
137 if (!fileset->mylist.queue(p)) { in main()
[all …]
/dports/graphics/blender/blender-2.91.0/tests/python/
H A Dbl_pyapi_idprop.py65 mylist = [1.2, 3.4, 5.6]
66 self.id["a"] = mylist
71 mylist = [1, 2, 3]
72 self.id["a"] = mylist
77 mylist = [1.2, 3.4, 5.6]
89 mylist = [1, 2, 3]
95 mylist = [1, 2, 3]
106 mylist = ["abc", "qwe"]
107 self.id["a"] = mylist
183 mylist = [1, 2, 3]
[all …]
/dports/devel/boost-docs/boost_1_72_0/libs/interprocess/example/
H A Ddoc_managed_heap_memory.cpp27 MyList * mylist = heap_memory.construct<MyList>("MyList") in main() local
31 managed_heap_memory::handle_t list_handle = heap_memory.get_handle_from_address(mylist); in main()
36 mylist->insert(mylist->begin(), 0); in main()
43 MyList::size_type old_size = mylist->size(); in main()
54 mylist = static_cast<MyList *> in main()
60 mylist->insert(mylist->begin(), 0); in main()
68 MyList::size_type new_size = mylist->size(); in main()
76 heap_memory.destroy_ptr(mylist); in main()
/dports/devel/boost-python-libs/boost_1_72_0/libs/interprocess/example/
H A Ddoc_managed_heap_memory.cpp27 MyList * mylist = heap_memory.construct<MyList>("MyList") in main() local
31 managed_heap_memory::handle_t list_handle = heap_memory.get_handle_from_address(mylist); in main()
36 mylist->insert(mylist->begin(), 0); in main()
43 MyList::size_type old_size = mylist->size(); in main()
54 mylist = static_cast<MyList *> in main()
60 mylist->insert(mylist->begin(), 0); in main()
68 MyList::size_type new_size = mylist->size(); in main()
76 heap_memory.destroy_ptr(mylist); in main()
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/interprocess/example/
H A Ddoc_managed_heap_memory.cpp27 MyList * mylist = heap_memory.construct<MyList>("MyList") in main() local
31 managed_heap_memory::handle_t list_handle = heap_memory.get_handle_from_address(mylist); in main()
36 mylist->insert(mylist->begin(), 0); in main()
43 MyList::size_type old_size = mylist->size(); in main()
51 mylist = static_cast<MyList *> in main()
57 mylist->insert(mylist->begin(), 0); in main()
65 MyList::size_type new_size = mylist->size(); in main()
70 heap_memory.destroy_ptr(mylist); in main()
/dports/databases/percona57-server/boost_1_59_0/libs/interprocess/example/
H A Ddoc_managed_heap_memory.cpp27 MyList * mylist = heap_memory.construct<MyList>("MyList") in main() local
31 managed_heap_memory::handle_t list_handle = heap_memory.get_handle_from_address(mylist); in main()
36 mylist->insert(mylist->begin(), 0); in main()
43 MyList::size_type old_size = mylist->size(); in main()
51 mylist = static_cast<MyList *> in main()
57 mylist->insert(mylist->begin(), 0); in main()
65 MyList::size_type new_size = mylist->size(); in main()
70 heap_memory.destroy_ptr(mylist); in main()
/dports/databases/xtrabackup/boost_1_59_0/libs/interprocess/example/
H A Ddoc_managed_heap_memory.cpp27 MyList * mylist = heap_memory.construct<MyList>("MyList") in main() local
31 managed_heap_memory::handle_t list_handle = heap_memory.get_handle_from_address(mylist); in main()
36 mylist->insert(mylist->begin(), 0); in main()
43 MyList::size_type old_size = mylist->size(); in main()
51 mylist = static_cast<MyList *> in main()
57 mylist->insert(mylist->begin(), 0); in main()
65 MyList::size_type new_size = mylist->size(); in main()
70 heap_memory.destroy_ptr(mylist); in main()

12345678910>>...50