/barrelfish-master/usr/eclipseclp/documents/megalog/ |
H A D | database-sec.tex | 6 % in compliance with the License. You may obtain a copy of the License 57 has a one-to-one correspondence with a predicate 61 by extracting single tuples from a relation with {\eclipse}'s `tuple-at-a-time' operations. 74 is comparable with both Prolog compilers (which only access clauses in main memory), 76 with the functionality of both without losing the performance of either. 78 \eclipse provides two versions of its database, one with the deductive 109 A database is created with the predicate {\bf createdb/1}. \index{createdb/1} 125 be created within `/usr/applic/' with the name `bank\_data'. 144 attributes. This information is entered in the database with the 201 The two examples produce relations with th [all...] |
/barrelfish-master/lib/libc/stdio/ |
H A D | xprintf.c | 9 * Redistribution and use in source and binary forms, with or without 16 * documentation and/or other materials provided with the distribution. 141 const char *with; local 145 with = zeroes; 147 with = blanks; 151 ret += __printf_puts(io, with, PADSIZE); 154 ret += __printf_puts(io, with, n);
|
/barrelfish-master/usr/eclipseclp/documents/internal/kernel/ |
H A D | debugger.tex | 6 % in compliance with the License. You may obtain a copy of the License 54 allow arbitrary mixing of code with and without debug instructions, 90 doesn't need to be saved. Failures are traced together with NEXT and 103 with no goal information (just location information like clause or 116 The following deals with: 146 % code compiled with no debug instructions: 218 The pre-filtering can be done with a relatively cheap test: 266 with debug event: 307 %never missing anywhere. Difficulties with hidden predicates for example. 318 Simple tests are often executed with [all...] |
/barrelfish-master/usr/eclipseclp/documents/libman/ |
H A D | eplexdiff.tex | 6 % in compliance with the License. You may obtain a copy of the License 24 eplex, loaded with \verb'lib(eplex)'. The previous \verb'lib(eplex)', which 25 loads eplex with the range bounds keeper and the IC variant have now been 40 are stored with the external solver state. 49 programming, where eplex is being used with another {\eclipse} solver, any 55 The main user visible differences with the non-standalone eplex are: 90 One potential problem is that with the non-standalone eplex, the bound 132 bounds in the solver changes). To allow for more compatibility with the 162 required. The older predicates with the priority argument are still 169 changed. Also, with standalon [all...] |
H A D | mp.tex | 6 % in compliance with the License. You may obtain a copy of the License 84 \item Register the port under a specific name with the name server. 173 presenting the application writer with a unified abstract view of 196 repeatedly be asked to re-solve the problem with minor modifications. 199 copy with its own (physical) communication ports. 200 Otherwise by creating just a new logical port, associated with some 216 the current \eclipse system with a slightly extended library \cite{vass}
|
/barrelfish-master/usr/eclipseclp/documents/tutorial/ |
H A D | colgen.tex | 6 % in compliance with the License. You may obtain a copy of the License 37 $l$ into boards of length $l_{i}$ with coefficients $a_{ij}$ 39 cutting associated with $x_{j}$ and a constraint 230 where we first create a {\tt colgen} instance {\tt cut\_stock}, set up the variable domains of the subproblem and the demand constraints of the master problem, set up the initial master problem bound constraints and subproblem knapsack constraint, then solve and return the variables with non-zero values in the optimal solution. The definition of cutting cost as waste has been combined with the knapsack constraint, while the bounds placed on this cost exclude cuttings with sufficient waste to produce further boards, thus limiting the amount of search in subproblem solution. The chosen method of subproblem solution is: 248 % label vars with non-negative duals to maximum values, 249 % vars with negative duals to minimum 278 to maximize those with non-negative dual value and minimize those with [all...] |
H A D | tutorial.tex | 6 % in compliance with the License. You may obtain a copy of the License 122 and interaction with the system. 132 A methodology for developing large scale applications with \eclipse{} 134 {\em Developing Applications with \eclipse{}} by Simonis. 142 textbook {\em Programming with Constraints} by 292 % <chapt> Getting started with Finite Domains 306 % <sect> Map Colouring with Delayed Disequalities
|
/barrelfish-master/usr/eclipseclp/documents/userman/ |
H A D | umsprofile.tex | 6 % in compliance with the License. You may obtain a copy of the License 57 It can be used any time with any compiled Prolog code, 151 %compiled in {\bf dbgcomp}-mode and it must be run with the debugger 198 %There is a global flag {\tt statistics} (accessed with \bipref{set_flag/2}{../bips/kernel/env/set_flag-2.html}, 215 %with the Unix {\it sort(2)} command, e.g. 219 %will sort with procedures that exited most frequently first. 226 %and hence procedures with many CALLS are crucial to the program's 282 %The current value of the global {\tt statistics}-flag can be queried with 371 %Hence it may well be that running the program with different data 380 %exists and {\bf p/1} is called with [all...] |
H A D | umsexcept.tex | 6 % in compliance with the License. You may obtain a copy of the License 47 \item the handler can interact with the interrupted execution only via 66 % \item the handler cannot interact with interrupted execution, except via 104 <code to deal with Event> 118 An anonymous event is created with the built-in 131 is raised, a copy of the handler goal with fresh variables will be executed). 149 \bipref{event/1}{../bips/kernel/event/event-1.html} with the event 233 This finds and cancels all pending after events with name \about{EventId} and 244 multiple times with multiple calls to \predspec{event_after/2} and 279 The following is an example of waking a goal with [all...] |
H A D | umssyntax.tex | 6 % in compliance with the License. You may obtain a copy of the License 121 Individual tokens can be read with the predicates 190 only the first alternative (with floating point) is valid syntax. 279 ES three octal digits & character with given octal character code & not iso_escapes\\ 280 ES octal digits ES & character with given octal character code & iso_escapes\\ 281 ES \verb'x' hex digits ES & character with given hexadecimal character code &\\ 286 sequence can be of any length and must be terminated with an ES character. 310 ES octal digits ES & character with given octal character code & iso_escapes\\ 311 ES \verb'x' hex digits ES & character with given hexadecimal character code &\\ 323 for compatibility with variou [all...] |
H A D | umserrors.tex | 6 % in compliance with the License. You may obtain a copy of the License 44 We list here the {\eclipse} event types together with the default 184 ('string', code size, compile time) with a string stream 187 (file name, code size, compile time) with a stream associated to a file 223 that associates the variables in \about{Goal} with their names 237 155 & A list associating the variable names with their values after the 345 with an appropriate exit tag, i.e., 419 %then re-calls the culprit goal with the evaluated arguments. 423 %prints error message with relevant line, then fails. 428 %possible with siz [all...] |
/barrelfish-master/lib/openssl-1.0.0d/crypto/objects/ |
H A D | obj_dat.pl | 183 * The implementation was written so as to conform with Netscapes SSL. 189 * included with this distribution is covered by the same copyright terms 197 * in documentation (online or textual) provided with the package. 199 * Redistribution and use in source and binary forms, with or without 206 * documentation and/or other materials provided with the distribution.
|
H A D | objects.pl | 16 { die "$ARGV[1]:$o:There's already an object with NID ",$mynum," on line ",$order{$mynum},"\n"; } 18 { die "$ARGV[1]:$o:There's already an object with name ",$Cname," on line ",$order{$nid{$Cname}},"\n"; } 76 { die "objects.txt:$o:There's already an object with long name ",$ln{$module.$Cname}," on line ",$order{$module.$Cname},"\n"; } 83 { die "objects.txt:$o:There's already an object with short name ",$sn{$module.$Cname}," on line ",$order{$module.$Cname},"\n"; } 92 { die "objects.txt:$o:There's already an object with long name ",$ln{$module.$Cname}," on line ",$order{$module.$Cname},"\n"; } 134 * The implementation was written so as to conform with Netscapes SSL. 140 * included with this distribution is covered by the same copyright terms 148 * in documentation (online or textual) provided with the package. 150 * Redistribution and use in source and binary forms, with or without 157 * documentation and/or other materials provided with th [all...] |
/barrelfish-master/usr/eclipseclp/Contrib/ |
H A D | map.pl | 7 /* A finite map is a function from terms to terms with a finite 77 % file, you have no way of constructing a map with an unbound tail, 94 % of a finite map. The list may not have two elements with the same Key. 166 % unifies Domain with the ordered set representation of the domain 220 % unifies Inverse with the inverse of a finite invertible map. 238 % composes Map1 with the Predicate, so that K-V2 is in Map2 if 254 % unifies Range with the ordered set representation of the range of the 338 % O(lgN). Eventually this package should be merged with ASSOC.PL. 353 % applies the finite map Map to an argument, and unifies Result with 355 % value does not unify with Resul [all...] |
/barrelfish-master/doc/011-idc/ |
H A D | IDC.tex | 69 start with \texttt{//} and continue until the end of the line. 75 must start with a letter or ``\texttt{\_}''. 84 literals have no specifier and hexadecimal literals start with 159 single unidirectional message with typed arguments, 163 messages (a call and the response) with a single declaration, 206 integer literal, defines an array type with the given \emph{arrayname}. This 245 The meta-parameters beginning with the context identifier are optional and may 262 For example, the following defines a message named ``dummy'' with three 279 syntax as for a simple message, but are prefixed with either \texttt{in} or 354 drivers, with implementation [all...] |
/barrelfish-master/usr/eclipseclp/icparc_solvers/ech/ |
H A D | puzzle_bool.pl | 6 % in compliance with the License. You may obtain a copy of the License 36 ?- calc_constr(N,C,L) . % with N instantiated to a positive integer 43 % with N instantiated to a positive integer 60 I am interested in hearing about boolean constraint solvers that can deal with 65 restrict attention to N with only one solution - unless that is unfair to your
|
/barrelfish-master/usr/eclipseclp/documents/embedding/ |
H A D | embed.tex | 6 % in compliance with the License. You may obtain a copy of the License 38 communicate with it. Code examples are given in C++. 45 This section is about the prerequisites for working with 86 A make file "Makefile.external" can be found together with the libraries. 94 When delivering an application you will have to include with it the 130 This will link your application with the shared library \verb+libeclipse.so+. 142 with \verb+ec_init+. 148 %to link statically for some reason, you have to link explicitly with 163 % with {\eclipse} library calls looks similar to this: 167 % The linking of an executable with embedde [all...] |
/barrelfish-master/usr/eclipseclp/icparc_solvers/ |
H A D | ic_probing_for_scheduling.pl | 6 % in compliance with the License. You may obtain a copy of the License 38 % - I'm not sure if this is still true with IC) 87 UserOptions = options with [granularity:1,priority:5] 128 /* For compatibility with initial release */ 130 create_options(List,options with [granularity:G,priority:P]) :- 163 Options = options with granularity:G, 165 bb_options with [delta:G] 194 member(task with duration:D,Tasks), 202 ( foreach(task with duration:D,Tasks), 213 % Introduced because 'cumulative' cannot deal with variabl [all...] |
H A D | probing_for_scheduling.pl | 6 % in compliance with the License. You may obtain a copy of the License 86 UserOptions = options with [granularity:1,priority:5] 127 /* For compatibility with initial release */ 129 create_options(List,options with [granularity:G,priority:P]) :- 162 Options = options with granularity:G, 164 bb_options with [delta:G] 193 member(task with duration:D,Tasks), 202 ( foreach(task with duration:D,Tasks), 213 % Introduced because 'cumulative' cannot deal with variable durations 293 The user interface is similar to the cumulative constraint, with [all...] |
H A D | eplex_relax.pl | 6 % in compliance with the License. You may obtain a copy of the License 26 % Linear relaxations of various constraints for use with eplex. 33 % Modified by K.Shen, IC-Parc, to work with standalone eplex. Based on 67 % the piecewise linear specification which are feasible with respect to the 84 % When all points have been processed, one is left with a list of points 131 HullInfo = hull_info with 145 HullInfo = hull_info with 190 LeftChunk = chunk with points:LeftPoints, 217 RightChunk = chunk with points:RightPoints, 250 Chunk = chunk with [point [all...] |
/barrelfish-master/doc/018-Practical-guide/ |
H A D | helloWorldApp.tex | 5 error handling yet. Refer to \texttt{usr/tests/idctest} for code with proper 49 IDC mechanism to communicate with other applications. For purpose of this 52 server running on core-1. This message will contain a string with contents 182 connects with the service then the connect callback will be called. 250 Following code finds the desired service with given name and binds with 275 call which will connect with the nameserver and query for the given 277 for binding with the service. 280 file and will try and connect with the server on appropriate channel. 283 successfully connects with th [all...] |
/barrelfish-master/usr/eclipseclp/Kernel/lib/ |
H A D | elipsys_fd.pl | 7 % in compliance with the License. You may obtain a copy of the License 82 :- elipsys_fd_init(fd with [], domain of fd, min of fd, max of fd, any of fd). 181 % Missing type checking - The list must be built with integers or 182 % with finite domain variables over integers 217 % Missing type checking - The list must be built with integers or 218 % with finite domain variables over integers 342 Attr = fd with any:Any,
|
H A D | fd_elipsys.pl | 7 % in compliance with the License. You may obtain a copy of the License 62 % These seem broken, and also conflict with the global_gac versions 204 % Missing type checking - The list must be built with integers or 205 % with finite domain variables over integers 240 % Missing type checking - The list must be built with integers or 241 % with finite domain variables over integers 350 Attr = fd with any:Any,
|
/barrelfish-master/doc/008-tracing/ |
H A D | Tracing.tex | 75 or -- with the help of Bfscope -- to a remote machine. On the remote machine 76 you can analyze the trace data using Aquarium 2. Aquarium 2 can be customized with scripts, 79 trace data with external tools in an easy fashion. 87 work with the tracing system (e.g.~tools that have been developed analyzing 100 integrates with the new version of the tracing framework. Bfscope is described 119 with rather small instrumentation of code (i.e.~number of events that actually 161 with the identifier 0, but the same Event identifier 0 has an entirely different 165 that the tracing framework will have sufficient space to deal with future change 207 and to extend existing Subsystems with new Events. Note that the Argument 223 \begin{lstlisting}[frame=single, caption={A small example pleco file with tw [all...] |
/barrelfish-master/doc/000-overview/ |
H A D | Overview.tex | 51 Operating System, together with the most important concepts used 63 these kernels. Kernels share no memory, even on a machine with 110 They run with interrupts disabled on their core, and share no state 111 with other cores. CPU drivers can be thought of as serially executing 145 scheduling of tasks with a variety of hard and soft realtime jobs 146 with good support for best-effort processes as well. 170 user-level code associated with the dispatcher then executes 222 cycles involve \texttt{malloc()} and communication with the memory 229 \item Physical memory management by communication with the memory 250 model~\cite{sel4:iies08}, with [all...] |