Commit graph

3547 commits

Author SHA1 Message Date
3af661f45b WIP: Intro - section vision reworked -->careful review required.
No problem if changes/questions are done to this section. As this section is
so important, the reviewer may correct, add or even reject the corrections
here.

We'll get there, iteratively.
2013-01-08 02:27:54 +01:00
Hendrik Boom
3769d0a183 WIP: Intro - vision section, small wording improvement 2013-01-08 02:27:53 +01:00
4e98ddbb8e WIP: Intro - proposal for the Vision section 2013-01-08 02:27:53 +01:00
4670c563a9 WIP: Initial draft of IRC meeting in October, 2012 2013-01-08 02:27:53 +01:00
23040e9c7b WIP: "contributing"-tutorial, errors corrected, new sections.
Some obvious typos were corrected. Other material improved.
The section on Git was considerably improved.

An entirely new section on Git was added, but which contains some previous
material on git.
The reason for adding a new section on Git was I though it better to have one
single place where someone new to Git and Lumiera could read a simple
recipe-type explanation on how to retrieve source code, make changes and then
push the changes.  All information necessary including Git, links, etc should be
on this page, no following liknks. In fact there is no real _new_ information
here that isn't to be found somewhere else. The point being that _all_
information necessary to ge someone up and going is located on one page.

For this reason, I added information on the mailing list and IRC; again, all
essential information in how to contribute to Lumiera, the title ang goal of
this page.

There might be stuff missing here, so please add, but do not make this page too
long. That tends to scare people, in fact, someone might just like to shorten my
contributions here, that would be good!
2013-01-08 02:27:53 +01:00
b548abd01e DOC: Intro - language corrected 2013-01-08 02:27:53 +01:00
0b16047211 DOC: Intro - add section about this document and further reading
reword and expand the very first paragraph and add some cross links at the bottom
2013-01-08 02:27:53 +01:00
a782f5843a DOC: Intro - expand on global pipes, assets and seesion storage 2013-01-08 02:27:53 +01:00
d870692f36 DOC: player architecture, language corrected.
No rewrite of sections, only the language was corrected. Only very
little rewriting, although some sections might be rewritten and improved
later.
2013-01-08 02:16:48 +01:00
8790e2af46 DOC: design index page; language corrected, but a few rewrites.
TODO: Backend, needs just a little more, not much, e.g.:
      Area where low-level  memory, hardware i/o, etc occur => here
      is where real gain in efficiency through modern algorithms can occur,
      thus, achieving another goal of Lumiera: efficient & runs on all kinds
      of hardware!
2013-01-08 02:16:37 +01:00
21d2faff12 DOC: design index page improved and slightly extended
this is the entry point into the section holding the various
design documents -- we try to separatte conceptual/design
from the actual technical documentation
2013-01-08 01:55:31 +01:00
7327b1ffb0 add the September dev meeting summary (by cehteh) 2013-01-04 20:18:10 +01:00
f41d3221c8 remove the old "main" TiddlyWiki
now, the Proc-Layer TiddlyWiki is the only one to survive...
2013-01-03 11:22:41 +01:00
7bb403f637 Integrate from TiddlyWiki: some early IRC transcripts 2013-01-03 11:22:41 +01:00
cec25b074e Integrate from TiddlyWiki: Pages about tests and test helpers 2013-01-03 11:22:41 +01:00
96fe3479dc DOC/Intro: some technical corrections and clarifications 2013-01-03 11:22:41 +01:00
17a3c407b6 DOC/Intro: typos and general clean-up
- spell check
- fixed formatting
- added grouping lanes (comments)
- flipped all the cross reference arrows
- removed some of the (resolved) TODO comments
- removed some planned sections, since these are rather technical
2013-01-03 09:29:31 +01:00
86b97169b2 DOC: building tutorial corrected 2013-01-03 09:29:04 +01:00
8a09414e46 DOC: Session Storage, very general introduction. 2013-01-03 00:53:26 +01:00
9a894e3719 DOC: The Visible Universe, language reworked. 2013-01-03 00:53:26 +01:00
c4470c1ba3 DOC: Fundamental Forces, language corrected.
Section Fundamental Forces corrected, all sub-sections corrected.
Some sub-sections slightly expanded for clarification purposes.
Some awkward expressrions removed, replaced or expanded.
2013-01-03 00:53:26 +01:00
764d21480e DOC: Section Vision completely reworked wrt language. 2013-01-03 00:53:26 +01:00
23cac22a9f Sync Documentation 2012-10-10 06:14:58 +02:00
2867dc1870 comment on the SemanticTags proposal 2012-10-10 06:11:32 +02:00
Michael Fisher
f7a7c1c416 GCC 4.7 compilation fixes. Now builds on debian wheezy beta2 2012-10-10 05:29:54 +02:00
Michael Fisher
e267e0ad0b GCC 4.7 compilation fixes
clarify binding of function (by specifying 'this')
2012-10-10 05:25:42 +02:00
954ebefc4c draft implementation of the PlanningStepGenerator 2012-10-10 05:20:24 +02:00
44435fd1db clarify and settle the relation between Dispatcher and PlanningStepGenerator
the solution is to introduce a superinterface
and let Dispatcher augment that with the specific parts.
This way, the Job planning only has to rely on the
rather generic stuff (TimeAnchor, FrameCoord)

