/barrelfish-2018-10-04/lib/libc/inet/ |
H A D | inet_ntop.c | 115 struct { int base, len; } best, cur; local 127 best.base = -1; 128 best.len = 0; 139 if (best.base == -1 || cur.len > best.len) 140 best = cur; 146 if (best.base == -1 || cur.len > best.len) 147 best = cur; 149 if (best [all...] |
H A D | inet_cidr_ntop.c | 165 struct { int base, len; } best, cur; local 182 best.base = -1; 183 best.len = 0; 194 if (best.base == -1 || cur.len > best.len) 195 best = cur; 201 if (best.base == -1 || cur.len > best.len) 202 best = cur; 204 if (best [all...] |
/barrelfish-2018-10-04/lib/posixcompat/ |
H A D | inet_ntop.c | 111 struct { int base, len; } best, cur; local 125 best.base = -1; 126 best.len = 0; 137 if (best.base == -1 || cur.len > best.len) 138 best = cur; 144 if (best.base == -1 || cur.len > best.len) 145 best = cur; 147 if (best [all...] |
/barrelfish-2018-10-04/usr/drivers/usb/usb_manager/controller/ohci/ |
H A D | usb_ohci_pipe.c | 211 uint16_t best; local 215 best = 0; 224 * loop over the possible interrupt intervals and find the best 230 best = bit; 232 if (hc->intr_stats[x] < hc->intr_stats[best]) { 233 best = x; 243 hc->intr_stats[best]++; 244 xfer->intr_qh_pos = best;
|
/barrelfish-2018-10-04/usr/device_managers/dma/ |
H A D | dma_mgr_drivers.c | 79 struct dma_service *best = NULL; local 84 if (best == NULL) { 85 best = current; 88 best->info.numa_node); 92 best = current; 99 return best;
|
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/ |
H A D | project.pl | 40 % same order. The best thing to do is to write 49 % This is second best. Doing it this way does mean that you can
|
/barrelfish-2018-10-04/usr/eclipseclp/lib_tcl/widget/ |
H A D | util.tcl | 351 # finds the best unique match in a list of names 355 # l list to find best unique match in 356 # e currently best known unique match 657 # -best ?var? - 'Fixes' value to fit format, placing best correct value 666 set fill {}; set strict 0; set best {}; set result 1; 671 set best [lindex $args 1] 688 must be: -best, -fill, -strict, or --" 694 return -code error "wrong \# args: should be \"$name ?-best varname?\ 737 if [string compare $best {}] { [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/GecodeInterface/ |
H A D | gfd.cpp | 5782 int size = idxarr[0], bestidx = -1, best; local 5794 Find_Best_IntVar_For(Int::Limits::max, best, dsize, 5795 ((int)dsize < best)); 5803 Find_Best_IntVar_For(Int::Limits::min, best, it, 5804 ((int)(it=solver->vInt[idx].degree()) > best)); 5806 Find_Best_IntVar_For(Int::Limits::max, best, it, 5807 ((int)(it=solver->vInt[idx].degree()) < best)); 5817 Find_Best_IntVar_For(Int::Limits::max, best, it, 5818 ((int)(it=solver->vInt[idx].min()) < best)); 5820 Find_Best_IntVar_For(Int::Limits::min, best, i [all...] |
/barrelfish-2018-10-04/lib/openssl-1.0.0d/test/ |
H A D | maketests.com | 622 $! We have SOCKETSHR, and it is my opinion that it's the best to use.
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | branch_and_bound.pl | 94 the best solution. For example: 317 To is number_max(Best), % we are trying to improve the guaranteed best 488 To is number_max(Best), % we are trying to improve the guaranteed best 683 from the current best solution, taking into account the 698 the best solution by less than this value will be missed.</DD> 751 representing the cost of the best solution found, Handle 943 from the current best solution, taking into account the 995 representing the cost of the best solution found, Handle
|
H A D | fd_chip.pl | 179 % compute constraints_number of best lazily:
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | hybrid.tex | 29 different subproblems that are best addressed by different algorithms 80 problems for which the different solvers are best suited. 83 Problems involving disjunctions of constraints are often best 85 Often set covering problems are best handled by {\tt eplex} and 88 which solver is best. 603 constraints to both {\tt ic} and {\tt eplex} is rarely the best 685 However for large applications it is best to send constraints only to 729 previous best value, during a branch and bound search). The approach 1011 \item[(c)] Try and find the best hybrid algorithm.
|
H A D | search.tex | 49 which have to be located by search, e.g.\ in order to find the best one. 182 the best solution. 190 \item Add a constraint requiring a better solution than the best 193 If one exists, we have a new best solution and we repeat step 2. 629 \item If there are N solutions, the best achievable value is N (one backtrack 873 a maximal runtime to be specified. If a timeout occurs, the best solution 915 value selection choice as the heuristically best value with 1155 What is the best and what is the worst solution for this problem?
|
H A D | repairtut.tex | 613 track of the best solution encountered. 621 solution is better than the best one so far. 748 the item with the best relative profit into the knapsack, or removing
|
H A D | modelling.tex | 40 This is best characterised by two pseudo-equations.
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ech/ |
H A D | puzzle_bool.pl | 64 but for N=18 or 19 there are several thousand, so perhaps it is best to
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/ssl/ |
H A D | ssl-lib.com | 775 $! We have SOCKETSHR, and it is my opinion that it's the best to use.
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/search/ |
H A D | search.tex | 79 which have to be located by search, e.g.\ in order to find the best one. 202 the best solution. 210 \item Add a constraint requiring a better solution than the best 213 If one exists, we have a new best solution and we repeat step 2. 611 \item If there are N solutions, the best achievable value is N (one backtrack 759 to specify a maximal runtime. If a timeout occurs, the best solution 1144 track of the best solution encountered. 1152 solution is better than the best one so far. 1336 the item with the best relative profit into the knapsack, or removing
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/ |
H A D | solverinter.tex | 193 different library, module qualification is best omitted.
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | umsstring.tex | 148 manipulation on the single character level, it is probably best to use
|
H A D | umsporting.tex | 194 If some code relies on such behaviour, it is best to modify it by
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/ |
H A D | crypto-lib.com | 1029 $! We have SOCKETSHR, and it is my opinion that it's the best to use.
|
/barrelfish-2018-10-04/doc/015-disk-driver-arch/ |
H A D | flounder-ahci.tex | 94 all be used as sources of information. The question is therefore how best to
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/intro_paper/ |
H A D | eclipse.tex | 138 best one: rather \ECL provides a platform supporting experimentation 184 %To avoid any possible wrong assumptions, it is therefore best to study 510 Given that the core combinatorial optimisation problem is best solved 765 the best feasible solution to the problem is one which minimises the 886 solvers so as to use the best one. 910 It is best seen as three libraries. 1064 often best to make the choice with the fewest alternatives first. 1217 are best explored by obtaining the \ECL extensions manual 1397 that the seven sided house is best for the given cost 1679 best algorith [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/applications/ |
H A D | tutorial.tex | 93 The tutorial is aimed at programmers learning how to develop applications with ECLiPSe and tries to codify a 'best practice'\index{best practice} for developers. It assumes a basic familarity with concepts of constraint and logic programming and is not a reference manual, so many concepts and language elements are only introduced very briefly. The material also includes some general topics from software engineering. Knowledge of general OO-related methodologies may be helpful to put that material into context. 1071 \index{best and rest}This concept is an extension of the minimum concept. It not only returns the best element in the input list, but also the rest of the original list without the best element. This rest can then be used for example to select another element, and so on. 1085 best(X,In1,Out1,In2,Out2) 1088 best(X,Y,X,L,[Y|L]):- 1091 best(X,Y,Y,L,[X|L]). 1096 If several elements of the list have the same best value, only the first one is selected. 1782 The best wa [all...] |