Classes | |
| class | atlas::kl::helper::Helper |
| class | atlas::kl::helper::Thicket |
| Collection of block elements y_j of the same length, differing by type II real cross actions, and having no other descents. More... | |
| struct | atlas::kl::helper::Thicket::Edge |
| Pair (y , s x y) (with s type II real) in a Thicket. More... | |
| class | atlas::kl::helper::ThicketIterator |
Typedefs | |
| typedef hashtable::HashTable< KLPolEntry, KLIndex > | KLHashStore |
Functions | |
| size_t | firstAscent (const descents::DescentStatus &, const descents::DescentStatus &, size_t) |
| Returns the first s that is an ascent for d1, and a descent for d2; rank if there is none such. | |
| size_t | goodAscent (const descents::DescentStatus &, const descents::DescentStatus &, size_t) |
| Returns the first s that is a non-ImaginaryTypeII ascent for d1, and a descent for d2; rank if there is none such. | |
|
|
|
|
||||||||||||||||
|
Returns the first s that is an ascent for d1, and a descent for d2; rank if there is none such. Precondition: rank is the number of valid fields in d1 and d2. Definition at line 2133 of file kl.cpp. Referenced by atlas::kl::helper::Thicket::ascentCompute(), atlas::kl::helper::Thicket::nonExtremal(), atlas::kl::helper::Helper::type2Mu(), and atlas::kl::helper::Helper::writeRow(). |
|
||||||||||||||||
|
Returns the first s that is a non-ImaginaryTypeII ascent for d1, and a descent for d2; rank if there is none such. Precondition: rank is the number of valid fields in d1 and d2. |
1.3.9.1