105 lines
19 KiB

  1. <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
  2. <html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
  3. <title>Member List</title>
  4. <link href="doxygen.css" rel="stylesheet" type="text/css">
  5. <link href="tabs.css" rel="stylesheet" type="text/css">
  6. </head><body>
  7. <!-- Generated by Doxygen 1.4.7 -->
  8. <div class="tabs">
  9. <ul>
  10. <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
  11. <li><a href="modules.html"><span>Modules</span></a></li>
  12. <li><a href="namespaces.html"><span>Namespaces</span></a></li>
  13. <li id="current"><a href="annotated.html"><span>Classes</span></a></li>
  14. <li><a href="files.html"><span>Files</span></a></li>
  15. <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
  16. </ul></div>
  17. <div class="tabs">
  18. <ul>
  19. <li><a href="annotated.html"><span>Class&nbsp;List</span></a></li>
  20. <li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>
  21. <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>
  22. </ul></div>
  23. <h1>tbb::concurrent_vector&lt; T, A &gt; Member List</h1>This is the complete list of members for <a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a>, including all inherited members.<p><table>
  24. <tr bgcolor="#f0f0f0"><td><b>allocator_type</b> typedef (defined in <a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a>)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td></td></tr>
  25. <tr class="memlist"><td><a class="el" href="a00288.html#423e5aa15e0e3309ad86d026fd85f6f6">assign</a>(size_type n, const_reference t)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  26. <tr class="memlist"><td><a class="el" href="a00288.html#93a06b3112cb804f42f40efb5e7387b4">assign</a>(I first, I last)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  27. <tr class="memlist"><td><a class="el" href="a00288.html#c04d64fe86696a084afa117d34384b5f">assign</a>(std::initializer_list&lt; T &gt; init_list)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  28. <tr class="memlist"><td><a class="el" href="a00288.html#0c073ca43e787c7cbf7b0e26d2221748">at</a>(size_type index)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  29. <tr class="memlist"><td><a class="el" href="a00288.html#23e14a38af748edff96a7adc3a0f1c58">at</a>(size_type index) const </td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  30. <tr class="memlist"><td><a class="el" href="a00288.html#41ce48d6015a1a2812d41cf620ec3476">back</a>()</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  31. <tr class="memlist"><td><a class="el" href="a00288.html#bd518e204107d07fd08d0ec5bdfd383d">back</a>() const </td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  32. <tr class="memlist"><td><a class="el" href="a00288.html#730b23a251ecb6d37f692fb22f38e029">begin</a>()</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  33. <tr class="memlist"><td><a class="el" href="a00288.html#78a06182276ff758788d4c0623ae0d71">begin</a>() const </td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  34. <tr class="memlist"><td><a class="el" href="a00288.html#3ed6b9ae7217af5103d974045b6f5cd5">capacity</a>() const </td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  35. <tr class="memlist"><td><a class="el" href="a00288.html#f88fcf1c920693c39bd9709db33c199f">cbegin</a>() const </td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  36. <tr class="memlist"><td><a class="el" href="a00288.html#0c15a5d0f1cf75d687dabba07da1d46b">cend</a>() const </td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  37. <tr class="memlist"><td><a class="el" href="a00288.html#26f937a359a66b6aae904c3cd9a3c444">clear</a>()</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  38. <tr class="memlist"><td><a class="el" href="a00288.html#1693d1da41b1a8235871be9c6633be35">compact</a>()</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  39. <tr class="memlist"><td><a class="el" href="a00288.html#2c8ca9cabfcd30ad5943324c853664b5">concurrent_vector</a>(const allocator_type &amp;a=allocator_type())</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline, explicit]</code></td></tr>
  40. <tr class="memlist"><td><a class="el" href="a00288.html#4b4937fc82ba4c8245a87a079476d80a">concurrent_vector</a>(std::initializer_list&lt; T &gt; init_list, const allocator_type &amp;a=allocator_type())</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  41. <tr class="memlist"><td><a class="el" href="a00288.html#dd8a200b99a8088435a37934b58fe335">concurrent_vector</a>(const concurrent_vector &amp;vector, const allocator_type &amp;a=allocator_type())</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  42. <tr class="memlist"><td><a class="el" href="a00288.html#64432f13f7b29bfe4acfb5568f34f3a8">concurrent_vector</a>(const concurrent_vector&lt; T, M &gt; &amp;vector, const allocator_type &amp;a=allocator_type())</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  43. <tr class="memlist"><td><a class="el" href="a00288.html#2a2e261dfe1cab3f73f7b1a94137cfca">concurrent_vector</a>(size_type n)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline, explicit]</code></td></tr>
  44. <tr class="memlist"><td><a class="el" href="a00288.html#3883a8a908b44e249a57f454de3f55d8">concurrent_vector</a>(size_type n, const_reference t, const allocator_type &amp;a=allocator_type())</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  45. <tr class="memlist"><td><a class="el" href="a00288.html#4450de83c5862ea4bcd9443fd7e67419">concurrent_vector</a>(I first, I last, const allocator_type &amp;a=allocator_type())</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  46. <tr bgcolor="#f0f0f0"><td><b>const_iterator</b> typedef (defined in <a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a>)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td></td></tr>
  47. <tr bgcolor="#f0f0f0"><td><b>const_pointer</b> typedef (defined in <a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a>)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td></td></tr>
  48. <tr bgcolor="#f0f0f0"><td><b>const_range_type</b> typedef (defined in <a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a>)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td></td></tr>
  49. <tr bgcolor="#f0f0f0"><td><b>const_reference</b> typedef (defined in <a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a>)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td></td></tr>
  50. <tr bgcolor="#f0f0f0"><td><b>const_reverse_iterator</b> typedef (defined in <a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a>)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td></td></tr>
  51. <tr bgcolor="#f0f0f0"><td><b>const_reverse_iterator</b> typedef (defined in <a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a>)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td></td></tr>
  52. <tr class="memlist"><td><a class="el" href="a00288.html#db78a1d28c9c966050e8a2926d834a33">crbegin</a>() const </td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  53. <tr class="memlist"><td><a class="el" href="a00288.html#fff9cece89438587997ebedf93c5e962">crend</a>() const </td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  54. <tr bgcolor="#f0f0f0"><td><b>difference_type</b> typedef (defined in <a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a>)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td></td></tr>
  55. <tr class="memlist"><td><a class="el" href="a00288.html#c6426cb93cf20d3af40f3c90f1f0481a">empty</a>() const </td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  56. <tr class="memlist"><td><a class="el" href="a00288.html#c0b51160e5a764982ec97a455f94f2c6">end</a>()</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  57. <tr class="memlist"><td><a class="el" href="a00288.html#1e6aa764ce5a1cbd24526f68bc0a2f6b">end</a>() const </td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  58. <tr class="memlist"><td><a class="el" href="a00288.html#15181759c0bfa2ddce5d10c7550e0002">front</a>()</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  59. <tr class="memlist"><td><a class="el" href="a00288.html#502615a858eb9fa0390ee59169065e90">front</a>() const </td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  60. <tr class="memlist"><td><a class="el" href="a00288.html#2fdba8e90de6a4d2300222236d46758e">get_allocator</a>() const </td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  61. <tr class="memlist"><td><a class="el" href="a00288.html#30484e3959892fd5392fa93c873c31f0">grow_by</a>(size_type delta)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  62. <tr class="memlist"><td><a class="el" href="a00288.html#c8177b1865270ea68aa1ab9148e5e35e">grow_by</a>(size_type delta)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  63. <tr class="memlist"><td><a class="el" href="a00288.html#38274ab3f772ecba600c7daca7690102">grow_by</a>(size_type delta, const_reference t)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  64. <tr class="memlist"><td><a class="el" href="a00288.html#473a59a4c9308b93411b898b3110d26c">grow_by</a>(size_type delta, const_reference t)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  65. <tr class="memlist"><td><a class="el" href="a00288.html#47fe588214dd5fa06ab6e8ab78d83874">grow_to_at_least</a>(size_type n)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  66. <tr class="memlist"><td><a class="el" href="a00288.html#a7e3b67c8ccab16d0aecc80899ae799d">grow_to_at_least</a>(size_type n)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  67. <tr bgcolor="#f0f0f0"><td><b>internal::vector_iterator</b> (defined in <a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a>)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [friend]</code></td></tr>
  68. <tr bgcolor="#f0f0f0"><td><b>internal_vector_base</b>() const (defined in <a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a>)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  69. <tr bgcolor="#f0f0f0"><td><b>iterator</b> typedef (defined in <a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a>)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td></td></tr>
  70. <tr class="memlist"><td><a class="el" href="a00288.html#2c248a017f0576df3e7cd99627836fd6">max_size</a>() const </td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  71. <tr class="memlist"><td><a class="el" href="a00288.html#691f0f3cda3e489c37a657016e375eaf">operator=</a>(const concurrent_vector &amp;vector)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  72. <tr class="memlist"><td><a class="el" href="a00288.html#19f4ab88a01b0fd056af3bba463e7bd6">operator=</a>(const concurrent_vector&lt; T, M &gt; &amp;vector)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  73. <tr class="memlist"><td><a class="el" href="a00288.html#85cc876b1dec457b831b4745be274be1">operator=</a>(const std::initializer_list&lt; T &gt; &amp;init_list)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  74. <tr class="memlist"><td><a class="el" href="a00288.html#4c52f2950bb1832886bd4458eb09d7eb">operator[]</a>(size_type index)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  75. <tr class="memlist"><td><a class="el" href="a00288.html#c6fade5c732cc95274d1d8277ea619d1">operator[]</a>(size_type index) const </td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  76. <tr bgcolor="#f0f0f0"><td><b>pointer</b> typedef (defined in <a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a>)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td></td></tr>
  77. <tr class="memlist"><td><a class="el" href="a00288.html#e94e038f915c0268fdf2d3d7f87d81b8">push_back</a>(const_reference item) iterator push_back(const _reference item)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  78. <tr class="memlist"><td><a class="el" href="a00288.html#a4c6ffff3bf08b92939aa2fc516edfba">range</a>(size_t grainsize=1)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  79. <tr class="memlist"><td><a class="el" href="a00288.html#3d09ccfb581b879ae64203741035e193">range</a>(size_t grainsize=1) const </td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  80. <tr bgcolor="#f0f0f0"><td><b>range_type</b> typedef (defined in <a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a>)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td></td></tr>
  81. <tr class="memlist"><td><a class="el" href="a00288.html#5e220926d09236d98f04fe0721e5f9a1">rbegin</a>()</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  82. <tr class="memlist"><td><a class="el" href="a00288.html#9f9c103e18d5f212703805354074ad44">rbegin</a>() const </td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  83. <tr bgcolor="#f0f0f0"><td><b>reference</b> typedef (defined in <a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a>)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td></td></tr>
  84. <tr class="memlist"><td><a class="el" href="a00288.html#290119a4eb43cd6a9e98fa17016ba3c2">rend</a>()</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  85. <tr class="memlist"><td><a class="el" href="a00288.html#d438b9b32ea3a8ffb703015b6dce055b">rend</a>() const </td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  86. <tr class="memlist"><td><a class="el" href="a00288.html#5a0ce05026994b010018f72cfdeb72c1">reserve</a>(size_type n)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  87. <tr class="memlist"><td><a class="el" href="a00288.html#8dfb0cb0eef96d440b4dcf801807a718">resize</a>(size_type n)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  88. <tr class="memlist"><td><a class="el" href="a00288.html#98ce6b2c6d2622f0c030b46dfac3880c">resize</a>(size_type n, const_reference t)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  89. <tr bgcolor="#f0f0f0"><td><b>reverse_iterator</b> typedef (defined in <a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a>)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td></td></tr>
  90. <tr bgcolor="#f0f0f0"><td><b>reverse_iterator</b> typedef (defined in <a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a>)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td></td></tr>
  91. <tr class="memlist"><td><a class="el" href="a00288.html#03c6f4cf66532bf4cc907ee738a9a186">shrink_to_fit</a>()</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td></td></tr>
  92. <tr class="memlist"><td><a class="el" href="a00288.html#715fe313c4a9c22731cc404dd80c9ec9">size</a>() const </td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  93. <tr bgcolor="#f0f0f0"><td><b>size_type</b> typedef (defined in <a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a>)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td></td></tr>
  94. <tr class="memlist"><td><a class="el" href="a00288.html#96c9c4bd968ed3edb8dd276854d2dae0">swap</a>(concurrent_vector &amp;vector)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  95. <tr bgcolor="#f0f0f0"><td><b>value_type</b> typedef (defined in <a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a>)</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td></td></tr>
  96. <tr class="memlist"><td><a class="el" href="a00288.html#da2444b28bb840d38f60d0030333a5fc">~concurrent_vector</a>()</td><td><a class="el" href="a00288.html">tbb::concurrent_vector&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  97. </table><hr>
  98. <p></p>
  99. Copyright &copy; 2005-2013 Intel Corporation. All Rights Reserved.
  100. <p></p>
  101. Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
  102. registered trademarks or trademarks of Intel Corporation or its
  103. subsidiaries in the United States and other countries.
  104. <p></p>
  105. * Other names and brands may be claimed as the property of others.