julien lengrand-lambert
|
00268eabc7
|
Beautifies the code a bit
|
2013-12-05 09:55:20 +01:00 |
|
julien lengrand-lambert
|
445e965f52
|
First get method version implemented. How to test?
|
2013-12-05 07:26:28 +01:00 |
|
julien lengrand-lambert
|
6c6be8663c
|
Starts implementing get method for neighbour based hashmap
|
2013-12-05 07:21:52 +01:00 |
|
julien lengrand-lambert
|
b7364b40da
|
Corrects the implementation of add. It is not possible any more to create use twice the same key.
|
2013-11-26 19:10:08 +01:00 |
|
julien lengrand-lambert
|
0267a97f33
|
Some different expectetions in the behaviour of the HashMap
|
2013-11-26 19:07:03 +01:00 |
|
julien lengrand-lambert
|
d63e082551
|
Just moves HMWithItem to a better location in the file
|
2013-11-26 19:00:29 +01:00 |
|
julien lengrand-lambert
|
b5d8de4faf
|
Finishes implementing the bare simple HM ersion using items. Now going to modify the version handling collisions
|
2013-11-26 18:59:33 +01:00 |
|
julien lengrand-lambert
|
7297cec59b
|
Adds hm implementation with items. Currently, this is just a copy paste from the bare simple hm implementation
|
2013-11-26 18:57:30 +01:00 |
|
julien lengrand-lambert
|
c51ba44a98
|
Adds _HashMapItem object that will be used to properly handle collisions.
Also adds documentation to the first HM implementation
|
2013-11-26 18:55:16 +01:00 |
|
Julien Lengrand-Lambert
|
ee382ac0a8
|
find_next_idx behaviour checked. Seems to work as expected
|
2013-11-24 17:01:12 +01:00 |
|
Julien Lengrand-Lambert
|
70d268983b
|
Adds in neighbour implementation implemented and running. Behaviour not tested yet.
|
2013-11-24 16:54:43 +01:00 |
|
Julien Lengrand-Lambert
|
96d3c8ca00
|
Starts implementing a neighbour implementation
|
2013-11-24 16:33:24 +01:00 |
|
Julien Lengrand-Lambert
|
423bf21fed
|
Also now implements get
|
2013-11-24 16:28:46 +01:00 |
|
Julien Lengrand-Lambert
|
2144671096
|
Tests add with collisions
|
2013-11-24 16:20:14 +01:00 |
|
Julien Lengrand-Lambert
|
f66c95d8da
|
Starts implementing add method of version with collisions.
|
2013-11-23 18:06:43 +01:00 |
|
Julien Lengrand-Lambert
|
1ec8b0672c
|
Modifies HashMap to correspond to the usual scheme
|
2013-11-21 20:22:49 +01:00 |
|
Julien Lengrand-Lambert
|
8f51ce1123
|
Actually, I have to provide two inputs to add instead, use one to create the key and store the other in the table. This is the classical implementation of HM
|
2013-11-21 20:18:55 +01:00 |
|
Julien Lengrand-Lambert
|
b1915d7192
|
Starts creating a dedicated object to store into hashmaps
|
2013-11-21 20:17:27 +01:00 |
|
Julien Lengrand-Lambert
|
af8014a79a
|
Implements a first get method. This doesnt take collisions into account yet. Also, we use strings to retrieve strings . . . Not really clever
|
2013-11-21 19:57:32 +01:00 |
|
Julien Lengrand-Lambert
|
7f8736c9ca
|
Starts implementing get method of the HashMap
|
2013-11-21 19:54:16 +01:00 |
|
Julien Lengrand-Lambert
|
77ad11ea74
|
Adds collision testing
|
2013-11-21 19:47:55 +01:00 |
|
Julien Lengrand-Lambert
|
20fe41493b
|
Starts implementing add method to fill the hash map
|
2013-11-21 11:58:50 +01:00 |
|
Julien Lengrand-Lambert
|
bcadb29f5f
|
Modifies hash method to stay within the range of the hash table
|
2013-11-21 11:50:11 +01:00 |
|
Julien Lengrand-Lambert
|
702f8999b3
|
Adds custom size of hash map table
|
2013-11-21 11:40:29 +01:00 |
|
Julien Lengrand-Lambert
|
cccda38920
|
Finishes implementing hash method
|
2013-11-21 11:08:35 +01:00 |
|
Julien Lengrand-Lambert
|
03ca739a08
|
Starts implementing the hash method. Throws an exception if the length of value is inconsistent
|
2013-11-21 10:36:12 +01:00 |
|
Julien Lengrand-Lambert
|
494f57d699
|
Creates corresponding test class and implements first size() method
|
2013-11-21 08:30:16 +01:00 |
|
jlengrand
|
ec4b556ba8
|
Starts implementing a Hash Table
|
2013-11-21 08:19:49 +01:00 |
|
|
|
eb2f371e05
|
Finishes testing the iterator implementation
|
2013-07-19 16:28:05 +02:00 |
|
|
|
bfcc796b3a
|
Rolls out first version of iterator for retrieving ordered values of binary search tree
|
2013-07-19 10:40:13 +02:00 |
|
|
|
25936d8413
|
implements print tree method
|
2013-07-15 16:31:07 +02:00 |
|
|
|
e731857f82
|
enhances print node to take care of more special cases
|
2013-07-12 21:21:20 +02:00 |
|
|
|
cf753f8ac4
|
Implement simple print method for single node element
|
2013-07-12 21:16:33 +02:00 |
|
|
|
6c14c68d93
|
prepares implementation of flat print method
|
2013-07-12 21:09:23 +02:00 |
|
|
|
ac878019fd
|
is_search_tree implemented
|
2013-07-11 23:24:37 +02:00 |
|
|
|
0d7bd76b2a
|
First is_search_tree attempt. Valid case seems to pass. Let s try the negation
|
2013-07-11 23:20:59 +02:00 |
|
|
|
81edb330eb
|
Adds is_search_node that checks whether a node is possibly part of a binary search tree
|
2013-07-09 19:48:16 +02:00 |
|
|
|
a511bb1687
|
Implement min, that find the lowest node value of a tree
|
2013-07-08 17:24:47 +02:00 |
|
|
|
1b7f6206f3
|
Implement max, that finx the highest node value of a tree
|
2013-07-08 17:20:38 +02:00 |
|
|
|
79980f3ad9
|
some small changes
|
2013-07-08 17:06:52 +02:00 |
|
|
|
3f7d84c896
|
Add method added. Also adds convenience method has_child in node class
|
2013-07-08 17:05:14 +02:00 |
|
|
|
a6264998bc
|
First test passes
|
2013-07-07 11:27:40 +02:00 |
|
|
|
6cf5ce85d8
|
Prepares binary search tree data structure.
|
2013-07-07 11:22:18 +02:00 |
|
Julien Lengrand-Lambert
|
40f77e4ea5
|
Seems to have a working version
|
2013-06-28 18:40:19 +02:00 |
|
Julien Lengrand-Lambert
|
0f12f99d1a
|
First version with odd length works. Try more now
|
2013-06-28 18:36:30 +02:00 |
|
Julien Lengrand-Lambert
|
7166bb43d0
|
Length 1 case handled
|
2013-06-28 18:09:52 +02:00 |
|
Julien Lengrand-Lambert
|
a9a97b64b7
|
Test inputs
|
2013-06-28 17:51:41 +02:00 |
|
Julien Lengrand-Lambert
|
02a0fe1273
|
First dumb unti test.
We're good to start
|
2013-06-28 17:44:38 +02:00 |
|
Julien Lengrand-Lambert
|
53cb6af0d2
|
Starts implementing binary search algorithm
|
2013-06-28 17:40:54 +02:00 |
|
