Searched refs:explain (Results 1 - 10 of 10) sorted by relevance

/barrelfish-master/lib/libc/regex/
H A Dregerror.c87 char *explain; member in struct:rerr
141 s = r->explain;
/barrelfish-master/usr/eclipseclp/icparc_solvers/rxspencer/
H A Dregerror.c36 char *explain; member in struct:rerr
91 s = r->explain;
/barrelfish-master/doc/023-coreboot/
H A Dcoreboot.tex63 architectures. We first explain the terminology used throughout this document.
64 Then, we will give an overview of supported operations and finally, explain in
352 \todo{explain ARMv7 specific boot arguements / protocols}
361 \todo{explain ARMv8 specific boot arguements / protocols}
/barrelfish-master/doc/021-cpudriver/
H A Dcpudriver.tex92 TODO: Should explain things such as naming, where goes architecture dependent, platform specific code?
/barrelfish-master/doc/019-device-drivers/
H A DDeviceDriver.tex180 really) and explain what it means for the driver program. \varname{cFiles} is
191 know what Mackerel is, let me explain it to you: Mackerel is a DSL for
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dumsexcept.tex484 %the user at the terminal, to explain the nature of the error and ask for
/barrelfish-master/usr/eclipseclp/documents/libman/
H A Dextchr.tex229 rules and explain how they work. The next section
/barrelfish-master/doc/026-device-queues/
H A Ddevif.tex100 In this section, we explain the terms and the meaning of them as they are used in the following sections.
/barrelfish-master/usr/eclipseclp/documents/embedding/
H A Dembjava.tex307 now explain.
650 We now explain the standard sequence of events for using
/barrelfish-master/lib/tommath/
H A Dtommath.tex90 They ask why I did it and especially why I continue to work on them for free. The best I can explain it is ``Because I can.''
98 explain the algorithms properly. Hence this book. The book literally starts with the foundation of the library and works
254 That is to not only explain a limited subset of the core theory behind the algorithms but also the various ``house keeping''
2845 simple to explain. The $2n + 1$'th coefficient of $W(x)$ is numerically equivalent to the most significant column in an integer multiplication.
3877 to explain this is that $n$ is (\textit{or multiples of $n$ are}) congruent to zero modulo $n$. Adding zero will not change the value of the residue.
6080 Knuth \cite[pp. 338]{TAOCPV2} but has been modified to be simpler to explain. In theory it achieves the same asymptotic working time as
6162 To explain the Jacobi Symbol we shall first discuss the Legendre function\footnote{Arrg. What is the name of this?} off which the Jacobi symbol is

Completed in 95 milliseconds