summaryrefslogtreecommitdiff
path: root/lib/sbin/ParamLatex.pl
diff options
context:
space:
mode:
authorschnetter <schnetter@17b73243-c579-4c4c-a9d2-2d5706c11dac>2003-10-07 14:50:37 +0000
committerschnetter <schnetter@17b73243-c579-4c4c-a9d2-2d5706c11dac>2003-10-07 14:50:37 +0000
commitf9fd939abbc7e148722bbf27d74d65b6ae7be603 (patch)
tree6df3346a89a1d7872f81e96b1f510999fc4482c6 /lib/sbin/ParamLatex.pl
parent8f7c1066b45074fa2c566081f5d0a0a2f5ffd2a8 (diff)
Traverse all hashes alphabetically, so that all output files of the
CST stage will be identical. This is necessary at least since perl 5.8.1 to avoid redundant recompilation. git-svn-id: http://svn.cactuscode.org/flesh/trunk@3425 17b73243-c579-4c4c-a9d2-2d5706c11dac
Diffstat (limited to 'lib/sbin/ParamLatex.pl')
-rw-r--r--lib/sbin/ParamLatex.pl14
1 files changed, 7 insertions, 7 deletions
diff --git a/lib/sbin/ParamLatex.pl b/lib/sbin/ParamLatex.pl
index 1f488108..48b30501 100644
--- a/lib/sbin/ParamLatex.pl
+++ b/lib/sbin/ParamLatex.pl
@@ -110,13 +110,13 @@ $arrangements_dir = ThornUtils::GetArrangementsDir($arrangements_dir);
if (defined $thornlist) {
# provided by MakeUtils.pl, returns a hash with a list of the thorns in our thornlist
%thorns = &ReadThornlist($thornlist);
- @listOfThorns = keys %thorns;
+ @listOfThorns = sort keys %thorns;
} else {
# we don't have a thornlist, go find all thorns in arrangements directory
@listOfThorns = ThornUtils::CreateThornlist($arrangements_dir);
}
-# this will return us a hash with keys as thorn names, and values as absolute paths to the
+# this will return us a hash with keys as thorn names, and values as absolute paths to the
# thorn's directory param.ccl can be located in that path.
# We need this information to create a parameter database using create_parameter_database
#
@@ -126,7 +126,7 @@ if (defined $thornlist) {
ThornUtils::ClassifyThorns(\%arrangements, @listOfThorns);
# lets go through, one arrangement at a time
-foreach my $arrangement (keys %arrangements)
+foreach my $arrangement (sort keys %arrangements)
{
print "\n$arrangement" if ($debug);
@@ -182,9 +182,9 @@ print "\nFinished.\n";
#
# [print out all the ''variables'']
# print "\nProgram variables:";
-# foreach my $variable (keys %{$thorn{"variables"}}) {
+# foreach my $variable (sort keys %{$thorn{"variables"}}) {
# print "\n $variable";
-# foreach my $key (keys %{$thorn{"variables"}{$variable}}) {
+# foreach my $key (sort keys %{$thorn{"variables"}{$variable}}) {
# print "\n $key = $thorn{\"variables\"}->{$variable}->{$key}";
# }
# }
@@ -197,7 +197,7 @@ print "\nFinished.\n";
#
# NOTE: Naturally, you will have to take into account that the returned hash (%thorn) may be
# part of a greater data-structure, so you may have to do something like:
-# foreach (keys %{$thorns{"CactusWave"}{"WaveToyC"}{"variables"}}) {
+# foreach (sort keys %{$thorns{"CactusWave"}{"WaveToyC"}{"variables"}}) {
# @enddesc
# @version
#@@*/
@@ -408,7 +408,7 @@ sub FindMaxVarLen
# we are going to go through each variable name and range name to see where
# the largest text is, then we will use this for later formatting of our
# latex tables (so we do not get paragraph run-off
- foreach my $variable (keys %thorn)
+ foreach my $variable (sort keys %thorn)
{
# we will always take the variable length as the standard maximum length,
# regardless of if it is longer than MAX_VAR_LENGTH