functions_selection.qbk 3.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172
  1. [/
  2. Copyright (c) 2008-2009 Joachim Faulhaber
  3. Distributed under the Boost Software License, Version 1.0.
  4. (See accompanying file LICENSE_1_0.txt or copy at
  5. http://www.boost.org/LICENSE_1_0.txt)
  6. ]
  7. [/ //= Selection ===================================================================]
  8. [section Selection]
  9. [table
  10. [[['*Selection*]] [__ch_itv_sets__][__ch_itv_maps__][__ch_ele_sets__][__ch_ele_maps__] [condition] ]
  11. [[`iterator T::find(const domain_type&)`] [ ] [ ] [__Olgn__] [__Olgn__] [] ]
  12. [[`const_iterator T::find(const domain_type&)const`] [__Olgn__] [__Olgn__] [__Olgn__] [__Olgn__] [] ]
  13. [[`const_iterator find(T&, const domain_type&)`] [__Olgn__] [__Olgn__] [ ] [ ] [] ]
  14. [[`const_iterator T::find(const interval_type&)const`] [__Olgn__] [__Olgn__] [ ] [ ] [] ]
  15. [[`const_iterator find(T&, const interval_type&)`] [__Olgn__] [__Olgn__] [ ] [ ] [] ]
  16. [[`codomain_type& operator[] (const domain_type&)`] [ ] [ ] [ ] [__Olgn__] [] ]
  17. [[`codomain_type operator() (const domain_type&)const`] [ ] [__Olgn__] [ ] [__Olgn__] [`is_total<T>::value`] ]
  18. ]
  19. * All time *complexities* are ['*logarithmic*] in the containers `iterative_size()`.
  20. * `operator()` is available for total maps only.
  21. * `interval_type` is also the interval container's `key_type`
  22. [table
  23. [[['*Selection*]] [Types] [Description] ]
  24. [[`iterator T::find(const domain_type& x)`] [__s __m] [Searches the container for the element `x` and return an iterator to it, if `x` is found.
  25. Otherwise `find` returns iterator `end()`.] ]
  26. [[`const_iterator T::find`\n
  27. `(const domain_type& x)const`] [__s __m] [Const version of `find` above.] ]
  28. [[`const_iterator T::find`\n
  29. `(const domain_type& x)const`\n\n
  30. `const_iterator find`\n
  31. `(T&, const domain_type& x)`] [__S __M]
  32. [For interval containers `c`, `c.find(x)` or `icl::find(c,x)` searches a key element `x` and
  33. returns an iterator to the interval containing the element `x`.] ]
  34. [[`const_iterator T::find`\n
  35. `(const interval_type& x)const`\n\n
  36. `const_iterator find`\n
  37. `(T&, const interval_type& x)`]
  38. [__S __M] [For interval containers `c`, `c.find(y)` or `icl::find(c,y)` searches an interval `y`
  39. and returns an iterator to the first interval in `c` that overlaps with `y`.] ]
  40. [[`codomain_type& operator[]`\n
  41. `(const domain_type& x)`] [__m ] [For the key element `x` the operator returns a reference to the mapped value.
  42. A pair `std::pair(x,codomain_type())` will be inserted, of `x` is not found in the map.] ]
  43. [[`codomain_type operator()`\n
  44. `(const domain_type& x)const`] [__M __m ] [Returns the mapped value for a key `x`. The operator is only available for ['*total*] maps. ] ]
  45. ]
  46. ['*See also . . .*]
  47. [table
  48. []
  49. [[[link boost_icl.function_reference.intersection ['*Intersection*]] ]]
  50. ]
  51. ['*Back to section . . .*]
  52. [table
  53. []
  54. [[[link function_synopsis_table ['*Function Synopsis*]] ]]
  55. [[[link boost_icl.interface ['*Interface*]] ]]
  56. ]
  57. [endsect][/ Selection]