|
|
Boost-Commit : |
From: igaztanaga_at_[hidden]
Date: 2008-06-27 14:20:47
Author: igaztanaga
Date: 2008-06-27 14:20:47 EDT (Fri, 27 Jun 2008)
New Revision: 46787
URL: http://svn.boost.org/trac/boost/changeset/46787
Log:
Some fixes for inspection report, Run Date: 15:00:47 UTC, Friday 27 June 2008
Removed:
trunk/libs/interprocess/proj/to-do.txt
trunk/libs/intrusive/proj/vc7ide/to-do.txt
Text files modified:
trunk/libs/interprocess/index.html | 5 +++++
trunk/libs/intrusive/index.html | 9 +++++++--
2 files changed, 12 insertions(+), 2 deletions(-)
Modified: trunk/libs/interprocess/index.html
==============================================================================
--- trunk/libs/interprocess/index.html (original)
+++ trunk/libs/interprocess/index.html 2008-06-27 14:20:47 EDT (Fri, 27 Jun 2008)
@@ -1,3 +1,8 @@
+<!--
+Copyright 2005-2008 Ion Gaztanaga
+Distributed under the Boost Software License, Version 1.0. (See accompanying
+file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+-->
<html>
<head>
<meta http-equiv="refresh" content="0; URL=../../doc/html/interprocess.html">
Deleted: trunk/libs/interprocess/proj/to-do.txt
==============================================================================
--- trunk/libs/interprocess/proj/to-do.txt 2008-06-27 14:20:47 EDT (Fri, 27 Jun 2008)
+++ (empty file)
@@ -1,46 +0,0 @@
--> Implement zero_memory flag for allocation_command
-
--> The general allocation funtion can be improved with some fixed size allocation bins.
-
--> Adapt error reporting to TR1 system exceptions
-
--> Improve exception messages
-
--> Movability of containers should depend on the no-throw guarantee of allocators copy constructor
-
--> Check self-assignment for vectors
-
--> Update writing a new memory allocator explaining new functions (like alignment)
-
--> private node allocators could take the number of nodes as a runtime parameter.
-
--> Explain how to build intrusive indexes.
-
--> Add intrusive index types as available indexes.
-
--> Add maximum alignment allocation limit in PageSize bytes. Otherwise, we can't
- guarantee alignment for process-shared allocations.
-
--> Add default algorithm and index types. The user does not need to know how are
- they implemented.
-
--> Pass max size check in allocation to node pools
-
--> Use in-place expansion capabilities to shrink_to_fit and reserve functions
- from iunordered_index.
-
--> Keep an eye on container iterator constness issue to bring Interprocess containers up-to-date.
-
--> change unique_ptr to avoid using compressed_pair
-
--> Improve unique_ptr test to test move assignment and other goodies like assigment from null
-
--> barrier_test fails on MacOS X on PowerPC.
-
--> add private_read_only to mapped_region to support MAP_PRIVATE plus PROT_READ
-
--> add contiguous_elements option to burst allocation
-
--> Completely erase is_movable in code and tests for compilers with rvalue reference
-
--> named_xxx classes and file lock should be movable
\ No newline at end of file
Modified: trunk/libs/intrusive/index.html
==============================================================================
--- trunk/libs/intrusive/index.html (original)
+++ trunk/libs/intrusive/index.html 2008-06-27 14:20:47 EDT (Fri, 27 Jun 2008)
@@ -1,9 +1,14 @@
+<!--
+Copyright 2005-2008 Ion Gaztanaga
+Distributed under the Boost Software License, Version 1.0. (See accompanying
+file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+-->
<html>
<head>
-<meta http-equiv="refresh" content="0; URL=../../doc/html/intrusive.html">
+ <meta http-equiv="refresh" content="0; URL=../../doc/html/intrusive.html">
</head>
<body>
Automatic redirection failed, please go to
-../../doc/html/intrusive
+../../doc/html/intrusive.html
</body>
</html>
Deleted: trunk/libs/intrusive/proj/vc7ide/to-do.txt
==============================================================================
--- trunk/libs/intrusive/proj/vc7ide/to-do.txt 2008-06-27 14:20:47 EDT (Fri, 27 Jun 2008)
+++ (empty file)
@@ -1,37 +0,0 @@
-Implement incremental hashing:
-
-bucket_len is power of two
-cur_idx is always at least, half of bucket_len
-
-find bucket from value:
- size_type bucket_num = hash(val) &(bucket_len - 1);
- if (bucket_num >= cur_idx)
- bucket_num -= bucket_len/2;
-
-incremental_rehash:
-
- iterator _Plist, _Where;
- if (load_factor > LoadFactorLimit)
- { // too dense, need to grow hash table
- if (cur_idx >= (bucket_len - 1))
- { // table full, request doubling
- return false;
- }
- else if (cur_idx >= bucket_len)
- bucket_len*=2;
-
- size_type bucket_num = cur_idx - bucket_len/2;
- // rehash elements from bucket_num
- ++cur_idx;
- }
-
-insert from value:
-
- size_type bucket_num = hash(val) & (bucket_len - 1);
- if (bucket_num >= cur_idx)
- bucket_num -= bucket_len/2;
- insert in bucket
-
-rehash:
-
-
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk