на главную | войти | регистрация | DMCA | контакты | справка |      
mobile | donate | ВЕСЕЛКА

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
А Б В Г Д Е Ж З И Й К Л М Н О П Р С Т У Ф Х Ц Ч Ш Щ Э Ю Я


моя полка | жанры | рекомендуем | рейтинг книг | рейтинг авторов | впечатления | новое | форум | сборники | читалки | авторам | добавить
фантастика
космическая фантастика
фантастика ужасы
фэнтези
проза
  военная
  детская
  русская
детектив
  боевик
  детский
  иронический
  исторический
  политический
вестерн
приключения (исторический)
приключения (детская лит.)
детские рассказы
женские романы
религия
античная литература
Научная и не худ. литература
биография
бизнес
домашние животные
животные
искусство
история
компьютерная литература
лингвистика
математика
религия
сад-огород
спорт
техника
публицистика
философия
химия
close

Standard Template Library Programmer`s Guide

Standard Template Library Programmer`s Guide
Название: Standard Template Library Programmer`s Guide
Автор:_нехудлит
Оценка: 5.0 из 5, проголосовало читателей - 8
Серия:_проф/_компьютер
Жанр: компьютерная литература, справочники
Описание:This document contains reference on SGI STL implementation
Издание:1994 г.
Содержание:

скрыть содержание

  1. Introduction to the Standard Template Library
  2. Containers and algorithms
  3. Iterators
  4. Concepts and Modeling
  5. Refinement
  6. Other parts of the STL
  7. How to use the STL documentation
  8. Classification of STL components
  9. Using the STL documentation
  10. The format of a concept page
  11. The format of a type page
  12. The format of a function page
  13. Containers
  14. Concepts
  15. General concepts
  16. Container
  17. Description
  18. Refinement of
  19. Associated types
  20. Notation
  21. Definitions
  22. Valid expressions
  23. Expression semantics
  24. Complexity guarantees
  25. Invariants
  26. Models
  27. Notes
  28. See also
  29. Forward Container
  30. Description
  31. Associated types
  32. Notation
  33. Valid expressions
  34. Expression semantics
  35. Complexity guarantees
  36. Invariants
  37. Models
  38. See also
  39. Reversible Container
  40. Description
  41. Refinement of
  42. Associated types
  43. Notation
  44. Valid expressions
  45. Expression semantics
  46. Complexity guarantees
  47. Invariants
  48. Models
  49. Notes
  50. See also
  51. Random Access Container
  52. Description
  53. Refinement of
  54. Associated types
  55. Notation
  56. Valid expressions
  57. Expression semantics
  58. Complexity guarantees
  59. Invariants
  60. Models
  61. See also
  62. Sequences
  63. Sequence
  64. Description
  65. Refinement of
  66. Associated types
  67. Notation
  68. Definitions
  69. Valid expressions
  70. Expression semantics
  71. Complexity guarantees
  72. Models
  73. Notes
  74. See also
  75. Front Insertion Sequence
  76. Description
  77. Refinement of
  78. Associated types
  79. Notation
  80. Valid expressions
  81. Expression semantics
  82. Complexity guarantees
  83. Invariants
  84. Models
  85. Notes
  86. See also
  87. Back Insertion Sequence
  88. Description
  89. Refinement of
  90. Associated types
  91. Notation
  92. Valid expressions
  93. Expression semantics
  94. Complexity guarantees
  95. Invariants
  96. Models
  97. Notes
  98. See also
  99. Associative Containers
  100. Associative Container
  101. Description
  102. Refinement of
  103. Associated types
  104. Notation
  105. Definitions
  106. Valid expressions
  107. Expression semantics
  108. Complexity guarantees
  109. Invariants
  110. Models
  111. Notes
  112. See also
  113. Simple Associative Container
  114. Description
  115. Refinement of
  116. Associated types
  117. Notation
  118. Valid expressions
  119. Invariants
  120. Models
  121. Notes
  122. See also
  123. Pair Associative Container
  124. Description
  125. Refinement of
  126. Associated types
  127. Notation
  128. Valid expressions
  129. Models
  130. Notes
  131. See also
  132. Sorted Associative Container
  133. Description
  134. Refinement of
  135. Associated types
  136. Notation
  137. Valid expressions
  138. Expression semantics
  139. Complexity guarantees
  140. Invariants
  141. Models
  142. Notes
  143. See also
  144. Hashed Associative Container
  145. Description
  146. Refinement of
  147. Associated types
  148. Notation
  149. Definitions
  150. Valid expressions
  151. Expression semantics
  152. Complexity guarantees
  153. Models
  154. Notes
  155. See also
  156. Hash Function
  157. Description
  158. Refinement of
  159. Associated types
  160. Valid expressions
  161. Invariants
  162. Models
  163. Notes
  164. See also
  165. Unique Associative Container
  166. Description
  167. Refinement of
  168. Associated types
  169. Notation
  170. Valid expressions
  171. Expression semantics
  172. Complexity guarantees
  173. Invariants
  174. Models
  175. Notes
  176. See also
  177. Multiple Associative Container
  178. Description
  179. Refinement of
  180. Associated types
  181. Notation
  182. Valid expressions
  183. Expression semantics
  184. Complexity guarantees
  185. Models
  186. Notes
  187. See also
  188. Unique Sorted Associative Container
  189. Description
  190. Refinement of
  191. Associated types
  192. Notation
  193. Valid expressions
  194. Expression semantics
  195. Complexity guarantees
  196. Invariants
  197. Models
  198. Notes
  199. See also
  200. Multiple Sorted Associative Container
  201. Description
  202. Refinement of
  203. Associated types
  204. Notation
  205. Valid expressions
  206. Expression semantics
  207. Complexity guarantees
  208. Models
  209. Notes
  210. See also
  211. Unique Hashed Associative Container
  212. Description
  213. Refinement of
  214. Associated types
  215. Notation
  216. Valid expressions
  217. Expression semantics
  218. Complexity guarantees
  219. Models
  220. Notes
  221. See also
  222. Multiple Hashed Associative Container
  223. Description
  224. Refinement of
  225. Associated types
  226. Notation
  227. Valid expressions
  228. Expression semantics
  229. Complexity guarantees
  230. Models
  231. Notes
  232. See also
  233. Container classes
  234. Sequences
  235. vector < T, Alloc >
  236. Description
  237. Example
  238. Definition
  239. Template parameters
  240. Model of
  241. Type requirements
  242. Public base classes
  243. Members
  244. New members
  245. Notes
  246. See also
  247. deque < T, Alloc >
  248. Description
  249. Example
  250. Definition
  251. Template parameters
  252. Model of
  253. Type requirements
  254. Public base classes
  255. Members
  256. New members
  257. Notes
  258. See also
  259. list < T, Alloc >
  260. Description
  261. Example
  262. Template parameters
  263. Model of
  264. Type requirements
  265. Public base classes
  266. Members
  267. New members
  268. Notes
  269. See also
  270. slist < T, Alloc >
  271. Description
  272. Definition
  273. Example
  274. Template parameters
  275. Model of
  276. Type requirements
  277. Public base classes
  278. Members
  279. New members
  280. Notes
  281. See also
  282. bit_vector
  283. Description
  284. Example
  285. Definition
  286. Template parameters
  287. Model of
  288. Type requirements
  289. Public base classes
  290. Members
  291. New members
  292. Notes
  293. See also
  294. Associative Containers
  295. set < Key, Compare, Alloc >
  296. Description
  297. Example
  298. Definition
  299. Template parameters
  300. Model of
  301. Type requirements
  302. Public base classes
  303. Members
  304. New members
  305. Notes
  306. See also
  307. map < Key, Data, Compare, Alloc >
  308. Description
  309. Example
  310. Definition
  311. Template parameters
  312. Model of
  313. Type requirements
  314. Public base classes
  315. Members
  316. New members
  317. Notes
  318. See also
  319. multiset < Key, Compare, Alloc >
  320. Description
  321. Example
  322. Definition
  323. Template parameters
  324. Model of
  325. Type requirements
  326. Public base classes
  327. Members
  328. New members
  329. Notes
  330. See also
  331. multimap < Key, Data, Compare, Alloc >
  332. Description
  333. Example
  334. Definition
  335. Template parameters
  336. Model of
  337. Type requirements
  338. Public base classes
  339. Members
  340. New members
  341. Notes
  342. See also
  343. hash_set < Key, HashFcn, EqualKey, Alloc >
  344. Description
  345. Example
  346. Definition
  347. Template parameters
  348. Model of
  349. Type requirements
  350. Public base classes
  351. Members
  352. New members
  353. Notes
  354. See also
  355. hash_map < Key, Data, HashFcn, EqualKey, Alloc >
  356. Description
  357. Example
  358. Definition
  359. Template parameters
  360. Model of
  361. Type requirements
  362. Public base classes
  363. Members
  364. New members
  365. Notes
  366. See also
  367. hash_multiset < Key, HashFcn, EqualKey, Alloc >
  368. Description
  369. Example
  370. Definition
  371. Template parameters
  372. Model of
  373. Type requirements
  374. Public base classes
  375. Members
  376. New members
  377. Notes
  378. See also
  379. hash_multimap < Key, Data, HashFcn, EqualKey, Alloc >
  380. Description
  381. Example
  382. Definition
  383. Template parameters
  384. Model of
  385. Type requirements
  386. Public base classes
  387. Members
  388. New members
  389. Notes
  390. See also
  391. hash < T >
  392. Description
  393. Example
  394. Definition
  395. Template parameters
  396. Model of
  397. Type requirements
  398. Public base classes
  399. Members
  400. New members
  401. Notes
  402. See also
  403. String package
  404. Character Traits
  405. Description
  406. Refinement of
  407. Associated types
  408. Notation
  409. Valid Expressions
  410. Expression semantics
  411. Complexity guarantees
  412. Models
  413. See also
  414. char_traits
  415. Description
  416. Example
  417. Definition
  418. Template parameters
  419. Model of
  420. Type requirements
  421. Public base classes
  422. Members
  423. New members
  424. See also
  425. basic_string < charT, traits, Alloc >
  426. Description
  427. Example
  428. Definition
  429. Template parameters
  430. Model of
  431. Type requirements
  432. Public base classes
  433. Members
  434. New members
  435. See also
  436. rope < T, Alloc >
  437. Description
  438. Definition
  439. Example
  440. Template parameters
  441. Model of
  442. Type requirements
  443. Public base classes
  444. Members
  445. New members
  446. Notes
  447. See also
  448. Container adaptors
  449. stack < T, Sequence >
  450. Description
  451. Example
  452. Definition
  453. Template parameters
  454. Model of
  455. Type requirements
  456. Public base classes
  457. Members
  458. New members
  459. Notes
  460. See also
  461. queue < T, Sequence >
  462. Description
  463. Example
  464. Definition
  465. Template parameters
  466. Model of
  467. Type requirements
  468. Public base classes
  469. Members
  470. New members
  471. Notes
  472. See also
  473. priority_queue < T, Sequence, Compare >
  474. Description
  475. Example
  476. Definition
  477. Template parameters
  478. Model of
  479. Type requirements
  480. Public base classes
  481. Members
  482. New members
  483. Notes
  484. See also
  485. bitset < N >
  486. Description
  487. Example
  488. Definition
  489. Template parameters
  490. Model of
  491. Type requirements
  492. Public base classes
  493. Members
  494. New members
  495. See also
  496. Iterators
  497. Introduction
  498. Summary
  499. Description
  500. Concepts
  501. Types
  502. Functions
  503. Notes
  504. Concepts
  505. Trivial Iterator
  506. Description
  507. Refinement of
  508. Associated types
  509. Notation
  510. Definitions
  511. Valid expressions
  512. Expression semantics
  513. Complexity guarantees
  514. Invariants
  515. Models
  516. Notes
  517. See also
  518. Input Iterator
  519. Description
  520. Refinement of
  521. Associated types
  522. Notation
  523. Definitions
  524. Valid expressions
  525. Expression semantics
  526. Complexity guarantees
  527. Models
  528. Notes
  529. See also
  530. Output Iterator
  531. Description
  532. Refinement of
  533. Associated types
  534. Notation
  535. Definitions
  536. Valid expressions
  537. Expression semantics
  538. Complexity guarantees
  539. Models
  540. See also
  541. Forward Iterator
  542. Description
  543. Refinement of
  544. Associated types
  545. Notation
  546. Valid expressions
  547. Expression semantics
  548. Complexity guarantees
  549. Models
  550. See also
  551. Bidirectional Iterator
  552. Description
  553. Refinement of
  554. Associated types
  555. Notation
  556. Valid expressions
  557. Expression Semantics
  558. Complexity guarantees
  559. Invariants
  560. Models
  561. See also
  562. Random Access Iterator
  563. Description
  564. Refinement of
  565. Associated types
  566. Notation
  567. Valid expressions
  568. Expression semantics
  569. Complexity guarantees
  570. Invariants
  571. Models
  572. Notes
  573. See also
  574. Iterator Tags
  575. Introduction
  576. Summary
  577. Description
  578. Examples
  579. Types
  580. Functions
  581. Notes
  582. See also
  583. iterator_traits < Iterator >
  584. Description
  585. Example
  586. Definition
  587. Template parameters
  588. Model of
  589. Type requirements
  590. Public base classes
  591. Members
  592. Notes
  593. See also
  594. iterator_category
  595. Prototype
  596. Description
  597. Definition
  598. Requirements on types
  599. Preconditions
  600. Complexity
  601. Example
  602. Notes
  603. See also
  604. distance_type
  605. Prototype
  606. Description
  607. Definition
  608. Requirements on types
  609. Preconditions
  610. Complexity
  611. Example
  612. Notes
  613. See also
  614. value_type
  615. Prototype
  616. Description
  617. Definition
  618. Requirements on types
  619. Preconditions
  620. Complexity
  621. Example
  622. Notes
  623. See also
  624. Iterator tag classes
  625. input_iterator_tag
  626. Description
  627. Example
  628. Definition
  629. Template parameters
  630. Model of
  631. Type requirements
  632. Public base classes
  633. Members
  634. New Members
  635. See also
  636. output_iterator_tag
  637. Description
  638. Example
  639. Definition
  640. Template parameters
  641. Model of
  642. Type requirements
  643. Public base classes
  644. Members
  645. New Members
  646. See also
  647. forward_iterator_tag
  648. Description
  649. Example
  650. Definition
  651. Template parameters
  652. Model of
  653. Type requirements
  654. Public base classes
  655. Members
  656. New Members
  657. See also
  658. bidirectional_iterator_tag
  659. Description
  660. Example
  661. Definition
  662. Template parameters
  663. Model of
  664. Type requirements
  665. Public base classes
  666. Members
  667. New Members
  668. See also
  669. random_access_iterator_tag
  670. Description
  671. Example
  672. Definition
  673. Template parameters
  674. Model of
  675. Type requirements
  676. Public base classes
  677. Members
  678. New Members
  679. See also
  680. Iterator base classes
  681. input_iterator < T, Distance >
  682. Description
  683. Example
  684. Definition
  685. Template parameters
  686. Model of
  687. Public base classes
  688. Type requirements
  689. Public base classes
  690. Members
  691. New Members
  692. Notes
  693. See also
  694. output_iterator
  695. Description
  696. Example
  697. Definition
  698. Template parameters
  699. Model of
  700. Public base classes
  701. Type requirements
  702. Public base classes
  703. Members
  704. New Members
  705. Notes
  706. See also
  707. forward_iterator < T, Distance >
  708. Description
  709. Example
  710. Definition
  711. Template parameters
  712. Model of
  713. Public base classes
  714. Type requirements
  715. Public base classes
  716. Members
  717. New Members
  718. Notes
  719. See also
  720. bidirectional_iterator < T, Distance >
  721. Description
  722. Example
  723. Definition
  724. Template parameters
  725. Model of
  726. Public base classes
  727. Type requirements
  728. Public base classes
  729. Members
  730. New Members
  731. Notes
  732. See also
  733. random_access_iterator < T, Distance >
  734. Description
  735. Example
  736. Definition
  737. Template parameters
  738. Model of
  739. Public base classes
  740. Type requirements
  741. Public base classes
  742. Members
  743. New Members
  744. Notes
  745. See also
  746. Iterator functions
  747. distance
  748. Prototype
  749. Description
  750. Definition
  751. Requirements on types
  752. Preconditions
  753. Complexity
  754. Example
  755. Notes
  756. See also
  757. advance
  758. Prototype
  759. Description
  760. Definition
  761. Requirements on types
  762. Preconditions
  763. Complexity
  764. Example
  765. See also
  766. Iterator classes
  767. istream_iterator < T, Distance >
  768. Description
  769. Example
  770. Definition
  771. Template parameters
  772. Model of
  773. Type requirements
  774. Public base classes
  775. Members
  776. New members
  777. See also
  778. ostream_iterator < T >
  779. Description
  780. Example
  781. Definition
  782. Template parameters
  783. Model of
  784. Type requirements
  785. Public base classes
  786. Members
  787. New members
  788. Notes
  789. See also
  790. front_insert_iterator < FrontInsertionSequence >
  791. Description
  792. Example
  793. Definition
  794. Template parameters
  795. Model of
  796. Type requirements
  797. Public base classes
  798. Members
  799. New members.
  800. Notes
  801. See also
  802. back_insert_iterator < BackInsertionSequence >
  803. Description
  804. Example
  805. Definition
  806. Template parameters
  807. Model of
  808. Type requirements
  809. Public base classes
  810. Members
  811. New members
  812. Notes
  813. See also
  814. insert_iterator < Container >
  815. Description
  816. Example
  817. Definition
  818. Template parameters
  819. Model of
  820. Type requirements
  821. Public base classes
  822. Members
  823. New members
  824. Notes
  825. See also
  826. reverse_iterator < RandomAccessIterator, T, Reference, Distance >
  827. Description
  828. Example
  829. Definition
  830. Template parameters
  831. Model of
  832. Type requirements
  833. Public base classes
  834. Members
  835. New members
  836. Notes
  837. See also
  838. reverse_bidirectional_iterator < BidirectionalIterator, T, Reference, Distance >
  839. Description
  840. Example
  841. Definition
  842. Template parameters
  843. Model of
  844. Type requirements
  845. Public base classes
  846. Members
  847. New members
  848. Notes
  849. See also
  850. raw_storage_iterator < ForwardIterator, T >
  851. Description
  852. Example
  853. Definition
  854. Template parameters
  855. Model of
  856. Type requirements
  857. Public base classes
  858. Members
  859. New members
  860. Notes
  861. See also
  862. sequence_buffer < Container, buf_sz >
  863. Description
  864. Example
  865. Definition
  866. Template parameters
  867. Model of
  868. Type requirements
  869. Public base classes
  870. Members
  871. New members
  872. Notes
  873. See also
  874. Algorithms
  875. Non-mutating algorithms
  876. for_each
  877. Prototype
  878. Description
  879. Definition
  880. Requirements on types
  881. Preconditions
  882. Complexity
  883. Example
  884. Notes
  885. See also
  886. find
  887. Prototype
  888. Description
  889. Definition
  890. Requirements on types
  891. Preconditions
  892. Complexity
  893. Example
  894. See also
  895. find_if
  896. Prototype
  897. Description
  898. Definition
  899. Requirements on types
  900. Preconditions
  901. Complexity
  902. Example
  903. See also
  904. adjacent_find
  905. Prototype
  906. Description
  907. Definition
  908. Requirements on types
  909. Preconditions
  910. Complexity
  911. Example
  912. See also
  913. find_first_of
  914. Prototype
  915. Description
  916. Definition
  917. Requirements on types
  918. Preconditions
  919. Complexity
  920. Example
  921. See also
  922. count
  923. Prototype
  924. Description
  925. Definition
  926. Requirements on types
  927. Preconditions
  928. Complexity
  929. Example
  930. Notes
  931. See also
  932. count_if
  933. Prototype
  934. Description
  935. Definition
  936. Requirements on types
  937. Preconditions
  938. Complexity
  939. Example
  940. Notes
  941. See also
  942. mismatch
  943. Prototype
  944. Description
  945. Definition
  946. Requirements on types
  947. Preconditions
  948. Complexity
  949. Example
  950. See also
  951. equal
  952. Prototype
  953. Description
  954. Definition
  955. Requirements on types
  956. Preconditions
  957. Complexity
  958. Example
  959. Notes
  960. See also
  961. search
  962. Prototype
  963. Description
  964. Definition
  965. Requirements on types
  966. Preconditions
  967. Complexity
  968. Example
  969. Notes
  970. See also
  971. search_n
  972. Prototype
  973. Description
  974. Definition
  975. Requirements on types
  976. Preconditions
  977. Complexity
  978. Example
  979. Notes
  980. See also
  981. find_end
  982. Prototype
  983. Description
  984. Definition
  985. Requirements on types
  986. Preconditions
  987. Complexity
  988. Example
  989. Notes
  990. See also
  991. Mutating algorithms
  992. copy
  993. Prototype
  994. Description
  995. Definition
  996. Requirements on types
  997. Preconditions
  998. Complexity
  999. Example
  1000. Notes
  1001. See also
  1002. copy_n
  1003. Prototype
  1004. Description
  1005. Definition
  1006. Requirements on types
  1007. Preconditions
  1008. Complexity
  1009. Example
  1010. Notes
  1011. See also
  1012. copy_backward
  1013. Prototype
  1014. Description
  1015. Definition
  1016. Requirements on types
  1017. Preconditions
  1018. Complexity
  1019. Example
  1020. Notes
  1021. See also
  1022. Swap
  1023. swap
  1024. Prototype
  1025. Description
  1026. Definition
  1027. Requirements on types
  1028. Preconditions
  1029. Complexity
  1030. Example
  1031. Notes
  1032. See also
  1033. iter_swap
  1034. Prototype
  1035. Description
  1036. Definition
  1037. Requirements on types
  1038. Preconditions
  1039. Complexity
  1040. Example
  1041. Notes
  1042. See also
  1043. swap_ranges
  1044. Prototype
  1045. Description
  1046. Definition
  1047. Requirements on types
  1048. Preconditions
  1049. Complexity
  1050. Example
  1051. See also
  1052. transform
  1053. Prototype
  1054. Description
  1055. Definition
  1056. Requirements on types
  1057. Preconditions
  1058. Complexity
  1059. Example
  1060. Notes
  1061. See also
  1062. Replace
  1063. replace
  1064. Prototype
  1065. Description
  1066. Definition
  1067. Requirements on types
  1068. Preconditions
  1069. Complexity
  1070. Example
  1071. See also
  1072. replace_if
  1073. Prototype
  1074. Description
  1075. Definition
  1076. Requirements on types
  1077. Preconditions
  1078. Complexity
  1079. Example
  1080. See also
  1081. replace_copy
  1082. Prototype
  1083. Description
  1084. Definition
  1085. Requirements on types
  1086. Preconditions
  1087. Complexity
  1088. Example
  1089. See also
  1090. replace_copy_if
  1091. Prototype
  1092. Description
  1093. Definition
  1094. Requirements on types
  1095. Preconditions
  1096. Complexity
  1097. Example
  1098. See also
  1099. fill
  1100. Prototype
  1101. Description
  1102. Definition
  1103. Requirements on types
  1104. Preconditions
  1105. Example
  1106. Notes
  1107. See also
  1108. fill_n
  1109. Prototype
  1110. Description
  1111. Definition
  1112. Requirements on types
  1113. Preconditions
  1114. Complexity
  1115. Example
  1116. See also
  1117. generate
  1118. Prototype
  1119. Description
  1120. Definition
  1121. Requirements on types
  1122. Example
  1123. Notes
  1124. See also
  1125. generate_n
  1126. Prototype
  1127. Description
  1128. Definition
  1129. Requirements on types
  1130. Preconditions
  1131. Complexity
  1132. Example
  1133. Notes
  1134. See also
  1135. Remove
  1136. remove
  1137. Prototype
  1138. Description
  1139. Definition
  1140. Requirements on types
  1141. Preconditions
  1142. Complexity
  1143. Example
  1144. Notes
  1145. See also
  1146. remove_if
  1147. Prototype
  1148. Description
  1149. Definition
  1150. Requirements on types
  1151. Preconditions
  1152. Complexity
  1153. Example
  1154. Notes
  1155. See also
  1156. remove_copy
  1157. Prototype
  1158. Description
  1159. Definition
  1160. Requirements on types
  1161. Preconditions
  1162. Complexity
  1163. Example
  1164. See also
  1165. remove_copy_if
  1166. Prototype
  1167. Description
  1168. Definition
  1169. Requirements on types
  1170. Preconditions
  1171. Complexity
  1172. Example
  1173. See also
  1174. unique
  1175. Prototype
  1176. Description
  1177. Definition
  1178. Requirements on types
  1179. Preconditions
  1180. Complexity
  1181. Example
  1182. Notes
  1183. See also
  1184. unique_copy
  1185. Prototype
  1186. Description
  1187. Definition
  1188. Requirements on types
  1189. Preconditions
  1190. Complexity
  1191. Example
  1192. Notes
  1193. See also
  1194. reverse
  1195. Prototype
  1196. Description
  1197. Definition
  1198. Requirements on types
  1199. Preconditions
  1200. Complexity
  1201. Example
  1202. See also
  1203. reverse_copy
  1204. Prototype
  1205. Description
  1206. Definition
  1207. Requirements on types
  1208. Preconditions
  1209. Complexity
  1210. Example
  1211. See also
  1212. rotate
  1213. Prototype
  1214. Description
  1215. Definition
  1216. Requirements on types
  1217. Preconditions
  1218. Complexity
  1219. Example
  1220. Notes
  1221. See also
  1222. rotate_copy
  1223. Prototype
  1224. Description
  1225. Definition
  1226. Requirements on types
  1227. Preconditions
  1228. Complexity
  1229. Example
  1230. Notes
  1231. See also
  1232. random_shuffle
  1233. Prototype
  1234. Description
  1235. Definition
  1236. Requirements on types
  1237. Preconditions
  1238. Complexity
  1239. Example
  1240. Notes
  1241. See also
  1242. random_sample
  1243. Prototype
  1244. Description
  1245. Definition
  1246. Requirements on types
  1247. Preconditions
  1248. Complexity
  1249. Example
  1250. Notes
  1251. See also
  1252. random_sample_n
  1253. Prototype
  1254. Description
  1255. Definition
  1256. Requirements on types
  1257. Preconditions
  1258. Complexity
  1259. Example
  1260. Notes
  1261. See also
  1262. partition
  1263. Prototype
  1264. Description
  1265. Definition
  1266. Requirements on types
  1267. Preconditions
  1268. Complexity
  1269. Example
  1270. Notes
  1271. See also
  1272. stable_partition
  1273. Prototype
  1274. Description
  1275. Definition
  1276. Requirements on types
  1277. Preconditions
  1278. Complexity
  1279. Example
  1280. Notes
  1281. See also
  1282. Sorting
  1283. Sort
  1284. sort
  1285. Prototype
  1286. Description
  1287. Definition
  1288. Requirements on types
  1289. Preconditions
  1290. Complexity
  1291. Example
  1292. Notes
  1293. See also
  1294. stable_sort
  1295. Prototype
  1296. Description
  1297. Definition
  1298. Requirements on types
  1299. Preconditions
  1300. Complexity
  1301. Example
  1302. Notes
  1303. See also
  1304. partial_sort
  1305. Prototype
  1306. Description
  1307. Definition
  1308. Requirements on types
  1309. Preconditions
  1310. Complexity
  1311. Example
  1312. Notes
  1313. See also
  1314. partial_sort_copy
  1315. Prototype
  1316. Description
  1317. Definition
  1318. Requirements on types
  1319. Preconditions
  1320. Complexity
  1321. Example
  1322. See also
  1323. is_sorted
  1324. Prototype
  1325. Description
  1326. Definition
  1327. Requirements on types
  1328. Preconditions
  1329. Complexity
  1330. Example
  1331. See also
  1332. nth_element
  1333. Prototype
  1334. Description
  1335. Definition
  1336. Requirements on types
  1337. Preconditions
  1338. Complexity
  1339. Example
  1340. Notes
  1341. See also
  1342. Binary search
  1343. lower_bound
  1344. Prototype
  1345. Description
  1346. Definition
  1347. Requirements on types
  1348. Preconditions
  1349. Complexity
  1350. Example
  1351. Notes
  1352. See also
  1353. upper_bound
  1354. Prototype
  1355. Description
  1356. Definition
  1357. Requirements on types
  1358. Preconditions
  1359. Complexity
  1360. Example
  1361. Notes
  1362. See also
  1363. equal_range
  1364. Prototype
  1365. Description
  1366. Definition
  1367. Requirements on types
  1368. Preconditions
  1369. Complexity
  1370. Example
  1371. Notes
  1372. See also
  1373. binary_search
  1374. Prototype
  1375. Description
  1376. Definition
  1377. Requirements on types
  1378. Preconditions
  1379. Complexity
  1380. Example
  1381. Notes
  1382. See also
  1383. merge
  1384. Prototype
  1385. Description
  1386. Definition
  1387. Requirements on types
  1388. Preconditions
  1389. Complexity
  1390. Example
  1391. Notes
  1392. See also
  1393. inplace_merge
  1394. Prototype
  1395. Description
  1396. Definition
  1397. Requirements on types
  1398. For the second version:
  1399. Preconditions
  1400. Complexity
  1401. Example
  1402. Notes
  1403. See also
  1404. Set operations on sorted ranges
  1405. includes
  1406. Prototype
  1407. Description
  1408. Definition
  1409. Requirements on types
  1410. Preconditions
  1411. Complexity
  1412. Example
  1413. Notes
  1414. See also
  1415. set_union
  1416. Prototype
  1417. Description
  1418. Definition
  1419. Requirements on types
  1420. Preconditions
  1421. Complexity
  1422. Example
  1423. Notes
  1424. See also
  1425. set_intersection
  1426. Prototype
  1427. Description
  1428. Definition
  1429. Requirements on types
  1430. Preconditions
  1431. Complexity
  1432. Example
  1433. Notes
  1434. See also
  1435. set_difference
  1436. Prototype
  1437. Description
  1438. Definition
  1439. Requirements on types
  1440. Preconditions
  1441. Complexity
  1442. Example
  1443. Notes
  1444. See also
  1445. set_symmetric_difference
  1446. Prototype
  1447. Description
  1448. Definition
  1449. Requirements on types
  1450. Preconditions
  1451. Complexity
  1452. Example
  1453. Notes
  1454. See also
  1455. Heap operations
  1456. push_heap
  1457. Prototype
  1458. Description
  1459. Definition
  1460. Requirements on types
  1461. Preconditions
  1462. Complexity
  1463. Example
  1464. See also
  1465. pop_heap
  1466. Prototype
  1467. Description
  1468. Definition
  1469. Requirements on types
  1470. Preconditions
  1471. Complexity
  1472. Example
  1473. Notes
  1474. See also
  1475. make_heap
  1476. Prototype
  1477. Description
  1478. Definition
  1479. Requirements on types
  1480. Preconditions
  1481. Complexity
  1482. Example
  1483. Notes
  1484. See also
  1485. sort_heap
  1486. Prototype
  1487. Description
  1488. Definition
  1489. Requirements on types
  1490. Preconditions
  1491. Complexity
  1492. Example
  1493. Notes
  1494. See also
  1495. is_heap
  1496. Prototype
  1497. Description
  1498. Definition
  1499. Requirements on types
  1500. Preconditions
  1501. Complexity
  1502. Example
  1503. Notes
  1504. See also
  1505. Minimum and maximum
  1506. min
  1507. Prototype
  1508. Description
  1509. Definition
  1510. Requirements on types
  1511. Example
  1512. See also
  1513. max
  1514. Prototype
  1515. Description
  1516. Definition
  1517. Requirements on types
  1518. Example
  1519. See also
  1520. min_element
  1521. Prototype
  1522. Description
  1523. Definition
  1524. Requirements on types
  1525. Preconditions
  1526. Complexity
  1527. Example
  1528. See also
  1529. max_element
  1530. Prototype
  1531. Description
  1532. Definition
  1533. Requirements on types
  1534. Preconditions
  1535. Complexity
  1536. Example
  1537. See also
  1538. lexicographical_compare
  1539. Prototype
  1540. Description
  1541. Definition
  1542. Requirements on types
  1543. Preconditions
  1544. Complexity
  1545. Example
  1546. See also
  1547. lexicographical_compare_3way
  1548. Prototype
  1549. Description
  1550. Definition
  1551. Requirements on types
  1552. Preconditions
  1553. Complexity
  1554. Example
  1555. Notes
  1556. See also
  1557. next_permutation
  1558. Prototype
  1559. Description
  1560. Definition
  1561. Requirements on types
  1562. Preconditions
  1563. Complexity
  1564. Example
  1565. Notes
  1566. See also
  1567. prev_permutation
  1568. Prototype
  1569. Description
  1570. Definition
  1571. Requirements on types
  1572. Preconditions
  1573. Complexity
  1574. Example
  1575. Notes
  1576. See also
  1577. Generalized numeric algorithms
  1578. iota
  1579. Prototype
  1580. Description
  1581. Definition
  1582. Requirements on types
  1583. Preconditions
  1584. Complexity
  1585. Example
  1586. Notes
  1587. See also
  1588. accumulate
  1589. Prototype
  1590. Description
  1591. Definition
  1592. Requirements on types
  1593. Preconditions
  1594. Complexity
  1595. Example
  1596. Notes
  1597. See also
  1598. inner_product
  1599. Prototype
  1600. Description
  1601. Definition
  1602. Requirements on types
  1603. Preconditions
  1604. Complexity
  1605. Example
  1606. Notes
  1607. See also
  1608. partial_sum
  1609. Prototype
  1610. Description
  1611. Definition
  1612. Requirements on types
  1613. Preconditions
  1614. Complexity
  1615. Example
  1616. Notes
  1617. See also
  1618. adjacent_difference
  1619. Prototype
  1620. Description
  1621. Definition
  1622. Requirements on types
  1623. Preconditions
  1624. Complexity
  1625. Example
  1626. Notes
  1627. See also
  1628. power
  1629. Prototype
  1630. Description
  1631. Definition
  1632. Requirements on types
  1633. Preconditions
  1634. Complexity
  1635. Example
  1636. Notes
  1637. See also
  1638. Function Objects
  1639. Introduction
  1640. Summary
  1641. Description
  1642. Examples
  1643. Concepts
  1644. Types
  1645. Functions
  1646. Notes
  1647. Concepts
  1648. Generator
  1649. Description
  1650. Refinement of
  1651. Associated types
  1652. Notation
  1653. Definitions
  1654. Valid expressions
  1655. Expression semantics
  1656. Models
  1657. Notes
  1658. See also
  1659. Unary Function
  1660. Description
  1661. Refinement of
  1662. Associated types
  1663. Notation
  1664. Definitions
  1665. Valid expressions
  1666. Expression semantics
  1667. Models
  1668. Notes
  1669. See also
  1670. Binary Function
  1671. Description
  1672. Refinement of
  1673. Associated types
  1674. Notation
  1675. Definitions
  1676. Valid expressions
  1677. Expression semantics
  1678. Models
  1679. Notes
  1680. See also
  1681. Adaptable Generator
  1682. Description
  1683. Refinement of
  1684. Associated types
  1685. Notation
  1686. Valid expressions
  1687. Models
  1688. Notes
  1689. See also
  1690. Adaptable Unary Function
  1691. Description
  1692. Refinement of
  1693. Associated types
  1694. Notation
  1695. Valid expressions
  1696. Models
  1697. Notes
  1698. See also
  1699. Adaptable Binary Function
  1700. Description
  1701. Refinement of
  1702. Associated types
  1703. Notation
  1704. Valid expressions
  1705. Models
  1706. Notes
  1707. See also
  1708. Predicates
  1709. Predicate
  1710. Description
  1711. Refinement of
  1712. Associated types
  1713. Notation
  1714. Valid expressions
  1715. Expression semantics
  1716. Models
  1717. See also
  1718. Binary Predicate
  1719. Description
  1720. Refinement of
  1721. Associated types
  1722. Notation
  1723. Valid expressions
  1724. Expression semantics
  1725. Models
  1726. See also
  1727. Adaptable Predicate
  1728. Description
  1729. Refinement of
  1730. Associated types
  1731. Valid expressions
  1732. Models
  1733. See also
  1734. Adaptable Binary Predicate
  1735. Description
  1736. Refinement of
  1737. Associated types
  1738. Valid expressions
  1739. Models
  1740. See also
  1741. Strict Weak Ordering
  1742. Description
  1743. Refinement of
  1744. Associated types
  1745. Notation
  1746. Definitions
  1747. Valid expressions
  1748. Expression semantics
  1749. Invariants
  1750. Models
  1751. Notes
  1752. See also
  1753. MonoidOperation
  1754. Description
  1755. Refinement of
  1756. Associated types
  1757. Notation
  1758. Definitions
  1759. Valid Expressions
  1760. Expression semantics
  1761. Invariants
  1762. Models
  1763. Notes
  1764. See also
  1765. Random Number Generator
  1766. Description
  1767. Refinement of
  1768. Associated types
  1769. Notation
  1770. Definitions
  1771. Valid expressions
  1772. Expression semantics
  1773. Invariants
  1774. Notes
  1775. Predefined function objects
  1776. Arithmetic operations
  1777. plus < T >
  1778. Description
  1779. Example
  1780. Definition
  1781. Template parameters
  1782. Model of
  1783. Type requirements
  1784. Public base classes
  1785. Members
  1786. New members
  1787. Notes
  1788. See also
  1789. minus < T >
  1790. Description
  1791. Example
  1792. Definition
  1793. Template parameters
  1794. Model of
  1795. Type requirements
  1796. Public base classes
  1797. Members
  1798. New members
  1799. See also
  1800. multiplies < T >
  1801. Description
  1802. Example
  1803. Definition
  1804. Template parameters
  1805. Model of
  1806. Type requirements
  1807. Public base classes
  1808. Members
  1809. New members
  1810. Notes
  1811. See also
  1812. divides < T >
  1813. Description
  1814. Example
  1815. Definition
  1816. Template parameters
  1817. Model of
  1818. Type requirements
  1819. Public base classes
  1820. Members
  1821. New members
  1822. See also
  1823. modulus < T >
  1824. Description
  1825. Example
  1826. Definition
  1827. Template parameters
  1828. Model of
  1829. Type requirements
  1830. Public base classes
  1831. Members
  1832. New members
  1833. See also
  1834. negate < T >
  1835. Description
  1836. Example
  1837. Definition
  1838. Template parameters
  1839. Model of
  1840. Type requirements
  1841. Public base classes
  1842. Members
  1843. New members
  1844. See also
  1845. Comparisons
  1846. equal_to < T >
  1847. Description
  1848. Example
  1849. Definition
  1850. Template parameters
  1851. Model of
  1852. Type requirements
  1853. Public base classes
  1854. Members
  1855. New members
  1856. See also
  1857. not_equal_to < T >
  1858. Description
  1859. Example
  1860. Definition
  1861. Template parameters
  1862. Model of
  1863. Type requirements
  1864. Public base classes
  1865. Members
  1866. New members
  1867. See also
  1868. less < T >
  1869. Description
  1870. Example
  1871. Definition
  1872. Template parameters
  1873. Model of
  1874. Type requirements
  1875. Public base classes
  1876. Members
  1877. New members
  1878. See also
  1879. greater < T >
  1880. Description
  1881. Example
  1882. Definition
  1883. Template parameters
  1884. Model of
  1885. Type requirements
  1886. Public base classes
  1887. Members
  1888. New members
  1889. See also
  1890. less_equal < T >
  1891. Description
  1892. Example
  1893. Definition
  1894. Template parameters
  1895. Model of
  1896. Type requirements
  1897. Public base classes
  1898. Members
  1899. New members
  1900. See also
  1901. greater_equal < T >
  1902. Description
  1903. Example
  1904. Definition
  1905. Template parameters
  1906. Model of
  1907. Type requirements
  1908. Public base classes
  1909. Members
  1910. New members
  1911. See also
  1912. Logical operations
  1913. logical_and < T >
  1914. Description
  1915. Example
  1916. Definition
  1917. Template parameters
  1918. Model of
  1919. Type requirements
  1920. Public base classes
  1921. Members
  1922. New members
  1923. Notes
  1924. See also
  1925. logical_or < T >
  1926. Description
  1927. Example
  1928. Definition
  1929. Template parameters
  1930. Model of
  1931. Type requirements
  1932. Public base classes
  1933. Members
  1934. New members
  1935. Notes
  1936. See also
  1937. logical_not < T >
  1938. Description
  1939. Example
  1940. Definition
  1941. Template parameters
  1942. Model of
  1943. Type requirements
  1944. Public base classes
  1945. Members
  1946. See also
  1947. Generalized identity operations
  1948. identity < T >
  1949. Description
  1950. Example
  1951. Definition
  1952. Template parameters
  1953. Model of
  1954. Type requirements
  1955. Public base classes
  1956. Members
  1957. New members
  1958. Notes
  1959. See also
  1960. project1st < Arg1, Arg2 >
  1961. Description
  1962. Example
  1963. Definition
  1964. Template parameters
  1965. Model of
  1966. Type requirements
  1967. Public base classes
  1968. Members
  1969. New members
  1970. See also
  1971. project2nd < Arg1, Arg2 >
  1972. Description
  1973. Example
  1974. Definition
  1975. Template parameters
  1976. Model of
  1977. Type requirements
  1978. Public base classes
  1979. Members
  1980. New members
  1981. See also
  1982. select1st < Pair >
  1983. Description
  1984. Example
  1985. Definition
  1986. Template parameters
  1987. Model of
  1988. Type requirements
  1989. Public base classes
  1990. Members
  1991. New members
  1992. Notes
  1993. See also
  1994. select2nd < Pair >
  1995. Description
  1996. Example
  1997. Definition
  1998. Template parameters
  1999. Model of
  2000. Type requirements
  2001. Public base classes
  2002. Members
  2003. New members
  2004. Notes
  2005. See also
  2006. subtractive_rng
  2007. Description
  2008. Example
  2009. Definition
  2010. Template parameters
  2011. Model of
  2012. Type requirements
  2013. Public base classes
  2014. Members
  2015. New members
  2016. Notes
  2017. See also
  2018. Function object adaptors
  2019. binder1st < AdaptableBinaryFunction >
  2020. Description
  2021. Example
  2022. Definition
  2023. Template parameters
  2024. Model of
  2025. Type requirements
  2026. Public base classes
  2027. Members
  2028. New members
  2029. Notes
  2030. See also
  2031. binder2nd < AdaptableBinaryFunction >
  2032. Description
  2033. Example
  2034. Definition
  2035. Template parameters
  2036. Model of
  2037. Type requirements
  2038. Public base classes
  2039. Members
  2040. New members
  2041. Notes
  2042. See also
  2043. ptr_fun
  2044. Prototype
  2045. Description
  2046. Definition
  2047. Requirements on types
  2048. Example
  2049. See also
  2050. pointer_to_unary_function < Arg, Result >
  2051. Description
  2052. Example
  2053. Definition
  2054. Template parameters
  2055. Model of
  2056. Type requirements
  2057. Public base classes
  2058. Members
  2059. New members
  2060. See also
  2061. pointer_to_binary_function < Arg1, Arg2, Result >
  2062. Description
  2063. Example
  2064. Definition
  2065. Template parameters
  2066. Model of
  2067. Type requirements
  2068. Public base classes
  2069. Members
  2070. New members
  2071. See also
  2072. unary_negate < AdaptablePredicate >
  2073. Description
  2074. Example
  2075. Definition
  2076. Template parameters
  2077. Model of
  2078. Type requirements
  2079. Public base classes
  2080. Members
  2081. New members
  2082. Notes
  2083. See also
  2084. binary_negate < AdaptableBinaryPredicate >
  2085. Description
  2086. Example
  2087. Definition
  2088. Template parameters
  2089. Model of
  2090. Type requirements
  2091. Public base classes
  2092. Members
  2093. New members
  2094. See also
  2095. unary_compose < AdaptableUnaryFunction1,AdaptableUnaryFunction2 >
  2096. Description
  2097. Example
  2098. Definition
  2099. Template parameters
  2100. Model of
  2101. Type requirements
  2102. Public base classes
  2103. Members
  2104. New members
  2105. Notes
  2106. See also
  2107. binary_compose < AdaptableBinaryFunction,AdaptableUnaryFunction1,AdaptableUnaryFunction2 >
  2108. Description
  2109. Example
  2110. Definition
  2111. Template parameters
  2112. Model of
  2113. Type requirements
  2114. Public base classes
  2115. Members
  2116. New members
  2117. Notes
  2118. See also
  2119. Member function adaptors
  2120. mem_fun_t < Result, X >
  2121. Description
  2122. Example
  2123. Definition
  2124. Template parameters
  2125. Model of
  2126. Type requirements
  2127. Public base classes
  2128. Members
  2129. New members
  2130. Notes
  2131. See also
  2132. mem_fun_ref_t < Result, X >
  2133. Description
  2134. Example
  2135. Definition
  2136. Template parameters
  2137. Model of
  2138. Type requirements
  2139. Public base classes
  2140. Members
  2141. New members
  2142. Notes
  2143. See also
  2144. mem_fun1_t < Result, X, Arg >
  2145. Description
  2146. Example
  2147. Definition
  2148. Template parameters
  2149. Model of
  2150. Type requirements
  2151. Public base classes
  2152. Members
  2153. New members
  2154. Notes
  2155. See also
  2156. mem_fun1_ref_t < Result, X, Arg >
  2157. Description
  2158. Example
  2159. Definition
  2160. Template parameters
  2161. Model of
  2162. Type requirements
  2163. Public base classes
  2164. Members
  2165. New members
  2166. Notes
  2167. See also
  2168. Utilities
  2169. Concepts
  2170. Assignable
  2171. Description
  2172. Notation
  2173. Valid expressions
  2174. Expression semantics
  2175. Models
  2176. Notes
  2177. See also
  2178. Default Constructible
  2179. Description
  2180. Notation
  2181. Valid expressions
  2182. Expression semantics
  2183. Models
  2184. Notes
  2185. See also
  2186. Equality Comparable
  2187. Description
  2188. Notation
  2189. Valid expressions
  2190. Expression semantics
  2191. Invariants
  2192. Models
  2193. See also
  2194. LessThan Comparable
  2195. Description
  2196. Notation
  2197. Definitions
  2198. Valid expressions
  2199. Expression semantics
  2200. Invariants
  2201. Models
  2202. Notes
  2203. See also
  2204. Functions
  2205. Relational Operators
  2206. Prototype
  2207. Description
  2208. Definition
  2209. Requirements on types
  2210. Preconditions
  2211. Example
  2212. See also
  2213. Classes
  2214. pair < T1, T2 >
  2215. Description
  2216. Example
  2217. Definition
  2218. Template parameters
  2219. Model of
  2220. Type requirements
  2221. Public base classes
  2222. Members
  2223. New members
  2224. See also
  2225. Memory Allocation
  2226. Classes
  2227. Allocators
  2228. Summary
  2229. Description
  2230. Examples
  2231. Concepts
  2232. Types
  2233. Functions
  2234. Notes
  2235. Functions
  2236. construct
  2237. Prototype
  2238. Description
  2239. Definition
  2240. Requirements on types
  2241. Preconditions
  2242. Example
  2243. Notes
  2244. See also
  2245. destroy
  2246. Prototype
  2247. Description
  2248. Definition
  2249. Requirements on types
  2250. Preconditions
  2251. Complexity
  2252. Example
  2253. Notes
  2254. See also
  2255. uninitialized_copy
  2256. Prototype
  2257. Description
  2258. Definition
  2259. Requirements on types
  2260. Preconditions
  2261. Complexity
  2262. Example
  2263. Notes
  2264. See also
  2265. uninitialized_copy_n
  2266. Prototype
  2267. Description
  2268. Definition
  2269. Requirements on types
  2270. Preconditions
  2271. Complexity
  2272. Example
  2273. Notes
  2274. See also
  2275. uninitialized_fill
  2276. Prototype
  2277. Description
  2278. Definition
  2279. Requirements on types
  2280. Preconditions
  2281. Complexity
  2282. Example
  2283. Notes
  2284. See also
  2285. uninitialized_fill_n
  2286. Prototype
  2287. Description
  2288. Definition
  2289. Requirements on types
  2290. Preconditions
  2291. Complexity
  2292. Example
  2293. Notes
  2294. See also
  2295. temporary_buffer < ForwardIterator, T >
  2296. Description
  2297. Example
  2298. Definition
  2299. Template parameters
  2300. Model of
  2301. Type requirements
  2302. Public base classes
  2303. Members
  2304. Notes
  2305. get_temporary_buffer
  2306. Prototype
  2307. Description
  2308. Definition
  2309. Preconditions
  2310. Example
  2311. Notes
  2312. See also
  2313. return_temporary_buffer
  2314. Prototype
  2315. Description
  2316. Definition
  2317. Preconditions
  2318. Example
  2319. Notes
  2320. See also
  2321. Design documents
  2322. Thread-safety for SGI STL
  2323. Client must lock shared mutable containers
  2324. Lock implementation
  2325. STL Complexity Specifications
  2326. Strings in SGI STL
  2327. Whats wrong with the string class defined by the draft standard?
  2328. So what should I use to represent strings?
  2329. What about mstring.h , as supplied with SGIs 7.1 compiler?
  2330. Rope Implementation Overview
  2331. Reference Counting and Synchronization
  2332. Allocator Use
  2333. Basic Algorithms and Rope Balancing
  2334. Iterators
  2335. SGI STL Allocator Design
  2336. The SGI Default Allocator
  2337. Alloc obtains memory from malloc
  2338. Alloc does not free all memory
  2339. No Attempt to sort free lists
  2340. The Original SGI STL allocator interface
  2341. Allocators are not templates
  2342. Allocators do not encapsulate pointer types
  2343. There are no allocator objects
  2344. Allocators allocate individual objects
  2345. Deallocate requires size argument
  2346. We include realloc-style reallocation in the interface
  2347. Whats New
  2348. Release 3.3: June 8, 2000
  2349. Release 3.2: April 22, 1999
  2350. Release 3.13: March 11, 1999
  2351. Release 3.12: February 2, 1999
  2352. Release 3.11: July 21, 1998
  2353. Release 3.1: June 9, 1998
  2354. Release 3.01: October 31, 1997
  2355. Release 3.0: October 31, 1997
  2356. Release 2.03: September 9, 1997
  2357. Release 2.02: July 31, 1997
  2358. Release 2.01: June 30, 1997
  2359. Release 2.0: June 13, 1997
  2360. Other STL Web sites
  2361. Books about the STL and generic programming
  2362. Al Stevens Interviews Alex Stepanov
  2363. Frequently Asked Questionsabout the SGI Standard Template Library


Ваше впечатление от этой книги  


Полный текст книги (читать онлайн): Standard Template Library Programmer`s Guide

Скачать эту книгу (191k) в формате: fb2, lrf, epub, mobi, txt, html

close [X]

close [X]


Loading...

Комментарии


Ваше имя:     Ваше впечатление от этой книги

Комментарий:


получать комментарии о книге Standard Template Library Programmer`s Guide на e-mail

Код авторизации Anti spam Capcha
















Loading...