iRODS Rule Language Cheat Sheet iRODS Version 4.0.3 Author: Samuel Lampa, BILS

Numeric Literals

Arithmetic functions

1 # integer 1.0 # double

exp() list(, , ...) Logical if: log() ... creates a new list. Example: if then { } else { abs() list("This","is","a","list") } floor() # always returns integer Example: ceiling() # always returns integer elem(, ) if (*A==1) then { true; } else { false; } average(, , ...) ... retrieves elements from a list (0­ max(, , ...) indexed). Ex: Functional if (returning value of any type): min(, , ...) elem(list("This","is","a","list"),0)if then else

Strings Concatenation: 'A \'string\', ' ++ "another \"string\"

Some valid escape characters: \n, \r, \t, \\, \', \", \$, \*

Example:

String functions

setelem(, , )

writeLine("stdout", "Hi!");

... updates an item in a list. Ex:

if true then 1 else 0 if *A==1 then true else false

setelem(list("A","list"),0,"My") ... evaluates to list("My","list").

The following abbreviation are allowed (the red striked part can be abbreviated) in functional ifs:

... equals to "This is a string."

size()

if (...) then { ... } else { ... } if (...) then { ... } else { if (...) then {...} else {...} }

"This is a string." like "This is*" ... equals to true

size(list("This","is","a","list"))

Boolean constants true # True false # False

"This "++"is"++" a string."

! # Not "This is." like regex "Th.*is[.]" && # And ... equals to true || # Or %% # Or used in the "##" syntaxsubstr("This is a string.", 0, 4)

Arithmetic operators - # Negation ^ # Power * # Multiplication / # Division % # Modulors - # Subtraction + # Addition

... Output: This strlen("This is a string.")

... Output: 17 split("This is a string.", " ") ... equals to: [This,is,a,string.] writeLine("stdout", triml("This is a string.", " "));

... equals to: is a string.

Arithmetic comparison > # Greater than < # Less than >= # Greater than or equal <= # Less than or equal

If statements

... returns "This"

... prints out "Hi!."

Boolean comparison

List functions

trimr("This is a string.", " ")

... equals to: This is a

... gives the size of a list. Ex: ... evaluates to 4. hd()

... gives the head of a list, Ex: hd(list("This","is","a","list"))

Multiple abbreviations can be combined for example: if (*X==1) { *A = "Mon"; } else if (*X==2) {*A = "Tue"; } else if (*X==3) {*A = "Wed"; }

... evaluates to "This" tl()

... gives the tail of a list. Ex: tl(list("This","is","a","list"))

... evaluates to list("is","a","list") cons(, )

... adds elements to a list. Ex:

Foreach loops Without iterator: foreach(*C) { writeLine("stdout", *C); }

cons("My",list("list"))

... evaluates to list("My","list").

Tuples Tuples are created like so: ( , ..., )

With the iterator variable (*E in this case): foreach(*E in *C) { writeLine("stdout", *E); }

Numeric Literals Strings Boolean constants Boolean ... - GitHub

iRODS Rule Language Cheat Sheet. iRODS Version 4.0.3. Author: Samuel Lampa, BILS. Numeric Literals. 1 # integer. 1.0 # double. Strings. Concatenation:.

100KB Sizes 1 Downloads 276 Views

Recommend Documents

The Genetic Code Boolean Lattice ABSTRACT
Knight et al (1999). Our partial order, obtained in the codon set as a consequence of a Boolean lattice and defined in the standard genetic code, reflects the relationship between the codon assignment and the .... base is U coding to hydrophobic amin

Approximate Boolean Reasoning: Foundations and ... - CiteSeerX
0 if x > 50. This function can be treated as rough membership function of the notion: “the young man” ... Illustration of inductive concept approximation problem. 2.

Conditions and Boolean Expressions
switch (n). { case 1: printf("You picked a low number.\n"); break; case 2: printf("You picked a medium number.\n"); break; case 3: printf("You picked a high number.\n"); break; default: printf("Invalid.\n"); break;. } } Page 9. Ternary Operator. #inc

