Searched refs:items (Results 1 - 25 of 46) sorted by relevance

12

/barrelfish-master/tools/harness/machines/
H A Deth_machinedata.py440 # }.items() + {
449 # } for b in range(1, 17) if b != 11 }.items()
452 }.items() +
463 ).items() +
474 ).items() +
486 ).items() +
497 ).items()
/barrelfish-master/lib/openssl-1.0.0d/crypto/pqueue/
H A Dpqueue.c66 pitem *items; member in struct:_pqueue
115 if (pq->items == NULL)
117 pq->items = item;
121 for(curr = NULL, next = pq->items;
133 pq->items = item;
153 return pq->items;
159 pitem *item = pq->items;
161 if (pq->items != NULL)
162 pq->items = pq->items
[all...]
/barrelfish-master/usr/eclipseclp/CPViz/viz/src/ie/ucc/cccc/viz/
H A DVisualizerBinPacking.java29 * A visualizer for the bin_packing constraint. Has three arguments for the items (dvars),
42 FullDomain[] items = visualState.argumentDomainArray("items");
59 for(int j=1;j<items.length;j++) {
60 if (items[j].isInDomain(i)) {
61 if (items[j].isFixed()) {
80 FullDomain[] items = visualState.argumentDomainArray("items");
99 for(int j=1;j<items.length;j++) {
100 if (items[
[all...]
/barrelfish-master/lib/zlib/
H A Dzutil.c216 voidpf zcalloc (voidpf opaque, unsigned items, unsigned size) argument
219 ulg bsize = (ulg)items*size;
275 voidpf zcalloc (voidpf opaque, unsigned items, unsigned size) argument
278 return _halloc((long)items, size);
296 extern voidp calloc OF((uInt items, uInt size));
300 voidpf zcalloc (opaque, items, size)
302 unsigned items;
305 if (opaque) items += size - size; /* make compiler happy */
306 return sizeof(uInt) > 2 ? (voidpf)malloc(items * size) :
307 (voidpf)calloc(items, siz
[all...]
H A Dzutil.h261 voidpf zcalloc OF((voidpf opaque, unsigned items, unsigned size));
264 #define ZALLOC(strm, items, size) \
265 (*((strm)->zalloc))((strm)->opaque, (items), (size))
/barrelfish-master/tools/usbboot/include/omap4/
H A Dboot.h39 uint8_t items; member in struct:omap44xx_id
/barrelfish-master/tools/
H A Dcreate_mdb_dot.py62 for key, value in capmatch.groupdict().items():
101 for kaddr,cap in nodedict.items():
119 for kaddr,cap in nodedict.items():
142 for kaddr,cap in nodedict.items():
/barrelfish-master/tools/pyaquarium/
H A Daquarium.py12 for typekey, evtype in json_data.items():
H A Dtrace_parser.py52 for evid, event in json.items():
/barrelfish-master/usr/eclipseclp/documents/tutorial/
H A Dfdintro.tex326 different items into the minimal number of bins under specific constraints.
330 \item There are 5 types of items:
369 \item green contains at most 2 wood items
375 \item 2 plastic items
376 \item 1 steel items
377 \item 3 wood items
378 \item 2 copper items
387 of glass items, plastic items, steel items, woo
[all...]
H A Dicintro.tex816 different items into the minimal number of bins under specific constraints.
820 \item There are 5 types of items:
861 \item green contains at most 2 wood items
868 \item 2 plastic items
870 \item 3 wood items
871 \item 2 copper items
878 of glass items, plastic items, steel items, wood items an
[all...]
H A Dsetsolver.tex396 Suppose that the items each have an associated profit, namely 17, 38, 18, 10
397 and 5, respectively. Which items should be included to maximise profit?
402 Write a predicate which, given a list of sizes of items and a list of
404 items should go into each bucket. Obviously each item should go into
407 Try it out with 5 items of sizes 20, 34, 9, 12 and 19, into 3 buckets of
H A Drepairtut.tex540 a given capacity and a set of items with given weights and profit
541 values, find out which items have to be packed into the container
561 \item {\tt N} - the number of items (integer)
610 remove random items (changing 1 to 0) if the knapsack's capacity is
611 exceeded and to add random items (changing 0 to 1) if there is
H A Deprolog.tex165 arrays of items.
326 is a string and not an atom. The writeq-format quotes items properly,
678 Predicates and syntax items can be declared local or
778 \subsection{Exporting items other than Predicates}
779 The most commonly exported items, apart from predicates,
/barrelfish-master/usr/eclipseclp/lib_tcl/widget/
H A Dprogressbar.tcl81 ## Remove the given item from the list of items being displayed.
104 ## Returns the names of the progressbar's constituent items.
109 ## on the values of the consituent items, if any. This is only
110 ## necessary when changing from using the progressbar without items
111 ## to using it with items.
175 set data(items) $data(class)${w}ITEMS
346 # Manage progress items. These may be documents or images.
445 ## Don't complain about unknown items when deleting
557 set items {}
559 lappend items [strin
[all...]
/barrelfish-master/usr/eclipseclp/Kernel/lib/
H A Delipsys_fd.pl184 % Array of items to speed up the accesses
185 ArrayItems =.. [items|ListItems],
220 % Array of items to speed up the accesses
221 ArrayItems =.. [items|ListItems],
H A Dfd_elipsys.pl207 % Array of items to speed up the accesses
208 ArrayItems =.. [items|ListItems],
243 % Array of items to speed up the accesses
244 ArrayItems =.. [items|ListItems],
/barrelfish-master/usr/eclipseclp/CPViz/viztool/src/components/
H A DMenuFactory.java66 * Consecutive RADIO items are put in a ButtonGroup
103 * @param am the actions to add to menu items
297 List items = getSpecializedStringList(name, specialization);
298 Iterator it = items.iterator();
/barrelfish-master/tools/harness/
H A Dbuilds.py103 for item in conf.items():
/barrelfish-master/lib/openssl-1.0.0d/util/
H A Dpod2man.pl1093 my(@items) = split( /(?:,?\s+(?:and\s+)?)/ );
1096 for ($i = 0; $i <= $#items; $i++) {
1097 $retstr .= "C<$items[$i]>";
1098 $retstr .= ", " if @items > 2 && $i != $#items;
1099 $retstr .= " and " if $i+2 == @items;
1102 $retstr .= " entr" . ( @items > 1 ? "ies" : "y" )
/barrelfish-master/include/
H A Dzlib.h77 typedef voidpf (*alloc_func) OF((voidpf opaque, uInt items, uInt size));
/barrelfish-master/tools/usbboot/
H A Dusbboot.c168 assert(id.items == 5);
/barrelfish-master/usr/eclipseclp/documents/visualisation/
H A Dclients.tex452 movable like other items on the desktop. Currently there is no way to
489 click) and dragging (click-and-move) them. New items may be added to
491 clicking with the left mouse button. Ranges of items are selected by
493 rectangle around the desired items. When dragging a selection all
494 items move, except lines on the \textbf{Network viewer}.
/barrelfish-master/usr/eclipseclp/documents/applications/
H A Dtutorial.tex428 \item[arguments] In the first alternative, all data are passed in arguments to the query. Multiple items of the same type will usually be represented as lists, with structures to hold different attributes of the different objects. This form has the advantage that each query can be run with a completely new data set without changing the database or creating a new set of files. But debugging data in this form can be more difficult, as there is not direct way to look up some data item. This method also requires work on the Java side to build all the data structures before a call to the ECLiPSe solver. A similar effort is required to develop testing code written in ECLiPSe which exercises the interface.
507 A natural way to represent a collection of items of the same type is to use lists\index{list}. They are very convenient to handle an arbitrary number of items by iterating on successive heads of the list, until the empty list is reached. Unfortunately, finding a particular item in a list is a very expensive operation, as we have to scan the list sequentially.
509 We should never use a list when we can use a structure\index{structure} instead. If we know that a collection will always have the same number of items (say 3), it is much better to use a structure with that number of arguments than to use a list.
512 Hash tables\index{hash tables} are a very useful alternative to lists, if we sometimes want to look up items rather than iterate over all of them. They are defined in the library {\it hash}.
513 We can add items one by one, without an a priori limit on the number of items.
516 While it is possible to iterate over all items of a hash table, this is not as simple as iteration over a list or an array.
519 Vectors\index{vector} are another way to represent a collection of items. Each item is associated with an integer key in the range from 1 to $N$, where $N$ is the size of the vector. Unfortunately, the value $N$ must be known a priori, when we first create the vector. Accessing individual entries by index is very fast, and iterating over all entries is nearly as simple as for lists. The main drawbacks of a vector representation are that we have to know the total number of items beforehan
[all...]
/barrelfish-master/usr/eclipseclp/documents/embedding/
H A Dembsumcxx.tex196 references to {\eclipse} data items. They are each initialised
201 references to {\eclipse} data items. They are all initialised

Completed in 82 milliseconds

12