github-starred/ultimatepp
2
0
Fork 0
mirror of https://github.com/ultimatepp/ultimatepp.git synced 2026-05-17 14:16:10 -06:00
Code Issues 33 Projects Packages Wiki Activity Actions
ultimatepp/uppdev/TopicTest/src.tpp/algo$en-us.tpp
cxl 4a1c627474 Adding uppdev.... 
git-svn-id: svn://ultimatepp.org/upp/trunk@328 f0d560ea-af0d-0410-9eb7-867de7ffcac7
2008-08-15 08:36:24 +00:00

317 lines
23 KiB
C++
Raw Blame History

TITLE("NTL algorithms")
REF("::Swap(T&,T&)")
REF("template<class I> void IterSwap(I a, I b)")
REF("template<class T> int sgn(T a)")
REF("template<class C, class T, class L> int FindLowerBound(const C& v, const T& val, const L& less)")
REF("template<class C, class T> int FindLowerBound(const C& v, const T& val)")
REF("template<class C, class T, class L> int FindUpperBound(const C& v, int l, int h, const T& val, const L& less)")
REF("template<class C, class T, class L> int FindUpperBound(const C& v, const T& val, const L& less)")
REF("template<class C, class T> int FindUpperBound(const C& v, const T& val)")
REF("template<class C, class T, class L> int FindBinary(const C& v, const T& val, int l, int h, const L& less)")
REF("template<class C, class T, class L> int FindBinary(const C& v, const T& val, const L& less)")
REF("template<class C, class T> int FindBinary(const C& v, const T& val)")
REF("template<class C> C& AppendSorted(C& dest, const C& src)")
REF("template<class C> C& UnionSorted(C& dest, const C& src)")
REF("template<class C> C& RemoveSorted(C& from, const C& what)")
REF("template<class D, class S, class L> D& IntersectSorted(D& dest, const S& src, const L& less)")
REF("template<class D, class S> D& IntersectSorted(D& dest, const S& src)")
REF("template<class T> void StreamContainer(Stream& s, T& cont)")
REF("template<class T> void Sort(T& c)")
REF("template<class II, class VI, class K, class Less> void __IndexSort(II begin, II end, VI pair, const Less& less, const K *)")
REF("template<class KC, class VC> void IndexSort(KC& keys, VC& values)")
REF("template<class I, class V, class Less> void __SortOrder(int *begin, int *end, I data, const Less& less, const V *)")
REF("template<class C> Vector<int> GetSortOrder(const C& container)")
REF("template<class DC, class I, class F> void GetFieldContainer(DC& dest, I begin, I end, F field)")
REF("template<class O, class T, class R> MethodRelationCls<O (T::*)(), T, R> MethodRelation(O (T::*method)(), const R& relation)")
REF("template<class O, class T, class R> MethodRelationCls<O (T::*)() const, T, R> MethodRelation(O (T::*method)() const, const R& relation)")
TOPIC_TEXT(
"[2 $$0,0#00000000000000000000000000000000:Default][l288;i704;a17;O9;~~~.992;2 $$1,0#10431211400427159095818037425705:param][a83;*R6 "
"$$2,5#31310162474203024125188417583966:caption][b83;* $$3,5#07864147445237544204411237157677:title][b167;a42;C2 "
"$$4,6#40027414424643823182269349404212:item][b42;a42; $$5,5#45413000475342174754091244180557:text][l288;a17;2 "
"$$6,6#27521748481378242620020725143825:desc][l")
TOPIC_TEXT(
"321;t246;C@5;1 $$7,7#20902679421464641399138805415013:code][b2503; $$8,0#65142375456100023862071332075487:separator][*@(0.0.255) "
"$$9,0#83433469410354161042741608181528:base][t4167;C $$10,0#37138531426314131251341829483380:class][l288;a17;*1 "
"$$11,11#70004532496200323422659154056402:requirement][i416;b42;a42;O9;~~~.416; $$12,12#10566046415157235020018451313112:tparam][b167;C2 "
"$$13,13#924304594434604")
TOPIC_TEXT(
"61911108080531343:item1][i288;a42;O9;C2 $$14,14#77422149456609303542238260500223:item2][*@2$(0.128.128) "
"$$15,15#34511555403152284025741354420178:NewsDate][l321;*C$7;2 $$16,16#03451589433145915344929335295360:result][l321;b83;a83;*C$7;2 "
"$$17,17#07531550463529505371228428965313:result`-line][l160;t4167;*C+117 $$18,5#88603949442205825958800053222425:package`-title][{_}%EN-US "
"[s13; template<class [*@4")
TOPIC_TEXT(
" T]>&][s14;:`:`:Swap`(T`&`,T`&`): void [* Swap]([*@4 T]`& [*@3 a], [*@4 T]`& [*@3 "
"b])&][s6; Swaps values. Specific types might specialize [* Swap] with more effective "
"variants.&][s11; T must have either deep copy operator or pick operator.&][s1; [*C@4 "
"T]-|Type of values.&][s1; [*C@3 a]-|First value to swap.&][s1; [*C@3 b]-|Second value "
"to swap.&][s13;:template`<class I`> void IterSwap`(I a`, I b`)")
TOPIC_TEXT(
": template<class [*@4 I]>&][s14;:template`<class I`> void IterSwap`(I a`, I b`): "
"void [* IterSwap]([*@4 I][* ][*@3 a], [*@4 I][* ][*@3 b])&][s6; Swaps values pointed "
"to by iterators. Specific types might specialize [* IterSwap] with more effective "
"variants.&][s11; Swap must be defined for type pointed to by I.&][s1; [*C@4 I]-|Iterator "
"type.&][s1; [*C@3 a]-|Iterator pointing to first value.&][s1;")
TOPIC_TEXT(
" [*C@3 b]-|Iterator pointing to second value.&][s13; template<class [*@4 C], class "
"[*@4 T], class [*@4 L]>&][s14;:template`<class T`> int sgn`(T a`): int [* FindLowerBound](const "
"[*@4 C]`& [*@3 v], int [*@3 pos], int [*@3 count], const [*@4 T]`& [*@3 val], const "
"[*@4 L]`& [*@3 less])&][s6; Finds first position in range of container sorted by "
"[* less] predicate where [* val] can be inserted without")
TOPIC_TEXT(
" breaking the ordering.&][s1; [*C@4 C]-|Type of container.&][s1; [*C@4 T]-|Type "
"of value.&][s1; [*C@3 v]-|Container.&][s1; [*C@3 pos]-|Beginning of range.&][s1; "
"[*C@3 count]-|Number of elements in range.&][s1; [*C@3 val]-|Value to find.&][s1; "
"[*C@3 less]-|Ordering predicate.&][s1; [*/ Return value]-|Position in container.&][s13;:template`<class "
"C`, class T`, class L`> int FindLowerBound`(const C`&")
TOPIC_TEXT(
" v`, const T`& val`, const L`& less`): template<class [*@4 C], class [*@4 T], class "
"[*@4 L]>&][s14;:template`<class C`, class T`, class L`> int FindLowerBound`(const "
"C`& v`, const T`& val`, const L`& less`): int [* FindLowerBound](const [*@4 C]`& "
"[*@3 v], const [*@4 T]`& [*@3 val], const [*@4 L]`& [*@3 less])&][s6; Finds first "
"position in sorted by [* less] predicate where [* val] can be inserted ")
TOPIC_TEXT(
"without breaking the ordering.&][s1; [*C@4 C]-|Type of container.&][s1; [*C@4 T]-|Type "
"of value.&][s1; [*C@3 v]-|Container.&][s1; [*C@3 val]-|Value to find.&][s1; [*C@3 "
"less]-|Ordering predicate.&][s1; [*/ Return value]-|Position in container.&][s13;:template`<class "
"C`, class T`> int FindLowerBound`(const C`& v`, const T`& val`): template<class [*@4 "
"C], class [*@4 T]>&][s14;:template`<class C`, cl")
TOPIC_TEXT(
"ass T`> int FindLowerBound`(const C`& v`, const T`& val`): int [* FindLowerBound](const "
"[*@4 C]`& [*@3 v], const [*@4 T]`& [*@3 val])&][s6; Finds first position in sorted "
"by [*/ operator<] predicate where [* val] can be inserted without breaking the ordering.&][s1; "
"[*C@4 C]-|Type of container.&][s1; [*C@4 T]-|Type of value.&][s1; [*C@3 v]-|Container.&][s1; "
"[*C@3 val]-|Value to find.&][s1; [*/ Retu")
TOPIC_TEXT(
"rn value]-|Position in container.&][s13;:template`<class C`, class T`, class L`> "
"int FindUpperBound`(const C`& v`, int l`, int h`, const T`& val`, const L`& less`): "
"template<class [*@4 C], class [*@4 T], class [*@4 L]>&][s14;:template`<class C`, "
"class T`, class L`> int FindUpperBound`(const C`& v`, int l`, int h`, const T`& val`, "
"const L`& less`): int [* FindUpperBound](const [*@4 C]`& [*@3 v], in")
TOPIC_TEXT(
"t [*@3 pos], int [*@3 count], const [*@4 T]`& [*@3 val], const [*@4 L]`& [*@3 less])&][s6; "
"Finds last position in range of container sorted by [* less] predicate where [* val] "
"can be inserted without breaking the ordering.&][s1; [*C@4 C]-|Type of container.&][s1; "
"[*C@4 T]-|Type of value.&][s1; [*C@3 v]-|Container.&][s1; [*C@3 pos]-|Beginning of "
"range.&][s1; [*C@3 count]-|Number of elements in rang")
TOPIC_TEXT(
"e.&][s1; [*C@3 val]-|Value to find.&][s1; [*C@3 less]-|Ordering predicate.&][s1; "
"[*/ Return value]-|Position in container.&][s13;:template`<class C`, class T`, class "
"L`> int FindUpperBound`(const C`& v`, const T`& val`, const L`& less`): template<class "
"[*@4 C], class [*@4 T], class [*@4 L]>&][s14;:template`<class C`, class T`, class "
"L`> int FindUpperBound`(const C`& v`, const T`& val`, const L`& l")
TOPIC_TEXT(
"ess`): int [* FindUpperBound](const [*@4 C]`& [*@3 v], const [*@4 T]`& [*@3 val], "
"const [*@4 L]`& [*@3 less])&][s6; Finds last position in sorted by [* less] predicate "
"where [* val] can be inserted without breaking the ordering.&][s1; [*C@4 C]-|Type "
"of container.&][s1; [*C@4 T]-|Type of value.&][s1; [*C@3 v]-|Container.&][s1; [*C@3 "
"val]-|Value to find.&][s1; [*C@3 less]-|Ordering predicate.&][s1; ")
TOPIC_TEXT(
"[*/ Return value]-|Position in container.&][s13;:template`<class C`, class T`> int "
"FindUpperBound`(const C`& v`, const T`& val`): template<class [*@4 C], class [*@4 "
"T]>&][s14;:template`<class C`, class T`> int FindUpperBound`(const C`& v`, const "
"T`& val`): int [* FindUpperBound](const [*@4 C]`& [*@3 v], const [*@4 T]`& [*@3 val])&][s6; "
"Finds last position in sorted by [*/ operator<] predicate wher")
TOPIC_TEXT(
"e [* val] can be inserted without breaking the ordering.&][s1; [*C@4 C]-|Type of "
"container.&][s1; [*C@4 T]-|Type of value.&][s1; [*C@3 v]-|Container.&][s1; [*C@3 "
"val]-|Value to find.&][s1; [*/ Return value]-|Position in container.&][s13;:template`<class "
"C`, class T`, class L`> int FindBinary`(const C`& v`, const T`& val`, int l`, int "
"h`, const L`& less`): template<class [*@4 C], class [*@4 T], cla")
TOPIC_TEXT(
"ss [*@4 L]>&][s14;:template`<class C`, class T`, class L`> int FindBinary`(const "
"C`& v`, const T`& val`, int l`, int h`, const L`& less`): int [* FindBinary](const "
"[*@4 C]`& [*@3 v], const [*@4 T]`& [*@3 val], int [*@3 pos], int [*@3 count], const "
"[*@4 L]`& [*@3 less])&][s6; Finds position of element with specified value in a range "
"of container sorted by [* less] predicate. If no such element exis")
TOPIC_TEXT(
"ts, negative value is returned.&][s1; [*C@4 C]-|Type of container.&][s1; [*C@4 T]-|Type "
"of value.&][s1; [*C@3 v]-|Container.&][s1; [*C@3 pos]-|Beginning of range.&][s1; "
"[*C@3 count]-|Number of elements in range.&][s1; [*C@3 val]-|Value to find.&][s1; "
"[*C@3 less]-|Ordering predicate.&][s1; [*/ Return value]-|Position in container.&][s13;:template`<class "
"C`, class T`, class L`> int FindBinary`(const")
TOPIC_TEXT(
" C`& v`, const T`& val`, const L`& less`): template<class [*@4 C], class [*@4 T], "
"class [*@4 L]>&][s14;:template`<class C`, class T`, class L`> int FindBinary`(const "
"C`& v`, const T`& val`, const L`& less`): int [* FindBinary](const [*@4 C]`& [*@3 "
"v], const [*@4 T]`& [*@3 val], const [*@4 L]`& [*@3 less])&][s6; Finds position of "
"element with specified value in the container sorted by [* less] pred")
TOPIC_TEXT(
"icate. If no such element exists, negative value is returned.&][s1; [*C@4 C]-|Type "
"of container.&][s1; [*C@4 T]-|Type of value.&][s1; [*C@3 v]-|Container.&][s1; [*C@3 "
"val]-|Value to find.&][s1; [*C@3 less]-|Ordering predicate.&][s1; [*/ Return value]-|Position "
"in container.&][s13;:template`<class C`, class T`> int FindBinary`(const C`& v`, "
"const T`& val`): template<class [*@4 C], class [*@4 T]>&][")
TOPIC_TEXT(
"s14;:template`<class C`, class T`> int FindBinary`(const C`& v`, const T`& val`): "
"int [* FindBinary](const [*@4 C]`& [*@3 v], const [*@4 T]`& [*@3 val])&][s6; Finds "
"position of element with specified value in the container sorted by [*/ operator<] "
"predicate. If no such element exists, negative value is returned.&][s1; [*C@4 C]-|Type "
"of container.&][s1; [*C@4 T]-|Type of value.&][s1; [*C@3 v]-|Cont")
TOPIC_TEXT(
"ainer.&][s1; [*C@3 val]-|Value to find.&][s1; [*/ Return value]-|Position in container.&][s13;:template`<class "
"C`> C`& AppendSorted`(C`& dest`, const C`& src`):~~~.992; template<class [*@4 C]>&][s14;:template`<class "
"C`> C`& AppendSorted`(C`& dest`, const C`& src`):~~~.992; [*@4 C]`& [* AppendSorted]([*@4 "
"C]`& [*@3 dest], const [*@4 C]`& [*@3 src], const [*@4 L]`& [*@3 less])&][s6; Adds "
"source NTL ")
TOPIC_TEXT(
"container to destination NTL container. Both containers must be sorted in ascending "
"order. After operation, destination container is sorted in ascending order and contains "
"values from both containers. Duplicate values are preserved. Ordering predicate is "
"determined by [* less].&][s1; [*C@4 C]-|Type of container.&][s1; [*C@3 dest]-|Destination "
"container.&][s1; [*C@3 src]-|Source container.&][s1; [*")
TOPIC_TEXT(
"C@3 less]-|Ordering predicate.&][s1;C [*/A Return value][A -|Destination container.]template<class "
"[*@4 C]>&][s13;:template`<class C`> C`& AppendSorted`(C`& dest`, const C`& src`):~~~.992; "
"template<class [*@4 C]>&][s14;~~~.992; [*@4 C]`& [* AppendSorted]([*@4 C]`& [*@3 "
"dest], const [*@4 C]`& [*@3 src])&][s6;~~~.992; Adds source NTL container to destination "
"NTL container. Both containers must be so")
TOPIC_TEXT(
"rted in ascending order. After operation, destination container is sorted in ascending "
"order and contains values from both containers. Duplicate values are preserved. Ordering "
"is determined by [*/ operator<].&][s1; [*C@4 C]-|Type of container.&][s1; [*C@3 dest]-|Destination "
"container.&][s1; [*C@3 src]-|Source container.&][s1;C [*/A Return value][A -|Destination "
"container.]template<class [*@4 C]>&]")
TOPIC_TEXT(
"[s13; template<class [*@4 C], class [*@4 L]>&][s14; [*@4 C]`& [* UnionSorted]([*@4 "
"C]`& [*@3 dest], const [*@4 C]`& [*@3 src], const [*@4 L]`& [*@3 less])&][s6; Adds "
"source NTL container to destination NTL container. Both containers must be sorted "
"in ascending order and values must be unique. After operation, destination container "
"is sorted in ascending order and contains unique values from both c")
TOPIC_TEXT(
"ontainers. Ordering is determined by [* less].&][s1; [*C@4 C]-|Type of container.&][s1; "
"[*C@3 dest]-|Destination container.&][s1; [*C@3 src]-|Source container.&][s1; [*C@3 "
"less]-|Ordering predicate.&][s1; [*/ Return value]-|Destination container.&][s13;:template`<class "
"C`> C`& UnionSorted`(C`& dest`, const C`& src`): template<class [*@4 C]>&][s14;:template`<class "
"C`> C`& UnionSorted`(C`& dest`, co")
TOPIC_TEXT(
"nst C`& src`):~~~.992; [*@4 C]`& [* UnionSorted]([*@4 C]`& [*@3 dest], const [*@4 "
"C]`& [*@3 src])&][s6; Adds source NTL container to destination NTL container. Both "
"containers must be sorted in ascending order and values must be unique. After operation, "
"destination container is sorted in ascending order and contains unique values from "
"both containers. Ordering is determined by [*/ operator<].&][s1")
TOPIC_TEXT(
"; [*C@4 C]-|Type of container.&][s1; [*C@3 dest]-|Destination container.&][s1; [*C@3 "
"src]-|Source container.&][s1; [*/ Return value]-|Destination container.&][s13; template<class "
"[*@4 C], class [*@4 L]>&][s14; [*@4 C]`& [* RemoveSorted]([*@4 C]`& [*@3 from], const "
"[*@4 C]`& [*@3 what], const [*@4 L]`& [*@3 less])&][s6; Removes elements of source "
"container from destination container. Both container")
TOPIC_TEXT(
"s must be sorted in ascending order and values must be unique. Ordering is determined "
"by [* less].&][s1; [*C@4 C]-|Type of container.&][s1; [*C@3 from]-|Destination container.&][s1; "
"[*C@3 what]-|Source container.&][s1; [*C@3 less]-|Ordering predicate.&][s1; [*/ Return "
"value]-|Destination container.&][s13;:template`<class C`> C`& RemoveSorted`(C`& from`, "
"const C`& what`): template<class [*@4 C]>&][")
TOPIC_TEXT(
"s14;:template`<class C`> C`& RemoveSorted`(C`& from`, const C`& what`): [*@4 C]`& "
"[* RemoveSorted]([*@4 C]`& [*@3 from], const [*@4 C]`& [*@3 what])&][s6; Removes "
"elements of source container from destination container. Both containers must be "
"sorted in ascending order and values must be unique. Ordering is determined by [*/ "
"operator<].&][s1; [*C@4 C]-|Type of container.&][s1; [*C@3 from]-|Destina")
TOPIC_TEXT(
"tion container.&][s1; [*C@3 what]-|Source container.&][s1; [*/ Return value]-|Destination "
"container.&][s13;:template`<class D`, class S`, class L`> D`& IntersectSorted`(D`& "
"dest`, const S`& src`, const L`& less`): template<class [*@4 D], class [*@4 S], class "
"[*@4 L]>&][s14;:template`<class D`, class S`, class L`> D`& IntersectSorted`(D`& "
"dest`, const S`& src`, const L`& less`): [*@4 D]`& [* Inters")
TOPIC_TEXT(
"ectSorted]([*@4 D]`& [*@3 dest], const [*@4 S]`& [*@3 src], const [*@4 L]`& [*@3 "
"less])&][s6; Removes elements from destination container that are not contained in "
"source container. Both containers must be sorted in ascending order and values must "
"be unique. Ordering is determined by [* less].&][s1; [*C@4 D]-|Type of destination "
"container.&][s1; [*C@4 S]-|Type of source container.&][s1; [*C@3 dest")
TOPIC_TEXT(
"]-|Destination container.&][s1; [*C@3 src]-|Source container.&][s1; [*C@3 less]-|Destination "
"container.&][s13;:template`<class D`, class S`> D`& IntersectSorted`(D`& dest`, const "
"S`& src`): template<class [*@4 D], class [*@4 S]>&][s14;:template`<class D`, class "
"S`> D`& IntersectSorted`(D`& dest`, const S`& src`): [*@4 D]`& [* IntersectSorted]([*@4 "
"D]`& [*@3 dest], const [*@4 S]`& [*@3 src])&][s6; ")
TOPIC_TEXT(
"Removes elements from destination container that are not contained in source container. "
"Both containers must be sorted in ascending order and values must be unique. Ordering "
"is determined by [*/ operator<].&][s1; [*C@4 D]-|Type of destination container.&][s1; "
"[*C@4 S]-|Type of source container.&][s1; [*C@3 dest]-|Destination container.&][s1; "
"[*C@3 src]-|Source container.&][s1; [*/ Return value]-|D")
TOPIC_TEXT(
"estination container.&][s13;:template`<class T`> void StreamContainer`(Stream`& "
"s`, T`& cont`): template<class [*@4 T], class [*@4 Less]>&][s14;:template`<class "
"T`> void StreamContainer`(Stream`& s`, T`& cont`): void [* Sort]([*@4 T]`& [*@3 c], "
"const [*@4 Less]`& [*@3 less])&][s6; Sorts container. Ordering is determined by [* "
"less].&][s11; IterSwap must be defined for T`::Iterator.&][s1; [*C@4 T]-")
TOPIC_TEXT(
"|Type of container.&][s1; [*C@3 c]-|Container.&][s1; [*C@3 less]-|Ordering predicate.&][s13;:template`<class "
"T`> void Sort`(T`& c`): template<class [*@4 T]>&][s14;:template`<class T`> void Sort`(T`& "
"c`): void [* Sort]([*@4 T]`& [*@3 c])&][s6; Sorts container. Ordering is determined "
"by [*/ operato<].&][s6;*1 IterSwap must be defined for T`::Iterator.&][s1; [*C@4 "
"T]-|Type of container.&][s1; [*C@3 c")
TOPIC_TEXT(
"]-|Container.&][s13;:template`<class II`, class VI`, class K`, class Less`> void "
"`_`_IndexSort`(II begin`, II end`, VI pair`, const Less`& less`, const K `*`): template<class "
"[*@4 KC], class [*@4 VC], class [*@4 Less]>&][s14;:template`<class II`, class VI`, "
"class K`, class Less`> void `_`_IndexSort`(II begin`, II end`, VI pair`, const Less`& "
"less`, const K `*`): void [* IndexSort]([*@4 KC]`& [*@3 ")
TOPIC_TEXT(
"keys], [*@4 VC]`& [*@3 values], const [*@4 Less]`& [*@3 less])&][s6; Sorts pair "
"of containers. Both containers must have same number of items. Resulting order is "
"determined by [* keys] container. Ordering is determined by [* less].&][s1; [*C@4 "
"KC]-|Type of keys container.&][s1; [*C@4 VC]-|Type of values.&][s1; [*C@3 keys]-|Container "
"of keys.&][s1; [*C@3 values]-|Container of values.&][s1; [*C@3 le")
TOPIC_TEXT(
"ss]-|Ordering predicate.&][s13;:template`<class KC`, class VC`> void IndexSort`(KC`& "
"keys`, VC`& values`): template<class [*@4 KC], class [*@4 VC]>&][s14;:template`<class "
"KC`, class VC`> void IndexSort`(KC`& keys`, VC`& values`): void [* IndexSort]([*@4 "
"KC]`& [*@3 keys], [*@4 VC]`& [*@3 values])&][s6; Sorts pair of containers. Both containers "
"must have same number of items. Resulting order is dete")
TOPIC_TEXT(
"rmined by [* keys] container. Ordering is determined by [*/ operator<].&][s1; [*C@4 "
"KC]-|Type of keys container.&][s1; [*C@4 VC]-|Type of values container.&][s1; [*C@3 "
"keys]-|Container of keys.&][s1; [*C@3 values]-|Container of values.&][s13;:template`<class "
"I`, class V`, class Less`> void `_`_SortOrder`(int `*begin`, int `*end`, I data`, "
"const Less`& less`, const V `*`): template<class [*@4 C], c")
TOPIC_TEXT(
"lass [*@4 Less]>&][s14;:template`<class I`, class V`, class Less`> void `_`_SortOrder`(int "
"`*begin`, int `*end`, I data`, const Less`& less`, const V `*`): Vector<int> [* GetSortOrder](const "
"[*@4 C]`& [*@3 container], const [*@4 Less]`& [*@3 less])&][s6; Creates ascending "
"order of values in container. Ordering is determined by [* less].&][s1; [*C@4 C]-|Type "
"of container.&][s1; [*C@3 container]-|So")
TOPIC_TEXT(
"urce container.&][s1; [*C@3 less]-|Ordering predicate.&][s1; [*/ Return value]-|Vector "
"of positions of source container in sorted order.&][s13;:template`<class C`> Vector`<int`> "
"GetSortOrder`(const C`& container`): template<class [*@4 C]>&][s14;:template`<class "
"C`> Vector`<int`> GetSortOrder`(const C`& container`): Vector<int> [* GetSortOrder](const "
"[*@4 C]`& [*@3 container])&][s6; Creates ascendi")
TOPIC_TEXT(
"ng order of values in container. Ordering is determined by [*/ operator<].&][s1; "
"[*C@4 C]-|Type of container.&][s1; [*C@3 container]-|Source container.&][s1; [*/ "
"Return value]-|Vector of positions of source container in sorted order.&][s13;:template`<class "
"DC`, class I`, class F`> void GetFieldContainer`(DC`& dest`, I begin`, I end`, F "
"field`): template<class [*@4 O], class [*@4 T], class [*@4 R]>")
TOPIC_TEXT(
"&][s14;:template`<class DC`, class I`, class F`> void GetFieldContainer`(DC`& dest`, "
"I begin`, I end`, F field`): [/ type] [* FieldRelation]([*@4 O] ([*@4 T]`::`*[*@3 "
"member]), const [*@4 R]`& [*@3 relation])&][s6; Creates ordering predicate for [* "
"T] based on value of member variable of[* T].&][s1; [*C@4 T]-|Type of element.&][s1; "
"[*C@3 member]-|Member variable of T.&][s1; [*C@3 relation]-|Order")
TOPIC_TEXT(
"ing relation for [* member].&][s1; [*/ Return value]-|Ordering predicate.&][s13;:template`<class "
"O`, class T`, class R`> MethodRelationCls`<O `(T`:`:`*`)`(`)`, T`, R`> MethodRelation`(O "
"`(T`:`:`*method`)`(`)`, const R`& relation`): template<class [*@4 O], class [*@4 "
"T], class [*@4 R]>&][s14;:template`<class O`, class T`, class R`> MethodRelationCls`<O "
"`(T`:`:`*`)`(`)`, T`, R`> MethodRelation`(O `(")
TOPIC_TEXT(
"T`:`:`*method`)`(`)`, const R`& relation`): [/ type] [* MethodRelation]([*@4 O] "
"([*@4 T]`::`*[*@3 method])(), const [*@4 R]`& [*@3 relation])&][s6; Creates ordering "
"predicate for [* T] based on value returned by non`-const method of [* T].&][s1; "
"[*C@4 T]-|Type of element.&][s1; [*C@3 method]-|Method of T.&][s1; [*C@3 relation]-|Ordering "
"relation for value returned by method.&][s1; [*/ Return value")
TOPIC_TEXT(
"]-|Ordering predicate.&][s13;:template`<class O`, class T`, class R`> MethodRelationCls`<O "
"`(T`:`:`*`)`(`) const`, T`, R`> MethodRelation`(O `(T`:`:`*method`)`(`) const`, const "
"R`& relation`): template<class [*@4 O], class [*@4 T], class [*@4 R]>&][s14;:template`<class "
"O`, class T`, class R`> MethodRelationCls`<O `(T`:`:`*`)`(`) const`, T`, R`> MethodRelation`(O "
"`(T`:`:`*method`)`(`) const`, const")
TOPIC_TEXT(
" R`& relation`): [/ type] [* MethodRelation]([*@4 O] ([*@4 T]`::`*[*@3 method])() "
"const, const [*@4 R]`& [*@3 relation])&][s6; Creates ordering predicate for [* T] "
"based on value returned by const method of [* T].&][s1; [*C@4 T]-|Type of element.&][s1; "
"[*C@3 method]-|Method of T.&][s1; [*C@3 relation]-|Ordering relation for value returned "
"by method.&][s1; [*/ Return value]-|Ordering predicate.]")
Reference in a new issue View git blame Copy permalink