| transitive dependencies: works for circular dependencies, too |
|
More...
|
over 14 years ago
|
| transitive dependencies - part one |
|
More...
|
over 14 years ago
|
| gitignore modifed |
|
More...
|
over 14 years ago
|
| is_comment renamed to comment? |
|
More...
|
almost 15 years ago
|
| impl. code just moved to a freshly created class |
|
More...
|
almost 15 years ago
|
| impl. for counting lines moved to test class |
|
More...
|
almost 15 years ago
|
| counting non-comment lines in a file works |
|
More...
|
almost 15 years ago
|
| simplified main impl. method and added some tests |
|
More...
|
almost 15 years ago
|
| no need for guarding state in_multiline_comment |
|
More...
|
almost 15 years ago
|
| refactored into method, all tests pass |
|
More...
|
almost 15 years ago
|
| easy cases refactored into method in test class |
|
More...
|
almost 15 years ago
|
| more complicated examples, still writing implementaion in test cases |
|
More...
|
almost 15 years ago
|
| few examples and impl. code in test methods |
|
More...
|
almost 15 years ago
|
| trying to solve the code line counter problem by following the 'always-put-impl.-code-in-tests-first' technique |
|
More...
|
almost 15 years ago
|
| simplifying bundle price calculation |
|
More...
|
almost 15 years ago
|
| checkout object does not need to know about pricing strategies |
|
More...
|
almost 15 years ago
|
| a few errors fixed |
|
More...
|
over 15 years ago
|
| building novels with trigrams |
|
More...
|
over 15 years ago
|
| benchmarking two insertion solutions: with library methods (detect, index), it is faster |
|
More...
|
over 15 years ago
|
| refactoring the common sorting algo. into a module |
|
More...
|
over 15 years ago
|
| draft solution for 'Sorting it out' |
|
More...
|
over 15 years ago
|
| added the possibility of buy-2-get-1-for-free pricing scheme |
|
More...
|
over 15 years ago
|
| refactoring into price_for_sku |
|
More...
|
over 15 years ago
|
| first, working checkout solution |
|
More...
|
over 15 years ago
|
| storing the words to compose in a hash makes all the difference, the algorhythm is blazing fast now |
|
More...
|
over 15 years ago
|
| adding a slow method |
|
More...
|
almost 16 years ago
|
| a very slow solution (thus not finished) indeed\! |
|
More...
|
almost 16 years ago
|
| a very slow (but readable) solution |
|
More...
|
almost 16 years ago
|
| displaying the length, too |
|
More...
|
almost 16 years ago
|
| getting the most anagrams, the longest anagram and the total number of anagrams |
|
More...
|
almost 16 years ago
|