Efficient Computation of Regularized Boolean ...
enabled the development of simple and robust algorithms for performing the most usual and ... Some practical applications of the nD-EVM are also commented. .... Definition 2.3: We will call Extreme Vertices of an nD-OPP p to the ending ...

Approximate Boolean Reasoning: Foundations and ...
Accuracy, coverage;. – Lift and ... associate its rows to objects, its columns to attributes and its cells to values of attributes on ..... called the universe or the carrier.

The Quest for Efficient Boolean Satisfiability Solvers
A DPLL-based SAT solver is a relatively small piece of software. Many of the ...... Efficient SAT Solver," presented at 39th Design Automation Conference, 2001.

Representation of Boolean quantum circuits as Reed ...
Science (El-Shatby), Alexandria University, Egypt. e-mail: [email protected] ... of Electronics ISSN 0020–7217 print/ISSN 1362–3060 online © 2004 Taylor & Francis Ltd ..... Los Alamos physics preprint archive, quant-ph/0304099. 444.

Boolean-format biocatalytic processing of enzyme ...
Jul 29, 2010 - and dynamic range associated with biocatalytic processing. In this manner, multiple ..... Later, in 1993–2006, Dr. Katz was a research associate ...

Part IV. SAT (Boolean Formula Satisfiability Problem) - WordPress.com
Department of Computer Science & Engineering ..... Let somebody gives us a certificate that a hamiltonian cycle, A-C-B-D-F-E-A exists in the above graph, it can ...

boolean algebra and its applications pdf
boolean algebra and its applications pdf. boolean algebra and its applications pdf. Open. Extract. Open with. Sign In. Main menu. Displaying boolean algebra ...

A Space-Efficient Indexing Algorithm for Boolean Query Processing
index are 16.4% on DBLP, 26.8% on TREC, and 39.2% on ENRON. We evaluated the query processing time with varying numbers of tokens in a query.

free Colorability and the Boolean Prime Ideal Theorem
Jun 22, 2003 - Queens College, CUNY. Flushing ..... [7] Cowen, R., Some connections between set theory and computer science, in: Gottlob, G.,. Leitsch, A.

Around bent and semi-bent quadratic Boolean functions
May 1, 2005 - Keywords: Boolean function, m-sequence, quadratic mapping, semi- ... tain power functions which are known as almost bent mappings [4].

Around bent and semi-bent quadratic Boolean functions
May 1, 2005 - semi-bent functions of any degree in certain range for any n ≥ 7 is presented ... After this pioneering work a lot of research has been devoted to finding ...... Mathematics and Theoretical Computer Science, Ding, C.; Helleseth,.

prime ideal theorem for double boolean algebras
A filter (resp. an ideal) of a ... For Boolean algebras, it is well known that prime filters can be defined as filters F .... Boolean algebra is called pure if it satisfies.

Neutrality and the Evolvability of Boolean Function ...
In particular, we introduce the use of explicit neutral- ity with an integer ... grams through functional redundancy and introns (see Section 2). There have .... To obtain statistically meaningful results, we made 100 runs on differ- ..... genotypes

Self-organized Boolean game on networks - Semantic Scholar
Tao Zhou,1,2 Bing-Hong Wang,1,* Pei-Ling Zhou,2 Chun-Xia Yang,2 and Jun Liu2. 1Department of Modern Physics, University of Science and Technology of China, ... years. It is not unexpected that the systems with globally shared information can be ... d

The corresponding boolean expressions are given here ...
The corresponding boolean expressions are given here to construct a carry lookahead adder. In the carry-lookahead circuit we ned to generate the two signals carry propagator(P) and carry generator(G),. Pi = Ai ⊕ Bi. Gi = Ai · Bi. The output sum an

Alphabets, Strings, and Languages - GitHub
If Σ = {a, b}, then. Σ = {ε, a, b, aa, ab, ba, bb, aaa, aab, aba, . . .} . ..... We shall now take this concept and develop it more carefully by first defining ... Moreover, only strings that can be constructed by the applications of these rules a

Download PDF Bebop to the Boolean Boogie, Third ...
Guide to Electronics Download Best Ebook. Download Bebop to the ... together into powerful and sophisticated electronic systems. In addition to the technical ...