/barrelfish-master/lib/tommath/ |
H A D | bn.tex | 76 large integer numbers. It was written in portable ISO C source code so that it will build on any platform with a conforming 79 In a nutshell the library was written from scratch with verbose comments to help instruct computer science students how 85 As of the v0.25 the library source code has been placed in the public domain with every new release. As of the v0.28 86 release the textbook ``Implementing Multiple Precision Arithmetic'' has been placed in the public domain with every new 91 public domain everyone is entitled to do with them as they see fit. 95 LibTomMath is meant to be very ``GCC friendly'' as it comes with a makefile well suited for GCC. However, the library will 106 that and include ``tommath.h'' within your programs. Alternatively to build with MSVC issue the following 111 This will build the library and archive the object files in ``tommath.lib''. This has been tested with MSVC 112 version 6.00 with service pack 5. 125 Cygwin to work with sinc [all...] |
/barrelfish-master/usr/eclipseclp/ecrc_solvers/ |
H A D | r.pl | 6 % in compliance with the License. You may obtain a copy of the License 241 is_pvar(_{lin with [pvar:Pvar]}) ?- 247 Attr = lin with [pvar:true]. 250 add_attribute(X, lin with [pvar:true,constr:[]]). 257 Lin = lin with [], % Lin = lin(_,_,_) 260 lin_rhs(_{lin with [rhs:Rhs]}, Rhs1) ?- 263 lin_constr(_{lin with [constr:Constr]}, Constr1) ?- 271 Lin = lin with [constr:OldLocal], 277 linear_term(_{lin with []}) ?- 292 Attr = lin with [const [all...] |
H A D | set.pl | 6 % in compliance with the License. You may obtain a copy of the License 98 tr_set(set with setdom:[Glb, Lub], T) :- 190 glb(_{set with setdom:[G,_L]}, Glb) ?- Glb = G. 192 lub(_{set with setdom:[_G,L]}, Lub) ?- Lub = L. 194 set_range(_{set with setdom:[G,L]}, Glb, Lub) ?- !, Glb = G, Lub = L. 196 set_or_set_range(_{set with setdom:[G,L]}, Glb, Lub) ?- !, Glb = G, Lub = L. 212 Attr= set with setdom:[Min,Max], 226 AttrSY= set with [card:CardY,setdom:[MinY,MaxY], weight: WeiY], 227 AttrSX= set with [card:CardX,setdom:[MinX,MaxX], weight: WeiX], 262 Attr = set with [del_lu [all...] |
/barrelfish-master/usr/eclipseclp/documents/applications/ |
H A D | tutorial.tex | 6 % in compliance with the License. You may obtain a copy of the License 55 \techReport{03-2}{Developing Applications with ECLiPSe}{H. Simonis\\ 59 %\title{Developing Applications with ECLiPSe}% 70 applications with the ECLiPSe system. This methodology follows a top-down 75 is intended for programmers developing applications with ECLiPSe 76 as well as those tasked with the maintenance of such programs. 86 This tutorial is an introduction to the design, development, test and maintenance of large scale applications with the ECLiPSe system. It follows a top-down methodology of converting an initial high-level specification into executable code of high quality. We assume that fundamental decisions on selecting the right tool and the right problem solver have already been taken so that we are commited to using ECLiPSe and one of its problem solving libraries. We are basically interested in the engineering aspects of the program development, not its research and development content. 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. 109 The tutorial follows a top-down methodology for the design of an application. Chapter~\ref{highleveldesign} discusses general issues of modular design and self-documenting code for ECLiPSe programs. The next chapter on data structures compares different ways of representing data internally and externally, and presents a canonical multi-representation format which allows effective access to data in all parts of an application. Chapter~\ref{gettingittowork} shows how to convert a high level specification into an executable program early in the development stage. The bulk of the tutorial is contained in chapter~\ref{programmingconcepts}, where we present a number of different programming concepts which can be used as development templates to solve particular problems. This is followed by chapter~\ref{inputoutput} on input/output, a particularly important aspect of developing extensible programs. The last two chapters deal with debuggin [all...] |
/barrelfish-master/usr/eclipseclp/documents/search/ |
H A D | search.tex | 6 % in compliance with the License. You may obtain a copy of the License 73 (in this context, we only consider domains with a finite number of values). 89 with the problem size: 107 Figure \ref{figsearchspace} shows a search space with N (here 16) 126 Here is table of a selection of search methods together with their properties: 146 partitioning it systematically. This can be done naturally with a 151 completely (with as little as O(N) memory requirements). 187 is only possible with constructive methods which allow to reason about 191 This can only be implemented with 224 Since search space sizes grow exponentially with proble [all...] |
/barrelfish-master/usr/eclipseclp/icparc_solvers/ |
H A D | ic_probe_search.pl | 6 % in compliance with the License. You may obtain a copy of the License 42 binaries associated with a given task start time 84 Biv - a binary variable with an attribute recording which two tasks 114 Task1 = task with start:S1, 115 Task2 = task with [start:S2,duration:D2,resource:R2], 142 The tightest binary is the one with the biggest overlap (from the 185 binary is the one with the greatest score. 203 /* Returns the binary variable with the greatest associated overlap 218 ftb finds, among the binary variables with a non-zero tentative value, 260 List - a list of binaries (with attribut [all...] |
H A D | probe_search.pl | 6 % in compliance with the License. You may obtain a copy of the License 43 binaries associated with a given task start time 85 Biv - a binary variable with an attribute recording which two tasks 115 Task1 = task with start:S1, 116 Task2 = task with [start:S2,duration:D2,resource:R2], 143 The tightest binary is the one with the biggest overlap (from the 186 binary is the one with the greatest score. 204 /* Returns the binary variable with the greatest associated overlap 219 ftb finds, among the binary variables with a non-zero tentative value, 261 List - a list of binaries (with attribut [all...] |
/barrelfish-master/usr/eclipseclp/documents/libman/ |
H A D | extfd.tex | 6 % in compliance with the License. You may obtain a copy of the License 38 Modules that use the library must start with the directive 50 Unification with a term outside of this domain fails. 51 The domain can be associated with the variable using the predicate 54 treat atomic and other ground terms as variables with singleton domains. 71 with integer expressions 92 with standard machine word integers without any overflow checks. 146 with the associated domain {\it Domain}. 217 with all currently imposed constraints. 264 be unified with [all...] |
/barrelfish-master/usr/eclipseclp/Kernel/lib/ |
H A D | dfid.pl | 7 % in compliance with the License. You may obtain a copy of the License 38 * This library file allows to use two search rules with limited depth: 53 * with depth being incremented by Increment. 58 * 2) Depth-first search with limited depth. This is a special case
|
H A D | fd_util.pl | 7 % in compliance with the License. You may obtain a copy of the License 78 dvar_domain_list(_{fd:(fd with domain:D)}, List) :-
|
H A D | idb.pl | 7 % in compliance with the License. You may obtain a copy of the License
|
H A D | sorts.pl | 7 % in compliance with the License. You may obtain a copy of the License
|
H A D | strings.pl | 7 % in compliance with the License. You may obtain a copy of the License
|
H A D | alldiff_strong.pl | 7 % in compliance with the License. You may obtain a copy of the License
|
/barrelfish-master/usr/eclipseclp/documents/megalog/ |
H A D | backwards-sec.tex | 6 % in compliance with the License. You may obtain a copy of the License 36 MegaLog system with a Prolog part independent of \eclipse. This 38 predicates with conflicting syntax or semantics. 62 The errors generated when asserted clauses are overwritten with compiled
|
H A D | database-lst.tex | 6 % in compliance with the License. You may obtain a copy of the License 55 \item[del_tup(?TupleTerm)]{Tuple at a time retrieval with deletion. On backtracking the next tuple is retrieved and deleted.} 57 \item[del_tup(+RelationName, ?Tuple)]{Tuple at a time retrieval with deletion. On backtracking the next tuple is retrieved and deleted.} 59 \item[del_tup(+RelationName, ?Tuple, +Selection)]{Tuple at a time retrieval with deletion. On backtracking the next tuple is retrieved and deleted.}
|
/barrelfish-master/usr/eclipseclp/documents/userman/ |
H A D | gen_error.pl | 6 % in compliance with the License. You may obtain a copy of the License 69 % in compliance with the License. You may obtain a copy of the License
|
H A D | umsopsys.tex | 6 % in compliance with the License. You may obtain a copy of the License 38 predicates and some global flags that are accessed with 141 Other data may be obtained with the predicate 145 Functions which are not linked can be loaded dynamically with the 150 A number of built-in predicates is provided for dealing with files and 218 For these basic operations with files, 225 platforms, with the addition that the disk such as \notation{C:} is 237 the part beginning with the last dot in the string). 238 It also expands symbolic pathnames, starting with \verb:~:, 257 A {\eclipse} process can communicate with othe [all...] |
/barrelfish-master/lib/openssl-1.0.0d/VMS/ |
H A D | openssl_utils.com | 20 $! REQ could conflict with REQUEST.
|
/barrelfish-master/doc/style/ |
H A D | bftn-template.tex | 5 style file and template with much gratitude.
|
/barrelfish-master/usr/eclipseclp/ecrc_solvers/grace/ |
H A D | expr.pl | 6 % in compliance with the License. You may obtain a copy of the License 197 get_attribute(Var, grace with [id:Link]) 199 (get_attribute(Var, grace with [id:Link]) -> 207 add_attribute(Var, grace with [id:Link], grace)
|
/barrelfish-master/usr/eclipseclp/icparc_solvers/ech/ |
H A D | primes.pl | 6 % in compliance with the License. You may obtain a copy of the License
|
H A D | primes1.pl | 6 % in compliance with the License. You may obtain a copy of the License
|
/barrelfish-master/usr/eclipseclp/icparc_solvers/ilog/ |
H A D | fd.pl | 6 % in compliance with the License. You may obtain a copy of the License
|
/barrelfish-master/usr/eclipseclp/documents/tutorial/ |
H A D | solversintro.tex | 6 % in compliance with the License. You may obtain a copy of the License 34 %with examples for the interested reader. 62 The library implements finite domains of integers, together with a basic 68 variables with continuous domains. 78 the solving of problems with continuous variables. 120 They implement the same constraints declaratively, but with 138 cooperates with the {\em ic} library. 187 The user can also specify predicates using rules with guards 221 concerned with satisfiability, i.e.\ with findin [all...] |