- 論壇徽章:
- 44
|
回復(fù) 1# centos_71
A strict weak ordering is a binary relation < on a set S that is a strict partial order (a transitive relation that is irreflexive, or equivalently,[5] that is asymmetric) in which the relation "neither a < b nor b < a" is transitive.
也就是說“strict weak ordering”滿足以下幾個(gè)條件
1、對(duì)于給定集合S,其中任意兩個(gè)元素a和b都存在ordering,這一點(diǎn)和“partial ordering”不同,后者不能保證任意兩個(gè)元素之間都存在ordering,所以才叫“partial”
2、transitive指如果a<b且b<c,則a<c
3、irreflexive是指a<a一定為假
4、asymmetric指若a<b,則b<a為假
5、最后一句說的是“(not a<b) and (not b<a)”有傳遞性,也就是說,如果“(not a<b) and (not b<a)”且“(not b<c) and (not c<b)”,則“(not a<c) and (not c<a)”
STL里的less定義就需要滿足以上條件 |
|