|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r71556 - in sandbox: block_ptr block_ptr/boost block_ptr/boost/detail block_ptr/libs block_ptr/libs/smart_ptr block_ptr/libs/smart_ptr/doc block_ptr/libs/smart_ptr/example mutual_ptr
From: phil_at_[hidden]
Date: 2011-04-27 22:56:57
Author: pbouchard
Date: 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
New Revision: 71556
URL: http://svn.boost.org/trac/boost/changeset/71556
Log:
* Renamed Mutual Pointer to Block Pointer
Added:
sandbox/block_ptr/
sandbox/block_ptr/LICENSE_1_0.txt (contents, props changed)
sandbox/block_ptr/README.txt (contents, props changed)
sandbox/block_ptr/boost/
sandbox/block_ptr/boost/block_allocator.hpp (contents, props changed)
sandbox/block_ptr/boost/block_ptr.hpp (contents, props changed)
sandbox/block_ptr/boost/detail/
sandbox/block_ptr/boost/detail/block_base.hpp (contents, props changed)
sandbox/block_ptr/boost/detail/block_ptr_base.hpp (contents, props changed)
sandbox/block_ptr/boost/detail/intrusive_list.hpp (contents, props changed)
sandbox/block_ptr/boost/detail/intrusive_stack.hpp (contents, props changed)
sandbox/block_ptr/boost/detail/roofof.hpp (contents, props changed)
sandbox/block_ptr/libs/
sandbox/block_ptr/libs/smart_ptr/
sandbox/block_ptr/libs/smart_ptr/doc/
sandbox/block_ptr/libs/smart_ptr/doc/BlockPointer.ppt (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/doc/Cyclicism1.png (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/doc/Cyclicism2.png (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/doc/Doxyfile (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/doc/Introduction.png (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/doc/Union1.png (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/doc/Union2.png (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/doc/acknowledgments.html (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/doc/bibliography.html (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/doc/configuration.html (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/doc/definitions.html (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/doc/faq.html (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/doc/index.html (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/doc/overview.html (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/doc/rationale.html (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/doc/tutorial.html (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/example/
sandbox/block_ptr/libs/smart_ptr/example/Jamfile.v2 (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/example/Makefile (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/example/block_ptr_test1.cpp (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/example/block_ptr_test2.cpp (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/example/block_ptr_test3.cpp (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/example/local_pool_test1.cpp (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/example/local_pool_test2.cpp (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/example/t100.h (contents, props changed)
sandbox/block_ptr/libs/smart_ptr/example/t100_test1.cpp (contents, props changed)
Removed:
sandbox/mutual_ptr/
Added: sandbox/block_ptr/LICENSE_1_0.txt
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/LICENSE_1_0.txt 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,23 @@
+Boost Software License - Version 1.0 - August 17th, 2003
+
+Permission is hereby granted, free of charge, to any person or organization
+obtaining a copy of the software and accompanying documentation covered by
+this license (the "Software") to use, reproduce, display, distribute,
+execute, and transmit the Software, and to prepare derivative works of the
+Software, and to permit third-parties to whom the Software is furnished to
+do so, all subject to the following:
+
+The copyright notices in the Software and this entire statement, including
+the above license grant, this restriction and the following disclaimer,
+must be included in all copies of the Software, in whole or in part, and
+all derivative works of the Software, unless such copies or derivative
+works are solely in the form of machine-executable object code generated by
+a source language processor.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
+SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
+FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
+ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
Added: sandbox/block_ptr/README.txt
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/README.txt 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,14 @@
+Unless otherwise specified, terms and conditions of use for Boost software
+and documentation are described in the accompanying license. See the file
+named LICENSE in the top-level directory.
+
+For the most current version of Boost libraries and documentation, see:
+
+ http://www.boost.org
+
+Boost documentation is in HTML format.
+
+The top-level directory (which contains this README file) should contain
+a file named index.htm with links to all documentation, including
+documentation on building boost libraries for your particular compiler
+and operating system.
Added: sandbox/block_ptr/boost/block_allocator.hpp
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/boost/block_allocator.hpp 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,127 @@
+/**
+ @file
+ Boost block_allocator.hpp header file.
+
+ @note
+ Copyright (c) 2008 Phil Bouchard <phil_at_[hidden]>.
+
+ 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
+
+ See http://www.boost.org/libs/smart_ptr/doc/index.html for documentation.
+*/
+
+
+#ifndef BOOST_BLOCK_ALLOCATOR_HPP_INCLUDED
+#define BOOST_BLOCK_ALLOCATOR_HPP_INCLUDED
+
+// MS compatible compilers support #pragma once
+
+#if defined(_MSC_VER) && (_MSC_VER >= 1020)
+# pragma once
+#endif
+
+#include <boost/block_ptr.hpp>
+
+
+namespace boost
+{
+
+namespace detail
+{
+
+namespace sh
+{
+
+
+/**
+ STL compliant allocator.
+
+ @note
+ Default object contructor is called inside allocate() to save temporaries.
+*/
+
+template <typename T>
+ class block_allocator
+ {
+ typedef T element_type;
+
+ public:
+ typedef block<T> value_type;
+ typedef size_t size_type;
+ typedef ptrdiff_t difference_type;
+ typedef T * pointer;
+ typedef const T * const_pointer;
+ typedef element_type & reference;
+ typedef const element_type & const_reference;
+
+ template <typename U>
+ struct rebind
+ {
+ typedef block_allocator<U> other;
+ };
+
+ block_allocator() throw() {}
+ block_allocator(const block_allocator &) throw() {}
+ template <typename U>
+ block_allocator(const block_allocator<U> &) throw() {}
+
+ ~block_allocator() throw() {}
+ pointer address(reference x) const { return & x; }
+ const_pointer address(const_reference x) const { return & x; }
+
+ size_type max_size() const throw()
+ {
+ return size_t(-1) / sizeof(T);
+ }
+
+ pointer allocate(size_type s, const void * = 0)
+ {
+ //value_type * p = (value_type *) value_type::operator new(sizeof(value_type));
+ value_type * p = new value_type();
+
+ return p->element();
+ }
+
+ void construct(pointer p, const T & x)
+ {
+ //::new (p) owned_base;
+ //::new (p->element()) T(x);
+ }
+
+ void destroy(pointer p)
+ {
+ p->reset();
+ }
+
+ void deallocate(pointer p, size_type)
+ {
+ }
+ };
+
+template <typename T>
+ inline bool operator == (const block_allocator<T> &, const block_allocator<T> &)
+ {
+ return true;
+ }
+
+template <typename T>
+ inline bool operator != (const block_allocator<T> &, const block_allocator<T> &)
+ {
+ return false;
+ }
+
+
+} // namespace sh
+
+} // namespace detail
+
+using detail::sh::block_allocator;
+using detail::sh::operator ==;
+using detail::sh::operator !=;
+
+} // namespace boost
+
+#endif // #ifndef BOOST_SHIFTED_ALLOCATOR_HPP_INCLUDED
Added: sandbox/block_ptr/boost/block_ptr.hpp
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/boost/block_ptr.hpp 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,451 @@
+/**
+ @file
+ Boost block_ptr.hpp header file.
+
+ @author
+ Copyright (c) 2008 Phil Bouchard <phil_at_[hidden]>.
+
+ @note
+ 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
+
+ See http://www.boost.org/libs/smart_ptr/doc/index.html for documentation.
+
+
+ Thanks to: Steven Watanabe <watanabesj_at_[hidden]>
+*/
+
+
+#ifndef BOOST_DETAIL_BLOCK_PTR_INCLUDED
+#define BOOST_DETAIL_BLOCK_PTR_INCLUDED
+
+
+#if defined(_MSC_VER)
+#pragma warning( push )
+#pragma warning( disable : 4355 )
+
+#include <new.h>
+#endif
+
+#include <iostream>
+#include <boost/pool/pool_alloc.hpp>
+#include <boost/type_traits/add_pointer.hpp>
+#include <boost/smart_ptr/detail/atomic_count.hpp>
+#include <boost/thread/thread.hpp>
+
+#include <boost/detail/intrusive_list.hpp>
+#include <boost/detail/intrusive_stack.hpp>
+#include <boost/detail/roofof.hpp>
+#include <boost/detail/block_ptr_base.hpp>
+
+
+namespace boost
+{
+
+namespace detail
+{
+
+namespace sh
+{
+
+
+class block_base;
+
+
+/**
+ Set header.
+
+ Proxy object used to count the number of pointers from the stack are referencing pointee objects belonging to the same @c block_header .
+*/
+
+class block_header
+{
+ typedef detail::atomic_count count_type;
+
+ count_type count_; /**< Count of the number of pointers from the stack referencing the same @c block_header .*/
+ mutable block_header * redir_; /**< Redirection in the case of an union multiple sets.*/
+
+ intrusive_list includes_; /**< List of all sets of an union. */
+ intrusive_list elements_; /**< List of all pointee objects belonging to a @c block_header . */
+
+ static fast_pool_allocator<block_header> pool_;/**< Pool where all sets are allocated. */
+
+public:
+#ifndef BOOST_DISABLE_THREADS
+ mutex mutex_;
+#endif
+ bool destroy_; /**< Destruction sequence initiated. */
+ intrusive_list::node tag_; /**< Tag used to enlist to @c block_header::includes_ . */
+
+
+ /**
+ Initialization of a single @c block_header .
+ */
+
+ block_header() : count_(1), redir_(this), destroy_(false)
+ {
+ includes_.push_back(& tag_);
+ }
+
+
+ /**
+ Release of a @c block_header with possible destruction of all its elements and other sets unified to it.
+
+ @return True if the @c block_header was released.
+ */
+
+ bool release()
+ {
+ block_header * p = redir();
+
+ if (-- p->count_ == 0)
+ {
+#ifndef BOOST_DISABLE_THREADS
+ mutex::scoped_lock scoped_lock(mutex_);
+#endif
+ p->destroy_ = true;
+ for (intrusive_list::iterator<block_base, & block_base::block_tag_> i; i = p->elements_.begin(), i != p->elements_.end(); )
+ delete &* i;
+ p->destroy_ = false;
+
+ for (intrusive_list::iterator<block_header, & block_header::tag_> i = p->includes_.begin(), j; j = i, i != p->includes_.end(); i = j)
+ {
+ ++ j;
+ if (&* i != this && &* i != p)
+ delete &* i;
+ }
+
+ if (p != this)
+ delete p;
+
+ return true;
+ }
+
+ return false;
+ }
+
+
+ /**
+ Recursive search for the @c block_header header of an union.
+
+ @return @c block_header responsible for managing the counter of an union.
+ */
+
+ block_header * redir() const
+ {
+ if (redir_ == this) return redir_;
+ else return redir_ = redir_->redir();
+ }
+
+
+ /**
+ Unification with a new @c block_header .
+
+ @param p New @c block_header to unify with.
+ */
+
+ void redir(block_header * p)
+ {
+ if (redir_ != p->redir())
+ {
+#ifndef BOOST_DISABLE_THREADS
+ mutex::scoped_lock scoped_lock(mutex_);
+#endif
+ redir_ = p->redir();
+ redir_->includes_.merge(includes_);
+ redir_->elements_.merge(elements_);
+ new (& redir_->count_) count_type(redir_->count_ + count_); /**< Hack */
+ }
+ }
+
+
+ /**
+ Finds the elements constituting one or many sets unified.
+
+ @return List of all elements.
+ */
+
+ intrusive_list * elements() const
+ {
+ return & redir()->elements_;
+ }
+
+
+ /**
+ Allocates a new @c block_header using the fast pool allocator.
+
+ @param s Size of the @c block_header .
+ @return Pointer of the new memory block.
+ */
+
+ void * operator new (size_t s)
+ {
+ return pool_.allocate(s);
+ }
+
+
+ /**
+ Placement new.
+
+ @param s Size of the @c block_header .
+ @param p Address to construct the @c block_header on.
+ @return Address to construct the @c block_header on.
+ */
+
+ void * operator new (size_t s, block_header * p)
+ {
+ return p;
+ }
+
+
+ /**
+ Deallocates a @c block_header from the fast pool allocator.
+
+ @param p Address of the @c block_header to deallocate.
+ */
+
+ void operator delete (void * p)
+ {
+ pool_.deallocate(static_cast<block_header *>(p), sizeof(block_header));
+ }
+};
+
+
+fast_pool_allocator<block_header> block_header::pool_;
+
+
+/**
+ Deterministic memory manager of constant complexity.
+
+ Complete memory management utility on top of standard reference counting.
+*/
+
+template <typename T>
+ class block_ptr : public block_ptr_base<T>
+ {
+ template <typename> friend class block_ptr;
+
+ typedef block_ptr_base<T> base;
+
+ using base::share;
+ using base::po_;
+
+ union
+ {
+ block_header * ps_; /**< Pointer to the @c block_header node @c block_ptr<> belongs to. */
+ intrusive_stack::node pn_; /**< Tag used for enlisting a pointer on the heap to later share the @c block_header it belongs to. */
+ };
+
+ public:
+ typedef T value_type;
+ typedef block<value_type> element_type;
+
+
+ /**
+ Initialization of a pointer living on the stack or proper enlistment if living on the heap.
+ */
+
+ block_ptr() : ps_(0)
+ {
+ if (! block_base::pool_.is_from(this))
+ ps_ = new block_header();
+ else
+ block_base::pool_.top(this)->ptrs_.push(& pn_);
+ }
+
+
+ /**
+ Initialization of a pointer living on the stack or proper enlistment if living on the heap.
+
+ @param p New pointee object to manage.
+ */
+
+ template <typename V>
+ block_ptr(block<V> * p) : base(p)
+ {
+ if (! block_base::pool_.is_from(this))
+ {
+ ps_ = new block_header();
+
+ init(p);
+ }
+ else
+ {
+ block_base::pool_.top(this)->ptrs_.push(& pn_);
+ block_base::pool_.top(this)->inits_.merge(p->inits_);
+ }
+ }
+
+
+ /**
+ Initialization of a pointer living on the stack or proper enlistment if living on the heap.
+
+ @param p New pointer to manage.
+ */
+
+ template <typename V>
+ block_ptr(block_ptr<V> const & p) : base(p)
+ {
+ if (! block_base::pool_.is_from(this))
+ ps_ = new block_header();
+ else
+ block_base::pool_.top(this)->ptrs_.push(& pn_);
+
+ ps_->redir(p.ps_);
+ }
+
+
+ /**
+ Initialization of a pointer living on the stack or proper enlistment if living on the heap.
+
+ @param p New pointer to manage.
+ */
+
+ block_ptr(block_ptr<T> const & p) : base(p)
+ {
+ if (! block_base::pool_.is_from(this))
+ ps_ = new block_header();
+ else
+ block_base::pool_.top(this)->ptrs_.push(& pn_);
+
+ ps_->redir(p.ps_);
+ }
+
+
+ /**
+ Assignment & union of 2 sets if the pointee resides a different @c block_header.
+
+ @param p New pointee object to manage.
+ */
+
+ template <typename V>
+ block_ptr & operator = (block<V> * p)
+ {
+ release(false);
+
+ init(p);
+
+ base::operator = (p);
+
+ return * this;
+ }
+
+
+ /**
+ Assignment & union of 2 sets if the pointee resides a different @c block_header.
+
+ @param p New pointer to manage.
+ */
+
+ template <typename V>
+ block_ptr & operator = (block_ptr<V> const & p)
+ {
+ if (ps_->redir() != p.ps_->redir())
+ {
+ release(false);
+
+ ps_->redir(p.ps_);
+ }
+ base::operator = (p);
+
+ return * this;
+ }
+
+
+ /**
+ Assignment & union of 2 sets if the pointee resides a different @c block_header.
+
+ @param p New pointer to manage.
+ */
+
+ block_ptr & operator = (block_ptr<T> const & p)
+ {
+ return operator = <T>(p);
+ }
+
+ void reset()
+ {
+ release(false);
+ }
+
+ ~block_ptr()
+ {
+ if (ps_->destroy_)
+ base::po_ = 0;
+ else
+ release(true);
+ }
+
+ private:
+ /**
+ Release of the pointee object with or without destroying the entire @c block_header it belongs to.
+
+ @param d Destroy (true) or reuse (false) the @c block_header it is releasing.
+ */
+
+ void release(bool d)
+ {
+ base::reset();
+
+ if (! block_base::pool_.is_from(this))
+ if (ps_->release())
+ if (! d)
+ new (ps_) block_header();
+ else
+ delete ps_;
+ else
+ if (! d)
+ ps_ = new block_header();
+ }
+
+
+ /**
+ Enlist & initialize pointee objects belonging to the same @c block_header . This initialization occurs when a pointee object is affected to the first pointer living on the stack it encounters.
+
+ @param p Pointee object to initialize.
+ */
+
+ void init(block_base * p)
+ {
+ if (p->init_)
+ return;
+
+#ifndef BOOST_DISABLE_THREADS
+ mutex::scoped_lock scoped_lock(ps_->mutex_);
+#endif
+
+ // iterate memory blocks
+ for (intrusive_list::iterator<block_base, & block_base::init_tag_> i = p->inits_.begin(); i != p->inits_.end(); ++ i)
+ {
+ i->init_ = true;
+ ps_->elements()->push_back(& i->block_tag_);
+
+ // iterate block_ptr elements
+ for (intrusive_stack::iterator<block_ptr, & block_ptr::pn_> j = i->ptrs_.begin(), k; k = j, j != i->ptrs_.end(); j = k)
+ {
+ ++ k;
+ j->ps_ = ps_;
+ }
+ }
+ }
+ };
+
+
+} // namespace sh
+
+} // namespace detail
+
+using detail::sh::block_ptr;
+using detail::sh::block;
+
+} // namespace boost
+
+
+#if defined(_MSC_VER)
+#pragma warning( pop )
+#endif
+
+
+#endif // #ifndef BOOST_DETAIL_SH_RTCMM_H_INCLUDED
Added: sandbox/block_ptr/boost/detail/block_base.hpp
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/boost/detail/block_base.hpp 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,331 @@
+/**
+ @file
+ Boost detail/block_base.hpp header file.
+
+ @note
+ Copyright (c) 2008 Phil Bouchard <phil_at_[hidden]>.
+
+ 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
+
+ See http://www.boost.org/libs/smart_ptr/doc/index.html for documentation.
+*/
+
+
+#ifndef BOOST_DETAIL_BLOCK_BASE_HPP_INCLUDED
+#define BOOST_DETAIL_BLOCK_BASE_HPP_INCLUDED
+
+// MS compatible compilers support #pragma once
+
+#if defined(_MSC_VER) && (_MSC_VER >= 1020)
+# pragma once
+#endif
+
+#include <stack>
+#include <limits>
+
+#include <boost/thread.hpp>
+#include <boost/thread/tss.hpp>
+#include <boost/pool/pool.hpp>
+#include <boost/pool/pool_alloc.hpp>
+#include <boost/numeric/interval.hpp>
+#include <boost/type_traits/is_array.hpp>
+#include <boost/type_traits/remove_extent.hpp>
+#include <boost/type_traits/has_trivial_destructor.hpp>
+#include <boost/preprocessor/control/expr_if.hpp>
+#include <boost/preprocessor/arithmetic/inc.hpp>
+#include <boost/preprocessor/punctuation/comma_if.hpp>
+#include <boost/preprocessor/repetition/repeat.hpp>
+#include <boost/preprocessor/repetition/repeat_from_to.hpp>
+
+#include <boost/detail/intrusive_list.hpp>
+#include <boost/detail/intrusive_stack.hpp>
+#include <boost/detail/roofof.hpp>
+
+
+namespace boost
+{
+
+namespace detail
+{
+
+namespace sh
+{
+
+
+class block_header;
+class block_base;
+
+
+/**
+ Allocator wrapper tracking allocations.
+
+ Pool where all pointee objects are allocated and tracks memory blocks for later enlisting & marking the @c block_header the pointee object belongs to.
+*/
+
+struct pool : boost::pool<>
+{
+ typedef std::list< numeric::interval<long>, fast_pool_allocator< numeric::interval<long> > > pool_lii; /**< Syntax helper. */
+
+#ifndef BOOST_DISABLE_THREADS
+ thread_specific_ptr<pool_lii> plii_; /**< Thread specific list of memory boundaries. */
+#else
+ std::auto_ptr<pool_lii> plii_; /**< List of memory boundaries. */
+#endif
+
+
+ /**
+ Initialization of a pool instance.
+ */
+
+ pool() : boost::pool<>(1)
+ {
+ plii_.reset(new pool_lii());
+ }
+
+
+ /**
+ Tracks the memory boundaries where a pointer belongs to. Also gets rid of the boundaries that were allocated before the pointer was allocated.
+
+ @param p Pointer that is being tracked.
+ @return Pointer to the pointee object where @c p belongs to.
+ */
+
+ block_base * top(void * p)
+ {
+ pool_lii::reverse_iterator i;
+
+ for (i = plii_->rbegin(); i != plii_->rend(); i ++)
+ if (in((long)(p), * i))
+ break;
+
+ plii_->erase(i.base(), plii_->end());
+
+ return (block_base *)(plii_->rbegin()->lower());
+ }
+
+
+ /**
+ Pointee object allocator and stacking of the newly allocated memory boundary.
+
+ @param s Size of the memory block to allocate.
+ @return Address of the newly allocated block.
+ */
+
+ void * allocate(std::size_t s)
+ {
+ void * p = ordered_malloc(s);
+
+ plii_->push_back(numeric::interval<long>((long) p, long((char *)(p) + s)));
+
+ return p;
+ }
+
+
+ /**
+ Pointee object deallocator and removal of the boundaries that were allocated before the pointer was allocated.
+
+ @param p Address of the memory block to deallocate.
+ @param s Size of the memory block.
+ */
+
+ void deallocate(void * p, std::size_t s)
+ {
+ pool_lii::reverse_iterator i;
+
+ for (i = plii_->rbegin(); i != plii_->rend(); i ++)
+ if (in((long)(p), * i))
+ break;
+
+ plii_->erase(i.base(), plii_->end());
+ ordered_free(p, s);
+ }
+};
+
+
+/**
+ Root class of all pointee objects.
+*/
+
+class block_base : public sp_counted_base
+{
+public:
+ bool init_; /**< Flag marking initialization of the pointee object to its @c block_header . */
+
+ intrusive_stack ptrs_; /**< Stack of all @c block_ptr s on the heap that will later need to be initlialized to a specific @c block_header . */
+ intrusive_list inits_; /**< List of all pointee objects that will later need to be initlialized to a specific @c block_header .*/
+
+ intrusive_list::node block_tag_; /**< Tag used to enlist to @c block_header::elements_ . */
+ intrusive_list::node init_tag_; /**< Tag used to enlist to @c block_base::inits_ . */
+
+
+ block_base() : init_(false)
+ {
+ inits_.push_back(& init_tag_);
+ }
+
+ static pool pool_; /**< Pool where all pointee objects are allocated from. */
+
+protected:
+ virtual void dispose() {} /**< dublocky */
+ virtual void * get_deleter( std::type_info const & ti ) { return 0; } /**< dublocky */
+};
+
+
+pool block_base::pool_;
+
+
+#define TEMPLATE_DECL(z, n, text) BOOST_PP_COMMA_IF(n) typename T ## n
+#define ARGUMENT_DECL(z, n, text) BOOST_PP_COMMA_IF(n) T ## n const & t ## n
+#define PARAMETER_DECL(z, n, text) BOOST_PP_COMMA_IF(n) t ## n
+
+#define CONSTRUCT_OWNED(z, n, text) \
+ template <BOOST_PP_REPEAT(n, TEMPLATE_DECL, 0)> \
+ text(BOOST_PP_REPEAT(n, ARGUMENT_DECL, 0)) : elem_(BOOST_PP_REPEAT(n, PARAMETER_DECL, 0)) {}
+
+/**
+ Object wrapper.
+*/
+
+template <typename T>
+ class block : public block_base
+ {
+ typedef T data_type;
+
+ T elem_; /**< Pointee object. @note Needs alignas<long>. */
+
+ public:
+ class roofof;
+ friend class roofof;
+
+ block() : elem_()
+ {
+ }
+
+ BOOST_PP_REPEAT_FROM_TO(1, 10, CONSTRUCT_OWNED, block)
+
+
+ /**
+ @return Pointee object address.
+ */
+
+ data_type * element() { return & elem_; }
+ operator data_type & () { return * element(); }
+ operator data_type const & () const { return * element(); }
+
+ virtual ~block()
+ {
+ dispose();
+ }
+
+ public:
+ /**
+ Cast operator used by @c block_ptr_coblockon::header() .
+ */
+
+ class roofof
+ {
+ block * p_; /**< Address of the @c block the element belong to. */
+
+ public:
+ /**
+ Casts from a @c data_type to its parent @c block object.
+
+ @param p Address of a @c data_type member object to cast from.
+ */
+
+ roofof(data_type * p) : p_(sh::roofof((data_type block::*)(& block::elem_), p)) {}
+
+
+ /**
+ @return Address of the parent @c block object.
+ */
+
+ operator block * () const { return p_; }
+ };
+
+
+ /**
+ Allocates a new @c block using the pool.
+
+ @param s Size of the @c block .
+ @return Pointer of the new memory block.
+ */
+
+ void * operator new (size_t s)
+ {
+ return pool_.allocate(s);
+ }
+
+
+ /**
+ Deallocates a @c block from the pool.
+
+ @param p Address of the @c block to deallocate.
+ */
+
+ void operator delete (void * p)
+ {
+ pool_.deallocate(p, sizeof(block));
+ }
+ };
+
+
+template <>
+ class block<void> : public block_base
+ {
+ typedef void data_type;
+
+ long elem_; /**< Pointee placeholder. @note Aligned. */
+
+ block();
+
+ public:
+ class roofof;
+ friend class roofof;
+
+ data_type * element() { return & elem_; }
+
+ virtual ~block() {}
+ virtual void dispose() {}
+
+ virtual void * get_deleter( std::type_info const & ti ) {}
+
+ public:
+ /**
+ Cast operator used by @c block_ptr_coblockon::header() .
+ */
+
+ class roofof
+ {
+ block * p_; /**< Address of the @c block the element belong to. */
+
+ public:
+ /**
+ Casts from a @c data_type to its parent @c block object.
+
+ @param p Address of a @c data_type member object to cast from.
+ */
+
+ roofof(data_type * p) : p_(sh::roofof((long block::*)(& block::elem_), static_cast<long *>(p))) {}
+
+
+ /**
+ @return Address of the parent @c block object.
+ */
+
+ operator block * () const { return p_; }
+ };
+ };
+
+
+} // namespace sh
+
+} // namespace detail
+
+} // namespace boost
+
+
+#endif // #ifndef BOOST_DETAIL_SH_OWNED_BASE_NT_HPP_INCLUDED
Added: sandbox/block_ptr/boost/detail/block_ptr_base.hpp
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/boost/detail/block_ptr_base.hpp 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,356 @@
+/**
+ @file
+ Boost block_ptr_base.hpp header file.
+
+ @note
+ Copyright (c) 2003 - 2008 Phil Bouchard <phil_at_[hidden]>.
+ Copyright (c) 2001 - 2007 Peter Dimov
+
+ 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
+
+ See http://www.boost.org/libs/smart_ptr/doc/index.html for documentation.
+*/
+
+
+#ifndef BOOST_DETAIL_BLOCK_PTR_BASE_HPP
+#define BOOST_DETAIL_BLOCK_PTR_BASE_HPP
+
+
+#include <boost/detail/roofof.hpp>
+#include <boost/detail/block_base.hpp>
+
+
+namespace boost
+{
+
+namespace detail
+{
+
+namespace sh
+{
+
+
+/**
+ Smart pointer optimized for speed and memory usage.
+
+ This class represents a basic smart pointer interface.
+*/
+
+template <typename T>
+ class block_ptr_coblockon
+ {
+ template <typename> friend class block_ptr_coblockon;
+
+ // Borland 5.5.1 specific workaround
+ typedef block_ptr_coblockon<T> this_type;
+
+ protected:
+ typedef T value_type;
+ typedef block<value_type> element_type;
+
+ value_type * po_;
+
+ public:
+ block_ptr_coblockon() : po_(0)
+ {
+ }
+
+ ~block_ptr_coblockon()
+ {
+ if (po_)
+ {
+ header()->release();
+ }
+ }
+
+ template <typename V>
+ block_ptr_coblockon(detail::sh::block<V> * p) : po_(p->element())
+ {
+ }
+
+ template <typename V>
+ block_ptr_coblockon(block_ptr_coblockon<V> const & p) : po_(p.share())
+ {
+ }
+
+ block_ptr_coblockon(block_ptr_coblockon<value_type> const & p) : po_(p.share())
+ {
+ }
+
+ template <typename V>
+ block_ptr_coblockon & operator = (detail::sh::block<V> * p)
+ {
+ reset(p->element());
+
+ return * this;
+ }
+
+ template <typename V>
+ block_ptr_coblockon & operator = (block_ptr_coblockon<V> const & p)
+ {
+ if (p.po_ != po_)
+ {
+ reset(p.share());
+ }
+ return * this;
+ }
+
+ block_ptr_coblockon & operator = (block_ptr_coblockon<value_type> const & p)
+ {
+ return operator = <value_type>(p);
+ }
+
+ value_type * get() const
+ {
+ return po_;
+ }
+
+ value_type * share() const
+ {
+ if (po_)
+ {
+ header()->add_ref_copy();
+ }
+ return po_;
+ }
+
+ void reset(value_type * p = 0)
+ {
+ if (po_)
+ {
+ header()->release();
+ }
+ po_ = p;
+ }
+
+#if ( defined(__SUNPRO_CC) && BOOST_WORKAROUND(__SUNPRO_CC, < 0x570) ) || defined(__CINT__)
+ operator bool () const
+ {
+ return po_ != 0;
+ }
+#elif defined( _MANAGED )
+ static void unspecified_bool( this_type*** )
+ {
+ }
+
+ typedef void (*unspecified_bool_type)( this_type*** );
+
+ operator unspecified_bool_type() const // never throws
+ {
+ return po_ == 0? 0: unspecified_bool;
+ }
+#elif \
+ ( defined(__MWERKS__) && BOOST_WORKAROUND(__MWERKS__, < 0x3200) ) || \
+ ( defined(__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ < 304) ) || \
+ ( defined(__SUNPRO_CC) && BOOST_WORKAROUND(__SUNPRO_CC, <= 0x590) )
+
+ typedef value_type * (this_type::*unspecified_bool_type)() const;
+
+ operator unspecified_bool_type() const // never throws
+ {
+ return po_ == 0? 0: &this_type::get;
+ }
+#else
+ typedef value_type * this_type::*unspecified_bool_type;
+
+ operator unspecified_bool_type() const // never throws
+ {
+ return po_ == 0? 0: &this_type::po_;
+ }
+#endif
+
+ // operator! is redundant, but some compilers need it
+
+ bool operator! () const // never throws
+ {
+ return po_ == 0;
+ }
+
+ long use_count() const // never throws
+ {
+ return header()->use_count();
+ }
+
+ protected:
+ detail::sh::block_base * header() const
+ {
+ detail::sh::block_base * p = (block<value_type> *) (typename block<value_type>::roofof) static_cast<value_type *>(rootof<is_polymorphic<value_type>::value>::get(po_));
+ return p;
+ }
+ };
+
+
+template <typename T>
+ class block_ptr_base : public block_ptr_coblockon<T>
+ {
+ typedef block_ptr_coblockon<T> base;
+ typedef typename base::value_type value_type;
+
+ protected:
+ using base::po_;
+
+ public:
+ block_ptr_base() : base()
+ {
+ }
+
+ template <typename V>
+ block_ptr_base(detail::sh::block<V> * p) : base(p)
+ {
+ }
+
+ template <typename V>
+ block_ptr_base(block_ptr_base<V> const & p) : base(p)
+ {
+ }
+
+ block_ptr_base(block_ptr_base<value_type> const & p) : base(p)
+ {
+ }
+
+ template <typename V>
+ block_ptr_base & operator = (detail::sh::block<V> * p)
+ {
+ return static_cast<block_ptr_base &>(base::operator = (p));
+ }
+
+ template <typename V>
+ block_ptr_base & operator = (block_ptr_base<V> const & p)
+ {
+ return static_cast<block_ptr_base &>(base::operator = (p));
+ }
+
+ block_ptr_base & operator = (block_ptr_base<value_type> const & p)
+ {
+ return static_cast<block_ptr_base &>(base::operator = (p));
+ }
+
+ value_type & operator * () const
+ {
+ return * po_;
+ }
+
+ value_type * operator -> () const
+ {
+ return po_;
+ }
+ };
+
+
+#if !defined(_MSC_VER)
+template <typename T, size_t N>
+ class block_ptr_base<T [N]> : public block_ptr_coblockon<T [N]>
+ {
+ typedef block_ptr_coblockon<T [N]> base;
+ typedef typename base::value_type value_type;
+
+ protected:
+ using base::po_;
+
+ public:
+ block_ptr_base() : base()
+ {
+ }
+
+ template <typename V>
+ block_ptr_base(detail::sh::block<V> * p) : base(p)
+ {
+ }
+
+ template <typename V>
+ block_ptr_base(block_ptr_base<V> const & p) : base(p)
+ {
+ }
+
+ block_ptr_base(block_ptr_base<value_type> const & p) : base(p)
+ {
+ }
+
+ template <typename V>
+ block_ptr_base & operator = (detail::sh::block<V> * p)
+ {
+ return static_cast<block_ptr_base &>(base::operator = (p));
+ }
+
+ template <typename V>
+ block_ptr_base & operator = (block_ptr_base<V> const & p)
+ {
+ return static_cast<block_ptr_base &>(base::operator = (p));
+ }
+
+ block_ptr_base & operator = (block_ptr_base<value_type> const & p)
+ {
+ return static_cast<block_ptr_base &>(base::operator = (p));
+ }
+
+ T & operator [] (std::size_t n)
+ {
+ return * (* po_ + n);
+ }
+
+ T const & operator [] (std::size_t n) const
+ {
+ return * (* po_ + n);
+ }
+ };
+#endif
+
+
+template <>
+ class block_ptr_base<void> : public block_ptr_coblockon<void>
+ {
+ typedef block_ptr_coblockon<void> base;
+ typedef base::value_type value_type;
+
+ protected:
+ using base::po_;
+
+ public:
+ block_ptr_base() : base()
+ {
+ }
+
+ template <typename V>
+ block_ptr_base(detail::sh::block<V> * p) : base(p)
+ {
+ }
+
+ template <typename V>
+ block_ptr_base(block_ptr_base<V> const & p) : base(p)
+ {
+ }
+
+ block_ptr_base(block_ptr_base<value_type> const & p) : base(p)
+ {
+ }
+
+ template <typename V>
+ block_ptr_base & operator = (detail::sh::block<V> * p)
+ {
+ return static_cast<block_ptr_base &>(base::operator = (p));
+ }
+
+ template <typename V>
+ block_ptr_base & operator = (block_ptr_base<V> const & p)
+ {
+ return static_cast<block_ptr_base &>(base::operator = (p));
+ }
+
+ block_ptr_base & operator = (block_ptr_base<value_type> const & p)
+ {
+ return static_cast<block_ptr_base &>(base::operator = (p));
+ }
+ };
+
+
+} // namespace sh
+
+} // namespace detail
+
+} // namespace boost
+
+
+#endif
Added: sandbox/block_ptr/boost/detail/intrusive_list.hpp
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/boost/detail/intrusive_list.hpp 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,172 @@
+/**
+ @file
+ Boost intrusive_list.hpp header file.
+
+ @note
+ Copyright (c) 2008 Phil Bouchard <phil_at_[hidden]>.
+
+ 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
+
+ See http://www.boost.org/libs/smart_ptr/doc/index.html for documentation.
+*/
+
+
+#ifndef BOOST_INTRUSIVE_LIST_HPP_INCLUDED
+#define BOOST_INTRUSIVE_LIST_HPP_INCLUDED
+
+
+#include <boost/detail/roofof.hpp>
+
+
+namespace boost
+{
+
+namespace detail
+{
+
+namespace sh
+{
+
+
+struct intrusive_list_node
+{
+ intrusive_list_node * next;
+ intrusive_list_node * prev;
+
+ intrusive_list_node() : next(this), prev(this)
+ {
+ }
+
+ void insert(intrusive_list_node * const p)
+ {
+ p->next = this;
+ p->prev = prev;
+
+ prev->next = p;
+ prev = p;
+ }
+
+ void erase()
+ {
+ prev->next = next;
+ next->prev = prev;
+
+ next = this;
+ prev = this;
+ }
+
+ ~intrusive_list_node()
+ {
+ erase();
+ }
+};
+
+
+class intrusive_list_base
+{
+protected:
+ intrusive_list_node impl;
+
+ void clear()
+ {
+ impl.next = & impl;
+ impl.prev = & impl;
+ }
+};
+
+
+/**
+ Static list.
+
+ Rewritten list template with explicit access to internal nodes. This
+ allows usages of tags already part of an object, used to group objects
+ together without the need of any memory allocation.
+*/
+
+class intrusive_list : protected intrusive_list_base
+{
+ typedef intrusive_list_base base;
+
+public:
+ typedef intrusive_list_node node;
+ typedef intrusive_list_node * pointer;
+ template <typename T, intrusive_list_node T::* P>
+ struct iterator;
+
+protected:
+ using base::impl;
+
+public:
+ pointer begin() { return impl.next; }
+ pointer end() { return & impl; }
+
+ bool empty() const { return impl.next == & impl; }
+
+ void push_front(pointer i)
+ {
+ begin()->insert(i);
+ }
+
+ void push_back(pointer i)
+ {
+ end()->insert(i);
+ }
+
+ void merge(intrusive_list& x)
+ {
+ if (! x.empty())
+ {
+ x.impl.prev->next = impl.next;
+ impl.next->prev = x.impl.prev;
+
+ impl.next = x.impl.next;
+ x.impl.next->prev = & impl;
+
+ x.clear();
+ }
+ }
+};
+
+
+template <typename T, intrusive_list_node T::* P>
+ struct intrusive_list::iterator
+ {
+ typedef iterator self_type;
+ typedef intrusive_list_node node_type;
+
+ iterator() : node_() {}
+ iterator(intrusive_list::pointer __x) : node_(__x) {}
+
+ T & operator * () const { return * roofof(P, node_); }
+ T * operator -> () const { return roofof(P, node_); }
+
+ self_type & operator ++ ()
+ {
+ node_ = node_->next;
+ return * this;
+ }
+
+ self_type & operator -- ()
+ {
+ node_ = node_->prev;
+ return * this;
+ }
+
+ bool operator == (const self_type & x) const { return node_ == x.node_; }
+ bool operator != (const self_type & x) const { return node_ != x.node_; }
+
+ node_type * node_;
+ };
+
+
+} // namespace sh
+
+} // namespace detail
+
+} // namespace boost
+
+
+#endif // #ifndef BOOST_INTRUSIVE_LIST_HPP_INCLUDED
Added: sandbox/block_ptr/boost/detail/intrusive_stack.hpp
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/boost/detail/intrusive_stack.hpp 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,126 @@
+/**
+ @file
+ Boost intrusive_stack.hpp header file.
+
+ @note
+ Copyright (c) 2008 Phil Bouchard <phil_at_[hidden]>.
+
+ 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
+
+ See http://www.boost.org/libs/smart_ptr/doc/index.html for documentation.
+*/
+
+
+#ifndef BOOST_INTRUSIVE_STACK_HPP_INCLUDED
+#define BOOST_INTRUSIVE_STACK_HPP_INCLUDED
+
+
+#include <boost/detail/roofof.hpp>
+
+
+namespace boost
+{
+
+namespace detail
+{
+
+namespace sh
+{
+
+
+struct intrusive_stack_node
+{
+ intrusive_stack_node * next;
+
+ void insert(intrusive_stack_node * const p)
+ {
+ p->next = next;
+ next = p;
+ }
+};
+
+
+class intrusive_stack_base
+{
+protected:
+ intrusive_stack_node impl;
+
+ intrusive_stack_base() { clear(); }
+
+ void clear()
+ {
+ impl.next = & impl;
+ }
+};
+
+
+/**
+ Static stack.
+
+ Rewritten stack template with explicit access to internal nodes. This
+ allows usages of tags already part of an object, used to group objects
+ together without the need of any memory allocation.
+*/
+
+class intrusive_stack : protected intrusive_stack_base
+{
+ typedef intrusive_stack_base base;
+
+public:
+ typedef intrusive_stack_node node;
+ typedef intrusive_stack_node * pointer;
+ template <typename T, intrusive_stack_node T::* P>
+ struct iterator;
+
+protected:
+ using base::impl;
+
+public:
+ pointer begin() { return impl.next; }
+ pointer end() { return & impl; }
+
+ bool empty() const { return impl.next == & impl; }
+
+ void push(pointer i)
+ {
+ end()->insert(i);
+ }
+};
+
+
+template <typename T, intrusive_stack_node T::* P>
+ struct intrusive_stack::iterator
+ {
+ typedef iterator self_type;
+ typedef intrusive_stack_node node_type;
+
+ iterator() : node_() {}
+ iterator(intrusive_stack::pointer __x) : node_(__x) {}
+
+ T & operator * () const { return * roofof(P, node_); }
+ T * operator -> () const { return roofof(P, node_); }
+
+ self_type & operator ++ ()
+ {
+ node_ = node_->next;
+ return * this;
+ }
+
+ bool operator == (const self_type & x) const { return node_ == x.node_; }
+ bool operator != (const self_type & x) const { return node_ != x.node_; }
+
+ node_type * node_;
+ };
+
+
+} // namespace sh
+
+} // namespace detail
+
+} // namespace boost
+
+
+#endif // #ifndef BOOST_INTRUSIVE_STACK_HPP_INCLUDED
Added: sandbox/block_ptr/boost/detail/roofof.hpp
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/boost/detail/roofof.hpp 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,100 @@
+/**
+ @file
+ Boost sh_utility.h header file.
+
+ @note
+ Copyright (c) 2008 Phil Bouchard <phil_at_[hidden]>.
+
+ 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
+
+ See http://www.boost.org/libs/smart_ptr/doc/index.html for documentation.
+*/
+
+
+#ifndef BOOST_DETAIL_ROOFOF_HPP_INCLUDED
+#define BOOST_DETAIL_ROOFOF_HPP_INCLUDED
+
+
+#include <boost/type_traits/remove_const.hpp>
+#include <boost/type_traits/remove_volatile.hpp>
+#include <boost/type_traits/is_polymorphic.hpp>
+#include <boost/type_traits/type_with_alignment.hpp>
+
+
+namespace boost
+{
+
+namespace detail
+{
+
+namespace sh
+{
+
+
+/**
+ Block address helper.
+
+ Returns the absolute address of a non-polymorphic object.
+
+ @note
+ Expects template value given by @sa is_polymorphic<>::value.
+*/
+
+template <bool>
+ struct rootof
+ {
+ template <typename U>
+ static void * get(U * a_p)
+ {
+ typedef typename remove_const<typename remove_volatile<U>::type>::type unqualified_type;
+
+ return static_cast<void *>(const_cast<unqualified_type *>(a_p));
+ }
+ };
+
+
+/**
+ Block address helper.
+
+ Returns the absolute address of a polymorphic object.
+*/
+
+template <>
+ struct rootof<true>
+ {
+ template <typename U>
+ static void * get(U * a_p)
+ {
+ typedef typename remove_const<typename remove_volatile<U>::type>::type unqualified_type;
+
+ return dynamic_cast<void *>(const_cast<unqualified_type *>(a_p));
+ }
+ };
+
+
+/**
+ Class member upshift.
+
+ Finds the address of a class given member credentials.
+*/
+
+template <typename T, typename U>
+ T * roofof(U T::* q, U * p)
+ {
+ typedef typename remove_const<typename remove_volatile<U>::type>::type unqualified_type;
+
+ return static_cast<T *>(static_cast<void *>(static_cast<char *>(static_cast<void *>(const_cast<unqualified_type *>(p))) - ptrdiff_t(static_cast<char *>(static_cast<void *>(const_cast<unqualified_type *>(& ((T *)(0)->* q)))) - (char *)(0))));
+ }
+
+
+} // namespace sh
+
+} // namespace detail
+
+} // namespace boost
+
+
+#endif // #ifndef BOOST_DETAIL_SH_UTILITY_H_INCLUDED
Added: sandbox/block_ptr/libs/smart_ptr/doc/BlockPointer.ppt
==============================================================================
Binary file. No diff available.
Added: sandbox/block_ptr/libs/smart_ptr/doc/Cyclicism1.png
==============================================================================
Binary file. No diff available.
Added: sandbox/block_ptr/libs/smart_ptr/doc/Cyclicism2.png
==============================================================================
Binary file. No diff available.
Added: sandbox/block_ptr/libs/smart_ptr/doc/Doxyfile
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/libs/smart_ptr/doc/Doxyfile 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,1514 @@
+# Doxyfile 1.6.1
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project
+#
+# All text after a hash (#) is considered a comment and will be ignored
+# The format is:
+# TAG = value [value, ...]
+# For lists items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (" ")
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all
+# text before the first occurrence of this tag. Doxygen uses libiconv (or the
+# iconv built into libc) for the transcoding. See
+# http://www.gnu.org/software/libiconv for the list of possible encodings.
+
+DOXYFILE_ENCODING = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded
+# by quotes) that should identify the project.
+
+PROJECT_NAME = Block Pointer
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number.
+# This could be handy for archiving the generated documentation or
+# if some version control system is used.
+
+PROJECT_NUMBER =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute)
+# base path where the generated documentation will be put.
+# If a relative path is entered, it will be relative to the location
+# where doxygen was started. If left blank the current directory will be used.
+
+OUTPUT_DIRECTORY =
+
+# If the CREATE_SUBDIRS tag is set to YES, then doxygen will create
+# 4096 sub-directories (in 2 levels) under the output directory of each output
+# format and will distribute the generated files over these directories.
+# Enabling this option can be useful when feeding doxygen a huge amount of
+# source files, where putting all generated files in the same directory would
+# otherwise cause performance problems for the file system.
+
+CREATE_SUBDIRS = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# The default language is English, other supported languages are:
+# Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional,
+# Croatian, Czech, Danish, Dutch, Esperanto, Farsi, Finnish, French, German,
+# Greek, Hungarian, Italian, Japanese, Japanese-en (Japanese with English
+# messages), Korean, Korean-en, Lithuanian, Norwegian, Macedonian, Persian,
+# Polish, Portuguese, Romanian, Russian, Serbian, Serbian-Cyrilic, Slovak,
+# Slovene, Spanish, Swedish, Ukrainian, and Vietnamese.
+
+OUTPUT_LANGUAGE = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will
+# include brief member descriptions after the members that are listed in
+# the file and class documentation (similar to JavaDoc).
+# Set to NO to disable this.
+
+BRIEF_MEMBER_DESC = YES
+
+# If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend
+# the brief description of a member or function before the detailed description.
+# Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+
+REPEAT_BRIEF = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator
+# that is used to form the text in various listings. Each string
+# in this list, if found as the leading text of the brief description, will be
+# stripped from the text and the result after processing the whole list, is
+# used as the annotated text. Otherwise, the brief description is used as-is.
+# If left blank, the following values are used ("$name" is automatically
+# replaced with the name of the entity): "The $name class" "The $name widget"
+# "The $name file" "is" "provides" "specifies" "contains"
+# "represents" "a" "an" "the"
+
+ABBREVIATE_BRIEF =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# Doxygen will generate a detailed section even if there is only a brief
+# description.
+
+ALWAYS_DETAILED_SEC = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+
+INLINE_INHERITED_MEMB = NO
+
+# If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full
+# path before files name in the file list and in the header files. If set
+# to NO the shortest path that makes the file name unique will be used.
+
+FULL_PATH_NAMES = YES
+
+# If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag
+# can be used to strip a user-defined part of the path. Stripping is
+# only done if one of the specified strings matches the left-hand part of
+# the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the
+# path to strip.
+
+STRIP_FROM_PATH =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of
+# the path mentioned in the documentation of a class, which tells
+# the reader which header file to include in order to use a class.
+# If left blank only the name of the header file containing the class
+# definition is used. Otherwise one should specify the include paths that
+# are normally passed to the compiler using the -I flag.
+
+STRIP_FROM_INC_PATH =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter
+# (but less readable) file names. This can be useful is your file systems
+# doesn't support long names like on DOS, Mac, or CD-ROM.
+
+SHORT_NAMES = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen
+# will interpret the first line (until the first dot) of a JavaDoc-style
+# comment as the brief description. If set to NO, the JavaDoc
+# comments will behave just like regular Qt-style comments
+# (thus requiring an explicit @brief command for a brief description.)
+
+JAVADOC_AUTOBRIEF = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then Doxygen will
+# interpret the first line (until the first dot) of a Qt-style
+# comment as the brief description. If set to NO, the comments
+# will behave just like regular Qt-style comments (thus requiring
+# an explicit \brief command for a brief description.)
+
+QT_AUTOBRIEF = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen
+# treat a multi-line C++ special comment block (i.e. a block of //! or ///
+# comments) as a brief description. This used to be the default behaviour.
+# The new default is to treat a multi-line C++ comment block as a detailed
+# description. Set this tag to YES if you prefer the old behaviour instead.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES (the default) then an undocumented
+# member inherits the documentation from any documented member that it
+# re-implements.
+
+INHERIT_DOCS = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce
+# a new page for each member. If set to NO, the documentation of a member will
+# be part of the file/class/namespace that contains it.
+
+SEPARATE_MEMBER_PAGES = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab.
+# Doxygen uses this value to replace tabs by spaces in code fragments.
+
+TAB_SIZE = 8
+
+# This tag can be used to specify a number of aliases that acts
+# as commands in the documentation. An alias has the form "name=value".
+# For example adding "sideeffect=\par Side Effects:\n" will allow you to
+# put the command \sideeffect (or @sideeffect) in the documentation, which
+# will result in a user-defined paragraph with heading "Side Effects:".
+# You can put \n's in the value part of an alias to insert newlines.
+
+ALIASES =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C
+# sources only. Doxygen will then generate output that is more tailored for C.
+# For instance, some of the names that are used will be different. The list
+# of all members will be omitted, etc.
+
+OPTIMIZE_OUTPUT_FOR_C = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java
+# sources only. Doxygen will then generate output that is more tailored for
+# Java. For instance, namespaces will be presented as packages, qualified
+# scopes will look different, etc.
+
+OPTIMIZE_OUTPUT_JAVA = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources only. Doxygen will then generate output that is more tailored for
+# Fortran.
+
+OPTIMIZE_FOR_FORTRAN = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for
+# VHDL.
+
+OPTIMIZE_OUTPUT_VHDL = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it parses.
+# With this tag you can assign which parser to use for a given extension.
+# Doxygen has a built-in mapping, but you can override or extend it using this tag.
+# The format is ext=language, where ext is a file extension, and language is one of
+# the parsers supported by doxygen: IDL, Java, Javascript, C#, C, C++, D, PHP,
+# Objective-C, Python, Fortran, VHDL, C, C++. For instance to make doxygen treat
+# .inc files as Fortran files (default is PHP), and .f files as C (default is Fortran),
+# use: inc=Fortran f=C. Note that for custom extensions you also need to set FILE_PATTERNS otherwise the files are not read by doxygen.
+
+EXTENSION_MAPPING =
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should
+# set this tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string); v.s.
+# func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+
+BUILTIN_STL_SUPPORT = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+
+CPP_CLI_SUPPORT = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip sources only.
+# Doxygen will parse them like normal C++ but will assume all classes use public
+# instead of private inheritance when no explicit protection keyword is present.
+
+SIP_SUPPORT = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate getter
+# and setter methods for a property. Setting this option to YES (the default)
+# will make doxygen to replace the get and set methods by a property in the
+# documentation. This will only work if the methods are indeed getting or
+# setting a simple type. If this is not the case, or you want to show the
+# methods anyway, you should set this option to NO.
+
+IDL_PROPERTY_SUPPORT = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES, then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+
+DISTRIBUTE_GROUP_DOC = NO
+
+# Set the SUBGROUPING tag to YES (the default) to allow class member groups of
+# the same type (for instance a group of public functions) to be put as a
+# subgroup of that type (e.g. under the Public Functions section). Set it to
+# NO to prevent subgrouping. Alternatively, this can be done per class using
+# the \nosubgrouping command.
+
+SUBGROUPING = YES
+
+# When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct, union, or enum
+# is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically
+# be useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+
+TYPEDEF_HIDES_STRUCT = NO
+
+# The SYMBOL_CACHE_SIZE determines the size of the internal cache use to
+# determine which symbols to keep in memory and which to flush to disk.
+# When the cache is full, less often used symbols will be written to disk.
+# For small to medium size projects (<1000 input files) the default value is
+# probably good enough. For larger projects a too small cache size can cause
+# doxygen to be busy swapping symbols to and from disk most of the time
+# causing a significant performance penality.
+# If the system has enough physical memory increasing the cache will improve the
+# performance by keeping more symbols in memory. Note that the value works on
+# a logarithmic scale so increasing the size by one will rougly double the
+# memory usage. The cache size is given by this formula:
+# 2^(16+SYMBOL_CACHE_SIZE). The valid range is 0..9, the default is 0,
+# corresponding to a cache size of 2^16 = 65536 symbols
+
+SYMBOL_CACHE_SIZE = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in
+# documentation are documented, even if no documentation was available.
+# Private class members and static file members will be hidden unless
+# the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES
+
+EXTRACT_ALL = NO
+
+# If the EXTRACT_PRIVATE tag is set to YES all private members of a class
+# will be included in the documentation.
+
+EXTRACT_PRIVATE = YES
+
+# If the EXTRACT_STATIC tag is set to YES all static members of a file
+# will be included in the documentation.
+
+EXTRACT_STATIC = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs)
+# defined locally in source files will be included in the documentation.
+# If set to NO only classes defined in header files are included.
+
+EXTRACT_LOCAL_CLASSES = YES
+
+# This flag is only useful for Objective-C code. When set to YES local
+# methods, which are defined in the implementation section but not in
+# the interface are included in the documentation.
+# If set to NO (the default) only methods in the interface are included.
+
+EXTRACT_LOCAL_METHODS = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base
+# name of the file that contains the anonymous namespace. By default
+# anonymous namespace are hidden.
+
+EXTRACT_ANON_NSPACES = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all
+# undocumented members of documented classes, files or namespaces.
+# If set to NO (the default) these members will be included in the
+# various overviews, but no documentation section is generated.
+# This option has no effect if EXTRACT_ALL is enabled.
+
+HIDE_UNDOC_MEMBERS = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy.
+# If set to NO (the default) these classes will be included in the various
+# overviews. This option has no effect if EXTRACT_ALL is enabled.
+
+HIDE_UNDOC_CLASSES = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all
+# friend (class|struct|union) declarations.
+# If set to NO (the default) these declarations will be included in the
+# documentation.
+
+HIDE_FRIEND_COMPOUNDS = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any
+# documentation blocks found inside the body of a function.
+# If set to NO (the default) these blocks will be appended to the
+# function's detailed documentation block.
+
+HIDE_IN_BODY_DOCS = NO
+
+# The INTERNAL_DOCS tag determines if documentation
+# that is typed after a \internal command is included. If the tag is set
+# to NO (the default) then the documentation will be excluded.
+# Set it to YES to include the internal documentation.
+
+INTERNAL_DOCS = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate
+# file names in lower-case letters. If set to YES upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+
+CASE_SENSE_NAMES = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen
+# will show members with their full class and namespace scopes in the
+# documentation. If set to YES the scope will be hidden.
+
+HIDE_SCOPE_NAMES = NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen
+# will put a list of the files that are included by a file in the documentation
+# of that file.
+
+SHOW_INCLUDE_FILES = YES
+
+# If the INLINE_INFO tag is set to YES (the default) then a tag [inline]
+# is inserted in the documentation for inline members.
+
+INLINE_INFO = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen
+# will sort the (detailed) documentation of file and class members
+# alphabetically by member name. If set to NO the members will appear in
+# declaration order.
+
+SORT_MEMBER_DOCS = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the
+# brief documentation of file, namespace and class members alphabetically
+# by member name. If set to NO (the default) the members will appear in
+# declaration order.
+
+SORT_BRIEF_DOCS = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the (brief and detailed) documentation of class members so that constructors and destructors are listed first. If set to NO (the default) the constructors will appear in the respective orders defined by SORT_MEMBER_DOCS and SORT_BRIEF_DOCS. This tag will be ignored for brief docs if SORT_BRIEF_DOCS is set to NO and ignored for detailed docs if SORT_MEMBER_DOCS is set to NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the
+# hierarchy of group names into alphabetical order. If set to NO (the default)
+# the group names will appear in their defined order.
+
+SORT_GROUP_NAMES = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be
+# sorted by fully-qualified names, including namespaces. If set to
+# NO (the default), the class list will be sorted only by class name,
+# not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the
+# alphabetical list.
+
+SORT_BY_SCOPE_NAME = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or
+# disable (NO) the todo list. This list is created by putting \todo
+# commands in the documentation.
+
+GENERATE_TODOLIST = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or
+# disable (NO) the test list. This list is created by putting \test
+# commands in the documentation.
+
+GENERATE_TESTLIST = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or
+# disable (NO) the bug list. This list is created by putting \bug
+# commands in the documentation.
+
+GENERATE_BUGLIST = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or
+# disable (NO) the deprecated list. This list is created by putting
+# \deprecated commands in the documentation.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional
+# documentation sections, marked by \if sectionname ... \endif.
+
+ENABLED_SECTIONS =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines
+# the initial value of a variable or define consists of for it to appear in
+# the documentation. If the initializer consists of more lines than specified
+# here it will be hidden. Use a value of 0 to hide initializers completely.
+# The appearance of the initializer of individual variables and defines in the
+# documentation can be controlled using \showinitializer or \hideinitializer
+# command in the documentation regardless of this setting.
+
+MAX_INITIALIZER_LINES = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated
+# at the bottom of the documentation of classes and structs. If set to YES the
+# list will mention the files that were used to generate the documentation.
+
+SHOW_USED_FILES = YES
+
+# If the sources in your project are distributed over multiple directories
+# then setting the SHOW_DIRECTORIES tag to YES will show the directory hierarchy
+# in the documentation. The default is NO.
+
+SHOW_DIRECTORIES = NO
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page.
+# This will remove the Files entry from the Quick Index and from the
+# Folder Tree View (if specified). The default is YES.
+
+SHOW_FILES = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the
+# Namespaces page.
+# This will remove the Namespaces entry from the Quick Index
+# and from the Folder Tree View (if specified). The default is YES.
+
+SHOW_NAMESPACES = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command <command> <input-file>, where <command> is the value of
+# the FILE_VERSION_FILTER tag, and <input-file> is the name of an input file
+# provided by doxygen. Whatever the program writes to standard output
+# is used as the file version. See the manual for examples.
+
+FILE_VERSION_FILTER =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed by
+# doxygen. The layout file controls the global structure of the generated output files
+# in an output format independent way. The create the layout file that represents
+# doxygen's defaults, run doxygen with the -l option. You can optionally specify a
+# file name after the option, if omitted DoxygenLayout.xml will be used as the name
+# of the layout file.
+
+LAYOUT_FILE =
+
+#---------------------------------------------------------------------------
+# configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated
+# by doxygen. Possible values are YES and NO. If left blank NO is used.
+
+QUIET = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated by doxygen. Possible values are YES and NO. If left blank
+# NO is used.
+
+WARNINGS = YES
+
+# If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings
+# for undocumented members. If EXTRACT_ALL is set to YES then this flag will
+# automatically be disabled.
+
+WARN_IF_UNDOCUMENTED = YES
+
+# If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some
+# parameters in a documented function, or documenting parameters that
+# don't exist or using markup commands wrongly.
+
+WARN_IF_DOC_ERROR = YES
+
+# This WARN_NO_PARAMDOC option can be abled to get warnings for
+# functions that are documented, but have no documentation for their parameters
+# or return value. If set to NO (the default) doxygen will only warn about
+# wrong or incomplete parameter documentation, but not about the absence of
+# documentation.
+
+WARN_NO_PARAMDOC = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that
+# doxygen can produce. The string should contain the $file, $line, and $text
+# tags, which will be replaced by the file and line number from which the
+# warning originated and the warning text. Optionally the format may contain
+# $version, which will be replaced by the version of the file (if it could
+# be obtained via FILE_VERSION_FILTER)
+
+WARN_FORMAT = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning
+# and error messages should be written. If left blank the output is written
+# to stderr.
+
+WARN_LOGFILE =
+
+#---------------------------------------------------------------------------
+# configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag can be used to specify the files and/or directories that contain
+# documented source files. You may enter file names like "myfile.cpp" or
+# directories like "/usr/src/myproject". Separate the files or directories
+# with spaces.
+
+INPUT = ../../../boost/
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is
+# also the default input encoding. Doxygen uses libiconv (or the iconv built
+# into libc) for the transcoding. See http://www.gnu.org/software/libiconv for
+# the list of possible encodings.
+
+INPUT_ENCODING = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp
+# and *.h) to filter out the source-files in the directories. If left
+# blank the following patterns are tested:
+# *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx
+# *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.py *.f90
+
+FILE_PATTERNS =
+
+# The RECURSIVE tag can be used to turn specify whether or not subdirectories
+# should be searched for input files as well. Possible values are YES and NO.
+# If left blank NO is used.
+
+RECURSIVE = YES
+
+# The EXCLUDE tag can be used to specify files and/or directories that should
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+
+EXCLUDE =
+
+# The EXCLUDE_SYMLINKS tag can be used select whether or not files or
+# directories that are symbolic links (a Unix filesystem feature) are excluded
+# from the input.
+
+EXCLUDE_SYMLINKS = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories. Note that the wildcards are matched
+# against the file with absolute path, so to exclude all test directories
+# for example use the pattern */test/*
+
+EXCLUDE_PATTERNS =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+
+EXCLUDE_SYMBOLS =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or
+# directories that contain example code fragments that are included (see
+# the \include command).
+
+EXAMPLE_PATH =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp
+# and *.h) to filter out the source-files in the directories. If left
+# blank all files are included.
+
+EXAMPLE_PATTERNS =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude
+# commands irrespective of the value of the RECURSIVE tag.
+# Possible values are YES and NO. If left blank NO is used.
+
+EXAMPLE_RECURSIVE = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or
+# directories that contain image that are included in the documentation (see
+# the \image command).
+
+IMAGE_PATH =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command <filter> <input-file>, where <filter>
+# is the value of the INPUT_FILTER tag, and <input-file> is the name of an
+# input file. Doxygen will then use the output that the filter program writes
+# to standard output.
+# If FILTER_PATTERNS is specified, this tag will be
+# ignored.
+
+INPUT_FILTER =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis.
+# Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match.
+# The filters are a list of the form:
+# pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further
+# info on how filters are used. If FILTER_PATTERNS is empty, INPUT_FILTER
+# is applied to all files.
+
+FILTER_PATTERNS =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will be used to filter the input files when producing source
+# files to browse (i.e. when SOURCE_BROWSER is set to YES).
+
+FILTER_SOURCE_FILES = NO
+
+#---------------------------------------------------------------------------
+# configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will
+# be generated. Documented entities will be cross-referenced with these sources.
+# Note: To get rid of all source code in the generated output, make sure also
+# VERBATIM_HEADERS is set to NO.
+
+SOURCE_BROWSER = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body
+# of functions and classes directly in the documentation.
+
+INLINE_SOURCES = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct
+# doxygen to hide any special comment blocks from generated source code
+# fragments. Normal C and C++ comments will always remain visible.
+
+STRIP_CODE_COMMENTS = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES
+# then for each documented function all documented
+# functions referencing it will be listed.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES
+# then for each documented function all documented entities
+# called/used by that function will be listed.
+
+REFERENCES_RELATION = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES (the default)
+# and SOURCE_BROWSER tag is set to YES, then the hyperlinks from
+# functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will
+# link to the source code.
+# Otherwise they will link to the documentation.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code
+# will point to the HTML generated by the htags(1) tool instead of doxygen
+# built-in source browser. The htags tool is part of GNU's global source
+# tagging system (see http://www.gnu.org/software/global/global.html). You
+# will need version 4.8.6 or higher.
+
+USE_HTAGS = NO
+
+# If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen
+# will generate a verbatim copy of the header file for each class for
+# which an include is specified. Set to NO to disable this.
+
+VERBATIM_HEADERS = YES
+
+#---------------------------------------------------------------------------
+# configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index
+# of all compounds will be generated. Enable this if the project
+# contains a lot of classes, structs, unions or interfaces.
+
+ALPHABETICAL_INDEX = NO
+
+# If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then
+# the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns
+# in which this list will be split (can be a number in the range [1..20])
+
+COLS_IN_ALPHA_INDEX = 5
+
+# In case all classes in a project start with a common prefix, all
+# classes will be put under the same header in the alphabetical index.
+# The IGNORE_PREFIX tag can be used to specify one or more prefixes that
+# should be ignored while generating the index headers.
+
+IGNORE_PREFIX =
+
+#---------------------------------------------------------------------------
+# configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES (the default) Doxygen will
+# generate HTML output.
+
+GENERATE_HTML = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be
+# put in front of it. If left blank `html' will be used as the default path.
+
+HTML_OUTPUT = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for
+# each generated HTML page (for example: .htm,.php,.asp). If it is left blank
+# doxygen will generate files with .html extension.
+
+HTML_FILE_EXTENSION = .html
+
+# The HTML_HEADER tag can be used to specify a personal HTML header for
+# each generated HTML page. If it is left blank doxygen will generate a
+# standard header.
+
+HTML_HEADER =
+
+# The HTML_FOOTER tag can be used to specify a personal HTML footer for
+# each generated HTML page. If it is left blank doxygen will generate a
+# standard footer.
+
+HTML_FOOTER =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading
+# style sheet that is used by each HTML page. It can be used to
+# fine-tune the look of the HTML output. If the tag is left blank doxygen
+# will generate a default style sheet. Note that doxygen will try to copy
+# the style sheet file to the HTML output directory, so don't put your own
+# stylesheet in the HTML output directory as well, or it will be erased!
+
+HTML_STYLESHEET =
+
+# If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes,
+# files or namespaces will be aligned in HTML using tables. If set to
+# NO a bullet list will be used.
+
+HTML_ALIGN_MEMBERS = YES
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded. For this to work a browser that supports
+# JavaScript and DHTML is required (for instance Mozilla 1.0+, Firefox
+# Netscape 6.0+, Internet explorer 5.0+, Konqueror, or Safari).
+
+HTML_DYNAMIC_SECTIONS = NO
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files
+# will be generated that can be used as input for Apple's Xcode 3
+# integrated development environment, introduced with OSX 10.5 (Leopard).
+# To create a documentation set, doxygen will generate a Makefile in the
+# HTML output directory. Running make will produce the docset in that
+# directory and running "make install" will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find
+# it at startup.
+# See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html for more information.
+
+GENERATE_DOCSET = NO
+
+# When GENERATE_DOCSET tag is set to YES, this tag determines the name of the
+# feed. A documentation feed provides an umbrella under which multiple
+# documentation sets from a single provider (such as a company or product suite)
+# can be grouped.
+
+DOCSET_FEEDNAME = "Doxygen generated docs"
+
+# When GENERATE_DOCSET tag is set to YES, this tag specifies a string that
+# should uniquely identify the documentation set bundle. This should be a
+# reverse domain-name style string, e.g. com.mycompany.MyDocSet. Doxygen
+# will append .docset to the name.
+
+DOCSET_BUNDLE_ID = org.doxygen.Project
+
+# If the GENERATE_HTMLHELP tag is set to YES, additional index files
+# will be generated that can be used as input for tools like the
+# Microsoft HTML help workshop to generate a compiled HTML help file (.chm)
+# of the generated HTML documentation.
+
+GENERATE_HTMLHELP = NO
+
+# If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can
+# be used to specify the file name of the resulting .chm file. You
+# can add a path in front of the file if the result should not be
+# written to the html output directory.
+
+CHM_FILE =
+
+# If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can
+# be used to specify the location (absolute path including file name) of
+# the HTML help compiler (hhc.exe). If non-empty doxygen will try to run
+# the HTML help compiler on the generated index.hhp.
+
+HHC_LOCATION =
+
+# If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag
+# controls if a separate .chi index file is generated (YES) or that
+# it should be included in the master .chm file (NO).
+
+GENERATE_CHI = NO
+
+# If the GENERATE_HTMLHELP tag is set to YES, the CHM_INDEX_ENCODING
+# is used to encode HtmlHelp index (hhk), content (hhc) and project file
+# content.
+
+CHM_INDEX_ENCODING =
+
+# If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag
+# controls whether a binary table of contents is generated (YES) or a
+# normal table of contents (NO) in the .chm file.
+
+BINARY_TOC = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members
+# to the contents of the HTML help documentation and to the tree view.
+
+TOC_EXPAND = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and QHP_VIRTUAL_FOLDER
+# are set, an additional index file will be generated that can be used as input for
+# Qt's qhelpgenerator to generate a Qt Compressed Help (.qch) of the generated
+# HTML documentation.
+
+GENERATE_QHP = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can
+# be used to specify the file name of the resulting .qch file.
+# The path specified is relative to the HTML output folder.
+
+QCH_FILE =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating
+# Qt Help Project output. For more information please see
+# http://doc.trolltech.com/qthelpproject.html#namespace
+
+QHP_NAMESPACE =
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating
+# Qt Help Project output. For more information please see
+# http://doc.trolltech.com/qthelpproject.html#virtual-folders
+
+QHP_VIRTUAL_FOLDER = doc
+
+# If QHP_CUST_FILTER_NAME is set, it specifies the name of a custom filter to add.
+# For more information please see
+# http://doc.trolltech.com/qthelpproject.html#custom-filters
+
+QHP_CUST_FILTER_NAME =
+
+# The QHP_CUST_FILT_ATTRS tag specifies the list of the attributes of the custom filter to add.For more information please see
+# Qt Help Project / Custom Filters.
+
+QHP_CUST_FILTER_ATTRS =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this project's
+# filter section matches.
+# Qt Help Project / Filter Attributes.
+
+QHP_SECT_FILTER_ATTRS =
+
+# If the GENERATE_QHP tag is set to YES, the QHG_LOCATION tag can
+# be used to specify the location of Qt's qhelpgenerator.
+# If non-empty doxygen will try to run qhelpgenerator on the generated
+# .qhp file.
+
+QHG_LOCATION =
+
+# The DISABLE_INDEX tag can be used to turn on/off the condensed index at
+# top of each HTML page. The value NO (the default) enables the index and
+# the value YES disables it.
+
+DISABLE_INDEX = NO
+
+# This tag can be used to set the number of enum values (range [1..20])
+# that doxygen will group on one line in the generated HTML documentation.
+
+ENUM_VALUES_PER_LINE = 4
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information.
+# If the tag value is set to YES, a side panel will be generated
+# containing a tree-like index structure (just like the one that
+# is generated for HTML Help). For this to work a browser that supports
+# JavaScript, DHTML, CSS and frames is required (i.e. any modern browser).
+# Windows users are probably better off using the HTML help feature.
+
+GENERATE_TREEVIEW = NO
+
+# By enabling USE_INLINE_TREES, doxygen will generate the Groups, Directories,
+# and Class Hierarchy pages using a tree view instead of an ordered list.
+
+USE_INLINE_TREES = NO
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be
+# used to set the initial width (in pixels) of the frame in which the tree
+# is shown.
+
+TREEVIEW_WIDTH = 250
+
+# Use this tag to change the font size of Latex formulas included
+# as images in the HTML documentation. The default is 10. Note that
+# when you change the font size after a successful doxygen run you need
+# to manually remove any form_*.png images from the HTML output directory
+# to force them to be regenerated.
+
+FORMULA_FONTSIZE = 10
+
+# When the SEARCHENGINE tag is enable doxygen will generate a search box for the HTML output. The underlying search engine uses javascript
+# and DHTML and should work on any modern browser. Note that when using HTML help (GENERATE_HTMLHELP) or Qt help (GENERATE_QHP)
+# there is already a search function so this one should typically
+# be disabled.
+
+SEARCHENGINE = YES
+
+#---------------------------------------------------------------------------
+# configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES (the default) Doxygen will
+# generate Latex output.
+
+GENERATE_LATEX = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be
+# put in front of it. If left blank `latex' will be used as the default path.
+
+LATEX_OUTPUT = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked. If left blank `latex' will be used as the default command name.
+
+LATEX_CMD_NAME = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to
+# generate index for LaTeX. If left blank `makeindex' will be used as the
+# default command name.
+
+MAKEINDEX_CMD_NAME = makeindex
+
+# If the COMPACT_LATEX tag is set to YES Doxygen generates more compact
+# LaTeX documents. This may be useful for small projects and may help to
+# save some trees in general.
+
+COMPACT_LATEX = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used
+# by the printer. Possible values are: a4, a4wide, letter, legal and
+# executive. If left blank a4wide will be used.
+
+PAPER_TYPE = a4wide
+
+# The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX
+# packages that should be included in the LaTeX output.
+
+EXTRA_PACKAGES =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for
+# the generated latex document. The header should contain everything until
+# the first chapter. If it is left blank doxygen will generate a
+# standard header. Notice: only use this tag if you know what you are doing!
+
+LATEX_HEADER =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated
+# is prepared for conversion to pdf (using ps2pdf). The pdf file will
+# contain links (just like the HTML output) instead of page references
+# This makes the output suitable for online browsing using a pdf viewer.
+
+PDF_HYPERLINKS = YES
+
+# If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of
+# plain latex in the generated Makefile. Set this option to YES to get a
+# higher quality PDF documentation.
+
+USE_PDFLATEX = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode.
+# command to the generated LaTeX files. This will instruct LaTeX to keep
+# running if errors occur, instead of asking the user for help.
+# This option is also used when generating formulas in HTML.
+
+LATEX_BATCHMODE = NO
+
+# If LATEX_HIDE_INDICES is set to YES then doxygen will not
+# include the index chapters (such as File Index, Compound Index, etc.)
+# in the output.
+
+LATEX_HIDE_INDICES = NO
+
+# If LATEX_SOURCE_CODE is set to YES then doxygen will include source code with syntax highlighting in the LaTeX output. Note that which sources are shown also depends on other settings such as SOURCE_BROWSER.
+
+LATEX_SOURCE_CODE = NO
+
+#---------------------------------------------------------------------------
+# configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output
+# The RTF output is optimized for Word 97 and may not look very pretty with
+# other RTF readers or editors.
+
+GENERATE_RTF = NO
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be
+# put in front of it. If left blank `rtf' will be used as the default path.
+
+RTF_OUTPUT = rtf
+
+# If the COMPACT_RTF tag is set to YES Doxygen generates more compact
+# RTF documents. This may be useful for small projects and may help to
+# save some trees in general.
+
+COMPACT_RTF = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated
+# will contain hyperlink fields. The RTF file will
+# contain links (just like the HTML output) instead of page references.
+# This makes the output suitable for online browsing using WORD or other
+# programs which support those fields.
+# Note: wordpad (write) and others do not support links.
+
+RTF_HYPERLINKS = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's
+# config file, i.e. a series of assignments. You only have to provide
+# replacements, missing definitions are set to their default value.
+
+RTF_STYLESHEET_FILE =
+
+# Set optional variables used in the generation of an rtf document.
+# Syntax is similar to doxygen's config file.
+
+RTF_EXTENSIONS_FILE =
+
+#---------------------------------------------------------------------------
+# configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES (the default) Doxygen will
+# generate man pages
+
+GENERATE_MAN = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be
+# put in front of it. If left blank `man' will be used as the default path.
+
+MAN_OUTPUT = man
+
+# The MAN_EXTENSION tag determines the extension that is added to
+# the generated man pages (default is the subroutine's section .3)
+
+MAN_EXTENSION = .3
+
+# If the MAN_LINKS tag is set to YES and Doxygen generates man output,
+# then it will generate one additional man file for each entity
+# documented in the real man page(s). These additional files
+# only source the real man page, but without them the man command
+# would be unable to find the correct page. The default is NO.
+
+MAN_LINKS = NO
+
+#---------------------------------------------------------------------------
+# configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES Doxygen will
+# generate an XML file that captures the structure of
+# the code including all documentation.
+
+GENERATE_XML = NO
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be
+# put in front of it. If left blank `xml' will be used as the default path.
+
+XML_OUTPUT = xml
+
+# The XML_SCHEMA tag can be used to specify an XML schema,
+# which can be used by a validating XML parser to check the
+# syntax of the XML files.
+
+XML_SCHEMA =
+
+# The XML_DTD tag can be used to specify an XML DTD,
+# which can be used by a validating XML parser to check the
+# syntax of the XML files.
+
+XML_DTD =
+
+# If the XML_PROGRAMLISTING tag is set to YES Doxygen will
+# dump the program listings (including syntax highlighting
+# and cross-referencing information) to the XML output. Note that
+# enabling this will significantly increase the size of the XML output.
+
+XML_PROGRAMLISTING = YES
+
+#---------------------------------------------------------------------------
+# configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will
+# generate an AutoGen Definitions (see autogen.sf.net) file
+# that captures the structure of the code including all
+# documentation. Note that this feature is still experimental
+# and incomplete at the moment.
+
+GENERATE_AUTOGEN_DEF = NO
+
+#---------------------------------------------------------------------------
+# configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES Doxygen will
+# generate a Perl module file that captures the structure of
+# the code including all documentation. Note that this
+# feature is still experimental and incomplete at the
+# moment.
+
+GENERATE_PERLMOD = NO
+
+# If the PERLMOD_LATEX tag is set to YES Doxygen will generate
+# the necessary Makefile rules, Perl scripts and LaTeX code to be able
+# to generate PDF and DVI output from the Perl module output.
+
+PERLMOD_LATEX = NO
+
+# If the PERLMOD_PRETTY tag is set to YES the Perl module output will be
+# nicely formatted so it can be parsed by a human reader.
+# This is useful
+# if you want to understand what is going on.
+# On the other hand, if this
+# tag is set to NO the size of the Perl module output will be much smaller
+# and Perl will parse it just the same.
+
+PERLMOD_PRETTY = YES
+
+# The names of the make variables in the generated doxyrules.make file
+# are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX.
+# This is useful so different doxyrules.make files included by the same
+# Makefile don't overwrite each other's variables.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will
+# evaluate all C-preprocessor directives found in the sources and include
+# files.
+
+ENABLE_PREPROCESSING = YES
+
+# If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro
+# names in the source code. If set to NO (the default) only conditional
+# compilation will be performed. Macro expansion can be done in a controlled
+# way by setting EXPAND_ONLY_PREDEF to YES.
+
+MACRO_EXPANSION = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES
+# then the macro expansion is limited to the macros specified with the
+# PREDEFINED and EXPAND_AS_DEFINED tags.
+
+EXPAND_ONLY_PREDEF = NO
+
+# If the SEARCH_INCLUDES tag is set to YES (the default) the includes files
+# in the INCLUDE_PATH (see below) will be search if a #include is found.
+
+SEARCH_INCLUDES = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by
+# the preprocessor.
+
+INCLUDE_PATH =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will
+# be used.
+
+INCLUDE_FILE_PATTERNS =
+
+# The PREDEFINED tag can be used to specify one or more macro names that
+# are defined before the preprocessor is started (similar to the -D option of
+# gcc). The argument of the tag is a list of macros of the form: name
+# or name=definition (no spaces). If the definition and the = are
+# omitted =1 is assumed. To prevent a macro definition from being
+# undefined via #undef or recursively expanded use the := operator
+# instead of the = operator.
+
+PREDEFINED =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then
+# this tag can be used to specify a list of macro names that should be expanded.
+# The macro definition that is found in the sources will be used.
+# Use the PREDEFINED tag if you want to use a different macro definition.
+
+EXPAND_AS_DEFINED =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then
+# doxygen's preprocessor will remove all function-like macros that are alone
+# on a line, have an all uppercase name, and do not end with a semicolon. Such
+# function macros are typically used for boiler-plate code, and will confuse
+# the parser if not removed.
+
+SKIP_FUNCTION_MACROS = YES
+
+#---------------------------------------------------------------------------
+# Configuration::additions related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES option can be used to specify one or more tagfiles.
+# Optionally an initial location of the external documentation
+# can be added for each tagfile. The format of a tag file without
+# this location is as follows:
+#
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+#
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where "loc1" and "loc2" can be relative or absolute paths or
+# URLs. If a location is present for each tag, the installdox tool
+# does not have to be run to correct the links.
+# Note that each tag file must have a unique name
+# (where the name does NOT include the path)
+# If a tag file is not located in the directory in which doxygen
+# is run, you must also specify the path to the tagfile here.
+
+TAGFILES =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create
+# a tag file that is based on the input files it reads.
+
+GENERATE_TAGFILE =
+
+# If the ALLEXTERNALS tag is set to YES all external classes will be listed
+# in the class index. If set to NO only the inherited external classes
+# will be listed.
+
+ALLEXTERNALS = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will
+# be listed.
+
+EXTERNAL_GROUPS = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of `which perl').
+
+PERL_PATH = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will
+# generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base
+# or super classes. Setting the tag to NO turns the diagrams off. Note that
+# this option is superseded by the HAVE_DOT option below. This is only a
+# fallback. It is recommended to install and use dot, since it yields more
+# powerful graphs.
+
+CLASS_DIAGRAMS = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see
+# http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH =
+
+# If set to YES, the inheritance and collaboration graphs will hide
+# inheritance and usage relations if the target is undocumented
+# or is not a class.
+
+HIDE_UNDOC_RELATIONS = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz, a graph visualization
+# toolkit from AT&T and Lucent Bell Labs. The other options in this section
+# have no effect if this option is set to NO (the default)
+
+HAVE_DOT = YES
+
+# By default doxygen will write a font called FreeSans.ttf to the output
+# directory and reference it in all dot files that doxygen generates. This
+# font does not include all possible unicode characters however, so when you need
+# these (or just want a differently looking font) you can specify the font name
+# using DOT_FONTNAME. You need need to make sure dot is able to find the font,
+# which can be done by putting it in a standard location or by setting the
+# DOTFONTPATH environment variable or by setting DOT_FONTPATH to the directory
+# containing the font.
+
+DOT_FONTNAME = FreeSans
+
+# The DOT_FONTSIZE tag can be used to set the size of the font of dot graphs.
+# The default size is 10pt.
+
+DOT_FONTSIZE = 10
+
+# By default doxygen will tell dot to use the output directory to look for the
+# FreeSans.ttf font (which doxygen will put there itself). If you specify a
+# different font using DOT_FONTNAME you can set the path where dot
+# can find it using this tag.
+
+DOT_FONTPATH =
+
+# If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen
+# will generate a graph for each documented class showing the direct and
+# indirect inheritance relations. Setting this tag to YES will force the
+# the CLASS_DIAGRAMS tag to NO.
+
+CLASS_GRAPH = YES
+
+# If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen
+# will generate a graph for each documented class showing the direct and
+# indirect implementation dependencies (inheritance, containment, and
+# class references variables) of the class with other documented classes.
+
+COLLABORATION_GRAPH = YES
+
+# If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen
+# will generate a graph for groups, showing the direct groups dependencies
+
+GROUP_GRAPHS = YES
+
+# If the UML_LOOK tag is set to YES doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+
+UML_LOOK = NO
+
+# If set to YES, the inheritance and collaboration graphs will show the
+# relations between templates and their instances.
+
+TEMPLATE_RELATIONS = NO
+
+# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT
+# tags are set to YES then doxygen will generate a graph for each documented
+# file showing the direct and indirect include dependencies of the file with
+# other documented files.
+
+INCLUDE_GRAPH = YES
+
+# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and
+# HAVE_DOT tags are set to YES then doxygen will generate a graph for each
+# documented header file showing the documented files that directly or
+# indirectly include this file.
+
+INCLUDED_BY_GRAPH = YES
+
+# If the CALL_GRAPH and HAVE_DOT options are set to YES then
+# doxygen will generate a call dependency graph for every global function
+# or class method. Note that enabling this option will significantly increase
+# the time of a run. So in most cases it will be better to enable call graphs
+# for selected functions only using the \callgraph command.
+
+CALL_GRAPH = NO
+
+# If the CALLER_GRAPH and HAVE_DOT tags are set to YES then
+# doxygen will generate a caller dependency graph for every global function
+# or class method. Note that enabling this option will significantly increase
+# the time of a run. So in most cases it will be better to enable caller
+# graphs for selected functions only using the \callergraph command.
+
+CALLER_GRAPH = NO
+
+# If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen
+# will graphical hierarchy of all classes instead of a textual one.
+
+GRAPHICAL_HIERARCHY = YES
+
+# If the DIRECTORY_GRAPH, SHOW_DIRECTORIES and HAVE_DOT tags are set to YES
+# then doxygen will show the dependencies a directory has on other directories
+# in a graphical way. The dependency relations are determined by the #include
+# relations between the files in the directories.
+
+DIRECTORY_GRAPH = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. Possible values are png, jpg, or gif
+# If left blank png will be used.
+
+DOT_IMAGE_FORMAT = png
+
+# The tag DOT_PATH can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+
+DOT_PATH =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the
+# \dotfile command).
+
+DOTFILE_DIRS =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of
+# nodes that will be shown in the graph. If the number of nodes in a graph
+# becomes larger than this value, doxygen will truncate the graph, which is
+# visualized by representing a node as a red box. Note that doxygen if the
+# number of direct children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note
+# that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+
+DOT_GRAPH_MAX_NODES = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the
+# graphs generated by dot. A depth value of 3 means that only nodes reachable
+# from the root by following a path via at most 3 edges will be shown. Nodes
+# that lay further from the root node will be omitted. Note that setting this
+# option to 1 or 2 may greatly reduce the computation time needed for large
+# code bases. Also note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+
+MAX_DOT_GRAPH_DEPTH = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not
+# seem to support this out of the box. Warning: Depending on the platform used,
+# enabling this option may lead to badly anti-aliased labels on the edges of
+# a graph (i.e. they become hard to read).
+
+DOT_TRANSPARENT = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10)
+# support this, this feature is disabled by default.
+
+DOT_MULTI_TARGETS = NO
+
+# If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will
+# generate a legend page explaining the meaning of the various boxes and
+# arrows in the dot generated graphs.
+
+GENERATE_LEGEND = YES
+
+# If the DOT_CLEANUP tag is set to YES (the default) Doxygen will
+# remove the intermediate dot files that are used to generate
+# the various graphs.
+
+DOT_CLEANUP = YES
Added: sandbox/block_ptr/libs/smart_ptr/doc/Introduction.png
==============================================================================
Binary file. No diff available.
Added: sandbox/block_ptr/libs/smart_ptr/doc/Union1.png
==============================================================================
Binary file. No diff available.
Added: sandbox/block_ptr/libs/smart_ptr/doc/Union2.png
==============================================================================
Binary file. No diff available.
Added: sandbox/block_ptr/libs/smart_ptr/doc/acknowledgments.html
Added: sandbox/block_ptr/libs/smart_ptr/doc/bibliography.html
Added: sandbox/block_ptr/libs/smart_ptr/doc/configuration.html
Added: sandbox/block_ptr/libs/smart_ptr/doc/definitions.html
Added: sandbox/block_ptr/libs/smart_ptr/doc/faq.html
Added: sandbox/block_ptr/libs/smart_ptr/doc/index.html
Added: sandbox/block_ptr/libs/smart_ptr/doc/overview.html
Added: sandbox/block_ptr/libs/smart_ptr/doc/rationale.html
Added: sandbox/block_ptr/libs/smart_ptr/doc/tutorial.html
Added: sandbox/block_ptr/libs/smart_ptr/example/Jamfile.v2
Added: sandbox/block_ptr/libs/smart_ptr/example/Makefile
Added: sandbox/block_ptr/libs/smart_ptr/example/block_ptr_test1.cpp
Added: sandbox/block_ptr/libs/smart_ptr/example/block_ptr_test2.cpp
Added: sandbox/block_ptr/libs/smart_ptr/example/block_ptr_test3.cpp
Added: sandbox/block_ptr/libs/smart_ptr/example/local_pool_test1.cpp
Added: sandbox/block_ptr/libs/smart_ptr/example/local_pool_test2.cpp
Added: sandbox/block_ptr/libs/smart_ptr/example/t100.h
Added: sandbox/block_ptr/libs/smart_ptr/example/t100_test1.cpp
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
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/libs/smart_ptr/doc/acknowledgments.html 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,79 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
+<html>
+<head>
+ <meta http-equiv="Content-Language" content="en-us">
+ <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+ <link rel="stylesheet" type="text/css" href="http://www.boost.org/doc/libs/1_46_1/boost.css">
+
+ <title>Block Pointer - Acknowledgments - Boost 1.46.1</title>
+<link rel="icon" href="http://www.boost.org/favicon.ico" type="image/ico"><link rel="stylesheet" type="text/css" href="http://www.boost.org/style-v2/section-basic.css"></head>
+
+<body link="#0000FF" vlink="#800080"> <div id="boost-common-heading-doc">
+ <div class="heading-inner">
+ <div class="heading-placard"></div>
+
+ <h1 class="heading-title">
+ <a href="http://www.boost.org/">
+ <img src="http://www.boost.org/gfx/space.png" alt= "Boost C++ Libraries" class="heading-logo" />
+ <span class="heading-boost">Boost</span>
+ <span class="heading-cpplibraries">C++ Libraries</span>
+ </a></h1>
+
+ <p class="heading-quote">
+ <q>...one of the most highly
+ regarded and expertly designed C++ library projects in the
+ world.</q> <span class="heading-attribution">— <a href=
+ "http://www.gotw.ca/" class="external">Herb Sutter</a> and <a href=
+ "http://en.wikipedia.org/wiki/Andrei_Alexandrescu" class="external">Andrei
+ Alexandrescu</a>, <a href=
+ "http://safari.awprofessional.com/?XmlId=0321113586" class="external">C++
+ Coding Standards</a></span></p>
+
+ <div class="heading-sections">
+ <ul>
+ <li class="welcome-section-tab">Welcome</li>
+
+ <li class="boost-section-tab">Introduction</li>
+
+ <li class="community-section-tab">Community</li>
+
+ <li class="development-section-tab"><a href=
+ "/development/">Development</a></li>
+
+ <li class="support-section-tab">Support</li>
+
+ <li class="doc-section-tab">Documentation</li>
+
+ <li class="map-section-tab">Index</li>
+ </ul>
+ </div>
+</div>
+ </div>
+
+ <div id="boost-common-heading-doc-spacer"></div>
+
+
+ <h1 align="center">Block Pointer</h1>
+
+ <h2 align="center">Acknowledgments</h2>
+ Thanks for Steven Watanabe, John Maddock, Peter Dimov, David Abraham and Rob Stewart for a test template, suggestions, directions and its name.
+ <hr>
+
+ <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+ "http://www.boost.org/doc/libs/1_46_1/doc/images/valid-html401.png" alt="Valid HTML 4.01 Transitional"
+ height="31" width="88"></a></p>
+
+ <p>Revised
+ <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->08
+ April, 2011<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+ <p><i>Copyright © 2011 <a href=
+ "mailto:philippeb8_at_[hidden]">Phil Bouchard</a></i></p>
+
+ <p><i>Distributed under the Boost Software License, Version 1.0. (See
+ accompanying file LICENSE_1_0.txt or
+ copy at <a href=
+ "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt>)</i></p>
+</body>
+</html>
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/libs/smart_ptr/doc/bibliography.html 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,79 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
+<html>
+<head>
+ <meta http-equiv="Content-Language" content="en-us">
+ <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+ <link rel="stylesheet" type="text/css" href="http://www.boost.org/doc/libs/1_46_1/boost.css">
+
+ <title>Block Pointer - Bibliography - Boost 1.46.1</title>
+<link rel="icon" href="http://www.boost.org/favicon.ico" type="image/ico"><link rel="stylesheet" type="text/css" href="http://www.boost.org/style-v2/section-basic.css"></head>
+
+<body link="#0000FF" vlink="#800080"> <div id="boost-common-heading-doc">
+ <div class="heading-inner">
+ <div class="heading-placard"></div>
+
+ <h1 class="heading-title">
+ <a href="http://www.boost.org/">
+ <img src="http://www.boost.org/gfx/space.png" alt= "Boost C++ Libraries" class="heading-logo" />
+ <span class="heading-boost">Boost</span>
+ <span class="heading-cpplibraries">C++ Libraries</span>
+ </a></h1>
+
+ <p class="heading-quote">
+ <q>...one of the most highly
+ regarded and expertly designed C++ library projects in the
+ world.</q> <span class="heading-attribution">— <a href=
+ "http://www.gotw.ca/" class="external">Herb Sutter</a> and <a href=
+ "http://en.wikipedia.org/wiki/Andrei_Alexandrescu" class="external">Andrei
+ Alexandrescu</a>, <a href=
+ "http://safari.awprofessional.com/?XmlId=0321113586" class="external">C++
+ Coding Standards</a></span></p>
+
+ <div class="heading-sections">
+ <ul>
+ <li class="welcome-section-tab">Welcome</li>
+
+ <li class="boost-section-tab">Introduction</li>
+
+ <li class="community-section-tab">Community</li>
+
+ <li class="development-section-tab"><a href=
+ "/development/">Development</a></li>
+
+ <li class="support-section-tab">Support</li>
+
+ <li class="doc-section-tab">Documentation</li>
+
+ <li class="map-section-tab">Index</li>
+ </ul>
+ </div>
+</div>
+ </div>
+
+ <div id="boost-common-heading-doc-spacer"></div>
+
+
+ <h1 align="center">Block Pointer</h1>
+
+ <h2 align="center">Bibliography</h2>
+ {{bibliographical information}}
+ <hr>
+
+ <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+ "http://www.boost.org/doc/libs/1_46_1/doc/images/valid-html401.png" alt="Valid HTML 4.01 Transitional"
+ height="31" width="88"></a></p>
+
+ <p>Revised
+ <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->08
+ April, 2011<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+ <p><i>Copyright © 2011 <a href=
+ "mailto:philippeb8_at_[hidden]">Phil Bouchard</a></i></p>
+
+ <p><i>Distributed under the Boost Software License, Version 1.0. (See
+ accompanying file LICENSE_1_0.txt or
+ copy at <a href=
+ "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt>)</i></p>
+</body>
+</html>
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/libs/smart_ptr/doc/configuration.html 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,175 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
+<html>
+<head>
+ <meta http-equiv="Content-Language" content="en-us">
+ <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+ <link rel="stylesheet" type="text/css" href="http://www.boost.org/doc/libs/1_46_1/boost.css">
+
+ <title>Block Pointer - Configuration - Boost 1.46.1</title>
+<link rel="icon" href="http://www.boost.org/favicon.ico" type="image/ico"><link rel="stylesheet" type="text/css" href="http://www.boost.org/style-v2/section-basic.css"></head>
+
+<body link="#0000FF" vlink="#800080"> <div id="boost-common-heading-doc">
+ <div class="heading-inner">
+ <div class="heading-placard"></div>
+
+ <h1 class="heading-title">
+ <a href="http://www.boost.org/">
+ <img src="http://www.boost.org/gfx/space.png" alt= "Boost C++ Libraries" class="heading-logo" />
+ <span class="heading-boost">Boost</span>
+ <span class="heading-cpplibraries">C++ Libraries</span>
+ </a></h1>
+
+ <p class="heading-quote">
+ <q>...one of the most highly
+ regarded and expertly designed C++ library projects in the
+ world.</q> <span class="heading-attribution">— <a href=
+ "http://www.gotw.ca/" class="external">Herb Sutter</a> and <a href=
+ "http://en.wikipedia.org/wiki/Andrei_Alexandrescu" class="external">Andrei
+ Alexandrescu</a>, <a href=
+ "http://safari.awprofessional.com/?XmlId=0321113586" class="external">C++
+ Coding Standards</a></span></p>
+
+ <div class="heading-sections">
+ <ul>
+ <li class="welcome-section-tab">Welcome</li>
+
+ <li class="boost-section-tab">Introduction</li>
+
+ <li class="community-section-tab">Community</li>
+
+ <li class="development-section-tab"><a href=
+ "/development/">Development</a></li>
+
+ <li class="support-section-tab">Support</li>
+
+ <li class="doc-section-tab">Documentation</li>
+
+ <li class="map-section-tab">Index</li>
+ </ul>
+ </div>
+</div>
+ </div>
+
+ <div id="boost-common-heading-doc-spacer"></div>
+
+
+ <h1 align="center">Block Pointer</h1>
+
+ <h2 align="center">Configuration</h2>
+ <dl class="page-index">
+ <dt>Introduction</dt>
+
+ <dt>Application Defined Macros</dt>
+
+ <dt>Public Library Defined Macros</dt>
+
+ <dt><a href="#lib-defined-impl">Library Defined Implementation
+ Macros</a></dt>
+ </dl>
+
+ <h2><a name="introduction" id="introduction"></a>Introduction</h2>
+
+ <p>{{library}} uses several configuration macros in <a href=
+ "http://www.boost.org/libs/config/config.htm"><boost/config.hpp></a>,
+ as well as configuration macros meant to be supplied by the application.
+ These macros are documented here.</p>
+
+ <h2><a name="app-defined" id="app-defined"></a>Application Defined
+ Macros</h2>
+
+ <p>These are the macros that may be defined by an application using
+ {{library}}.</p>
+
+ <table summary="application defined macros" cellspacing="10" width="100%">
+ <tr>
+ <td><b>Macro</b></td>
+
+ <td><b>Meaning</b></td>
+ </tr>
+
+ <tr>
+ <td>{{macro}}</td>
+
+ <td>{{meaning}}</td>
+ </tr>
+
+ <tr>
+ <td>{{macro}}</td>
+
+ <td>{{meaning}}</td>
+ </tr>
+ </table>
+
+ <h2><a name="lib-defined-public" id="lib-defined-public"></a>Public Library
+ Defined Macros</h2>
+
+ <p>These macros are defined by {{library}} but are expected to be used by
+ application code.</p>
+
+ <table summary="public library defined macros" cellspacing="10" width=
+ "100%">
+ <tr>
+ <td><b>Macro</b></td>
+
+ <td><b>Meaning</b></td>
+ </tr>
+
+ <tr>
+ <td>{{macro}}</td>
+
+ <td>{{meaning}}</td>
+ </tr>
+
+ <tr>
+ <td>{{macro}}</td>
+
+ <td>{{meaning}}</td>
+ </tr>
+ </table>
+
+ <h2><a name="lib-defined-impl" id="lib-defined-impl"></a>Library Defined
+ Implementation Macros</h2>
+
+ <p>These macros are defined by {{library}} and are implementation details
+ of interest only to implementers.</p>
+
+ <table summary="library defined implementation macros" cellspacing="10"
+ width="100%">
+ <tr>
+ <td><b>Macro</b></td>
+
+ <td><b>Meaning</b></td>
+ </tr>
+
+ <tr>
+ <td>{{macro}}</td>
+
+ <td>{{meaning}}</td>
+ </tr>
+
+ <tr>
+ <td>{{macro}}</td>
+
+ <td>{{meaning}}</td>
+ </tr>
+ </table>
+ <hr>
+
+ <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+ "http://www.boost.org/doc/libs/1_46_1/doc/images/valid-html401.png" alt="Valid HTML 4.01 Transitional"
+ height="31" width="88"></a></p>
+
+ <p>Revised
+ <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->08
+ April, 2011<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+ <p><i>Copyright © 2011 <a href=
+ "mailto:philippeb8_at_[hidden]">Phil Bouchard</a></i></p>
+
+ <p><i>Distributed under the Boost Software License, Version 1.0. (See
+ accompanying file LICENSE_1_0.txt or
+ copy at <a href=
+ "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt>)</i></p>
+</body>
+</html>
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/libs/smart_ptr/doc/definitions.html 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,108 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
+<html>
+<head>
+ <meta http-equiv="Content-Language" content="en-us">
+ <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+ <link rel="stylesheet" type="text/css" href="http://www.boost.org/doc/libs/1_46_1/boost.css">
+
+ <title>Block Pointer - Definitions - Boost 1.46.1</title>
+<link rel="icon" href="http://www.boost.org/favicon.ico" type="image/ico"><link rel="stylesheet" type="text/css" href="http://www.boost.org/style-v2/section-basic.css"></head>
+
+<body link="#0000FF" vlink="#800080"> <div id="boost-common-heading-doc">
+ <div class="heading-inner">
+ <div class="heading-placard"></div>
+
+ <h1 class="heading-title">
+ <a href="http://www.boost.org/">
+ <img src="http://www.boost.org/gfx/space.png" alt= "Boost C++ Libraries" class="heading-logo" />
+ <span class="heading-boost">Boost</span>
+ <span class="heading-cpplibraries">C++ Libraries</span>
+ </a></h1>
+
+ <p class="heading-quote">
+ <q>...one of the most highly
+ regarded and expertly designed C++ library projects in the
+ world.</q> <span class="heading-attribution">— <a href=
+ "http://www.gotw.ca/" class="external">Herb Sutter</a> and <a href=
+ "http://en.wikipedia.org/wiki/Andrei_Alexandrescu" class="external">Andrei
+ Alexandrescu</a>, <a href=
+ "http://safari.awprofessional.com/?XmlId=0321113586" class="external">C++
+ Coding Standards</a></span></p>
+
+ <div class="heading-sections">
+ <ul>
+ <li class="welcome-section-tab">Welcome</li>
+
+ <li class="boost-section-tab">Introduction</li>
+
+ <li class="community-section-tab">Community</li>
+
+ <li class="development-section-tab"><a href=
+ "/development/">Development</a></li>
+
+ <li class="support-section-tab">Support</li>
+
+ <li class="doc-section-tab">Documentation</li>
+
+ <li class="map-section-tab">Index</li>
+ </ul>
+ </div>
+</div>
+ </div>
+
+ <div id="boost-common-heading-doc-spacer"></div>
+
+
+ <h1 align="center">Block Pointer</h1>
+
+ <h2 align="center">Definitions</h2>
+ <h2>Contents</h2>
+
+ <dl class="page-index">
+ <dt>Introduction</dt>
+
+ <dt>Definitions</dt>
+
+ <dd>
+ <dl class="page-index">
+ <dt>Term 1</dt>
+
+ <dt>Term 2</dt>
+ </dl>
+ </dd>
+ </dl>
+ <hr>
+
+ <h2><a name="introduction" id="introduction"></a>Introduction</h2>
+
+ <p>{{Introductory text}}</p>
+
+ <h2><a name="definitions" id="definitions"></a>Definitions</h2>
+
+ <dl class="definitions">
+ <dt><a name="definition-term1" id="definition-term1"></a><b>{{term}}:</b>
+ {{definition}}</dt>
+
+ <dt><a name="definition-term2" id="definition-term2"></a><b>{{term}}:</b>
+ {{definition}}</dt>
+ </dl>
+ <hr>
+
+ <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+ "http://www.boost.org/doc/libs/1_46_1/doc/images/valid-html401.png" alt="Valid HTML 4.01 Transitional"
+ height="31" width="88"></a></p>
+
+ <p>Revised
+ <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->08
+ April, 2011<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+ <p><i>Copyright © 2011 <a href=
+ "mailto:philippeb8_at_[hidden]">Phil Bouchard</a></i></p>
+
+ <p><i>Distributed under the Boost Software License, Version 1.0. (See
+ accompanying file LICENSE_1_0.txt or
+ copy at <a href=
+ "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt>)</i></p>
+</body>
+</html>
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/libs/smart_ptr/doc/faq.html 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,91 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
+<html>
+<head>
+ <meta http-equiv="Content-Language" content="en-us">
+ <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+ <link rel="stylesheet" type="text/css" href="http://www.boost.org/doc/libs/1_46_1/boost.css">
+
+ <title>Block Pointer - FAQ - Boost 1.46.1</title>
+<link rel="icon" href="http://www.boost.org/favicon.ico" type="image/ico"><link rel="stylesheet" type="text/css" href="http://www.boost.org/style-v2/section-basic.css"></head>
+
+<body link="#0000FF" vlink="#800080"> <div id="boost-common-heading-doc">
+ <div class="heading-inner">
+ <div class="heading-placard"></div>
+
+ <h1 class="heading-title">
+ <a href="http://www.boost.org/">
+ <img src="http://www.boost.org/gfx/space.png" alt= "Boost C++ Libraries" class="heading-logo" />
+ <span class="heading-boost">Boost</span>
+ <span class="heading-cpplibraries">C++ Libraries</span>
+ </a></h1>
+
+ <p class="heading-quote">
+ <q>...one of the most highly
+ regarded and expertly designed C++ library projects in the
+ world.</q> <span class="heading-attribution">— <a href=
+ "http://www.gotw.ca/" class="external">Herb Sutter</a> and <a href=
+ "http://en.wikipedia.org/wiki/Andrei_Alexandrescu" class="external">Andrei
+ Alexandrescu</a>, <a href=
+ "http://safari.awprofessional.com/?XmlId=0321113586" class="external">C++
+ Coding Standards</a></span></p>
+
+ <div class="heading-sections">
+ <ul>
+ <li class="welcome-section-tab">Welcome</li>
+
+ <li class="boost-section-tab">Introduction</li>
+
+ <li class="community-section-tab">Community</li>
+
+ <li class="development-section-tab"><a href=
+ "/development/">Development</a></li>
+
+ <li class="support-section-tab">Support</li>
+
+ <li class="doc-section-tab">Documentation</li>
+
+ <li class="map-section-tab">Index</li>
+ </ul>
+ </div>
+</div>
+ </div>
+
+ <div id="boost-common-heading-doc-spacer"></div>
+
+
+ <h1 align="center">Block Pointer</h1>
+
+ <h2 align="center">Frequently Asked Questions (FAQs)</h2>
+ <dl class="page-index">
+ <dt>{{question}}</dt>
+
+ <dt>{{question}}</dt>
+ </dl>
+
+ <h2><a name="question1" id="question1"></a>{{question}}</h2>
+
+ <p>{{answer}}</p>
+
+ <h2><a name="question2" id="question2"></a>{{question}}</h2>
+
+ <p>{{answer}}</p>
+ <hr>
+
+ <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+ "http://www.boost.org/doc/libs/1_46_1/doc/images/valid-html401.png" alt="Valid HTML 4.01 Transitional"
+ height="31" width="88"></a></p>
+
+ <p>Revised
+ <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->08
+ April, 2011<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+ <p><i>Copyright © 2011 <a href=
+ "mailto:philippeb8_at_[hidden]">Phil Bouchard</a></i></p>
+
+ <p><i>Distributed under the Boost Software License, Version 1.0. (See
+ accompanying file LICENSE_1_0.txt or
+ copy at <a href=
+ "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt>)</i></p>
+</body>
+</html>
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/libs/smart_ptr/doc/index.html 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,93 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
+<html>
+<head>
+ <meta http-equiv="Content-Language" content="en-us">
+ <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+ <link rel="stylesheet" type="text/css" href="http://www.boost.org/doc/libs/1_46_1/boost.css">
+
+ <title>Block Pointer - Boost 1.46.1</title>
+<link rel="icon" href="http://www.boost.org/favicon.ico" type="image/ico"><link rel="stylesheet" type="text/css" href="http://www.boost.org/style-v2/section-basic.css"></head>
+
+<body link="#0000FF" vlink="#800080"> <div id="boost-common-heading-doc">
+ <div class="heading-inner">
+ <div class="heading-placard"></div>
+
+ <h1 class="heading-title">
+ <a href="http://www.boost.org/">
+ <img src="http://www.boost.org/gfx/space.png" alt= "Boost C++ Libraries" class="heading-logo" />
+ <span class="heading-boost">Boost</span>
+ <span class="heading-cpplibraries">C++ Libraries</span>
+ </a></h1>
+
+ <p class="heading-quote">
+ <q>...one of the most highly
+ regarded and expertly designed C++ library projects in the
+ world.</q> <span class="heading-attribution">— <a href=
+ "http://www.gotw.ca/" class="external">Herb Sutter</a> and <a href=
+ "http://en.wikipedia.org/wiki/Andrei_Alexandrescu" class="external">Andrei
+ Alexandrescu</a>, <a href=
+ "http://safari.awprofessional.com/?XmlId=0321113586" class="external">C++
+ Coding Standards</a></span></p>
+
+ <div class="heading-sections">
+ <ul>
+ <li class="welcome-section-tab">Welcome</li>
+
+ <li class="boost-section-tab">Introduction</li>
+
+ <li class="community-section-tab">Community</li>
+
+ <li class="development-section-tab"><a href=
+ "/development/">Development</a></li>
+
+ <li class="support-section-tab">Support</li>
+
+ <li class="doc-section-tab">Documentation</li>
+
+ <li class="map-section-tab">Index</li>
+ </ul>
+ </div>
+</div>
+ </div>
+
+ <div id="boost-common-heading-doc-spacer"></div>
+
+
+ <h1 align="center">Block Pointer</h1>
+
+ <h2 align="center">Index</h2>
+ <h2>Contents</h2>
+
+ <dl class="index">
+ <dt>Overview</dt>
+
+ <dt>Presentation</dt>
+
+ <dt>Reference</dt>
+
+ <dt>Rationale</dt>
+
+ <dt>Tutorial</dt>
+
+ <dt>Acknowledgments</dt>
+ </dl>
+ <hr>
+
+ <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+ "http://www.boost.org/doc/libs/1_46_1/doc/images/valid-html401.png" alt="Valid HTML 4.01 Transitional"
+ height="31" width="88"></a></p>
+
+ <p>Revised
+ <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->08
+ April, 2011<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+ <p><i>Copyright © 2011 <a href=
+ "mailto:philippeb8_at_[hidden]">Phil Bouchard</a></i></p>
+
+ <p><i>Distributed under the Boost Software License, Version 1.0. (See
+ accompanying file LICENSE_1_0.txt or
+ copy at <a href=
+ "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt>)</i></p>
+</body>
+</html>
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/libs/smart_ptr/doc/overview.html 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,116 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
+<html>
+<head>
+ <meta http-equiv="Content-Language" content="en-us">
+ <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+ <link rel="stylesheet" type="text/css" href="http://www.boost.org/doc/libs/1_46_1/boost.css">
+
+ <title>Block Pointer - Overview - Boost 1.46.1</title>
+<link rel="icon" href="http://www.boost.org/favicon.ico" type="image/ico"><link rel="stylesheet" type="text/css" href="http://www.boost.org/style-v2/section-basic.css"></head>
+
+<body link="#0000FF" vlink="#800080"> <div id="boost-common-heading-doc">
+ <div class="heading-inner">
+ <div class="heading-placard"></div>
+
+ <h1 class="heading-title">
+ <a href="http://www.boost.org/">
+ <img src="http://www.boost.org/gfx/space.png" alt= "Boost C++ Libraries" class="heading-logo" />
+ <span class="heading-boost">Boost</span>
+ <span class="heading-cpplibraries">C++ Libraries</span>
+ </a></h1>
+
+ <p class="heading-quote">
+ <q>...one of the most highly
+ regarded and expertly designed C++ library projects in the
+ world.</q> <span class="heading-attribution">— <a href=
+ "http://www.gotw.ca/" class="external">Herb Sutter</a> and <a href=
+ "http://en.wikipedia.org/wiki/Andrei_Alexandrescu" class="external">Andrei
+ Alexandrescu</a>, <a href=
+ "http://safari.awprofessional.com/?XmlId=0321113586" class="external">C++
+ Coding Standards</a></span></p>
+
+ <div class="heading-sections">
+ <ul>
+ <li class="welcome-section-tab">Welcome</li>
+
+ <li class="boost-section-tab">Introduction</li>
+
+ <li class="community-section-tab">Community</li>
+
+ <li class="development-section-tab"><a href=
+ "/development/">Development</a></li>
+
+ <li class="support-section-tab">Support</li>
+
+ <li class="doc-section-tab">Documentation</li>
+
+ <li class="map-section-tab">Index</li>
+ </ul>
+ </div>
+</div>
+ </div>
+
+ <div id="boost-common-heading-doc-spacer"></div>
+
+
+ <h1 align="center">Block Pointer</h1>
+
+ <h2 align="center">Overview</h2>
+ <dl class="index">
+ <dt>Introduction</dt>
+
+ <dt>Garbage Collection</dt>
+
+ <dt>Reference Counting</dt>
+
+ <dt>Block Pointer</dt>
+ </dl>
+
+ <h2><a name="introduction" id="introduction"></a>Introduction</h2>
+
+ <p>Memory management can be subdivised in two categories: garbage collection and reference counting.</p>
+
+ <h2><a name="gc" id="gc"></a>Garbage Collection</h2>
+ <p>Garbage collection is a technique where memory blocks are collected and later deallocated when they are found to be unreferenced by any other object. Garbage
+ collection is used by many popular languages because of its very fast allocation and deallocation timing. Unfortunately this technique simply postpones the
+ deallocation of the unreferenced objects to later freeze the entire application, on a single CPU system, and to collect them using various tracing algorithms.
+ This may be unacceptable for real-time applications or device drivers, for example.</p>
+
+ <h2><a name="rc" id="rc"></a>Reference Counting</h2>
+
+ <p>Reference counting is a different approach where objects pointed to are aware of the number of times they are referenced. This means a counter within the object
+ is incremented or decremented according to the number of smart pointers that are referencing or dereferencing it. There is a lost in performance as compared to
+ garbage collection because of the extra time required to manage the counter every time the pointer is reassigned or dereferenced. Reference counting can also leave
+ a group of blocks of memory referencing each other called "cyclic" (see presentation) unnoticed and therefore never freed by the
+ application. On the other hand the destruction of the object is done instantaneously and thus the behavior or the application can be predicted.</p>
+
+ <h2><a name="sp" id="sp"></a>Block Pointer</h2>
+
+ <p>Block Pointer is a memory manager on top of reference counting and is also able to detect outright unreferenced cyclic blocks of memory. It is a fast as
+ the popular smart pointer <i>boost::shared_ptr<T></i> but is not requiring a bigger memory usage per pointer (2 times <i>sizeof(void *)</i>), given its
+ ability to detect cyclic blocks of memory with no coding overhead. In terms of programing requirements, <i>block_ptr<T></i> simply requires to point
+ to instantiations of the <i>mm<T></i> type. For example:</p>
+ <pre>
+ block_ptr<int> v = new block<int>(11);
+ </pre>
+
+ <hr>
+
+ <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+ "http://www.boost.org/doc/libs/1_46_1/doc/images/valid-html401.png" alt="Valid HTML 4.01 Transitional"
+ height="31" width="88"></a></p>
+
+ <p>Revised
+ <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->08
+ April, 2011<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+ <p><i>Copyright © 2011 <a href=
+ "mailto:philippeb8_at_[hidden]">Phil Bouchard</a></i></p>
+
+ <p><i>Distributed under the Boost Software License, Version 1.0. (See
+ accompanying file LICENSE_1_0.txt or
+ copy at <a href=
+ "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt>)</i></p>
+</body>
+</html>
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/libs/smart_ptr/doc/rationale.html 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,130 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
+<html>
+<head>
+ <meta http-equiv="Content-Language" content="en-us">
+ <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+ <link rel="stylesheet" type="text/css" href="http://www.boost.org/doc/libs/1_46_1/boost.css">
+
+ <title>Block Pointer - Rationale - Boost 1.46.1</title>
+<link rel="icon" href="http://www.boost.org/favicon.ico" type="image/ico"><link rel="stylesheet" type="text/css" href="http://www.boost.org/style-v2/section-basic.css"></head>
+
+<body link="#0000FF" vlink="#800080"> <div id="boost-common-heading-doc">
+ <div class="heading-inner">
+ <div class="heading-placard"></div>
+
+ <h1 class="heading-title">
+ <a href="http://www.boost.org/">
+ <img src="http://www.boost.org/gfx/space.png" alt= "Boost C++ Libraries" class="heading-logo" />
+ <span class="heading-boost">Boost</span>
+ <span class="heading-cpplibraries">C++ Libraries</span>
+ </a></h1>
+
+ <p class="heading-quote">
+ <q>...one of the most highly
+ regarded and expertly designed C++ library projects in the
+ world.</q> <span class="heading-attribution">— <a href=
+ "http://www.gotw.ca/" class="external">Herb Sutter</a> and <a href=
+ "http://en.wikipedia.org/wiki/Andrei_Alexandrescu" class="external">Andrei
+ Alexandrescu</a>, <a href=
+ "http://safari.awprofessional.com/?XmlId=0321113586" class="external">C++
+ Coding Standards</a></span></p>
+
+ <div class="heading-sections">
+ <ul>
+ <li class="welcome-section-tab">Welcome</li>
+
+ <li class="boost-section-tab">Introduction</li>
+
+ <li class="community-section-tab">Community</li>
+
+ <li class="development-section-tab"><a href=
+ "/development/">Development</a></li>
+
+ <li class="support-section-tab">Support</li>
+
+ <li class="doc-section-tab">Documentation</li>
+
+ <li class="map-section-tab">Index</li>
+ </ul>
+ </div>
+</div>
+ </div>
+
+ <div id="boost-common-heading-doc-spacer"></div>
+
+
+ <h1 align="center">Block Pointer</h1>
+
+ <h2 align="center">Rationale</h2>
+ <dl class="index">
+ <dt>Introduction</dt>
+
+ <dt>Cyclicism</dt>
+
+ <dt>Initialization</dt>
+
+ <dt>Union</dt>
+
+ <dt>Naming Convention</dt>
+ </dl>
+
+ <h2><a name="introduction" id="introduction"></a>Introduction</h2>
+
+ <p>Block Pointer introduces the concept of <i>set</i> where it is defined to be a one or many memory blocks referencing each other allocated on the heap pointed
+ to by one or many <i>block_ptr<T></i>s allocated on the stack or the data segment (non heap) of the application. Each <i>set</i> is consequently composed of a
+ list of all memory blocks constituting it and a counter tracking the number of times the <i>set</i> is referenced by a <i>block_ptr<T></i> from the stack or the data
+ segment. For example:</p>
+
+ <center>
+ <img src="Introduction.png"/>
+ </center>
+
+ <h2><a name="cyclicism" id="cyclicism"></a>Cyclicism</h2>
+
+ <p>Therefore whenever a <i>set</i> counter finds out the number of <i>block_ptr<T></i> referencing it to be zero, the deallocation of each memory block composing
+ the <i>set</i> is enforced. Thus whether the <i>set</i> was composed of memory blocks referencing each other in a cyclic way or not, all of them will be subject to
+ destruction and deallocation indifferent from the cyclicism problem presented by the reference counters. As we can see in the following example, the <i>set</i> counter reaches
+ 0 and consequently every elements composing the <i>set</i> will be destructed and deallocated:</p>
+
+ <center>
+ <img src="Cyclicism1.png"/><img src="Cyclicism2.png"/>
+ </center>
+
+ <h2><a name="initialization" id="initialization"></a>Initialization</h2>
+
+ <p>A <i>block_ptr<T></i> is initialized differently depending on the memory segment it is being instanciated on. If it is found to be residing the stack or the data
+ segment then a new <i>set</i> counter will also be instanciated. If it is found to be living on the heap then a more complicated mechanism is involved to track the
+ last memory block that was allocated in the same thread, find its address and stack up the <i>set</i> it will be part of until the first <i>block_ptr<T></i> found on
+ the stack is or data segment is initialized, where the new <i>set</i> counter will be shared with all of the newly allocated blocks of memory referencing each other.</p>
+
+ <h2><a name="union" id="union"></a>Union</h2>
+
+ <p>A <i>set</i> will be unified with another <i>set</i> whenever one of its member is found to reference a member from a different <i>set</i>. The counter from the
+ first <i>set</i> will be added to the counter from the second <i>set</i> and a redirection of the first counter to the second will occur so that all elements from the
+ first <i>set</i> make direct use of the second counter. Once two <i>set</i>s are unified they will stay unified even if the new reference responsible for unifying the
+ <i>set</i>s is once again disjointed.</p>
+
+ <center>
+ <img src="Union1.png"/><img src="Union2.png"/>
+ </center>
+
+ <hr>
+
+ <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+ "http://www.boost.org/doc/libs/1_46_1/doc/images/valid-html401.png" alt="Valid HTML 4.01 Transitional"
+ height="31" width="88"></a></p>
+
+ <p>Revised
+ <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->08
+ April, 2011<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+ <p><i>Copyright © 2011 <a href=
+ "mailto:philippeb8_at_[hidden]">Phil Bouchard</a></i></p>
+
+ <p><i>Distributed under the Boost Software License, Version 1.0. (See
+ accompanying file LICENSE_1_0.txt or
+ copy at <a href=
+ "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt>)</i></p>
+</body>
+</html>
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/libs/smart_ptr/doc/tutorial.html 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,146 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
+<html>
+<head>
+ <meta http-equiv="Content-Language" content="en-us">
+ <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
+ <link rel="stylesheet" type="text/css" href="http://www.boost.org/doc/libs/1_46_1/boost.css">
+
+ <title>Block Pointer - Tutorial - Boost 1.46.1</title>
+<link rel="icon" href="http://www.boost.org/favicon.ico" type="image/ico"><link rel="stylesheet" type="text/css" href="http://www.boost.org/style-v2/section-basic.css"></head>
+
+<body link="#0000FF" vlink="#800080"> <div id="boost-common-heading-doc">
+ <div class="heading-inner">
+ <div class="heading-placard"></div>
+
+ <h1 class="heading-title">
+ <a href="http://www.boost.org/">
+ <img src="http://www.boost.org/gfx/space.png" alt= "Boost C++ Libraries" class="heading-logo" />
+ <span class="heading-boost">Boost</span>
+ <span class="heading-cpplibraries">C++ Libraries</span>
+ </a></h1>
+
+ <p class="heading-quote">
+ <q>...one of the most highly
+ regarded and expertly designed C++ library projects in the
+ world.</q> <span class="heading-attribution">— <a href=
+ "http://www.gotw.ca/" class="external">Herb Sutter</a> and <a href=
+ "http://en.wikipedia.org/wiki/Andrei_Alexandrescu" class="external">Andrei
+ Alexandrescu</a>, <a href=
+ "http://safari.awprofessional.com/?XmlId=0321113586" class="external">C++
+ Coding Standards</a></span></p>
+
+ <div class="heading-sections">
+ <ul>
+ <li class="welcome-section-tab">Welcome</li>
+
+ <li class="boost-section-tab">Introduction</li>
+
+ <li class="community-section-tab">Community</li>
+
+ <li class="development-section-tab"><a href=
+ "/development/">Development</a></li>
+
+ <li class="support-section-tab">Support</li>
+
+ <li class="doc-section-tab">Documentation</li>
+
+ <li class="map-section-tab">Index</li>
+ </ul>
+ </div>
+</div>
+ </div>
+
+ <div id="boost-common-heading-doc-spacer"></div>
+
+
+ <h1 align="center">Block Pointer</h1>
+
+ <h2 align="center">Tutorial</h2>
+ <dl class="index">
+ <dt>Basic</dt>
+
+ <dt>Advanced</dt>
+
+ <dt>Caveat</dt>
+ </dl>
+
+ <h2><a name="basic" id="basic"></a>Basic</h2>
+
+ <p>Block Pointer was designed to be easy to use and to be versatile in terms of object variants it can refer to. Its only requirement is limited to the usage
+ of a special type needed to instanciate objects referred to. For example:</p>
+
+ <pre>
+ block_ptr<int> p = new block<int>(11);
+ </pre>
+
+ <p>Will instanciate a special object <i>mm<int></i> having an integer as one of its member. The pointer to the object is then passed to the
+ <i>block_ptr<int></i> that will manage its existence and later destroy and deallocate it when it is found to be no longer referenced.<p>
+
+ <p>Variants of the object type can also be used. In order to instanciate an array of integer for example, all that will be needed is to change the
+ type to the following:<p>
+
+ <pre>
+ block_ptr<int[10]> p = new block<int[10]>();
+ </pre>
+
+ See the following example for different cases of its usage.
+
+ <h2><a name="advanced" id="advanced"></a>Advanced</h2>
+
+ <p>When STL containers are made out of objects having members of type <i>block_ptr<T></i> then it will be desirable to have all of the allocated nodes
+ and its members part of the same <i>set</i>. This way all of the newly allocated <i>block_ptr<T></i> will be referring to the same <i>set</i> header.
+ In order to do so, we must tell the container in question a new allocator that will be used to instanciate the nodes. This allocator is called:
+ <i>block_allocator<T></i>. For example:</p>
+
+ <pre>
+ list< block_ptr<int>, block_allocator< block_ptr<int> > > c;
+ c.push_back(new block<int>(11));
+ </pre>
+
+ <h2><a name="caveat" id="caveat"></a>Caveat</h2>
+
+ <p>Hierarchies with multiple inheritance without virtual tables will cause undefined behavior if a pointer to a derived class is assigned to a pointer of one
+ of its base class. For example:</p>
+
+ <pre>
+ struct M { int i; };
+ struct N { int i; };
+ struct O : N, M { int i; };
+
+ block_ptr<O> po = new block<O>;
+ block_ptr<N> pn = po; // incorrect
+ block_ptr<M> pm = po; // incorrect
+ </pre>
+
+ <p>A way to bypass any problem that might be created by the example above is to add virtual destructors to the classes:</p>
+
+ <pre>
+ struct M { int i; virtual ~M() {} };
+ struct N { int i; virtual ~N() {} };
+ struct O : N, M { int i; };
+
+ block_ptr<O> po = new block<O>;
+ block_ptr<N> pn = po; // correct
+ block_ptr<M> pm = po; // correct
+ </pre>
+
+ <hr>
+
+ <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
+ "http://www.boost.org/doc/libs/1_46_1/doc/images/valid-html401.png" alt="Valid HTML 4.01 Transitional"
+ height="31" width="88"></a></p>
+
+ <p>Revised
+ <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->22
+ April, 2011<!--webbot bot="Timestamp" endspan i-checksum="38514" --></p>
+
+ <p><i>Copyright © 2011 <a href=
+ "mailto:philippeb8_at_[hidden]">Phil Bouchard</a></i></p>
+
+ <p><i>Distributed under the Boost Software License, Version 1.0. (See
+ accompanying file LICENSE_1_0.txt or
+ copy at <a href=
+ "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt>)</i></p>
+</body>
+</html>
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/libs/smart_ptr/example/Jamfile.v2 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,33 @@
+# Shifted Pointer
+#
+# Copyright (c) 2011
+# Phil Bouchard
+#
+# 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
+
+using testing ;
+
+if ! $(BOOST_ROOT)
+{
+ BOOST_ROOT = [ modules.peek : BOOST_ROOT ] ;
+}
+
+# bjam -V2 threading=multi target-os=cygwin threadapi=pthread variant=debug
+
+project :
+ : requirements
+ <include>../../..
+ <include>$(BOOST_ROOT)
+ <warnings>all
+;
+
+test-suite "set_ptr_tests" :
+ [ run set_ptr_test1.cpp ]
+ [ run set_ptr_test2.cpp ]
+ #[ run set_ptr_test3.cpp /boost//boost_unit_test_framework ]
+ #[ run local_pool_test1.cpp ]
+ #[ run local_pool_test2.cpp ]
+ #[ run t100_test1.cpp /boost//boost_regex ]
+ ;
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/libs/smart_ptr/example/Makefile 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,48 @@
+CXX := g++
+CXXFLAGS := -ggdb3
+INCPATH := -I../../.. -I../../../../../include
+LINK := g++
+LFLAGS := -L../../../../../lib -lboost_thread
+RM := rm
+HEADERS := $(wildcard *.h)
+SOURCES := $(wildcard *.cpp)
+OBJECTS := $(patsubst %.cpp,%.o,$(SOURCES))
+
+.SUFFIXES: .cpp
+
+.cpp.o:
+ $(CXX) -c $(CXXFLAGS) $(INCPATH) -o $@ $<
+
+.PHONY : all depend clean
+
+
+all : block_ptr_test1 block_ptr_test2 block_ptr_test3 local_pool_test1 local_pool_test2 t100_test1
+
+block_ptr_test1: block_ptr_test1.o
+ $(LINK) $(LFLAGS) -o $@ $^
+
+block_ptr_test2: block_ptr_test2.o
+ $(LINK) $(LFLAGS) -o $@ $^
+
+block_ptr_test3: block_ptr_test3.o
+ $(LINK) $(LFLAGS) -o $@ $^ -lboost_unit_test_framework
+
+local_pool_test1: local_pool_test1.o
+ $(LINK) $(LFLAGS) -o $@ $^
+
+local_pool_test2: local_pool_test2.o
+ $(LINK) $(LFLAGS) -o $@ $^
+
+t100_test1: t100_test1.o
+ $(LINK) $(LFLAGS) -o $@ $^ -lboost_regex
+
+
+Makefile.dep: $(SOURCES)
+ $(CXX) ${INCPATH} -MM $^ > $@
+
+clean:
+ $(RM) block_ptr_test1 block_ptr_test2 block_ptr_test3 local_pool_test1 local_pool_test2 t100_test1
+ $(RM) $(OBJECTS)
+ $(RM) *~ core
+
+-include Makefile.dep
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/libs/smart_ptr/example/block_ptr_test1.cpp 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,79 @@
+/**
+ @file
+ block_ptr_test2.cpp
+
+ @note
+ Memory manager handling heap deallocations in constant time.
+*/
+
+#include <iostream>
+
+#include <boost/block_ptr.hpp>
+
+
+using namespace std;
+using namespace boost;
+
+
+struct A
+{
+ int i;
+ block_ptr<A> p;
+
+ A(int i = 0) : i(i)
+ {
+ cout << __FUNCTION__ << ": " << i << endl;
+ }
+
+ ~A()
+ {
+ cout << __FUNCTION__ << ": " << i << endl;
+ }
+};
+
+
+int main()
+{
+ cout << "Cyclicism:" << endl;
+ {
+ block_ptr<A> p = new block<A>(7);
+ block_ptr<A> q = new block<A>(8);
+ block_ptr<A> r = new block<A>(9);
+
+ block_ptr<void> t = new block<A>(10);
+ block_ptr<int const volatile> v = new block<int const volatile>(11);
+
+ p->p = p;
+ q = r;
+ v = new block<int const volatile>(12);
+
+ cout << "p->i = " << p->i << endl;
+ cout << "q->i = " << q->i << endl;
+ cout << "r->i = " << r->i << endl;
+ cout << "* v = " << * v << endl;
+ }
+ cout << endl;
+
+ // The following don't work with MSVC:
+#if ! defined(_MSC_VER)
+ cout << "Array access:" << endl;
+ {
+ block_ptr<A[5]> s = new block<A[5]>();
+ block_ptr<char[9]> u = new block<char[9]>();
+
+ u[4] = 'Z';
+
+ cout << "u[4] = " << u[4] << endl;
+ }
+ cout << endl;
+#endif
+
+ cout << "Order of destruction:" << endl;
+ {
+ block_ptr<A> v = new block<A>(0);
+ v->p = new block<A>(1);
+ v->p->p = new block<A>(2);
+ v->p->p->p = v;
+ }
+ cout << endl;
+}
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/libs/smart_ptr/example/block_ptr_test2.cpp 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,128 @@
+/**
+ @file
+ block_ptr_test2.cpp
+
+ @author
+ Steven Watanabe <watanabesj_at_[hidden]>
+*/
+
+#include <boost/block_ptr.hpp>
+#include <boost/block_allocator.hpp>
+
+#include <list>
+#include <vector>
+#include <iostream>
+
+#include <boost/mpl/range_c.hpp>
+#include <boost/mpl/for_each.hpp>
+#include <boost/array.hpp>
+
+
+static int count;
+
+using boost::block_ptr;
+using boost::block;
+using boost::block_allocator;
+using boost::operator ==;
+using boost::operator !=;
+
+struct node {
+ node() {
+ ++count;
+ }
+ ~node() {
+ --count;
+ }
+ block_ptr<node> prior;
+ block_ptr<node> next;
+};
+
+struct list {
+public:
+ list() {}
+ void clear() {
+ front.reset();
+ back.reset();
+ }
+ void insert() {
+ if(front.get() == 0) {
+ back = new block<node>();
+ } else {
+ back->next = new block<node>();
+ back->next->prior = back;
+ back = back->next;
+ }
+ }
+ ~list()
+ {
+ }
+private:
+ block_ptr<node> front;
+ block_ptr<node> back;
+};
+
+struct vector {
+ vector() { ++count; }
+ ~vector() { --count; }
+ vector(const vector& other) : elements(other.elements) { ++count; }
+ //std::vector<block_ptr<vector> > elements;
+ std::list<block_ptr<vector>, block_allocator< block_ptr<vector> > > elements; //! works fine
+};
+
+struct create_type {
+ template<class T>
+ void operator()(T) const {
+ new block<boost::array<char, T::value> >();
+ }
+};
+
+int main() {
+ count = 0;
+ {
+ list l;
+ for(int j = 0; j < 2; ++j) {
+ for(int i = 0; i < 1000; ++i) {
+ l.insert();
+ }
+ l.clear();
+ }
+ }
+ std::cout << count << std::endl;
+
+ count = 0;
+ {
+ block_ptr<vector> v = new block<vector>();
+ v->elements.push_back(v);
+ }
+ std::cout << count << std::endl;
+
+ count = 0;
+ {
+ block_ptr<vector> v = new block<vector>();
+ v->elements.push_back(v);
+ }
+ std::cout << count << std::endl;
+
+ {
+ vector v;
+ v.elements.push_back(new block<vector>());
+ }
+ std::cout << count << std::endl;
+
+ count = 0;
+ {
+ block_ptr<int> test = new block<int>(5);
+ test = test;
+
+ std::cout << "test = " << * test << std::endl;
+ }
+ std::cout << count << std::endl;
+
+ count = 0;
+ for(int i = 0; i < 500; ++i) {
+ boost::mpl::for_each<boost::mpl::range_c<int, 1, 100> >(create_type());
+ }
+ std::cout << count << std::endl;
+
+ //_exit(-1); // bypassing bug in pool destructor
+}
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/libs/smart_ptr/example/block_ptr_test3.cpp 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,131 @@
+/**
+ @file
+ block_ptr_test3.cpp
+
+ @note
+ MinGW users must link with: -Wl,--enable-runtime-pseudo-reloc
+
+ @author
+ Steven Watanabe <watanabesj_at_[hidden]>
+*/
+
+
+
+#include <boost/block_ptr.hpp>
+#include <boost/block_allocator.hpp>
+
+#include <vector>
+#include <iostream>
+
+#include <boost/mpl/range_c.hpp>
+#include <boost/mpl/for_each.hpp>
+#include <boost/array.hpp>
+
+#define BOOST_TEST_DYN_LINK
+#define BOOST_TEST_MAIN
+
+#include <boost/test/unit_test.hpp>
+
+static int count;
+
+using boost::block_ptr;
+using boost::block;
+using boost::block_allocator;
+
+struct node {
+ node() {
+ ++count;
+ }
+ ~node() {
+ --count;
+ }
+ node(const node&) {
+ ++count;
+ }
+ block_ptr<node> prior;
+ block_ptr<node> next;
+};
+
+struct list {
+public:
+ list() {}
+ void clear() {
+ front.reset();
+ back.reset();
+ }
+ void insert() {
+ if(front.get() == 0) {
+ front = back = new block<node>();
+ } else {
+ back->next = new block<node>();
+ back->next->prior = back;
+ back = back->next;
+ }
+ }
+private:
+ block_ptr<node> front;
+ block_ptr<node> back;
+};
+
+struct vector {
+ vector() { ++count; }
+ ~vector() { --count; }
+ vector(const vector& other) : elements(other.elements) { ++count; }
+ std::vector<block_ptr<vector>, block_allocator<block_ptr<vector> > > elements;
+};
+
+struct create_type {
+ template<class T>
+ void operator()(T) const {
+ new block<boost::array<char, T::value> >();
+ }
+};
+
+BOOST_AUTO_TEST_CASE(test_block_ptr) {
+
+ count = 0;
+ {
+ block_ptr<vector> v = new block<vector>();
+ v->elements.push_back(v);
+ }
+ BOOST_CHECK_EQUAL(count, 0);
+
+ count = 0;
+ {
+ list l;
+ for(int j = 0; j < 2; ++j) {
+ for(int i = 0; i < 2; ++i) {
+ l.insert();
+ }
+ l.clear();
+ }
+ }
+ BOOST_CHECK_EQUAL(count, 0);
+
+ count = 0;
+ {
+ block_ptr<int> test = new block<int>(5);
+ test = test;
+
+ BOOST_CHECK_NE(test.get(), static_cast<int*>(0));
+ BOOST_CHECK_EQUAL(*test, 5);
+ }
+
+ for(int i = 0; i < 500; ++i) {
+ boost::mpl::for_each<boost::mpl::range_c<int, 1, 100> >(create_type());
+ }
+
+ count = 0;
+ {
+ block_ptr<vector> v = new block<vector>();
+ v->elements.push_back(v);
+ }
+ BOOST_CHECK_EQUAL(count, 0);
+
+ {
+ vector v;
+ v.elements.push_back(new block<vector>());
+ }
+ BOOST_CHECK_EQUAL(count, 0);
+
+}
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/libs/smart_ptr/example/local_pool_test1.cpp 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,360 @@
+/* test.c
+An example of how to use nedalloc
+(C) 2005-2007 Niall Douglas
+*/
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <boost/detail/nedmalloc.c.h>
+
+#define THREADS 5
+#define RECORDS (100000/THREADS)
+#define TORTURETEST 1
+
+static int whichmalloc;
+static int doRealloc;
+static struct threadstuff_t
+{
+ int ops;
+ unsigned int *toalloc;
+ void **allocs;
+ char cachesync1[128];
+ int done;
+ char cachesync2[128];
+} threadstuff[THREADS];
+
+static void threadcode(int);
+
+#ifdef WIN32
+#include <winnt.h>
+
+static DWORD WINAPI _threadcode(LPVOID a)
+{
+ threadcode((int)(size_t) a);
+ return 0;
+}
+#define THREADVAR HANDLE
+#define THREADINIT(v, id) (*v=CreateThread(NULL, 0, _threadcode, (LPVOID)(size_t) id, 0, NULL))
+#define THREADSLEEP(v) SleepEx(v, FALSE)
+#define THREADWAIT(v) (WaitForSingleObject(v, INFINITE), 0)
+
+typedef unsigned __int64 usCount;
+static FORCEINLINE usCount GetUsCount()
+{
+ static LARGE_INTEGER ticksPerSec;
+ static double scalefactor;
+ LARGE_INTEGER val;
+ if(!scalefactor)
+ {
+ if(QueryPerformanceFrequency(&ticksPerSec))
+ scalefactor=ticksPerSec.QuadPart/1000000000000.0;
+ else
+ scalefactor=1;
+ }
+ if(!QueryPerformanceCounter(&val))
+ return (usCount) GetTickCount() * 1000000000;
+ return (usCount) (val.QuadPart/scalefactor);
+}
+
+static HANDLE win32heap;
+static void *win32malloc(size_t size)
+{
+ return HeapAlloc(win32heap, 0, size);
+}
+static void *win32realloc(void *p, size_t size)
+{
+ return HeapReAlloc(win32heap, 0, p, size);
+}
+static void win32free(void *mem)
+{
+ HeapFree(win32heap, 0, mem);
+}
+
+static void *(*const mallocs[])(size_t size)={ malloc, nedmalloc, win32malloc };
+static void *(*const reallocs[])(void *p, size_t size)={ realloc, nedrealloc, win32realloc };
+static void (*const frees[])(void *mem)={ free, nedfree, win32free };
+#else
+static void *_threadcode(void *a)
+{
+ threadcode((int)(size_t) a);
+ return 0;
+}
+#define THREADVAR pthread_t
+#define THREADINIT(v, id) pthread_create(v, NULL, _threadcode, (void *)(size_t) id)
+#define THREADSLEEP(v) usleep(v*1000)
+#define THREADWAIT(v) pthread_join(v, NULL)
+
+typedef unsigned long long usCount;
+static FORCEINLINE usCount GetUsCount()
+{
+ struct timeval tv;
+ gettimeofday(&tv, 0);
+ return ((usCount) tv.tv_sec*1000000000000LL)+tv.tv_usec*1000000LL;
+}
+
+static void *(*const mallocs[])(size_t size)={ malloc, nedmalloc };
+static void *(*const reallocs[])(void *p, size_t size)={ realloc, nedrealloc };
+static void (*const frees[])(void *mem)={ free, nedfree };
+#endif
+static usCount times[THREADS];
+
+
+static FORCEINLINE unsigned int myrandom(unsigned int *seed)
+{
+ *seed=1664525UL*(*seed)+1013904223UL;
+ return *seed;
+}
+
+static void threadcode(int threadidx)
+{
+ int n;
+ unsigned int *toallocptr=threadstuff[threadidx].toalloc;
+ void **allocptr=threadstuff[threadidx].allocs;
+ unsigned int seed=threadidx;
+ usCount start;
+ threadstuff[threadidx].done=0;
+ /*neddisablethreadcache(0);*/
+ THREADSLEEP(100);
+ start=GetUsCount();
+#ifdef TORTURETEST
+ /* A randomised malloc/realloc/free test (torture test) */
+ for(n=0; n<RECORDS*100; n++)
+ {
+ unsigned int r=myrandom(&seed), i;
+ i=(int)(r % RECORDS);
+ if(!allocptr[i])
+ {
+ allocptr[i]=mallocs[whichmalloc](r & 0x1FFF);
+ threadstuff[threadidx].ops++;
+ }
+ else if(r & (1<<31))
+ {
+ allocptr[i]=reallocs[whichmalloc](allocptr[i], r & 0x1FFF);
+ threadstuff[threadidx].ops++;
+ }
+ else
+ {
+ frees[whichmalloc](allocptr[i]);
+ allocptr[i]=0;
+ }
+ }
+ for(n=0; n<RECORDS; n++)
+ {
+ if(allocptr[n])
+ {
+ frees[whichmalloc](allocptr[n]);
+ allocptr[n]=0;
+ }
+ }
+#else
+ /* A simple stack which allocates and deallocates off the top (speed test) */
+ for(n=0; n<RECORDS;)
+ {
+#if 1
+ r=myrandom(&seed);
+ if(allocptr>threadstuff[threadidx].allocs && (r & 65535)<32760) /*<32760)*/
+ { /* free */
+ --toallocptr;
+ --allocptr;
+ --n;
+ frees[whichmalloc](*allocptr);
+ *allocptr=0;
+ }
+ else
+#endif
+ {
+ if(doRealloc && allocptr>threadstuff[threadidx].allocs && (r & 1))
+ {
+ allocptr[-1]=reallocs[whichmalloc](allocptr[-1], *toallocptr);
+ }
+ else
+ {
+ allocptr[0]=mallocs[whichmalloc](*toallocptr);
+ allocptr++;
+ }
+ n++;
+ toallocptr++;
+ threadstuff[threadidx].ops++;
+ }
+ }
+ while(allocptr>threadstuff[threadidx].allocs)
+ {
+ frees[whichmalloc](*--allocptr);
+ }
+#endif
+ times[threadidx]+=GetUsCount()-start;
+ neddisablethreadcache(0);
+ threadstuff[threadidx].done=1;
+}
+
+static double runtest()
+{
+ unsigned int seed=1;
+ int n, i;
+ double opspersec=0;
+ THREADVAR threads[THREADS];
+ for(n=0; n<THREADS; n++)
+ {
+ unsigned int *toallocptr;
+ int m;
+ threadstuff[n].ops=0;
+ times[n]=0;
+ threadstuff[n].toalloc=toallocptr=(unsigned int *)calloc(RECORDS, sizeof(unsigned int));
+ threadstuff[n].allocs=(void **)calloc(RECORDS, sizeof(void *));
+ for(m=0; m<RECORDS; m++)
+ {
+ unsigned int size=myrandom(&seed);
+ if(size<(1<<30))
+ { /* Make it two power multiple of less than 512 bytes to
+ model frequent C++ new's */
+ size=4<<(size & 7);
+ }
+ else
+ {
+ size&=0x3FFF; /* < 16Kb */
+ /*size&=0x1FFF;*/ /* < 8Kb */
+ /*size=(1<<6)<<(size & 7);*/ /* < 8Kb */
+ }
+ *toallocptr++=size;
+ }
+ }
+#ifdef TORTURETEST
+ for(n=0; n<THREADS; n++)
+ {
+ THREADINIT(&threads[n], n);
+ }
+ for(i=0; i<32; i++)
+ {
+ int found=-1;
+ do
+ {
+ for(n=0; n<THREADS; n++)
+ {
+ THREADSLEEP(100);
+ if(threadstuff[n].done)
+ {
+ found=n;
+ break;
+ }
+ }
+ } while(found<0);
+ THREADWAIT(threads[found]);
+ threads[found]=0;
+ THREADINIT(&threads[found], found);
+ printf("Relaunched thread %d\n", found);
+ }
+ for(n=THREADS-1; n>=0; n--)
+ {
+ THREADWAIT(threads[n]);
+ threads[n]=0;
+ }
+#else
+#if 1
+ for(n=0; n<THREADS; n++)
+ {
+ THREADINIT(&threads[n], n);
+ }
+ for(n=THREADS-1; n>=0; n--)
+ {
+ THREADWAIT(threads[n]);
+ threads[n]=0;
+ }
+#else
+ /* Quick realloc() test */
+ doRealloc=1;
+ for(n=0; n<THREADS; n++)
+ {
+ THREADINIT(&threads[n], n);
+ }
+ for(n=THREADS-1; n>=0; n--)
+ {
+ THREADWAIT(threads[n]);
+ threads[n]=0;
+ }
+#endif
+#endif
+ {
+ usCount totaltime=0;
+ int totalops=0;
+ for(n=0; n<THREADS; n++)
+ {
+ totaltime+=times[n];
+ totalops+=threadstuff[n].ops;
+ }
+ opspersec=1000000000000.0*totalops/totaltime*THREADS;
+ printf("This allocator achieves %lfops/sec under %d threads\n", opspersec, THREADS);
+ }
+ for(n=THREADS-1; n>=0; n--)
+ {
+ free(threadstuff[n].allocs); threadstuff[n].allocs=0;
+ free(threadstuff[n].toalloc); threadstuff[n].toalloc=0;
+ }
+ return opspersec;
+}
+
+int main(void)
+{
+ double std=0, ned=0;
+
+#if 0
+ {
+ usCount start, end;
+ start=GetUsCount();
+ THREADSLEEP(5000);
+ end=GetUsCount();
+ printf("Wait was %lf\n", (end-start)/1000000000000.0);
+ }
+#endif
+#ifdef WIN32
+ { /* Force load of user32.dll so we can debug */
+ BOOL v;
+ SystemParametersInfo(SPI_GETBEEP, 0, &v, 0);
+ }
+#endif
+
+ if(0)
+ {
+ printf("\nTesting standard allocator with %d threads ...\n", THREADS);
+ std=runtest();
+ }
+ if(1)
+ {
+ printf("\nTesting nedmalloc with %d threads ...\n", THREADS);
+ whichmalloc=1;
+ ned=runtest();
+ }
+#ifdef WIN32
+/*
+ if(0)
+ {
+ ULONG data=2;
+ win32heap=HeapCreate(0, 0, 0);
+ HeapSetInformation(win32heap, HeapCompatibilityInformation, &data, sizeof(data));
+ HeapQueryInformation(win32heap, HeapCompatibilityInformation, &data, sizeof(data), NULL);
+ if(2!=data)
+ {
+ printf("The win32 low frag allocator won't work under a debugger!\n");
+ }
+ else
+ {
+ printf("Testing win32 low frag allocator with %d threads ...\n\n", THREADS);
+ whichmalloc=2;
+ runtest();
+ }
+ HeapDestroy(win32heap);
+ }
+*/
+#endif
+ if(std && ned)
+ { // ned should have more ops/sec
+ printf("\n\nnedmalloc allocator is %lf times faster than standard\n", ned/std);
+ }
+ printf("\nPress a key to trim\n");
+ getchar();
+ nedmalloc_trim(0);
+#ifdef _MSC_VER
+ printf("\nPress a key to end\n");
+ getchar();
+#endif
+ return 0;
+}
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/libs/smart_ptr/example/local_pool_test2.cpp 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,25 @@
+/**
+ @file
+ local_pool_test2.cpp.
+*/
+
+
+#include <iostream>
+
+#include <boost/detail/local_pool.hpp>
+
+using namespace std;
+using namespace boost;
+
+
+int main(void)
+{
+ local_pool pool[2];
+
+ void * p = pool[0].malloc(10);
+
+ cout << (pool[0].is_from(p) ? "true" : "false") << endl;
+ cout << (pool[1].is_from(p) ? "true" : "false") << endl;
+
+ return 0;
+}
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/libs/smart_ptr/example/t100.h 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,171 @@
+/**
+ @file
+ T100 brain kernel.
+
+ @note
+ Copyright (c) 2008 Phil Bouchard <phil_at_[hidden]>.
+
+ 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
+
+ See http://www.boost.org/libs/smart_ptr/doc/index.html for documentation.
+*/
+
+
+#ifndef T100_HPP_INCLUDED
+#define T100_HPP_INCLUDED
+
+
+#include <vector>
+#include <string>
+#include <iostream>
+#include <boost/regex.hpp>
+#include <boost/block_ptr.hpp>
+
+
+namespace boost
+{
+
+namespace detail
+{
+
+namespace sh
+{
+
+
+struct neuron_base
+{
+ typedef boost::block_ptr<neuron_base> pointer;
+
+ enum sense_t {sight, sound, touch, smell, taste};
+
+ boost::regex exp_;
+ //std::vector< std::pair<double, pointer> > sub_;
+ std::pair<double, pointer> sub_[3];
+
+ neuron_base(std::string const & s) : exp_(s)/*, sub_(exp_.mark_count())*/ {}
+ virtual ~neuron_base() {};
+
+ virtual double operator () (std::string const & input) { return 0; };
+};
+
+
+/**
+ Core brain kernel.
+
+ @note
+ The brain kernel will have a thread running in the background to sort out
+ all confused neurons that didn't take any decisions yet. This should be
+ linked with the imaginative section of the brain which guesses over and
+ over (trials & errors) when to many regex occurences are present.
+*/
+
+template <neuron_base::sense_t>
+ class neuron : public neuron_base
+ {
+ // disable non-"block<neuron>" allocations:
+ void * operator new (size_t);
+
+ public:
+ typedef boost::block<neuron> pointee;
+
+ /**
+ The following should be one of these multimap indexed by:
+ - regular expression string
+ - weight
+ - emotional state weight (normal, angry, or scared)
+ */
+
+ typedef std::map<std::string, pointer> map_sn_t;
+
+ static map_sn_t search_;
+
+ neuron(std::string const & s, pointee * p1 = 0, pointee * p2 = 0, pointee * p3 = 0) : neuron_base(s)
+ {
+ /// FIXME
+ //search_[s] = (pointee *) (typename pointee::roofof) static_cast<neuron *>(rootof<is_polymorphic<neuron>::value>::get(this));
+
+ if (p1) sub_[0].second = p1;
+ if (p2) sub_[1].second = p2;
+ if (p3) sub_[2].second = p3;
+ }
+
+ double operator () (std::string const & input)
+ {
+ boost::match_results<std::string::const_iterator> what;
+
+ if (! boost::regex_match(input, what, exp_, boost::match_default | boost::match_partial))
+ return 0;
+
+ if (! what[0].matched)
+ return 0;
+
+ // ponderate
+ double accuracy = what.size() > 1 ? 0 : 1;
+ for (int i = 1; i < what.size(); i ++)
+ {
+ if (what[i].matched)
+ {
+ sub_[i - 1].first = (* sub_[i - 1].second)(what[i].str()) / (what.size() - 1);
+ accuracy += sub_[i - 1].first;
+ }
+ }
+
+/*
+ if (accuracy < .7)
+ return accuracy;
+*/
+
+ // learn if sounds equitable, God tells you to or "energy" spent is still low
+ for (int i = 1; i < what.size(); i ++)
+ if (what[i].matched)
+ {
+ if (sub_[i - 1].first == 0)
+ {
+ typename map_sn_t::iterator j = search_.find(what[i].str());
+
+ if (j != search_.end())
+ {
+ /**
+ What we should do here is to:
+ - cummulate suggestions
+ - calculate difference between all proposals
+ - create new regular expression when demand is too high
+ */
+ sub_[i - 1].second = j->second;
+ }
+ else
+ {
+ /**
+ Learn
+ */
+ sub_[i - 1].second->exp_ = sub_[i - 1].second->exp_.str() + "|" + input;
+ }
+ }
+ }
+
+ return accuracy;
+ }
+ };
+
+template <neuron_base::sense_t I>
+ typename neuron<I>::map_sn_t neuron<I>::search_;
+
+
+typedef neuron<neuron_base::sight> neuron_sight;
+typedef neuron<neuron_base::sound> neuron_sound;
+typedef neuron<neuron_base::touch> neuron_touch;
+typedef neuron<neuron_base::smell> neuron_smell;
+typedef neuron<neuron_base::taste> neuron_taste;
+
+
+} // namespace sh
+
+} // namespace detail
+
+} // namespace boost
+
+
+#endif
==============================================================================
--- (empty file)
+++ sandbox/block_ptr/libs/smart_ptr/example/t100_test1.cpp 2011-04-27 22:56:54 EDT (Wed, 27 Apr 2011)
@@ -0,0 +1,25 @@
+/**
+ @file
+ regex_test1.cpp
+*/
+
+#include <vector>
+#include <string>
+#include <iostream>
+#include <boost/regex.hpp>
+#include <boost/block_ptr.hpp>
+
+#include "t100.h"
+
+using namespace std;
+using namespace boost;
+using boost::detail::sh::neuron_sight;
+
+
+int main(int argv, char * argc[])
+{
+ block_ptr<neuron_sight> t100 = new block<neuron_sight>("I eat ([a-z]+) then drink ([a-z]+)", new block<neuron_sight>("beef|chicken"), new block<neuron_sight>("vodka|water"));
+
+ cout << (* t100)("I eat beef then drink wine") << endl;
+ cout << (* t100)("I eat beef then drink wine") << endl;
+}
