Eli Barzilay
|
82e256473d
|
Finally it works.
svn: r15018
|
2009-05-30 06:48:49 +00:00 |
|
Eli Barzilay
|
95c52b9ce3
|
fix comment in about-to-be-changed version
svn: r15008
|
2009-05-29 11:22:59 +00:00 |
|
Eli Barzilay
|
56547f4142
|
clarification
svn: r15007
|
2009-05-29 11:16:28 +00:00 |
|
Eli Barzilay
|
f829c86c1f
|
get rid of the old (and still broken) topological sort, use a visual layering function instead (still needs fixing, comitting as a checkpoint)
svn: r15006
|
2009-05-29 09:24:42 +00:00 |
|
Eli Barzilay
|
8e79a2aed5
|
don't include the *-node in the topological-sort output
svn: r14835
|
2009-05-15 19:28:38 +00:00 |
|
Eli Barzilay
|
27e4c708c7
|
better layout for topological-sort
svn: r14834
|
2009-05-15 19:16:56 +00:00 |
|
Eli Barzilay
|
ccca3b3df6
|
fix dropping cycles
svn: r14811
|
2009-05-14 15:08:56 +00:00 |
|
Eli Barzilay
|
bc22c8a824
|
print the *-node appropriately
svn: r14808
|
2009-05-14 10:34:09 +00:00 |
|
Eli Barzilay
|
0d933c3f86
|
subsort is really any function to apply on a level
svn: r14806
|
2009-05-14 07:47:28 +00:00 |
|
Eli Barzilay
|
86519ae414
|
Forgot to actually move the topological sort code
svn: r14804
|
2009-05-14 07:35:03 +00:00 |
|
Eli Barzilay
|
8bea8abc75
|
* Factor out the struct definitions into a separate file
* Move the topological sort into utils.ss
svn: r14803
|
2009-05-14 07:31:36 +00:00 |
|
Eli Barzilay
|
133f044a33
|
finally, make the topological-sort do a topological sort instead of a BFS
svn: r14802
|
2009-05-14 07:23:09 +00:00 |
|
Eli Barzilay
|
975b4d2fa8
|
use hash-ref!
svn: r14801
|
2009-05-14 05:49:15 +00:00 |
|
Eli Barzilay
|
09502205e2
|
typo in comment
svn: r14800
|
2009-05-14 05:47:18 +00:00 |
|
Eli Barzilay
|
ff73a5395e
|
removed lots of "the the"s
svn: r14679
|
2009-05-01 21:02:51 +00:00 |
|
Eli Barzilay
|
fc7283c5a7
|
svn: r14648
|
2009-04-29 07:14:39 +00:00 |
|
Eli Barzilay
|
8785850a3c
|
svn: r14647
|
2009-04-29 07:13:55 +00:00 |
|
Eli Barzilay
|
c0a8a01222
|
Changed @itemize{...} to @itemize[...] (done after comparing the doc
tree and verifying that there are no changes).
(Also fixed a few bugs that were in the code)
svn: r14427
|
2009-04-05 17:46:20 +00:00 |
|
Eli Barzilay
|
1fca4a4a49
|
more common looking title
svn: r14365
|
2009-03-30 21:12:33 +00:00 |
|
Eli Barzilay
|
c880b1297c
|
sort only for each edge, so related nodes will be closer to each other
svn: r14364
|
2009-03-30 21:10:16 +00:00 |
|
Eli Barzilay
|
85cbee30e2
|
added an option of giving create-sampler the super custodian
svn: r14363
|
2009-03-30 19:42:55 +00:00 |
|
Eli Barzilay
|
a68c38b6d7
|
document and comment last change
svn: r14362
|
2009-03-30 17:44:03 +00:00 |
|
Eli Barzilay
|
bab1558e02
|
fix the topological sort and make it use a sorter to resolve nodes at the same level
svn: r14361
|
2009-03-30 17:42:09 +00:00 |
|
Eli Barzilay
|
6964e5745d
|
avoid divisions by zero when no work is observed
svn: r14360
|
2009-03-30 17:00:31 +00:00 |
|
Eli Barzilay
|
14f71a8531
|
* added `periodic-renderer'
* set svn:ignore
svn: r14345
|
2009-03-30 05:59:20 +00:00 |
|
Eli Barzilay
|
e2f50949be
|
remove debugging code, add provide
svn: r14342
|
2009-03-30 01:07:06 +00:00 |
|
Eli Barzilay
|
96d7291bfb
|
statistical profiler, core and text interface part done
svn: r14340
|
2009-03-30 00:15:38 +00:00 |
|