Changes

Jump to navigation Jump to search
1,156 bytes added ,  15:57, 15 May 2015
no edit summary
Line 138: Line 138:  
|What features this feature depends on to be available, this can be features in the current product, features in other products or features in supported operating system. Note that opretaing system feature dependencies are taken as an intersection, so if a features relies on 3D in an operating system, ALL chosen operating systems must support 3D. A dependency should be defined as <Dependency Software="Operating System">3D</Dependency>
 
|What features this feature depends on to be available, this can be features in the current product, features in other products or features in supported operating system. Note that opretaing system feature dependencies are taken as an intersection, so if a features relies on 3D in an operating system, ALL chosen operating systems must support 3D. A dependency should be defined as <Dependency Software="Operating System">3D</Dependency>
 
|}
 
|}
 +
 +
== Name generators ==
 +
The random name generator uses a tree like structure to generate random strings of words. Generators will be loaded from txt files located in the "NameGenerators" and their name will match their file names, minus ".txt". If you name a name generator the same thing as one of the built-in name generators, they will merge their nodes and words.
 +
 +
=== Example ===
 +
 +
Here is an example of how a name generator can be structured in the text file:
 +
 +
<pre>-start(base)
 +
-base(base2,end,stop)
 +
Hello
 +
Hi
 +
-base2(end,stop)
 +
, you
 +
-end(stop)
 +
.</pre>
 +
This would create a generator that can generate the strings:
 +
Hello
 +
Hi
 +
Hello.
 +
Hi.
 +
Hello, you
 +
Hi, you
 +
Hello, you.
 +
Hi, you.
 +
It works by starting from the first node "start" (nodes are the ones with a hyphen in front of the name), it appends a random string from the list of strings below it (in this case there’s nothing to pick), it then picks a random node from the parenthesis of the current node (which can only be "base" in this case), and then it continues until it reaches the node stop. There is a limit to how far it will go, depending on how many nodes there are, to avoid an infinite loop.

Navigation menu