boost-react-native-bundle

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0.1 Transitional//EN"> <html> <head> <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> <title>Boost.MultiIndex Documentation - Future work</title> <link rel="stylesheet" href="style.css" type="text/css"> <link rel="start" href="index.html"> <link rel="prev" href="tests.html"> <link rel="up" href="index.html"> <link rel="next" href="release_notes.html"> </head> <body> <h1><img src="../../../boost.png" alt="boost.png (6897 bytes)" align= "middle" width="277" height="86">Boost.MultiIndex Future work</h1> <div class="prev_link"><a href="tests.html"><img src="prev.gif" alt="tests" border="0"> Tests </a></div> <div class="up_link"><a href="index.html"><img src="up.gif" alt="index" border="0"> Index </a></div> <div class="next_link"><a href="release_notes.html"><img src="next.gif" alt="release notes" border="0"> Release notes </a></div> <hr> A number of new functionalities are considered for inclusion into future releases of Boost.MultiIndex. Some of them depend on the potential for extensibility of the library, which has been a guiding principle driving the current internal design of <code>multi_index_container</code>. <h2>Contents</h2> <ul> <li><a href="#ranked_indices">Ranked indices</a></li> <li><a href="#notifying">Notifying indices</a></li> <li><a href="#constraints">Constraints</a></li> <li><a href="#user_defined_indices">User-defined indices</a></li> <li><a href="#indexed_maps">Indexed maps</a></li> </ul> <h2><a name="ranked_indices">Ranked indices</a></h2> Ordered indices are implemented using red-black trees; these trees can be augmented with additional information to obtain a type of data structure called <a href="http://pine.cs.yale.edu/pinewiki/OrderStatisticsTree">order-statistics trees</a>, allowing for logarithmic search of the n-th element. It has been proposed that order-statistics trees be used to devise a new type of ranked indices that support <code>operator[]</code> while retaining the functionality of ordered indices. <h2><a name="notifying">Notifying indices</a></h2> Notifying indices can be implemented as decorators over preexistent index types, with the added functionality that internal events of the index (insertion, erasing, modifying of elements) are signalled to an external entity --for instance, by means of the <a href="../../../doc/html/signals.html">Boost.Signals</a> library. This functionality can have applications for: <ol> <li>Logging,</li> <li>interfacing to GUI-based applications,</li> <li>synchronization between separate data structures.</li> </ol> The following is a sketch of a possible realization of notifying indices: <blockquote><pre> struct insert_log { void operator()(int x) { std::clog<<"insert: "<<x<<std::endl; } }; int main() { typedef multi_index_container< int, indexed_by< notifying<ordered_unique<identity<int> > >, // notifying index ordered_non_unique<identity<int> > > > indexed_t; indexed_t t; // on_insert is the signal associated to insertions t.on_insert.connect(insert_log()); t.insert(0); t.insert(1); return 0; } // output: // insert: 0 // insert: 1 </pre></blockquote> <h2><a name="constraints">Constraints</a></h2> The notifying indices functionality described above exploits a powerful design pattern based on index adaptors, decorators over preexistent indices which add some functionality or somehow change the semantics of the underlying index. This pattern can be used for the implementation of constraints, adaptors that restrict the elements accepted by an index according to some validation predicate. The following is a possible realization of how constraints syntax may look like: <blockquote><pre> struct is_even { bool operator()(int x)const{return x%2==0;} }; typedef multi_index_container< int, indexed_by< constrained<ordered_unique<identity<int> >,is_even> > > indexed_t; </pre></blockquote> <h2><a name="user_defined_indices">User-defined indices</a></h2> The mechanisms by which Boost.MultiIndex orchestrates the operations of the indices held by a <code>multi_index_container</code> are simple enough to make them worth documenting so that the (bold) user can write implementations for her own indices. <h2><a name="indexed_maps">Indexed maps</a></h2> <code>multi_index_container</code> is rich enough to provide the basis for implementation of indexed maps, i.e. maps which can be looked upon several different keys. The motivation for having such a container is mainly aesthetic convenience, since it would not provide any additional feature to similar constructs based directly on <code>multi_index_container</code>. The main challenge in writing an indexed map lies in the design of a reasonable interface that resembles that of <code>std::map</code> as much as possible. There seem to be fundamental difficulties in extending the syntax of a <code>std::map</code> to multiple keys. For one example, consider the situation: <blockquote><pre> indexed_map<int,string,double> m; // keys are int and string, double is the mapped to value ... cout<<m[0]<<endl; // OK cout<<m["zero"]<<endl; // OK m[1]=1.0; // !! </pre></blockquote> In the last sentence of the example, the user has no way of providing the <code>string</code> key mapping to the same value as <code>m[1]</code>. This and similar problems have to be devoted a careful study when designing the interface of a potential indexed map. <hr> <div class="prev_link"><a href="tests.html"><img src="prev.gif" alt="tests" border="0"> Tests </a></div> <div class="up_link"><a href="index.html"><img src="up.gif" alt="index" border="0"> Index </a></div> <div class="next_link"><a href="release_notes.html"><img src="next.gif" alt="release notes" border="0"> Release notes </a></div> Revised July 6th 2013 © Copyright 2003-2013 Joaquín M López Muñoz. Distributed under the Boost Software License, Version 1.0. (See accompanying file <a href="../../../LICENSE_1_0.txt"> LICENSE_1_0.txt</a> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"> http://www.boost.org/LICENSE_1_0.txt</a>) </body> </html>