| Commit message (Collapse) | Author | Age |
|---|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
local -> my
used perl 5 references for passing databases around in the CST.
CST is now about a factor of 16 faster !
Tom
git-svn-id: http://svn.cactuscode.org/flesh/trunk@1101 17b73243-c579-4c4c-a9d2-2d5706c11dac
|
| |
|
|
|
|
|
| |
no sorting.
git-svn-id: http://svn.cactuscode.org/flesh/trunk@806 17b73243-c579-4c4c-a9d2-2d5706c11dac
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
< if( $thing =~ m:$other_thing:i)
to
>
> if( $thing =~ m:^$other_thing$:i)
so that registering BMA_initial after initial works.
Also changed error statements to use CST_error and not exit so that
the compilation stops if there was a problem.
git-svn-id: http://svn.cactuscode.org/flesh/trunk@727 17b73243-c579-4c4c-a9d2-2d5706c11dac
|
| |
|
|
|
|
|
| |
Tom
git-svn-id: http://svn.cactuscode.org/flesh/trunk@341 17b73243-c579-4c4c-a9d2-2d5706c11dac
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Basically these need to be provided a database of the form
%data = ("routines", "c b a d e f",
"A BEFORE", "f",
"B BEFORE", "c",
"B AFTER", "a",
"C BEFORE", "d",
"D BEFORE", "e",
"E BEFORE", "f",
"E AFTER", "a",
);
and the routine OrderList then returns an array containing the sorted
routines.
Recursion is detected.
Tom
git-svn-id: http://svn.cactuscode.org/flesh/trunk@324 17b73243-c579-4c4c-a9d2-2d5706c11dac
|
| |
|
|
|
|
|
| |
Tom
git-svn-id: http://svn.cactuscode.org/flesh/trunk@236 17b73243-c579-4c4c-a9d2-2d5706c11dac
|
|
|
Tom
git-svn-id: http://svn.cactuscode.org/flesh/trunk@234 17b73243-c579-4c4c-a9d2-2d5706c11dac
|
