Commit Graph
84 Commits
Author SHA1 Message Date
Daniel James dfac5aab41 Merge in spell check.
[SVN r42591]
2008-01-07 21:47:24 +00:00
Daniel James 44c402137f Add Boost.Unordered and add to the documentation. Not fully integrated yet.
[SVN r42528]
2008-01-06 16:47:16 +00:00
Daniel James 8078c93907 Some small tweaks to the hash function documentation.
[SVN r42519]
2008-01-06 12:38:22 +00:00
Daniel James 9a7fbcf0ed Add a little bit of text about hash and equality functions to the intro, and add links to Boost.Hash.
[SVN r42518]
2008-01-06 12:31:13 +00:00
Daniel James c31be49d83 Make it clear that pointers and references to elements are never invalidated.
[SVN r42517]
2008-01-06 11:38:54 +00:00
Daniel James e91f6d467b Merged revisions 41808-41821,41823-41927,41934-41942,41944-41950,41952-41993,41998-42091,42094-42095,42104-42105,42107,42109,42111-42152,42154,42160-42171,42173-42180,42183-42196,42198-42402 via svnmerge from
https://svn.boost.org/svn/boost/branches/unordered/dev

........
  r41993 | danieljames | 2007-12-13 00:23:27 +0000 (Thu, 13 Dec 2007) | 3 lines
  
  Add the hash documentation to the unordered library so that it'll be easier to
  link between the libraries.
........
  r42104 | danieljames | 2007-12-16 13:36:50 +0000 (Sun, 16 Dec 2007) | 1 line
  
  Don't include any hash source in tarballs (although I'm including the documentation).
........
  r42198 | danieljames | 2007-12-20 10:49:10 +0000 (Thu, 20 Dec 2007) | 1 line
  
  Restore the extra warnings in the unit tests.
........
  r42199 | danieljames | 2007-12-20 11:25:38 +0000 (Thu, 20 Dec 2007) | 1 line
  
  Make a cast explicit in order to avoid a warning.
........
  r42203 | danieljames | 2007-12-20 15:54:31 +0000 (Thu, 20 Dec 2007) | 1 line
  
  Use 'BOOST_UNORDERED' prefix for macros.
........
  r42209 | danieljames | 2007-12-20 19:41:17 +0000 (Thu, 20 Dec 2007) | 1 line
  
  Initialise this branch (hopefully..)
........
  r42210 | danieljames | 2007-12-20 19:51:21 +0000 (Thu, 20 Dec 2007) | 1 line
  
  Merge in changes.
........
  r42215 | danieljames | 2007-12-20 21:15:42 +0000 (Thu, 20 Dec 2007) | 1 line
  
  Don't add size_type to pointers, cast to difference_type.
........
  r42216 | danieljames | 2007-12-20 21:17:38 +0000 (Thu, 20 Dec 2007) | 1 line
  
  I messed up the last commit, this fixes it.
........
  r42218 | danieljames | 2007-12-20 21:22:20 +0000 (Thu, 20 Dec 2007) | 1 line
  
  Get rid of last_in_group.
........
  r42219 | danieljames | 2007-12-20 21:27:46 +0000 (Thu, 20 Dec 2007) | 1 line
  
  Use node_count to implement group_count.
........
  r42231 | danieljames | 2007-12-21 12:04:52 +0000 (Fri, 21 Dec 2007) | 1 line
  
  Some minor changes for Visual C++.
........
  r42233 | danieljames | 2007-12-21 19:41:27 +0000 (Fri, 21 Dec 2007) | 1 line
  
  Inline some more methods.
........
  r42335 | danieljames | 2007-12-29 13:14:45 +0000 (Sat, 29 Dec 2007) | 3 lines
  
  Some of the changes to the introduction mention in the review. Hopefully this
  will make it a little clearer.
........
  r42336 | danieljames | 2007-12-29 13:16:55 +0000 (Sat, 29 Dec 2007) | 3 lines
  
  Try to make the buckets explanation a little easier to read. Most of the
  changes were based on Jamie Allsop (same for the last commit).
........
  r42339 | danieljames | 2007-12-29 16:00:32 +0000 (Sat, 29 Dec 2007) | 1 line
  
  Specify the namespace for 'std::out_of_range' in the reference documentation.
