Age | Commit message (Collapse) | Author |
|
* Fix Common::gcd to work with negative input
* This fixes a bug in Common::Rational's multiplication code
* Add some more basic unit tests (including one which checks for
the now fixed multiplication bug)
* cleanup
svn-id: r49064
|
|
also courtesy of DrMcCoy who wrote the main Common::Rational class too
svn-id: r49062
|
|
svn-id: r48956
|
|
This includes both an implementation and some basic unit tests for
the above mentioned functions.
svn-id: r48953
|
|
svn-id: r48614
|
|
display"
svn-id: r48613
|
|
The new test verifies that a given object is indeed deleted after
the smart pointer leaves scope.
svn-id: r48358
|
|
This removes the dependency on array.h from str.h.
Also, begun migration from the confusing type name "StringList" to
the more appropriate StringArray.
svn-id: r48282
|
|
svn-id: r47541
|
|
svn-id: r46779
|
|
svn-id: r46644
|
|
svn-id: r46622
|
|
svn-id: r46621
|
|
boolean, which indicates whether the sequence is sorted by the given predicate.
This allows for easier checking which order related tests failed.
svn-id: r46620
|
|
svn-id: r46619
|
|
svn-id: r46618
|
|
svn-id: r46617
|
|
svn-id: r46616
|
|
svn-id: r46615
|
|
turned the (disabled) MD5 test code into a working unit test
svn-id: r46108
|
|
svn-id: r45247
|
|
svn-id: r44980
|
|
svn-id: r44259
|
|
A new variant of HashMap::getVal with a second 'default value' parameter
has been added. This helps avoid many contains() + getVal() combos
(which incur double lookup penalty), and is much lighter than using
find() (which has to create an iterator).
svn-id: r43983
|
|
svn-id: r42743
|
|
svn-id: r41401
|
|
svn-id: r41400
|
|
svn-id: r41333
|
|
storage).
svn-id: r41083
|
|
example cover tests on String instances, which will be added to itself (foo += foo). NOTE: Those fail currently.
svn-id: r41082
|
|
paarms to it (we migh want to add corresponding matchUint32LE etc. functions if needed)
svn-id: r40909
|
|
way the internal storage growth over time.
The bug could result in incorrect results when using push_back (or insert_at)
to insert data from an array into itself if this insertions would cause the
internal array storage to grow. Also added a unit test for this bug.
Furthermore, if the internal storage needs to grow, it will now be resized to the next power of two,
instead of being increased by 32.
svn-id: r40907
|
|
svn-id: r40737
|
|
- Warning fixes
- Rename "test_read_v2_as_v1" to "test_read_v1_as_v2", to match behavior
svn-id: r40726
|
|
* Added support versioned serialization
* Added a convenience API for handling 'magic IDs' transparently
* Exposed the err()/clearErr() methods of the underlying streams
* Added a basic unit test for versioned loading (more should be added, in particular for saving)
* Removed the syncString(char *, uint16) alias for syncBytes(byte *buf, uint32 size)
svn-id: r40723
|
|
possible; also made them comply a bit more to our code formatting guideline
svn-id: r40722
|
|
svn-id: r40261
|
|
tests and some doxygen comments for Common::List and Common::Array
svn-id: r40164
|
|
front/back/push_back/push_front, as have their STL counterparts
svn-id: r40163
|
|
Common::Array constructor which converts regular arrays to Array objects to be more flexible in its type (allows e.g. to assign an array of char* to a StringList
svn-id: r40077
|
|
svn-id: r40054
|
|
data, int n), which makes it possible to clone a regular array into a Common::Array; added a unit test for that and slightly extended existing Common::Array unit tests
svn-id: r40027
|
|
svn-id: r40026
|
|
more efficient; same for remove() and operator=
svn-id: r39921
|
|
whether one rect contains the other). Previously, foo.contains(foo) would return false. Added/enabled unit tets for this
svn-id: r39911
|
|
svn-id: r39907
|
|
well as our unit tests, ouch) handled SEEK_END incorrectly (using -offset instead of offset), contrary to what the docs said and what fseek does. Hopefully I found and fixed all affected parts, but still watch out for regressions
svn-id: r39135
|
|
behavior of FixedStack; added unit tests
svn-id: r35974
|
|
svn-id: r35829
|
|
svn-id: r35648
|