Commit Graph
139 Commits
Author SHA1 Message Date
Leonardo 21a2bea746 Fixing previous commit 2019-06-13 00:44:41 -03:00
Leonardo b0a2e42cfe Minor fixes all around
Changed some input parameter names
Updated TODO
Changed how hashtables initialization works. Now the given initial capacity will be guaranteed to be reached before the hashtable rehashes (load is now considered in the calculation).
2019-06-13 00:40:55 -03:00
Leonardo b6cbadd8e2 v1.4.3 2019-06-11 00:44:10 -03:00
Leonardo 870cfe302d Added more set functions
Added is_subset, is_superset, is_proper_subset, is_proper_superset, is_disjointset
2019-06-11 00:42:11 -03:00
Leonardo ea04c7ddaa Quickfix function name 2019-06-09 23:53:34 -03:00
Leonardo a86140094c Update .travis.yml 2019-06-07 01:48:25 -03:00
Leonardo 85c49a92fd v1.4.2 2019-06-07 01:45:10 -03:00
Leonardo aac07a645c Now collections accept plain struct
Also fixed impl prefixes and function modifiers
Added new test for all possible data types
Fixed some READMEs
2019-06-07 01:44:15 -03:00
Leonardo efdb1c80a3 Changed TreeSet max and min to be compatible with the TreeMap and the hash collections 2019-06-06 23:42:14 -03:00
Leonardo a9c7439d15 Update .travis.yml 2019-05-30 21:29:41 -03:00
Leonardo 26555bc10a v1.4.1 2019-05-30 21:27:18 -03:00
Leonardo 0f84d65656 Removed PUBLIC and PRIVATE, corrected some examples and new test 2019-05-30 21:23:37 -03:00
Leonardo a9b775419d Update Documentation.md 2019-05-30 16:54:40 -03:00
Leonardo a384a8b180 Update .gitignore 2019-05-27 17:13:09 -03:00
Leonardo 424582f969 Update documentation and TODO 2019-05-23 23:08:03 -03:00
Leonardo 6044e92262 Update CONTRIBUTING.md 2019-05-17 23:41:31 -03:00
Leonardo ee96bcbc55 Update CHANGELOG
reversed changelog ~duh
2019-05-16 17:07:03 -03:00
Leonardo 5b39676d79 v1.4.0 v0.6.0 2019-05-16 14:58:31 -03:00
Leonardo 5e2b841e9e Added CHANGELOG and TODO 2019-05-16 14:49:50 -03:00
Leonardo 3ec32bd57b changed pointertype test to be a pointer to a struct not a char 2019-05-16 14:25:28 -03:00
Leonardo Vencovsky 9531f7b5da Merge pull request #1 from LeoVen/iter
Merge iter to master
2019-05-16 13:44:48 -03:00
Leonardo 5f39eb011c Final update - fixed foreach, tests and benchmark 2019-05-16 13:41:35 -03:00
Leonardo 22e84db11a Tenth update on iterators - TREESET 2019-05-16 01:18:26 -03:00
Leonardo 8410111eab Ninth update on iterators - TREEMAP 2019-05-16 00:04:54 -03:00
Leonardo 490936bddd Eighth update on iterators - STACK 2019-05-15 20:42:28 -03:00
Leonardo f956094178 Seventh update on iterators - QUEUE 2019-05-15 19:57:35 -03:00
Leonardo 812d0240e3 Sixth update on iterators - LINKEDLIST 2019-05-15 18:49:40 -03:00
Leonardo 918b73ad51 Fifth update on iterators - HEAP 2019-05-15 15:22:59 -03:00
Leonardo ae5241a6fb Fourth update on iterators - HASHSET 2019-05-14 23:22:52 -03:00
Leonardo d3e7d64d2a Third update on iterators - HASHMAP 2019-05-14 00:52:20 -03:00
Leonardo 226e4ec817 Update Documentation.md 2019-05-13 23:06:30 -03:00
Leonardo 221c55cf2a Second update on iterators - DEQUE 2019-05-13 23:01:27 -03:00
Leonardo 444f597a98 First update on iterators - LIST 2019-05-11 00:24:48 -03:00
Leonardo 8843a8fb7a Update Documentation.md 2019-05-10 00:05:03 -03:00
Leonardo bc350611fc Update benchmark
Added Mersenne Twister utility as the function rand() was not random enough
2019-05-09 16:40:04 -03:00
Leonardo c61ac2e347 Changed iter_new to inter_init and added new iter_new that allocates the iterator on the heap 2019-05-08 11:47:00 -03:00
Leonardo 6002650f06 v1.3.0 2019-05-07 17:35:02 -03:00
Leonardo 21ab3eeb07 Changed linkedlist IO relative to a node 2019-05-07 17:20:01 -03:00
Leonardo 2f767f7623 v1.2.4 2019-05-04 00:12:28 -03:00
Leonardo d89972c621 Fixing hashset and hashmap error with a pointer data type and adding a test to address that 2019-05-04 00:06:27 -03:00
Leonardo f0b763afba Hashmap example 2019-05-03 23:57:58 -03:00
Leonardo 661455abe4 TreeSet documentation 2019-04-29 23:24:24 -03:00
Leonardo 71fb0a52c5 v1.2.3 2019-04-26 23:36:16 -03:00
Leonardo d715ea70a8 Added treemap example 2019-04-26 23:35:28 -03:00
Leonardo a37207e9d7 Added get_ref
Gets the reference of a value. Useful for primitive values like int, char, double, size_t, etc.
The only collections with this function are associative collections (when getting the value) and lists (working as an update method).
Other collections have not received this function because they are either sorted by the values so changing it would break the structure or because removing and adding back again the element is done instantaneously.
2019-04-26 23:35:09 -03:00
Leonardo be9c5af7cb v1.2.2 2019-04-24 17:21:29 -03:00
Leonardo 73171f5068 Removing unnecessary modulo in hashtable functions 2019-04-24 17:20:56 -03:00
Leonardo f07efbd828 Update Documentation.md 2019-04-23 16:53:08 -03:00
Leonardo 8cc5ef1f90 Update Documentation.md 2019-04-17 22:56:13 -03:00
Leonardo fbf020c784 v1.2.1 2019-04-16 23:46:08 -03:00