........
  r42345 | danieljames | 2007-12-29 20:41:10 +0000 (Sat, 29 Dec 2007) | 8 lines
  
  Rewrite much of the 'controlling the number of buckets' section.
  
  I'm trying to make it clearer. It's a bit tricky as the standard doesn't guarantee much.
  Instead of diving straight into the details I have tried to give the reader a rough
  idea of what 'rehash' does and what the load factor is. This is hopefully enough to
  understand the more detailled discussion of how you can control the number of buckets.
  Then finally I discuss iterator invalidation.
........
  r42346 | danieljames | 2007-12-29 20:52:22 +0000 (Sat, 29 Dec 2007) | 1 line
  
  Move the table summarizing methods for controlling bucket size next to the discussion of these methods. The paragraphs about insert and invalidating iterator moves on to something else.
........
  r42348 | danieljames | 2007-12-29 20:55:30 +0000 (Sat, 29 Dec 2007) | 1 line
  
  Fix the badly marked up bullet points.
........
  r42349 | danieljames | 2007-12-29 20:57:53 +0000 (Sat, 29 Dec 2007) | 2 lines
  
  We now have cbegin and cend for local iterators.
........



[SVN r42403]
2008-01-01 20:21:04 +00:00
Daniel James 53242796a3 Merge: When allocators aren't equal use a slow swap.
[SVN r42191]
2007-12-19 23:33:30 +00:00
Daniel James a68da27339 Merge: Support for cbegin(n), cend(n).
[SVN r42188]
2007-12-19 23:13:20 +00:00
Daniel James 3b4acc6342 Merged revisions 41822-41992,41994-42101 via svnmerge from
https://svn.boost.org/svn/boost/branches/unordered/dev

........
  r41822 | danieljames | 2007-12-07 12:51:54 +0000 (Fri, 07 Dec 2007) | 5 lines
  
  Change the macros to meet boost guidelines.
  
  I should really have done this before the review. At least it'll give them
  something to say.
........
  r41928 | danieljames | 2007-12-09 19:23:27 +0000 (Sun, 09 Dec 2007) | 1 line
  
  Add some parameters to standalone documentation build.
........
  r41929 | danieljames | 2007-12-09 19:24:07 +0000 (Sun, 09 Dec 2007) | 1 line
  
  An extra rehash test for inserting a range.
........
  r41930 | danieljames | 2007-12-09 19:24:52 +0000 (Sun, 09 Dec 2007) | 1 line
  
  get_for_erase can be static because all the required information is in the iterator.
........
  r41931 | danieljames | 2007-12-09 19:31:00 +0000 (Sun, 09 Dec 2007) | 1 line
  
  ADL doesn't seem to be working properly on Visual C++ 7.1 when calling swap, so workaround this in the compile tests.
........
  r41932 | danieljames | 2007-12-09 19:44:46 +0000 (Sun, 09 Dec 2007) | 1 line
  
  Try to make the erase exception requirements a little clearer.
........
  r41933 | danieljames | 2007-12-09 19:52:50 +0000 (Sun, 09 Dec 2007) | 1 line
  
  Hopefully clearer comparison of accessors for comparison/hash function objects.
........
  r41943 | danieljames | 2007-12-10 00:03:53 +0000 (Mon, 10 Dec 2007) | 1 line
  
  Fix a typo.
........
  r41951 | danieljames | 2007-12-10 11:08:02 +0000 (Mon, 10 Dec 2007) | 1 line
  
  Use the locale in the case insensitive comparison, I really should add a test for this.
........
  r41994 | danieljames | 2007-12-13 00:26:05 +0000 (Thu, 13 Dec 2007) | 3 lines
  
  Hervé Brönnimann's improved explanation of the formula for avoiding
  invalidating iterators.
........
  r41995 | danieljames | 2007-12-13 00:30:46 +0000 (Thu, 13 Dec 2007) | 4 lines
  
  Explicity use the classic locale in the case insensitive example. I could make
  the locale a member, but that would make the example longer. Also, this would be
  a good place to put a note about the need for constant function objects.
