[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[bug #17560] merge code in rcs.c is O(n^2)
From: |
Derek Robert Price |
Subject: |
[bug #17560] merge code in rcs.c is O(n^2) |
Date: |
Wed, 6 Sep 2006 18:36:34 +0000 |
User-agent: |
Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.8.0.6) Gecko/20060728 Firefox/1.5.0.6 |
Follow-up Comment #17, bug #17560 (project cvs):
What Mark said but, if anyone is trying to benchmark the change, it should be
possible to contrive the worst case scenario using a really long file with one
byte per line and checking in a bunch of revisions, each time changing every
other line of the file. Then check out 1.1. Starting with a file several kB
in size and creating a few thousand revisions, I will be suprised if you don't
see some significant improvement with the new algorithm over the old.
_______________________________________________________
Reply to this item at:
<http://savannah.nongnu.org/bugs/?17560>
_______________________________________________
Message sent via/by Savannah
http://savannah.nongnu.org/
- [bug #17560] merge code in rcs.c is O(n^2), Derek Robert Price, 2006/09/04
- [bug #17560] merge code in rcs.c is O(n^2), anonymous, 2006/09/05
- [bug #17560] merge code in rcs.c is O(n^2), Peter Toft, 2006/09/05
- [bug #17560] merge code in rcs.c is O(n^2), Mark D. Baushke, 2006/09/06
- [bug #17560] merge code in rcs.c is O(n^2), anonymous, 2006/09/06
- [bug #17560] merge code in rcs.c is O(n^2), Peter Toft, 2006/09/06
- [bug #17560] merge code in rcs.c is O(n^2), Derek Robert Price, 2006/09/06
- [bug #17560] merge code in rcs.c is O(n^2), Derek Robert Price, 2006/09/06
- [bug #17560] merge code in rcs.c is O(n^2), Mark D. Baushke, 2006/09/06
- [bug #17560] merge code in rcs.c is O(n^2), Derek Robert Price, 2006/09/06
- [bug #17560] merge code in rcs.c is O(n^2),
Derek Robert Price <=
- [bug #17560] merge code in rcs.c is O(n^2), Derek Robert Price, 2006/09/08