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/art/enigma-logo-small.png b/site/projects/enigma/art/enigma-logo-small.png
deleted file mode 100644
index 7985af1..0000000
Binary files a/site/projects/enigma/art/enigma-logo-small.png and /dev/null differ
diff --git a/site/projects/enigma/art/enigma-logo-verysmall.png b/site/projects/enigma/art/enigma-logo-verysmall.png
deleted file mode 100644
index 50f0b4d..0000000
Binary files a/site/projects/enigma/art/enigma-logo-verysmall.png and /dev/null differ
diff --git a/site/projects/enigma/art/enigma-logo.png b/site/projects/enigma/art/enigma-logo.png
deleted file mode 100644
index 5466bff..0000000
Binary files a/site/projects/enigma/art/enigma-logo.png and /dev/null differ
diff --git a/site/projects/enigma/art/enigma-logo.svg b/site/projects/enigma/art/enigma-logo.svg
deleted file mode 100644
index 5afd50c..0000000
--- a/site/projects/enigma/art/enigma-logo.svg
+++ /dev/null
@@ -1,86 +0,0 @@
-
-
-
-
-
-
-
-
-
-
- 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
deleted file mode 100644
index 3b271f4..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Booleans.html
+++ /dev/null
@@ -1,57 +0,0 @@
-
-
-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
deleted file mode 100644
index 15dd9bc..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Built_002dIn-functions.html
+++ /dev/null
@@ -1,179 +0,0 @@
-
-
-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
deleted file mode 100644
index 23996e4..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Built_002dIn-values.html
+++ /dev/null
@@ -1,68 +0,0 @@
-
-
-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
deleted file mode 100644
index ebb0a53..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Built_002dIn.html
+++ /dev/null
@@ -1,59 +0,0 @@
-
-
-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
deleted file mode 100644
index 8e43ac0..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Compared-assigning.html
+++ /dev/null
@@ -1,75 +0,0 @@
-
-
-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
deleted file mode 100644
index 88d4745..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Compared-conditionals.html
+++ /dev/null
@@ -1,83 +0,0 @@
-
-
-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
deleted file mode 100644
index fb7d033..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Compared-functions.html
+++ /dev/null
@@ -1,80 +0,0 @@
-
-
-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
deleted file mode 100644
index 7350efb..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Compared-looping.html
+++ /dev/null
@@ -1,80 +0,0 @@
-
-
-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
deleted file mode 100644
index ecf0578..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Comparison.html
+++ /dev/null
@@ -1,60 +0,0 @@
-
-
-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
deleted file mode 100644
index 831684d..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Conditionals.html
+++ /dev/null
@@ -1,83 +0,0 @@
-
-
-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
deleted file mode 100644
index 2db842b..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Copying-This-Manual.html
+++ /dev/null
@@ -1,519 +0,0 @@
-
-
-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
deleted file mode 100644
index bfe21bd..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Files.html
+++ /dev/null
@@ -1,85 +0,0 @@
-
-
-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
deleted file mode 100644
index 5b9624a..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Functions.html
+++ /dev/null
@@ -1,97 +0,0 @@
-
-
-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
deleted file mode 100644
index 1ef0f7f..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Future.html
+++ /dev/null
@@ -1,67 +0,0 @@
-
-
-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
deleted file mode 100644
index c67c8d0..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Implementations.html
+++ /dev/null
@@ -1,63 +0,0 @@
-
-
-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
deleted file mode 100644
index 54ac245..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Index.html
+++ /dev/null
@@ -1,69 +0,0 @@
-
-
-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
deleted file mode 100644
index d6d74f5..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Introduction.html
+++ /dev/null
@@ -1,93 +0,0 @@
-
-
-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
deleted file mode 100644
index f7d5fbe..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Language.html
+++ /dev/null
@@ -1,82 +0,0 @@
-
-
-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
deleted file mode 100644
index f454a0a..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Lists.html
+++ /dev/null
@@ -1,63 +0,0 @@
-
-
-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
deleted file mode 100644
index 0306bda..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Loops.html
+++ /dev/null
@@ -1,67 +0,0 @@
-
-
-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
deleted file mode 100644
index 0d56346..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Numbers.html
+++ /dev/null
@@ -1,61 +0,0 @@
-
-
-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
deleted file mode 100644
index da47a09..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Operators.html
+++ /dev/null
@@ -1,99 +0,0 @@
-
-
-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
deleted file mode 100644
index 0b3620c..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Strings.html
+++ /dev/null
@@ -1,64 +0,0 @@
-
-
-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
deleted file mode 100644
index c7e0b47..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/Undefined.html
+++ /dev/null
@@ -1,57 +0,0 @@
-
-
-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
deleted file mode 100644
index 4d60f6b..0000000
--- a/site/projects/enigma/doc/enigma-0.1-html/index.html
+++ /dev/null
@@ -1,121 +0,0 @@
-
-
-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
deleted file mode 100644
index fe9844e..0000000
Binary files a/site/projects/enigma/doc/enigma-0.1.pdf and /dev/null differ
diff --git a/site/projects/enigma/doc/enigma-0.1.texinfo b/site/projects/enigma/doc/enigma-0.1.texinfo
deleted file mode 100644
index ffeb593..0000000
--- a/site/projects/enigma/doc/enigma-0.1.texinfo
+++ /dev/null
@@ -1,697 +0,0 @@
-\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
deleted file mode 100644
index b11fe51..0000000
--- a/site/projects/enigma/doc/enigma-0.1.xml
+++ /dev/null
@@ -1,1002 +0,0 @@
-
-
-
-]>
-
- 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
deleted file mode 100644
index d0c8808..0000000
Binary files a/site/projects/enigma/doc/enigma-rapport-da.pdf and /dev/null differ
diff --git a/site/projects/enigma/enigma-0.1.tar.gz b/site/projects/enigma/enigma-0.1.tar.gz
deleted file mode 100644
index fd83a3d..0000000
Binary files a/site/projects/enigma/enigma-0.1.tar.gz and /dev/null differ
diff --git a/site/projects/enigma/index.org b/site/projects/enigma/index.org
deleted file mode 100644
index 23ae79d..0000000
--- a/site/projects/enigma/index.org
+++ /dev/null
@@ -1,61 +0,0 @@
-#+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/exoskelegram/exoskelegram-0.1.0.tar.gz b/site/projects/exoskelegram/exoskelegram-0.1.0.tar.gz
deleted file mode 100644
index 4ae5cbd..0000000
Binary files a/site/projects/exoskelegram/exoskelegram-0.1.0.tar.gz and /dev/null differ
diff --git a/site/projects/exoskelegram/index.org b/site/projects/exoskelegram/index.org
deleted file mode 100644
index 43e5066..0000000
--- a/site/projects/exoskelegram/index.org
+++ /dev/null
@@ -1,105 +0,0 @@
-#+title: exoskelegram
-#&summary
-An X11 key press/release catcher/sender wrapper
-#&
-#+license: bysa, text
-#+license: agpl 3+, program
-#&toc
-
-* exoskelegram
-
-exoskelegram is an X11 key press/release catcher/sender wrapper with
-abstractions. From its --help text:
-
-#+BEGIN_SRC
-Usage: exoskelegram COMMAND [ARGS...]
-
-An X11 key press/release catcher/sender wrapper with abstractions
-
-Options:
- --version show program's version number and exit
- -h, --help show this help message and exit
-
-Commands (note: [?] means that is a boolean value where t is
-true and f is false):
-
- catch [lock?f] [stopkeysym]
- Catch all X key events and print them to standard out. If lock is true,
- take control of all the events and don't let them get further than to this
- program. If stopkeysym is specified, stop catching when that keysym is
- caught. If it is not specified, have the user press the corresponding key
- before starting the catch loop.
-
- mapkey keycode keysym [shift_keysym[ mode_switch_keysym[ both_keysym]]]
- Map a key at keycode to the keysyms specified. If only one keysym is
- specified, the key is an alias to that keysym with and without any
- modifiers. If shift_keysym is given, Shift+key will invoke that keysym. If
- mode_switch_keysym is given, Mode_Switch (sometimes called AltGr or Option)
- + key will invoke that keysym. If both_keysym is given,
- Shift+Mode_Switch+key will invoke that keysym. If a keysym is given for one
- modifier but not for the rest, it will also be used for the other modifiers.
-
- sendkey keycode [press?t] [release?t]
- Send a key to the global X server. If press, send a key press. If release,
- send a key release. If both, first press, then release.
-
- sendtext text
- Send a text string to the X server (a series of press-release of keys).
-
- symtocode keysym
- Convert a keysym to a keycode and print.
-
- codetosym keycode
- Convert a keycode to its corresponding four keysyms and print.
-
- nametosym name
- Convert an XString to a keysym and print.
-
- symtouni keysym
- Convert a keysym to a unicode character and print.
-
- unitosym unicodechar
- Convert a unicode character to a keysym and print.
-
- xflush
- Flush the X server.
-
-
-Examples:
- exoskelegram catch f 65307
- Catch key events, do not lock, end on ESC press.
-
- exoskelegram mapkey 23 121
- Map the key at keycode 23 to the letter 'y'.
-
- exoskelegram sendkey 33
- Send the key at keysym 33 ('!').
-
- exoskelegram sendtext Hello
- Succesively send the characters H, e, l, l, and o.
-
- exoskelegram symtocode 89
- Prints the current keycode for the keysym 89.
-
- exoskelegram codetosym 28
- Prints the current keysyms for the keycode 28.
-
- exoskelegram nametosym asciitilde
- Prints the keysym for asciitilde
-
- exoskelegram symtouni 33
- Prints the unicode character of the keysym 33.
-
- exoskelegram unitosym Å
- Prints the keysym for the 'Å' letter.
-#+END_SRC
-
-** Download
-
-exoskelegram is released under the AGPLv3+.
-
-[[exoskelegram-0.1.0.tar.gz][Download]].
-
-exoskelegram can also be found in the [[http://pypi.python.org/pypi/exoskelegram][Python Package Index]]. exoskelegram has
-its code at Gitorious; see [[http://gitorious.org/exoskelegram]].
-
diff --git a/site/projects/forbi/forbi-0.1.0.tar.gz b/site/projects/forbi/forbi-0.1.0.tar.gz
deleted file mode 100644
index 568974e..0000000
Binary files a/site/projects/forbi/forbi-0.1.0.tar.gz and /dev/null differ
diff --git a/site/projects/forbi/img/forbi-logo-256.png b/site/projects/forbi/img/forbi-logo-256.png
deleted file mode 100644
index d52a941..0000000
Binary files a/site/projects/forbi/img/forbi-logo-256.png and /dev/null differ
diff --git a/site/projects/forbi/index.org b/site/projects/forbi/index.org
deleted file mode 100644
index e36d126..0000000
--- a/site/projects/forbi/index.org
+++ /dev/null
@@ -1,25 +0,0 @@
-#+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
deleted file mode 100644
index 66b7a56..0000000
Binary files a/site/projects/forestquest/forestquest-logo-small.png and /dev/null differ
diff --git a/site/projects/forestquest/forestquest-logo-verysmall.png b/site/projects/forestquest/forestquest-logo-verysmall.png
deleted file mode 100644
index e91e9ae..0000000
Binary files a/site/projects/forestquest/forestquest-logo-verysmall.png and /dev/null differ
diff --git a/site/projects/forestquest/index.org b/site/projects/forestquest/index.org
deleted file mode 100644
index 4d715d0..0000000
--- a/site/projects/forestquest/index.org
+++ /dev/null
@@ -1,22 +0,0 @@
-#+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
deleted file mode 100644
index 99c16dd..0000000
Binary files a/site/projects/forestquest/screenshots/0.png and /dev/null differ
diff --git a/site/projects/forestquest/screenshots/1.png b/site/projects/forestquest/screenshots/1.png
deleted file mode 100644
index 68c538e..0000000
Binary files a/site/projects/forestquest/screenshots/1.png and /dev/null differ
diff --git a/site/projects/forestquest/screenshots/2.png b/site/projects/forestquest/screenshots/2.png
deleted file mode 100644
index 39ba7eb..0000000
Binary files a/site/projects/forestquest/screenshots/2.png and /dev/null differ
diff --git a/site/projects/forestquest/screenshots/3.png b/site/projects/forestquest/screenshots/3.png
deleted file mode 100644
index a145a26..0000000
Binary files a/site/projects/forestquest/screenshots/3.png and /dev/null differ
diff --git a/site/projects/forestquest/screenshots/4.png b/site/projects/forestquest/screenshots/4.png
deleted file mode 100644
index 7168721..0000000
Binary files a/site/projects/forestquest/screenshots/4.png and /dev/null differ
diff --git a/site/projects/gravnoise/gravnoise-0.1.0.tar.gz b/site/projects/gravnoise/gravnoise-0.1.0.tar.gz
deleted file mode 100644
index 444f715..0000000
Binary files a/site/projects/gravnoise/gravnoise-0.1.0.tar.gz and /dev/null differ
diff --git a/site/projects/gravnoise/index.org b/site/projects/gravnoise/index.org
deleted file mode 100644
index a37eab4..0000000
--- a/site/projects/gravnoise/index.org
+++ /dev/null
@@ -1,27 +0,0 @@
-#+title: gravnoise
-#&summary
-A block-based, gravity-infused puzzle game
-#&
-#+license: bysa, text
-#+license: gpl 3+, program
-#&toc
-
-* gravnoise
-
-gravnoise is a block-based, gravity-infused puzzle game: it is a bit of a
-tetris clone.
-
-It features annoying graphics.
-
-#&img;url=screenshot.png
-
-
-** Download
-
-gravnoise is released under the GPLv3+.
-
-[[gravnoise-0.1.0.tar.gz][Download]].
-
-gravnoise can also be found in the [[http://pypi.python.org/pypi/gravnoise][Python Package Index]]. gravnoise has its code
-at Gitorious; see [[http://gitorious.org/gravnoise]].
-
diff --git a/site/projects/gravnoise/screenshot.png b/site/projects/gravnoise/screenshot.png
deleted file mode 100644
index 31f5be8..0000000
Binary files a/site/projects/gravnoise/screenshot.png and /dev/null differ
diff --git a/site/projects/hbcht/hbcht-0.1.0.tar.gz b/site/projects/hbcht/hbcht-0.1.0.tar.gz
deleted file mode 100644
index 91d8846..0000000
Binary files a/site/projects/hbcht/hbcht-0.1.0.tar.gz and /dev/null differ
diff --git a/site/projects/hbcht/hbcht-0.1.1.tar.gz b/site/projects/hbcht/hbcht-0.1.1.tar.gz
deleted file mode 100644
index 6816bc9..0000000
Binary files a/site/projects/hbcht/hbcht-0.1.1.tar.gz and /dev/null differ
diff --git a/site/projects/hbcht/index.org b/site/projects/hbcht/index.org
deleted file mode 100644
index e1398dc..0000000
--- a/site/projects/hbcht/index.org
+++ /dev/null
@@ -1,114 +0,0 @@
-#+title: Half-Broken Car in Heavy Traffic
-#&summary
-An esoteric programming language with compiler/interpreter
-#&
-#+license: wtfpl
-#+startup: showall
-#&toc
-
-* Half-Broken Car in Heavy Traffic
-
-Half-Broken Car in Heavy Traffic is a difficult programming language with only
-5 combined operators and direction "signs" for 2D grids.
-
-hbcht is a Python 3.1+ combined compiler/interpreter for the language.
-
-** Example program
-
-#+BEGIN_SRC
-; Increment the first memory cell once without changing the other cells.
-
- > ^ <
- > v <
- #
- ^< >
- ^
- ^ ^<>
- ^
- > ^<
- ^
- > v < o v
- v
- v
- < > v
- v v
- v v
- v v
- v v
- > ^ <
-#+END_SRC
-
-When compiled, this can be called as
-: ./test 51
-which will return
-: 0: 52
-because 51 + 1 = 52.
-
-** Language documentation
-
-This is the official documentation of HBCHT.
-
-HBCHT is a 2D grid-based programming language. You are a car fighting to get to
-the exit of a very chaotic highway. You have to follow the signs, but whenever
-you do that, you also change your memory. The value of your current memory cell
-can be incremented or decremented and your memory cell index can change. You
-can also find signs that tell you to turn either right or not turn at all,
-depending on your memory.
-
-The car can drive in four directions: up, right, down, and left. Because of the
-chaos, you never know which direction the car is headed when the program
-starts. This makes it easy to randomize the output.
-
-To make things worse (actually, it's to make programming in HBCHT possible),
-you cannot turn left because your car is half-broken. You can drive straight
-ahead, you can turn right, and you can reverse.
-
-*** Markers
-
-: o car
-: # exit, return/print
-
-*** Operations
-
-: > go right, next memory cell
-: < go left, previous memory cell
-: ^ go up, increment
-: v go down, decrement
-: / go right if the current memory cell has the same value as the previous
-: memory cell, else continue (if the previous memory cell does not exist,
-: its value is zero)
-
-*** Rules
-
-+ There can be only one car and only one exit
-+ The car cannot turn left; any relative left turns will be ignored along with
- their memory effects
-+ The program always starts at memory cell #0
-+ All memory cells have the value 0 by default
-+ Input values cannot be negative, but values returned by a program can
-+ The car cannot go out of bound; if it exits to the right, it reenters to the
- left, etc.
-+ Values cannot be input to memory cells below memory cell #0, but the program
- can set values in these
-+ Values can be arbitrarily large. An interpreter or compiler without this
- feature is valid, but not perfect (note that hbcht's C translator uses
- 32-bit ints and is thereby not perfect).
-
-A semicolon denotes a comment. Anything from the semicolon to the end of the
-line is ignored.
-
-If a program file contains a line that starts with =@intext=, it will see
-input as text and convert the text to ordinals before running the core
-function.
-
-If a program file contains a line that starts with =@outtext=, it will show
-output as a text string instead of a list of numbers.
-
-
-** Download
-
-hbcht is released under the WTFPL. [[hbcht-0.1.1.tar.gz][Download]].
-
-hbcht can also be found in the [[http://pypi.python.org/pypi/hbcht][Python Package Index]]. hbcht has its code at
-Gitorious; see [[http://gitorious.org/hbcht]].
-
diff --git a/site/projects/htmlentitiesdecode/htmlentitiesdecode-0.1.0.tar.gz b/site/projects/htmlentitiesdecode/htmlentitiesdecode-0.1.0.tar.gz
deleted file mode 100644
index e884470..0000000
Binary files a/site/projects/htmlentitiesdecode/htmlentitiesdecode-0.1.0.tar.gz and /dev/null differ
diff --git a/site/projects/htmlentitiesdecode/htmlentitiesdecode-0.1.1.tar.gz b/site/projects/htmlentitiesdecode/htmlentitiesdecode-0.1.1.tar.gz
deleted file mode 100644
index be55319..0000000
Binary files a/site/projects/htmlentitiesdecode/htmlentitiesdecode-0.1.1.tar.gz and /dev/null differ
diff --git a/site/projects/htmlentitiesdecode/index.org b/site/projects/htmlentitiesdecode/index.org
deleted file mode 100644
index da5c7d9..0000000
--- a/site/projects/htmlentitiesdecode/index.org
+++ /dev/null
@@ -1,17 +0,0 @@
-#+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
deleted file mode 100644
index 76ad0be..0000000
Binary files a/site/projects/img/aeltei.png and /dev/null differ
diff --git a/site/projects/img/alart.png b/site/projects/img/alart.png
deleted file mode 100644
index d869bca..0000000
Binary files a/site/projects/img/alart.png and /dev/null differ
diff --git a/site/projects/img/algo.png b/site/projects/img/algo.png
deleted file mode 100644
index 754a3c7..0000000
Binary files a/site/projects/img/algo.png and /dev/null differ
diff --git a/site/projects/img/alp.png b/site/projects/img/alp.png
deleted file mode 100644
index 0592e47..0000000
Binary files a/site/projects/img/alp.png and /dev/null differ
diff --git a/site/projects/img/an5w.png b/site/projects/img/an5w.png
deleted file mode 100644
index 26f5cb1..0000000
Binary files a/site/projects/img/an5w.png and /dev/null differ
diff --git a/site/projects/img/aug.png b/site/projects/img/aug.png
deleted file mode 100644
index d6a6516..0000000
Binary files a/site/projects/img/aug.png and /dev/null differ
diff --git a/site/projects/img/badracing.png b/site/projects/img/badracing.png
deleted file mode 100644
index 0d4f109..0000000
Binary files a/site/projects/img/badracing.png and /dev/null differ
diff --git a/site/projects/img/bsq.png b/site/projects/img/bsq.png
deleted file mode 100644
index 6c4508f..0000000
Binary files a/site/projects/img/bsq.png and /dev/null differ
diff --git a/site/projects/img/canvas.png b/site/projects/img/canvas.png
deleted file mode 100644
index f021112..0000000
Binary files a/site/projects/img/canvas.png and /dev/null differ
diff --git a/site/projects/img/cln.png b/site/projects/img/cln.png
deleted file mode 100644
index 9aa17b4..0000000
Binary files a/site/projects/img/cln.png and /dev/null differ
diff --git a/site/projects/img/desurveil.png b/site/projects/img/desurveil.png
deleted file mode 100644
index 11bb087..0000000
Binary files a/site/projects/img/desurveil.png and /dev/null differ
diff --git a/site/projects/img/dililatum.png b/site/projects/img/dililatum.png
deleted file mode 100644
index 9f0dee8..0000000
Binary files a/site/projects/img/dililatum.png and /dev/null differ
diff --git a/site/projects/img/dungeoncrawl.png b/site/projects/img/dungeoncrawl.png
deleted file mode 100644
index 8e2095a..0000000
Binary files a/site/projects/img/dungeoncrawl.png and /dev/null differ
diff --git a/site/projects/img/electruth.png b/site/projects/img/electruth.png
deleted file mode 100644
index 370eb30..0000000
Binary files a/site/projects/img/electruth.png and /dev/null differ
diff --git a/site/projects/img/enigma.png b/site/projects/img/enigma.png
deleted file mode 100644
index 0983f6e..0000000
Binary files a/site/projects/img/enigma.png and /dev/null differ
diff --git a/site/projects/img/eonaton.png b/site/projects/img/eonaton.png
deleted file mode 100644
index 3429781..0000000
Binary files a/site/projects/img/eonaton.png and /dev/null differ
diff --git a/site/projects/img/evolution.png b/site/projects/img/evolution.png
deleted file mode 100644
index 8c13f1e..0000000
Binary files a/site/projects/img/evolution.png and /dev/null differ
diff --git a/site/projects/img/exoskelegram.png b/site/projects/img/exoskelegram.png
deleted file mode 100644
index d4aad63..0000000
Binary files a/site/projects/img/exoskelegram.png and /dev/null differ
diff --git a/site/projects/img/films.png b/site/projects/img/films.png
deleted file mode 100644
index 3e0cb4a..0000000
Binary files a/site/projects/img/films.png and /dev/null differ
diff --git a/site/projects/img/forbi.png b/site/projects/img/forbi.png
deleted file mode 100644
index 885f57e..0000000
Binary files a/site/projects/img/forbi.png and /dev/null differ
diff --git a/site/projects/img/forestquest.png b/site/projects/img/forestquest.png
deleted file mode 100644
index 5de8d1f..0000000
Binary files a/site/projects/img/forestquest.png and /dev/null differ
diff --git a/site/projects/img/gravnoise.png b/site/projects/img/gravnoise.png
deleted file mode 100644
index cf033e0..0000000
Binary files a/site/projects/img/gravnoise.png and /dev/null differ
diff --git a/site/projects/img/gt3000.png b/site/projects/img/gt3000.png
deleted file mode 100644
index e8e5bca..0000000
Binary files a/site/projects/img/gt3000.png and /dev/null differ
diff --git a/site/projects/img/hbcht.png b/site/projects/img/hbcht.png
deleted file mode 100644
index b933cb3..0000000
Binary files a/site/projects/img/hbcht.png and /dev/null differ
diff --git a/site/projects/img/indirectassassin.png b/site/projects/img/indirectassassin.png
deleted file mode 100644
index 7787ca9..0000000
Binary files a/site/projects/img/indirectassassin.png and /dev/null differ
diff --git a/site/projects/img/jap.png b/site/projects/img/jap.png
deleted file mode 100644
index 9ecba4f..0000000
Binary files a/site/projects/img/jap.png and /dev/null differ
diff --git a/site/projects/img/kvigall.png b/site/projects/img/kvigall.png
deleted file mode 100644
index 8c3679e..0000000
Binary files a/site/projects/img/kvigall.png and /dev/null differ
diff --git a/site/projects/img/magicng.png b/site/projects/img/magicng.png
deleted file mode 100644
index 7c318eb..0000000
Binary files a/site/projects/img/magicng.png and /dev/null differ
diff --git a/site/projects/img/mege.png b/site/projects/img/mege.png
deleted file mode 100644
index 5976acc..0000000
Binary files a/site/projects/img/mege.png and /dev/null differ
diff --git a/site/projects/img/movact.png b/site/projects/img/movact.png
deleted file mode 100644
index 9636fc7..0000000
Binary files a/site/projects/img/movact.png and /dev/null differ
diff --git a/site/projects/img/naghni.png b/site/projects/img/naghni.png
deleted file mode 100644
index 8965d6c..0000000
Binary files a/site/projects/img/naghni.png and /dev/null differ
diff --git a/site/projects/img/natur.png b/site/projects/img/natur.png
deleted file mode 100644
index 70676e0..0000000
Binary files a/site/projects/img/natur.png and /dev/null differ
diff --git a/site/projects/img/nohix.png b/site/projects/img/nohix.png
deleted file mode 100644
index 0f5895d..0000000
Binary files a/site/projects/img/nohix.png and /dev/null differ
diff --git a/site/projects/img/noncrawl.png b/site/projects/img/noncrawl.png
deleted file mode 100644
index 5d9e553..0000000
Binary files a/site/projects/img/noncrawl.png and /dev/null differ
diff --git a/site/projects/img/pedro.png b/site/projects/img/pedro.png
deleted file mode 100644
index 681a74b..0000000
Binary files a/site/projects/img/pedro.png and /dev/null differ
diff --git a/site/projects/img/pictures.png b/site/projects/img/pictures.png
deleted file mode 100644
index b5fb490..0000000
Binary files a/site/projects/img/pictures.png and /dev/null differ
diff --git a/site/projects/img/pumila.png b/site/projects/img/pumila.png
deleted file mode 100644
index 4e3041c..0000000
Binary files a/site/projects/img/pumila.png and /dev/null differ
diff --git a/site/projects/img/roptoligs.png b/site/projects/img/roptoligs.png
deleted file mode 100644
index 11a16f8..0000000
Binary files a/site/projects/img/roptoligs.png and /dev/null differ
diff --git a/site/projects/img/sadbipws.png b/site/projects/img/sadbipws.png
deleted file mode 100644
index f2f9111..0000000
Binary files a/site/projects/img/sadbipws.png and /dev/null differ
diff --git a/site/projects/img/shadowloss.png b/site/projects/img/shadowloss.png
deleted file mode 100644
index 431a808..0000000
Binary files a/site/projects/img/shadowloss.png and /dev/null differ
diff --git a/site/projects/img/simplechat.png b/site/projects/img/simplechat.png
deleted file mode 100644
index c6a7ab6..0000000
Binary files a/site/projects/img/simplechat.png and /dev/null differ
diff --git a/site/projects/img/snake.png b/site/projects/img/snake.png
deleted file mode 100644
index 46c9cfa..0000000
Binary files a/site/projects/img/snake.png and /dev/null differ
diff --git a/site/projects/img/sq.png b/site/projects/img/sq.png
deleted file mode 100644
index 0a9742f..0000000
Binary files a/site/projects/img/sq.png and /dev/null differ
diff --git a/site/projects/img/suum.png b/site/projects/img/suum.png
deleted file mode 100644
index 7b4b5cf..0000000
Binary files a/site/projects/img/suum.png and /dev/null differ
diff --git a/site/projects/img/totxt.png b/site/projects/img/totxt.png
deleted file mode 100644
index af90b29..0000000
Binary files a/site/projects/img/totxt.png and /dev/null differ
diff --git a/site/projects/img/wontofor.png b/site/projects/img/wontofor.png
deleted file mode 100644
index 760ba62..0000000
Binary files a/site/projects/img/wontofor.png and /dev/null differ
diff --git a/site/projects/img/words.png b/site/projects/img/words.png
deleted file mode 100644
index 41e5f05..0000000
Binary files a/site/projects/img/words.png and /dev/null differ
diff --git a/site/projects/img/wordwork.png b/site/projects/img/wordwork.png
deleted file mode 100644
index 9113fbd..0000000
Binary files a/site/projects/img/wordwork.png and /dev/null differ
diff --git a/site/projects/img/yelljfish.png b/site/projects/img/yelljfish.png
deleted file mode 100644
index 4f1efaa..0000000
Binary files a/site/projects/img/yelljfish.png and /dev/null differ
diff --git a/site/projects/img/zita.png b/site/projects/img/zita.png
deleted file mode 100644
index 42b111d..0000000
Binary files a/site/projects/img/zita.png and /dev/null differ
diff --git a/site/projects/index.org b/site/projects/index.org
deleted file mode 100644
index a6e3e50..0000000
--- a/site/projects/index.org
+++ /dev/null
@@ -1,246 +0,0 @@
-#+title: Projects
-#&summary
-Where all my projects are listed.
-#&
-#+startup: showall
-#&fullpage
-#&toc
-
-* Projects
-
-{See [[http://git.metanohi.name/]] for my projects.}&large
-
-
-* Webcomic
-
-My inactive webcomic is at [[http://suum.metanohi.name/]].
-
-
-* Miscellaneous
-
-This section is old and unmaintained but contains some projects and information
-not found elsewhere.
-
-#++exec
-#+BEGIN_SRC python3
- top_projs = (
- ('aug', 'AUG', "Applicative Universal Grammar", 'http://git.metanohi.name/aug.git/'),
- ('badracing', 'Bad Racing', "Extremely poor racing game", 'http://git.metanohi.name/badracing.git/'),
- 'indirectassassin',
- 'magicng',
- ('suum', 'SUUM', 'Webcomic drawn in the art style of banal naivism ',
- 'http://suum.metanohi.name/'),
- 'gravnoise',
- 'hbcht',
- 'mege',
- 'aeltei',
- 'alart',
- 'shadowloss',
- 'alp',
- 'electruth',
- ('films', 'nohifilms', "Niels' films", 'http://films.metanohi.name/'),
- ('nohix', 'nohiX', 'Small web experiments, some of them useful', 'http://nohix.metanohi.name/'),
- ('natur', "Niels' Nature", 'Watch Niels as he spouts nonsense about nature', 'http://nature.metanohi.name/'),
- )
-
- other_projs = (
- 'luncheon',
- 'textmation',
- 'beepfun',
- ('ticso', 'Create dynamic functions in C uglily', 'https://gitorious.org/ticso'),
- 'zebralligator',
- 'kando',
- 'bolg',
- 'pebsaq',
- 'minmailist',
- ('drget', 'Get media from Danmarks Radio', 'https://gitorious.org/drget'),
- ('folketingetmeninger',
- 'A small Python script to download and show the opinions of the Danish parties',
- 'http://projects.metanohi.name/misc/folketingetmeninger.py.gz'),
- 'nanonote',
- 'totxt',
- ('pdfsplit', 'A small Python script to split PDF files on a page-basis',
- 'http://projects.metanohi.name/misc/pdfsplit.tar.gz'),
- 'dotbox',
- 'vit',
- ('raipaw', 'A pseudo-random IPA word generator.',
- 'http://projects.metanohi.name/misc/raipaw.py.gz'),
- ('woiwo', 'Find words in words',
- 'http://projects.metanohi.name/misc/woiwo.py.gz'),
- ('resistorpair', 'Calculate which standard resistors to use for a specific resistance',
- 'http://projects.metanohi.name/misc/resistorpair.py.gz'),
- 'qvikconfig',
- 'htmlentitiesdecode',
- ('gadon', 'Creates scary cirle animations reminiscent of heartbeats',
- 'http://projects.metanohi.name/misc/gadon.tgz'),
- ('colchs', 'A simple GTK color chooser',
- 'http://projects.metanohi.name/misc/colchs.tgz'),
- ('Japanese web apps', 'Javascript/CSS experiments with a theme',
- 'http://projects.metanohi.name/jap/'),
- ('wikiaq', 'A quiz system using Wikipedia articles',
- 'http://projects.metanohi.name/misc/wikiaq-0.1.tar.gz'),
- ('BiBBoB 0.1.1', "A simple sound wave generator (older versions: \
- BiBBoB 0.1 )",
- 'http://projects.metanohi.name/misc/bibbob-0.1.1.tar.gz'),
- ('data2wav', 'Converts all data to sound (and back again)',
- 'http://projects.metanohi.name/misc/data2wav.tgz'),
- ('pitivi-smil', "A workaround to make PiTiVi XPTV files get rendered using \
- Kino. No support for PiTiVi's more advanced features.",
- 'http://projects.metanohi.name/misc/pitivi-smil.tgz'),
- ('googolplex', 'A program that attempts to print one googolplex. \
- If saved to a file, this requires 1 googol + 1 bytes.',
- 'http://projects.metanohi.name/misc/googolplex.c'),
- ('data2png', 'Save data as a png file, and restore the data from the png file.',
- 'http://projects.metanohi.name/misc/data2png.tar.gz'),
- ('stanimate', 'A bash script to aid in the creation of stop motion films.',
- 'http://projects.metanohi.name/misc/stanimate.gz'),
- ('mssrnm (mass rename)', 'A bash script to rename a bunch of files into files \
- "001.jpg", "002.jpg", "003.jpg", etc.',
- 'http://projects.metanohi.name/misc/mmsrnm.gz'),
- )
-
- old_top_projs = (
- 'dungeoncrawl',
- 'pumila',
- 'yelljfish',
- 'exoskelegram',
- 'desurveil',
- 'kvigall',
- 'forestquest',
- 'dililatum',
- 'enigma',
- 'forbi',
- 'naghni',
- 'movact',
- 'noncrawl',
- 'wordwork',
- 'simplechat',
- ('words', 'words', 'Words and sentences. Not a blog.', 'http://words.metanohi.name/'),
- ('pictures', 'Pictures', 'Pictures uploaded by me', 'http://pictures.metanohi.name/'),
- ('eonaton', 'Eon Aton', 'An underdeveloped RPG-style JS system and a story', 'http://projects.metanohi.name/eonaton/'),
- 'zita',
- 'cln',
- ('algo', 'Algo', 'A JavaScript window manager', 'http://projects.metanohi.name/algo/'),
- 'an5w',
- ('canvas', 'Experimenting with canvas', 'Old HTML canvas element experiments', 'http://projects.metanohi.name/canvas/'),
- ('bsq', 'Brainy Stickman Quiz', 'Sidescroller/quiz based on the HTML canvas element', 'http://projects.metanohi.name/bsq/'),
- ('snake', 'JavaScript Snake', 'Arrow keys to move, PageUp and PageDown to adjust speed.', 'http://projects.metanohi.name/snake/'),
- ('gt3000', 'GT 3000', 'Retro JS mini racing game.', 'http://projects.metanohi.name/gt3000/'),
- ('sq', "Satan's Quest", 'Retro RPG-style JS minigame. You are Gabruel.', 'http://projects.metanohi.name/sq/'),
- ('evolution', 'Evolution', 'Notice the intelligence.', 'http://projects.metanohi.name/evolution/'),
- ('roptoligs', 'roptoligs', 'RPG project with planned modules and games',
- 'http://roptoligs.metanohi.name/'),
- )
-
- other_old_projs = (
- 'sadbipws',
- 'bito',
- 'nalgh',
- ('Graphical web experiments',
- "Some of them'll work, while some of them might crash your browser.",
- 'http://projects.metanohi.name/x/'),
- ('cheatbibtex', '''\
- Provides an alternative way of dealing with BiBTeX bibliographies. Use BiBLaTeX
- instead of cheatbibtex (cheatbibtex isn't that great, while BiBLaTeX is quite
- the LaTeX package).''', 'http://projects.metanohi.name/misc/cheatbibtex-0.1.tar.gz'),
- ('dsktp', 'A JS wm like Algo',
- 'http://projects.metanohi.name/dsktp/'),
- ('webCLI', 'A CLI lookalike in JavaScript with XML',
- 'http://projects.metanohi.name/webcli/'),
- 'wontofor',
- ('lapyrint', 'A stupid maze solver. Includes example labyrinths.',
- 'http://projects.metanohi.name/misc/lapyrint.tar.gz'),
- ('poemgen', 'A poem generator using Identi.ca blog posts as its source',
- 'http://projects.metanohi.name/poemgen/'),
- ('problist', "A newbie's way of programming permutations in Python. Kept here for its funny code and misuse of terms",
- 'http://projects.metanohi.name/misc/problist.tar.gz'),
- ('The Life of a Snowman', "Life can be cruel towards snowmen. This is proof.",
- 'http://projects.metanohi.name/snowman/'),
- ('Katten Pedro (Pedro the Cat)', "A comic I drew during a vacation in Mallorca.",
- 'http://projects.metanohi.name/pedro/'),
- ('Misc.', 'Very old stuff.',
- 'http://projects.metanohi.name/misc/'),
- )
-
- #################################
-
- boxtemplate = '''\
-
-
- {title}
-
- {description}
-
- '''
-
- listtemplate = '''\
- {title}
- {description}
- '''
-
- def getparts(name, no_name=False):
- if isinstance(name, tuple):
- if no_name:
- title, desc, url = name
- else:
- name, title, desc, url = name
- else:
- orgpath = misc.get_org_path(os.path.join(page.pathdir, name))
- url = './{name}'.format(name=name)
- if orgpath.endswith('index.org'):
- url += '/'
- a = htmlgen.org_to_abstract(orgpath, isfile=True, only_metadata=True)
- title, desc = a.title, a.summary
- if no_name:
- return title, desc, url
- else:
- return name, title, desc, url
-
- def boxprojs(projs):
- print("")
- for name in projs:
- name, title, desc, url = getparts(name)
- print(boxtemplate.format(name=name, url=url, title=title, description=desc))
- print(' ')
-
- def listprojs(projs):
- print("")
- for name in projs:
- title, desc, url = getparts(name, True)
- print(listtemplate.format(url=url, title=title, description=desc))
- print(' ')
-
-#+END_SRC
-
-** Old
-
-#++exec
-#+BEGIN_SRC python
-boxprojs(top_projs)
-#+END_SRC
-
-#&clear
-** Older
-
-#++exec
-#+BEGIN_SRC python
-boxprojs(old_top_projs)
-#+END_SRC
-
-
-#&clear
-** More older
-
-#++exec
-#+BEGIN_SRC python
-listprojs(other_projs)
-#+END_SRC
-
-
-#&clear
-** Most oldest
-
-#++exec
-#+BEGIN_SRC python
-listprojs(other_old_projs)
-#+END_SRC
diff --git a/site/projects/indirectassassin/IndirectAssassin-0.1.0.tar.gz b/site/projects/indirectassassin/IndirectAssassin-0.1.0.tar.gz
deleted file mode 100644
index fd8ae04..0000000
Binary files a/site/projects/indirectassassin/IndirectAssassin-0.1.0.tar.gz and /dev/null differ
diff --git a/site/projects/indirectassassin/index.org b/site/projects/indirectassassin/index.org
deleted file mode 100644
index d024d38..0000000
--- a/site/projects/indirectassassin/index.org
+++ /dev/null
@@ -1,30 +0,0 @@
-#+title: Indirect Assassin
-#&summary
-Stealthily avoid professors. Turn-based.
-#&
-#+license: gpl 3+, program
-#&toc
-
-* Indirect Assassin
-
-#&img;url=screenshot.png,width=640
-
-#&line
-
-#&pre
-Zombie professors cannot kill them themselves.
-
---README
-#&
-
-** Download
-
-Indirect Assassin is released under GPLv3+. The current version is
-0.1.0. [[IndirectAssassin-0.1.0.tar.gz][Download here]].
-
-
-** Other stuff
-
-I realize my code is not that nice. I hadn't used Haskell before.
-
-My game has been reviewed! See [[http://k3rnel.net/2012/08/23/lpc-game-review-indirect-assassin/]].
diff --git a/site/projects/indirectassassin/screenshot.png b/site/projects/indirectassassin/screenshot.png
deleted file mode 100644
index f51f67d..0000000
Binary files a/site/projects/indirectassassin/screenshot.png and /dev/null differ
diff --git a/site/projects/kando/index.org b/site/projects/kando/index.org
deleted file mode 100644
index 1f1f079..0000000
--- a/site/projects/kando/index.org
+++ /dev/null
@@ -1,22 +0,0 @@
-#+title: kando
-#&summary
-A simple todo list manager with Emacs integration
-#&
-#+license: wtfpl, text
-#+license: apache 2, program
-
-* kando
-
-kando cannot do much. But it can do enough.
-#&-large
-It is a simple todo manager.
-#&
-#&-huge
-[[kando-0.1.0.tar.gz][Download]].
-#&
-
-kando is released under the Apache License, version 2.0.
-
-kando can also be found in the [[http://pypi.python.org/pypi/kando][Python Package Index]].
-
-kando has its code at Gitorious; see [[http://gitorious.org/kando]].
diff --git a/site/projects/kando/kando-0.1.0.tar.gz b/site/projects/kando/kando-0.1.0.tar.gz
deleted file mode 100644
index 06fb4e3..0000000
Binary files a/site/projects/kando/kando-0.1.0.tar.gz and /dev/null differ
diff --git a/site/projects/kvigall/img/kvigall-logo-256.png b/site/projects/kvigall/img/kvigall-logo-256.png
deleted file mode 100644
index 0f4beca..0000000
Binary files a/site/projects/kvigall/img/kvigall-logo-256.png and /dev/null differ
diff --git a/site/projects/kvigall/img/kvigall-logo.svg b/site/projects/kvigall/img/kvigall-logo.svg
deleted file mode 100644
index eee6b4a..0000000
--- a/site/projects/kvigall/img/kvigall-logo.svg
+++ /dev/null
@@ -1,391 +0,0 @@
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- image/svg+xml
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- kvigall
-
-
-
-
-
-
-
-
-
-
-
-
diff --git a/site/projects/kvigall/index.org b/site/projects/kvigall/index.org
deleted file mode 100644
index 4641eff..0000000
--- a/site/projects/kvigall/index.org
+++ /dev/null
@@ -1,24 +0,0 @@
-#+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
deleted file mode 100644
index 85127f2..0000000
Binary files a/site/projects/kvigall/kvigall-0.1.0.tar.gz and /dev/null differ
diff --git a/site/projects/kvigall/mods.org b/site/projects/kvigall/mods.org
deleted file mode 100644
index 012bf14..0000000
--- a/site/projects/kvigall/mods.org
+++ /dev/null
@@ -1,30 +0,0 @@
-#+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]] |
-| scientiacourseplanner | Fetches information from Scientia(R) Course Planner websites | [[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.name][ns@metanohi.name]] if you want to have your mod included on this page. This is
-highly suboptimal.
-
-** Scientia(R) Course Planner
-This mod can show events from more than course together.
-
-** 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/luncheon/index.org b/site/projects/luncheon/index.org
deleted file mode 100644
index 1c0bca3..0000000
--- a/site/projects/luncheon/index.org
+++ /dev/null
@@ -1,18 +0,0 @@
-#+title: LUNCHEON
-#&summary
-A lunch club management system
-#&
-#+license: bysa, text
-
-* LUNCHEON
-
-LUNCHEON is a lunch club management system I develop with two fellow students
-at DIKU.
-
-** Download
-
-There are no LUNCHEON releases as of yet. The current way to download LUNCHEON
-is to clone its git repository: see [[http://gitorious.org/luncheon]].
-
-#LUNCHEON can also be found in the [[http://pypi.python.org/pypi/luncheon][Python Package Index]].
-
diff --git a/site/projects/magicng/index.org b/site/projects/magicng/index.org
deleted file mode 100644
index 7d975b2..0000000
--- a/site/projects/magicng/index.org
+++ /dev/null
@@ -1,290 +0,0 @@
-#+title: MagicNG
-#&summary
-The Next Generation Programming Language
-#&
-#+license: bysa
-#&toc
-
-* Chapter 1: The Future of Yesterday
-
-/Software./
-
-/Magic./
-
-Two seemingly unrelated words. Yet together they form the essentials of the new
-programming language which has already changed how computers and humans interact
-with each other: *MagicNG* (short for Magic: The Next Generation).
-
-*MagicNG* is not your common programming language; it is not biased towards one
- or two paradigms, in fact it uses none of the existing ways of programming:
-
-+ Functional programming is, naturally, much too functional for any magic-based
- programming language, as magic is not /functional/, but
- /magical/. Magic-based software does not require functionality as in something
- being able to do something else, because it depends on magic which /does/
- stuff instead of making sure that /stuff/ can be done; this makes using a
- computer much faster.
-+ Object-oriented programming does not fit very well with the ideas behind
- *MagicNG* either. While the magic-oriented approach /is/ able to properly
- emulate object-oriented ways of doing things, such emulations will often
- require {CMU&abbr='Central Magical Unit'}-expensive conversions from spell
- scrolls to object-based representations.
-+ Procedural programming conflicts with the nature of magic; since in the case
- of magic, advanced heuristics are used run a program, the simple approach of
- procedurally executing commands pales in comparison to the magical
- approach. The same is true for assembly programming and machine programming.
-+ Logic programming is mute. Magic is always above logic. Logic is based on
- magic. Everyone knows that.
-+ Declarative programming is actually the only one of the existing widespread
- paradigms which is even slightly like *magical programming*. Declarative
- programming languages do, however, still base their entire existence on
- deduction and knowledge, both of which are infinitely long below the
- standards of magical programming languages. Deduction and knowledge are for
- programming languages that do not /see/ how everything works, whose authors
- do not understand the connectionabilities of everything.
-
-In short, *MagicNG* employs the *magical programming* paradigm because it is
-superior to non-magical approaches.
-
-
-** But how do I program in it?
-
-The reader should now be comfortable thinking about programming in terms of
-magic and be able to see what a big mistake it was to learn all those outdated,
-logic-based programming languages. The reader might also be a little
-overwhelmed and perhaps confused; but fear not, we will soon take a look at an
-example of MagicNG programming.
-
-Before we get to that, we will go over a few (yes, there are many more) of the
-applications of magical programming, to pique the reader's curiosity.
-
-1. First, there is the temporal improvement. Since magic is independent of the
- flow of time, a program can be run not just everywhere, but
- every{/when/}. This is the sole reason MagicNG is already so popular ---
- someone spread its use many years ago, through several temporal-offset
- MagicNG runs.
-2. Speed. The Central Magical Unit runs programs magically many times faster
- than any CPU in existence. This is possible due both to the previously
- explained effects of magic in programming /and/ what we will come to refer
- as "magic downleveling" in later chapters (since magic cannot be optimized,
- other approaches such as the downleveling approach have been developed).
-3. Code maintenance also becomes much easier, as you will see in the examples
- and excercises.
-
-Now, to our first example. We wish to print to a computer console (on a magical
-computer) the magical string "Hello, world!". This is often accomplished in
-anything from 1 to 100 conventional lines in conventional programming
-languages; in MagicNG, it is not /that/ simple. It's another kind of simple,
-namely the /magic simple/ way, from now on referred to as the /magple/ way.
-
-To write the magple MagicNG code for this example, we first fire up our MagicNG
-interactive interpreter:
-
-#+BEGIN_SRC text
-MagicNG vX
-?
-#+END_SRC
-
-(MagicNG is not being developed because it relies on magic for updates, hence
-the 'X' version.)
-
-(The correct way to program in MagicNG is to write on pergament scrolls, but
-for the beginner it is often easier to write the magical expressions on one's
-computer and then print afterwards.)
-
-The =?= at the prompt means we can type something. Let us try typing the
-following:
-
-#+BEGIN_SRC text
-? one frog eye
-#+END_SRC
-
-What this tells the MagicNG interpreter is that if /it is not the case/ that no
-frog eyes exist in the programmer's vicinity, it will print "Hello,
-world!". The frog-eye detection is only a formality, included in MagicNG to
-make the proofs of magical truth be magically true, and so the sentence can be
-excluded if the programmer wishes so. That is, you could write
-
-#+BEGIN_SRC text
-t
-#+END_SRC
-
-which is short for "one frog eye", and it would have the same effects.
-
-MagicNG programs can be compiled (printed) to scrolls, which can then be used
-independently of a running magical computer.
-
-(Trivia: This was in fact one of the major reasons why the text-based nature of
-MagicNG was chosen over the two other proposed ways of programming: speech and
-jumping. While speech had the advantage that it worked well for people who had
-difficulties writing, history had shown that the human memory was not a good
-place to store information not meant to be changed. And while jumping was good
-for people who were only good at jumping, it was too radical an approach for
-many of the language designers.)
-
-Now, it may not be obvious to the casual non-magician why and how both "one
-frog eye" and "t" eventually prints "Hello, world!". In fact, these two
-expressions are not at all the only ways to print "Hello, world!" --- one can
-also write "traveller with seven legs", "spider queen", or something
-similar. The thing to remember is that it is /the intention/ that counts. If
-you /feel/ that the expression "bonsai of Norway" prints the sum of all
-prime numbers below 4012, then /that is what it does/.
-
-In essence, MagicNG is an *intention-based programming language*. This might at
-first sound like all other programming languages: You have an intention on
-which you base your programming. The difference here is that the intention /is/
-the programming and not just part of it. Once you have figured out what you
-want and written it down in your inner language, magic takes care of the boring
-stuff.
-
-This has the side-effect that all magic is somewhat personal; a scroll written
-by an individual A might yield different results if used by an individual B
-with different intentions than A.
-
-This means that MagicNG has *built-in encryption*.
-
-At this point some might note that this is not good for interoperability. At
-the core of MagicNG, this is true. However, one extraordinary extension has
-been made to MagicNG that makes interoperability both possible and easy:
-MagicIS (short for Magic Intention Serializer).
-
-MagicIS encodes your intention in a magical format, after which the intention
-is compiled along with your program. With MagicIS, a compiled program that
-prints "My name is Niels" might look like this (imagine it compiled on a
-scroll):
-
-#+BEGIN_SRC text
-Holy oak of honey
-,si:pmnin34_=UUe
-#+END_SRC
-
-where the =,si:= part denotes the start of the serialized intention.
-
-The MagicIS extension can be enabled on most MagicNG compilers with a
-command-line option. Note that it will need to be connected to your brain with
-a special magical interface to work.
-
-
-* Chapter 2: Real World Examples
-
-"This is all very nice," you might think, "but what is it any good for?"
-
-MagicNG can be used for everything a typical, non-magical language can be used
-for, the major differences being that MagicNG is per definition faster, better
-and easier to program in. This has been magically proven.
-
-** cat
-
-Consider the UNIX =cat= program. If written in C (even if you look at the Plan
-9 version), there are many lines of source code. If written in Python 3, there
-are 2 lines:
-
-#+BEGIN_SRC python3
-for line in open(filename):
- print(line)
-#+END_SRC
-
-If written in MagicNG, there is _one_ line (/and/ it is magical):
-
-#+BEGIN_SRC text
-cauldron of candy
-#+END_SRC
-
-(without MagicIS enabled.)
-
-
-** Finding a value when a key is known
-
-In a non-magical programming language, you could use a hash map. Or you could
-sort the elements by their keys and use binary search. Or you could look
-through every element one by one.
-
-In MagicNG, no such algorithms are used; /magic/ finds the value. In fact, this
-reveals a large, fascinating and unavoidable part of MagicNG: it does not
-support algorithms.
-
-"No algorithms? But how, then, can I program?" you think. The answer is simple,
-and it has been explained before, but to stress it one last time: /magic/.
-
-This leads us to another important part of MagicNG: its use of the *black box
-model*. The /black box model/ has been revered all over the known universe for
-its unchangeability (it is absolute), unworsenability (since you cannot change
-it, you cannot make it worse), high surprise factor ("who knew my program could
-do /that/?!"), and lack of meaningful error messages (no errors, no worries).
-
-
-** Calculating the sum of a list of numbers
-
-In C:
-
-#+BEGIN_SRC c
-int sum(int xs[], int xs_len) {
- int fin_sum = 0;
- int i;
- for (i = 0; i < xs_len; i++) {
- fin_sum += xs[i];
- }
- return fin_sum;
-}
-
-[...]
-
-sum({1, 3, -2, 9}, 4);
-#+END_SRC
-
-In Python:
-
-#+BEGIN_SRC python3
-sum([1, 3, -2, 9])
-#+END_SRC
-
-In MagicNG:
-
-#+BEGIN_SRC text
-head of Macbeth
-#+END_SRC
-
-
-** A flight simulator
-
-Up until now, we have only looked at MagicNG programs spanning single
-lines. One can create a very powerful MagicNG program in one line, but
-sometimes it can be necessary to use two, or even three lines.
-
-As a flight operator, you may wish to have a very durable and efficient 3D
-flight simulator; in MagicNG such a system can be written concisely in just
-three lines of magical code (four lines with MagicIS enabled).
-
-#+BEGIN_SRC text
-dragon claw polished with golden mead
- mead in cauldron
-tastebuds of 23 pigs
-,si:3=)uUUn!2aa
-#+END_SRC
-
-(Notice the indentation and the explicit number.)
-
-
-/[Chapters 3 through 88 have been excluded in this preview. Only members of
-the Magically Magical Magic Community (MMMC) have access to these chapters.]/
-
-
-* Chapter 89: How to Learn More
-
-To recap: MagicNG is an easy language to learn, since not only does it not
-require the user to learn about algorithms, data structures and related wastes
-of time, but actually discourages that; MagicNG encourages its users to /not
-think/ which /reduces errors/.
-
-To expand your knowledge of MagicNG, both in theory and practice, do not look
-at the examples of other MagicNG programmers, unless you are *absolutely sure*
-that their intentions are the same as yours. You can of course deduce the
-intention from a MagicIS line, but then, if you wish to base a new program on
-the old program, you will have to convert that intention to your own along with
-the actual program, which can be tedious and very difficult (MagicNG is
-actually a very complex language).
-
-What you should do is lean back in a comfy chair and look into nothingness and
-not strain your mind. That way, everything you need to know will come to you
-eventually. That's how this book was written.
-
diff --git a/site/projects/mege/docs/index.org b/site/projects/mege/docs/index.org
deleted file mode 100644
index d0ae3d7..0000000
--- a/site/projects/mege/docs/index.org
+++ /dev/null
@@ -1,315 +0,0 @@
-#+title: mege documentation
-#&summary
-Documentation for the metanohi generator
-#&
-#+license: bysa
-
-#&+classes=warning
-Ooops. It appears this document is not quite finished yet.
-#&
-
-* Quick overview
-
-+ headers
-+ paragraphs
-+ inline modifiers
- + strong, *bold*
- + em, /italic/
- + _underline_
- + combinations
- + xhtml1.1-based
- + acronym
- + abbreviation
- + cite
- + code
- + samp
- + kbd
- + var
- + dfn
- + sub
- + sup
- + del
- + ins
- + q
-+ images
-+ tables
- + head
- + body
- + foot
- + rows
- + cells
-+ lists
- + not numbered
- + numbered
- + definition lists
-+ links
- + with name
- + without name
-+ footnotes
-+ source code highlighting
-+ LaTeX to PNG
-+ xhtml1.1-based block elements
- + video/audio
- + address
- + blockquote
- + pre
- + hr
-+ forms
-
-* Detailed overview
-
-** Headings
-
-\*{1,6}\s*(INLINE)\n?
-
-** Paragraphs
-
-INLINE
-
-** Escaped characters
-
-Syntax: =\c= where c&var is a character.
-
-** Modifiers
-
-In the case of =#&something;args=, default args (defargs) = =[,
-width=width][,height=height][,float=left|right][,align=left|right|center][,classes=class1
-class2...][,caption=caption]=.
-
-** Inline modifiers
-
-*** Strong/bold
-
-Signal *importance*. Syntax: =*INLINE*=
-
-HTML equivalent:
-#+BEGIN_SRC html
-INLINE
-#+END_SRC
-
-*** Emphasize/italic
-
-/Emphasize/ something. Syntax: =/INLINE/=
-
-HTML equivalent:
-#+BEGIN_SRC html
-INLINE
-#+END_SRC
-
-*** Underline
-
-_Underline_ something. Syntax: =_INLINE_=
-
-HTML equivalent:
-#+BEGIN_SRC html
-INLINE
-#+END_SRC
-
-*** Generic modifiers and groups
-
-Text with spaces can be put in ={= and =}= brackets to function as a group. The
-ampersand (&) character is commonly used after something, as in =&var= or
-=&color=red=, which can also be combined to things like =&var,color=red=. A
-two-part modifier like the =~= in =*bold*= must be preceded by nothing or a
-space character, and it must be followed by another space character, a period,
-a comma, an exclamation mark, a question mark, a semicolon, a colon, or
-something similar. If this is not enough, further abstractions are possible
-with the =#&code= + newline + text + newline + =#&= construct.
-
-The *text is strongly emphasized* and in one paragraph.
-
-The
-#&-strong
-text is strongly emphasized
-#&
-but it's still just in one paragraph even though the =*...*= modifier wasn't
-used. Inline modifiers cannot be nested, but block modifiers can.
-
-This construct must be used in cases where the data is not inline.
-
-*** Acronym, abbreviation, variable, definition
-
-Describe an acronym, an abbreviation, a variable, or a definition. Syntax:
-=text&(abbr|acro)(=meaning)?= or =text&(var|dfn)=.
-
-Example 1: =mege&abbr\='metanohi generator'= equals mege&abbr='metanohi
-generator'.
-
-Example 2: ={A. B.}&acro=AlBook= equals {A. B.}&acro=AlBook.
-
-HTML equivalents: =acronym[INLINE] =&html,
-=abbreviation[INLINE] =&html,
-=variable[INLINE] =&html, and =definition[INLINE] =&html.
-
-*** Quouting and citing
-
-Quote without citing: =a^2+b^2=c^2"e=.
-
-Cite without quoting: =http://en.wikipedia.org/&cite=.
-
-Quote and cite: ={metanohi exists}&cite=http://metanohi.name/=.
-
-HTML equivalent:
-#+BEGIN_SRC html
-quote[INLINE]
-#+END_SRC
-
-*** Code
-
-Syntax: ==code== or ={=code\=}&lang=. Example: ==print('hi')==,
-==print('hi')\=&py3=. If you do not specify a language, the code will not be
-highlighted.
-
-Sample output from a program, with the syntax =~sample~= uses the same
-logic.
-
-*** Keyboard
-
-Describe keyboard shortcuts (mainly). Syntax: -shortcut-.
-
-Examples: -C-f-, -C-u C-u M-x C-q s-y s-f M-C-n M-C-S-k- (I don't have this
-keybinding), -Ctrl+Alt+U-, etc.
-
-HTML:
-#+BEGIN_SRC html
-shortcut
-#+END_SRC
-
-*** Subscript and superscript
-
-To achieve something like CH_{3}CO_{2}^{3-} or x_{new} = 2^{50} without
-resorting to math mode, use the =^= character for superscripts and the =_=
-character for subscripts. Bracket groups must be used. Note that this is
-different from LaTeX.
-
-
-*** del, ins
-
-=text&del=, =text&ins= = text&del, text&ins.
-
-*** Other modifiers
-
-Sizes: tiny, small, medium (normal), large, huge. Syntax: =text&size=,
-eg. =text&large=.
-
-Color: =text&color=color=.
-
-More than one modifier: =&dfn&color=green=.
-
-
-*** Combinations
-
-..are allowed. However, a certain logic applies. It will not be explained
-here. It is not yet well-defined.
-
-
-** Video/audio
-
-Syntax: =#&video|audio;url='...'[, autoplay][defargs]=
-
-** Images
-
-Syntax for images in blocks: =#&img;url='...',alt='...'[defargs]=.
-
-** Blockquote, address, preformatted text
-
-Indent a blockquote or specify an address or show text without
-post-formatting. Syntax:
-
-#+BEGIN_SRC
-#&block[;cite='url']
-paragraphs
-#&
-#+END_SRC
-
-#+BEGIN_SRC
-#&address
-address
-#&
-#+END_SRC
-
-#+BEGIN_SRC
-#&pre
-This is
- pre-formatted *text*, though not entirely
-#&
-#+END_SRC
-
-Note: The effect achieved by =#&pre= can also be achieved in another way.
-
-** Block container (div)
-
-#+BEGIN_SRC
-#&+[args]
-blah
-#&
-#+END_SRC
-
-** Line (hr)
-
-Syntax: =#&line=
-
-** Links
-
-Syntax: =[[url]]= or =[[url][name]]=.
-
-** Footnotes
-
-Syntax: =This is a footnote[fn:serup2011].=, and:
-
-=[fn:serup2011] It's true!=
-
-** Lists
-
-Same as Org-Mode.
-
-** Tables
-
-Same as Org-Mode.
-
-** Python execution and evaluation
-
-Inline, it's =<&eval ... &>=, =<&exec ... &>=, =<&deval ... &>=, and =<&dexec
-... &>=. For blocks, see below.
-
-** Source code
-
-Begin with =#+BEGIN_SRC[ language]= and end with =#+END_SRC=. If nothing or
-=#++high= comes before =#+BEGIN_SRC=, highlight the source code. If =#++show=
-comes before, just show it (useful for HTML, JavaScript and CSS code). to show
-inline HTML code, use the =<@html CODE@>= construct. If =#++pre=, show it, but
-only use inline formatting. If =#++exec=, evaluate it as Python code. If
-=#++dexec=, do the same thing, but do it whenever the site is reloaded
-("dynamic exec"). =#++eval= and =#++deval= can also be used.
-
-** Math
-
-Inline math: =$LaTeX$=, example: $\frac{32}{x} = 8 \Rightarrow x \neq \infty$.
-
-Block math: =#&math\nLaTeX\n#&=.
-
-** Forms
-
-Only accesible via the dynamic execution constructs (at some point --- not
-implemented yet).
-
-* Special features
-
-+ The =#+...= construct works for single lines only
-+ The =#&...= construct along with =#&= to end it can last over several lines
-+ The =#++...= construct can add instructions to a =#+...= construct if the
- =#++= is placed just above the =#+=.
-
-* Special variables
-
-Formatting is not accepted in the following variables.
-
-+ Title if =#+title:TITLE= is specified
-+ Summary if =#+summary:SUMMARY= or =#&summary\n...\n#&= is specified
-+ Table of contents if =#&toc= is specified
-+ Levels in a table of contents defaults to 3, different if =#+toclvl:lvl= is
- specified
-+ Full page if =#&fullpage= is specified
-+ License added if =#+license:LICENSEID[, covering what]= is specified (several
- licenses can be specified)
-
diff --git a/site/projects/mege/index.org b/site/projects/mege/index.org
deleted file mode 100644
index 99873e4..0000000
--- a/site/projects/mege/index.org
+++ /dev/null
@@ -1,37 +0,0 @@
-#+title: mege
-#&summary
-mege is the generator used by metanohi
-#&
-#+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]]
-
-Both are works in progress, like mege. Note that the author of mege does
-believe in good documentation. And while believing is not the same as doing,
-good mege documentation /will/ exist at some point in {the near}&del a future.
-
-*Note:* The part of mege that generates HTML from Org-Mode files works quite
-well (surprisingly well, actually), but code-wise and design-wise it is not
-great. In Danish, such code is called /slamkode/ which literally means
-something like {/garbage/}/{/excrement code/} (I don't know the exact
-translation of the "slam" I'm thinking of, but it's the stuff you'll find in
-sewers). This part will have to be rewritten at some point, possibly to factor
-in support for a new markup language meant to replace the current, somewhat
-strange Org-Mode-my-mode mix.
-
-* Download
-
-No release is out yet. You can clone the current code with git (always
-up-to-date):
-
-: $ git clone git://metanohi.name/mege
-
diff --git a/site/projects/mege/tests/audio.org b/site/projects/mege/tests/audio.org
deleted file mode 100644
index d104361..0000000
--- a/site/projects/mege/tests/audio.org
+++ /dev/null
@@ -1,9 +0,0 @@
-#+title: Test of mege audio
-#+license: bysa
-#+summary: How to show audio in mege
-
-* Test of mege audio
-
-#&audio;url=test2.ogg
-
-([[http://commons.wikimedia.org/wiki/File:Polish_Tongue_twister_-_Korale.ogg]], CC BY-SA)
diff --git a/site/projects/mege/tests/basics.org b/site/projects/mege/tests/basics.org
deleted file mode 100644
index b56d1b3..0000000
--- a/site/projects/mege/tests/basics.org
+++ /dev/null
@@ -1,209 +0,0 @@
-#+title: Test of basic mege features
-#&summary
-Test of mege's most important and most commonly used features
-#&
-#+license: bysa
-
-* Test of basic mege features
-*mege* has many features. A bit /too/ many, perhaps.
-
-Remember to visit [[<@eval page.locurl@>.org]] to see the source of this document.
-
-
-** Basic inline formatting
-
-This is a paragraph.
-
-This is a *paragraph* with the last word *strongly* /emphasized/. _This_ is
-underlined. _/*The effects*/ can /be/ combined_. Press -C-n- to scroll down if
-your web browser is Conkeror (-Ctrl+N- in non-emacs speak).
-
-Type this: =$ echo echo=
-
-** Extended inline formatting
-
-mege uses postfix operators for less essential inline formatting.
-
-More&strong strong text&samp. And even acronyms and abbreviations:
-GNU&acro="GNU's not UNIX" and MF&abbr="Medlem af Folketinget". {Other
-colors}&color=red and {other sizes}&small as well, {and {also
-(really)}&color=green combinations}&large.
-
-Now subtract y&var from x&var - 2^{32}. And a definition: {An integer above 0
-is above -1_{a number}}&dfn. {Typewriter *text*}&tt.
-
-
-** Lists
-
-+ A
-+ B
-+ C
-
-Another list:
- + The text of this line actually takes up two lines in its source form, and
- not just one.
- + Just one line
- + A sublist
- + with another entry
- 1. and so on
- 2. etc.
- 1. ouoiaou
- 2. ouaoiu
- 1. oaiaou
- + continuing
-
-** Definition lists
-+ Lizard :: an animal
-+ Ape :: also an animal
-+ Book :: not an animal
- + Other books :: in existence
- + fail
-+ aoa :: auoua oeu aou oe o u ouaoe uaoe uo uaoura oeu euao aoe aoe u au oo uo
- uoe uo oe u,. uoeauoe uoa u,u
-
- * a
- * 3u :: o (correct behaviour)
-
-** Images
-#&img;url=test0.png, width=270, float=right, \
-#&caption='A test picture'
-
-#+caption: A test picture \
-#+with a caption on two lines
-#&img;url=test0.png, width=240, float=right
-
-#&caption
-A test picture
-#&
-#&img;url=test0.png, width=210, float=right
-#&clear
-
-** Links
-
-Here is a link: [[http://example.com/][Wizard's webpage]]. And a shorter one: [[http://example.com/]]! I
-want to _underline_ this link: [[http://example.com/]]&underline.
-
-** Block containers
-
-Blockquote:
-
-#&block
-Hello.
-#&
-
-*** Combination
-#&+large
-#&block
-This is a paragraph inside a blockquote inside a block container. This is
-escaped:
-\#&
-#&
-#&
-
-** Inline container
-abc
-#&-strong,tiny,color=red
-def
-
-(no new paragraph)
-#&
-ghi.
-
-** Inline modifiers
-
-This is a bt&acro='brutal test' of mege. More {bru te}&abbr='brutal testing'...
-
-+ In a list
-+ Not escaped: x&var, escaped: x\&var, not escaped in group: {x}&var, escaped
- in group: {x}\&var. ns@metanohi.name ua
-
-Nested groups: {{ab{ula aa}&abbr=a cd}&var&color=red cd}&acro
-
-** Inline inline formatting
-
-*mege*. /mege/ ... _mege_, {=mege mege=}&html. ~mege~! -C-f-?
-
-Fail: ~mege ~, *meg*e, solution: {{mege }&samp}, {meg&strong}e
-
-Nested fail: */oo/ aub.
-
-{{a&strong}&emph}, {a&strong&emph}
-
-A */_woo_/*!
-
-
-** Tables
-*** Body only
-| Name | Age |
-| Xryurg | 300 |
-| Bkrau | 2 |
-*** With head and foot
-| Name | Age |
-|--------+-----|
-| Xryurg | 300 |
-| Bkrau | *2* |
-|--------+-----|
-| Name | Age |
-
-** Footnotes
-
-This sentence is true[fn:true]. This is /not/[fn:false].
-
-[fn:true] Master of Truthfulness, 1997
-[fn:false] Master of Truthfulness, 1999, /revised ed./, with special
-introduction by the Master of Falsefulness
-
-\[fn:false] Master of Truthfulness, 1999, revised ed.
-
-** Subscript and superscript
-
-x_{tallyho} = 33^{12}, escaped: x_\{tallyho} = 33^\{12}
-
-** Math
-
-Inline: $2\neq3$, block:
-
-#&math
-\begin{align*}
-\frac{dy}{dx} = 2x
-\end{align*}
-#&
-
-** Code
-
-: ver *ba* tim
-: auoiao =aa
-
-
-#++pre
-: ver *ba* tim /aa/
-: abc
-
-
-** Eval'd Code
-Inline code: <@eval 2 + 3@>. <@exec print('aha')
-
-Inline code:
-#&-eval
-2 + 3
-#&
-
-Block code:
-#++eval
-#+BEGIN_SRC python
-2 + 3
-#+END_SRC
-
-Inline HTML: <@html strong text @>. Smiley: '_~
-
-* Org features not supported by mege
-
-** In lists
-#+BEGIN_SRC
-10. [&10]Starting at 10
-11. ABC
-40. [&40]Going to 40
-41. 2+2=4
-#+END_SRC
-
-And more.
diff --git a/site/projects/mege/tests/code.org b/site/projects/mege/tests/code.org
deleted file mode 100644
index 8e206f3..0000000
--- a/site/projects/mege/tests/code.org
+++ /dev/null
@@ -1,115 +0,0 @@
-#+title: Test of mege code
-#&summary
-Code in mege
-#&
-#+license: bysa
-
-* Test of mege code
-
-While the <@eval macros.titlelink('basics')@> does include code,
-this test contains more. And all of it's different.
-
-** Shown, but not highlighted
-
-*** Without formatting
-
-Inline: =while [ 1 ] ; do echo y ; done=, simple.
-
-: echo Hello
-
-: if hello:
-: print('Hello')
-
-: wget *url*
-
-#+BEGIN_SRC
-cond = source and not highlighted
-#+END_SRC
-
-*** With formatting
-
-#++pre
-: wget *url*
-
-#&pre
-*Preformatted* but still [[http://en.wikipedia.org/wiki/Monospace][monospace]]
-{Escaped}&strong!
-#&
-
-#++pre
-#+BEGIN_SRC
-*Preformatted* but still [[http://en.wikipedia.org/wiki/Monospace][monospace]]
-{Escaped}&emph!
-#+END_SRC
-
-Inline: =while [ 1 ] ; /do/ echo y ; done=&tt, messy.
-
-** Shown and highlighted
-
-#++sh
-: x=32
-: echo $x
-
-#+BEGIN_SRC python
-cond = source and highligted
-print(cond)
-#+END_SRC
-
-Inline: =abc
=&html.
-
-** HTML
-
-#+BEGIN_SRC html
-au
-#+END_SRC
-The above code equals:
-
-#++show
-#+BEGIN_SRC html
-au
-#+END_SRC
-
-Inline HTML: <@html strong text @>.
-
-** JavaScript, CSS
-
-#+BEGIN_SRC javascript
- window.addEventListener('load', function(event){
- tempobj = document.getElementById('tempobj');
- tempobj.addEventListener(
- 'click', function(event){tempobj.innerHTML += 'A';}, false);
- }, false);
-#+END_SRC
-
-# Make mege load it
-#++show
-#+BEGIN_SRC javascript
- window.addEventListener('load', function(event){
- tempobj = document.getElementById('tempobj');
- tempobj.addEventListener(
- 'click', function(event){tempobj.innerHTML += 'A';}, false);
- }, false);
-#+END_SRC
-
-
-** Eval'd Code
-Inline code: =<@eval 2 + 3@>= = <@eval 2 + 3@>.
-
-Inline code:
-#&-eval
-2 + 3
-#&
-
-Block code:
-
-#¶graph
-#++eval
-#+BEGIN_SRC python
-2 + 3
-#+END_SRC
-
-#¶graph
-#++dexec
-#+BEGIN_SRC python
-print('Date :', datetime.datetime.utcnow())
-#+END_SRC
diff --git a/site/projects/mege/tests/index.org b/site/projects/mege/tests/index.org
deleted file mode 100644
index fe630b9..0000000
--- a/site/projects/mege/tests/index.org
+++ /dev/null
@@ -1,22 +0,0 @@
-#+title: mege tests
-#+license: bysa
-#+summary: Links to tests of mege
-
-* mege tests
-
-Yes, I know. I cannot hide it. *mege*, the otherwise brilliant engine that
-channels its powers into metanohi, is not perfect. It was created by a human
---- and humans are known to be imperfect.
-
-To make sure its html generation is working properly, the following test pages
-have been created:
-
-+ [[basics][Basics]]
-+ [[tables][Tables]]
-+ [[math][Math]]
-+ [[code][Code]]
-+ [[video][Video]]
-+ [[audio][Audio]]
-
-Perhaps /mege/ will grow and come near to perfection one day.
-
diff --git a/site/projects/mege/tests/math.org b/site/projects/mege/tests/math.org
deleted file mode 100644
index a39d64f..0000000
--- a/site/projects/mege/tests/math.org
+++ /dev/null
@@ -1,39 +0,0 @@
-#+title: Test of mege math
-#&summary
-Math in mege
-#&
-#+license: bysa
-
-* Test of mege math
-
-While the <@eval macros.titlelink('basics', page.pathdir)@> does include math,
-this test contains more. And all of it's different.
-
-** Inline
-
-Blah: $2+2$
-
-** Block, way #1
-
-#&math
-\begin{align*}
-\sqrt{\sqrt{32x} + 14y} = 31
-\end{align*}
-#&
-
-** Block, way #2
-
-#+BEGIN_SRC latex
-\begin{align*}
-a^p \equiv a \mod p, a \in Z, p \text{ is prime}
-\end{align*}
-#+END_SRC
-
-** Block, way #2, highlighted
-
-#++high
-#+BEGIN_SRC latex
-\begin{align*}
-a^p \equiv a \mod p, a \in Z, p \text{ is prime}
-\end{align*}
-#+END_SRC
diff --git a/site/projects/mege/tests/tables.org b/site/projects/mege/tests/tables.org
deleted file mode 100644
index e9461ad..0000000
--- a/site/projects/mege/tests/tables.org
+++ /dev/null
@@ -1,80 +0,0 @@
-#+title: Test of mege tables
-#&summary
-Tables in mege
-#&
-#+license: bysa
-
-* Test of mege tables
-
-While the <@eval macros.titlelink('basics')@> does include
-tables, this test contains more. And they're all different.
-
-** Basic table
-
-| Name | Age |
-| Xryurg | 300 |
-| Bkrau | 2 |
-
-** With header
-
-| Name | Age |
-|--------+-----|
-| Xryurg | 300 |
-| Bkrau | 2 |
-
-** With header and footer
-
-| Name | Age |
-|--------+-----|
-| Xryurg | 300 |
-| Bkrau | 2 |
-|--------+-----|
-| Name | Age |
-
-** With caption
-
-#+caption: Persons
-| Name | Age |
-|--------+-----|
-| Xryurg | 300 |
-| Bkrau | 2 |
-
-
-** Inline formatting in table
-
-| URL | Exists |
-|-----------------+--------|
-| [[example.com]] | *Yes* |
-| [[abc.example.com]] | /No/ |
-
-** Complex table
-
-| Number | Target | Measured | Deviation |
-|--------+--------+----------+---------------|
-| 0 | 697 | 694 | 0.43 `percent |
-| 1 | 697 | 694 | 0.43 `percent |
-| 2 | 697 | 692 | 0.72 `percent |
-| 3 | 770 | 764 | 0.78 `percent |
-| 4 | 770 | 762 | 1.04 `percent |
-| 5 | 770 | 762 | 1.04 `percent |
-| 6 | 852 | 844 | 0.94 `percent |
-| 7 | 852 | 844 | 0.94 `percent |
-| 8 | 852 | 844 | 0.94 `percent |
-| 9 | 941 | 930 | 1.17 `percent |
-| A | 941 | 929 | 1.28 `percent |
-| B | 941 | 929 | 1.28 `percent |
-| C | 697 | 704 | 1.00 `percent |
-| D | 770 | 776 | 0.78 `percent |
-| E | 852 | 844 | 0.94 `percent |
-| F | 941 | 946 | 0.53 `percent |
-#+TBLFM: $4=abs($3-$2)/$2 %;%.2f `percent
-
-** Escaped table
-
-\| A | B |
-| B | C |
-
-** Over-escaped tables
-\\| O |
-
-\\\| P |
diff --git a/site/projects/mege/tests/test0.png b/site/projects/mege/tests/test0.png
deleted file mode 100644
index 76a63ba..0000000
Binary files a/site/projects/mege/tests/test0.png and /dev/null differ
diff --git a/site/projects/mege/tests/test1.ogv b/site/projects/mege/tests/test1.ogv
deleted file mode 100644
index 5da8448..0000000
Binary files a/site/projects/mege/tests/test1.ogv and /dev/null differ
diff --git a/site/projects/mege/tests/test2.ogg b/site/projects/mege/tests/test2.ogg
deleted file mode 100644
index b9651df..0000000
Binary files a/site/projects/mege/tests/test2.ogg and /dev/null differ
diff --git a/site/projects/mege/tests/video.org b/site/projects/mege/tests/video.org
deleted file mode 100644
index b93ee5f..0000000
--- a/site/projects/mege/tests/video.org
+++ /dev/null
@@ -1,9 +0,0 @@
-#+title: Test of mege video
-#+license: bysa
-#+summary: How to show a video in mege
-
-* Test of mege video
-
-#&video;url=test1.ogv,width=640,height=480,autoplay
-
-([[http://films.metanohi.name/compufight][Compufight]], CC BY-SA)
diff --git a/site/projects/minmailist.org b/site/projects/minmailist.org
deleted file mode 100644
index 5d0c4d9..0000000
--- a/site/projects/minmailist.org
+++ /dev/null
@@ -1,11 +0,0 @@
-#+title: minmailist
-#&summary
-a minimal mailing list system
-#&
-#+startup: showall
-#+license: wtfpl 2, program
-
-* minmailist
-
-: $ git clone git://metanohi.name/minmailist
-
diff --git a/site/projects/movact/art/movact-logo-256.png b/site/projects/movact/art/movact-logo-256.png
deleted file mode 100755
index a0ed64b..0000000
Binary files a/site/projects/movact/art/movact-logo-256.png and /dev/null differ
diff --git a/site/projects/movact/art/movact-logo-64.png b/site/projects/movact/art/movact-logo-64.png
deleted file mode 100755
index 056a25e..0000000
Binary files a/site/projects/movact/art/movact-logo-64.png and /dev/null differ
diff --git a/site/projects/movact/art/movact-logo.svg b/site/projects/movact/art/movact-logo.svg
deleted file mode 100755
index cba700e..0000000
--- a/site/projects/movact/art/movact-logo.svg
+++ /dev/null
@@ -1,949 +0,0 @@
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
diff --git a/site/projects/movact/index.org b/site/projects/movact/index.org
deleted file mode 100644
index 59db779..0000000
--- a/site/projects/movact/index.org
+++ /dev/null
@@ -1,577 +0,0 @@
-#+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.name][ns@metanohi.name]].
-
-
-
-* 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
deleted file mode 100644
index 548a35d..0000000
Binary files a/site/projects/movact/movact-0.5.1.tar.gz and /dev/null differ
diff --git a/site/projects/movact/movact-0.5.tar.gz b/site/projects/movact/movact-0.5.tar.gz
deleted file mode 100755
index abe3183..0000000
Binary files a/site/projects/movact/movact-0.5.tar.gz and /dev/null differ
diff --git a/site/projects/movact/wah.mvct.html b/site/projects/movact/wah.mvct.html
deleted file mode 100644
index b502f60..0000000
--- a/site/projects/movact/wah.mvct.html
+++ /dev/null
@@ -1,333 +0,0 @@
-
-
-
- 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
deleted file mode 100644
index 5f260e8..0000000
Binary files a/site/projects/naghni/Naghni-0.1.tar.gz and /dev/null differ
diff --git a/site/projects/naghni/img/naghni-logo-128x128.png b/site/projects/naghni/img/naghni-logo-128x128.png
deleted file mode 100644
index e58c5d2..0000000
Binary files a/site/projects/naghni/img/naghni-logo-128x128.png and /dev/null differ
diff --git a/site/projects/naghni/img/naghni-logo-14x14.png b/site/projects/naghni/img/naghni-logo-14x14.png
deleted file mode 100644
index a231f82..0000000
Binary files a/site/projects/naghni/img/naghni-logo-14x14.png and /dev/null differ
diff --git a/site/projects/naghni/img/naghni-logo-16x16.png b/site/projects/naghni/img/naghni-logo-16x16.png
deleted file mode 100644
index 1b32787..0000000
Binary files a/site/projects/naghni/img/naghni-logo-16x16.png and /dev/null differ
diff --git a/site/projects/naghni/img/naghni-logo-192x192.png b/site/projects/naghni/img/naghni-logo-192x192.png
deleted file mode 100644
index cc41ace..0000000
Binary files a/site/projects/naghni/img/naghni-logo-192x192.png and /dev/null differ
diff --git a/site/projects/naghni/img/naghni-logo-256x256.png b/site/projects/naghni/img/naghni-logo-256x256.png
deleted file mode 100644
index 1789057..0000000
Binary files a/site/projects/naghni/img/naghni-logo-256x256.png and /dev/null differ
diff --git a/site/projects/naghni/img/naghni-logo-384x384.png b/site/projects/naghni/img/naghni-logo-384x384.png
deleted file mode 100644
index 3b41d1c..0000000
Binary files a/site/projects/naghni/img/naghni-logo-384x384.png and /dev/null differ
diff --git a/site/projects/naghni/img/naghni-logo-512x512.png b/site/projects/naghni/img/naghni-logo-512x512.png
deleted file mode 100644
index f5e7428..0000000
Binary files a/site/projects/naghni/img/naghni-logo-512x512.png and /dev/null differ
diff --git a/site/projects/naghni/img/naghni-logo-64x64.png b/site/projects/naghni/img/naghni-logo-64x64.png
deleted file mode 100644
index 52bc39d..0000000
Binary files a/site/projects/naghni/img/naghni-logo-64x64.png and /dev/null differ
diff --git a/site/projects/naghni/img/naghni-logo.svg b/site/projects/naghni/img/naghni-logo.svg
deleted file mode 100644
index f2cf84e..0000000
--- a/site/projects/naghni/img/naghni-logo.svg
+++ /dev/null
@@ -1,284 +0,0 @@
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- image/svg+xml
-
-
-
-
-
-
- Naghni
-
-
- Naghni
-
-
-
-
-
-
diff --git a/site/projects/naghni/index.org b/site/projects/naghni/index.org
deleted file mode 100755
index 93cf0a5..0000000
--- a/site/projects/naghni/index.org
+++ /dev/null
@@ -1,28 +0,0 @@
-#+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
deleted file mode 100644
index 4841337..0000000
Binary files a/site/projects/naghni/screenshots/0.png and /dev/null differ
diff --git a/site/projects/naghni/screenshots/1.png b/site/projects/naghni/screenshots/1.png
deleted file mode 100644
index 6b4ad6e..0000000
Binary files a/site/projects/naghni/screenshots/1.png and /dev/null differ
diff --git a/site/projects/naghni/screenshots/2.png b/site/projects/naghni/screenshots/2.png
deleted file mode 100644
index 3dfe518..0000000
Binary files a/site/projects/naghni/screenshots/2.png and /dev/null differ
diff --git a/site/projects/naghni/screenshots/3.png b/site/projects/naghni/screenshots/3.png
deleted file mode 100644
index 1c695c2..0000000
Binary files a/site/projects/naghni/screenshots/3.png and /dev/null differ
diff --git a/site/projects/naghni/screenshots/4.png b/site/projects/naghni/screenshots/4.png
deleted file mode 100644
index 486e4b4..0000000
Binary files a/site/projects/naghni/screenshots/4.png and /dev/null differ
diff --git a/site/projects/nalgh.org b/site/projects/nalgh.org
deleted file mode 100755
index 9039a80..0000000
--- a/site/projects/nalgh.org
+++ /dev/null
@@ -1,73 +0,0 @@
-#+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/view.php?src=nalgh/nalgh.php][here]] with the example source [[http://projects.metanohi.name/view.php?src=nalgh/example.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/nanonote/glorious-nanonote.jpg b/site/projects/nanonote/glorious-nanonote.jpg
deleted file mode 100644
index bd8e3de..0000000
Binary files a/site/projects/nanonote/glorious-nanonote.jpg and /dev/null differ
diff --git a/site/projects/nanonote/index.org b/site/projects/nanonote/index.org
deleted file mode 100755
index 2a3bb48..0000000
--- a/site/projects/nanonote/index.org
+++ /dev/null
@@ -1,16 +0,0 @@
-#+title: My NanoNote
-#&summary
-I have a NanoNote.
-#&
-#+license: bysa
-
-* My NanoNote
-
-#&img;url=glorious-nanonote.jpg, alt=Glorious NanoNote, center
-
-I own a [[http://sharism.cc/][NanoNote]]. I think it's
-cool (though I haven't found much use for it yet). The default NanoNote
-distro comes with an [[http://openwrt.org/][OpenWRT]]-based. It's also possible to run Debian on it
-(with only 32 MiB RAM..), but it's slow.
-
-(Originally, this page was meant to have a purpose.)
diff --git a/site/projects/noncrawl/img/noncrawl-logo-128.png b/site/projects/noncrawl/img/noncrawl-logo-128.png
deleted file mode 100644
index 1bc76d6..0000000
Binary files a/site/projects/noncrawl/img/noncrawl-logo-128.png and /dev/null differ
diff --git a/site/projects/noncrawl/img/noncrawl-logo-14.png b/site/projects/noncrawl/img/noncrawl-logo-14.png
deleted file mode 100644
index 1c3eefc..0000000
Binary files a/site/projects/noncrawl/img/noncrawl-logo-14.png and /dev/null differ
diff --git a/site/projects/noncrawl/img/noncrawl-logo-16.png b/site/projects/noncrawl/img/noncrawl-logo-16.png
deleted file mode 100644
index 26907ba..0000000
Binary files a/site/projects/noncrawl/img/noncrawl-logo-16.png and /dev/null differ
diff --git a/site/projects/noncrawl/img/noncrawl-logo-192.png b/site/projects/noncrawl/img/noncrawl-logo-192.png
deleted file mode 100644
index a348c99..0000000
Binary files a/site/projects/noncrawl/img/noncrawl-logo-192.png and /dev/null differ
diff --git a/site/projects/noncrawl/img/noncrawl-logo-256.png b/site/projects/noncrawl/img/noncrawl-logo-256.png
deleted file mode 100644
index b9c5b41..0000000
Binary files a/site/projects/noncrawl/img/noncrawl-logo-256.png and /dev/null differ
diff --git a/site/projects/noncrawl/img/noncrawl-logo-384.png b/site/projects/noncrawl/img/noncrawl-logo-384.png
deleted file mode 100644
index 95d003b..0000000
Binary files a/site/projects/noncrawl/img/noncrawl-logo-384.png and /dev/null differ
diff --git a/site/projects/noncrawl/img/noncrawl-logo-512.png b/site/projects/noncrawl/img/noncrawl-logo-512.png
deleted file mode 100644
index 218a178..0000000
Binary files a/site/projects/noncrawl/img/noncrawl-logo-512.png and /dev/null differ
diff --git a/site/projects/noncrawl/img/noncrawl-logo-64.png b/site/projects/noncrawl/img/noncrawl-logo-64.png
deleted file mode 100644
index 0a36c24..0000000
Binary files a/site/projects/noncrawl/img/noncrawl-logo-64.png and /dev/null differ
diff --git a/site/projects/noncrawl/img/noncrawl-logo.svg b/site/projects/noncrawl/img/noncrawl-logo.svg
deleted file mode 100644
index 5d87910..0000000
--- a/site/projects/noncrawl/img/noncrawl-logo.svg
+++ /dev/null
@@ -1,95 +0,0 @@
-
-
-
-
-
-
-
-
-
-
-
- image/svg+xml
-
-
-
-
-
-
- noncrawl
-
- ∞
-
-
diff --git a/site/projects/noncrawl/index.org b/site/projects/noncrawl/index.org
deleted file mode 100755
index 9578e73..0000000
--- a/site/projects/noncrawl/index.org
+++ /dev/null
@@ -1,23 +0,0 @@
-#+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
deleted file mode 100644
index 7504b8d..0000000
Binary files a/site/projects/noncrawl/noncrawl-0.1.tar.gz and /dev/null differ
diff --git a/site/projects/pebsaq/index.org b/site/projects/pebsaq/index.org
deleted file mode 100644
index ce6a8f5..0000000
--- a/site/projects/pebsaq/index.org
+++ /dev/null
@@ -1,16 +0,0 @@
-#+title: pebsaq
-#&summary
-Poor synthesizing.
-#&
-#+license: bysa, text
-#+license: gpl 3+, program
-#&toc
-
-* pebsaq
-
-It is an interactive synthesizer with support for only sine, triangle and
-square waves.
-
-pebsaq is released under the GPLv3+. The current version is 0.1.0. [[pebsaq-0.1.0.zip][Download
-here]] or [[http://pypi.python.org/pypi/pebsaq][here]].
-
diff --git a/site/projects/pebsaq/pebsaq-0.1.0.tar.gz b/site/projects/pebsaq/pebsaq-0.1.0.tar.gz
deleted file mode 100644
index 1af4f98..0000000
Binary files a/site/projects/pebsaq/pebsaq-0.1.0.tar.gz and /dev/null differ
diff --git a/site/projects/pumila/index.org b/site/projects/pumila/index.org
deleted file mode 100644
index bfac089..0000000
--- a/site/projects/pumila/index.org
+++ /dev/null
@@ -1,19 +0,0 @@
-#+title: pumila
-#&summary
-Transforms variations in color, brightness, saturation and opacity into
-different sounds.
-#&
-#+license: bysa, text
-#+license: agpl 3+, program
-
-* pumila
-
-#&video;url=pumila-example.ogv, width=640, height=88
-
-{[[pumila-0.1.0.tar.gz][Download]].}&huge
-
-pumila is released under the AGPLv3+.
-
-pumila can also be found in the [[http://pypi.python.org/pypi/pumila][Python Package Index]].
-
-pumila has its code at Gitorious; see [[http://gitorious.org/pumila]].
diff --git a/site/projects/pumila/pumila-0.1.0.tar.gz b/site/projects/pumila/pumila-0.1.0.tar.gz
deleted file mode 100644
index d817ce4..0000000
Binary files a/site/projects/pumila/pumila-0.1.0.tar.gz and /dev/null differ
diff --git a/site/projects/pumila/pumila-example.ogv b/site/projects/pumila/pumila-example.ogv
deleted file mode 100644
index c135a10..0000000
Binary files a/site/projects/pumila/pumila-example.ogv and /dev/null differ
diff --git a/site/projects/qvikconfig/index.org b/site/projects/qvikconfig/index.org
deleted file mode 100755
index b952ab1..0000000
--- a/site/projects/qvikconfig/index.org
+++ /dev/null
@@ -1,18 +0,0 @@
-#+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
deleted file mode 100644
index 19efc55..0000000
--- a/site/projects/qvikconfig/qvikconfig-0.1.0-documentation.html
+++ /dev/null
@@ -1,392 +0,0 @@
-
-
-
-
-
-
-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
deleted file mode 100644
index 1b9258c..0000000
Binary files a/site/projects/qvikconfig/qvikconfig-0.1.0.tar.gz and /dev/null differ
diff --git a/site/projects/qvikconfig/qvikconfig-0.1.1-documentation.html b/site/projects/qvikconfig/qvikconfig-0.1.1-documentation.html
deleted file mode 100644
index 9996db5..0000000
--- a/site/projects/qvikconfig/qvikconfig-0.1.1-documentation.html
+++ /dev/null
@@ -1,418 +0,0 @@
-
-
-
-
-
-
-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
deleted file mode 100644
index 61d28ab..0000000
Binary files a/site/projects/qvikconfig/qvikconfig-0.1.1.tar.gz and /dev/null differ
diff --git a/site/projects/sadbipws/index.org b/site/projects/sadbipws/index.org
deleted file mode 100755
index 97634d9..0000000
--- a/site/projects/sadbipws/index.org
+++ /dev/null
@@ -1,18 +0,0 @@
-#+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
deleted file mode 100644
index cd8d387..0000000
Binary files a/site/projects/sadbipws/logo.png and /dev/null differ
diff --git a/site/projects/sadbipws/sadbipws-0.1.0.tar.gz b/site/projects/sadbipws/sadbipws-0.1.0.tar.gz
deleted file mode 100755
index af6168a..0000000
Binary files a/site/projects/sadbipws/sadbipws-0.1.0.tar.gz and /dev/null differ
diff --git a/site/projects/shadowloss/img/shadowloss-logo-256.png b/site/projects/shadowloss/img/shadowloss-logo-256.png
deleted file mode 100644
index f22d53e..0000000
Binary files a/site/projects/shadowloss/img/shadowloss-logo-256.png and /dev/null differ
diff --git a/site/projects/shadowloss/index.org b/site/projects/shadowloss/index.org
deleted file mode 100755
index cd16bd5..0000000
--- a/site/projects/shadowloss/index.org
+++ /dev/null
@@ -1,23 +0,0 @@
-#+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
deleted file mode 100644
index d25a1f7..0000000
Binary files a/site/projects/shadowloss/shadowloss-0.1.0.tar.gz and /dev/null differ
diff --git a/site/projects/shadowloss/shadowloss-0.1.1.tar.gz b/site/projects/shadowloss/shadowloss-0.1.1.tar.gz
deleted file mode 100644
index 59f4f79..0000000
Binary files a/site/projects/shadowloss/shadowloss-0.1.1.tar.gz and /dev/null differ
diff --git a/site/projects/simplechat/art/simplechat-logo-small.png b/site/projects/simplechat/art/simplechat-logo-small.png
deleted file mode 100644
index e22eb5e..0000000
Binary files a/site/projects/simplechat/art/simplechat-logo-small.png and /dev/null differ
diff --git a/site/projects/simplechat/art/simplechat-logo.png b/site/projects/simplechat/art/simplechat-logo.png
deleted file mode 100644
index 52f1cf8..0000000
Binary files a/site/projects/simplechat/art/simplechat-logo.png and /dev/null differ
diff --git a/site/projects/simplechat/art/simplechat-logo.svg b/site/projects/simplechat/art/simplechat-logo.svg
deleted file mode 100644
index 29b2a67..0000000
--- a/site/projects/simplechat/art/simplechat-logo.svg
+++ /dev/null
@@ -1,162 +0,0 @@
-
-
-
-
-
-
-
-
-
-
- image/svg+xml
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
diff --git a/site/projects/simplechat/index.org b/site/projects/simplechat/index.org
deleted file mode 100644
index 973fbee..0000000
--- a/site/projects/simplechat/index.org
+++ /dev/null
@@ -1,37 +0,0 @@
-#+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
deleted file mode 100644
index 2b7dc5b..0000000
Binary files a/site/projects/simplechat/simplechat-0.93.tar.gz and /dev/null differ
diff --git a/site/projects/sleinlib.org b/site/projects/sleinlib.org
deleted file mode 100644
index 7f36d69..0000000
--- a/site/projects/sleinlib.org
+++ /dev/null
@@ -1,21 +0,0 @@
-#+title: sleinlib
-#&summary
-Misc. stuff.
-#&
-#+license: wtfpl, page
-#+license: wtfpl, program
-
-Deprecated. Split up into separate projects.
-
-* sleinlib
-
-See [[http://gitorious.org/sleinlib]].
-
-Includes:
-
-+ Standard ML
-+ Prolog
-+ Haskell
-+ Math
-+ Junk code
-+ Mini projects/experiments
diff --git a/site/projects/textmation/index.org b/site/projects/textmation/index.org
deleted file mode 100644
index 3e5918d..0000000
--- a/site/projects/textmation/index.org
+++ /dev/null
@@ -1,27 +0,0 @@
-#+title: textmation
-#&summary
-An interpreter and renderer for a simple text-based animation language for
-simple shapes.
-#&
-#+license: bysa
-
-* textmation
-
-textmation allows you to define an animation in pure text, and then render it.
-
-It was developed fairly quickly and then not touched upon after it had been
-used for its original purpose. The animation it was used for currently isn't
-included.
-
-The program is quite worthless as it is right now, because there's no
-documentation for the format, and the interpreter also has easily-triggerable
-bugs.
-
-I haven't got around to specifying a license yet either.
-
-In essence: I need to work on it.
-
-But here it is (run the following in a terminal):
-
-: $ git clone git://metanohi.name/textmation
-
diff --git a/site/projects/totxt/index.org b/site/projects/totxt/index.org
deleted file mode 100644
index 5401364..0000000
--- a/site/projects/totxt/index.org
+++ /dev/null
@@ -1,256 +0,0 @@
-#+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.
-
-
-
- Global variable
- Local definition
- Description
- Default value
-
-
-
- totxt_WIDTH
- widthX
- Line width
- 80
-
-
-
- totxt_DYNAMIC
- dynamicX
- Dynamic, open or closed?
- -1 (not dynamic)
-
-
-
- totxt_DYNAMIC_SPEED
- speedX
- Speed of line removal/appending when sliding (in ms)
- 50
-
-
-
- totxt_DYNAMIC_LINES
- linesX
- Amount of line(s) to (dis)appear per function call
- 1
-
-
-
- totxt_QUICK_DYNAMIC
- quick_dynamic
- Open/close boxes instantly. Do not slide.
- false
-
-
-
- totxt_DEL_XWS
- del_excess_whitespace
- Delete excess whitespace
- false
-
-
-
- totxt_HEADER_ALIGN
- halignX
- Alignment of header (0 = left, 1 = center, 2 = right)
- 1 (center)
-
-
-
- totxt_SUBHEADER_ALIGN
- shalignX
- Alignment of subheader
- 0 (left)
-
-
-
- totxt_TEXT_ALIGN
- talignX
- Alignment of text
- 0 (left)
-
-
-
-
-Furthermore, there are some global variables that can be used to modify the what classes to look for.
-
-
-
- Global variable
- Description
- Default value
-
-
-
- totxt_CLASSNAME
- Main class to look for. Only elements with this classname has a chance of becoming totxt elements.
- totxt
-
-
-
- totxt_DYNAMIC_CLASSNAME
-
- dynamic
-
-
-
- totxt_DYNSPEED_CLASSNAME
-
- speed
-
-
-
- totxt_DYNLINES_CLASSNAME
-
- lines
-
-
-
- totxt_HALIGN_CLASSNAME
-
- halign
-
-
-
- totxt_SHALIGN_CLASSNAME
-
- shalign
-
-
-
- totxt_TALIGN_CLASSNAME
-
- talign
-
-
-
- totxt_WIDTH_CLASSNAME
-
- width
-
-
-
- totxt_DELXWS_CLASSNAME
-
- del_excess_whitespace
-
-
-
- totxt_QUICK_CLASSNAME
-
- quick_dynamic
-
-
-
- totxt_HEADER_ELEMENT
- Element type containing header text and totxt information in form of classes
- H1
-
-
-
- totxt_SUBHEADER_ELEMENT
- Element type containing subheader text. Any information in classes will be ignored.
- H2
-
-
-
- totxt_TEXT_ELEMENT
- Element type containing text. Any information in classes will be ignored.
- P
-
-
-
-
-
-To use totxt, simply save it in a directory, then import it using a script tag. Something like this:
-
-<html>
- <head>
- <script type='text/javascript' src='totxt.js'></script>
- <script type='text/javascript'>
- window.onload = load_totxt_generator
- </script>
- </head>
-
- <body>
- ...
- </body>
-</html>
-
-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.
-load_totxt_generator can be run more than once, without any problems arising.
-
-Important information (click to open)
-Look no further!
-
-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
deleted file mode 100755
index bab1fcc..0000000
--- a/site/projects/totxt/totxt.js
+++ /dev/null
@@ -1,725 +0,0 @@
-/*
- 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 .
-*/
-
-/*
- Version: 0.9
- You can contact Niels at .
- Latest version is always available at ,
- along with documentation.
-*/
-
-
-
-/* To avoid overuse of global variables, all functions and actions have been
- stuffed into the 'load_totxt_generator' function. */
-function load_totxt_generator(action, var_a) {
- /* Normally, this function will load a bunch of functions and then generate
- PRE elements. This isn't the case if a special action is defined. */
-
- function count(haystack, needle) {
- // Counts needles in haystack
- if (needle == undefined)
- var needle = '\n'
- var c, offset
- offset = -1
- c = 0
- while (offset) {
- offset = haystack.indexOf(needle, offset) + 1
- c++
- }
- return c
- }
-
- if (action == 'show_or_hide') {
- /* Used by dynamic boxes that utilize sliding functionality. To open an
- article box, it is sufficient to click on it, but to close one, one
- must doubleclick on it. This is partly why there are some
- differences in what type of state the box is in. */
- var obj = document.totxt_preElements[var_a]
- if (obj.state) {
- // If open, COLLAPSE
- obj.state = 0
- if (obj.quickdyn) {
- // Don't slide
- obj.innerHTML = obj.header
- obj.className = obj.className.replace(obj.dynclass + '1', obj.dynclass + '0')
- obj.onclick = function(){load_totxt_generator('show_or_hide', this.number)}
- obj.ondblclick = undefined
- }
- else {
- // Do slide
- obj.onclick = undefined
- obj.ondblclick = undefined
- obj.slide_expand = 0
- obj.line = undefined
- load_totxt_generator('slide', var_a)
- }
- }
- else {
- // If closed, EXPAND
- obj.state = 1
- obj.className = obj.className.replace(obj.dynclass + '0', obj.dynclass + '1')
- if (obj.quickdyn) {
- // Don't slide
- obj.innerHTML = obj.fulltext
- obj.onclick = undefined
- obj.ondblclick = function(){load_totxt_generator('show_or_hide', this.number)}
- }
- else {
- // Do slide
- obj.onclick = undefined
- obj.ondblclick = undefined
- obj.slide_expand = 1
- obj.line = undefined
- load_totxt_generator('slide', var_a)
- }
- }
- return true
- }
- else if (action == 'slide') {
- /* Using the setTimeout function, this action is used by 'show_or_hide'
- actions to either expand or collapse a box slidingly. */
- var obj, hh, th, obdl
- obj = document.totxt_preElements[var_a]
- hh = obj.headerheight
- th = obj.fulltextheight
- if (obj.line == undefined) {
- if (obj.slide_expand)
- obj.line = hh
- else
- obj.line = th
- }
-
- obj.innerHTML = obj.fulltext.split('\n', obj.line).join('\n')
-
- // Add lines when expanding, remove lines when collapsing
- if (obj.slide_expand) {
- obdl = obj.line
- if (obdl == th)
- obdl++
- else {
- obdl = obj.line + obj.dynlines
- if (obdl > th)
- obdl = th
- }
- obj.line = obdl
- }
- else {
- obdl = obj.line
- if (obdl == hh)
- obdl--
- else {
- obdl = obj.line - obj.dynlines
- if (obdl < hh)
- obdl = hh
- }
- obj.line = obdl
- }
- if (obj.line >= hh && obj.line <= th)
- setTimeout('load_totxt_generator(\'slide\', ' + var_a + ')', obj.dynspeed)
- else {
- // End 'loop'
- if (obj.slide_expand) {
- obj.onclick = undefined
- obj.ondblclick = function(){load_totxt_generator('show_or_hide', this.number)}
- }
- else {
- obj.onclick = function(){load_totxt_generator('show_or_hide', this.number)}
- obj.ondblclick = undefined
- obj.className = obj.className.replace(obj.dynclass + '1', obj.dynclass + '0')
- }
- // Not necessary. Has no noticable effect.
- delete document.slide_object
- delete obj.slide_expand
- delete obj.line
- }
- return true
- }
-
- /*
- No more special actions exist. If none of the two above actions were
- specified, code execution will begin here.
- */
-
- // Various functions
- function isin(ref, str, end, defau) {
- // Checks for string str in array ref. If end is true, look for match in
- // beginning of str and return the end of str
- var x, c
- for (x in ref) {
- c = ref[x]
- if (end) {
- if (c.indexOf(str) == 0)
- return c.substr(str.length)
- }
- else if (c == str)
- return true
- }
- if (defau)
- return defau
- else
- return false
- }
-
- function ctimes(cha, times) {
- // * times (a, 3 = aaa)
- var t = ''
- for (var i = 0; i < times; i++) {
- t += cha
- }
- return t
- }
-
- function transform_text(str, w, align, del_xws) {
- /* This function transforms text seen in ordinary HTML tags into text
- that fits simple monospace character boxes. */
-
- // Prepare text
- str = str.replace(new RegExp('^\\s+'), '').replace(new RegExp('\\s+$'), '')
- str = str.replace(/ /gi, ' ').replace(/ \n/gi, ' ')
- //str = str.replace(/ /g, ' ')
- str = str.replace(/\n/g, ' ')
- if (del_xws) {
- // Delete excessive whitespace
- str = str.replace(new RegExp('\\s+', 'g'), ' ')
- }
- str = str.replace(/ /gi, '\n')
- if (del_xws) {
- // Delete excessive whitespace caused by line break transformation
- str = str.replace(/\n /g, '\n')
- }
-
- var tags, tlen, intag, start, i, c, x, sstr, ntxt, ctxt, txt, cw, clen
- var entities, inentity, filter, tminus, l, spaces
-
- // Store and remove HTML tags in text (will be readded in text later)
- // Also look for HTML entities, such as < (<)
- tagent = [] // To store HTML tags and HTML entities
- tlen = str.length
- start = 0
- intag = false
- inentity = false
- filter = ' <>!"\'\\/*-+,.:;'
-
- ntxt = ''
- for (i = 0; i < tlen; i++) {
- c = str.substr(i, 1)
- if (c == '<' && !intag) {
- intag = true
- start = i
- }
- else if (c == '>' && intag) {
- intag = false
- tagent[tagent.length] = ['tag', start, str.substr(start, i - start + 1)]
- }
- else if (!intag) {
- if (c == '&' && !inentity) {
- if (filter.indexOf(str.substr(i+1, 1)) == -1) {
- inentity = true
- start = i
- }
- ntxt += c
- }
- else if (c == ';' && inentity) {
- inentity = false
- tagent[tagent.length] = ['ent', start, str.substr(start, i - start + 1)]
- }
- else if (!inentity)
- ntxt += c
- }
- }
- str = ntxt
-
- // Change line width of text. When inserting a hyphen and a newline, check
- // if positions of HTML tags and HTML entities need to be changed.
- sstr = str.split('\n')
- ntxt = ''
- for (ctxt in sstr) {
- txt = sstr[ctxt]
- while (txt) {
- if (txt.length <= w) {
- ntxt += txt
- break
- }
- if (txt.substr(0, w).indexOf(' ') == -1) {
- ntxt += txt.substr(0, w - 1) + '-\n'
- txt = txt.substr(w - 1)
- clen = ntxt.length
- tminus = 0
- for (x in tagent) {
- if (tagent[x][1] - tminus > clen)
- tagent[x][1] += 2
- l = tagent[x][2].length
- if (tagent[x][0] == 'ent')
- l--
- tminus += l
- }
- continue
- }
- cw = w
- while (txt.substr(cw, 1) != ' ')
- cw -= 1
- ntxt += txt.substr(0, cw) + '\n'
- txt = txt.substr(cw + 1)
- // No need to readjust positions of HTML stuff here, as the
- // new newline replaces a space character
- }
- ntxt += '\n'
- }
- while (ntxt.substr(ntxt.length - 1) == '\n')
- ntxt = ntxt.substr(0, ntxt.length - 1)
-
- str = ntxt
-
- // Readd removed HTML tags and HTML entities
- for (x in tagent) {
- c = tagent[x]
- if (c[0] == 'tag')
- str = str.substr(0, c[1]) + c[2] + str.substr(c[1])
- else if (c[0] == 'ent')
- str = str.substr(0, c[1]) + c[2] + str.substr(c[1]+1)
- }
-
- // Align (0 = left, 1 = center, 2 = right)
- if (align != 0 && align != 1 && align != 2)
- align = 0
-
- sstr = str.split('\n')
- ntxt = ''
- for (ctxt in sstr) {
- txt = sstr[ctxt]
- tlen = txt.length
- clen = 0
- intag = false
- inentity = false
- for (i = 0; i < tlen; i++) {
- c = txt.substr(i, 1)
- if (c == '<' && !intag)
- intag = true
- else if (c == '>' && intag)
- intag = false
- else if (c == '&' && !inentity) {
- if (filter.indexOf(txt.substr(i+1, 1)) == -1)
- inentity = true
- clen++
- }
- else if (c == ';' && inentity)
- inentity = false
- else if (!intag && !inentity)
- clen++
- }
- spaces = w - clen
- ntxt += '\n'
- if (align == 0) // Left
- ntxt += txt + ctimes(' ', spaces)
- else if (align == 2) // Right
- ntxt += ctimes(' ', spaces) + txt
- else if (align == 1) // Center
- ntxt += ctimes(' ', Math.floor(spaces / 2)) + txt + ctimes(' ', Math.ceil(spaces / 2))
- }
- ntxt = ntxt.substr(1)
- if (ntxt)
- str = ntxt
- return str
- }
-
- function add_borders(txt, border, padding) {
- // Adds borders to boxes
- if (border == undefined)
- border = '|'
- if (padding == undefined)
- padding = ' '
- var s, x, c, n
- s = txt.split('\n')
- n = ''
- for (x in s) {
- c = s[x]
- n += '\n' + border + padding + c + padding + border
- }
- return n.substr(1)
- }
-
- function transform_text_in_list(arr, w, del_xws, borders, padding, align) {
- // Transform, then join
- var x, c, f, t
- f = ''
- for (x in arr) {
- c = arr[x]
- if (align == undefined)
- align = 0 // Left
- t = transform_text(c, w, align, del_xws)
- if (borders)
- t = add_borders(t, borders, padding)
- f += '\n' + t
- }
- return f.substr(1)
- }
- // No more functions
-
-
- // Begin load + search + generate
-
- // Local variables
- var h1s, x, z, y, ok, cur, classes, par, chs, cur_found, ccur,
- header, subheaders, texts, elems, subheader, content,
- stdclass, dynclass, widclass, xwsclass, quiclass, speclass, linclass,
- stdwidth, width, stddynamic, dynamic, isdynamic, delxws,
- dynspeed, c_speed, dynlines, c_lines, quickdyn, c_quidyn, alwdelxws,
- stdhalign, stdshalign, stdtalign, halclass, shalclass, talclass,
- c_halign, c_shalign, c_talign
-
- var h_elmnm, sh_elmnm, txt_elmnm
- var tmps, text, preElements, elmminus, prelms, plen, celm
- var /*poss_classes, n_classes,*/ pid, tmp
-
- // Default classnames for recognition purposes.
- // Can be changed using global variables.
- stdclass = 'totxt'
- try {
- stdclass = totxt_CLASSNAME ? totxt_CLASSNAME : stdclass
- }
- catch(e) {}
- dynclass = 'dynamic'
- try {
- dynclass = totxt_DYNAMIC_CLASSNAME ? totxt_DYNAMIC_CLASSNAME : dynclass
- }
- catch(e) {}
- widclass = 'width'
- try {
- widclass = totxt_WIDTH_CLASSNAME ? totxt_WIDTH_CLASSNAME : widclass
- }
- catch(e) {}
- xwsclass = 'del_excess_whitespace'
- try {
- xwsclass = totxt_DELXWS_CLASSNAME ? totxt_DELXWS_CLASSNAME : xwsclass
- }
- catch(e) {}
- speclass = 'speed'
- try {
- speclass = totxt_DYNSPEED_CLASSNAME ? totxt_DYNSPEED_CLASSNAME : speclass
- }
- catch(e) {}
- linclass = 'lines'
- try {
- linclass = totxt_DYNLINES_CLASSNAME ? totxt_DYNLINES_CLASSNAME : linclass
- }
- catch(e) {}
- quiclass = 'quick_dynamic'
- try {
- quiclass = totxt_QUICK_CLASSNAME ? totxt_QUICK_CLASSNAME : quiclass
- }
- catch(e) {}
- halclass = 'halign'
- try {
- halclass = totxt_HALIGN_CLASSNAME ? totxt_HALIGN_CLASSNAME : halclass
- }
- catch(e) {}
- shalclass = 'shalign'
- try {
- shalclass = totxt_SHALIGN_CLASSNAME ? totxt_SHALIGN_CLASSNAME : shalclass
- }
- catch(e) {}
- talclass = 'talign'
- try {
- talclass = totxt_TALIGN_CLASSNAME ? totxt_TALIGN_CLASSNAME : talclass
- }
- catch(e) {}
- h_elmnm = 'H1'
- try {
- h_elmnm = totxt_HEADER_ELEMENT ? totxt_HEADER_ELEMENT.toUpperCase() : h_elmnm
- }
- catch(e) {}
- sh_elmnm = 'H2'
- try {
- sh_elmnm = totxt_SUBHEADER_ELEMENT ? totxt_SUBHEADER_ELEMENT.toUpperCase() : sh_elmnm
- }
- catch(e) {}
- txt_elmnm = 'P'
- try {
- txt_elmnm = totxt_TEXT_ELEMENT ? totxt_TEXT_ELEMENT.toUpperCase() : txt_elmnm
- }
- catch(e) {}
-
- h1s = document.getElementsByTagName(h_elmnm)
- if (!h1s)
- return false
-
-
- // Default values
- // Line width
- stdwidth = 80
- try {
- stdwidth = totxt_WIDTH * 1 ? totxt_WIDTH : stdwidth
- }
- catch(e) {}
- if (stdwidth < 10)
- stdwidth = 10
-
- // Should articles be allowed to collapse and expand with a mouseclick?
- stddynamic = -1
- try {
- stddynamic = totxt_DYNAMIC
- }
- catch(e) {}
-
- // Sliding speed
- dynspeed = 50
- try {
- dynspeed = totxt_DYNAMIC_SPEED * 1
- }
- catch(e) {}
-
- // Line(s) to (dis)appear per function call
- dynlines = 1
- try {
- dynlines = totxt_DYNAMIC_LINES * 1 ? totxt_DYNAMIC_LINES * 1 : dynlines
- }
- catch(e) {}
-
- // Don't slide?
- quickdyn = false
- try {
- quickdyn = totxt_QUICK_DYNAMIC
- }
- catch(e) {}
-
- // Delete excessive whitespace?
- alwdelxws = false
- try {
- alwdelxws = totxt_DEL_XWS
- }
- catch(e) {}
-
- // Header alignment
- stdhalign = 1 // Center
- try {
- stdhalign = totxt_HEADER_ALIGN * 1
- }
- catch(e) {}
-
- // Subheader alignment
- stdshalign = 0 // Left
- try {
- stdshalign = totxt_SUBHEADER_ALIGN * 1
- }
- catch(e) {}
-
- // Text alignment
- stdtalign = 0 // Left
- try {
- stdtalign = totxt_TEXT_ALIGN * 1
- }
- catch(e) {}
- // Checking for impossible alignments
- if (stdhalign > 2) stdhalign = 2
- else if (stdhalign < 0) stdhalign = 0
- if (stdshalign > 2) stdshalign = 2
- else if (stdshalign < 0) stdshalign = 0
- if (stdtalign > 2) stdtalign = 2
- else if (stdtalign < 0) stdtalign = 0
-
- elems = [] // Elements that contain info to be used in final PRE elements.
- prelms = [] // PRE elements
-
- /*
- // Special classes
- poss_classes = [stdclass, dynclass, widclass, xwsclass, speclass, linclass, quiclass, halclass, shalclass, talclass]
- */
-
- // document.totxt_preElements is the variable in which to store the PRE elements.
- try {
- /* document.totxt_preElements likely doesn't exist, which could result in an
- error if not called inside a try statement. */
- preElements = document.totxt_preElements
- elmminus = preElements.length
- }
- catch(e) {
- document.totxt_preElements = []
- preElements = []
- elmminus = 0
- }
-
- // Look up H1 elements
- for (x in h1s) {
- cur = h1s[x]
- if (!cur || !cur.className)
- continue
- // Filters
- classes = cur.className.split(' ')
- if (!isin(classes, stdclass))
- continue
-
- par = cur.parentNode
- if (!par)
- continue
-
- // Find H2 and P elements that are "below" the current H1 element
- chs = par.childNodes
- cur_found = 0
- header = cur.innerHTML
- subheaders = []
- texts = []
- elems[elems.length] = cur
- for (z in chs) {
- ccur = chs[z]
- if (ccur == cur) {
- cur_found = 1
- continue
- }
- if (!cur_found || !ccur.tagName)
- continue
-
- if (ccur.tagName == sh_elmnm)
- subheaders[subheaders.length] = ccur.innerHTML
- else if (ccur.tagName == txt_elmnm)
- texts[texts.length] = ccur.innerHTML
- else
- break
- // If either H2 or P element, add object to elems var
- elems[elems.length] = ccur
- }
-
- width = isin(classes, widclass, 1, stdwidth) * 1
- if (width < 10)
- width = stdwidth
- dynamic = isin(classes, dynclass, 1, stddynamic) * 1
- isdynamic = dynamic == 0 || dynamic == 1
-
- delxws = isin(classes, xwsclass, 0, alwdelxws)
-
- c_halign = isin(classes, halclass, 1, stdhalign) * 1
- c_shalign = isin(classes, shalclass, 1, stdshalign) * 1
- c_talign = isin(classes, talclass, 1, stdtalign) * 1
-
- tmps = [' ' + ctimes('-', width - 2),
- '|' + ctimes('_', width - 2) + '|',
- '| ' + ctimes('~', width - 4) + ' |\n']
-
- // Now generate the content
- header = add_borders(transform_text(header, width - 4, c_halign, delxws), '|')
- subheader = subheaders ? transform_text_in_list(subheaders, width - 4, delxws, '|', ' ', c_shalign) : ''
- content = texts ? transform_text_in_list(texts, width - 4, delxws, '|', ' ', c_talign) : ''
-
- header = tmps[0] + '\n' + header + '\n' + tmps[0]
- text = header + '\n'
- if (subheader)
- text += subheader + '\n' + tmps[2]
- if (content)
- text += content + '\n'
- text += tmps[1]
-
- /*
- // Check for special classes that have nothing to do with settings
- n_classes = []
- for (z in classes) {
- for (y in poss_classes) {
- ok = true
- if (!classes[z].indexOf(poss_classes[y])) {
- ok = false
- break
- }
- }
- if (ok)
- n_classes[n_classes.length] = classes[z]
- }
- n_classes = n_classes.join(' ')
- */
-
- // Find eventual id
- pid = cur.id
- delete cur.id // To avoid two elements with alike ids
-
- plen = prelms.length
- prelms[plen] = document.createElement('pre')
- celm = prelms[plen]
- celm.number = plen + elmminus // preElements may not be empty
- celm.className = cur.className
- /*
- celm.className = stdclass
- if (n_classes)
- celm.className += ' ' + n_classes
- */
- if (pid)
- celm.id = pid
-
- // Find and apply eventual styles
- for (z in cur.style) {
- c = cur.style[z]
- if (c) {
- try {
- if (c.indexOf(':') != -1)
- tmp = c.split(':')
- celm.style.setProperty(tmp[0], tmp[1].replace(';', ''), '')
- }
- catch(e){}
- }
- }
-
- celm.style.display = 'none'
- celm.innerHTML = text
- if (isdynamic) {
- c_speed = isin(classes, speclass, 1, dynspeed) * 1
- c_lines = isin(classes, linclass, 1, dynlines) * 1
- if (!c_lines) c_lines = dynlines
- c_quidyn = isin(classes, quiclass, 0, quickdyn)
- celm.fulltext = text
- celm.header = header
- celm.headerheight = count(header)
- celm.fulltextheight = count(text)
- celm.state = dynamic
- if (!isin(classes, dynclass))
- celm.className += ' ' + dynclass
- if (!isin(classes, dynclass + dynamic))
- celm.className += ' ' + dynclass + dynamic
- /*
- if (c_quidyn)
- celm.className += ' ' + quiclass
- */
- celm.dynclass = dynclass
- celm.dynspeed = c_speed
- celm.dynlines = c_lines
- celm.quickdyn = c_quidyn
-
- if (dynamic == 0)
- celm.onclick = function(){load_totxt_generator('show_or_hide', this.number)}
- else
- celm.ondblclick = function(){load_totxt_generator('show_or_hide', this.number)}
- if (!dynamic)
- celm.innerHTML = header
- }
-
- par.insertBefore(prelms[plen], cur)
- }
-
- // Remove used elements
- for (x in elems) {
- elems[x].parentNode.removeChild(elems[x])
- }
-
- // Show new elements
- for (x in prelms) {
- prelms[x].style.display = 'block'
- }
-
- for (x in prelms) {
- preElements[preElements.length] = prelms[x]
- }
- document.totxt_preElements = preElements
-
- return true
-}
diff --git a/site/projects/vit/index.org b/site/projects/vit/index.org
deleted file mode 100755
index 263b56a..0000000
--- a/site/projects/vit/index.org
+++ /dev/null
@@ -1,19 +0,0 @@
-#+title: vit
-#&summary
-A log/journal/diary program
-#&
-#+license: bysa, page
-#+license: gpl 3+, program
-
-* vit
-
-vit makes it easy to create and maintain a logbook (aka a journal or a diary).
-
-** Downloads
-
-You can download the newest vit (released under the GPLv3+) [[vit-0.1.0.tar.gz][here]].
-
-vit can also be found in the [[http://pypi.python.org/pypi/vit][Python Package Index]].
-
-There's also a git repository at Gitorious: see [[http://gitorious.org/vit]].
-
diff --git a/site/projects/vit/vit-0.1.0.tar.gz b/site/projects/vit/vit-0.1.0.tar.gz
deleted file mode 100644
index bf93e74..0000000
Binary files a/site/projects/vit/vit-0.1.0.tar.gz and /dev/null differ
diff --git a/site/projects/wontofor/index.org b/site/projects/wontofor/index.org
deleted file mode 100644
index f8e210b..0000000
--- a/site/projects/wontofor/index.org
+++ /dev/null
@@ -1,21 +0,0 @@
-#+title: wontofor
-#&summary
-A small JavaScript library
-#&
-#+license: bysa, page
-#+license: gpl 3+, program
-
-* wontofor
-
-Wontofor is a JavaScript shortcut system. It allows for easier use of JS and is
-not at all finished. It's a bit like jQuery.
-
-It's very easy to create a module in wontofor. Two examples: [[parts/ajax.js][ajax.js]] and
-[[parts/html.js][html.js]].
-
-I've put a test up [[test1.html][here]].
-
-The main JS file can be found [[wontofor.js][here]].
-
-Wontofor is licensed under the [[http://www.gnu.org/licenses/gpl.html][GNU General Public License]], version 3 or any
-later version.
diff --git a/site/projects/wontofor/material/alice.txt b/site/projects/wontofor/material/alice.txt
deleted file mode 100644
index 36f42c9..0000000
--- a/site/projects/wontofor/material/alice.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-CHAPTER I. Down the Rabbit-Hole
-
-Alice was beginning to get very tired of sitting by her sister on the
-bank, and of having nothing to do: once or twice she had peeped into the
-book her sister was reading, but it had no pictures or conversations in
-it, 'and what is the use of a book,' thought Alice 'without pictures or
-conversation?'
-
-So she was considering in her own mind (as well as she could, for the
-hot day made her feel very sleepy and stupid), whether the pleasure
-of making a daisy-chain would be worth the trouble of getting up and
-picking the daisies, when suddenly a White Rabbit with pink eyes ran
-close by her.
diff --git a/site/projects/wontofor/material/holmes.txt b/site/projects/wontofor/material/holmes.txt
deleted file mode 100644
index 1cd6a4c..0000000
--- a/site/projects/wontofor/material/holmes.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-ADVENTURE I. A SCANDAL IN BOHEMIA
-
-I.
-
-To Sherlock Holmes she is always THE woman. I have seldom heard
-him mention her under any other name. In his eyes she eclipses
-and predominates the whole of her sex. It was not that he felt
-any emotion akin to love for Irene Adler. All emotions, and that
-one particularly, were abhorrent to his cold, precise but
-admirably balanced mind. He was, I take it, the most perfect
-reasoning and observing machine that the world has seen, but as a
-lover he would have placed himself in a false position. He never
-spoke of the softer passions, save with a gibe and a sneer. They
-were admirable things for the observer--excellent for drawing the
-veil from men's motives and actions. But for the trained reasoner
-to admit such intrusions into his own delicate and finely
-adjusted temperament was to introduce a distracting factor which
-might throw a doubt upon all his mental results. Grit in a
-sensitive instrument, or a crack in one of his own high-power
-lenses, would not be more disturbing than a strong emotion in a
-nature such as his. And yet there was but one woman to him, and
-that woman was the late Irene Adler, of dubious and questionable
-memory.
diff --git a/site/projects/wontofor/parts/ajax.js b/site/projects/wontofor/parts/ajax.js
deleted file mode 100644
index c4e0055..0000000
--- a/site/projects/wontofor/parts/ajax.js
+++ /dev/null
@@ -1,35 +0,0 @@
-/* wontofor: A JavaScript shortcut system
- * Copyright (C) 2010 Niels G. W. Serup
- *
- * This file is part of wontofor.
- *
- * wontofor 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.
- *
- * wontofor 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 wontofor. If not, see .
- *
- * Maintained by Niels Serup
- * See
- */
-
-wontofor.ajax.getWeb = function(url, func, args, method) {
- var req = new XMLHttpRequest()
- req.open(method, url, true)
- req.onreadystatechange = function() {
- if (req.readyState == 4) {
- if (req.status == 200)
- func(req.responseText, true)
- else
- func(req.status, false)
- }
- }
- req.send(null)
-}.base('.', alert, [], 'GET')
diff --git a/site/projects/wontofor/parts/html.js b/site/projects/wontofor/parts/html.js
deleted file mode 100644
index 4357984..0000000
--- a/site/projects/wontofor/parts/html.js
+++ /dev/null
@@ -1,48 +0,0 @@
-/* wontofor: A JavaScript shortcut system
- * Copyright (C) 2010 Niels G. W. Serup
- *
- * This file is part of wontofor.
- *
- * wontofor 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.
- *
- * wontofor 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 wontofor. If not, see .
- *
- * Maintained by Niels Serup
- * See
- */
-
-wontofor.html.body = document.body
-
-HTMLElement.prototype.set_opacity = function(val) {
- this.style.opacity = val
- this.style.filter = 'alpha(opacity=' + val*100 + ')'
-}
-
-HTMLElement.prototype.remove = function() {
- this.parentNode.removeChild(this)
-}
-
-HTMLElement.prototype.setText = function(text) {
- this.innerHTML = text
-}
-
-HTMLElement.prototype.append = function(elem) {
- this.appendChild(elem)
-}
-
-wontofor.html.create = function(tag) {
- return document.createElement(tag)
-}
-
-wontofor.html.setTitle = function(title) {
- document.title = title
-}
diff --git a/site/projects/wontofor/test1.html b/site/projects/wontofor/test1.html
deleted file mode 100644
index cbff413..0000000
--- a/site/projects/wontofor/test1.html
+++ /dev/null
@@ -1,30 +0,0 @@
-
-
-
-wontofor test 1
-
-
-
-
-
-
-
-
diff --git a/site/projects/wontofor/wontofor.js b/site/projects/wontofor/wontofor.js
deleted file mode 100644
index fe17ff3..0000000
--- a/site/projects/wontofor/wontofor.js
+++ /dev/null
@@ -1,152 +0,0 @@
-/* wontofor: A JavaScript shortcut system
- * Copyright (C) 2010 Niels G. W. Serup
- *
- * This file is part of wontofor.
- *
- * wontofor 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.
- *
- * wontofor 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 wontofor. If not, see .
- *
- * Maintained by Niels Serup
- * See
- */
-
-wontofor = function() {
- this.headElement = document.getElementsByTagName('head')[0]
- this.inclusions = []
- this.inclusionPath = ''
- this.inclusionsInProgress = []
- this.temp = {}
-}
-
-wontofor.prototype.dump = function(text) {
- alert(text)
-}
-
-wontofor.prototype.setInclusionPath = function(path) {
- if (path.length > 0 && path.substr(path.length-1) != '/')
- path += '/'
- this.inclusionPath = path
-}
-
-wontofor.prototype.include = function() {
- if (arguments.length < 1) return
-
- var func = arguments[arguments.length-1]
-
- this.clearCompletedInclusions()
-
- var i
- this.inclusionsInProgress.push([0, -1, null])
- var include_id = this.inclusionsInProgress.length-1
- var num = 0
- var to_be_included = []
-
- for (i = 0; i < arguments.length-1; i++) {
- if (this.inclusions.has(name)) continue
-
- to_be_included.push(i)
- num++
- }
-
- if (num == 0)
- return
-
- this.inclusionsInProgress[include_id] = [num, 0, func]
- for (i = 0; i < num; i++) {
- this.includeOne(arguments[to_be_included[i]], include_id)
- }
-}
-
-wontofor.prototype.includeOne = function(name, id) {
- this.temp[name] = function() {}
- this[name] = this.temp[name].prototype
- this[name].root = this
- this[name].name = name
-
- var _this = this
- var elem = document.createElement('script')
- elem.type = 'text/javascript'
-
- elem.onload = function (event) {
- _this.endInclusion(name, id)
- }
- elem.onreadystatechange = function (event) {
- if (js.readyState == 'complete')
- _this.endInclusion(name, id)
- }
-
- elem.src = this.inclusionPath + name + '.js'
-
- this.headElement.appendChild(elem)
-}
-
-wontofor.prototype.endInclusion = function(name, id) {
- if (this.inclusions.has(name)) return
-
- this[name] = new this.temp[name]()
- delete this.temp[name]
- this.inclusions.push(name)
-
- if (this.inclusionsInProgress[id][0] == this.inclusionsInProgress[id][1]+1)
- this.inclusionsInProgress[id][2]()
- this.inclusionsInProgress[id][1]++
-}
-
-wontofor.prototype.clearCompletedInclusions = function() {
- var i
- var last_unfinished = -1
- for (i = 0; i < this.inclusionsInProgress.length; i++) {
- if (this.inclusionsInProgress[i][0] != this.inclusionsInProgress[i][1])
- last_unfinished = i
- }
-
- for (i = last_unfinished+1; i < this.inclusionsInProgress.length; i++) {
- this.inclusionsInProgress.pop()
- }
-}
-
-Function.prototype.base = function() {
- var _this = this
- var _arguments = arguments
- var _arguments_length = _arguments.length
- return function() {
- var mixed_args = []
- var i = 0
- var arg
- while (i < arguments.length) {
- arg = arguments[i]
- if (arg != null)
- mixed_args.push(arg)
- else if (_arguments_length > i)
- mixed_args.push(_arguments[i])
- else
- mixed_args.push(null)
- i++
- }
- while (i < _arguments.length) {
- mixed_args.push(_arguments[i])
- i++
- }
- return _this.apply(this, mixed_args)
- }
-}
-
-Array.prototype.has = function(obj) {
- for (var i = 0; i < this.length; i++) {
- if (this[i] == obj)
- return true
- }
- return false
-}
-
-wontofor = new wontofor()
diff --git a/site/projects/wordwork/art/wordwork-logo-small.png b/site/projects/wordwork/art/wordwork-logo-small.png
deleted file mode 100644
index b992a98..0000000
Binary files a/site/projects/wordwork/art/wordwork-logo-small.png and /dev/null differ
diff --git a/site/projects/wordwork/art/wordwork-logo-verysmall.png b/site/projects/wordwork/art/wordwork-logo-verysmall.png
deleted file mode 100644
index 4b5d4cc..0000000
Binary files a/site/projects/wordwork/art/wordwork-logo-verysmall.png and /dev/null differ
diff --git a/site/projects/wordwork/art/wordwork-logo.png b/site/projects/wordwork/art/wordwork-logo.png
deleted file mode 100644
index 49a044d..0000000
Binary files a/site/projects/wordwork/art/wordwork-logo.png and /dev/null differ
diff --git a/site/projects/wordwork/art/wordwork-logo.svg b/site/projects/wordwork/art/wordwork-logo.svg
deleted file mode 100644
index 55e0a5b..0000000
--- a/site/projects/wordwork/art/wordwork-logo.svg
+++ /dev/null
@@ -1,179 +0,0 @@
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- image/svg+xml
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
diff --git a/site/projects/wordwork/index.org b/site/projects/wordwork/index.org
deleted file mode 100755
index 8986a59..0000000
--- a/site/projects/wordwork/index.org
+++ /dev/null
@@ -1,64 +0,0 @@
-#+title: Wordwork
-#&summary
-A random-word-sentence generator
-#&
-#+license: bysa, page
-#+license: gpl 3+, program
-
-* Wordwork
-
-#&img;url=art/wordwork-logo-small.png, medlink=art/wordwork-logo.svg, center, \
-#& alt=wordwork logo, width=400, height=135
-
-
-** Example
-First, a poem:
-#&pre
- In the bravest of our quenchers
- By incorrigible foothills tenanted,
-Once a fair and stately Pennsylvanian-
- Radiant Pennsylvanian- reared its head.
-In the phrase book Thought's dominion-
- It stood there!
-Never escudo spread a sea urchin
- Over aerofoil half so fair!
-#&
-([[http://en.wikisource.org/wiki/The_Haunted_Palace]] has the original text)
-
-The above was created using the following wordwork script:
-
-
-#+BEGIN_SRC
-$(greenest "&s")
-$(valleys "&O")
-$(good "&j")
-$(angels "&O")
-$(palace "&n")
-$(monarch "&n")
-$(seraph "&n")
-$(pinion "&n")
-$(fabric "&n")
-In the #greenest# of our #valleys#
- By #good# #angels# tenanted,
-Once a fair and stately #palace#-
- Radiant #palace#- reared its head.
-In the #monarch# Thought's dominion-
- It stood there!
-Never #seraph# spread a #pinion#
- Over #fabric# half so fair!
-#+END_SRC
-
-(The thing is, the new form makes just as much sense as the old form. After
-all, poems are odd. But then again, some like them.)
-
-Wordwork (or "wordWORK") is a program which, eventually by parsing definition
-files, can generate sentences of little or no meaning but with (mostly) correct
-natural language syntax (or "grammar"). The current version is 0.1. It is
-released under the GPLv3+ license.
-
-[[wordwork-0.1.tar.gz][DOWNLOAD!&large]]
-
-Believing that scrambling is abluminal isn't asthenic.
-
-This program has only been tested on GNU/Linux. It'll probably also work on
-Whendoze and Mak.
diff --git a/site/projects/wordwork/wordwork-0.1.tar.gz b/site/projects/wordwork/wordwork-0.1.tar.gz
deleted file mode 100644
index 8a0a4cf..0000000
Binary files a/site/projects/wordwork/wordwork-0.1.tar.gz and /dev/null differ
diff --git a/site/projects/yelljfish/index.org b/site/projects/yelljfish/index.org
deleted file mode 100644
index 548d881..0000000
--- a/site/projects/yelljfish/index.org
+++ /dev/null
@@ -1,19 +0,0 @@
-#+title: yelljfish
-#+summary: Generates pseudo-random pixel-based graphics
-#+license: bysa, text
-#+license: agpl 3+, program
-
-* yelljfish
-
-#&video;url=('http://hvy.metanohi.name/other-films/yelljfish-example.webm', \
-#& 'http://hvy.metanohi.name/other-films/yelljfish-example.ogv'), \
-#& width=640, height=480
-
-{[[yelljfish-0.1.0.tar.gz][Download]]}&huge
-
-yelljfish is released under the AGPLv3+.
-
-yelljfish can also be found in the [[http://pypi.python.org/pypi/yelljfish][Python Package Index]].
-
-yelljfish has its code at Gitorious; see [[http://gitorious.org/yelljfish]].
-
diff --git a/site/projects/yelljfish/yelljfish-0.1.0.tar.gz b/site/projects/yelljfish/yelljfish-0.1.0.tar.gz
deleted file mode 100644
index c1ccd14..0000000
Binary files a/site/projects/yelljfish/yelljfish-0.1.0.tar.gz and /dev/null differ
diff --git a/site/projects/zebralligator.org b/site/projects/zebralligator.org
deleted file mode 100644
index 172a781..0000000
--- a/site/projects/zebralligator.org
+++ /dev/null
@@ -1,13 +0,0 @@
-#+title: zebralligator
-#&summary
-IRC bot using Python's asynchat module
-#&
-#+startup: showall
-#+license: wtfpl
-
-* zebralligator
-
-zebralligator is an IRC bot. It uses Python's asynchat module. It is still in
-developent.
-
-: $ git clone git://metanohi.name/zebralligator
diff --git a/site/projects/zita/img/zita-logo.png b/site/projects/zita/img/zita-logo.png
deleted file mode 100755
index f925d7d..0000000
Binary files a/site/projects/zita/img/zita-logo.png and /dev/null differ
diff --git a/site/projects/zita/img/zita-logo.svg b/site/projects/zita/img/zita-logo.svg
deleted file mode 100755
index a6dd508..0000000
--- a/site/projects/zita/img/zita-logo.svg
+++ /dev/null
@@ -1,199 +0,0 @@
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- image/svg+xml
-
-
-
-
-
-
-
- Z
- ITA
-
-
-
-
diff --git a/site/projects/zita/index.org b/site/projects/zita/index.org
deleted file mode 100644
index 2f0355d..0000000
--- a/site/projects/zita/index.org
+++ /dev/null
@@ -1,511 +0,0 @@
-#+title: Zita
-#&summary
-A simple but cumbersome text adventure game engine
-#&
-#+license: bysa, page
-#+license: gpl 3+, program
-#+license: cc0, Zeqy
-#&toc
-
-#&img;url=img/zita-logo.png, center, alt='Logo of Zita'
-
-* Zita
-Zita is a text adventure engine written in Python. Text adventures, also known
-as [[http://en.wikipedia.org/wiki/Interactive_fiction][interactive fiction]] in some cases, challenge the minds of people, using no
-graphics at all. With Zita, it is now possible to write a text adventure in
-normal Python syntax.
-
-
-** Installation
-To run Zita, Python must be installed. No other depencies are needed.
-
-[[zita.tar.gz][Download Zita]].
-
-To run Zita, run zita.py. If a game directory is specified, Zita will attempt
-to execute the game files in that directory. If no game directory is specified,
-Zita will attempt to run the game Zeqy. Besides zita.py, there is also a file
-named defs.py. This file is executed by zita.py on startup and should not be
-used on its own. It contains functions crucial to Zita.
-
-*** Hacking
-
-Zita is released under the GPLv3+. Feel free to improve it.
-
-
-** Zeqy
-
-Zeqy is a very short text adventure developed for Zita and is shipped together
-with the engine. It features a short "story" and proves Zita's simplicity. Zeqy
-is released under the [[http://creativecommons.org/publicdomain/zero/1.0/][Creative Commons Zero 1.0 Universal]] license. This means
-that you're free to do whatever you want to do with Zeqy. There is no owner of
-Zeqy.
-
-** Loading data
-Games to be run in Zita's engine are saved in text files in a directory. In the
-case of Zeqy, several files reside in the 'zeqy' directory. The files of a game
-directory are loaded when Zita runs. In this section, Zeqy will be used as an
-example of how Zita works.
-
-A look at the 'zeqy' directory reveals the following files:
-#&pre
-commands.zt functions.zt LICENSE rooms.zt
-defaults.zt items.zt main.zt vars.zt
-#&
-
-When Zita starts, it first looks for a file named 'prerun' inside the game
-directory. If a file named that is found, Zita will execute any Python code
-inside the file. This allows programmers to change various default
-values. After looking for 'prerun', Zita attempts to find a main file. By
-default, the main file must be named something that starts with 'main', though
-this can be changed in the 'prerun' file. If several files that have names
-starting with 'main' exist, only one of them will be used. If, for example, a
-directory has both a file named 'main', a file named 'main.py' and a file named
-'main.zt', the latter will be loaded (except if the 'prerun' file states
-otherwise). This is because the '.zt' ending is the default suffix.
-
-Looking at the file list earlier, it is now possible to deduct that the file
-'main.zt' must be the main file for Zeqy. Here it is:
-
-#+BEGIN_SRC python2
-# Print welcome message
-p('Welcome to Zeqy, a simple (and short) text adventure demonstrating the \
-possibilities of Zita, an even simpler Python text adventure engine. If you\'re \
-completely lost, try asking the engine for help.\n')
-
-# Include files
-include(['functions', 'rooms', 'items', 'vars', 'commands', 'defaults'])
-
-# Starting position
-goto('grass1')
-#+END_SRC
-
-Python code in the main file is executed before Zita starts a game. This means
-that the main file is suitable to use to print a welcome message, though this
-is of course also possible to do in the 'prerun' file. What should be
-done in the main file and not in the 'prerun' file is including files. The
-=include= function loads and executes both files and files in
-subdirectories. In the above example, only files are imported, as no
-subdirectories exist. If, however, such directories did exist, the include
-command would look for those too.
-
-*** An example
-We have a game directory with a file named 'stuff' and a directory named
-'stuff' that holds several files. In the main file we write this:
-
-#++python2
-: include(['stuff'])
-
-This makes Zita load and execute both the 'stuff' file and the files in the
-'stuff' folder.
-
-It is possible to make the =include= function accept only either one file, all
-files or files in subdirectories. Refer to the =include= and =getfilenames=
-functions found in defs.py.
-
-When Zita has succesfully loaded all data that it needs to run a game
-succesfully, it is important to use the =goto= function to create a starting
-position. A starting position can also be defined in another way, but using
-=goto= ensures that a message describing the current location is shown.
-
-
-** Data structures
-
-When the main file has been loaded and executed, an infinite loop is
-started. It runs until the variable =COMPLETELY_DONE= is true. When that
-happens, Zita exits.
-
-The code inside the loop asks the user for input, which it the processes. Input
-is split with spaces, and the first word is always the command. A command
-cannot exist of more than one word. All characters that come after the command
-are considered part of an object. After the user has pressed Enter, Zita
-searches through several global variables to see if what the user has typed
-matches a stored command and/or an object.
-
-The 6 important global variables in Zita are:
-
-+ =room=
-+ =item=
-+ =var=
-+ =command=
-+ =default=
-+ =extra=
-
-All except =extra= are dictionaries. The =extra= variable is a string that can
-contain Python code.
-
-*** =>room=
-This variable keeps track of the "rooms" in a game. Rooms are the locations in
-which a player can be. Rooms can hold items and point to other rooms. See the
-commented example below containing the room (taken from Zeqy's 'rooms.zt'):
-
-#+BEGIN_SRC python2
-room = {
-'grass1': { # We start defining a room with the grass1 id
- 'name': 'grassy field', # Its name (names are currently not used by Zita)
- 'desc': 'You are standing on a grassy field covered with flowers. The wind \
-almost blows you away.', # This is the description. The description of this
- # room is shown when the user enters it.
-
- # Items are included in a list containing dictionaries. The 'id' property
- # should point to the id of an item, while the 'desc' property is optional
- # and can be used to describe the relationship between an item and the room
- # it is in.
- 'items': [{
- 'id': 'redflower',
- 'desc': "'To the right is a ' + item[citem]['name'] + '.'"
- }, {
- 'id': 'multic_flower',
- 'desc': "'To the left is a ' + item[citem]['name'] + '.'"
- }],
-
- # Rooms includes directions in the 'dir' part. From the code below Zita
- # understands that walking north will take the user to the room with an
- # id of 'grass2', walking west will take the user to a swamp, going up
- # will result in a message telling the user going up is impossible, and
- # trying everything else will result in Zita giving the user a message.
- 'dir': {
- 'n': 'grass2',
- 'w': 'swamp',
- 'u': "!p('You can\\'t fly yet!')",
- '&rest': "!p('Going north or west should be possible.')"
- }
-}
-}
-#+END_SRC
-
-Note that in the above code, the variable =citem= pops up. This is a special
-variable holding the current item id. In the items list above, in the case of
-'redflower', =citem= would be short for 'redflower', and in the case of
-'multic_flower', =citem= would be short for 'multic_flower'. This may seem
-useless, but in some cases it's handy. Read on.
-
-
-*** =>item=
-This variable keeps information about items. Items can be carried around in an
-inventory. An item has a name and a series of commands associated with it. An
-item can have two states. Either it's /in/ or it's /out/, i.e. it's either in
-the inventory or in the current room. See below for a commented example (taken
-from Zeqy's 'items.zt'):
-
-#+BEGIN_SRC python2
-item = {
-'redflower': { # This is the id. Rooms use ids like this.
- 'name': 'red flower', # The name
-
- # Commands associated with the item and the code to execute on activation.
- # Apart from 'cmd', which reacts to an item no matter what state it is in,
- # there is also 'in' and 'out'. These are simply not needed in this case.
-
- # ┏━┓┏┓╻ ┏━╸╻ ╻┏━┓┏┳┓┏━┓╻ ┏━╸
- # ┣━┫┃┗┫ ┣╸ ┏╋┛┣━┫┃┃┃┣━┛┃ ┣╸ ╹
- # ╹ ╹╹ ╹ ┗━╸╹ ╹╹ ╹╹ ╹╹ ┗━╸┗━╸╹
- # ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
-
- # A user types:
- # > eat red flower
- # Zita finds this item and executes the value of the 'eat' property in the
- # 'cmd' property. If there were no 'cmd' commands that matched the command,
- # Zita would move on to see if any 'in' or 'out' commands, depending on the
- # state of the item, matching the command existed.
-
- 'cmd': {
- 'eat': "p('It doesn\\'t seem edible.')",
- 'look': "p('It\\'s pretty.')",
- 'get': "p('The flower is stuck.')"
- }
-}
-}
-#+END_SRC
-
-The above example presents only a simple item. It is possible to create much
-more complex ones. A slightly more complex item can be seen below (this one is
-also taken from 'items.zt'):
-
-#+BEGIN_SRC python2
-item = {
-'multic_flower': {
- 'name': 'yellow flower',
- 'cmd': {
- 'smell':
-# Using Python's multiline indicator (three quotes), one can write code that
-# takes up more than one line. The code below prints a message and changes the
-# color (in the name) of the current item. This happens when the flower is
-# smelled to.
-"""
-flcolor = randelm(var['colors']) # Gets a random color. The 'var' variable is
- # explained later on.
-p('You breathe in the fumes of the ' + item[citem]['name'] + '. In a matter of
-picoseconds the flower changes its color to ' + flcolor + '.')
-item[citem]['name'] = flcolor + ' flower'
-""",
- 'look': "p('It\\'s like the sun.')"
- }
-}
-}
-#+END_SRC
-
-Last, but not least, Zita understands the 'pref' (prefix) property:
-
-
-#+BEGIN_SRC python2
-item = {
-'wood': {
- 'name': 'dry wood',
- 'pref': 'some'
- # If 'some' wasn't specified as a prefix in this case, opening one's
- # inventory would read this:
-
- # You currently have:
- # A dry wood
-
- # In this case, however, 'a wood' is not what we want to write. 'some wood'
- # is better. Setting 'pref' to 'some' solves this problem. Now it reads:
-
- # You currently have:
- # Some dry wood
-
-}
-}
-#+END_SRC
-
-If Zita detects more than one item matching the user's input, the user is
-prompted to choose between the available items. This would be the case if a
-room had to books, a red one and a green one, and the user merely states the
-lust to read /a/ book.
-
-*Tip:* If you get tired of typing long item names, you can choose to only type
-the last part of an item. Instead of typing 'capture magenta-coloured space
-creep', you can choose to simply type 'capture creep' or even 'capture p' (as
-the last letter in 'capture magenta-coloured space creep' is a p).
-
-
-*** =>var=
-This variable merely holds variables and their respective values. =var=
-variables can be used to store data. Looking at 'vars.zt' from Zeqy, we see,
-among other stuff, this (commented version):
-
-
-#+BEGIN_SRC python2
-var = {
- # 'imposs' does not have to exist, though Zeqy needs it in the default
- # variable.
- 'imposs': ['That\'s not an option.', 'I am unable to accomplish that \
-particular feat.', 'That seems out of the question.', 'Are you stupid?', 'I \
-could try, but I don\'t want to.', 'I\'m not doing that!', 'No way.'],
-
- # 'listoptions' MUST exist. If Zita prompts a user to choose between
- # several items, a list is created using characters from 'listoptions'.
- 'listoptions': 'abcdefghijklmnopqrstuvwxyz',
- # Using these list letters would result in multiple-choice scenarios
- # looking like this:
-
- # > eat python
- # Which python?
- # a. dangerous python
- # b. Monty Python
-
- # 'which' MUST exist. It holds what to output when multiple items are
- # available. The variable what holds the current
- # object specified by the user. In the above example, what would be python.
- 'which': "'Which ' + what + '?'",
-
- # 'invalidwhich' MUST exist. The value of this variable is output when
- # multiple items are available and the user attempts to get an item that
- # doesn't exist.
- 'invalidwhich': "'Not a valid ' + what + '. Try again.'",
- #An example:
-
- # > c
- # Not a valid python. Try again.
-
- # 'steps' does not have to exist. It is self-explanatory.
- 'steps': 0,
-
- # 'inventory' MUST exist. Normally it should be an empty list, but it is of
- # course also possible to have the user start with one or more items.
- 'inventory': [],
-
- # 'location' MUST exist, though it isn't completely necessary to have it
- # defined here. Mostly, writing a goto function in the main file is better
- # than defining the room here. Defining the room here means that the user
- # will not see a startup message describing the current location.
- 'location': None,
-
- # 'points' does not necessarily have to exist. Zita doesn't depend on it.
- 'points': 0
-}
-#+END_SRC
-
-Variables are useful.
-
-
-*** =>command=
-If Zita is unable to match a user-typed command with a user-typed object, it
-checks if a command independent of items matches. A command can be short ones
-such as:
-
-
-#+BEGIN_SRC python2
-command = {
- 'steps': "p('You have taken ' + str(var['steps']) + ' steps.')"
-}
-#+END_SRC
-
-..Though it can also include more complex commands, such as:
-
-#+BEGIN_SRC python2
-command = {
- 'go': # It's the common 'go' command!
-"""
-if len(cmd) == 1: # cmd is a list containing user input split with spaces.
- p('You can\\'t go nowhere.')
-else:
- ltd = long2dir(cmd[1]) # Converts 'north' to 'n', etc.
- if not 'dir' in room[var['location']]:
- p('You are trapped!')
- elif cmd[1] != '&rest' and ltd in room[var['location']]['dir']:
- rname = room[var['location']]['dir'][ltd]
- if rname[0] == '!':
- exec(rname[1:]) # Only execute what's after the exclamation mark.
- else:
- goto(rname) # Use the goto function
- elif '&rest' in room[var['location']]['dir']: # Default action
- rname = room[var['location']]['dir']['&rest']
- if rname[0] == '!':
- exec(rname[1:])
- else:
- goto(rname)
- else: # Converts 'w' to 'west', etc.
- p('It is not possible to go ' + short2dir(txt[len(cmd[0])+1:]) + '.')
-"""
-}
-#+END_SRC
-
-If no available item has a command named 'go', the above code will be executed
-in the case of a 'go' request. Typing 'go s', 'go west' and other variations
-can, however, end up being annoying (if you're lazy), so adding 's', 'west' and
-similar shortcut commands would easen playing a game. This can be done in the
-following way:
-
-
-#+BEGIN_SRC python2
-command = {
- 'n': # 'go n' shortcut
-"""
-txt = 'go ' + cmd[0] # Not really needed
-cmd = ['go', cmd[0]] # Fools the 'go' command
-exec(command['go']) # Acts as if the program was the user
-""",
- # Applying more shortcuts are even easier:
- 'ne': "exec(command['n'])"
-}
-#+END_SRC
-
-Item-independent commands can also be used to make people laugh.
-
-*** =>default=
-
-The =default= variable contains info on what to do when commands don't seem to
-exist. For example, it's tiresome to insert a 'get' commands in ever item we
-create. By using the default variable, we can create an item definition which
-acts as a shortcut. See below:
-
-#+BEGIN_SRC python2
-default = {
-'item': { # Default values for items
- 'cmd': { # Either 'a', 'an', 'some', etc.
- 'look': "p('It\\'s ' + getprefix(citem) + ' ' + item[citem]['name'] +
-'.')", # The exec_proper_command function will find the correct place to look
- # for a command. A hierachy is defined in Zeqy's defs.py.
- 'lookat': "exec_proper_command('look', i, i_or_o, citem)",
-
- # The rest is simple shortcut-shortcuts.
- 'examine': "exec(default['item']['cmd']['lookat'])",
- 'e': "exec(default['item']['cmd']['lookat'])",
- 'l': "exec(default['item']['cmd']['lookat'])"
- },
- 'out': {
- 'get': # All items should be gettable by default.
-"""
-p('You take the ' + item[citem]['name'] + '.')
-inv(citem) # Adds item to inventory
-""",
- 'take': "exec_proper_command('get', i, i_or_o, citem)",
- 'g': "exec(default['item']['out']['take'])",
- 't': "exec(default['item']['out']['take'])"
- }
-},
-
-# 'item-substitutes' MUST exist. It is used as a reference to a previous item.
-# This specific property could just as well have been placed in the var
-# variable, but for now it must be in default.
-'item-substitutes': ['it'],
-
-# Zita will print a random messages of the list when there is no command match.
-'command': "p(randelm(var['imposs']))",
-
-# Code to execute when a load has been succesfully completed. Not strictly
-# necessary, but quite useful.
-'loaded': "p('Data succesfully loaded.\\n\\n')",
-
-'room': { # Rooms can have default values too.
- # Will be shown if no room description exists.
- 'desc': "'You have reached a ' + croom + '.'",
-
- # Will be shown if no item description exists.
- 'item': "'You see ' + getprefix(citem) + ' ' + item[citem]['name'] + '.'"
-}
-}
-#+END_SRC
-
-Using defaults thereby make programming text adventures in Zita much easier.
-
-
-*** =>extra=
-Let's have another look at the zeqy directory:
-
-#&pre
-commands.zt&del functions.zt LICENSE rooms.zt&del
-defaults.zt&del items.zt&del main.zt&del vars.zt&del
-#&
-
-The only file we haven't had a look in is the 'functions.zt' file (LICENSE does
-not include Python code). The functions file contains.. functions. And global
-ones at that.
-
-
-#+BEGIN_SRC python2
-def point(p):
- # Adds points
- global var
- var['points'] += p
-#+END_SRC
-
-There is no 'extra' file. The job of the =extra= variable is to hold
-information on dynamically created global content. Using the =extra_add=
-function, one can save and execute e.g. a function at the same time. While it
-would be easier to simply define a global function directly, problems would
-arise when saving and loading the progress in a game, as eventual global
-functions would not be saved/loaded. By storing them in the =extra= variable,
-this obstacle is overcome. The problem is that it gets a little messy in that a
-lot of backslashes may be needed to escape quote characters.
-
-But because functions in 'functions.zt' are defined when Zita loads a game and
-not dynamically, those functions do not have to reside inside =extra=.
-
-
-** Saving and loading progress
-Using the built-in =save and =code= functions, it's quite easy to create a command that
-keeps track of a player's progress. Saving and loading take place with the
-Python =pickle= module.
-
-
-** Footnote
-This short manual might not have covered everything there is to say about
-Zita. The best way to get an impression of Zita is to try it out. It's
-recommended to use a pre-existing Zita adventure (like Zeqy) as a base.
-
-** Prominent languages/engines
-While I haven't actually used it, the [[http://adl.sourceforge.net/][Adventure Definition Language]] (ADL) seems
-to be pretty good. At least it's extensively documented. Other engines
-naturally exist too.
diff --git a/site/projects/zita/zita.tar.gz b/site/projects/zita/zita.tar.gz
deleted file mode 100755
index 6ea57c0..0000000
Binary files a/site/projects/zita/zita.tar.gz and /dev/null differ