mirror of
https://github.com/Xahau/xahaud.git
synced 2025-11-20 02:25:53 +00:00
Optimize payment path exploration in flow:
* Use theoretical quality to order the strands * Do not use strands below the user specified quality limit * Stop exploring strands (at the current quality iteration) once any strand is non-dry
This commit is contained in:
@@ -113,7 +113,8 @@ class FeatureCollections
|
||||
"HardenedValidations",
|
||||
"fixAmendmentMajorityCalc", // Fix Amendment majority calculation
|
||||
"NegativeUNL",
|
||||
"TicketBatch"};
|
||||
"TicketBatch",
|
||||
"FlowSortStrands"};
|
||||
|
||||
std::vector<uint256> features;
|
||||
boost::container::flat_map<uint256, std::size_t> featureToIndex;
|
||||
@@ -371,6 +372,7 @@ extern uint256 const featureHardenedValidations;
|
||||
extern uint256 const fixAmendmentMajorityCalc;
|
||||
extern uint256 const featureNegativeUNL;
|
||||
extern uint256 const featureTicketBatch;
|
||||
extern uint256 const featureFlowSortStrands;
|
||||
|
||||
} // namespace ripple
|
||||
|
||||
|
||||
Reference in New Issue
Block a user