diff options
Remove page, category functionality as it is now provided by `tree.kummerlaender.eu`
35 files changed, 13 insertions, 876 deletions
diff --git a/source/00_content/articles/2014-09-13_lessons_learned_in_five_years_of_self_hosting.md b/source/00_content/articles/2014-09-13_lessons_learned_in_five_years_of_self_hosting.md index 3b38751..a832e68 100644 --- a/source/00_content/articles/2014-09-13_lessons_learned_in_five_years_of_self_hosting.md +++ b/source/00_content/articles/2014-09-13_lessons_learned_in_five_years_of_self_hosting.md @@ -28,14 +28,14 @@ If you should have further questions on my experience with self-hosting feel fre [SheevaPlug]: /tag/sheevaplug/ [Marvell SheevaPlug]: https://www.globalscaletechnologies.com/t-sheevaplugdetails.aspx -[statically generated]: /page/this_website/ +[statically generated]: https://tree.kummerlaender.eu/projects/xslt/blog/ [Tarsnap]: http://tarsnap.com [single board computer]: http://linuxgizmos.com/top-10-hacker-sbcs-survey-results/ [NoIP]: http://noip.com [DynDNS]: http://dyndns.com [FreedomBox]: http://freedomboxfoundation.org/ [ArkOS]: https://arkos.io/ -[contact]: /page/contact/ +[contact]: https://tree.kummerlaender.eu/contact/ [^1]: e.g. when one is able to access ones eMail and personal data repository in addition to the full private subnet from thousands of kilometers away [^2]: respectively a successor such as e.g. a _GuruPlug_ diff --git a/source/00_content/articles/2014-10-30_expanding_xslt_using_xalan_and_cpp.md b/source/00_content/articles/2014-10-30_expanding_xslt_using_xalan_and_cpp.md index 07c12de..05c08db 100644 --- a/source/00_content/articles/2014-10-30_expanding_xslt_using_xalan_and_cpp.md +++ b/source/00_content/articles/2014-10-30_expanding_xslt_using_xalan_and_cpp.md @@ -78,9 +78,9 @@ This `constructDocument` method receives all parameters declared in the `Functio [^1]: e.g. extension elements instead of only extension functions [^2]: [`read-file`], [`write-file`], [`read-directory`], [`external-command`] and [`generate`] -[static site generation framework]: /page/static_xslt/ -[this website]: /page/this_website/ -[set of external functions]: /page/input_xslt/ +[static site generation framework]: https://tree.kummerlaender.eu/projects/xslt/static_xslt/ +[this website]: https://tree.kummerlaender.eu/projects/xslt/blog/ +[set of external functions]: https://tree.kummerlaender.eu/projects/xslt/input_xslt/ [Apache Xalan]: http://xalan.apache.org/xalan-c/index.html [Xerces]: http://xerces.apache.org/xerces-c/index.html [`xalan::Function`]: https://xalan.apache.org/xalan-c/apiDocs/classFunction.html @@ -99,5 +99,5 @@ This `constructDocument` method receives all parameters declared in the `Functio [`external-command`]: https://github.com/KnairdA/InputXSLT/blob/master/src/function/external_command.h [`generate`]: https://github.com/KnairdA/InputXSLT/blob/master/src/function/generate.h [base class]: https://github.com/KnairdA/InputXSLT/blob/master/src/function/base.h -[InputXSLT]: /page/input_xslt/ +[InputXSLT]: https://tree.kummerlaender.eu/projects/xslt/input_xslt/ [external function implementations]: https://github.com/KnairdA/InputXSLT/tree/master/src/function diff --git a/source/00_content/articles/2015-01-14_a_look_at_compile_time_computation_in_cpp.md b/source/00_content/articles/2015-01-14_a_look_at_compile_time_computation_in_cpp.md index 7a5ce3a..d0f6972 100644 --- a/source/00_content/articles/2015-01-14_a_look_at_compile_time_computation_in_cpp.md +++ b/source/00_content/articles/2015-01-14_a_look_at_compile_time_computation_in_cpp.md @@ -105,7 +105,7 @@ So as it turns out the restriction imposed by being forced to rely on template p After this brief look at compile time computation in C++, the approach detailed in this last section seems to be the most promising. While it is sadly not possible to consistently write code to be executed at compile time using `constexpr`, this newly extended keyword certainly enables writing some parts of a primarily template metaprogramming based program in _normal_ C++ which is very helpful. Personally my next step in this context will be to revamp [ConstList] to use [`std::integral_constant`] for value storage instead of member constants in an attempt at developing a way of manipulating data at compile time in a functional fashion. [proof]: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.3670 -[ConstList]: /page/const_list/ +[ConstList]: https://tree.kummerlaender.eu/projects/const_list/ [`foldr`]: https://github.com/KnairdA/ConstList/blob/5d276c73df8fae74ee4c2e05a76cf9ada2a795c6/src/operation/higher/foldr.h [`map`]: https://github.com/KnairdA/ConstList/blob/5d276c73df8fae74ee4c2e05a76cf9ada2a795c6/src/operation/higher/misc.h [test cases]: https://github.com/KnairdA/ConstList/blob/master/test.cc diff --git a/source/00_content/articles/2015-03-06_using_scheme_as_a_metaphor_for_template_metaprogramming.md b/source/00_content/articles/2015-03-06_using_scheme_as_a_metaphor_for_template_metaprogramming.md index e1c9769..cfc1673 100644 --- a/source/00_content/articles/2015-03-06_using_scheme_as_a_metaphor_for_template_metaprogramming.md +++ b/source/00_content/articles/2015-03-06_using_scheme_as_a_metaphor_for_template_metaprogramming.md @@ -220,8 +220,8 @@ Finally I want to reference the [Boost MPL] library which supports everything an [^4]: Previously proofed in [C++ Templates are Turing Complete](http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.3670) _(2003)_ [appropriate article]: /article/a_look_at_compile_time_computation_in_cpp/ -[ConstList]: /page/const_list/ -[TypeAsValue]: /page/type_as_value/ +[ConstList]: https://tree.kummerlaender.eu/projects/const_list/ +[TypeAsValue]: https://tree.kummerlaender.eu/projects/type_as_value/ [SRFI-1]: http://srfi.schemers.org/srfi-1/srfi-1.html [example applications]: https://github.com/KnairdA/TypeAsValue/tree/master/example [Boost MPL]: http://www.boost.org/doc/libs/1_57_0/libs/mpl/doc/index.html diff --git a/source/00_content/articles/2016-02-21_notes_on_function_interposition_in_cpp.md b/source/00_content/articles/2016-02-21_notes_on_function_interposition_in_cpp.md index 123af85..7e8e040 100644 --- a/source/00_content/articles/2016-02-21_notes_on_function_interposition_in_cpp.md +++ b/source/00_content/articles/2016-02-21_notes_on_function_interposition_in_cpp.md @@ -149,6 +149,6 @@ One should however expect to dive deeper into C library internals and debug lowe For a real world example of how function interposition using `LD_PRELOAD` and C++ may be used to build a small but hopefully useful application feel free to check out [_change_] on [Github] or [cgit]. -[_change_]: /page/change/ +[_change_]: https://tree.kummerlaender.eu/projects/change/ [Github]: https://github.com/KnairdA/change/ [cgit]: https://code.kummerlaender.eu/change/ diff --git a/source/00_content/pages/about.md b/source/00_content/pages/about.md deleted file mode 100644 index fd4abc1..0000000 --- a/source/00_content/pages/about.md +++ /dev/null @@ -1,22 +0,0 @@ -# About me - -{.full .clear} - -Hi, my name is Adrian Kummerländer. I am a twenty-two-year-old Software Developer located in southern Germany. - -I taught myself programming at the age of 10 and spent the first few years developing software in _Delphi_ and _C#_. After switching from the _Windows_ ecosystem to _Linux_ as my primary operating system I started developing primarily in _XSLT_, _Scheme_ and _C++_ altough I enjoy it a lot to experiment with other languages such as _Scala_ and _Haskell_. - -My professional education in software development started with an apprenticeship as a _"computer science expert with subject area software development"_[^1] at [_Sybit_](http://sybit.de) in 2010 which I concluded with distinction in 2013. -My final project was on _optimizing the development of Adobe Interactive Forms in SAP CRM projects using modularization_. This entailed the development of a custom preprocessor language enabling meta programming in [XFA](http://partners.adobe.com/public/developer/xml/index_arch.html) templates on SAP systems. - -Since then I work as a part-time developer at _Sybit_ in the _SAP CRM_ area where I mainly develop business printout processes using _ABAP_, _JavaScript_ and _XSLT_ in addition to _SAP WebUI_ development. In addition to that I also occasionally do both voluntary and paid web design work. - -Between 2013 and 2015 I studied for my A levels at the _Technische Oberschule_ which I concluded top of my class and with a grade point average of _1.1_. - -Currently I am studying mathematics at the Karlsruhe Institute of Technology. - -Although software development and tinkering with my computer systems definitely is a primary occupation of mine both professionally and recreationally, I also enjoy reading _hard science fiction_ books and attending concerts and festivals of _Classical_ and _Metal_ music. - -I use this website to document some of my [thoughts and experiences](/archive) concerning software development and various other topics in addition to summarizing some of my [projects](/category/projects). - -[^1]: This mouthful really is the official translation of my recognized trade but I for one prefer referring to myself simply as Software Developer diff --git a/source/00_content/pages/contact.md b/source/00_content/pages/contact.md deleted file mode 100644 index 63f830d..0000000 --- a/source/00_content/pages/contact.md +++ /dev/null @@ -1,19 +0,0 @@ -# Contact - -**eMail:** adrian[at]kummerlaender[dot]eu -**Public Key:** [key.kummerlaender.eu](https://key.kummerlaender.eu) -**Telegram:** [KnairdA](https://telegram.me/KnairdA) -**Github:** [KnairdA](https://github.com/KnairdA) - -Further information about myself may be found on the [about page](/page/about). - -## Legal - -Responsible for all contents: Adrian Kummerländer - -All contents of this website that are created by me are freely available under the terms of the Creative Commons [CC-BY-SA] license. This of course only applies in the absence of further license information. - -Further legal information is also available in [German]. - -[CC-BY-SA]: http://creativecommons.org/licenses/by-sa/3.0/ -[German]: /page/impressum diff --git a/source/00_content/pages/impressum.md b/source/00_content/pages/impressum.md deleted file mode 100644 index 91ce0f5..0000000 --- a/source/00_content/pages/impressum.md +++ /dev/null @@ -1,17 +0,0 @@ -# Rechtliches - -Verantwortlich für die Inhalte: - -[Adrian Kummerländer](/page/contact) -Saarlandstraße 151 -76187 Karlsruhe - -Die Inhalte dieses Webauftritts erstelle, aktualisiere und prüfe ich sorgfältig und nach bestem Wissen. Trotzdem kann ich für die Informationen keine Haftung übernehmen. Insbesondere übernehme ich keine Verantwortung für etwaige Schäden, die aufgrund der Inhalte dieser Domain entstehen könnten. - -Diese Webpräsenz ist eine private Webseite ohne kommerzielle Gewinne / Gewinnabsichten. - -Sollten sich nicht von mir erstellte Inhalte auf diesen Seiten finden, eine entsprechende Kennzeichnung jedoch fehlen, bitte ich um einen kurzen Hinweis per [Mail](/page/contact/). Ich werde die betroffenen Inhalte dann umgehend kennzeichnen bzw. entfernen. - -Alle eigenen Inhalte stehen - soweit nicht anders gekennzeichnet - unter einer Creative Commons [CC-BY-SA] Lizenz. - -[CC-BY-SA]: http://creativecommons.org/licenses/by-sa/3.0/de/ diff --git a/source/00_content/pages/math_test.md b/source/00_content/pages/math_test.md deleted file mode 100644 index d686b76..0000000 --- a/source/00_content/pages/math_test.md +++ /dev/null @@ -1,9 +0,0 @@ -# Math expression test page - -$$\exists \: \epsilon > 0 \: \exists \: N_0 \in N \: \forall \: n \geq N_0 : | f(n) - f(n0) | \leq \epsilon$$ - -$$\int_0^\infty \mathrm{e}^{-x}\,\mathrm{d}x$$ - -$$e^x=\lim_{n\to\infty} \left( 1+\frac{x}{n} \right)^n$$ - -$$1 + 1 \neq 0$$ diff --git a/source/00_content/pages/projects/binary_mapping.md b/source/00_content/pages/projects/binary_mapping.md deleted file mode 100644 index 91acae5..0000000 --- a/source/00_content/pages/projects/binary_mapping.md +++ /dev/null @@ -1,50 +0,0 @@ -# BinaryMapping - -…is a collection of C++ templates which may be used to map binary structures into tuples and various other structures. - -These structures can then be traversed using integrated containers and iterators. This is useful for many kinds of data serialization tasks. - -A explanation of an earlier version of this template library can be found on this [blog]. The source code is available via both [Github] and [cgit]. - -## Current features - -* Support for any kind of flat structure that can be expressed using integral types and arbitrarily sized byte-arrays -* Support for serialization in either big or little endianess -* Offers Container and Iterator templates for fast traversal of collections of tuples or other structures -* Support for developing custom types to be used in the Container and Iterator templates -* Support for nesting structures inside each other -* BitField template offers bit-level access to ByteField byte-arrays -* Doesn't require any external libraries besides the GNU library's `endian.h` -* Header only library because of heavy usage of template metaprogramming -* Unit Tests based on GoogleTest -* MIT license - -## Usage example - -```cpp -BinaryMapping::Container< - BinaryMapping::Tuple< - BinaryMapping::LittleEndian, - std::uint32_t, - std::int16_t, - BinaryMapping::ByteField<3>, - std::uint8_t - > -> container(10); - -for ( auto&& tuple : container ) { - tuple.set<0>(UINT32_MAX); - tuple.set<1>(INT16_MAX); - tuple.set<2>({1, 2, 3}); - tuple.set<3>(42); -} - -std::uint32_t test = container.at(5).get<0>(); -``` - -The code listed above defines a container of a tuple consisting of a `std::uint32_t`, `std::int16_t`, 3-byte and `std::uint8_t` field with little endianess, instantiates a buffer containing ten instances of this tuple, iterates through all 10 elements, gives them values, transparently converts to the correct endianess and extracts the value of the first field of the fifth tuple contained in the buffer. In short: BinaryMapping is a library that abstracts endianess aware serializing of binary structures into structures, containers and iterators. If you are interested in further details of the usage of all features provided by BinaryMapping don't hesitate to check out the [documentation]. - -[blog]: /article/mapping_binary_structures_as_tuples_using_template_metaprogramming -[Github]: https://github.com/KnairdA/BinaryMapping/ -[cgit]: http://code.kummerlaender.eu/BinaryMapping/ -[documentation]: https://github.com/KnairdA/BinaryMapping/blob/master/docs/ diff --git a/source/00_content/pages/projects/build_xslt.md b/source/00_content/pages/projects/build_xslt.md deleted file mode 100644 index 83ce4e6..0000000 --- a/source/00_content/pages/projects/build_xslt.md +++ /dev/null @@ -1,48 +0,0 @@ -# BuildXSLT - -…is a simple XSLT build system for InputXSLT based applications. - -It aims to provide a foundation for building more complex applications such as a fully fledged [static site generator] by enabling users to define _XML Makefiles_ instead of manually calling single [InputXSLT] transformations. - -The source code of _BuildXSLT_ is available on both my [Github] profile and [cgit]. - -## Current features - -* processing tasks contained within _XML Makefiles_ -* generating single transformations -* generating chained transformations -* using external modules such as [StaticXSLT] -* using files or embedded XML-trees as transformation input - -## Usage example - -While _BuildXSLT_ offers enough flexibility for all kinds of different XSLT based generation tasks it was specifically built to cater for the requirements of the [static site generator] this site is built with. As such its module definition file and the _XML Makefile_ used to call it makes for the best demonstration of what one can do with _BuildXSLT_: - -```xsl -<transformation mode="chain"> - <link>src/steps/list.xsl</link> - <link>src/steps/plan.xsl</link> - <link>src/steps/process.xsl</link> - <link>src/steps/summarize.xsl</link> -</transformation> -``` - -```xsl -<task type="module"> - <input mode="embedded"> - <datasource> - <meta> - <source>source</source> - <target>target</target> - </meta> - </datasource> - </input> - <definition mode="file">[StaticXSLT.xml]</definition> -</task> -``` - -[InputXSLT]: /page/input_xslt/ -[static site generator]: /page/static_xslt/ -[StaticXSLT]: /page/static_xslt/ -[Github]: https://github.com/KnairdA/BuildXSLT/ -[cgit]: http://code.kummerlaender.eu/BuildXSLT/ diff --git a/source/00_content/pages/projects/change.md b/source/00_content/pages/projects/change.md deleted file mode 100644 index 7c30e6a..0000000 --- a/source/00_content/pages/projects/change.md +++ /dev/null @@ -1,44 +0,0 @@ -# change - -…transparent filesystem change tracking using function interposition. - -This project consists of a library `libChangeLog` and a matching wrapper bash script named `change`. If one opens any application using `change` it automatically tracks common system calls used for manipulating filesystem contents and provides the user with a short summary including _diffs_ where appropriate. - - > change mv test example - renamed 'test' to 'example' - > change vim example - --- /home/common/projects/dev/change/example - +++ /home/common/projects/dev/change/example 2016-02-13 21:43:15.719355382 +0100 - @@ -1,3 +1,5 @@ - 1 - + - 2 - + - 3 - > change rm example - removed 'example' - -`change` aims to be a utility that can be dropped in front of any non-suid (function interposition via `LD_PRELOAD` is thankfully not allowed for suid-executables) application and generate a summary that will explain the actual happenings of a terminal session. While this is not very useful for simple, self-explanatory commands such as `mv $this $to_that` it is certainly helpful whenever files are changed by interactive applications that do not provide their own directly visible logging such as text editors. Such an application is in turn useful for e.g. documenting shell sessions. - -`change` is written in Bash while the library it preloads is implemented in C++. Both are available via [Github] and [cgit]. - -## Filtering - -Due to its nature of interposing low level system calls such as `write` and `unlink` the library by default exposes lots of the internal write logic of the wrapped application. For instance it reports _vim_ creating a file called `4913` to verify the target directory's writability as well as the creation of various temporary backup files. While this is certainly interesting for debugging purposes it hinders the library's goal of providing a higher level summary consisting primarily of the actions the user explicity performed such as the changed file contents. - -To solve this problem one may provide a list of regular expressions to be matched against the file paths via the `CHANGE_LOG_IGNORE_PATTERN_PATH` environment variable. - -For example the following ruleset intructs the library to restrict the output `change vim $file` to a _diff_ of all files changed by the wrapped application: - - # vim's way of verifying that it is able to create a file - [0-9]+ - # temporary backup file during write - [^~]*~ - # log and backup files - .*\.viminfo - .*\.sw[px] - -If the library is used via `change` it will automatically try to load a ruleset matching the wrapped applications name. Currently the respository packages such definitions for _vim_, _gvim_ and _neovim_. - -[Github]: https://github.com/KnairdA/change/ -[cgit]: http://code.kummerlaender.eu/change/ diff --git a/source/00_content/pages/projects/codepoint_iterator.md b/source/00_content/pages/projects/codepoint_iterator.md deleted file mode 100644 index 4ba929c..0000000 --- a/source/00_content/pages/projects/codepoint_iterator.md +++ /dev/null @@ -1,35 +0,0 @@ -# CodepointIterator - -…is a `std::iterator` derived class implementing the `std::bidirectional_iterator_tag` which iterates through unicode codepoints in a UTF8-encoded string. - -The source code is available on both my [Github] profile and [cgit]. - -For readers versed in German a [blog article] describing the implementation in a more detailed manner is available. - -## Current features - -* Bidirectional iteration through unicode codepoints -* The class itself does not rely on any external libraries -* Dereferencing an instance of the iterator yields the codepoint as `char32_t` -* Unit Tests based on GoogleTest - -## Usage example - -While all features of this class are demonstrated by Google-Test based [Unit-Tests] we can see a basic `UTF8::CodepointIterator` usage example in the following code snippet. The [example text] is written in Old Norse runes. - - -```cpp -std::string test(u8"ᛖᚴ ᚷᛖᛏ ᛖᛏᛁ ᚧ ᚷᛚᛖᚱ ᛘᚾ ᚦᛖᛋᛋ ᚨᚧ ᚡᛖ ᚱᚧᚨ ᛋᚨᚱ"); - -for ( UTF8::CodepointIterator iter(test.cbegin()); - iter != test.cend(); - ++iter ) { - std::wcout << static_cast<wchar_t>(*iter); -} -``` - -[Github]: https://github.com/KnairdA/CodepointIterator -[cgit]: http://code.kummerlaender.eu/CodepointIterator/ -[Unit-Tests]: https://github.com/KnairdA/CodepointIterator/blob/master/test.cc -[example text]: http://www.columbia.edu/~fdc/utf8/ -[blog article]: /article/notizen_zu_cpp_und_unicode diff --git a/source/00_content/pages/projects/const_list.md b/source/00_content/pages/projects/const_list.md deleted file mode 100644 index efd60a0..0000000 --- a/source/00_content/pages/projects/const_list.md +++ /dev/null @@ -1,39 +0,0 @@ -# ConstList - -…is a experimental compile-time functional-style list library written in C++. - -The MIT licensed implementation may be found on [Github] or [cgit]. - -It was written as a experiment in how far one could take the optional compile-time executability offered by `constexpr` specifically and the C++ template metaprogramming facilities in general. While basic _Cons_ structures and appropriate accessor functions turned out to be quite straight forward to implement, the current problem is the absence of workable arbitrary value comparison in a templated context if one doesn't want to be limited to values that can be used as template parameters such as integers. This means that it is currently impossible to e.g. filter a list using `foldr`. - -Note that these restrictions were overcome in my [second attempt] at this problem which follows the concept of viewing types as values and templates as functions. - -## Current features - -- `Cons` class template for representing constant list structures at compile time -- `make` method template for easily constructing `Cons` structures -- list constructors such as `make` and `concatenate` -- basic list accessors such as `size`, `head`, `tail`, `nth` and `take` -- higher order list operators such as `foldr`, `foldl` and `map` -- higher order list queries such as `any`, `all`, `none` and `count` -- special purpose methods such as `reverse` -- test cases for all of the above -- MIT license - -## Usage example - -```cpp -const int sum{ - ConstList::foldr( - ConstList::make(1, 2, 3, 4, 5), - [](const int& x, const int& y) { - return x + y; - }, - 0 - ) -}; // => 15 -``` - -[Github]: https://github.com/KnairdA/ConstList/ -[cgit]: http://code.kummerlaender.eu/ConstList/ -[second attempt]: /page/type_as_value/ diff --git a/source/00_content/pages/projects/dotfiles.md b/source/00_content/pages/projects/dotfiles.md deleted file mode 100644 index 1c93a84..0000000 --- a/source/00_content/pages/projects/dotfiles.md +++ /dev/null @@ -1,34 +0,0 @@ -# Dotfiles - -…is a collection of the configuration files for my essential toolset. - -I manage my dotfiles using git and symlink them to their appropriate directories using [GNU stow]. The repository itself is available via [Github] or [cgit]. - -My toolset currently consists of the following applications: - -* fully encrypted [ArchLinux] installation with the [grsec] kernel -* [i3wm] for window management -* [vim] as my text editor of choice -* [pentadactyl] for turning Firefox into a fully keyboard driven browser -* [fish] as my default shell -* [urxvt] as terminal emulator -* [conky] for displaying system information in [i3bar] -* [rofi] as program launcher -* [twmn] for displaying notifications -* [zathura] for displaying documents - -[GNU stow]: https://www.gnu.org/software/stow/ -[Github]: https://github.com/KnairdA/dotfiles -[cgit]: http://code.kummerlaender.eu/Dotfiles/ -[ArchLinux]: https://archlinux.org -[grsec]: https://grsecurity.net -[i3wm]: http://i3wm.org -[vim]: http://vim.org -[pentadactyl]: http://5digits.org/pentadactyl/ -[fish]: http://fishshell.com/ -[urxvt]: http://software.schmorp.de/pkg/rxvt-unicode.html -[conky]: http://conky.sourceforge.net/ -[i3bar]: http://i3wm.org/docs/i3bar-protocol.html -[twmn]: https://github.com/sboli/twmn -[rofi]: https://davedavenport.github.io/rofi/ -[zathura]: https://pwmt.org/projects/zathura/ diff --git a/source/00_content/pages/projects/graph_storage.md b/source/00_content/pages/projects/graph_storage.md deleted file mode 100644 index 353e3ce..0000000 --- a/source/00_content/pages/projects/graph_storage.md +++ /dev/null @@ -1,13 +0,0 @@ -# GraphStorage - -…is a Graph storage and query library based on Google LevelDB and written in C++. - -It currently supports integer indexed nodes with properties and directed edges with types. The integer IDs are serialized _by hand_, values are serialized using protocol buffers. Everything is stored in a single sorted [LevelDB] database. - -Queries are possible trough a iterator like interface that handles single level queries quite fast. Additionally changes to edges can be monitored using a subscription mechanism. - -The library is in development and while not intended for any kind of production usage the source code is available via both [Github] and [cgit]. - -[Github]: https://github.com/KnairdA/GraphStorage/ -[cgit]: http://code.kummerlaender.eu/GraphStorage/ -[LevelDB]: https://code.google.com/p/leveldb/ diff --git a/source/00_content/pages/projects/input_xslt.md b/source/00_content/pages/projects/input_xslt.md deleted file mode 100644 index b270aac..0000000 --- a/source/00_content/pages/projects/input_xslt.md +++ /dev/null @@ -1,31 +0,0 @@ -# InputXSLT - -…is a Apache Xalan based XSLT extension enabling access to external commands, the filesystem and calling further transformations from inside a transformation. - -It is used as the base for the static site generation system used to generate the whole website you are currently viewing and is available under the terms of the _Apache License_ via [Github] or [cgit]. - -## Why? - -Contrary to popular opinion I actually like XSLT as a content transformation language and have built - amongst other things - most of my website projects on top of it. While I used the XSLT based [Symphony CMS] for most of these endeavours, the intention behind InputXSLT was to develop XSLT extensions enabling the development of static site generators using XSLT as both a template and application language. The fact that you are currently reading this page proves that this is indeed possible. - -## Overview - -The following table summarizes all the external functions provided by InputXSLT. They are available under the `InputXSLT` namespace after including `function.inputxslt.application` into the stylesheet element. - -Function Description ------------------- -------------------------------------------------------------------------------------------------------------- -`read-file` Reading plain text files as text and XML files as node trees -`read-directory` Traversing filesystem directories -`external-command` Executing external commands including support for providing the input stream and capturing the output stream -`write-file` Committing plain text or node trees to the filesystem -`generate` Calling transformations including support for capturing the result or committing it directly to the filesystem - -The `ixslt` XSLT frontent provided by InputXSLT also implements a custom include entity resolver alongside to an easy to use interface for implementing further custom extension functions. - -## Tradeoffs and compromises - -All external functions offered by InputXSLT can be accessed using the XPath expression evaluation subsystems of the XSLT language. While in some cases XSL extension elements would have been the primary choice limitations in the C++ implementation of the Apache Xalan XSLT library made the usage of external functions the path of least resistance. In practice external functions like the one used to call other transformations are wrapped inside utility templates and as such may be used as if they where implemented as extension elements. All o |