NOTE: this commit makes the whole JobPlanning machinery
compilable for the first time!
2012-10-10 05:20:23 +02:00
3300d00cc8 WIP working towards a solution for generating frame location sequences
..the Idea is to rely on some kind of service,
to break the cyclic dependency with the Dispatcher.
But I seem unable to find a natural location or
concept to house that service.
2012-10-10 05:20:23 +02:00
ce5b940d39 WIP consider how to seed the evaluation of a JobTicket 2012-10-10 05:20:23 +02:00
14e6086488 better do initialisation by ctor 2012-10-10 05:20:22 +02:00
30cf0b5718 implementation of JobTicket::ExplorationState 2012-10-10 05:20:22 +02:00
062e1bbdc1 explicate the JobPlanningSequence definition
..causing the compiler to instantiate the
involved templates, i.e. get the complete
pipeline definition through the compiler
2012-10-10 05:20:22 +02:00
b52a1a8366 refactor JobTicket to remove the double layering
basically we had two lines of doubly nested capsules, due to
using the IterAdaptor template. Actually, the evaluation stack
within JobTicket can be considered an implementation detail and
thus doesn't require an iterator interface; the intention is to
use this through JobPlanning solely.

Thus this reworking removes the special iterator within JobTicket,
but retains the idea of exposing the "current" JobTicket through
a smart pointer or  operator->()

work done during the FrOSCon travel
2012-10-10 05:20:21 +02:00
66defdc0cb refactor JobPlanning to encapsulate all state mechanics into a "state core"
especially the exploration stack is pushed down
first successful definition of all the JobPlanning classes

just the framework of classes necessary to pass the compiler;
all implementation is still stubbed
2012-10-10 05:20:21 +02:00
a3bc69cc77 maybe a breakthrough on the job planning design quest?
why the hell is getting this design about right
such a chellenging task. Anyway, seems to be the
first step ahead after numerous failed attempts
2012-10-10 05:20:21 +02:00
88f433f433 successfully implemented another combinator strategy
DOH!
this thime hopefully I've actually succeedd to
created what is actually required in the Dispatcher
2012-10-10 05:20:20 +02:00
e073d05f58 new header to define some class partially noncopyable 2012-10-10 05:20:20 +02:00
016a739a5c WIP back to the original problem: how to dispatch jobs...
brainstorming how to implement the job planning stage

the idea is to built on top of the IterExplorer,
but have the "stack" of re-evaluation integrated
into a custom type, which exploits the static
node network structure to avoid heap allocations

solution idea: again use a builder function?
2012-10-10 05:20:20 +02:00
e76b85fcfa fix test broken by #410 2012-10-10 05:20:19 +02:00
0e3821abeb refatcor function meta programming headers
the template _Fun started as an internal helper
for function-closure, but seems to be of
general use. Thus move it into meta/function.hpp
(function-closure.hpp is heavyweight)
2012-10-10 05:20:19 +02:00
e6a105fbc1 iterator exploring monad finished, passes unit test 2012-10-10 05:20:19 +02:00
3d0d599158 get the depth-first exploration test to work
...using the IterQueue for intermediary results
2012-10-10 05:20:18 +02:00
2c33000346 complement IterStack by a similar wrapper for queue-like access 2012-10-10 05:20:18 +02:00
8ced6758fb initial draft for recursive evaluating iterator monad
tricky design problem, because nothing is known about
the source and result sequences to be built.
2012-10-10 05:20:18 +02:00
59c5627bbe change Implementation class for IterStack
now using a std::deque directly; this allows
for a later extension for queue-like behaviour
2012-10-10 05:20:18 +02:00
41180eb99c rework to allow for recursive evaluation
this enables expansion of a (functional) data structure
until exhaustion -- which is what we need to
build job functors by traversing and expanding
an arbitrarily nested job definition structure
2012-10-10 05:20:17 +02:00
75df583607 raw version of ChainedIter passes unit test 2012-10-10 05:20:17 +02:00
697924925c pragmatic fix for the long-standing problem of detecting increment operator
our duck-detector had a shortcoming here and failed
to detect iterators, in case the increment operator
was inherited from a mix-in
2012-10-10 05:20:17 +02:00
8db5413199 implemented chained-iterators
...using the IterExplorer building blocks
2012-10-10 05:20:17 +02:00