........
  r41996 | danieljames | 2007-12-13 00:31:55 +0000 (Thu, 13 Dec 2007) | 1 line
  
  Pull the point examples out into test files - fixing a few bugs in the process.
........
  r41997 | danieljames | 2007-12-13 00:41:30 +0000 (Thu, 13 Dec 2007) | 3 lines
  
  A few reference links for boost::hash, it might be better to link to the
  first page of the Boost.Hash documentation though.
........
  r42092 | danieljames | 2007-12-16 10:07:27 +0000 (Sun, 16 Dec 2007) | 2 lines
  
  Fix some typos, and use American spelling.
........
  r42093 | danieljames | 2007-12-16 10:11:00 +0000 (Sun, 16 Dec 2007) | 1 line
  
  Small documentation tweak.
........
  r42096 | danieljames | 2007-12-16 10:17:03 +0000 (Sun, 16 Dec 2007) | 1 line
  
  Fix some reference documentation errors.
........
  r42097 | danieljames | 2007-12-16 10:28:08 +0000 (Sun, 16 Dec 2007) | 1 line
  
  Document the explicit constructors.
........
  r42098 | danieljames | 2007-12-16 10:47:13 +0000 (Sun, 16 Dec 2007) | 1 line
  
  Try to make the active issues and proposals a little clearer - including more obvious links to the relevant papers.
........
  r42099 | danieljames | 2007-12-16 10:52:30 +0000 (Sun, 16 Dec 2007) | 1 line
  
  Fix some complexity errors in the comparison table.
........
  r42100 | danieljames | 2007-12-16 10:59:45 +0000 (Sun, 16 Dec 2007) | 1 line
  
  Use Mapped instead of T in the documentation.
........
  r42101 | danieljames | 2007-12-16 11:06:16 +0000 (Sun, 16 Dec 2007) | 1 line
  
  Remove hard-coded length of prime numbers.
........



[SVN r42187]
2007-12-19 23:09:09 +00:00
Daniel James 56f91ea407 Use pre-review copy of unordered for trunk.
[SVN r42183]
2007-12-19 22:42:12 +00:00
Daniel James 3f2f75faf6 Move the unordered library into 'branches' now that it has been accepted.
[SVN r42181]
2007-12-19 22:37:34 +00:00
Daniel James 3002a898a0 If the containers have equality comparisons, they'll also need 'hash_value'. Untested and undocumented, as before.
[SVN r42108]
2007-12-16 18:20:25 +00:00
Daniel James c918da0249 operator== work in progress, undocumented and untested.
[SVN r42106]
2007-12-16 17:48:25 +00:00
Daniel James 1bb2dc4883 Support for cbegin(n), cend(n).
[SVN r42103]
2007-12-16 13:32:04 +00:00
Daniel James 0ce212b5aa When allocators aren't equal, use a slow swap.
[SVN r42102]
2007-12-16 13:17:44 +00:00
Daniel James 5d3e0b0b81 Use Mapped instead of T in the documentation.
[SVN r42100]
2007-12-16 10:59:45 +00:00
Daniel James d6bf672e22 Fix some complexity errors in the comparison table.
[SVN r42099]
2007-12-16 10:52:30 +00:00
Daniel James 10b6f40fa5 Try to make the active issues and proposals a little clearer - including more obvious links to the relevant papers.
[SVN r42098]
2007-12-16 10:47:13 +00:00
Daniel James 27f40410c1 Document the explicit constructors.
[SVN r42097]
2007-12-16 10:28:08 +00:00
Daniel James 899ec5a6d9 Fix some reference documentation errors.
[SVN r42096]
2007-12-16 10:17:03 +00:00
Daniel James 8746836df0 Small documentation tweak.
[SVN r42093]
2007-12-16 10:11:00 +00:00
Daniel James 524bacff9e Fix some typos, and use American spelling.
[SVN r42092]
2007-12-16 10:07:27 +00:00
Daniel James 6054f3ff42 A few reference links for boost::hash, it might be better to link to the
first page of the Boost.Hash documentation though.


