Struct brontes_pricing::GraphManager
source · pub struct GraphManager { /* private fields */ }
Expand description
GraphManager
Is the manager for everything graph related. It is
responsible for creating, updating, and maintaining the main token graph as
well as its derived subgraphs.
§Subgraph Management
- Subgraph Registry: Maintains a collection of subgraphs
(
SubGraphRegistry
) for efficient price calculation. - Subgraph Creation and Verification: Generates and verifies new subgraphs that allow for pricing of any token pair.
- Handling Bad Pool States: Addresses problematic pools within subgraphs to ensure accurate pricing data.
§Price Calculation and State Tracking
- Price Retrieval: Retrieves prices for specific token pairs based on their subgraphs.
- State Management: Tracks and monitors the changes in pools over time
through
graph_state
(StateTracker
).
§Operational Flow
- Initialization: Initializes the
GraphManager
with existing pool data and subgraphs from the database. - Adding Pools and Verifying Subgraphs: Adds new pools and verifies the integrity of associated subgraphs.
- Finalizing Blocks: Concludes the processing of a block, finalizing the state for the generated subgraphs.
Implementations§
source§impl GraphManager
impl GraphManager
pub fn init_from_db_state( all_pool_data: FastHashMap<(Address, Protocol), Pair>, metrics: Option<DexPricingMetrics>, ) -> Self
sourcepub fn snapshot_state(
&self,
) -> (SubGraphRegistry, SubgraphVerifier, StateTracker)
pub fn snapshot_state( &self, ) -> (SubGraphRegistry, SubgraphVerifier, StateTracker)
used for testing and benching
sourcepub fn set_state(
&mut self,
sub_graph_registry: SubGraphRegistry,
verifier: SubgraphVerifier,
state: StateTracker,
)
pub fn set_state( &mut self, sub_graph_registry: SubGraphRegistry, verifier: SubgraphVerifier, state: StateTracker, )
used for testing and benching
pub fn add_pool( &mut self, pair: Pair, pool_addr: Address, dex: Protocol, block: u64, )
pub fn pool_dep_failure( &mut self, pair: &PairWithFirstPoolHop, pool_addr: Address, pool_pair: Pair, ) -> bool
pub fn has_extension(&self, pair: &Pair, quote: Address) -> Option<Pair>
pub fn mark_future_use(&self, pair: Pair, goes_through: Pair, block: u64)
sourcepub fn create_subgraph(
&self,
block: u64,
first_hop: Option<Pair>,
pair: Pair,
ignore: FastHashSet<Pair>,
connectivity_wight: usize,
connections: Option<usize>,
timeout: Duration,
is_extension: bool,
trying_extensions_quote: Option<Address>,
) -> (Vec<SubGraphEdge>, Option<Pair>)
pub fn create_subgraph( &self, block: u64, first_hop: Option<Pair>, pair: Pair, ignore: FastHashSet<Pair>, connectivity_wight: usize, connections: Option<usize>, timeout: Duration, is_extension: bool, trying_extensions_quote: Option<Address>, ) -> (Vec<SubGraphEdge>, Option<Pair>)
creates a subgraph returning the edges and the state to load. this is done so that this isn’t mut and be ran in parallel
pub fn add_subgraph_for_verification( &mut self, pair: PairWithFirstPoolHop, extends_to: Option<Pair>, block: u64, edges: Vec<SubGraphEdge>, ) -> Vec<PoolPairInfoDirection>
sourcepub fn prune_dead_subgraphs(&mut self, block: u64)
pub fn prune_dead_subgraphs(&mut self, block: u64)
prunes dead sup_graphs and empty state.
pub fn add_verified_subgraph(&mut self, subgraph: PairSubGraph, block: u64)
pub fn remove_pair_graph_address( &mut self, pool_pair: Pair, pool_address: Address, ) -> Option<(Address, Protocol, Pair)>
pub fn remove_subgraph(&mut self, pair: PairWithFirstPoolHop)
sourcepub fn verify_subgraph_on_new_path_failure(
&mut self,
pair: PairWithFirstPoolHop,
) -> Option<Vec<Pair>>
pub fn verify_subgraph_on_new_path_failure( &mut self, pair: PairWithFirstPoolHop, ) -> Option<Vec<Pair>>
Returns all pairs that have been ignored from lowest to highest liquidity
pub fn subgraph_extends(&mut self, pair: PairWithFirstPoolHop) -> Option<Pair>
pub fn get_price( &mut self, pair: Pair, goes_through: Pair, ) -> Option<(Rational, Rational, usize)>
pub fn new_state(&mut self, address: Address, state: StateWithDependencies)
pub fn update_state(&mut self, address: Address, update: PoolUpdate)
pub fn has_subgraph_goes_through(&self, pair: PairWithFirstPoolHop) -> bool
pub fn prune_low_liq_subgraphs( &mut self, pair: PairWithFirstPoolHop, quote: Address, current_block: u64, )
pub fn add_frayed_end_extension( &mut self, pair: PairWithFirstPoolHop, block: u64, frayed_end_extensions: Vec<SubGraphEdge>, ) -> Option<(Vec<PoolPairInfoDirection>, u64, bool)>
pub fn verify_subgraph( &mut self, pairs: Vec<(u64, Option<u64>, PairWithFirstPoolHop)>, quote: Address, ) -> Vec<VerificationResults>
pub fn finalize_block(&mut self, block: u64)
pub fn verification_done_for_block(&self, block: u64) -> bool
Auto Trait Implementations§
impl Freeze for GraphManager
impl !RefUnwindSafe for GraphManager
impl Send for GraphManager
impl Sync for GraphManager
impl Unpin for GraphManager
impl !UnwindSafe for GraphManager
Blanket Implementations§
source§impl<T, O> ActionComparison<O> for Twhere
T: SubordinateAction<O>,
O: ActionCmp<T>,
impl<T, O> ActionComparison<O> for Twhere
T: SubordinateAction<O>,
O: ActionCmp<T>,
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<T> Conv for T
impl<T> Conv for T
§impl<F, W, T, D> Deserialize<With<T, W>, D> for F
impl<F, W, T, D> Deserialize<With<T, W>, D> for F
§fn deserialize(
&self,
deserializer: &mut D,
) -> Result<With<T, W>, <D as Fallible>::Error>
fn deserialize( &self, deserializer: &mut D, ) -> Result<With<T, W>, <D as Fallible>::Error>
Deserializes using the given deserializer
§impl<T, U> ExactFrom<T> for Uwhere
U: TryFrom<T>,
impl<T, U> ExactFrom<T> for Uwhere
U: TryFrom<T>,
fn exact_from(value: T) -> U
§impl<T, U> ExactInto<U> for Twhere
U: ExactFrom<T>,
impl<T, U> ExactInto<U> for Twhere
U: ExactFrom<T>,
fn exact_into(self) -> U
§impl<T> FmtForward for T
impl<T> FmtForward for T
§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
Causes
self
to use its Binary
implementation when Debug
-formatted.§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
Causes
self
to use its Display
implementation when
Debug
-formatted.§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
Causes
self
to use its LowerExp
implementation when
Debug
-formatted.§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
Causes
self
to use its LowerHex
implementation when
Debug
-formatted.§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
Causes
self
to use its Octal
implementation when Debug
-formatted.§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
Causes
self
to use its Pointer
implementation when
Debug
-formatted.§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
Causes
self
to use its UpperExp
implementation when
Debug
-formatted.§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
Causes
self
to use its UpperHex
implementation when
Debug
-formatted.§fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
Formats each item in a sequence. Read more
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Gets the layout of the type.
§impl<T, U> OverflowingInto<U> for Twhere
U: OverflowingFrom<T>,
impl<T, U> OverflowingInto<U> for Twhere
U: OverflowingFrom<T>,
fn overflowing_into(self) -> (U, bool)
§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
Pipes by value. This is generally the method you want to use. Read more
§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
Borrows
self
and passes that borrow into the pipe function. Read more§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
Mutably borrows
self
and passes that borrow into the pipe function. Read more§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
Borrows
self
, then passes self.as_ref()
into the pipe function.§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
Mutably borrows
self
, then passes self.as_mut()
into the pipe
function.§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
Borrows
self
, then passes self.deref()
into the pipe function.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T, U> RoundingInto<U> for Twhere
U: RoundingFrom<T>,
impl<T, U> RoundingInto<U> for Twhere
U: RoundingFrom<T>,
fn rounding_into(self, rm: RoundingMode) -> (U, Ordering)
§impl<T, U> SaturatingInto<U> for Twhere
U: SaturatingFrom<T>,
impl<T, U> SaturatingInto<U> for Twhere
U: SaturatingFrom<T>,
fn saturating_into(self) -> U
source§impl<T, O> SubordinateAction<O> for Twhere
O: ActionCmp<T>,
impl<T, O> SubordinateAction<O> for Twhere
O: ActionCmp<T>,
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Immutable access to the
Borrow<B>
of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
Mutable access to the
BorrowMut<B>
of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
Immutable access to the
AsRef<R>
view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
Mutable access to the
AsMut<R>
view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Immutable access to the
Deref::Target
of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Mutable access to the
Deref::Target
of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
Calls
.tap()
only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
Calls
.tap_mut()
only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
Calls
.tap_borrow()
only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
Calls
.tap_borrow_mut()
only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
Calls
.tap_ref()
only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
Calls
.tap_ref_mut()
only in debug builds, and is erased in release
builds.§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
Calls
.tap_deref()
only in debug builds, and is erased in release
builds.§impl<T> TryConv for T
impl<T> TryConv for T
§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where
S: Into<Dispatch>,
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where
S: Into<Dispatch>,
§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where
S: Into<Dispatch>,
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where
S: Into<Dispatch>,
source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
§impl<T, U> WrappingInto<U> for Twhere
U: WrappingFrom<T>,
impl<T, U> WrappingInto<U> for Twhere
U: WrappingFrom<T>,
fn wrapping_into(self) -> U
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...)
attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 720 bytes