out
+0,0,1
+0,1,0
+1,0,0
+1,1,1
+#&
+
+If you save this file as something.csv (.csv means it consists of
+comma-separated values) and run `electruth something.csv', you should get an
+output like this:
+
+#&pre
+out = or(and(not(A), not(B)), and(A, B))
+#&
+
+This makes sense, considering that the output variable `out' is only true (a
+"1" in the truth table) when `out' is either not A and not B or A and B.
+
+So, that's how you make a truth table understandable by electruth. I want to
+stress that electruth's output can almost always be shortened. In the example
+above, we can see that `out' is false ("0") when A or B is true -- it is false
+only when A is false and B is true, and when A is true and B is false. This
+construct can be shortened to fit the XOR operator, and we can say that `out'
+is false when out = A XOR B. This means that `out' is true when out = NOT (A
+XOR B) (in the internals of electruth, this would be written as "out =
+not(xor(A, B))"). This is much shorter than "out = or(and(not(A), not(B)),
+and(A, B))". To test if the two expressions really match, electruth can be used
+(and this is really electruth's best part) by running this:
+
+#&pre
+electruth truthtable.csv 'out=not A xor B'
+#&
+
+which should return this:
+
+#&pre
+out_0 = or(and(not(A), not(B)), and(A, B))
+out_1 = or(and(not(A), not(B)), and(A, B))
+ '- out_0 matches out_1? True
+#&
+
+which just confirms that it is true.
+
+
+I created electruth to help me design electronic digital circuits. I don't know
+what you use it for, but if you stumbled upon it because of that, I can
+recommend you take a look at the programs called Ktechlab and Qucs. They can be
+used for boolean logic as well.
diff --git a/site/projects/enigma.org b/site/projects/enigma.org
deleted file mode 100644
index e69de29..0000000
diff --git a/site/projects/enigma/art/enigma-logo-small.png b/site/projects/enigma/art/enigma-logo-small.png
new file mode 100644
index 0000000..7985af1
Binary files /dev/null and b/site/projects/enigma/art/enigma-logo-small.png differ
diff --git a/site/projects/enigma/art/enigma-logo-verysmall.png b/site/projects/enigma/art/enigma-logo-verysmall.png
new file mode 100644
index 0000000..50f0b4d
Binary files /dev/null and b/site/projects/enigma/art/enigma-logo-verysmall.png differ
diff --git a/site/projects/enigma/art/enigma-logo.png b/site/projects/enigma/art/enigma-logo.png
new file mode 100644
index 0000000..5466bff
Binary files /dev/null and b/site/projects/enigma/art/enigma-logo.png differ
diff --git a/site/projects/enigma/art/enigma-logo.svg b/site/projects/enigma/art/enigma-logo.svg
new file mode 100644
index 0000000..5afd50c
--- /dev/null
+++ b/site/projects/enigma/art/enigma-logo.svg
@@ -0,0 +1,86 @@
+
+
+
+
+
+
+
+
+
+
+ image/svg+xml
+
+
+
+
+
+
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Booleans.html b/site/projects/enigma/doc/enigma-0.1-html/Booleans.html
new file mode 100644
index 0000000..3b271f4
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Booleans.html
@@ -0,0 +1,57 @@
+
+
+Booleans - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+2.5 Booleans
+
+ Booleans are used a lot in Enigma. The predefined variables true
+and false
can be used.
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Built_002dIn-functions.html b/site/projects/enigma/doc/enigma-0.1-html/Built_002dIn-functions.html
new file mode 100644
index 0000000..15dd9bc
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Built_002dIn-functions.html
@@ -0,0 +1,179 @@
+
+
+Built-In functions - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+6.2 Functions
+
+ Enigma has few built-in functions. But they do exist.
+
+
str(OBJECT...)
: Converts all supplied values to strings.
+
+
num(OBJECT...)
: Converts all supplied values to numbers.
+
+
list(OBJECT...)
: Puts all supplied values in a list and destroys
+nested lists at one level.
+
+
bool(OBJECT...)
: Converts all supplied values to booleans.
+
+
code(OBJECT...)
: Converts all supplied values to code strings.
+
+
repr(OBJECT...)
: Converts all supplied values to representational
+strings. Strings get prepended and appended by " characters, code
+objects are surrounded by { and }, and so on.
+
+
type(OBJECT...)
: Converts all supplied values to type strings
+(string, number, file, etc.).
+
+
len(OBJECT...)
: Converts all supplied values to their length. This
+can be used for both strings and lists.
+
+
clone(OBJECT...)
: Clones all supplied values. When an object is
+cloned, its value is assigned to a new variable. The list of clones is
+returned.
+
+
slice(LIST|STRING, NUMBER, NUMBER)
: Returns a list value sliced
+according to the first and second number if the first variable is a
+list variable, or a substring if the first variable is a string
+variable.
+
+
loop(FUNCTION, [OBJECT]...)
: Executes function until it returns
+false. Sends the rest of the specified variables (if any) to the
+function as arguments.
+
+
open(STRING, STRING)
: Opens the file by the name of the first
+string, using the second string as its guide as to how it should be
+opened. "r" means to read, "w" means to write, and "a" means to
+append. Returns a file object.
+
+
close(FILE...)
: Closes files.
+
+
read(FILE)
: Reads one character of a file and returns it. If no
+more characters are present, an empty string is returned.
+
+
write(FILE, STRING)
: Writes a string to a file.
+
+
greater(NUMBER, NUMBER...
: Checks if the first number is
+greater than the rest and returns true or false.
+
+
lesser(NUMBER, NUMBER...
: Checks if the first number is
+lesser than the rest and returns true or false.
+
+
equal(OBJECT, OBJECT...
: Checks if the objects are equal and returns
+true or false.
+
+
and(BOOLEAN...)
: Checks if all booleans are true and returns true
+or false.
+
+
or(BOOLEAN...)
: Checks if at least one boolean is true and returns
+true or false.
+
+
not(BOOLEAN...)
: Converts values of true to values of false, and
+vice-versa.
+
+
act(BOOLEAN, FUNCTION, [OBJECT]...)
: Run the function with the
+optional objects as arguments if the boolean is true.
+
+
system(STRING...)
: Join the strings and run the result as a
+system command.
+
+
add(NUMBER|STRING|CODE|LIST...)
: Add objects together. Numbers, strings, code
+strings and lists can be used, but only with similar types. The type
+of the first object determines what types the rest must be. The result
+is stored in the first object and also returned.
+
+
subtract(NUMBER...)
: Subtract numbers from each other. The
+first object receives the final number. It is also returned.
+
+
multiply(NUMBER...)
: Multiply numbers with each other. The
+first object receives the final number. It is also returned.
+
+
divide(NUMBER...)
: Divide numbers with each other. The
+first object receives the final number. It is also returned.
+
+
mod(NUMBER, NUMBER)
: Finds the remainder of the first number
+divided with the second number and returns it as a new variable.
+
+
pow(NUMBER, NUMBER)
: Returns first number^second number.
+
+
log(NUMBER, [NUMBER])
: Returns the logarithm of the first
+number. If the second number is not specified, the natural logarith is
+used.
+
+
random()
: Returns a random number between 0 and 1.
+
+
abs(NUMBER...)
: Sets and returns absolute values of numbers.
+
+
round(NUMBER, NUMBER)
: Rounds the first number with x decimals,
+where x is the second number.
+
+
floor(NUMBER, NUMBER)
: Floors the first number with x decimals,
+where x is the second number.
+
+
ceil(NUMBER, NUMBER)
: "Ceils" the first number with x decimals,
+where x is the second number.
+
+
sin(NUMBER...)
: Sets and returns sine values.
+
+
cos(NUMBER...)
: Sets and returns cosine values.
+
+
tan(NUMBER...)
: Sets and returns tangent values.
+
+
asin(NUMBER...)
: Sets and returns arcsine values.
+
+
acos(NUMBER...)
: Sets and returns arccosine values.
+
+
atan(NUMBER...)
: Sets and returns arctangent values.
+
+
sinh(NUMBER...)
: Sets and returns hyperbolic sine values.
+
+
cosh(NUMBER...)
: Sets and returns hyperbolic cosine values.
+
+
tanh(NUMBER...)
: Sets and returns hyperbolic tangent values.
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Built_002dIn-values.html b/site/projects/enigma/doc/enigma-0.1-html/Built_002dIn-values.html
new file mode 100644
index 0000000..23996e4
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Built_002dIn-values.html
@@ -0,0 +1,68 @@
+
+
+Built-In values - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+6.1 Values
+
+ The following variables are special and can be accessed anytime. They can
+even be overwritten.
+
args, return, temp, stdin, stderr, stdout, zero, true, false, none, @pi,
+@e, cwd, cpd, fnm
+
+zero
is a fake writable file that does nothing. none
is an
+abstract variable with an internal value of.. none. @pi
is
+Pi. @e
is Euler's number. cwd
is the directory from which
+Enigma is run, cpd
is the directory in which the current program
+file resides, and fnm
is the filename of the current program
+file. The rest are self-explanatory — and args
, return
+and temp
are extra special.
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Built_002dIn.html b/site/projects/enigma/doc/enigma-0.1-html/Built_002dIn.html
new file mode 100644
index 0000000..ebb0a53
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Built_002dIn.html
@@ -0,0 +1,59 @@
+
+
+Built-In - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+6 Built-in values and functions
+
+
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Compared-assigning.html b/site/projects/enigma/doc/enigma-0.1-html/Compared-assigning.html
new file mode 100644
index 0000000..8e43ac0
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Compared-assigning.html
@@ -0,0 +1,75 @@
+
+
+Compared assigning - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+5.1 Assigning values
+
+
+C:
+
+
+
+Python:
+
+
+
+Enigma:
+
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Compared-conditionals.html b/site/projects/enigma/doc/enigma-0.1-html/Compared-conditionals.html
new file mode 100644
index 0000000..88d4745
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Compared-conditionals.html
@@ -0,0 +1,83 @@
+
+
+Compared conditionals - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+5.2 Conditionals
+
+
+C:
+ if ((a == 2 && b < 5) || (c != 4 && !d)) do_something();
+
+
+
+
+
+Python:
+ if (a == 2 and b < 5) or (c != 4 and not d):
+ do_something()
+
+
+
+
+
+Enigma:
+ a 2 ! equal = cond-a;
+ b 5 ! lesser = cond-b;
+ c 4 ! equal ! not = cond-c;
+ d ! not = cond-d;
+ cond-a cond-b ! and = ncond-ab;
+ cond-c cond-d ! and = ncond-cd;
+ ncond-ab ncond-cd ! or = actcond;
+ actcond do-something ! act;
+
+
+
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Compared-functions.html b/site/projects/enigma/doc/enigma-0.1-html/Compared-functions.html
new file mode 100644
index 0000000..fb7d033
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Compared-functions.html
@@ -0,0 +1,80 @@
+
+
+Compared functions - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+5.4 Functions
+
+
+C:
+int time(float space) {
+ return (int) space / 3;
+}
+
+t = time(81.65);
+
+
+
+
+Python:
+ def time(space):
+ return int(space / 3)
+
+ t = time(81.65)
+
+
+
+
+Enigma:
+{/space/space 3 ! divide ! clone ! round = return;} = time;
+
+81.65 ! time = t;
+
+
+
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Compared-looping.html b/site/projects/enigma/doc/enigma-0.1-html/Compared-looping.html
new file mode 100644
index 0000000..7350efb
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Compared-looping.html
@@ -0,0 +1,80 @@
+
+
+Compared looping - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+5.3 Looping
+
+
+C:
+ while (thinking) run();
+
+ for (int i = 0; i < 18; i++) run(i);
+
+
+
+
+Python:
+ while thinking: run()
+
+ for i in range(18): run(i)
+
+
+
+
+Enigma:
+{!run; thinking ! clone = return;} ! loop;
+
+0 = i;
+{i ! run; i 1 ! add; i 18 ! equal = return;} ! loop;
+
+
+
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Comparison.html b/site/projects/enigma/doc/enigma-0.1-html/Comparison.html
new file mode 100644
index 0000000..ecf0578
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Comparison.html
@@ -0,0 +1,60 @@
+
+
+Comparison - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+5 Comparison with other languages
+
+
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Conditionals.html b/site/projects/enigma/doc/enigma-0.1-html/Conditionals.html
new file mode 100644
index 0000000..831684d
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Conditionals.html
@@ -0,0 +1,83 @@
+
+
+Conditionals - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+2.8 Conditionals
+
+Any value can be related to another value. 78 is less than 85. 2 equals
+2. "Hi" is not "Bye". Enigma comes with a basic set of functions that
+can be used to test these relations. The functions greater
,
+lesser
, equal
, not
, or
and and
are
+available. These functions return either true or false. To run a
+function on the condition that a relational function has returned true,
+use the function act
.
+
+
While lesser
and greater
are aimed at numbers only,
+and and
, or
and not
are aimed at booleans only,
+equal
can be used on all objects. It tests for all equalities.
+
+
2 = a;
+4 = b;
+
+a 2 ! add | temp b ! equal = cond1;
+"47" ! num | temp 48 ! greater = cond2;
+
+cond1 cond2 ! and | temp write stdout "4 = 4 and 47 > 48\n" ! act;
+cond1 cond2 ! or | temp write stdout "4 = 4 or 47 > 48\n" ! act;
+cond2 ! not | cond1 temp ! and | temp write stdout "4 = 4 and !(47 >
+48)\n" ! act;
+
+
+ Even simpler, one can do this (though there's no real need for it):
+
# Instead of stdout "Hello" !write;
+true write stdout "Hello" !act;
+
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Copying-This-Manual.html b/site/projects/enigma/doc/enigma-0.1-html/Copying-This-Manual.html
new file mode 100644
index 0000000..2db842b
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Copying-This-Manual.html
@@ -0,0 +1,519 @@
+
+
+Copying This Manual - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Appendix A GNU Free Documentation License
+
+
+Version 1.3, 3 November 2008
+
+
+
+ Copyright © 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
+ http://fsf.org/
+
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+
+PREAMBLE
+
+ The purpose of this License is to make a manual, textbook, or other
+functional and useful document free in the sense of freedom: to
+assure everyone the effective freedom to copy and redistribute it,
+with or without modifying it, either commercially or noncommercially.
+Secondarily, this License preserves for the author and publisher a way
+to get credit for their work, while not being considered responsible
+for modifications made by others.
+
+
This License is a kind of “copyleft”, which means that derivative
+works of the document must themselves be free in the same sense. It
+complements the GNU General Public License, which is a copyleft
+license designed for free software.
+
+
We have designed this License in order to use it for manuals for free
+software, because free software needs free documentation: a free
+program should come with manuals providing the same freedoms that the
+software does. But this License is not limited to software manuals;
+it can be used for any textual work, regardless of subject matter or
+whether it is published as a printed book. We recommend this License
+principally for works whose purpose is instruction or reference.
+
+
APPLICABILITY AND DEFINITIONS
+
+ This License applies to any manual or other work, in any medium, that
+contains a notice placed by the copyright holder saying it can be
+distributed under the terms of this License. Such a notice grants a
+world-wide, royalty-free license, unlimited in duration, to use that
+work under the conditions stated herein. The “Document”, below,
+refers to any such manual or work. Any member of the public is a
+licensee, and is addressed as “you”. You accept the license if you
+copy, modify or distribute the work in a way requiring permission
+under copyright law.
+
+
A “Modified Version” of the Document means any work containing the
+Document or a portion of it, either copied verbatim, or with
+modifications and/or translated into another language.
+
+
A “Secondary Section” is a named appendix or a front-matter section
+of the Document that deals exclusively with the relationship of the
+publishers or authors of the Document to the Document's overall
+subject (or to related matters) and contains nothing that could fall
+directly within that overall subject. (Thus, if the Document is in
+part a textbook of mathematics, a Secondary Section may not explain
+any mathematics.) The relationship could be a matter of historical
+connection with the subject or with related matters, or of legal,
+commercial, philosophical, ethical or political position regarding
+them.
+
+
The “Invariant Sections” are certain Secondary Sections whose titles
+are designated, as being those of Invariant Sections, in the notice
+that says that the Document is released under this License. If a
+section does not fit the above definition of Secondary then it is not
+allowed to be designated as Invariant. The Document may contain zero
+Invariant Sections. If the Document does not identify any Invariant
+Sections then there are none.
+
+
The “Cover Texts” are certain short passages of text that are listed,
+as Front-Cover Texts or Back-Cover Texts, in the notice that says that
+the Document is released under this License. A Front-Cover Text may
+be at most 5 words, and a Back-Cover Text may be at most 25 words.
+
+
A “Transparent” copy of the Document means a machine-readable copy,
+represented in a format whose specification is available to the
+general public, that is suitable for revising the document
+straightforwardly with generic text editors or (for images composed of
+pixels) generic paint programs or (for drawings) some widely available
+drawing editor, and that is suitable for input to text formatters or
+for automatic translation to a variety of formats suitable for input
+to text formatters. A copy made in an otherwise Transparent file
+format whose markup, or absence of markup, has been arranged to thwart
+or discourage subsequent modification by readers is not Transparent.
+An image format is not Transparent if used for any substantial amount
+of text. A copy that is not “Transparent” is called “Opaque”.
+
+
Examples of suitable formats for Transparent copies include plain
+ascii without markup, Texinfo input format, LaTeX input
+format, SGML or XML using a publicly available
+DTD , and standard-conforming simple HTML ,
+PostScript or PDF designed for human modification. Examples
+of transparent image formats include PNG , XCF and
+JPG . Opaque formats include proprietary formats that can be
+read and edited only by proprietary word processors, SGML or
+XML for which the DTD and/or processing tools are
+not generally available, and the machine-generated HTML ,
+PostScript or PDF produced by some word processors for
+output purposes only.
+
+
The “Title Page” means, for a printed book, the title page itself,
+plus such following pages as are needed to hold, legibly, the material
+this License requires to appear in the title page. For works in
+formats which do not have any title page as such, “Title Page” means
+the text near the most prominent appearance of the work's title,
+preceding the beginning of the body of the text.
+
+
The “publisher” means any person or entity that distributes copies
+of the Document to the public.
+
+
A section “Entitled XYZ” means a named subunit of the Document whose
+title either is precisely XYZ or contains XYZ in parentheses following
+text that translates XYZ in another language. (Here XYZ stands for a
+specific section name mentioned below, such as “Acknowledgements”,
+“Dedications”, “Endorsements”, or “History”.) To “Preserve the Title”
+of such a section when you modify the Document means that it remains a
+section “Entitled XYZ” according to this definition.
+
+
The Document may include Warranty Disclaimers next to the notice which
+states that this License applies to the Document. These Warranty
+Disclaimers are considered to be included by reference in this
+License, but only as regards disclaiming warranties: any other
+implication that these Warranty Disclaimers may have is void and has
+no effect on the meaning of this License.
+
+
VERBATIM COPYING
+
+ You may copy and distribute the Document in any medium, either
+commercially or noncommercially, provided that this License, the
+copyright notices, and the license notice saying this License applies
+to the Document are reproduced in all copies, and that you add no other
+conditions whatsoever to those of this License. You may not use
+technical measures to obstruct or control the reading or further
+copying of the copies you make or distribute. However, you may accept
+compensation in exchange for copies. If you distribute a large enough
+number of copies you must also follow the conditions in section 3.
+
+
You may also lend copies, under the same conditions stated above, and
+you may publicly display copies.
+
+
COPYING IN QUANTITY
+
+ If you publish printed copies (or copies in media that commonly have
+printed covers) of the Document, numbering more than 100, and the
+Document's license notice requires Cover Texts, you must enclose the
+copies in covers that carry, clearly and legibly, all these Cover
+Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
+the back cover. Both covers must also clearly and legibly identify
+you as the publisher of these copies. The front cover must present
+the full title with all words of the title equally prominent and
+visible. You may add other material on the covers in addition.
+Copying with changes limited to the covers, as long as they preserve
+the title of the Document and satisfy these conditions, can be treated
+as verbatim copying in other respects.
+
+
If the required texts for either cover are too voluminous to fit
+legibly, you should put the first ones listed (as many as fit
+reasonably) on the actual cover, and continue the rest onto adjacent
+pages.
+
+
If you publish or distribute Opaque copies of the Document numbering
+more than 100, you must either include a machine-readable Transparent
+copy along with each Opaque copy, or state in or with each Opaque copy
+a computer-network location from which the general network-using
+public has access to download using public-standard network protocols
+a complete Transparent copy of the Document, free of added material.
+If you use the latter option, you must take reasonably prudent steps,
+when you begin distribution of Opaque copies in quantity, to ensure
+that this Transparent copy will remain thus accessible at the stated
+location until at least one year after the last time you distribute an
+Opaque copy (directly or through your agents or retailers) of that
+edition to the public.
+
+
It is requested, but not required, that you contact the authors of the
+Document well before redistributing any large number of copies, to give
+them a chance to provide you with an updated version of the Document.
+
+
MODIFICATIONS
+
+ You may copy and distribute a Modified Version of the Document under
+the conditions of sections 2 and 3 above, provided that you release
+the Modified Version under precisely this License, with the Modified
+Version filling the role of the Document, thus licensing distribution
+and modification of the Modified Version to whoever possesses a copy
+of it. In addition, you must do these things in the Modified Version:
+
+
+Use in the Title Page (and on the covers, if any) a title distinct
+from that of the Document, and from those of previous versions
+(which should, if there were any, be listed in the History section
+of the Document). You may use the same title as a previous version
+if the original publisher of that version gives permission.
+
+ List on the Title Page, as authors, one or more persons or entities
+responsible for authorship of the modifications in the Modified
+Version, together with at least five of the principal authors of the
+Document (all of its principal authors, if it has fewer than five),
+unless they release you from this requirement.
+
+ State on the Title page the name of the publisher of the
+Modified Version, as the publisher.
+
+ Preserve all the copyright notices of the Document.
+
+ Add an appropriate copyright notice for your modifications
+adjacent to the other copyright notices.
+
+ Include, immediately after the copyright notices, a license notice
+giving the public permission to use the Modified Version under the
+terms of this License, in the form shown in the Addendum below.
+
+ Preserve in that license notice the full lists of Invariant Sections
+and required Cover Texts given in the Document's license notice.
+
+ Include an unaltered copy of this License.
+
+ Preserve the section Entitled “History”, Preserve its Title, and add
+to it an item stating at least the title, year, new authors, and
+publisher of the Modified Version as given on the Title Page. If
+there is no section Entitled “History” in the Document, create one
+stating the title, year, authors, and publisher of the Document as
+given on its Title Page, then add an item describing the Modified
+Version as stated in the previous sentence.
+
+ Preserve the network location, if any, given in the Document for
+public access to a Transparent copy of the Document, and likewise
+the network locations given in the Document for previous versions
+it was based on. These may be placed in the “History” section.
+You may omit a network location for a work that was published at
+least four years before the Document itself, or if the original
+publisher of the version it refers to gives permission.
+
+ For any section Entitled “Acknowledgements” or “Dedications”, Preserve
+the Title of the section, and preserve in the section all the
+substance and tone of each of the contributor acknowledgements and/or
+dedications given therein.
+
+ Preserve all the Invariant Sections of the Document,
+unaltered in their text and in their titles. Section numbers
+or the equivalent are not considered part of the section titles.
+
+ Delete any section Entitled “Endorsements”. Such a section
+may not be included in the Modified Version.
+
+ Do not retitle any existing section to be Entitled “Endorsements” or
+to conflict in title with any Invariant Section.
+
+ Preserve any Warranty Disclaimers.
+
+
+ If the Modified Version includes new front-matter sections or
+appendices that qualify as Secondary Sections and contain no material
+copied from the Document, you may at your option designate some or all
+of these sections as invariant. To do this, add their titles to the
+list of Invariant Sections in the Modified Version's license notice.
+These titles must be distinct from any other section titles.
+
+
You may add a section Entitled “Endorsements”, provided it contains
+nothing but endorsements of your Modified Version by various
+parties—for example, statements of peer review or that the text has
+been approved by an organization as the authoritative definition of a
+standard.
+
+
You may add a passage of up to five words as a Front-Cover Text, and a
+passage of up to 25 words as a Back-Cover Text, to the end of the list
+of Cover Texts in the Modified Version. Only one passage of
+Front-Cover Text and one of Back-Cover Text may be added by (or
+through arrangements made by) any one entity. If the Document already
+includes a cover text for the same cover, previously added by you or
+by arrangement made by the same entity you are acting on behalf of,
+you may not add another; but you may replace the old one, on explicit
+permission from the previous publisher that added the old one.
+
+
The author(s) and publisher(s) of the Document do not by this License
+give permission to use their names for publicity for or to assert or
+imply endorsement of any Modified Version.
+
+
COMBINING DOCUMENTS
+
+ You may combine the Document with other documents released under this
+License, under the terms defined in section 4 above for modified
+versions, provided that you include in the combination all of the
+Invariant Sections of all of the original documents, unmodified, and
+list them all as Invariant Sections of your combined work in its
+license notice, and that you preserve all their Warranty Disclaimers.
+
+
The combined work need only contain one copy of this License, and
+multiple identical Invariant Sections may be replaced with a single
+copy. If there are multiple Invariant Sections with the same name but
+different contents, make the title of each such section unique by
+adding at the end of it, in parentheses, the name of the original
+author or publisher of that section if known, or else a unique number.
+Make the same adjustment to the section titles in the list of
+Invariant Sections in the license notice of the combined work.
+
+
In the combination, you must combine any sections Entitled “History”
+in the various original documents, forming one section Entitled
+“History”; likewise combine any sections Entitled “Acknowledgements”,
+and any sections Entitled “Dedications”. You must delete all
+sections Entitled “Endorsements.”
+
+
COLLECTIONS OF DOCUMENTS
+
+ You may make a collection consisting of the Document and other documents
+released under this License, and replace the individual copies of this
+License in the various documents with a single copy that is included in
+the collection, provided that you follow the rules of this License for
+verbatim copying of each of the documents in all other respects.
+
+
You may extract a single document from such a collection, and distribute
+it individually under this License, provided you insert a copy of this
+License into the extracted document, and follow this License in all
+other respects regarding verbatim copying of that document.
+
+
AGGREGATION WITH INDEPENDENT WORKS
+
+ A compilation of the Document or its derivatives with other separate
+and independent documents or works, in or on a volume of a storage or
+distribution medium, is called an “aggregate” if the copyright
+resulting from the compilation is not used to limit the legal rights
+of the compilation's users beyond what the individual works permit.
+When the Document is included in an aggregate, this License does not
+apply to the other works in the aggregate which are not themselves
+derivative works of the Document.
+
+
If the Cover Text requirement of section 3 is applicable to these
+copies of the Document, then if the Document is less than one half of
+the entire aggregate, the Document's Cover Texts may be placed on
+covers that bracket the Document within the aggregate, or the
+electronic equivalent of covers if the Document is in electronic form.
+Otherwise they must appear on printed covers that bracket the whole
+aggregate.
+
+
TRANSLATION
+
+ Translation is considered a kind of modification, so you may
+distribute translations of the Document under the terms of section 4.
+Replacing Invariant Sections with translations requires special
+permission from their copyright holders, but you may include
+translations of some or all Invariant Sections in addition to the
+original versions of these Invariant Sections. You may include a
+translation of this License, and all the license notices in the
+Document, and any Warranty Disclaimers, provided that you also include
+the original English version of this License and the original versions
+of those notices and disclaimers. In case of a disagreement between
+the translation and the original version of this License or a notice
+or disclaimer, the original version will prevail.
+
+
If a section in the Document is Entitled “Acknowledgements”,
+“Dedications”, or “History”, the requirement (section 4) to Preserve
+its Title (section 1) will typically require changing the actual
+title.
+
+
TERMINATION
+
+ You may not copy, modify, sublicense, or distribute the Document
+except as expressly provided under this License. Any attempt
+otherwise to copy, modify, sublicense, or distribute it is void, and
+will automatically terminate your rights under this License.
+
+
However, if you cease all violation of this License, then your license
+from a particular copyright holder is reinstated (a) provisionally,
+unless and until the copyright holder explicitly and finally
+terminates your license, and (b) permanently, if the copyright holder
+fails to notify you of the violation by some reasonable means prior to
+60 days after the cessation.
+
+
Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+
Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License. If your rights have been terminated and not permanently
+reinstated, receipt of a copy of some or all of the same material does
+not give you any rights to use it.
+
+
FUTURE REVISIONS OF THIS LICENSE
+
+ The Free Software Foundation may publish new, revised versions
+of the GNU Free Documentation License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns. See
+http://www.gnu.org/copyleft/ .
+
+
Each version of the License is given a distinguishing version number.
+If the Document specifies that a particular numbered version of this
+License “or any later version” applies to it, you have the option of
+following the terms and conditions either of that specified version or
+of any later version that has been published (not as a draft) by the
+Free Software Foundation. If the Document does not specify a version
+number of this License, you may choose any version ever published (not
+as a draft) by the Free Software Foundation. If the Document
+specifies that a proxy can decide which future versions of this
+License can be used, that proxy's public statement of acceptance of a
+version permanently authorizes you to choose that version for the
+Document.
+
+
RELICENSING
+
+ “Massive Multiauthor Collaboration Site” (or “MMC Site”) means any
+World Wide Web server that publishes copyrightable works and also
+provides prominent facilities for anybody to edit those works. A
+public wiki that anybody can edit is an example of such a server. A
+“Massive Multiauthor Collaboration” (or “MMC”) contained in the
+site means any set of copyrightable works thus published on the MMC
+site.
+
+
“CC-BY-SA” means the Creative Commons Attribution-Share Alike 3.0
+license published by Creative Commons Corporation, a not-for-profit
+corporation with a principal place of business in San Francisco,
+California, as well as future copyleft versions of that license
+published by that same organization.
+
+
“Incorporate” means to publish or republish a Document, in whole or
+in part, as part of another Document.
+
+
An MMC is “eligible for relicensing” if it is licensed under this
+License, and if all works that were first published under this License
+somewhere other than this MMC, and subsequently incorporated in whole
+or in part into the MMC, (1) had no cover texts or invariant sections,
+and (2) were thus incorporated prior to November 1, 2008.
+
+
The operator of an MMC Site may republish an MMC contained in the site
+under CC-BY-SA on the same site at any time before August 1, 2009,
+provided the MMC is eligible for relicensing.
+
+
+
+ADDENDUM: How to use this License for your documents
+
+To use this License in a document you have written, include a copy of
+the License in the document and put the following copyright and
+license notices just after the title page:
+
+
Copyright (C) year your name .
+ Permission is granted to copy, distribute and/or modify this document
+ under the terms of the GNU Free Documentation License, Version 1.3
+ or any later version published by the Free Software Foundation;
+ with no Invariant Sections, no Front-Cover Texts, and no Back-Cover
+ Texts. A copy of the license is included in the section entitled ``GNU
+ Free Documentation License''.
+
+ If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts,
+replace the “with... Texts.” line with this:
+
+
with the Invariant Sections being list their titles , with
+ the Front-Cover Texts being list , and with the Back-Cover Texts
+ being list .
+
+ If you have Invariant Sections without Cover Texts, or some other
+combination of the three, merge those two alternatives to suit the
+situation.
+
+
If your document contains nontrivial examples of program code, we
+recommend releasing these examples in parallel under your choice of
+free software license, such as the GNU General Public License,
+to permit their use in free software.
+
+
+
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Files.html b/site/projects/enigma/doc/enigma-0.1-html/Files.html
new file mode 100644
index 0000000..bfe21bd
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Files.html
@@ -0,0 +1,85 @@
+
+
+Files - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+2.6 Files
+
+ Files can only be created using the built-in function open
. Files
+are either readable or writeable. If a file is writeable, text written
+to the file may optionally be appended to any existing text.
+
+
+
"a" "r" ! open = f1;
+"b" "w" ! open = f2;
+"c" "a" ! open = f3;
+
+# Read one character
+f1 ! read | stdout temp ! write;
+# Write a string
+f2 "Aaar" ! write;
+# Append a string
+f3 "Ouu" ! write;
+
+f1!close;f2!close;f3!close;
+
+
+ To read an entire file, one must use a loop
+construct. See Loops . When there are no more characters left, the
+read
function returns an empty string. Using equality testing,
+reading a complete file is thus possible. See Conditionals .
+
+
filename "r" ! open = f;
+{f ! read = c; stdout c ! write; c "" ! equal ! not = return;} ! loop;
+
+
+ At this point, it may not be obvious why this works. This will be
+explained in the next sections.
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Functions.html b/site/projects/enigma/doc/enigma-0.1-html/Functions.html
new file mode 100644
index 0000000..5b9624a
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Functions.html
@@ -0,0 +1,97 @@
+
+
+Functions - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+2.7 Functions
+
+ Functions are defined and called using the following syntax:
+
+
# Defining them
+{stdout "Hello" ! write;} = func;
+{/x,y/stdout "x=" x ", y=" y!write;} = coorprint;
+{stdout args ! write;} = aprint;
+
+# Calling them
+!func; # Outputs "Hello"
+52 12 ! coorprint; # Outputs "x=52, y=12"
+999 "abc" 21 ! aprint; # Outputs "999 abc 21"
+
+
+ Arguments can thus be accessed either by using the /.../
syntax
+in the beginning of the function or by using the local args
+variable. Furthermore, to make all new variables save in the
+global space, prepend the function content with a *
. This will
+have the same effect as replacing all =
signs in the function
+with the *
operator.
+
+
Remember that your file is also a function, just without the curly
+brackets. This means that when working on the top level of your program,
+args
actually refer to the arguments specified on the command
+line. All arguments are strings, but built-in functions that can convert
+them to numbers exist.
+
+
The previous example functions did not have any return values. This is
+merely because they didn't need such things. To define a return value,
+the return value must be sent to the special variable return
.
+
{/a,b/a b ! multiply = return;} = 2mul;
+33 3 ! 2mul = 2mult;
+stdout 2mult ! write;
+
+The execution of a function does not stop when a value
+is assigned to return
. This has both advantages and
+disadvantages.
+
+ Many things are almost impossible to do without the built-in
+functions. Some are completely impossible. See Built-In . As all
+objects in Enigma are pointers, several built-in functions actually
+modify the objects sent to them as arguments. To solve this problem, one
+must use the clone
function.
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Future.html b/site/projects/enigma/doc/enigma-0.1-html/Future.html
new file mode 100644
index 0000000..1ef0f7f
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Future.html
@@ -0,0 +1,67 @@
+
+
+Future - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+3 Future aspects
+
+As Enigma is right now, it is quite limited. The only way that it can
+interact with the rest of one's system is by reading and writing files
+and by executing shell commands using the system
built-in
+function. This obviously needs to be improved. A foreign function
+interface system must be implemented in version 0.2. It should be
+possible for Enigma to do everything C can.
+
+
The number of built-in functions seems reasonable, but it may be a good
+idea to implement a few more. These eventual functions should be focused
+on making things easier. Specifically, an import function should be
+considered. It is possible to create an import function in Enigma
+directly, but it's not exactly fast. Introducing a “compile” function
+should solve that.
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Implementations.html b/site/projects/enigma/doc/enigma-0.1-html/Implementations.html
new file mode 100644
index 0000000..c67c8d0
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Implementations.html
@@ -0,0 +1,63 @@
+
+
+Implementations - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+4 Implementations
+
+ As of right now (beginning of June 2010) there is only one
+implementation. It is written in Java and is called enigma (with a
+lowercase e). The code is bulky and was not written by an experienced
+Java hacker. For v0.2 it may be a good idea to write the interpreter in
+C instead. Implementing a foreign function interface should be easier
+that way.
+
+
The current implementation can be downloaded at
+http://metanohi.org/projects/enigma .
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Index.html b/site/projects/enigma/doc/enigma-0.1-html/Index.html
new file mode 100644
index 0000000..54ac245
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Index.html
@@ -0,0 +1,69 @@
+
+
+Index - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+Index
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Introduction.html b/site/projects/enigma/doc/enigma-0.1-html/Introduction.html
new file mode 100644
index 0000000..d6d74f5
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Introduction.html
@@ -0,0 +1,93 @@
+
+
+Introduction - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+1 A short introduction
+
+Today, in the world of programming, the commonly used programming
+languages have — to some extent — adapted the same basic
+syntax. Both C, C++, Java, Python and Ruby (and others) all share
+several paradigms, even though they are still very different. Enigma, on
+the other hand, is very different from the “common” languages. See
+this small program to get an idea of Enigma:
+
+
{/a,b/
+ a 2 ! multiply = c;
+ b c ! add = return;
+} = odd-add;
+
+9 4 ! odd-add | stdout temp ! write;
+
+
+Here, 9 is first multiplied with 2 and then added to 4. The
+program then prints the result (22).
+
+
With only a few constructs and built-in variables, Enigma is quite small
+and relatively simple. Any logic can be expressed in Enigma. The above
+example may seem odd, but its aspects will be dealt with in the next
+chapter.
+
+
Enigma is not the kind of programming language that likes to
+control programmers. When programming in Enigma, one creates functions
+that call other functions — instead of creating functions that are
+called by built-in functions.
+
+
On the other hand, Enigma is very restrictive. There are limits to
+certain things. If these limits were not present, chaos would
+ensue. Perhaps.
+
+
Like many other languages, Enigma is quite fond of pointers. In Enigma,
+all variables are pointers. When x
is assigned to a
, and
+b
is assigned to a
, changing b
also changes
+a
. As a matter of fact, when two pointers points to the same
+place, they are forever linked together.
+
+
Enigma is not recommended for serious use. Use with caution !
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Language.html b/site/projects/enigma/doc/enigma-0.1-html/Language.html
new file mode 100644
index 0000000..f7d5fbe
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Language.html
@@ -0,0 +1,82 @@
+
+
+Language - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+2 The language
+
+Enigma consists of functions. Any file being parsed is a
+function. Within functions there can be local variables. These variables
+are to disappear when the function exits.
+
+
Functions have return values. These values can be determined by the
+programmer.
+
+
Within functions, there are commands. These commands constitute the very
+base of Enigma. Commands can interact with built-in functions, meaning
+that writing to and reading from files, calculating, as well as
+manipulating strings and lists, is possible.
+
+
There are no simple types. Enigma lies in the world of objects. Numbers,
+strings, lists.. It's just objects. Also, all commands must end with a
+semicolon;
+
+
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Lists.html b/site/projects/enigma/doc/enigma-0.1-html/Lists.html
new file mode 100644
index 0000000..f454a0a
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Lists.html
@@ -0,0 +1,63 @@
+
+
+Lists - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+2.4 Lists
+
+ Lists are special in Enigma. They are used a lot, but unlike eg. numbers
+and strings they cannot be defined in their own syntax. When one writes
+this:
+
+
123 "witch" = lst;
+
+
+ ..one creates a list. Lists can be nested.
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Loops.html b/site/projects/enigma/doc/enigma-0.1-html/Loops.html
new file mode 100644
index 0000000..0306bda
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Loops.html
@@ -0,0 +1,67 @@
+
+
+Loops - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+2.9 Loops
+
+There are several ways to loop pieces of code in Enigma. One can create
+a function that calls itself, for example. It is, however, advised to
+use the loop
function.
+
# Infinite loop
+{stdout "Forever\n" ! write; true = return;} ! loop;
+
+loop
works a bit like act
, except that it runs on the
+premise of the return value of the function it calls. If it returns
+true, or any other value that can be considered true (non-zero numbers,
+non-empty strings, files, etc.), it runs the function again. If it
+returns false, the loop stops. It naturally runs the first time no
+matter what (no return value has been created yet).
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Numbers.html b/site/projects/enigma/doc/enigma-0.1-html/Numbers.html
new file mode 100644
index 0000000..0d56346
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Numbers.html
@@ -0,0 +1,61 @@
+
+
+Numbers - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+2.2 Numbers
+
+ Numbers in Enigma can be arbitrarily large. They are written as one
+usually writes numbers. Currently only the decimal system is supported.
+
+
7587 = age;
+2556 ! numfunc;
+
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Operators.html b/site/projects/enigma/doc/enigma-0.1-html/Operators.html
new file mode 100644
index 0000000..da47a09
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Operators.html
@@ -0,0 +1,99 @@
+
+
+Operators - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+2.1 Operators
+
+ Enigma has 4 operators: !
, =
, |
, and
+*
. !
and =
are the most important ones.
+
+
To assign values to variables, use the =
operator. For example:
+
obj = hello-string;
+
+Here, the variable hello-string
receives the object obj
. Note
+the syntax. The objects comes first. Unless hello-string
is
+already defined, it is created as a local variable.
+
+ Now, say we have a function called think
and we want to send
+objects to it. This is how that's done:
+
+
obj1 obj2 obj3 ! think;
+
+
+ There are no limits to the amount of objects that can be sent to a
+function. Whitespace characters are used to separate objects, also when
+assigning them to a variable. There is a difference between
+using one object and more objects as arguments, though. When using only
+one object, that object is simply used, but when using more objects, a
+list containing all objects is created and transmitted instead. So, in
+reality, when assigning two or more objects to a variable, the variable
+points to a list with the objects. More about lists later.
+
+
The |
operator is merely a shortcut operator. It can merge
+several commands into one, long command. See the following example:
+
+
# Long version
+a ! b = c;
+d c ! e = c;
+# Short version
+a ! b | d temp ! e = c;
+
+
+ Here, a
is sent to b
, which is then — together with
+d
— sent to e
and saved in c
. The |
acts
+like the semicolon, but it copies the return value of the last function
+(in this case b
) and stores the value in the local variable
+temp
. Hackers are encouraged to use this operator.
+
+
The final operator, *
, has the same function as =
, except
+that it works on a global level. So, if the code is b = a;
and
+a
does not exist, it is created — in the global space.
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Strings.html b/site/projects/enigma/doc/enigma-0.1-html/Strings.html
new file mode 100644
index 0000000..0b3620c
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Strings.html
@@ -0,0 +1,64 @@
+
+
+Strings - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+2.3 Strings
+
+ Strings are defined using the "
character.
+
+
"This is a string!" " This too!" ! add;
+"A" = A;
+"Now comes
+a newline" = nl;
+"\"\\\n\t\
+" = escaped;
+
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/Undefined.html b/site/projects/enigma/doc/enigma-0.1-html/Undefined.html
new file mode 100644
index 0000000..c7e0b47
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/Undefined.html
@@ -0,0 +1,57 @@
+
+
+Undefined - Enigma
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+2.10 Undefined behaviour
+
+Enigma is still new. The way built-in functions act, the way error
+messages appear, and the way some odd details of the language works are
+still undefined. In general, when something seems likely to work, it
+will work. But it's not necessarily defined to work.
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1-html/index.html b/site/projects/enigma/doc/enigma-0.1-html/index.html
new file mode 100644
index 0000000..4d60f6b
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1-html/index.html
@@ -0,0 +1,121 @@
+
+
+Enigma
+
+
+
+
+
+
+
+
+
+
+Enigma
+
+
+
+
+
+
+Enigma
+
+This manual is for Enigma, version 0.1.
+Copyright © 2010 Niels Serup
+
+Permission is granted to copy, distribute and/or modify this document
+under the terms of the GNU Free Documentation License, Version 1.3 or
+any later version published by the Free Software Foundation; with no
+Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A
+copy of the license is included in the section entitled "GNU Free
+Documentation License".
+
+ This document is also available under the terms of the Creative Commons
+Attribution-Share Alike 3.0 (or any later version) Unported license. A
+copy of the license is available at
+http://creativecommons.org/licenses/by-sa/3.0/legalcode .
+
+
+ New versions of this manual will be available at
+http://metanohi.org/projects/enigma/ .
+
+
+
+
+
diff --git a/site/projects/enigma/doc/enigma-0.1.pdf b/site/projects/enigma/doc/enigma-0.1.pdf
new file mode 100644
index 0000000..fe9844e
Binary files /dev/null and b/site/projects/enigma/doc/enigma-0.1.pdf differ
diff --git a/site/projects/enigma/doc/enigma-0.1.texinfo b/site/projects/enigma/doc/enigma-0.1.texinfo
new file mode 100644
index 0000000..ffeb593
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1.texinfo
@@ -0,0 +1,697 @@
+\input texinfo @c -*-texinfo-*-
+@comment %**start of header
+@setfilename enigma-documentation.info
+@finalout
+@settitle Enigma
+@afourpaper
+@syncodeindex pg cp
+@comment %**end of header
+@copying
+This manual is for Enigma, version 0.1.
+Copyright @copyright{} 2010 Niels Serup
+@quotation
+Permission is granted to copy, distribute and/or modify this document
+under the terms of the GNU Free Documentation License, Version 1.3 or
+any later version published by the Free Software Foundation; with no
+Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A
+copy of the license is included in the section entitled "GNU Free
+Documentation License".
+
+This document is also available under the terms of the Creative Commons
+Attribution-Share Alike 3.0 (or any later version) Unported license. A
+copy of the license is available at
+@url{http://creativecommons.org/@/licenses/@/by-sa/@/3.0/@/legalcode}.
+@end quotation
+@end copying
+@titlepage
+@title Enigma
+@subtitle A programming language @hskip 0pt plus 1filll Version 0.1
+@sp 8
+@center @image{../art/enigma-logo,11cm,,Enigma logo}
+@author Niels Serup (@email{ns@@metanohi.org})
+@page
+@vskip 0pt plus 1filll
+@insertcopying
+@end titlepage
+@contents
+@ifnottex
+@node Top, Introduction, (dir), (dir)
+@top Enigma
+@insertcopying
+
+New versions of this manual will be available at
+@url{http://metanohi.org/@/projects/@/enigma/}.
+@end ifnottex
+@menu
+* Introduction::
+* Language::
+* Future::
+* Implementations::
+* Comparison::
+* Built-In::
+* Copying This Manual::
+* Index::
+@end menu
+
+@node Introduction, Language, Top, Top
+@chapter A short introduction
+Today, in the world of programming, the commonly used programming
+languages have --- to some extent --- adapted the same basic
+syntax. Both C, C++, Java, Python and Ruby (and others) all share
+several paradigms, even though they are still very different. Enigma, on
+the other hand, is very different from the ``common'' languages. See
+this small program to get an idea of Enigma:
+
+@verbatim
+{/a,b/
+ a 2 ! multiply = c;
+ b c ! add = return;
+} = odd-add;
+
+9 4 ! odd-add | stdout temp ! write;
+@end verbatim
+
+@noindent Here, 9 is first multiplied with 2 and then added to 4. The
+program then prints the result (22).
+
+With only a few constructs and built-in variables, Enigma is quite small
+and relatively simple. Any logic can be expressed in Enigma. The above
+example may seem odd, but its aspects will be dealt with in the next
+chapter.
+
+Enigma is @emph{not} the kind of programming language that likes to
+control programmers. When programming in Enigma, one creates functions
+that call other functions --- instead of creating functions that are
+called by built-in functions.
+
+On the other hand, Enigma is very restrictive. There are limits to
+certain things. If these limits were not present, chaos would
+ensue. Perhaps.
+
+@cindex pointers
+Like many other languages, Enigma is quite fond of pointers. In Enigma,
+all variables are pointers. When @code{x} is assigned to @code{a}, and
+@code{b} is assigned to @code{a}, changing @code{b} also changes
+@code{a}. As a matter of fact, when two pointers points to the same
+place, they are @strong{forever} linked together.
+
+Enigma is not recommended for serious use. Use with @strong{caution}!
+
+
+@node Language, Future, Introduction, Top
+@chapter The language
+Enigma consists of functions. Any file being parsed is a
+function. Within functions there can be local variables. These variables
+are to disappear when the function exits.
+
+Functions have return values. These values can be determined by the
+programmer.
+
+Within functions, there are commands. These commands constitute the very
+base of Enigma. Commands can interact with built-in functions, meaning
+that writing to and reading from files, calculating, as well as
+manipulating strings and lists, is possible.
+
+There are no simple types. Enigma lies in the world of objects. Numbers,
+strings, lists.. It's just objects. Also, all commands must end with a
+semicolon@code{;}
+
+
+@menu
+* Operators::
+* Numbers::
+* Strings::
+* Lists::
+* Booleans::
+* Files::
+* Functions::
+* Conditionals::
+* Loops::
+* Undefined::
+@end menu
+
+
+@node Operators, Numbers, Language, Language
+@section Operators
+@cindex operators
+Enigma has 4 operators: @code{!}, @code{=}, @code{|}, and
+@code{*}. @code{!} and @code{=} are the most important ones.
+
+To assign values to variables, use the @code{=} operator. For example:
+@verbatim
+obj = hello-string;
+@end verbatim
+Here, the variable @code{hello-string} receives the object @code{obj}. Note
+the syntax. The objects comes first. Unless @code{hello-string} is
+already defined, it is created as a local variable.
+
+Now, say we have a function called @code{think} and we want to send
+objects to it. This is how that's done:
+
+@verbatim
+obj1 obj2 obj3 ! think;
+@end verbatim
+
+There are no limits to the amount of objects that can be sent to a
+function. Whitespace characters are used to separate objects, also when
+assigning them to a variable. There @emph{is} a difference between
+using one object and more objects as arguments, though. When using only
+one object, that object is simply used, but when using more objects, a
+list containing all objects is created and transmitted instead. So, in
+reality, when assigning two or more objects to a variable, the variable
+points to a list with the objects. More about lists later.
+
+The @code{|} operator is merely a shortcut operator. It can merge
+several commands into one, long command. See the following example:
+
+@verbatim
+# Long version
+a ! b = c;
+d c ! e = c;
+# Short version
+a ! b | d temp ! e = c;
+@end verbatim
+
+Here, @code{a} is sent to @code{b}, which is then --- together with
+@code{d} --- sent to @code{e} and saved in @code{c}. The @code{|} acts
+like the semicolon, but it copies the return value of the last function
+(in this case @code{b}) and stores the value in the local variable
+@code{temp}. Hackers are encouraged to use this operator.
+
+The final operator, @code{*}, has the same function as @code{=}, except
+that it works on a global level. So, if the code is @code{b = a;} and
+@code{a} does not exist, it is created --- in the global space.
+
+
+@node Numbers, Strings, Operators, Language
+@section Numbers
+@cindex numbers
+Numbers in Enigma can be arbitrarily large. They are written as one
+usually writes numbers. Currently only the decimal system is supported.
+
+@verbatim
+7587 = age;
+2556 ! numfunc;
+@end verbatim
+
+
+@node Strings, Lists, Numbers, Language
+@section Strings
+@cindex strings
+@cindex characters
+Strings are defined using the @code{"} character.
+
+@verbatim
+"This is a string!" " This too!" ! add;
+"A" = A;
+"Now comes
+a newline" = nl;
+"\"\\\n\t\
+" = escaped;
+@end verbatim
+
+
+@node Lists, Booleans, Strings, Language
+@section Lists
+@cindex lists
+@cindex arrays
+Lists are special in Enigma. They are used a lot, but unlike eg. numbers
+and strings they cannot be defined in their own syntax. When one writes
+this:
+
+@verbatim
+123 "witch" = lst;
+@end verbatim
+
+..one creates a list. Lists can be nested.
+
+
+@node Booleans, Files, Lists, Language
+@section Booleans
+@cindex booleans
+Booleans are used a lot in Enigma. The predefined variables @code{true}
+and @code{false} can be used.
+
+
+@node Files, Functions, Booleans, Language
+@section Files
+@cindex files
+Files can only be created using the built-in function @code{open}. Files
+are either readable or writeable. If a file is writeable, text written
+to the file may optionally be appended to any existing text.
+
+@cindex read
+@cindex write
+@cindex open
+@cindex close
+@verbatim
+"a" "r" ! open = f1;
+"b" "w" ! open = f2;
+"c" "a" ! open = f3;
+
+# Read one character
+f1 ! read | stdout temp ! write;
+# Write a string
+f2 "Aaar" ! write;
+# Append a string
+f3 "Ouu" ! write;
+
+f1!close;f2!close;f3!close;
+@end verbatim
+
+To read an entire file, one must use a loop
+construct. @xref{Loops}. When there are no more characters left, the
+@code{read} function returns an empty string. Using equality testing,
+reading a complete file is thus possible. @xref{Conditionals}.
+
+@verbatim
+filename "r" ! open = f;
+{f ! read = c; stdout c ! write; c "" ! equal ! not = return;} ! loop;
+@end verbatim
+
+At this point, it may not be obvious why this works. This will be
+explained in the next sections.
+
+
+@node Functions, Conditionals, Files, Language
+@section Functions
+@cindex functions
+Functions are defined and called using the following syntax:
+
+@verbatim
+# Defining them
+{stdout "Hello" ! write;} = func;
+{/x,y/stdout "x=" x ", y=" y!write;} = coorprint;
+{stdout args ! write;} = aprint;
+
+# Calling them
+!func; # Outputs "Hello"
+52 12 ! coorprint; # Outputs "x=52, y=12"
+999 "abc" 21 ! aprint; # Outputs "999 abc 21"
+@end verbatim
+
+Arguments can thus be accessed either by using the @code{/.../} syntax
+in the beginning of the function or by using the local @code{args}
+variable. Furthermore, to make @emph{all} new variables save in the
+global space, prepend the function content with a @code{*}. This will
+have the same effect as replacing all @code{=} signs in the function
+with the @code{*} operator.
+
+Remember that your file is also a function, just without the curly
+brackets. This means that when working on the top level of your program,
+@code{args} actually refer to the arguments specified on the command
+line. All arguments are strings, but built-in functions that can convert
+them to numbers exist.
+
+The previous example functions did not have any return values. This is
+merely because they didn't need such things. To define a return value,
+the return value must be sent to the special variable @code{return}.
+@verbatim
+{/a,b/a b ! multiply = return;} = 2mul;
+33 3 ! 2mul = 2mult;
+stdout 2mult ! write;
+@end verbatim
+The execution of a function does @strong{@emph{not}} stop when a value
+is assigned to @code{return}. This has both advantages and
+disadvantages.
+
+Many things are almost impossible to do without the built-in
+functions. Some are completely impossible. @xref{Built-In}. As all
+objects in Enigma are pointers, several built-in functions actually
+modify the objects sent to them as arguments. To solve this problem, one
+must use the @code{clone} function.
+
+
+@node Conditionals, Loops, Functions, Language
+@section Conditionals
+Any value can be related to another value. 78 is less than 85. 2 equals
+2. "Hi" is not "Bye". Enigma comes with a basic set of functions that
+can be used to test these relations. The functions @code{greater},
+@code{lesser}, @code{equal}, @code{not}, @code{or} and @code{and} are
+available. These functions return either true or false. To run a
+function on the condition that a relational function has returned true,
+use the function @code{act}.
+
+While @code{lesser} and @code{greater} are aimed at numbers only,
+and @code{and}, @code{or} and @code{not} are aimed at booleans only,
+@code{equal} can be used on all objects. It tests for all equalities.
+
+@verbatim
+2 = a;
+4 = b;
+
+a 2 ! add | temp b ! equal = cond1;
+"47" ! num | temp 48 ! greater = cond2;
+
+cond1 cond2 ! and | temp write stdout "4 = 4 and 47 > 48\n" ! act;
+cond1 cond2 ! or | temp write stdout "4 = 4 or 47 > 48\n" ! act;
+cond2 ! not | cond1 temp ! and | temp write stdout "4 = 4 and !(47 >
+48)\n" ! act;
+@end verbatim
+
+Even simpler, one can do this (though there's no real need for it):
+@verbatim
+# Instead of stdout "Hello" !write;
+true write stdout "Hello" !act;
+@end verbatim
+
+
+@node Loops, Undefined, Conditionals, Language
+@section Loops
+There are several ways to loop pieces of code in Enigma. One can create
+a function that calls itself, for example. It is, however, advised to
+use the @code{loop} function.
+@verbatim
+# Infinite loop
+{stdout "Forever\n" ! write; true = return;} ! loop;
+@end verbatim
+@code{loop} works a bit like @code{act}, except that it runs on the
+premise of the return value of the function it calls. If it returns
+true, or any other value that can be considered true (non-zero numbers,
+non-empty strings, files, etc.), it runs the function again. If it
+returns false, the loop stops. It naturally runs the first time no
+matter what (no return value has been created yet).
+
+
+@node Undefined, , Loops, Language
+@section Undefined behaviour
+Enigma is still new. The way built-in functions act, the way error
+messages appear, and the way some odd details of the language works are
+still undefined. In general, when something seems likely to work, it
+will work. But it's not necessarily defined to work.
+
+
+@node Future, Implementations, Language, Top
+@chapter Future aspects
+As Enigma is right now, it is quite limited. The only way that it can
+interact with the rest of one's system is by reading and writing files
+and by executing shell commands using the @code{system} built-in
+function. This obviously needs to be improved. A foreign function
+interface system must be implemented in version 0.2. It should be
+possible for Enigma to do everything C can.
+
+The number of built-in functions seems reasonable, but it may be a good
+idea to implement a few more. These eventual functions should be focused
+on making things easier. Specifically, an import function should be
+considered. It is possible to create an import function in Enigma
+directly, but it's not exactly fast. Introducing a ``compile'' function
+should solve that.
+
+
+@node Implementations, Comparison, Future, Top
+@chapter Implementations
+@pindex enigma
+As of right now (beginning of June 2010) there is only one
+implementation. It is written in Java and is called enigma (with a
+lowercase e). The code is bulky and was not written by an experienced
+Java hacker. For v0.2 it may be a good idea to write the interpreter in
+C instead. Implementing a foreign function interface should be easier
+that way.
+
+The current implementation can be downloaded at
+@url{http://metanohi.org/@/projects/@/enigma}.
+
+
+@node Comparison, Built-In, Implementations, Top
+@chapter Comparison with other languages
+@macro exmpl {lang,content}
+@quotation \lang\
+@cartouche
+@example
+\content\
+@end example
+@end cartouche
+@end quotation
+@end macro
+
+
+@menu
+* Compared assigning::
+* Compared conditionals::
+* Compared looping::
+* Compared functions::
+@end menu
+
+
+@node Compared assigning, Compared conditionals, Comparison, Comparison
+@section Assigning values
+@exmpl{C,type var = value;}
+@exmpl{Python,var = value}
+@exmpl{Enigma,value = var;}
+
+
+@node Compared conditionals, Compared looping, Compared assigning, Comparison
+@section Conditionals
+@exmpl{C,if ((a == 2 && b < 5) || (c != 4 && !d)) do_something();}
+@exmpl{Python,if (a == 2 and b < 5) or (c != 4 and not d):
+do_something()}
+@quotation Enigma
+@cartouche
+@example
+a 2 ! equal = cond-a;
+b 5 ! lesser = cond-b;
+c 4 ! equal ! not = cond-c;
+d ! not = cond-d;
+cond-a cond-b ! and = ncond-ab;
+cond-c cond-d ! and = ncond-cd;
+ncond-ab ncond-cd ! or = actcond;
+actcond do-something ! act;
+@end example
+@end cartouche
+@end quotation
+
+
+@node Compared looping, Compared functions, Compared conditionals, Comparison
+@section Looping
+@quotation C
+@cartouche
+@example
+while (thinking) run();
+
+for (int i = 0; i < 18; i++) run(i);
+@end example
+@end cartouche
+@end quotation
+@quotation Python
+@cartouche
+@example
+while thinking: run()
+
+for i in range(18): run(i)
+@end example
+@end cartouche
+@end quotation
+@quotation Enigma
+@cartouche
+@verbatim
+{!run; thinking ! clone = return;} ! loop;
+
+0 = i;
+{i ! run; i 1 ! add; i 18 ! equal = return;} ! loop;
+@end verbatim
+@end cartouche
+@end quotation
+
+
+@node Compared functions, , Compared looping, Comparison
+@section Functions
+@quotation C
+@cartouche
+@verbatim
+int time(float space) {
+ return (int) space / 3;
+}
+
+t = time(81.65);
+@end verbatim
+@end cartouche
+@end quotation
+@quotation Python
+@cartouche
+@example
+def time(space):
+ return int(space / 3)
+
+t = time(81.65)
+@end example
+@end cartouche
+@end quotation
+@quotation Enigma
+@cartouche
+@verbatim
+{/space/space 3 ! divide ! clone ! round = return;} = time;
+
+81.65 ! time = t;
+@end verbatim
+@end cartouche
+@end quotation
+
+
+@node Built-In, Copying This Manual, Comparison, Top
+@chapter Built-in values and functions
+
+
+@menu
+* Built-In values::
+* Built-In functions::
+@end menu
+
+
+@node Built-In values, Built-In functions, Built-In, Built-In
+@section Values
+@cindex built-in values
+The following variables are special and can be accessed anytime. They can
+even be overwritten.
+@verbatim
+args, return, temp, stdin, stderr, stdout, zero, true, false, none, @pi,
+@e, cwd, cpd, fnm
+@end verbatim
+@code{zero} is a fake writable file that does nothing. @code{none} is an
+abstract variable with an internal value of.. none. @code{@@pi} is
+Pi. @code{@@e} is Euler's number. @code{cwd} is the directory from which
+Enigma is run, @code{cpd} is the directory in which the current program
+file resides, and @code{fnm} is the filename of the current program
+file. The rest are self-explanatory --- and @code{args}, @code{return}
+and @code{temp} are extra special.
+
+
+@node Built-In functions, , Built-In values, Built-In
+@section Functions
+@cindex built-in functions
+@macro func {param}
+@noindent @code{\param\}
+@end macro
+Enigma has few built-in functions. But they do exist.
+
+@func{str(OBJECT...)}: Converts all supplied values to strings.
+
+@func{num(OBJECT...)}: Converts all supplied values to numbers.
+
+@func{list(OBJECT...)}: Puts all supplied values in a list and destroys
+nested lists at one level.
+
+@func{bool(OBJECT...)}: Converts all supplied values to booleans.
+
+@func{code(OBJECT...)}: Converts all supplied values to code strings.
+
+@func{repr(OBJECT...)}: Converts all supplied values to representational
+strings. Strings get prepended and appended by " characters, code
+objects are surrounded by @{ and @}, and so on.
+
+@func{type(OBJECT...)}: Converts all supplied values to type strings
+(string, number, file, etc.).
+
+@func{len(OBJECT...)}: Converts all supplied values to their length. This
+can be used for both strings and lists.
+
+@func{clone(OBJECT...)}: Clones all supplied values. When an object is
+cloned, its value is assigned to a new variable. The list of clones is
+returned.
+
+@func{slice(LIST|STRING, NUMBER, NUMBER)}: Returns a list value sliced
+according to the first and second number if the first variable is a
+list variable, or a substring if the first variable is a string
+variable.
+
+@func{loop(FUNCTION, [OBJECT]...)}: Executes function until it returns
+false. Sends the rest of the specified variables (if any) to the
+function as arguments.
+
+@func{open(STRING, STRING)}: Opens the file by the name of the first
+string, using the second string as its guide as to how it should be
+opened. "r" means to read, "w" means to write, and "a" means to
+append. Returns a file object.
+
+@func{close(FILE...)}: Closes files.
+
+@func{read(FILE)}: Reads one character of a file and returns it. If no
+more characters are present, an empty string is returned.
+
+@func{write(FILE, STRING)}: Writes a string to a file.
+
+@func{greater(NUMBER, NUMBER...}: Checks if the first number is
+greater than the rest and returns true or false.
+
+@func{lesser(NUMBER, NUMBER...}: Checks if the first number is
+lesser than the rest and returns true or false.
+
+@func{equal(OBJECT, OBJECT...}: Checks if the objects are equal and returns
+true or false.
+
+@func{and(BOOLEAN...)}: Checks if all booleans are true and returns true
+or false.
+
+@func{or(BOOLEAN...)}: Checks if at least one boolean is true and returns
+true or false.
+
+@func{not(BOOLEAN...)}: Converts values of true to values of false, and
+vice-versa.
+
+@func{act(BOOLEAN, FUNCTION, [OBJECT]...)}: Run the function with the
+optional objects as arguments if the boolean is true.
+
+@func{system(STRING...)}: Join the strings and run the result as a
+system command.
+
+@func{add(NUMBER|STRING|CODE|LIST...)}: Add objects together. Numbers, strings, code
+strings and lists can be used, but only with similar types. The type
+of the first object determines what types the rest must be. The result
+is stored in the first object and also returned.
+
+@func{subtract(NUMBER...)}: Subtract numbers from each other. The
+first object receives the final number. It is also returned.
+
+@func{multiply(NUMBER...)}: Multiply numbers with each other. The
+first object receives the final number. It is also returned.
+
+@func{divide(NUMBER...)}: Divide numbers with each other. The
+first object receives the final number. It is also returned.
+
+@func{mod(NUMBER, NUMBER)}: Finds the remainder of the first number
+divided with the second number and returns it as a new variable.
+
+@func{pow(NUMBER, NUMBER)}: Returns first number^second number.
+
+@func{log(NUMBER, [NUMBER])}: Returns the logarithm of the first
+number. If the second number is not specified, the natural logarith is
+used.
+
+@func{random()}: Returns a random number between 0 and 1.
+
+@func{abs(NUMBER...)}: Sets and returns absolute values of numbers.
+
+@func{round(NUMBER, NUMBER)}: Rounds the first number with x decimals,
+where x is the second number.
+
+@func{floor(NUMBER, NUMBER)}: Floors the first number with x decimals,
+where x is the second number.
+
+@func{ceil(NUMBER, NUMBER)}: "Ceils" the first number with x decimals,
+where x is the second number.
+
+@func{sin(NUMBER...)}: Sets and returns sine values.
+
+@func{cos(NUMBER...)}: Sets and returns cosine values.
+
+@func{tan(NUMBER...)}: Sets and returns tangent values.
+
+@func{asin(NUMBER...)}: Sets and returns arcsine values.
+
+@func{acos(NUMBER...)}: Sets and returns arccosine values.
+
+@func{atan(NUMBER...)}: Sets and returns arctangent values.
+
+@func{sinh(NUMBER...)}: Sets and returns hyperbolic sine values.
+
+@func{cosh(NUMBER...)}: Sets and returns hyperbolic cosine values.
+
+@func{tanh(NUMBER...)}: Sets and returns hyperbolic tangent values.
+
+
+@node Copying This Manual, Index, Built-In, Top
+@appendix GNU Free Documentation License
+@include fdl.texi
+@node Index, , Copying This Manual, Top
+@unnumbered Index
+@printindex cp
+@bye
diff --git a/site/projects/enigma/doc/enigma-0.1.xml b/site/projects/enigma/doc/enigma-0.1.xml
new file mode 100644
index 0000000..b11fe51
--- /dev/null
+++ b/site/projects/enigma/doc/enigma-0.1.xml
@@ -0,0 +1,1002 @@
+
+
+
+]>
+
+ Enigma
+
+
+
+ This manual is for Enigma, version 0.1.
+Copyright © 2010 Niels Serup
+
+ Permission is granted to copy, distribute and/or modify this document
+under the terms of the GNU Free Documentation License, Version 1.3 or
+any later version published by the Free Software Foundation; with no
+Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A
+copy of the license is included in the section entitled "GNU Free
+Documentation License".
+ This document is also available under the terms of the Creative Commons
+Attribution-Share Alike 3.0 (or any later version) Unported license. A
+copy of the license is available at
+http://creativecommons.org/licenses/by-sa/3.0/legalcode .
+
+
+
+
+
+ Enigma
+ This manual is for Enigma, version 0.1.
+Copyright © 2010 Niels Serup
+
+ Permission is granted to copy, distribute and/or modify this document
+under the terms of the GNU Free Documentation License, Version 1.3 or
+any later version published by the Free Software Foundation; with no
+Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A
+copy of the license is included in the section entitled "GNU Free
+Documentation License".
+ This document is also available under the terms of the Creative Commons
+Attribution-Share Alike 3.0 (or any later version) Unported license. A
+copy of the license is available at
+http://creativecommons.org/licenses/by-sa/3.0/legalcode .
+
+ New versions of this manual will be available at
+http://metanohi.org/projects/enigma/ .
+
+
+
+ A short introduction
+ Today, in the world of programming, the commonly used programming
+languages have — to some extent — adapted the same basic
+syntax. Both C, C++, Java, Python and Ruby (and others) all share
+several paradigms, even though they are still very different. Enigma, on
+the other hand, is very different from the “common” languages. See
+this small program to get an idea of Enigma:
+ {/a,b/
+ a 2 ! multiply = c;
+ b c ! add = return;
+} = odd-add;
+
+9 4 ! odd-add | stdout temp ! write;
+
+ Here, 9 is first multiplied with 2 and then added to 4. The
+program then prints the result (22).
+ With only a few constructs and built-in variables, Enigma is quite small
+and relatively simple. Any logic can be expressed in Enigma. The above
+example may seem odd, but its aspects will be dealt with in the next
+chapter.
+ Enigma is not the kind of programming language that likes to
+control programmers. When programming in Enigma, one creates functions
+that call other functions — instead of creating functions that are
+called by built-in functions.
+ On the other hand, Enigma is very restrictive. There are limits to
+certain things. If these limits were not present, chaos would
+ensue. Perhaps.
+ pointers Like many other languages, Enigma is quite fond of pointers. In Enigma,
+all variables are pointers. When x is assigned to a , and
+b is assigned to a , changing b also changes
+a . As a matter of fact, when two pointers points to the same
+place, they are forever linked together.
+ Enigma is not recommended for serious use. Use with caution !
+
+
+
+ The language
+ Enigma consists of functions. Any file being parsed is a
+function. Within functions there can be local variables. These variables
+are to disappear when the function exits.
+ Functions have return values. These values can be determined by the
+programmer.
+ Within functions, there are commands. These commands constitute the very
+base of Enigma. Commands can interact with built-in functions, meaning
+that writing to and reading from files, calculating, as well as
+manipulating strings and lists, is possible.
+ There are no simple types. Enigma lies in the world of objects. Numbers,
+strings, lists.. It's just objects. Also, all commands must end with a
+semicolon;
+
+
+ Operators
+ operators Enigma has 4 operators: ! , = , | , and
+* . ! and = are the most important ones.
+ To assign values to variables, use the = operator. For example:
+ obj = hello-string;
+
+ Here, the variable hello-string receives the object obj . Note
+the syntax. The objects comes first. Unless hello-string is
+already defined, it is created as a local variable.
+ Now, say we have a function called think and we want to send
+objects to it. This is how that's done:
+ obj1 obj2 obj3 ! think;
+
+ There are no limits to the amount of objects that can be sent to a
+function. Whitespace characters are used to separate objects, also when
+assigning them to a variable. There is a difference between
+using one object and more objects as arguments, though. When using only
+one object, that object is simply used, but when using more objects, a
+list containing all objects is created and transmitted instead. So, in
+reality, when assigning two or more objects to a variable, the variable
+points to a list with the objects. More about lists later.
+ The | operator is merely a shortcut operator. It can merge
+several commands into one, long command. See the following example:
+ # Long version
+a ! b = c;
+d c ! e = c;
+# Short version
+a ! b | d temp ! e = c;
+
+ Here, a is sent to b , which is then — together with
+d — sent to e and saved in c . The | acts
+like the semicolon, but it copies the return value of the last function
+(in this case b ) and stores the value in the local variable
+temp . Hackers are encouraged to use this operator.
+ The final operator, * , has the same function as = , except
+that it works on a global level. So, if the code is b = a; and
+a does not exist, it is created — in the global space.
+
+
+
+ Numbers
+ numbers Numbers in Enigma can be arbitrarily large. They are written as one
+usually writes numbers. Currently only the decimal system is supported.
+ 7587 = age;
+2556 ! numfunc;
+
+
+
+
+ Strings
+ strings characters Strings are defined using the " character.
+ "This is a string!" " This too!" ! add;
+"A" = A;
+"Now comes
+a newline" = nl;
+"\"\\\n\t\
+" = escaped;
+
+
+
+
+ Lists
+ lists arrays Lists are special in Enigma. They are used a lot, but unlike eg. numbers
+and strings they cannot be defined in their own syntax. When one writes
+this:
+ 123 "witch" = lst;
+
+ ..one creates a list. Lists can be nested.
+
+
+
+ Booleans
+ booleans Booleans are used a lot in Enigma. The predefined variables true
+and false can be used.
+
+
+
+ Files
+ files Files can only be created using the built-in function open . Files
+are either readable or writeable. If a file is writeable, text written
+to the file may optionally be appended to any existing text.
+ read write open close
+ "a" "r" ! open = f1;
+"b" "w" ! open = f2;
+"c" "a" ! open = f3;
+
+# Read one character
+f1 ! read | stdout temp ! write;
+# Write a string
+f2 "Aaar" ! write;
+# Append a string
+f3 "Ouu" ! write;
+
+f1!close;f2!close;f3!close;
+
+ To read an entire file, one must use a loop
+construct. See . When there are no more characters left, the
+read function returns an empty string. Using equality testing,
+reading a complete file is thus possible. See .
+ filename "r" ! open = f;
+{f ! read = c; stdout c ! write; c "" ! equal ! not = return;} ! loop;
+
+ At this point, it may not be obvious why this works. This will be
+explained in the next sections.
+
+
+
+ Functions
+ functions Functions are defined and called using the following syntax:
+ # Defining them
+{stdout "Hello" ! write;} = func;
+{/x,y/stdout "x=" x ", y=" y!write;} = coorprint;
+{stdout args ! write;} = aprint;
+
+# Calling them
+!func; # Outputs "Hello"
+52 12 ! coorprint; # Outputs "x=52, y=12"
+999 "abc" 21 ! aprint; # Outputs "999 abc 21"
+
+ Arguments can thus be accessed either by using the /.../ syntax
+in the beginning of the function or by using the local args
+variable. Furthermore, to make all new variables save in the
+global space, prepend the function content with a * . This will
+have the same effect as replacing all = signs in the function
+with the * operator.
+ Remember that your file is also a function, just without the curly
+brackets. This means that when working on the top level of your program,
+args actually refer to the arguments specified on the command
+line. All arguments are strings, but built-in functions that can convert
+them to numbers exist.
+ The previous example functions did not have any return values. This is
+merely because they didn't need such things. To define a return value,
+the return value must be sent to the special variable return .
+ {/a,b/a b ! multiply = return;} = 2mul;
+33 3 ! 2mul = 2mult;
+stdout 2mult ! write;
+
+ The execution of a function does not stop when a value
+is assigned to return . This has both advantages and
+disadvantages.
+ Many things are almost impossible to do without the built-in
+functions. Some are completely impossible. See . As all
+objects in Enigma are pointers, several built-in functions actually
+modify the objects sent to them as arguments. To solve this problem, one
+must use the clone function.
+
+
+
+ Conditionals
+ Any value can be related to another value. 78 is less than 85. 2 equals
+2. "Hi" is not "Bye". Enigma comes with a basic set of functions that
+can be used to test these relations. The functions greater ,
+lesser , equal , not , or and and are
+available. These functions return either true or false. To run a
+function on the condition that a relational function has returned true,
+use the function act .
+ While lesser and greater are aimed at numbers only,
+and and , or and not are aimed at booleans only,
+equal can be used on all objects. It tests for all equalities.
+ 2 = a;
+4 = b;
+
+a 2 ! add | temp b ! equal = cond1;
+"47" ! num | temp 48 ! greater = cond2;
+
+cond1 cond2 ! and | temp write stdout "4 = 4 and 47 > 48\n" ! act;
+cond1 cond2 ! or | temp write stdout "4 = 4 or 47 > 48\n" ! act;
+cond2 ! not | cond1 temp ! and | temp write stdout "4 = 4 and !(47 >
+48)\n" ! act;
+
+ Even simpler, one can do this (though there's no real need for it):
+ # Instead of stdout "Hello" !write;
+true write stdout "Hello" !act;
+
+
+
+
+ Loops
+ There are several ways to loop pieces of code in Enigma. One can create
+a function that calls itself, for example. It is, however, advised to
+use the loop function.
+ # Infinite loop
+{stdout "Forever\n" ! write; true = return;} ! loop;
+
+ loop works a bit like act , except that it runs on the
+premise of the return value of the function it calls. If it returns
+true, or any other value that can be considered true (non-zero numbers,
+non-empty strings, files, etc.), it runs the function again. If it
+returns false, the loop stops. It naturally runs the first time no
+matter what (no return value has been created yet).
+
+
+
+ Undefined behaviour
+ Enigma is still new. The way built-in functions act, the way error
+messages appear, and the way some odd details of the language works are
+still undefined. In general, when something seems likely to work, it
+will work. But it's not necessarily defined to work.
+
+
+
+
+ Future aspects
+ As Enigma is right now, it is quite limited. The only way that it can
+interact with the rest of one's system is by reading and writing files
+and by executing shell commands using the system built-in
+function. This obviously needs to be improved. A foreign function
+interface system must be implemented in version 0.2. It should be
+possible for Enigma to do everything C can.
+ The number of built-in functions seems reasonable, but it may be a good
+idea to implement a few more. These eventual functions should be focused
+on making things easier. Specifically, an import function should be
+considered. It is possible to create an import function in Enigma
+directly, but it's not exactly fast. Introducing a “compile” function
+should solve that.
+
+
+
+ Implementations
+ enigma As of right now (beginning of June 2010) there is only one
+implementation. It is written in Java and is called enigma (with a
+lowercase e). The code is bulky and was not written by an experienced
+Java hacker. For v0.2 it may be a good idea to write the interpreter in
+C instead. Implementing a foreign function interface should be easier
+that way.
+ The current implementation can be downloaded at
+http://metanohi.org/projects/enigma .
+
+
+
+ Comparison with other languages
+
+ Assigning values
+
+ C:
+
+type var = value;
+
+
+
+ Python:
+
+var = value
+
+
+
+ Enigma:
+
+value = var;
+
+
+
+
+
+ Conditionals
+
+ C:
+
+if ((a == 2 && b < 5) || (c != 4 && !d)) do_something();
+
+
+
+ Python:
+
+if (a == 2 and b < 5) or (c != 4 and not d):
+do_something()
+
+
+
+ Enigma:
+
+a 2 ! equal = cond-a;
+b 5 ! lesser = cond-b;
+c 4 ! equal ! not = cond-c;
+d ! not = cond-d;
+cond-a cond-b ! and = ncond-ab;
+cond-c cond-d ! and = ncond-cd;
+ncond-ab ncond-cd ! or = actcond;
+actcond do-something ! act;
+
+
+
+
+
+ Looping
+
+ C:
+
+while (thinking) run();
+
+for (int i = 0; i < 18; i++) run(i);
+
+
+
+ Python:
+
+while thinking: run()
+
+for i in range(18): run(i)
+
+
+
+ Enigma:
+ {!run; thinking ! clone = return;} ! loop;
+
+0 = i;
+{i ! run; i 1 ! add; i 18 ! equal = return;} ! loop;
+
+
+
+
+
+ Functions
+
+ C:
+ int time(float space) {
+ return (int) space / 3;
+}
+
+t = time(81.65);
+
+
+
+ Python:
+
+def time(space):
+ return int(space / 3)
+
+t = time(81.65)
+
+
+
+ Enigma:
+ {/space/space 3 ! divide ! clone ! round = return;} = time;
+
+81.65 ! time = t;
+
+
+
+
+
+
+ Built-in values and functions
+
+ Values
+ built-in values The following variables are special and can be accessed anytime. They can
+even be overwritten.
+ args, return, temp, stdin, stderr, stdout, zero, true, false, none, @pi,
+@e, cwd, cpd, fnm
+
+ zero is a fake writable file that does nothing. none is an
+abstract variable with an internal value of.. none. @pi is
+Pi. @e is Euler's number. cwd is the directory from which
+Enigma is run, cpd is the directory in which the current program
+file resides, and fnm is the filename of the current program
+file. The rest are self-explanatory — and args , return
+and temp are extra special.
+
+
+
+ Functions
+ built-in functions Enigma has few built-in functions. But they do exist.
+ str(OBJECT...) : Converts all supplied values to strings.
+ num(OBJECT...) : Converts all supplied values to numbers.
+ list(OBJECT...) : Puts all supplied values in a list and destroys
+nested lists at one level.
+ bool(OBJECT...) : Converts all supplied values to booleans.
+ code(OBJECT...) : Converts all supplied values to code strings.
+ repr(OBJECT...) : Converts all supplied values to representational
+strings. Strings get prepended and appended by " characters, code
+objects are surrounded by { and }, and so on.
+ type(OBJECT...) : Converts all supplied values to type strings
+(string, number, file, etc.).
+ len(OBJECT...) : Converts all supplied values to their length. This
+can be used for both strings and lists.
+ clone(OBJECT...) : Clones all supplied values. When an object is
+cloned, its value is assigned to a new variable. The list of clones is
+returned.
+ slice(LIST|STRING, NUMBER, NUMBER) : Returns a list value sliced
+according to the first and second number if the first variable is a
+list variable, or a substring if the first variable is a string
+variable.
+ loop(FUNCTION, [OBJECT]...) : Executes function until it returns
+false. Sends the rest of the specified variables (if any) to the
+function as arguments.
+ open(STRING, STRING) : Opens the file by the name of the first
+string, using the second string as its guide as to how it should be
+opened. "r" means to read, "w" means to write, and "a" means to
+append. Returns a file object.
+ close(FILE...) : Closes files.
+ read(FILE) : Reads one character of a file and returns it. If no
+more characters are present, an empty string is returned.
+ write(FILE, STRING) : Writes a string to a file.
+ greater(NUMBER, NUMBER... : Checks if the first number is
+greater than the rest and returns true or false.
+ lesser(NUMBER, NUMBER... : Checks if the first number is
+lesser than the rest and returns true or false.
+ equal(OBJECT, OBJECT... : Checks if the objects are equal and returns
+true or false.
+ and(BOOLEAN...) : Checks if all booleans are true and returns true
+or false.
+ or(BOOLEAN...) : Checks if at least one boolean is true and returns
+true or false.
+ not(BOOLEAN...) : Converts values of true to values of false, and
+vice-versa.
+ act(BOOLEAN, FUNCTION, [OBJECT]...) : Run the function with the
+optional objects as arguments if the boolean is true.
+ system(STRING...) : Join the strings and run the result as a
+system command.
+ add(NUMBER|STRING|CODE|LIST...) : Add objects together. Numbers, strings, code
+strings and lists can be used, but only with similar types. The type
+of the first object determines what types the rest must be. The result
+is stored in the first object and also returned.
+ subtract(NUMBER...) : Subtract numbers from each other. The
+first object receives the final number. It is also returned.
+ multiply(NUMBER...) : Multiply numbers with each other. The
+first object receives the final number. It is also returned.
+ divide(NUMBER...) : Divide numbers with each other. The
+first object receives the final number. It is also returned.
+ mod(NUMBER, NUMBER) : Finds the remainder of the first number
+divided with the second number and returns it as a new variable.
+ pow(NUMBER, NUMBER) : Returns first number^second number.
+ log(NUMBER, [NUMBER]) : Returns the logarithm of the first
+number. If the second number is not specified, the natural logarith is
+used.
+ random() : Returns a random number between 0 and 1.
+ abs(NUMBER...) : Sets and returns absolute values of numbers.
+ round(NUMBER, NUMBER) : Rounds the first number with x decimals,
+where x is the second number.
+ floor(NUMBER, NUMBER) : Floors the first number with x decimals,
+where x is the second number.
+ ceil(NUMBER, NUMBER) : "Ceils" the first number with x decimals,
+where x is the second number.
+ sin(NUMBER...) : Sets and returns sine values.
+ cos(NUMBER...) : Sets and returns cosine values.
+ tan(NUMBER...) : Sets and returns tangent values.
+ asin(NUMBER...) : Sets and returns arcsine values.
+ acos(NUMBER...) : Sets and returns arccosine values.
+ atan(NUMBER...) : Sets and returns arctangent values.
+ sinh(NUMBER...) : Sets and returns hyperbolic sine values.
+ cosh(NUMBER...) : Sets and returns hyperbolic cosine values.
+ tanh(NUMBER...) : Sets and returns hyperbolic tangent values.
+
+
+
+
+ GNU Free Documentation License
+
+ Version 1.3, 3 November 2008
+
+
+Copyright © 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
+http://fsf.org/
+
+Everyone is permitted to copy and distribute verbatim copies
+of this license document, but changing it is not allowed.
+
+
+
+ PREAMBLE
+ The purpose of this License is to make a manual, textbook, or other
+functional and useful document free in the sense of freedom: to
+assure everyone the effective freedom to copy and redistribute it,
+with or without modifying it, either commercially or noncommercially.
+Secondarily, this License preserves for the author and publisher a way
+to get credit for their work, while not being considered responsible
+for modifications made by others.
+ This License is a kind of “copyleft”, which means that derivative
+works of the document must themselves be free in the same sense. It
+complements the GNU General Public License, which is a copyleft
+license designed for free software.
+ We have designed this License in order to use it for manuals for free
+software, because free software needs free documentation: a free
+program should come with manuals providing the same freedoms that the
+software does. But this License is not limited to software manuals;
+it can be used for any textual work, regardless of subject matter or
+whether it is published as a printed book. We recommend this License
+principally for works whose purpose is instruction or reference.
+
+
+ APPLICABILITY AND DEFINITIONS
+ This License applies to any manual or other work, in any medium, that
+contains a notice placed by the copyright holder saying it can be
+distributed under the terms of this License. Such a notice grants a
+world-wide, royalty-free license, unlimited in duration, to use that
+work under the conditions stated herein. The “Document”, below,
+refers to any such manual or work. Any member of the public is a
+licensee, and is addressed as “you”. You accept the license if you
+copy, modify or distribute the work in a way requiring permission
+under copyright law.
+ A “Modified Version” of the Document means any work containing the
+Document or a portion of it, either copied verbatim, or with
+modifications and/or translated into another language.
+ A “Secondary Section” is a named appendix or a front-matter section
+of the Document that deals exclusively with the relationship of the
+publishers or authors of the Document to the Document's overall
+subject (or to related matters) and contains nothing that could fall
+directly within that overall subject. (Thus, if the Document is in
+part a textbook of mathematics, a Secondary Section may not explain
+any mathematics.) The relationship could be a matter of historical
+connection with the subject or with related matters, or of legal,
+commercial, philosophical, ethical or political position regarding
+them.
+ The “Invariant Sections” are certain Secondary Sections whose titles
+are designated, as being those of Invariant Sections, in the notice
+that says that the Document is released under this License. If a
+section does not fit the above definition of Secondary then it is not
+allowed to be designated as Invariant. The Document may contain zero
+Invariant Sections. If the Document does not identify any Invariant
+Sections then there are none.
+ The “Cover Texts” are certain short passages of text that are listed,
+as Front-Cover Texts or Back-Cover Texts, in the notice that says that
+the Document is released under this License. A Front-Cover Text may
+be at most 5 words, and a Back-Cover Text may be at most 25 words.
+ A “Transparent” copy of the Document means a machine-readable copy,
+represented in a format whose specification is available to the
+general public, that is suitable for revising the document
+straightforwardly with generic text editors or (for images composed of
+pixels) generic paint programs or (for drawings) some widely available
+drawing editor, and that is suitable for input to text formatters or
+for automatic translation to a variety of formats suitable for input
+to text formatters. A copy made in an otherwise Transparent file
+format whose markup, or absence of markup, has been arranged to thwart
+or discourage subsequent modification by readers is not Transparent.
+An image format is not Transparent if used for any substantial amount
+of text. A copy that is not “Transparent” is called “Opaque”.
+ Examples of suitable formats for Transparent copies include plain
+ascii without markup, Texinfo input format, La&tex; input
+format, SGML or XML using a publicly available
+DTD , and standard-conforming simple HTML ,
+PostScript or PDF designed for human modification. Examples
+of transparent image formats include PNG , XCF and
+JPG . Opaque formats include proprietary formats that can be
+read and edited only by proprietary word processors, SGML or
+XML for which the DTD and/or processing tools are
+not generally available, and the machine-generated HTML ,
+PostScript or PDF produced by some word processors for
+output purposes only.
+ The “Title Page” means, for a printed book, the title page itself,
+plus such following pages as are needed to hold, legibly, the material
+this License requires to appear in the title page. For works in
+formats which do not have any title page as such, “Title Page” means
+the text near the most prominent appearance of the work's title,
+preceding the beginning of the body of the text.
+ The “publisher” means any person or entity that distributes copies
+of the Document to the public.
+ A section “Entitled XYZ” means a named subunit of the Document whose
+title either is precisely XYZ or contains XYZ in parentheses following
+text that translates XYZ in another language. (Here XYZ stands for a
+specific section name mentioned below, such as “Acknowledgements”,
+“Dedications”, “Endorsements”, or “History”.) To “Preserve the Title”
+of such a section when you modify the Document means that it remains a
+section “Entitled XYZ” according to this definition.
+ The Document may include Warranty Disclaimers next to the notice which
+states that this License applies to the Document. These Warranty
+Disclaimers are considered to be included by reference in this
+License, but only as regards disclaiming warranties: any other
+implication that these Warranty Disclaimers may have is void and has
+no effect on the meaning of this License.
+
+
+ VERBATIM COPYING
+ You may copy and distribute the Document in any medium, either
+commercially or noncommercially, provided that this License, the
+copyright notices, and the license notice saying this License applies
+to the Document are reproduced in all copies, and that you add no other
+conditions whatsoever to those of this License. You may not use
+technical measures to obstruct or control the reading or further
+copying of the copies you make or distribute. However, you may accept
+compensation in exchange for copies. If you distribute a large enough
+number of copies you must also follow the conditions in section 3.
+ You may also lend copies, under the same conditions stated above, and
+you may publicly display copies.
+
+
+ COPYING IN QUANTITY
+ If you publish printed copies (or copies in media that commonly have
+printed covers) of the Document, numbering more than 100, and the
+Document's license notice requires Cover Texts, you must enclose the
+copies in covers that carry, clearly and legibly, all these Cover
+Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
+the back cover. Both covers must also clearly and legibly identify
+you as the publisher of these copies. The front cover must present
+the full title with all words of the title equally prominent and
+visible. You may add other material on the covers in addition.
+Copying with changes limited to the covers, as long as they preserve
+the title of the Document and satisfy these conditions, can be treated
+as verbatim copying in other respects.
+ If the required texts for either cover are too voluminous to fit
+legibly, you should put the first ones listed (as many as fit
+reasonably) on the actual cover, and continue the rest onto adjacent
+pages.
+ If you publish or distribute Opaque copies of the Document numbering
+more than 100, you must either include a machine-readable Transparent
+copy along with each Opaque copy, or state in or with each Opaque copy
+a computer-network location from which the general network-using
+public has access to download using public-standard network protocols
+a complete Transparent copy of the Document, free of added material.
+If you use the latter option, you must take reasonably prudent steps,
+when you begin distribution of Opaque copies in quantity, to ensure
+that this Transparent copy will remain thus accessible at the stated
+location until at least one year after the last time you distribute an
+Opaque copy (directly or through your agents or retailers) of that
+edition to the public.
+ It is requested, but not required, that you contact the authors of the
+Document well before redistributing any large number of copies, to give
+them a chance to provide you with an updated version of the Document.
+
+
+ MODIFICATIONS
+ You may copy and distribute a Modified Version of the Document under
+the conditions of sections 2 and 3 above, provided that you release
+the Modified Version under precisely this License, with the Modified
+Version filling the role of the Document, thus licensing distribution
+and modification of the Modified Version to whoever possesses a copy
+of it. In addition, you must do these things in the Modified Version:
+
+
+ Use in the Title Page (and on the covers, if any) a title distinct
+from that of the Document, and from those of previous versions
+(which should, if there were any, be listed in the History section
+of the Document). You may use the same title as a previous version
+if the original publisher of that version gives permission.
+
+
+ List on the Title Page, as authors, one or more persons or entities
+responsible for authorship of the modifications in the Modified
+Version, together with at least five of the principal authors of the
+Document (all of its principal authors, if it has fewer than five),
+unless they release you from this requirement.
+
+
+ State on the Title page the name of the publisher of the
+Modified Version, as the publisher.
+
+
+ Preserve all the copyright notices of the Document.
+
+
+ Add an appropriate copyright notice for your modifications
+adjacent to the other copyright notices.
+
+
+ Include, immediately after the copyright notices, a license notice
+giving the public permission to use the Modified Version under the
+terms of this License, in the form shown in the Addendum below.
+
+
+ Preserve in that license notice the full lists of Invariant Sections
+and required Cover Texts given in the Document's license notice.
+
+
+ Include an unaltered copy of this License.
+
+
+ Preserve the section Entitled “History”, Preserve its Title, and add
+to it an item stating at least the title, year, new authors, and
+publisher of the Modified Version as given on the Title Page. If
+there is no section Entitled “History” in the Document, create one
+stating the title, year, authors, and publisher of the Document as
+given on its Title Page, then add an item describing the Modified
+Version as stated in the previous sentence.
+
+
+ Preserve the network location, if any, given in the Document for
+public access to a Transparent copy of the Document, and likewise
+the network locations given in the Document for previous versions
+it was based on. These may be placed in the “History” section.
+You may omit a network location for a work that was published at
+least four years before the Document itself, or if the original
+publisher of the version it refers to gives permission.
+
+
+ For any section Entitled “Acknowledgements” or “Dedications”, Preserve
+the Title of the section, and preserve in the section all the
+substance and tone of each of the contributor acknowledgements and/or
+dedications given therein.
+
+
+ Preserve all the Invariant Sections of the Document,
+unaltered in their text and in their titles. Section numbers
+or the equivalent are not considered part of the section titles.
+
+
+ Delete any section Entitled “Endorsements”. Such a section
+may not be included in the Modified Version.
+
+
+ Do not retitle any existing section to be Entitled “Endorsements” or
+to conflict in title with any Invariant Section.
+
+
+ Preserve any Warranty Disclaimers.
+
+
+ If the Modified Version includes new front-matter sections or
+appendices that qualify as Secondary Sections and contain no material
+copied from the Document, you may at your option designate some or all
+of these sections as invariant. To do this, add their titles to the
+list of Invariant Sections in the Modified Version's license notice.
+These titles must be distinct from any other section titles.
+ You may add a section Entitled “Endorsements”, provided it contains
+nothing but endorsements of your Modified Version by various
+parties—for example, statements of peer review or that the text has
+been approved by an organization as the authoritative definition of a
+standard.
+ You may add a passage of up to five words as a Front-Cover Text, and a
+passage of up to 25 words as a Back-Cover Text, to the end of the list
+of Cover Texts in the Modified Version. Only one passage of
+Front-Cover Text and one of Back-Cover Text may be added by (or
+through arrangements made by) any one entity. If the Document already
+includes a cover text for the same cover, previously added by you or
+by arrangement made by the same entity you are acting on behalf of,
+you may not add another; but you may replace the old one, on explicit
+permission from the previous publisher that added the old one.
+ The author(s) and publisher(s) of the Document do not by this License
+give permission to use their names for publicity for or to assert or
+imply endorsement of any Modified Version.
+
+
+ COMBINING DOCUMENTS
+ You may combine the Document with other documents released under this
+License, under the terms defined in section 4 above for modified
+versions, provided that you include in the combination all of the
+Invariant Sections of all of the original documents, unmodified, and
+list them all as Invariant Sections of your combined work in its
+license notice, and that you preserve all their Warranty Disclaimers.
+ The combined work need only contain one copy of this License, and
+multiple identical Invariant Sections may be replaced with a single
+copy. If there are multiple Invariant Sections with the same name but
+different contents, make the title of each such section unique by
+adding at the end of it, in parentheses, the name of the original
+author or publisher of that section if known, or else a unique number.
+Make the same adjustment to the section titles in the list of
+Invariant Sections in the license notice of the combined work.
+ In the combination, you must combine any sections Entitled “History”
+in the various original documents, forming one section Entitled
+“History”; likewise combine any sections Entitled “Acknowledgements”,
+and any sections Entitled “Dedications”. You must delete all
+sections Entitled “Endorsements.”
+
+
+ COLLECTIONS OF DOCUMENTS
+ You may make a collection consisting of the Document and other documents
+released under this License, and replace the individual copies of this
+License in the various documents with a single copy that is included in
+the collection, provided that you follow the rules of this License for
+verbatim copying of each of the documents in all other respects.
+ You may extract a single document from such a collection, and distribute
+it individually under this License, provided you insert a copy of this
+License into the extracted document, and follow this License in all
+other respects regarding verbatim copying of that document.
+
+
+ AGGREGATION WITH INDEPENDENT WORKS
+ A compilation of the Document or its derivatives with other separate
+and independent documents or works, in or on a volume of a storage or
+distribution medium, is called an “aggregate” if the copyright
+resulting from the compilation is not used to limit the legal rights
+of the compilation's users beyond what the individual works permit.
+When the Document is included in an aggregate, this License does not
+apply to the other works in the aggregate which are not themselves
+derivative works of the Document.
+ If the Cover Text requirement of section 3 is applicable to these
+copies of the Document, then if the Document is less than one half of
+the entire aggregate, the Document's Cover Texts may be placed on
+covers that bracket the Document within the aggregate, or the
+electronic equivalent of covers if the Document is in electronic form.
+Otherwise they must appear on printed covers that bracket the whole
+aggregate.
+
+
+ TRANSLATION
+ Translation is considered a kind of modification, so you may
+distribute translations of the Document under the terms of section 4.
+Replacing Invariant Sections with translations requires special
+permission from their copyright holders, but you may include
+translations of some or all Invariant Sections in addition to the
+original versions of these Invariant Sections. You may include a
+translation of this License, and all the license notices in the
+Document, and any Warranty Disclaimers, provided that you also include
+the original English version of this License and the original versions
+of those notices and disclaimers. In case of a disagreement between
+the translation and the original version of this License or a notice
+or disclaimer, the original version will prevail.
+ If a section in the Document is Entitled “Acknowledgements”,
+“Dedications”, or “History”, the requirement (section 4) to Preserve
+its Title (section 1) will typically require changing the actual
+title.
+
+
+ TERMINATION
+ You may not copy, modify, sublicense, or distribute the Document
+except as expressly provided under this License. Any attempt
+otherwise to copy, modify, sublicense, or distribute it is void, and
+will automatically terminate your rights under this License.
+ However, if you cease all violation of this License, then your license
+from a particular copyright holder is reinstated (a) provisionally,
+unless and until the copyright holder explicitly and finally
+terminates your license, and (b) permanently, if the copyright holder
+fails to notify you of the violation by some reasonable means prior to
+60 days after the cessation.
+ Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+ Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License. If your rights have been terminated and not permanently
+reinstated, receipt of a copy of some or all of the same material does
+not give you any rights to use it.
+
+
+ FUTURE REVISIONS OF THIS LICENSE
+ The Free Software Foundation may publish new, revised versions
+of the GNU Free Documentation License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns. See
+http://www.gnu.org/copyleft/ .
+ Each version of the License is given a distinguishing version number.
+If the Document specifies that a particular numbered version of this
+License “or any later version” applies to it, you have the option of
+following the terms and conditions either of that specified version or
+of any later version that has been published (not as a draft) by the
+Free Software Foundation. If the Document does not specify a version
+number of this License, you may choose any version ever published (not
+as a draft) by the Free Software Foundation. If the Document
+specifies that a proxy can decide which future versions of this
+License can be used, that proxy's public statement of acceptance of a
+version permanently authorizes you to choose that version for the
+Document.
+
+
+ RELICENSING
+ “Massive Multiauthor Collaboration Site” (or “MMC Site”) means any
+World Wide Web server that publishes copyrightable works and also
+provides prominent facilities for anybody to edit those works. A
+public wiki that anybody can edit is an example of such a server. A
+“Massive Multiauthor Collaboration” (or “MMC”) contained in the
+site means any set of copyrightable works thus published on the MMC
+site.
+ “CC-BY-SA” means the Creative Commons Attribution-Share Alike 3.0
+license published by Creative Commons Corporation, a not-for-profit
+corporation with a principal place of business in San Francisco,
+California, as well as future copyleft versions of that license
+published by that same organization.
+ “Incorporate” means to publish or republish a Document, in whole or
+in part, as part of another Document.
+ An MMC is “eligible for relicensing” if it is licensed under this
+License, and if all works that were first published under this License
+somewhere other than this MMC, and subsequently incorporated in whole
+or in part into the MMC, (1) had no cover texts or invariant sections,
+and (2) were thus incorporated prior to November 1, 2008.
+ The operator of an MMC Site may republish an MMC contained in the site
+under CC-BY-SA on the same site at any time before August 1, 2009,
+provided the MMC is eligible for relicensing.
+
+
+ ADDENDUM: How to use this License for your documents
+ To use this License in a document you have written, include a copy of
+the License in the document and put the following copyright and
+license notices just after the title page:
+
+ Copyright (C) year your name .
+ Permission is granted to copy, distribute and/or modify this document
+ under the terms of the GNU Free Documentation License, Version 1.3
+ or any later version published by the Free Software Foundation;
+ with no Invariant Sections, no Front-Cover Texts, and no Back-Cover
+ Texts. A copy of the license is included in the section entitled ``GNU
+ Free Documentation License''.
+
+ If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts,
+replace the “with…Texts.” line with this:
+
+ with the Invariant Sections being list their titles , with
+ the Front-Cover Texts being list , and with the Back-Cover Texts
+ being list .
+
+ If you have Invariant Sections without Cover Texts, or some other
+combination of the three, merge those two alternatives to suit the
+situation.
+ If your document contains nontrivial examples of program code, we
+recommend releasing these examples in parallel under your choice of
+free software license, such as the GNU General Public License,
+to permit their use in free software.
+
+
+
+
+
+
+ Index
+
+
+
diff --git a/site/projects/enigma/doc/enigma-rapport-da.pdf b/site/projects/enigma/doc/enigma-rapport-da.pdf
new file mode 100644
index 0000000..d0c8808
Binary files /dev/null and b/site/projects/enigma/doc/enigma-rapport-da.pdf differ
diff --git a/site/projects/enigma/enigma-0.1.tar.gz b/site/projects/enigma/enigma-0.1.tar.gz
new file mode 100644
index 0000000..fd83a3d
Binary files /dev/null and b/site/projects/enigma/enigma-0.1.tar.gz differ
diff --git a/site/projects/enigma/index.org b/site/projects/enigma/index.org
new file mode 100644
index 0000000..23ae79d
--- /dev/null
+++ b/site/projects/enigma/index.org
@@ -0,0 +1,61 @@
+#+title: Enigma
+#&summary
+A backwards programming language with interpreter.
+#&
+#+license: bysa, page
+#+license: gpl 3+, interpreter
+
+* Enigma: A programming language
+
+#&img;url=art/enigma-logo-small.png, alt='Enigma logo',\
+#&width=400, height=200, float=right, medlink=art/enigma-logo.svg
+
+Enigma is an interpreted programming language. With it you can create computer
+software. Enigma is not recommended for industrial use. It does work, however.
+
+An Enigma interpreter along with a few tests can be downloaded
+[[enigma-0.1.tar.gz][*here*&large]]. It's relatively stable. I had to write it in Java, as I had to do
+an exam project in Java and I didn't want to create a programming language
+*and* a random Java program at the same time. I would've liked to write it in C
+otherwise (for the experience and for a FFI).
+
+** Documentation
+
++ [[doc/enigma-0.1.pdf][PDF]]
++ [[doc/enigma-0.1-html/][HTML]]
++ [[doc/enigma-0.1.xml][DocBook]]
++ [[doc/enigma-0.1.texinfo][Texinfo (source)]]
+
+Documentation is also included in the program download.
+
+But before you do anything, here's an example of a program:
+
+
+#+BEGIN_SRC
+{/num/
+ 1 = res;
+ {/n,r/
+ r n ! multiply;
+ n 1 ! subtract;
+ n 1 ! greater = return;
+ } = facfunc;
+ facfunc num res ! loop;
+ res = return;
+} = factorial;
+
+5 ! factorial | stdout "5! =" temp "\n" ! write;
+7 ! factorial | stdout "7! =" temp "\n" ! write;
+#+END_SRC
+
+This is a factorial program. It will output this:
+
+: 5! = 120
+: 7! = 5040
+
+So, while the syntax may be different than eg. C, it's not completely
+incomprehensible.
+
+#&line
+*** Note for people who are unable to not understand Danish:
+Hvis du forstår dansk, kan du se min (anonymiserede) aflevering [[doc/enigma-rapport-da.pdf][her]].
+
diff --git a/site/projects/forbi/forbi-0.1.0.tar.gz b/site/projects/forbi/forbi-0.1.0.tar.gz
new file mode 100644
index 0000000..568974e
Binary files /dev/null and b/site/projects/forbi/forbi-0.1.0.tar.gz differ
diff --git a/site/projects/forbi/img/forbi-logo-256.png b/site/projects/forbi/img/forbi-logo-256.png
new file mode 100644
index 0000000..d52a941
Binary files /dev/null and b/site/projects/forbi/img/forbi-logo-256.png differ
diff --git a/site/projects/forbi/index.org b/site/projects/forbi/index.org
new file mode 100644
index 0000000..e36d126
--- /dev/null
+++ b/site/projects/forbi/index.org
@@ -0,0 +1,25 @@
+#+title: forbi
+#&summary
+A TCP-based communication tool with PKCS#1 OAEP RSA encryption
+#&
+#+license: bysa, page
+#+license: agpl 3+, program
+
+* forbi
+
+#&img;url=img/forbi-logo-256.png, alt=forbi logo, float=right
+
+forbi is a TCP-based communication tool with PKCS#1 OAEP RSA encryption. It
+consists of a server and a client. The server keeps track of online users and
+forwards messages from clients to other clients. It is easy to configure what
+the forbi client should do when it receives a message. Its default action is to
+show it in a small window.
+
+forbi is licensed under the GNU Affero General Public License, version 3 or any
+later version. The current version of forbi is 0.1.0.
+
+[[forbi-0.1.0.tar.gz][Download gzipped tarball]].
+
+forbi can also be found in the [[http://pypi.python.org/pypi/forbi][Python Package Index]].
+
+forbi has its code at Gitorious; see [[http://gitorious.org/forbi]].
diff --git a/site/projects/forestquest/forestquest-logo-small.png b/site/projects/forestquest/forestquest-logo-small.png
new file mode 100644
index 0000000..66b7a56
Binary files /dev/null and b/site/projects/forestquest/forestquest-logo-small.png differ
diff --git a/site/projects/forestquest/forestquest-logo-verysmall.png b/site/projects/forestquest/forestquest-logo-verysmall.png
new file mode 100644
index 0000000..e91e9ae
Binary files /dev/null and b/site/projects/forestquest/forestquest-logo-verysmall.png differ
diff --git a/site/projects/forestquest/index.org b/site/projects/forestquest/index.org
new file mode 100644
index 0000000..4d715d0
--- /dev/null
+++ b/site/projects/forestquest/index.org
@@ -0,0 +1,22 @@
+#+title: ForestQuest
+#&summary
+An RPG with focus on interactions with nature. Uses Dililatum.
+#&
+#+license: bysa, page
+#+license: gpl 3+, game
+#+license: bysa, game data
+
+* ForestQuest
+#&img;url=forestquest-logo-small.png, float=right, alt='ForestQuest logo', \
+#& width=192, height=192
+
+ForestQuest is an RPG that utilizes [[../dililatum/'][Dililatum]]. The 0.1 release is just out, and
+you can get it from Launchpad [[http://launchpad.net/forestquest/trunk/0.1/+download/ForestQuest-0.1.tar.gz][here]]. It will not work without Dililatum, so you
+should also download that.
+
+ForestQuest uses Launchpad for development, so there's not much need for this
+page. The project is available at [[http://launchpad.net/forestquest]], and the
+team managing the project has its page at
+[[http://launchpad.net/~forestquest-dev]].
+
+[[screenshots/][Screenshots&large]]
diff --git a/site/projects/forestquest/screenshots/0.png b/site/projects/forestquest/screenshots/0.png
new file mode 100644
index 0000000..99c16dd
Binary files /dev/null and b/site/projects/forestquest/screenshots/0.png differ
diff --git a/site/projects/forestquest/screenshots/1.png b/site/projects/forestquest/screenshots/1.png
new file mode 100644
index 0000000..68c538e
Binary files /dev/null and b/site/projects/forestquest/screenshots/1.png differ
diff --git a/site/projects/forestquest/screenshots/2.png b/site/projects/forestquest/screenshots/2.png
new file mode 100644
index 0000000..39ba7eb
Binary files /dev/null and b/site/projects/forestquest/screenshots/2.png differ
diff --git a/site/projects/forestquest/screenshots/3.png b/site/projects/forestquest/screenshots/3.png
new file mode 100644
index 0000000..a145a26
Binary files /dev/null and b/site/projects/forestquest/screenshots/3.png differ
diff --git a/site/projects/forestquest/screenshots/4.png b/site/projects/forestquest/screenshots/4.png
new file mode 100644
index 0000000..7168721
Binary files /dev/null and b/site/projects/forestquest/screenshots/4.png differ
diff --git a/site/projects/htmlentitiesdecode/htmlentitiesdecode-0.1.0.tar.gz b/site/projects/htmlentitiesdecode/htmlentitiesdecode-0.1.0.tar.gz
new file mode 100644
index 0000000..e884470
Binary files /dev/null and b/site/projects/htmlentitiesdecode/htmlentitiesdecode-0.1.0.tar.gz differ
diff --git a/site/projects/htmlentitiesdecode/htmlentitiesdecode-0.1.1.tar.gz b/site/projects/htmlentitiesdecode/htmlentitiesdecode-0.1.1.tar.gz
new file mode 100644
index 0000000..be55319
Binary files /dev/null and b/site/projects/htmlentitiesdecode/htmlentitiesdecode-0.1.1.tar.gz differ
diff --git a/site/projects/htmlentitiesdecode/index.org b/site/projects/htmlentitiesdecode/index.org
new file mode 100644
index 0000000..da5c7d9
--- /dev/null
+++ b/site/projects/htmlentitiesdecode/index.org
@@ -0,0 +1,17 @@
+#+title: htmlentitiesdecode
+#&summary
+A library to more easily decode html entities in Python 2.x, x >= 5
+#&
+#+license: bysa, page
+#+license: wtf, program
+
+* htmlentitiesdecode
+
+htmlentitiesdecode is a Python 2.x ($x \geq 5$) module that decodes html
+entities. It's very simple. You can download version 0.1.1 [[htmlentitiesdecode-0.1.1.tar.gz][here]] {(0.1.0 is
+[[htmlentitiesdecode-0.1.0.tar.gz][here]])}&small.
+
+htmlentitiesdecode can also be found in the [[http://pypi.python.org/pypi/htmlentitiesdecode][Python Package Index]].
+
+htmlentitiesdecode has its branches at Gitorious; see
+[[http://gitorious.org/htmlentitiesdecode]].
diff --git a/site/projects/img/aeltei.png b/site/projects/img/aeltei.png
new file mode 100644
index 0000000..76ad0be
Binary files /dev/null and b/site/projects/img/aeltei.png differ
diff --git a/site/projects/img/alart.png b/site/projects/img/alart.png
new file mode 100644
index 0000000..d869bca
Binary files /dev/null and b/site/projects/img/alart.png differ
diff --git a/site/projects/img/algo.png b/site/projects/img/algo.png
new file mode 100644
index 0000000..754a3c7
Binary files /dev/null and b/site/projects/img/algo.png differ
diff --git a/site/projects/img/alp.png b/site/projects/img/alp.png
new file mode 100644
index 0000000..0592e47
Binary files /dev/null and b/site/projects/img/alp.png differ
diff --git a/site/projects/img/an5w.png b/site/projects/img/an5w.png
new file mode 100644
index 0000000..26f5cb1
Binary files /dev/null and b/site/projects/img/an5w.png differ
diff --git a/site/projects/img/bsq.png b/site/projects/img/bsq.png
new file mode 100644
index 0000000..6c4508f
Binary files /dev/null and b/site/projects/img/bsq.png differ
diff --git a/site/projects/img/canvas.png b/site/projects/img/canvas.png
new file mode 100644
index 0000000..f021112
Binary files /dev/null and b/site/projects/img/canvas.png differ
diff --git a/site/projects/img/cln.png b/site/projects/img/cln.png
new file mode 100644
index 0000000..9aa17b4
Binary files /dev/null and b/site/projects/img/cln.png differ
diff --git a/site/projects/img/desurveil.png b/site/projects/img/desurveil.png
new file mode 100644
index 0000000..11bb087
Binary files /dev/null and b/site/projects/img/desurveil.png differ
diff --git a/site/projects/img/dililatum.png b/site/projects/img/dililatum.png
new file mode 100644
index 0000000..9f0dee8
Binary files /dev/null and b/site/projects/img/dililatum.png differ
diff --git a/site/projects/img/electruth.png b/site/projects/img/electruth.png
new file mode 100644
index 0000000..370eb30
Binary files /dev/null and b/site/projects/img/electruth.png differ
diff --git a/site/projects/img/enigma.png b/site/projects/img/enigma.png
new file mode 100644
index 0000000..0983f6e
Binary files /dev/null and b/site/projects/img/enigma.png differ
diff --git a/site/projects/img/eonaton.png b/site/projects/img/eonaton.png
new file mode 100644
index 0000000..3429781
Binary files /dev/null and b/site/projects/img/eonaton.png differ
diff --git a/site/projects/img/evolution.png b/site/projects/img/evolution.png
new file mode 100644
index 0000000..8c13f1e
Binary files /dev/null and b/site/projects/img/evolution.png differ
diff --git a/site/projects/img/films.png b/site/projects/img/films.png
new file mode 100644
index 0000000..3e0cb4a
Binary files /dev/null and b/site/projects/img/films.png differ
diff --git a/site/projects/img/forbi.png b/site/projects/img/forbi.png
new file mode 100644
index 0000000..885f57e
Binary files /dev/null and b/site/projects/img/forbi.png differ
diff --git a/site/projects/img/forestquest.png b/site/projects/img/forestquest.png
new file mode 100644
index 0000000..5de8d1f
Binary files /dev/null and b/site/projects/img/forestquest.png differ
diff --git a/site/projects/img/gt3000.png b/site/projects/img/gt3000.png
new file mode 100644
index 0000000..e8e5bca
Binary files /dev/null and b/site/projects/img/gt3000.png differ
diff --git a/site/projects/img/jap.png b/site/projects/img/jap.png
new file mode 100644
index 0000000..9ecba4f
Binary files /dev/null and b/site/projects/img/jap.png differ
diff --git a/site/projects/img/kvigall.png b/site/projects/img/kvigall.png
new file mode 100644
index 0000000..8c3679e
Binary files /dev/null and b/site/projects/img/kvigall.png differ
diff --git a/site/projects/img/movact.png b/site/projects/img/movact.png
new file mode 100644
index 0000000..9636fc7
Binary files /dev/null and b/site/projects/img/movact.png differ
diff --git a/site/projects/img/naghni.png b/site/projects/img/naghni.png
new file mode 100644
index 0000000..8965d6c
Binary files /dev/null and b/site/projects/img/naghni.png differ
diff --git a/site/projects/img/natur.png b/site/projects/img/natur.png
new file mode 100644
index 0000000..70676e0
Binary files /dev/null and b/site/projects/img/natur.png differ
diff --git a/site/projects/img/nohix.png b/site/projects/img/nohix.png
new file mode 100644
index 0000000..0f5895d
Binary files /dev/null and b/site/projects/img/nohix.png differ
diff --git a/site/projects/img/noncrawl.png b/site/projects/img/noncrawl.png
new file mode 100644
index 0000000..5d9e553
Binary files /dev/null and b/site/projects/img/noncrawl.png differ
diff --git a/site/projects/img/pedro.png b/site/projects/img/pedro.png
new file mode 100644
index 0000000..681a74b
Binary files /dev/null and b/site/projects/img/pedro.png differ
diff --git a/site/projects/img/pictures.png b/site/projects/img/pictures.png
new file mode 100644
index 0000000..b5fb490
Binary files /dev/null and b/site/projects/img/pictures.png differ
diff --git a/site/projects/img/roptoligs.png b/site/projects/img/roptoligs.png
new file mode 100644
index 0000000..11a16f8
Binary files /dev/null and b/site/projects/img/roptoligs.png differ
diff --git a/site/projects/img/sadbipws.png b/site/projects/img/sadbipws.png
new file mode 100644
index 0000000..f2f9111
Binary files /dev/null and b/site/projects/img/sadbipws.png differ
diff --git a/site/projects/img/shadowloss.png b/site/projects/img/shadowloss.png
new file mode 100644
index 0000000..431a808
Binary files /dev/null and b/site/projects/img/shadowloss.png differ
diff --git a/site/projects/img/simplechat.png b/site/projects/img/simplechat.png
new file mode 100644
index 0000000..c6a7ab6
Binary files /dev/null and b/site/projects/img/simplechat.png differ
diff --git a/site/projects/img/snake.png b/site/projects/img/snake.png
new file mode 100644
index 0000000..46c9cfa
Binary files /dev/null and b/site/projects/img/snake.png differ
diff --git a/site/projects/img/sq.png b/site/projects/img/sq.png
new file mode 100644
index 0000000..0a9742f
Binary files /dev/null and b/site/projects/img/sq.png differ
diff --git a/site/projects/img/suum.png b/site/projects/img/suum.png
new file mode 100644
index 0000000..7b4b5cf
Binary files /dev/null and b/site/projects/img/suum.png differ
diff --git a/site/projects/img/totxt.png b/site/projects/img/totxt.png
new file mode 100644
index 0000000..af90b29
Binary files /dev/null and b/site/projects/img/totxt.png differ
diff --git a/site/projects/img/wontofor.png b/site/projects/img/wontofor.png
new file mode 100644
index 0000000..760ba62
Binary files /dev/null and b/site/projects/img/wontofor.png differ
diff --git a/site/projects/img/words.png b/site/projects/img/words.png
new file mode 100644
index 0000000..41e5f05
Binary files /dev/null and b/site/projects/img/words.png differ
diff --git a/site/projects/img/wordwork.png b/site/projects/img/wordwork.png
new file mode 100644
index 0000000..9113fbd
Binary files /dev/null and b/site/projects/img/wordwork.png differ
diff --git a/site/projects/img/zita.png b/site/projects/img/zita.png
new file mode 100644
index 0000000..42b111d
Binary files /dev/null and b/site/projects/img/zita.png differ
diff --git a/site/projects/kvigall/img/kvigall-logo-256.png b/site/projects/kvigall/img/kvigall-logo-256.png
new file mode 100644
index 0000000..0f4beca
Binary files /dev/null and b/site/projects/kvigall/img/kvigall-logo-256.png differ
diff --git a/site/projects/kvigall/img/kvigall-logo.svg b/site/projects/kvigall/img/kvigall-logo.svg
new file mode 100644
index 0000000..eee6b4a
--- /dev/null
+++ b/site/projects/kvigall/img/kvigall-logo.svg
@@ -0,0 +1,391 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ image/svg+xml
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ kvigall
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/site/projects/kvigall/index.org b/site/projects/kvigall/index.org
new file mode 100644
index 0000000..4641eff
--- /dev/null
+++ b/site/projects/kvigall/index.org
@@ -0,0 +1,24 @@
+#+title: kvigall
+#&summary
+A customizable calendar with several frontends. Can combine events.
+#&
+#+license: bysa, page
+#+license: gpl 3+, program
+
+* kvigall
+
+#&img;url=img/kvigall-logo-256.png, alt=kvigall logo, float=right, medlink=img/kvigall-logo.svg
+
+kvigall is a calendar program capable of showing calendars created from scripts
+that you create. If there's a site that you often check for upcoming events,
+you can create a script that crawls and parses this site. By converting your
+resulted data into a format understandable by kvigall, you can then view the
+info in a calendar. You can download version 0.1.0 [[kvigall-0.1.0.tar.gz][here]].
+
+kvigall can also be found in the [[http://pypi.python.org/pypi/kvigall][Python Package Index]].
+
+kvigall has its branches at Gitorious; see [[http://gitorious.org/kvigall]].
+
+** Mods
+The scripts used by kvigall to fetch events are called mods. A list of mods can
+be found on [[mods][this page]].
diff --git a/site/projects/kvigall/kvigall-0.1.0.tar.gz b/site/projects/kvigall/kvigall-0.1.0.tar.gz
new file mode 100644
index 0000000..85127f2
Binary files /dev/null and b/site/projects/kvigall/kvigall-0.1.0.tar.gz differ
diff --git a/site/projects/kvigall/mods.org b/site/projects/kvigall/mods.org
new file mode 100644
index 0000000..ca402e3
--- /dev/null
+++ b/site/projects/kvigall/mods.org
@@ -0,0 +1,26 @@
+#+title: kvigall mods
+#&summary
+Scripts that can be used together with kvigall
+#&
+#+license: bysa, page
+
+* kvigall mods
+This page contains a set of mods for [[.][kvigall]].
+
+| Name | Description | Download url |
+|------------------------+------------------------------------------------------------------+-------------------------------------------|
+| simple_mod | A simple mod meant to show the basic layout of mods | [[http://gitorious.org/kvigall/kvigall-mods]] |
+| fronter | Fetches information from proprietary Fronter platforms | [[http://gitorious.org/kvigall/kvigall-mods]] |
+| wikipediacurrentevents | Grabs the events listed at Wikipedia's Portal for current events | [[http://gitorious.org/kvigall/kvigall-mods]] |
+
+It's quite easy to create and use mods, so this page is unlikely to hold
+information on all available mods. It would be nice if someone created a
+webpage/wiki to manage information on this area. For now, send an email to
+[[mailto:ns@metanohi.org][ns@metanohi.org]] if you want to have your mod included on this page. This is
+highly suboptimal.
+
+** Fronter
+This mod makes it possible to fetch information from the proprietary Fronter
+platform running at [[http://fronter.com][fronter.com]]. This mod is meant for those who have been
+forced to use the service but don't actually want to.
+
diff --git a/site/projects/mege/index.org b/site/projects/mege/index.org
index b5afaed..68d46ea 100644
--- a/site/projects/mege/index.org
+++ b/site/projects/mege/index.org
@@ -2,10 +2,16 @@
#&summary
mege is the generator used by metanohi
#&
-#+license: bysa
+#+license: bysa, page
+#+license: agpl 3+, program
* mege
+mege is a website generator. It was designed for metanohi and is released under
+the AGPLv3+ license. It uses Python 3.1 and WSGI to work together with an
+Apache 2.x server. It uses git for revision control and utilizes a slightly
+modified Org-Mode syntax for documents.
+
+ [[./tests/][Tests]]
+ [[./docs/][Documentation]]
diff --git a/site/projects/movact/art/movact-logo-256.png b/site/projects/movact/art/movact-logo-256.png
new file mode 100755
index 0000000..a0ed64b
Binary files /dev/null and b/site/projects/movact/art/movact-logo-256.png differ
diff --git a/site/projects/movact/art/movact-logo-64.png b/site/projects/movact/art/movact-logo-64.png
new file mode 100755
index 0000000..056a25e
Binary files /dev/null and b/site/projects/movact/art/movact-logo-64.png differ
diff --git a/site/projects/movact/art/movact-logo.svg b/site/projects/movact/art/movact-logo.svg
new file mode 100755
index 0000000..cba700e
--- /dev/null
+++ b/site/projects/movact/art/movact-logo.svg
@@ -0,0 +1,949 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/site/projects/movact/index.org b/site/projects/movact/index.org
new file mode 100644
index 0000000..133e3b6
--- /dev/null
+++ b/site/projects/movact/index.org
@@ -0,0 +1,577 @@
+#+title: movact
+#&summary
+A program that reads, runs and converts hypertext fiction files
+#&
+#+license: bysa, page
+#+license: gpl 3+, program
+#&toc
+
+* movact
+#&img;url=art/movact-logo-256.png, center, alt=movact, width=256, height=256, medlink=art/movact-logo.svg
+
+** Info from the readme
+
+#&pre
+=========================================================================
+ movact: a program that reads, runs and converts hypertext fiction files
+=========================================================================
+#&
+
+movact is a small suite of software that aims to aid in the development and use
+of hypertext fiction. With movact everyone is able to create hypertext fiction
+using a very simple syntax. It is hoped that the stories created for movact be
+distributed throughout the world (and ultimately the universe) for everyone to
+read and perhaps build upon, though no one is forcing anyone.
+
+This is the combined README/manual.
+
+** Version
+
+The current version of movact is 0.5.1. This version can be considered quite
+stable, although it is the second version to be released.
+
+** How to get movact
+
+movact will always be online at [[http://metanohi.name/projects/movact/]], where
+documentation will also be available.
+
+[[movact-0.5.1.tar.gz][DOWNLOAD&large]] [[movact-0.5.tar.gz][{(or old version)}&small]].
+
+[[wah.mvct.html][Try a live example]], converted to HTML using a movact tool.
+
+** License information
+
+I have chosen to make movact available under the GNU General Public License
+version 3 or (optionally) any later version.
+
+#&pre
+ movact 0.5.1
+ Copyright © 2009, 2010 Niels Serup
+ License GPLv3+: GNU GPL version 3 or later
+ <[[http://gnu.org/licenses/gpl.html][http://gnu.org/licenses/gpl.html]]>
+ movact is free software: you are free to change and redistribute it.
+ There is NO WARRANTY, to the extent permitted by law.
+#&
+
+This license applies to all files in the "movactorg/" directory, except for the
+files found in the "external/" subdirectory. Those files are released under
+GPL-compatible licenses.
+
+movact also has art. It's located in the "art/" directory. All graphics are
+released under the Creative Commons Attribution/ShareAlike 3.0 Unported license
+("CC BY-SA"). More specifically, the files licensed under CC BY-SA 3.0 are:
+
+ - art/movact-logo-256.png
+ - art/movact-logo-64.png
+ - art/movact-logo.svg
+
+These three files are all copyright © 2009, 2010 Niels Serup
+
+** Dependencies
+
+For movact to run, you must use at least Python 2.4 (though 2.3 may work with
+limited functionality). To run the GTK+ frontend, you should also have PyGTK
+2.6 or newer installed.
+
+Most modern GNU/Linux distributions have both Python and PyGTK in their
+repositories for easy downloading and installing. On DEB-based systems (like
+Debian, gNewSense, etc.) you can do this:
+
+: $ sudo apt-get install python python-gtk2
+
+On RPM-based systems (like Fedora, CentOS, etc.) you can do this:
+
+: $ sudo yum install python pygtk2
+
+
+** Structure
+
+movact is module-based. It consists of several parts.
+
+
+*** Core
+
+The core of movact takes care of the basic stuff, such as loading and parsing.
+
+*** Frontends
+
+The frontends are used to actually *run* movact files after they have been
+loaded and parsed in core. There are currently only two frontends in movact: a
+GUI frontend in GTK+ and a terminal frontend in.. well, text. Support for other
+frontends may come in future releases.
+
+*** Converters
+
+movact runs fine without the converters, but the converters do not run without
+the movact core. It is currently possible to convert movact data files to 4
+formats: HTML (with one page for each movact part), HTML+JavaScript (with only
+one HTML file), XML and pure text.
+
+
+** Art
+
+movact has its own mascot! Now, /that's/ important! Graphics are used to spice
+things up a little. It is believed that the mascot is a mammal, but that's the
+only known fact about it.
+
+
+
+** Installation
+
+movact currently does not support a true installation method. Instead, it
+relies on the script "fake-install.sh". You can use this script to link the
+different movact frontends, as well as the movact converter, to
+"/usr/local/bin/", which means that you can run movact just by typing
+"movact-gtk" or "movact-terminal" in a terminal and convert movact files just
+by typing "movact-convert" in a terminal. The script also asks you to choose a
+default movact frontend, which will be executed when "movact" is typed in a
+terminal.
+
+
+** Included stories
+
+movact includes a small variety of stories: One "real" story consisting of
+several hundreds lines of human-readable text, plus a few mini stories that
+exist mainly for the purpose of testing the movact parser.
+
+The "real" story is available under the CC BY-SA 3.0 Unported license.
+
+
+** movact in command
+
+YOU have the freedom to decide what movact does and what it doesn't -- though
+only to some extent. By default, movact tries to autoload progress when a user
+opens a story; this can be disabled. By default, movact autosaves progress
+whenever the user does something; this can be disabled as well. When using the
+terminal frontend, there are a couple of basic commands that are neccessary to
+know:
+#&pre
+ - /back : go one step back
+ - /reset : reset story and restart at the beginning
+ - /current: make movact display the current part name
+ - /open : open a new file
+ - /load : load a savefile
+ - /save : save progress
+#&
+These commands can be modified by movact stories, so they are not necessarily
+always like this. When using the GTK+ frontend, just use the buttons.
+
+movact saves to and loads from "$HOME/.movact/autosaves/" (e.g.
+"/home/niels/.movact/autosaves/").
+
+
+** Using the command line
+
+There are several advantages of running movact in a terminal (or "console"):
+
+ + You will be able to see any eventual errors that may appear.
+ + You can pickle a story for quicker loading times.
+ + You can tell movact not to autosave or not to autoload.
+
+Using a terminal will still allow you to use a graphical frontend.
+
+If you plan to run movact in a terminal, remember to do this at some point:
+
+: $ movact --help
+
+And, eventually, this:
+
+: $ movact-convert --help
+
+These commands will display a short piece of text that will show you how to
+handle movact.
+
+
+** Syntax
+
+A large part of movact is its syntax. A typical movact document looks like
+this:
+
+#+BEGIN_SRC
+#!/usr/bin/env movact
+
+# Author and license
+ZERO
+
+...META
+..title
+A great story
+..start
+Welcome to the greatest story. You will experience experiences.
+..end
+That was that.
+
+
+...MAIN
+..start
+You have no recollection of who you are or where you are.
+In front of you stands a giant cat. What do you do?
+.cat-run Run for your life
+.10 Count to 10
+.cat-talk Talk to the cat
+
+..cat-run
+[TEXT]...
+
+..10 // 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
+[TEXT]...
+
+..cat-talk
+[TEXT]...
+#+END_SRC
+
+The basic syntax of movact should be possible to perceive looking at the
+example.. I guess. To get a better grasp of how the syntax is, it is a good
+idea to examine and modify the existing stories in the 'stories/'
+directory. Note that the first line in the example is used to more easily run
+movact on systems that support '#!' lines. On other systems it will just be
+ignored. When it works, however, it should be possible to simply type
+
+: $ ./a-story
+
+..instead of
+
+: $ movact a-story
+
+
+** Parts
+
+movact document consists of two parts: a META part and a MAIN part. Each part
+can be separated into subparts. META subparts cannot be separated further, but
+MAIN subparts can. In ascii art a movact document looks like this:
+
+#+BEGIN_SRC
+Document
+ |
+ ·-- META part
+ · |
+ · ·-- subpart
+ · |
+ · .-- .......
+ |
+ ·-- MAIN part
+ |
+ ·-- subpart
+ · |
+ · ·-- paragraph | reference
+ · |
+ · ·-- .....................
+ |
+ ·-- .......
+#+END_SRC
+
+Even if your document layout/syntax seems to be ok, that does not have to be
+the case. When writing movact documents, one thing is absolutely necessary: the
+version. This isn't the version of the story you're writing (there's no way to
+specify that as a separate value) but the version of the parser that you're
+calling (a bit similar to "doctype" in HTML words). The version must always be
+the first real line in a story, i.e. it must be preceded only by comments and
+empty lines or lines with spaces only. Currently, the only supported version
+is "ZERO".
+
+Overview:
+#+BEGIN_SRC
+·---------------------------------------------------------·
+|_ ...xxx ~ xxx = name of part (either META or MAIN) _|
+|_ ..xxx ~ xxx = name of subpart _|
+| .xxx yyy ~ xxx = reference to xxx, written as yyy |
+·---------------------------------------------------------·
+#+END_SRC
+
+Except in the case of references, xxx can include spaces.
+
+You can indent text any way you want to. When reading the name of a part or
+subpart, movact will trim it for spaces. Both '..start' and '..start ' count as
+'start', whereas '..start x' counts as 'start x'.
+
+
+*** META part
+
+META subparts can be used to customize movact. A META subpart will always look
+something like this:
+
+#+BEGIN_SRC
+..open button
+Åben
+#+END_SRC
+
+This will modify the text of the "open a file"-button in GUI frontends to
+"Åben". The default is "Open". It is not a need to actually specify a META
+part. If a META subpart is not specified, the value will default to.. a default
+value. Default values are always strings, except in the case of the 'point'
+subpart and the 'confirmed' subpart, in which lists are used.
+
+To see the default values, look at 'movactorg/core/defaults.py'.
+
+To modify 'point' and 'confirmed', write something like this in your META part:
+
+#+BEGIN_SRC
+..point
+(
+ ('A. ', ('A', 'a')),
+ ('B. ', ('B', 'b')),
+ ('C. ', ('C', 'c'))
+)
+
+..confirmed
+('y', 'yes')
+#+END_SRC
+
+This list syntax is borrowed from Python. If you want only *one* list item, do
+this:
+
+: ('litem1', )
+
+movact only uses the values defined in 'movactorg/core/defaults.py', but you
+can specify other meta data as well, though it has no use. In general, if you
+want to specify special information, do it using comments at the top or bottom
+of your file.
+
+
+*** MAIN part
+
+MAIN subparts are necessary. Stories consist of MAIN subparts. A story will
+need at least one MAIN subpart to actually function, though it will need many
+more to actually resemble a story. The *one* very important subpart *must* be
+named 'start'. So, *all* movact files *must* have lines like this in the MAIN
+part:
+
+#+BEGIN_SRC
+..start
+[TEXT]...
+#+END_SRC
+
+As long as this is present, movact will run. To extend your movact story, you
+add references:
+
+#+BEGIN_SRC
+..subpart
+Some text..
+You have a choice:
+.subpart2 Go here!
+#+END_SRC
+
+This will display the two first lines in the subpart as standard text, and the
+final line as a reference to another subpart named 'subpart2'. How references
+are shown differ in frontends. References can be anywhere in a subpart. They
+can be both before and after standard text. It is the period ('.') that tells
+movact that it's a reference. If a subpart has no references, movact ends the
+game.
+
+
+** Commenting and escaping
+
+As movact documents can grow quite large, it is important to be able to comment
+one's story. There are three ways of using comments in movact:
+
+ + =/*...*/=
+ + =//...=
+ + =#...=
+
+So, you can do something like this:
+
+#+BEGIN_SRC
+..tree
+You approach the tree.# The human approaches the tree
+The squirrel/* ..where did that come from ? */ helps you.
+It seems nice.// Squirrel turns evil in ..forest!
+#+END_SRC
+
+This will not print "# He approaches the tree", "/* ..where did that come from
+? */" and "// Squirrel turns evil in ..forest!". Note that there are no
+limits as to how /*...*/ can be arranged. They can easily span several lines.
+
+Now, allowing all these different types of comments has its disadvantages.
+Sometimes people may want to use the '#' character as a non-comment character.
+To do this, they must escape it using a backslash. So this:
+
+#+BEGIN_SRC
+..tree
+You are next to a tree\# and this is not a comment
+#+END_SRC
+
+..will print "You are next to a tree# and this is not a comment". Note that it
+doesn't print the backslash.
+
+Of course comments are not the only textual things that you can escape. Apart
+from comments, you can escape periods (both '.', '..' and '...') as well as
+other things that haven't been explained yet. As a rule, whenever there's a
+special block of characters, you can escape it. This is generally true.
+
+If you want to show a backslash before escapable places, you have to type two
+backslashes. In normal places just one backslash will do.
+
+
+** Special features
+
+movact has several extra features for the advanced users.
+
+*** '=---='
+
+First, '=---='. The way movact splits subparts is by reading when the next line
+that matches the regex '\.\..+' appears. All empty lines before that line are
+removed from the previous entry. To avoid this, one can append '---' to the
+very end of one's subpart. For example:
+
+#+BEGIN_SRC
+..jupiter-arrival
+The armadillo breaths heavily. It notices a bunch of empty lines.
+.mars Escape!
+---
+#+END_SRC
+
+Normally, the empty lines would not be printed, but because the '---' is there,
+they are. The '\n---' is not printed, however. To print '---' at the end, just
+write this:
+
+#+BEGIN_SRC
+..123
+321
+
+\---
+#+END_SRC
+You could also just do this:
+
+#+BEGIN_SRC
+---
+---
+#+END_SRC
+
+*** ='[end]'=
+
+Normally you would just arrange your document like the ascii art diagram shows.
+You're not forced to do it that way, however. First of all, you can start with
+MAIN and end with META. But it's also possible to use MAIN and META
+interchangeably. This can be achieved by simply writing META, then MAIN, then
+META, etc. There is also another way, though. One can choose to use the '[end]'
+string, like this:
+
+#+BEGIN_SRC
+...META
+..title
+ABC
+
+...MAIN
+..start
+BCA
+
+[end]
+..start
+Welcome to the alphabet story!
+#+END_SRC
+
+After '[end]', the movact parser goes back to META. One could have typed
+'...META' instead of '[end]' and achieved the exact same result. '[end]' can
+also be escaped.
+
+
+*** '%$' and '$%'
+
+Sometimes it can look nice with a string like this:
+: #################################################
+But it would be annoying to type '\#\#\#' etc. This is why '%$' and '$%' exist.
+In any movact document, one can type '%$###########$%'. This will escape all
+the '#' and subsequently print all of them. It will not print '%$' and '$%'. As
+a matter of fact, '%$...$%' will escape everything escapable within the magic
+strings. These strings can also be escaped. To show a '%$', you'll have to
+either write '\%$' or '%$%$$%'. To show a '$%', just write '$%', as long as it
+isn't preceded by a '%$', in which case you'll have to write '\$%'.
+
+** Errors
+
+The movact parser wants everything to be in perfect shape. Everything must be
+certain. This is why it's happy to print error messages; as a matter of fact,
+the movact parser was stderr in its former life.
+
+...
+
+The point is, if the syntax or the organization of the content is odd, movact
+will print an error. But it will only print one error. If you fix that error
+and then try running movact again, there's a risk that you may still get an
+error, though this time a different one. If you have produced a large story, it
+can be troublesome to fix errors one by one. To get a proper answer, the movact
+parser itself has agreed to be interviewed.
+
+#&pre
+INTERVIEWER: So, movact parser, why do you show only ONE -- as in the
+ number 1 -- error at a time? Is it not a bit odd?
+movact PARSER: No, I don't think so. In this world -- no, in this universe
+ -- people are using their lifes on fixing errors. This is
+ an unfortunte development, I think.
+INTERVIEWER: But, isn't fixing errors, bugs and the like a good thing?
+ I mean, humans wrote programs and humans err, right?
+movact PARSER: Well, they do. But I'm not a human. I'm a piece of software.
+INTERVIEWER: You were written by a human.
+movact PARSER: ... ERROR! ERROR! ERROR! CANNOT COMPREHEND. NOT A QUESTION.
+INTERVIEWER: OK, easy now. I kind of get the gist that you you want
+ people to simply not make mistakes. Is this correct?
+movact PARSER: Yes.
+INTERVIEWER: I see. But what if humans choose to modify your code?
+ Would that not mean that there is always a risk of having
+ new bugs introduced to your system?
+movact PARSER: No. While people may freely modify my code, it is important
+ to note that they are merely modifying copies of me. I am
+ who I am, and that fact cannot be changed. I am bug-free.
+INTERVIEWER: I thank you for the interview.
+movact PARSER: ... ERROR! ERROR! ERROR! CANNOT COMPREHEND. NOT A QUESTION.
+#&
+
+The movact parser may have a few unknown quirks. It has ben fed with various
+different files, of which all seemed to work, but.. Please report any bugs to
+[[mailto:ns@metanohi.org][ns@metanohi.org]].
+
+
+
+* Less than important notes
+
+Not everything can be considered important.
+
+
+** Reason for choosing the name "movact"
+
+It's a combination of the word "movie" and the word "act". Since the program is
+about reading fictional works, the name should also be fictional.
+
+** Command-line tweaks (for the sake of completeness)
+
+If you are using movact from a terminal or console, you should note that "-h",
+"--help", "-v" and "--version" are special arguments, as they can be used only
+when no file is present. To use a file that has a name similar to one of these
+arguments, type its filename twice. This is not necessary if you are using one
+of the real arguments, such as '-d' or '--pickle', along with the
+filename. This means that trying to load a file with the name "-h" requires you
+to write "movact -h -h". If you need to load a normal movact file that ends on
+".pickled", you have to escape it, or movact will try to unpickle it. To escape
+it, place a backslash in front of it, like this:
+
+: $ movact \not-a-pickled-file.pickled
+
+If the name of your non-pickled file ends on ".pickled" but starts with a
+backslash, you have to do this:
+
+: $ movact \\not-a-pickled-file.pickled
+
+etc.
+
+When using movact-convert, note that case is ignored. "XML" and "xml" mean the
+same.
+
+
+* TODO
+
+ - Make a proper install script that also makes the program appear in the
+ "Applications" menu on systems that support that
+ - Create a DEB package
+ - Improve the GTK frontend
+ - Add a curses frontend
+ - Add support for variables
+ - Create a man page, eventually using help2man
+
+
+* CHANGES
+
+v0.5.1: Fix in the JavaScript/HTML converter; now works when cookies are
+disabled.
+
+v0.5: FIRST RELEASE
+
diff --git a/site/projects/movact/movact-0.5.1.tar.gz b/site/projects/movact/movact-0.5.1.tar.gz
new file mode 100644
index 0000000..548a35d
Binary files /dev/null and b/site/projects/movact/movact-0.5.1.tar.gz differ
diff --git a/site/projects/movact/movact-0.5.tar.gz b/site/projects/movact/movact-0.5.tar.gz
new file mode 100755
index 0000000..abe3183
Binary files /dev/null and b/site/projects/movact/movact-0.5.tar.gz differ
diff --git a/site/projects/movact/wah.mvct.html b/site/projects/movact/wah.mvct.html
new file mode 100644
index 0000000..b502f60
--- /dev/null
+++ b/site/projects/movact/wah.mvct.html
@@ -0,0 +1,333 @@
+
+
+
+ WAH
+
+
+
+
+
+
+
+
WAH
+
Welcome to WAH...
+An interactive story featuring non-stop action.
+
+
+
+
+
+
diff --git a/site/projects/naghni/Naghni-0.1.tar.gz b/site/projects/naghni/Naghni-0.1.tar.gz
new file mode 100644
index 0000000..5f260e8
Binary files /dev/null and b/site/projects/naghni/Naghni-0.1.tar.gz differ
diff --git a/site/projects/naghni/img/naghni-logo-128x128.png b/site/projects/naghni/img/naghni-logo-128x128.png
new file mode 100644
index 0000000..e58c5d2
Binary files /dev/null and b/site/projects/naghni/img/naghni-logo-128x128.png differ
diff --git a/site/projects/naghni/img/naghni-logo-14x14.png b/site/projects/naghni/img/naghni-logo-14x14.png
new file mode 100644
index 0000000..a231f82
Binary files /dev/null and b/site/projects/naghni/img/naghni-logo-14x14.png differ
diff --git a/site/projects/naghni/img/naghni-logo-16x16.png b/site/projects/naghni/img/naghni-logo-16x16.png
new file mode 100644
index 0000000..1b32787
Binary files /dev/null and b/site/projects/naghni/img/naghni-logo-16x16.png differ
diff --git a/site/projects/naghni/img/naghni-logo-192x192.png b/site/projects/naghni/img/naghni-logo-192x192.png
new file mode 100644
index 0000000..cc41ace
Binary files /dev/null and b/site/projects/naghni/img/naghni-logo-192x192.png differ
diff --git a/site/projects/naghni/img/naghni-logo-256x256.png b/site/projects/naghni/img/naghni-logo-256x256.png
new file mode 100644
index 0000000..1789057
Binary files /dev/null and b/site/projects/naghni/img/naghni-logo-256x256.png differ
diff --git a/site/projects/naghni/img/naghni-logo-384x384.png b/site/projects/naghni/img/naghni-logo-384x384.png
new file mode 100644
index 0000000..3b41d1c
Binary files /dev/null and b/site/projects/naghni/img/naghni-logo-384x384.png differ
diff --git a/site/projects/naghni/img/naghni-logo-512x512.png b/site/projects/naghni/img/naghni-logo-512x512.png
new file mode 100644
index 0000000..f5e7428
Binary files /dev/null and b/site/projects/naghni/img/naghni-logo-512x512.png differ
diff --git a/site/projects/naghni/img/naghni-logo-64x64.png b/site/projects/naghni/img/naghni-logo-64x64.png
new file mode 100644
index 0000000..52bc39d
Binary files /dev/null and b/site/projects/naghni/img/naghni-logo-64x64.png differ
diff --git a/site/projects/naghni/img/naghni-logo.svg b/site/projects/naghni/img/naghni-logo.svg
new file mode 100644
index 0000000..f2cf84e
--- /dev/null
+++ b/site/projects/naghni/img/naghni-logo.svg
@@ -0,0 +1,284 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ image/svg+xml
+
+
+
+
+
+
+ Naghni
+
+
+ Naghni
+
+
+
+
+
+
diff --git a/site/projects/naghni/index.org b/site/projects/naghni/index.org
new file mode 100755
index 0000000..93cf0a5
--- /dev/null
+++ b/site/projects/naghni/index.org
@@ -0,0 +1,28 @@
+#+title: Naghni
+#&summary
+A simple side-scroller with a poor physics engine.
+#&
+#+license: bysa, page
+#+license: gpl 3+, program
+
+* Naghni
+
+#&img;url=img/naghni-logo-192x192.png, float=right, alt=Naghni logo, \
+#& width=192, height=192, medlink=img/naghni-logo.svg
+
+Naghni is a simple side-scrolling game. You are a round creature whose purpose
+is to fill empty holes with matter, thus closing them. It matters greatly to
+your round friends that you do a job well-done, because if you don’t, they’re
+all going to die!
+
+If you want to save the naghnies (for that is the name of the people), you
+should not hesitate to play Naghni.
+
+Naghni has its branches at Gitorious; see [[http://gitorious.org/naghni][http://gitorious.org/naghni]].
+bugtracker can be found at Launchpad; see [[http://launchpad.net/naghni][http://launchpad.net/naghni]].
+
+[[Naghni-0.1.tar.gz][Download&large]].
+
+Naghni can also be found at the [[http://pypi.python.org/pypi/Naghni][Python Package Index]].
+
+[[screenshots/][Screenshots]]
diff --git a/site/projects/naghni/screenshots/0.png b/site/projects/naghni/screenshots/0.png
new file mode 100644
index 0000000..4841337
Binary files /dev/null and b/site/projects/naghni/screenshots/0.png differ
diff --git a/site/projects/naghni/screenshots/1.png b/site/projects/naghni/screenshots/1.png
new file mode 100644
index 0000000..6b4ad6e
Binary files /dev/null and b/site/projects/naghni/screenshots/1.png differ
diff --git a/site/projects/naghni/screenshots/2.png b/site/projects/naghni/screenshots/2.png
new file mode 100644
index 0000000..3dfe518
Binary files /dev/null and b/site/projects/naghni/screenshots/2.png differ
diff --git a/site/projects/naghni/screenshots/3.png b/site/projects/naghni/screenshots/3.png
new file mode 100644
index 0000000..1c695c2
Binary files /dev/null and b/site/projects/naghni/screenshots/3.png differ
diff --git a/site/projects/naghni/screenshots/4.png b/site/projects/naghni/screenshots/4.png
new file mode 100644
index 0000000..486e4b4
Binary files /dev/null and b/site/projects/naghni/screenshots/4.png differ
diff --git a/site/projects/nalgh.org b/site/projects/nalgh.org
new file mode 100755
index 0000000..14de6c4
--- /dev/null
+++ b/site/projects/nalgh.org
@@ -0,0 +1,73 @@
+#+title: nalgh
+#&summary
+Showoff of a poor (but simple) data compression method
+#&
+#+license: bysa, page
+#+license: wtf, program
+
+* nalgh, the {n alg}&strong{orit}{h}&strong{m} (nalgh)
+
+nalgh is an algorithm for lossless compression. It generally compresses a text
+into 77%-87% of its original size. The focus of nalgh lies on simplicity and
+not speed and effeciency. See an example of nalgh in action [[http://projects.metanohi.name/nalgh/example.php][here]] (using part of
+a [[http://www.gutenberg.org/etext/22600][random text]] I found at the [[http://www.gutenberg.org/][Gutenberg Project's website]].
+
+** Pros
+
++ It's simple
+
+** Cons
+
++ It's ineffecient
++ It's slow
++ It delivers a very poor compression
+
+
+** How
+
+1. nalgh loops through input text and makes a list of the characters that are
+ present.
+2. The list is organised so that the character with most appearances comes
+ first.
+3. nalgh loops through input text and creates a new text with each character
+ converted to their binary counterpart based on their appearance on the
+ list. If a text contains most "a"s, second-most "e"s and third-most "r"s,
+ then a becomes 0, e becomes 1, and r becomes 10. In the newly created text,
+ the binary versions are kept as a string, each part split by a "2". This
+ means that "are", based on the facts just stated, will turn into "021021".
+4. nalgh checks if the length of the new text string is directly dividable
+ with 5. If that is not the case, a bunch of "2"s are appended onto the
+ text. The length of "021021" is 6, which divided with 5 leaves a rest of 1,
+ so it's not directly dividable. The final string would in this case be
+ "0210212222".
+5. nalgh loops through the new text string and converts every 5 characters from
+ trinary to their byte equivalent. Looking at the above string, "02102" is
+ converted into the ASCII character of 65 ("A") and "12222" is converted into
+ 161 ("¡"). 5 characters of trinary has 243 possibilites, where a byte has
+ 256, so problems will never occur.
+6. nalgh is almost done now. To be able to easily decompress the text later on,
+ it is neccesary to specify the numbered equivalents of the characters in the
+ input text. To do so, nalgh creates a text string where the character with
+ most appearances appear first, and so on. Continuing using the letters from
+ the previous examples, this string would be "aer", because there are more
+ "a"s than "e"s but more "e"s than "r"s.
+7. A character with the ASCII value of the amount of different input characters
+ is joined with the text describing the appearances of the characters, which
+ is then joined with the text string consisting of converted trinary
+ numbers. Using the "aer" example, the *final* string would be "[ASCII
+ character with the value 3]aerA¡".
+
+Decompressing is simply doing it backwards. At the same time, decompressing is
+a lot less stressful to the computer.
+
+For now nalgh only operates on text, but it shouldn't be too difficult to make
+it work with all byte stuff.
+
+The nalgh source code is available [[http://projects.metanohi.name/nalgh/nalgh.php][here]]. For now there's only a PHP version
+(and an uncommented one, at that), and I doubt that there will ever be a
+version in another language.
+
+I sincerely hope that nalgh will never be used. I have not yet seen a data
+compression method cabaple of performing poorer than nalgh. At the same time, I
+do like the way nalgh works, keeping everything simple.
+
diff --git a/site/projects/noncrawl/img/noncrawl-logo-128.png b/site/projects/noncrawl/img/noncrawl-logo-128.png
new file mode 100644
index 0000000..1bc76d6
Binary files /dev/null and b/site/projects/noncrawl/img/noncrawl-logo-128.png differ
diff --git a/site/projects/noncrawl/img/noncrawl-logo-14.png b/site/projects/noncrawl/img/noncrawl-logo-14.png
new file mode 100644
index 0000000..1c3eefc
Binary files /dev/null and b/site/projects/noncrawl/img/noncrawl-logo-14.png differ
diff --git a/site/projects/noncrawl/img/noncrawl-logo-16.png b/site/projects/noncrawl/img/noncrawl-logo-16.png
new file mode 100644
index 0000000..26907ba
Binary files /dev/null and b/site/projects/noncrawl/img/noncrawl-logo-16.png differ
diff --git a/site/projects/noncrawl/img/noncrawl-logo-192.png b/site/projects/noncrawl/img/noncrawl-logo-192.png
new file mode 100644
index 0000000..a348c99
Binary files /dev/null and b/site/projects/noncrawl/img/noncrawl-logo-192.png differ
diff --git a/site/projects/noncrawl/img/noncrawl-logo-256.png b/site/projects/noncrawl/img/noncrawl-logo-256.png
new file mode 100644
index 0000000..b9c5b41
Binary files /dev/null and b/site/projects/noncrawl/img/noncrawl-logo-256.png differ
diff --git a/site/projects/noncrawl/img/noncrawl-logo-384.png b/site/projects/noncrawl/img/noncrawl-logo-384.png
new file mode 100644
index 0000000..95d003b
Binary files /dev/null and b/site/projects/noncrawl/img/noncrawl-logo-384.png differ
diff --git a/site/projects/noncrawl/img/noncrawl-logo-512.png b/site/projects/noncrawl/img/noncrawl-logo-512.png
new file mode 100644
index 0000000..218a178
Binary files /dev/null and b/site/projects/noncrawl/img/noncrawl-logo-512.png differ
diff --git a/site/projects/noncrawl/img/noncrawl-logo-64.png b/site/projects/noncrawl/img/noncrawl-logo-64.png
new file mode 100644
index 0000000..0a36c24
Binary files /dev/null and b/site/projects/noncrawl/img/noncrawl-logo-64.png differ
diff --git a/site/projects/noncrawl/img/noncrawl-logo.svg b/site/projects/noncrawl/img/noncrawl-logo.svg
new file mode 100644
index 0000000..5d87910
--- /dev/null
+++ b/site/projects/noncrawl/img/noncrawl-logo.svg
@@ -0,0 +1,95 @@
+
+
+
+
+
+
+
+
+
+
+
+ image/svg+xml
+
+
+
+
+
+
+ noncrawl
+
+ ∞
+
+
diff --git a/site/projects/noncrawl/index.org b/site/projects/noncrawl/index.org
new file mode 100755
index 0000000..9578e73
--- /dev/null
+++ b/site/projects/noncrawl/index.org
@@ -0,0 +1,23 @@
+#+title: noncrawl
+#&summary
+A links-centric webcrawler
+#&
+#+license: bysa, page
+#+license: gpl 3+, program
+
+* noncrawl
+
+#&img;url=img/noncrawl-logo-192.png, float=right, alt=noncrawl logo, \
+#& width=192, height=192
+
+noncrawl is a crawler that saves only links. It crawls the web but does not
+attempt to do everything. Instead, its only purpose is to recursively check
+sites for links to other sites, which are then also checked for links to other
+sites, etc. So, if site Y links to site X, that piece of information is saved,
+and if site X has not been checked yet, it will be crawled just like site Y
+was.
+
+[[noncrawl-0.1.tar.gz][DOWNLOAD]].
+
+noncrawl has its branches at Gitorious; see [[http://gitorious.org/noncrawl]]. A
+bugtracker can be found at Launchpad; see [[http://launchpad.net/noncrawl]].
diff --git a/site/projects/noncrawl/noncrawl-0.1.tar.gz b/site/projects/noncrawl/noncrawl-0.1.tar.gz
new file mode 100644
index 0000000..7504b8d
Binary files /dev/null and b/site/projects/noncrawl/noncrawl-0.1.tar.gz differ
diff --git a/site/projects/qvikconfig/index.org b/site/projects/qvikconfig/index.org
new file mode 100755
index 0000000..b952ab1
--- /dev/null
+++ b/site/projects/qvikconfig/index.org
@@ -0,0 +1,18 @@
+#+title: qvikconfig
+#&summary
+Simple config file parser and writer
+#&
+#+license: bysa, page
+#+license: gpl 3+, program
+
+* qvikconfig
+
+qvikconfig is a Python module for parsing simple config files. You can download
+version 0.1.1 (along with a couple of tests) [[qvikconfig-0.1.1.tar.gz][here]] (old versions: [[qvikconfig-0.1.0.tar.gz][0.1.0]]).
+
+qvikconfig can also be found in the [[http://pypi.python.org/pypi/qvikconfig][Python Package Index]].
+
+qvikconfig has its branches at Gitorious; see [[http://gitorious.org/qvikconfig]].
+
+Documentation is included with the download, but you can also view
+it online [[qvikconfig-0.1.1-documentation.html][here]].
diff --git a/site/projects/qvikconfig/qvikconfig-0.1.0-documentation.html b/site/projects/qvikconfig/qvikconfig-0.1.0-documentation.html
new file mode 100644
index 0000000..19efc55
--- /dev/null
+++ b/site/projects/qvikconfig/qvikconfig-0.1.0-documentation.html
@@ -0,0 +1,392 @@
+
+
+
+
+
+
+qvikconfig
+
+
+
+
+
qvikconfig
+
+
qvikconfig is a parser of a simple config file syntax called the
+qvikconfig format. The basic syntax is 'property = value'.
+
qvikconfig offers two main functions: parse and dump . Use
+parse to read config files and dump to write them.
+
+
Documentation
+
To see an example of qvikconfig config files and how to parse and dump
+them, see the files in the tests/ directory of the
+distribution. Alternatively, these examples can be downloaded from
+<http://metanohi.org/projects/qvikconfig/ >.
+
qvikconfig can be considered a dictionary that can link both single
+values and lists of values to named properties. Entries are
+line-separated. A simple example:
+
+# This is a comment.
+name = Example # This is also a comment.
+descriptions = This is an example, Dette er et eksempel
+
+
When parsed, this will be translated to this Python dict:
+
+{'name': 'Example',
+'descriptions': ['This is an example', 'Dette er et eksempel']}
+
It is, in most cases, optional to enclose strings in
+quotes. Whitespace is completely optional.
+
+
Lists
+
qvikconfig uses the comma character to split values, as seen in the
+example above. When there is only one value associated with a
+property, there will be no list. Otherwise there will be one. To
+create a list of only one value, append two commas to your value, like
+this:
+
+a-list=24,,
+
+
This returns this dict:
+
+{'a-list': [24]}
+
+
+
+
Accepted data
+
qvikconfig accepts and understands strings, numbers, True, False, and
+None. Everything else normally results in unknown behavior.
+
Strings are represented using text, sometimes enclosed in
+quotes. Numbers are represented using numbers. True, False and None
+are represented by true, false and none.
+
+
+
Using more than one line
+
You can spread lists across several lines like this:
+
+long list = A,
+B, C, D,
+E, F, G,
+H, I, J,
+K, L, M,
+N, P, O
+
+
This will, naturally, result in this dict:
+
+{'long list': ['A', 'B', 'C', 'D', 'E', 'F',
+'G', 'H','I', 'J', 'K', 'L', 'M', 'N', 'P', 'O']}
+
+
You can make single values take up more than one line like this:
+
+a value = The wall had moved away from the boundaries of the house.
+
+
..which creates this when parsed:
+
+{'a value': 'The wall had moved away from the boundaries of the house.'}
+
+
+
+
Escaping text
+
Certain strings cannot be represented in qvikconfig config files
+without being enclosed in quotes. The strings 'true', 'false' and
+'none' must have quotes (both "..." and '...' are accepted), for
+example. The same goes for, in the case of values, strings containing
+commas and quotes or ending with a backslash, and in the case of
+properties, equal signs. While spaces and tabs are just fine, newlines
+(and carriage returns and so on) must be enclosed in quotes. Example:
+
+# The equality sign is not a comma.
+'=' = 'not a ,'
+
+
..resulting in:
+
+{'=': 'not a ,'}
+
+
+
+
+
+
+
diff --git a/site/projects/qvikconfig/qvikconfig-0.1.0.tar.gz b/site/projects/qvikconfig/qvikconfig-0.1.0.tar.gz
new file mode 100644
index 0000000..1b9258c
Binary files /dev/null and b/site/projects/qvikconfig/qvikconfig-0.1.0.tar.gz differ
diff --git a/site/projects/qvikconfig/qvikconfig-0.1.1-documentation.html b/site/projects/qvikconfig/qvikconfig-0.1.1-documentation.html
new file mode 100644
index 0000000..9996db5
--- /dev/null
+++ b/site/projects/qvikconfig/qvikconfig-0.1.1-documentation.html
@@ -0,0 +1,418 @@
+
+
+
+
+
+
+qvikconfig
+
+
+
+
+
qvikconfig
+
+
qvikconfig is a parser of a simple config file syntax called the
+qvikconfig format. The basic syntax is 'property = value'.
+
qvikconfig offers two main functions: parse and dump . Use
+parse to read config files and dump to write them.
+
+
Documentation
+
To see an example of qvikconfig config files and how to parse and dump
+them, see the files in the tests/ directory of the
+distribution. Alternatively, these examples can be downloaded from
+<http://metanohi.org/projects/qvikconfig/ >.
+
qvikconfig can be considered a dictionary that can link both single
+values and lists of values to named properties. Entries are
+line-separated. A simple example:
+
+# This is a comment.
+name = Example # This is also a comment.
+descriptions = This is an example, Dette er et eksempel
+
+
When parsed, this will be translated to this Python dict:
+
+{'name': 'Example',
+'descriptions': ['This is an example', 'Dette er et eksempel']}
+
It is, in most cases, optional to enclose strings in
+quotes. Whitespace is completely optional.
+
+
Lists
+
qvikconfig uses the comma character to split values, as seen in the
+example above. When there is only one value associated with a
+property, there will be no list. Otherwise there will be one. To
+create a list of only one value, append two commas to your value, like
+this:
+
+a-list=24,,
+
+
This returns this dict:
+
+{'a-list': [24]}
+
+
+
+
Accepted data
+
qvikconfig accepts and understands strings, numbers, True, False, and
+None. Everything else normally results in unknown behavior.
+
Strings are represented using text, sometimes enclosed in
+quotes. Numbers are represented using numbers. True, False and None
+are represented by true, false and none.
+
+
+
Using more than one line
+
You can spread lists across several lines like this:
+
+long list = A,
+B, C, D,
+E, F, G,
+H, I, J,
+K, L, M,
+N, P, O
+
+
This will, naturally, result in this dict:
+
+{'long list': ['A', 'B', 'C', 'D', 'E', 'F',
+'G', 'H','I', 'J', 'K', 'L', 'M', 'N', 'P', 'O']}
+
+
You can make single values take up more than one line like this:
+
+a value = The wall had moved away from the boundaries of the house.
+
+
..which creates this when parsed:
+
+{'a value': 'The wall had moved away from the boundaries of the house.'}
+
+
+
+
Escaping text
+
Certain strings cannot be represented in qvikconfig config files
+without being enclosed in quotes. The strings 'true', 'false' and
+'none' must have quotes (both "..." and '...' are accepted), for
+example. The same goes for, in the case of values, strings containing
+commas and quotes or ending with a backslash, and in the case of
+properties, equal signs. While spaces and tabs are just fine, newlines
+(and carriage returns and so on) must be enclosed in quotes. Example:
+
+# The equality sign is not a comma.
+'=' = 'not a ,'
+
+
..resulting in:
+
+{'=': 'not a ,'}
+
+
+
+
+
+
+
diff --git a/site/projects/qvikconfig/qvikconfig-0.1.1.tar.gz b/site/projects/qvikconfig/qvikconfig-0.1.1.tar.gz
new file mode 100644
index 0000000..61d28ab
Binary files /dev/null and b/site/projects/qvikconfig/qvikconfig-0.1.1.tar.gz differ
diff --git a/site/projects/sadbipws/index.org b/site/projects/sadbipws/index.org
new file mode 100755
index 0000000..97634d9
--- /dev/null
+++ b/site/projects/sadbipws/index.org
@@ -0,0 +1,18 @@
+#+title: sadbipws
+#&summary
+A binary data serializer with more features than BSON
+#&
+#+license: bysa, text
+#+license: cc0, logo
+#+license: gpl 3+, program
+
+* sadbipws
+
+#&img;url=logo.png, alt=sadbipws logo, float=left
+
+sadbipws is a binary data serializer (like BSON). [[sadbipws-0.1.0.tar.gz][Download]].
+
+sadbipws can also be found in the [[http://pypi.python.org/pypi/sadbipws][Python Package Index]].
+
+sadbipws has its code at Gitorious; see [[http://gitorious.org/sadbipws]].
+
diff --git a/site/projects/sadbipws/logo.png b/site/projects/sadbipws/logo.png
new file mode 100644
index 0000000..cd8d387
Binary files /dev/null and b/site/projects/sadbipws/logo.png differ
diff --git a/site/projects/sadbipws/sadbipws-0.1.0.tar.gz b/site/projects/sadbipws/sadbipws-0.1.0.tar.gz
new file mode 100755
index 0000000..af6168a
Binary files /dev/null and b/site/projects/sadbipws/sadbipws-0.1.0.tar.gz differ
diff --git a/site/projects/shadowloss/img/shadowloss-logo-256.png b/site/projects/shadowloss/img/shadowloss-logo-256.png
new file mode 100644
index 0000000..f22d53e
Binary files /dev/null and b/site/projects/shadowloss/img/shadowloss-logo-256.png differ
diff --git a/site/projects/shadowloss/index.org b/site/projects/shadowloss/index.org
new file mode 100755
index 0000000..cd16bd5
--- /dev/null
+++ b/site/projects/shadowloss/index.org
@@ -0,0 +1,23 @@
+#+title: shadowloss
+#&summary
+A repetetive and potentially difficult stickfigure game
+#&
+#+license: bysa, page
+#+license: gpl 3+, program
+
+* shadowloss
+
+#&img;url=img/shadowloss-logo-256.png, alt=shadowloss logo, center
+
+You have no shadow, your limbs are all sticks, and your movements look
+funny. You have been transformed into a stickfigure.
+
+You have the ability to run very fast --- *extremely* fast. You run so fast
+that you are in a constant risk of hurting yourself. If you don't slow down,
+you're going to run straight into a wall and die.
+
+[[shadowloss-0.1.1.tar.gz][Download gzipped tarball of v0.1.1]]. Previous versions: [[shadowloss-0.1.0.tar.gz][v0.1.0]].
+
+shadowloss can also be found in the [[http://pypi.python.org/pypi/shadowloss][Python Package Index]].
+
+shadowloss has its code at Gitorious; see [[http://gitorious.org/shadowloss]].
diff --git a/site/projects/shadowloss/shadowloss-0.1.0.tar.gz b/site/projects/shadowloss/shadowloss-0.1.0.tar.gz
new file mode 100644
index 0000000..d25a1f7
Binary files /dev/null and b/site/projects/shadowloss/shadowloss-0.1.0.tar.gz differ
diff --git a/site/projects/shadowloss/shadowloss-0.1.1.tar.gz b/site/projects/shadowloss/shadowloss-0.1.1.tar.gz
new file mode 100644
index 0000000..59f4f79
Binary files /dev/null and b/site/projects/shadowloss/shadowloss-0.1.1.tar.gz differ
diff --git a/site/projects/simplechat.org b/site/projects/simplechat.org
deleted file mode 100644
index e69de29..0000000
diff --git a/site/projects/simplechat/art/simplechat-logo-small.png b/site/projects/simplechat/art/simplechat-logo-small.png
new file mode 100644
index 0000000..e22eb5e
Binary files /dev/null and b/site/projects/simplechat/art/simplechat-logo-small.png differ
diff --git a/site/projects/simplechat/art/simplechat-logo.png b/site/projects/simplechat/art/simplechat-logo.png
new file mode 100644
index 0000000..52f1cf8
Binary files /dev/null and b/site/projects/simplechat/art/simplechat-logo.png differ
diff --git a/site/projects/simplechat/art/simplechat-logo.svg b/site/projects/simplechat/art/simplechat-logo.svg
new file mode 100644
index 0000000..29b2a67
--- /dev/null
+++ b/site/projects/simplechat/art/simplechat-logo.svg
@@ -0,0 +1,162 @@
+
+
+
+
+
+
+
+
+
+
+ image/svg+xml
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/site/projects/simplechat/index.org b/site/projects/simplechat/index.org
new file mode 100644
index 0000000..973fbee
--- /dev/null
+++ b/site/projects/simplechat/index.org
@@ -0,0 +1,37 @@
+#+title: Simplechat
+#&summary
+A very simple TCP chat program
+#&
+#+license: bysa, page
+#+license: gpl 3+, client program
+#+license: agpl 3+, server program
+
+* simplechat
+#&img;url=art/simplechat-logo-small.png, alt='simplechat logo',\
+#&width=500, height=234, center, medlink=art/simplechat-logo.svg
+
+#&+center
+[[simplechat-0.93.tar.gz][DOWNLOAD!&huge]]
+#&
+
+IRC is great for some people. They can chat with each other, plan events,
+etc. But.. Who /really/ needs that? Isn't simply speaking with an unknown
+number of people with no names better? At least that's what simplechat
+allows. It doesn't allow any codes, and there's no nick support.
+
+: It's just pure chat.
+
+Another simplechat *feature* is that it doesn't tell anyone about the number of
+users on a server. When someone joins or leaves, no one is notified. As the
+curses frontend included with simplechat allows one to easily reuse previous
+messages simply by using the up and down arrows, confusion is bound to
+happen. One might even forget one's own words.
+
+simplechatclient is released under the
+[[http://www.gnu.org/licenses/gpl.html][GNU General Public License]], version 3 or any later version.
+
+simplechatserver is released under the [[http://www.gnu.org/licenses/agpl.html][GNU General Affero Public License]],
+version 3 or any later version.
+
+This program has only been tested on GNU/Linux. It'll probably also work on
+Mæc (but not Whinedoze, since there's a curses interface involved).
diff --git a/site/projects/simplechat/simplechat-0.93.tar.gz b/site/projects/simplechat/simplechat-0.93.tar.gz
new file mode 100644
index 0000000..2b7dc5b
Binary files /dev/null and b/site/projects/simplechat/simplechat-0.93.tar.gz differ
diff --git a/site/projects/totxt/index.org b/site/projects/totxt/index.org
index e69de29..5401364 100644
--- a/site/projects/totxt/index.org
+++ b/site/projects/totxt/index.org
@@ -0,0 +1,256 @@
+#+title: totxt
+#&summary
+Dynamic oldstyle tty webpages with fancy effects.
+#&
+#+license: bysa, page
+#+license: gpl 3+, script
+
+#+javascript: totxt.js
+
+#++show
+#+BEGIN_SRC javascript
+window.addEventListener('load', function(event){
+ load_totxt_generator();
+}, false);
+#+END_SRC
+
+#++show
+#+BEGIN_SRC css
+pre.totxt.dynamic0:hover {
+ background-color: #ff0000;
+ cursor: pointer;
+}
+#+END_SRC
+
+
+* totxt&tt
+
+#++show
+#+BEGIN_SRC html
+What is totxt?
+totxt is a futuristic program
+
+totxt is a JavaScript program that transforms text with regular HTML formatting
+into text that looks like what you're reading right now. The file totxt.js contains the function load_totxt_generator , which, when run, finds text in HTML
+elements and converts that text into this. Before reading on, have a look at
+the following examples to see how it works:
+Example 1
+Example 2
+Example 3
+
+You might also want to take a look at how the examples look without the use of totxt:
+Example 1 without totxt
+Example 2 without totxt
+Example 3 without totxt
+
+
+totxt is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option)
+any later version.
+
+
+totxt accepts two ways of ignoring default values: a global way, which has an effect on all totxt elements, and a local way, which only has an effect on a particular totxt element. An example:
+Before running the load_totxt_generator function, define this inside a script tag:
+ totxt_DYNAMIC = 0
+This will make all totxt elements dynamic, i.e. it will be possible to open and close totxt boxes. When closed, only the header is displayed, while in its open state, both the header, the subheader (if any) and the text will be visible. The 0 value means that all totxt elements first appear in their closed forms. Assigning a value of 1 will make all elements start out as open. Any other value than 0 or 1 will not work. Note that, by default, being dynamic also means that an element opens and closes in a sliding motion and that an element is opened by clicking on it and closed by doubleclicking on it.
+Another way to defy normal values is to locally define changes. Applying 'dynamic0' as a class to a totxt element, such that it will look something like:
+ <h1 class='totxt dynamic0'>A header</h1>
+will have the same effect as defining it the global way, except this will only affect the current element, and not all elements.
+
+ Below is a table describing the values of totxt.
+
+ Furthermore, there are some global variables that can be used to modify the what classes to look for.
+
+To use totxt, simply save it in a directory, then import it using a script tag. Something like this:
+Note that this will run when the page importing it has loaded. It is of course also possible to execute totxt code on other actions.
+
+totxt elements inherit all classes, any eventual id, and style if present, but only from the header element. When looking for text, totxt searches for subheader elements and text elements below the header element. If any other element than those appears, the search will halt. An example:
+<h1 class='totxt'>Header</h1>
+<p>This will be used.</p>
+<p>This will also be used.</p>
+<blockquote>
+I fell asleep reading a dull book, and I dreamt that I was reading on, so I woke up from sheer boredom.
+</blockquote>
+<p>This will not be used.</p>
+
+#+END_SRC
diff --git a/site/projects/totxt/totxt.js b/site/projects/totxt/totxt.js
new file mode 100755
index 0000000..a01d939
--- /dev/null
+++ b/site/projects/totxt/totxt.js
@@ -0,0 +1,725 @@
+/*
+ totxt: A program that transforms HTML elements to plain text
+ Copyright (C) 2009 Niels Serup
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program. If not, see