Development
0.0
Site
1. Introduction
2. Software development model
3. Control Structures
4. Logic
4.1. Logic symbols
4.2. Notation
4.3. Combinatorics
4.4. Boolean functions and truth tables
4.4.1. Universal lookup function
4.4.2. Nullary Boolean functions
4.4.3. Unary Boolean functions
4.4.4. Binary Boolean functions
4.5. Mask operation
4.5.1. Clearing data bits
4.5.2. Setting data bits
4.5.3. Inverting data bits
4.5.4. Other mask operations
4.6. Functional completeness
4.6.1. Composition of Boolean functions with NOT and AND
4.6.1.1. Composing nullary functions from NOT and AND
4.6.1.2. Convenience definition of OR
4.6.2. Universal composition function
4.6.2.1. Unary functions defined by composition function
4.6.2.2. Example composition function for
\(f^3_{23}\)
5. Source Control Management
5.1. Kallithea
5.2. Mercurial Repository Trimming
6. Shell basics
6.1. Job Control
6.2. POSIX
6.2.1. Conventions for Syntax Descriptions
6.2.1.1. Specific Conventions in Templated Shell Scripts
6.3. Special Purpose Language vs. Generic Programming Language
6.3.1. Variable expansion
6.3.2. echo (1) , printf(1)
6.3.3. Avoid special bash syntax
6.3.4. Do not use arrays
6.4. WRF loop - single line processing in shell
6.4.1. WRF loop
6.4.2. WRF loop with standard IFS split
6.4.3. WRF loop with special IFS split
6.4.4. split and process lines with awk(1)
6.5. Single quoting
6.6. Construct correctly quoted shell script
6.6.1. Preparations
6.6.2. Single quoted string
6.6.3. HERE document
6.7. Command execution
6.8.
.
command
6.9. Subshell and compound commands
7. Shell Wildcards and Filenames
7.1. Glob pattern expansion
7.2. Non-matching glob patterns
7.3. Directory separator and illegal characters
7.3.1. 7-bit ASCII, printable, without directory separator and illegal characters
8. Shell Tools
8.1. dir_to_dot.sh - generate dot(1) graph from directory
9. Python
9.1. Language extensions
10. Common Lisp
11. Evaluating algorithms
11.1. Big O notation
11.2. Bakado - the way of the idiot
11.2.1. Proving
\(f(n) \in o(g)\)
11.2.2. Proving
\(f(n) \in O(g)\)
11.3. Taidanado - the way of the lazy
11.4. Satori o aita tensaido - the way of the enlightened genius
12. Exchange variables without temporary variable
12.1. Bewerbungsgespräch
12.2. Hardware
12.3. Software
12.3.1. Assembler
12.3.2. Interpreter
12.3.2.1. XOR Lösung
12.3.2.2. NORMALE LÖSUNG
12.3.3. Compiler
12.3.4. Details
13. MOV is Turing-complete
14. Markup converter design
14.1. Direct conversion between markup languages
14.2. Conversion via central abstract DOM
15. shell PIDs
16. Emacs Extension
16.1. Emacs-Erweiterungen mit Cut-Paste-Modify
16.1.1. Erst mal Proof-of-Concept
16.1.2. Der Makro
16.1.3. Die Funktion
16.1.3.1. Was muss man haben
16.1.3.2. Welche Vorlage benutzt man?
16.1.3.3. Umgang mit Klammerausdrücken
16.1.3.4. Erst mal die absoluten Basics
16.1.3.5. Butter bei die Fische
16.1.3.6. Das Sahnehäubchen
17. klicki-bunti-und-das-fliewatüüt
18. Shell Option Evaluation Loop
18.1. Shell Commmand Grammar
18.2. Option Loop Activity Diagram
18.3. Option Loop Template
18.4. Snippet for defining an option
18.4.1. Example options
18.4.1.1. No parameters
18.4.1.2. All parameters = ::fillme::
18.4.1.3. opt_short = q, opt_long = quiet-day
18.4.1.4. opt_short = q, opt_arg = INT
18.4.1.5. opt_short = q, opt_long = quiet-day, opt_arg = INT
18.4.1.6. opt_long = quiet-day, opt_arg = INT
18.4.2. Option generator snippet
General Index
Page
Index
A
A
abbr
Abbreviation