Routino SVN Repository Browser

---

Revision 1285 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Sat Apr 27 18:27:45 2013 UTC (11 years, 10 months ago) by amb
File length: 4171 byte(s)
Diff to previous 1282

Use a linked list to store the results in each bin rather than pre-allocated
pointers.

---

Revision 1282 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Sat Apr 27 10:48:43 2013 UTC (11 years, 10 months ago) by amb
File length: 4095 byte(s)
Diff to previous 1281

Increase the allowed number of collisions as the number of bins increases.

---

Revision 1281 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Sat Apr 27 07:37:29 2013 UTC (11 years, 10 months ago) by amb
File length: 3959 byte(s)
Diff to previous 1280

Remove the FindResult1 function which allows hashing to be performed on a
combination of node and segment rather than just node.

---

Revision 1280 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Fri Apr 26 15:26:58 2013 UTC (11 years, 10 months ago) by amb
File length: 4011 byte(s)
Diff to previous 874

Force a hard limit on the number of hash collisions.

---

Revision 874 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Sat Oct 22 15:20:25 2011 UTC (13 years, 4 months ago) by amb
File length: 4174 byte(s)
Diff to previous 870

Revert back to r867 because it is faster (although only by 1%) than any of the
other combinations.

---

Revision 870 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Sat Oct 15 12:51:01 2011 UTC (13 years, 5 months ago) by amb
File length: 4175 byte(s)
Diff to previous 865

Change the binary heap to a 4-ary heap.

---

Revision 865 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Thu Oct 6 09:49:06 2011 UTC (13 years, 5 months ago) by amb
File length: 4174 byte(s)
Diff to previous 863

Change to a unity based binary heap rather than zero based one to save some
additions.

---

Revision 863 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Thu Oct 6 08:37:55 2011 UTC (13 years, 5 months ago) by amb
File length: 4175 byte(s)
Diff to previous 857

Change bin counters to 8-bit (reduces memory) and pre-allocate first dimension
of pointer array (saves time).

---

Revision 857 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Wed Oct 5 09:21:44 2011 UTC (13 years, 5 months ago) by amb
File length: 4175 byte(s)
Diff to previous 854

Remove the two RESULTS_*_INCREMENT constants by swapping the dimensions on the
'point' array so that both have unity value and are pointless.

---

Revision 854 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Tue Oct 4 14:10:05 2011 UTC (13 years, 5 months ago) by amb
File length: 4176 byte(s)
Diff to previous 680

Change the way that allocated memory is tracked.

---

Revision 680 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Sun Apr 24 15:14:53 2011 UTC (13 years, 10 months ago) by amb
File length: 4160 byte(s)
Diff to previous 605

Update comments throughout the source code.

---

Revision 605 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Mon Jan 24 19:32:49 2011 UTC (14 years, 1 month ago) by amb
File length: 4137 byte(s)
Diff to previous 603

Finds routes and obeys turn restrictions (only tested with very simple route and
restrictions, more turn restriction testing and regression testing required).

---

Revision 603 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Sat Jan 15 22:22:57 2011 UTC (14 years, 2 months ago) by amb
File length: 3906 byte(s)
Diff to previous 457

Change the results structure to contain next segment and rename elements to
clarify prev/next node and prev/next segment.

---

Revision 457 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Fri Jul 23 14:32:48 2010 UTC (14 years, 7 months ago) by amb
File length: 3859 byte(s)
Diff to previous 302

Change the results structure to hold the index of the segment instead of a
pointer to it.

---

Revision 302 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Fri Nov 13 19:26:18 2009 UTC (15 years, 4 months ago) by amb
File length: 3860 byte(s)
Diff to previous 236

Added in some more constants with the value ~0.

---

Revision 236 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Sat Aug 15 14:18:23 2009 UTC (15 years, 7 months ago) by amb
File length: 3765 byte(s)
Diff to previous 234

Optimise the priority queue used for routing.

---

Revision 234 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Thu Jul 23 17:36:11 2009 UTC (15 years, 7 months ago) by amb
File length: 3485 byte(s)
Diff to previous 170

Split off queue functions into a separate file.

---

Revision 170 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Wed May 13 17:45:31 2009 UTC (15 years, 10 months ago) by amb
File length: 3480 byte(s)
Diff to previous 166

Remove distance and duration from Result structure.

---

Revision 166 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Thu Apr 30 17:29:03 2009 UTC (15 years, 10 months ago) by amb
File length: 3586 byte(s)
Diff to previous 165

First attempt at preferences for highways - uses integer arithmetic and doesn't
work well.

---

Revision 165 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Mon Apr 27 18:56:39 2009 UTC (15 years, 10 months ago) by amb
File length: 3436 byte(s)
Diff to previous 151

Allow generating a route with intermediate waypoints.

---

Revision 151 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Wed Apr 8 16:54:34 2009 UTC (15 years, 11 months ago) by amb
File length: 3322 byte(s)
Diff to previous 116

Changed the license to Affero GPLv3.

---

Revision 116 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Tue Feb 10 19:49:26 2009 UTC (16 years, 1 month ago) by amb
File length: 2858 byte(s)
Diff to previous 113

Added a new 'sortby' entry to the Result.
Changed node_t to index_t.

---

Revision 113 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Sun Feb 8 15:30:07 2009 UTC (16 years, 1 month ago) by amb
File length: 2788 byte(s)
Diff to previous 79

Calculate quickest or shortest, not both.

---

Revision 79 - (view) (download) (as text) (annotate) - [select for diffs]
Modified Sat Jan 24 16:21:44 2009 UTC (16 years, 1 month ago) by amb
File length: 3047 byte(s)
Diff to previous 71

Change the Results structure so that the real data doesn't need to be realloc().
Add functions to access the first and subsequent elements of the Results structure.

---

Revision 71 - (view) (download) (as text) (annotate) - [select for diffs]
Added Fri Jan 23 15:22:31 2009 UTC (16 years, 1 month ago) by amb
File length: 2470 byte(s)
Diff to previous 70

Create a large or small results structure depending on how many nodes are
expected.