[SVN r41997]
2007-12-13 00:41:30 +00:00
Daniel James 27e055b228 Pull the point examples out into test files - fixing a few bugs in the process.
[SVN r41996]
2007-12-13 00:31:55 +00:00
Daniel James f6dcb589f8 Explicity use the classic locale in the case insensitive example. I could make
the locale a member, but that would make the example longer. Also, this would be
a good place to put a note about the need for constant function objects.


[SVN r41995]
2007-12-13 00:30:46 +00:00
Daniel James 1b0910add2 Hervé Brönnimann's improved explanation of the formula for avoiding
invalidating iterators.


[SVN r41994]
2007-12-13 00:26:05 +00:00
Daniel James 4e235a1610 Add the hash documentation to the unordered library so that it'll be easier to
link between the libraries.


[SVN r41993]
2007-12-13 00:23:27 +00:00
Daniel James ff7f819f88 Fix a typo.
[SVN r41943]
2007-12-10 00:03:53 +00:00
Daniel James 5c067abcb9 Hopefully clearer comparison of accessors for comparison/hash function objects.
[SVN r41933]
2007-12-09 19:52:50 +00:00
Daniel James 9d587c23d4 Try to make the erase exception requirements a little clearer.
[SVN r41932]
2007-12-09 19:44:46 +00:00
Daniel James 3528cc5026 Add some parameters to standalone documentation build.
[SVN r41928]
2007-12-09 19:23:27 +00:00
Daniel James 322f7d6ec6 Remove a couple of TODO notes.
[SVN r41781]
2007-12-06 11:41:32 +00:00
Daniel James a07c59a64e Remove a few commented out paragraphs of mostly incorrect documentation.
[SVN r41780]
2007-12-06 11:41:04 +00:00
Daniel James 32450a0b18 Fix a link.
[SVN r41275]
2007-11-21 11:10:45 +00:00
Daniel James 90a37ed62f Correct return in the case insensitive hash funcction example.
[SVN r41127]
2007-11-16 00:43:01 +00:00
Daniel James 50650fbd34 Fix the return values of the case insensitive hash examples.
[SVN r41126]
2007-11-16 00:35:34 +00:00
Daniel James f0c62d3f0f Test, implement and document 'at'.
[SVN r41125]
2007-11-16 00:31:12 +00:00
Daniel James 29a0e5d163 Spell check the unordered container quickbook files.
[SVN r41123]
2007-11-15 23:36:33 +00:00
Daniel James 268a7eb7c3 New C++ working draft.
[SVN r40724]
2007-11-03 16:48:06 +00:00
Daniel James 0897244b5d Fix a typo.
[SVN r40723]
2007-11-03 16:46:40 +00:00
Daniel James afaf28c796 Remove duplicate declaration of 'size'.
[SVN r40566]
2007-10-29 20:23:39 +00:00
Daniel James 35402d185e Move the 'swap' free functions inside the class declarations that they should be associated with.
[SVN r40563]
2007-10-29 20:20:58 +00:00
Daniel James 0f5c2e1a7d Quick note about n2339 - Response to N2257=07-0117 "Removing unused allocator functions"
[SVN r39953]
2007-10-12 00:04:10 +00:00
Daniel James 3b3c0f68e8 Rewrite the swap implementation note so that it make some sort of sense.
[SVN r39952]
2007-10-11 23:57:52 +00:00
Daniel James 1b200a6194 Update the unordered containers' documentation and notes for the most recent papers from the C++ working group - will probably have to do this again in a few weeks.
[SVN r39951]
2007-10-11 23:51:29 +00:00
Daniel James 2cdb800ec3 Change insert/erase as specified in n2369.
[SVN r39949]
2007-10-11 22:47:17 +00:00
Daniel James ba7d4151c9 Fix the authors and copyrights in the unordered container document info.
[SVN r39911]
2007-10-10 21:47:21 +00:00
Daniel James f5a56fee81 Fix a typo.
[SVN r39027]
2007-08-27 23:01:34 +00:00
Daniel James 048eed8315 Slight improvement to the unordered containers boostbook code.
[SVN r39026]
2007-08-27 23:00:30 +00:00
Daniel James 4bd65e069e Fix up the member typedef descriptions.
[SVN r39025]
2007-08-27 22:48:13 +00:00