pub struct CachedGraphStore { /* private fields */ }Expand description
Two-tier graph: in-memory hot cache + persistent cold tier.
All read operations use the hot tier exclusively (sub-ms latency). Writes update hot tier synchronously, then flush to the cold tier asynchronously.
Implementations§
Source§impl CachedGraphStore
impl CachedGraphStore
Sourcepub fn new(cold: Arc<PersistentGraph>) -> Self
pub fn new(cold: Arc<PersistentGraph>) -> Self
Create a new cached graph store backed by the given persistent graph.
The hot tier starts empty. Call load_from_cold
to populate it from storage.
Sourcepub fn with_max_nodes(cold: Arc<PersistentGraph>, max_node_count: usize) -> Self
pub fn with_max_nodes(cold: Arc<PersistentGraph>, max_node_count: usize) -> Self
Create with a custom max-node capacity for the hot tier.
Sourcepub async fn load_from_cold(&self) -> HirnResult<()>
pub async fn load_from_cold(&self) -> HirnResult<()>
Load the hot tier from the cold tier (startup initialization).
Fetches all nodes and edges from the persistent graph and inserts them into the in-memory property graph.
Sourcepub fn hot_graph(&self) -> RwLockReadGuard<'_, PropertyGraph>
pub fn hot_graph(&self) -> RwLockReadGuard<'_, PropertyGraph>
Get a read reference to the hot tier for synchronous algorithms (spreading activation, PPR, Hebbian).
Sourcepub fn hot_arc(&self) -> Arc<RwLock<PropertyGraph>> ⓘ
pub fn hot_arc(&self) -> Arc<RwLock<PropertyGraph>> ⓘ
Get the Arc<RwLock<PropertyGraph>> handle for the hot tier.
Used to pass the graph into HirnSessionExt so that DataFusion
operators in hirn-exec can downcast and access PropertyGraph
without depending on hirn-engine.
Sourcepub fn hot_graph_mut(&self) -> RwLockWriteGuard<'_, PropertyGraph>
pub fn hot_graph_mut(&self) -> RwLockWriteGuard<'_, PropertyGraph>
Get a write reference to the hot tier (e.g. for Hebbian flush).
Sourcepub fn cold(&self) -> &PersistentGraph
pub fn cold(&self) -> &PersistentGraph
Reference to the cold tier for direct operations.
Sourcepub async fn flush_hot_access_counts(&self) -> HirnResult<()>
pub async fn flush_hot_access_counts(&self) -> HirnResult<()>
Flush hot-tier access_count updates to the cold-tier Lance dataset.
Drains the dirty set accumulated by record_access() calls and bulk-updates
the access_count column in the graph_nodes Lance dataset using a CASE
expression — one SQL round-trip per 500 nodes instead of one per node.
This is a no-op when no accesses have occurred since the last flush.
Sourcepub fn spawn_access_count_flush_task(
&self,
interval: Duration,
) -> JoinHandle<()>
pub fn spawn_access_count_flush_task( &self, interval: Duration, ) -> JoinHandle<()>
Spawn a background tokio task that periodically flushes hot-tier access counts to the cold tier.
The returned JoinHandle can be aborted at shutdown, but the calling
code may also simply drop it — the task will run until the Arcs it
holds are the last remaining references (i.e. until the store is dropped).
Sourcepub async fn add_nodes(&self, nodes: &[GraphNodeData]) -> HirnResult<()>
pub async fn add_nodes(&self, nodes: &[GraphNodeData]) -> HirnResult<()>
Add or update multiple nodes with one cold-tier write.
Trait Implementations§
Source§impl Clone for CachedGraphStore
impl Clone for CachedGraphStore
Source§fn clone(&self) -> CachedGraphStore
fn clone(&self) -> CachedGraphStore
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl GraphReadRuntime for CachedGraphStore
impl GraphReadRuntime for CachedGraphStore
fn activate_graph<'life0, 'life1, 'life2, 'life3, 'async_trait>(
&'life0 self,
seeds: &'life1 [MemoryId],
mode: ExecActivationMode,
ppr_config: Option<&'life2 PprConfig>,
max_depth: u32,
epsilon: f32,
inhibition_mu: f32,
delegation_threshold: usize,
allowed_namespaces: Option<&'life3 [Namespace]>,
) -> Pin<Box<dyn Future<Output = HirnResult<GraphActivationOutput>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
'life2: 'async_trait,
'life3: 'async_trait,
fn causal_chain<'life0, 'life1, 'life2, 'async_trait>(
&'life0 self,
start_ids: &'life1 [MemoryId],
max_depth: u32,
confidence_threshold: f32,
delegation_threshold: usize,
relation: EdgeRelation,
allowed_namespaces: Option<&'life2 [Namespace]>,
) -> Pin<Box<dyn Future<Output = HirnResult<Vec<GraphCausalChainRow>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
'life2: 'async_trait,
fn traverse_graph<'life0, 'life1, 'life2, 'life3, 'async_trait>(
&'life0 self,
start_ids: &'life1 [MemoryId],
max_depth: u32,
delegation_threshold: usize,
relation_filter: Option<&'life2 [EdgeRelation]>,
allowed_namespaces: Option<&'life3 [Namespace]>,
) -> Pin<Box<dyn Future<Output = HirnResult<Vec<GraphTraverseRow>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
'life2: 'async_trait,
'life3: 'async_trait,
Source§impl GraphStore for CachedGraphStore
impl GraphStore for CachedGraphStore
Source§fn add_node<'life0, 'async_trait>(
&'life0 self,
id: MemoryId,
layer: Layer,
importance: f32,
created_at: Timestamp,
namespace: Namespace,
) -> Pin<Box<dyn Future<Output = HirnResult<bool>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn add_node<'life0, 'async_trait>(
&'life0 self,
id: MemoryId,
layer: Layer,
importance: f32,
created_at: Timestamp,
namespace: Namespace,
) -> Pin<Box<dyn Future<Output = HirnResult<bool>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Insert a graph node. Returns
true if newly inserted, false if it
already existed.Source§fn remove_node<'life0, 'async_trait>(
&'life0 self,
id: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<bool>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn remove_node<'life0, 'async_trait>(
&'life0 self,
id: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<bool>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Remove a node and all its incident edges. Returns
true if the node
existed.Source§fn has_node<'life0, 'async_trait>(
&'life0 self,
id: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<bool>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn has_node<'life0, 'async_trait>(
&'life0 self,
id: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<bool>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Check whether a node exists.
Source§fn get_node<'life0, 'async_trait>(
&'life0 self,
id: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<Option<GraphNodeData>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn get_node<'life0, 'async_trait>(
&'life0 self,
id: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<Option<GraphNodeData>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Retrieve full node data, or
None if absent.Source§fn node_ids<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = HirnResult<Vec<MemoryId>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn node_ids<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = HirnResult<Vec<MemoryId>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Return all node IDs in the graph.
Source§fn node_importance<'life0, 'async_trait>(
&'life0 self,
id: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<Option<f32>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn node_importance<'life0, 'async_trait>(
&'life0 self,
id: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<Option<f32>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Get the importance score for a node.
Source§fn set_node_importance<'life0, 'async_trait>(
&'life0 self,
id: MemoryId,
importance: f32,
) -> Pin<Box<dyn Future<Output = HirnResult<()>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn set_node_importance<'life0, 'async_trait>(
&'life0 self,
id: MemoryId,
importance: f32,
) -> Pin<Box<dyn Future<Output = HirnResult<()>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Set the importance score for a node.
Source§fn node_layer<'life0, 'async_trait>(
&'life0 self,
id: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<Option<Layer>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn node_layer<'life0, 'async_trait>(
&'life0 self,
id: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<Option<Layer>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Get the layer of a node.
Source§fn node_namespace<'life0, 'async_trait>(
&'life0 self,
id: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<Option<Namespace>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn node_namespace<'life0, 'async_trait>(
&'life0 self,
id: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<Option<Namespace>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Get the namespace of a node.
Source§fn namespaces_compatible<'life0, 'async_trait>(
&'life0 self,
a: MemoryId,
b: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<bool>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn namespaces_compatible<'life0, 'async_trait>(
&'life0 self,
a: MemoryId,
b: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<bool>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Check whether two nodes’ namespaces are compatible for auto-edge
creation (same namespace, or either is “shared”).
Source§fn add_edge<'life0, 'async_trait>(
&'life0 self,
source: MemoryId,
target: MemoryId,
relation: EdgeRelation,
weight: f32,
metadata: Metadata,
) -> Pin<Box<dyn Future<Output = HirnResult<EdgeId>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn add_edge<'life0, 'async_trait>(
&'life0 self,
source: MemoryId,
target: MemoryId,
relation: EdgeRelation,
weight: f32,
metadata: Metadata,
) -> Pin<Box<dyn Future<Output = HirnResult<EdgeId>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Source§fn add_causal_edge<'life0, 'async_trait>(
&'life0 self,
source: MemoryId,
target: MemoryId,
relation: EdgeRelation,
weight: f32,
metadata: Metadata,
causal: CausalEdgeData,
) -> Pin<Box<dyn Future<Output = HirnResult<EdgeId>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn add_causal_edge<'life0, 'async_trait>(
&'life0 self,
source: MemoryId,
target: MemoryId,
relation: EdgeRelation,
weight: f32,
metadata: Metadata,
causal: CausalEdgeData,
) -> Pin<Box<dyn Future<Output = HirnResult<EdgeId>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Create a causal edge with associated
CausalEdgeData. Read moreSource§fn remove_edge<'life0, 'async_trait>(
&'life0 self,
edge_id: EdgeId,
) -> Pin<Box<dyn Future<Output = HirnResult<()>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn remove_edge<'life0, 'async_trait>(
&'life0 self,
edge_id: EdgeId,
) -> Pin<Box<dyn Future<Output = HirnResult<()>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Remove an edge by ID.
Source§fn get_edge<'life0, 'async_trait>(
&'life0 self,
edge_id: EdgeId,
) -> Pin<Box<dyn Future<Output = HirnResult<Option<GraphEdge>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn get_edge<'life0, 'async_trait>(
&'life0 self,
edge_id: EdgeId,
) -> Pin<Box<dyn Future<Output = HirnResult<Option<GraphEdge>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Get a single edge by ID.
Source§fn get_edges<'life0, 'async_trait>(
&'life0 self,
node_id: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<Vec<GraphEdge>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn get_edges<'life0, 'async_trait>(
&'life0 self,
node_id: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<Vec<GraphEdge>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Get all edges incident to a node (both directions).
Source§fn get_edges_between<'life0, 'async_trait>(
&'life0 self,
a: MemoryId,
b: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<Vec<GraphEdge>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn get_edges_between<'life0, 'async_trait>(
&'life0 self,
a: MemoryId,
b: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<Vec<GraphEdge>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Get edges between two specific nodes.
Source§fn get_edges_of_type<'life0, 'async_trait>(
&'life0 self,
node_id: MemoryId,
relation: EdgeRelation,
) -> Pin<Box<dyn Future<Output = HirnResult<Vec<GraphEdge>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn get_edges_of_type<'life0, 'async_trait>(
&'life0 self,
node_id: MemoryId,
relation: EdgeRelation,
) -> Pin<Box<dyn Future<Output = HirnResult<Vec<GraphEdge>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Get edges of a specific relation type incident to a node.
Source§fn get_edges_of_type_many<'life0, 'life1, 'async_trait>(
&'life0 self,
node_ids: &'life1 [MemoryId],
relation: EdgeRelation,
) -> Pin<Box<dyn Future<Output = HirnResult<HashMap<MemoryId, Vec<GraphEdge>>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
fn get_edges_of_type_many<'life0, 'life1, 'async_trait>(
&'life0 self,
node_ids: &'life1 [MemoryId],
relation: EdgeRelation,
) -> Pin<Box<dyn Future<Output = HirnResult<HashMap<MemoryId, Vec<GraphEdge>>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
Get edges of a specific relation type incident to many nodes.
Source§fn all_edges<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = HirnResult<Vec<GraphEdge>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn all_edges<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = HirnResult<Vec<GraphEdge>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Get all edges in the graph.
Source§fn update_edge_weight<'life0, 'async_trait>(
&'life0 self,
edge_id: EdgeId,
new_weight: f32,
co_retrieval_count: Option<u64>,
) -> Pin<Box<dyn Future<Output = HirnResult<()>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn update_edge_weight<'life0, 'async_trait>(
&'life0 self,
edge_id: EdgeId,
new_weight: f32,
co_retrieval_count: Option<u64>,
) -> Pin<Box<dyn Future<Output = HirnResult<()>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Update the weight (and optionally co-retrieval count) of an edge.
Source§fn get_neighbors<'life0, 'async_trait>(
&'life0 self,
start: MemoryId,
depth: usize,
min_weight: f32,
) -> Pin<Box<dyn Future<Output = HirnResult<Vec<MemoryId>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn get_neighbors<'life0, 'async_trait>(
&'life0 self,
start: MemoryId,
depth: usize,
min_weight: f32,
) -> Pin<Box<dyn Future<Output = HirnResult<Vec<MemoryId>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
BFS neighbors up to
depth hops, filtering by minimum edge weight.Source§fn get_neighbors_filtered<'life0, 'life1, 'async_trait>(
&'life0 self,
start: MemoryId,
depth: usize,
min_weight: f32,
namespace: Option<&'life1 Namespace>,
) -> Pin<Box<dyn Future<Output = HirnResult<Vec<MemoryId>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
fn get_neighbors_filtered<'life0, 'life1, 'async_trait>(
&'life0 self,
start: MemoryId,
depth: usize,
min_weight: f32,
namespace: Option<&'life1 Namespace>,
) -> Pin<Box<dyn Future<Output = HirnResult<Vec<MemoryId>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
BFS neighbors with optional namespace filter.
Source§fn outgoing_weighted<'life0, 'async_trait>(
&'life0 self,
node_id: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<Vec<(MemoryId, f32, EdgeRelation)>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn outgoing_weighted<'life0, 'async_trait>(
&'life0 self,
node_id: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<Vec<(MemoryId, f32, EdgeRelation)>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Outgoing edges with
(target, weight, relation) tuples.Source§fn shortest_path<'life0, 'async_trait>(
&'life0 self,
source: MemoryId,
target: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<Option<Vec<MemoryId>>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn shortest_path<'life0, 'async_trait>(
&'life0 self,
source: MemoryId,
target: MemoryId,
) -> Pin<Box<dyn Future<Output = HirnResult<Option<Vec<MemoryId>>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Shortest path between two nodes (Dijkstra). Returns
None if no
path exists.Source§fn node_count<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = HirnResult<usize>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn node_count<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = HirnResult<usize>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Number of nodes in the graph.
Source§fn edge_count<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = HirnResult<usize>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn edge_count<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = HirnResult<usize>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Number of edges in the graph.
Auto Trait Implementations§
impl Freeze for CachedGraphStore
impl !RefUnwindSafe for CachedGraphStore
impl Send for CachedGraphStore
impl Sync for CachedGraphStore
impl Unpin for CachedGraphStore
impl UnsafeUnpin for CachedGraphStore
impl !UnwindSafe for CachedGraphStore
Blanket Implementations§
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Converts
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Converts
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Converts
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Converts
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> DowncastSend for T
impl<T> DowncastSend for T
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<T> FmtForward for T
impl<T> FmtForward for T
Source§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.Source§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.Source§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.Source§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.Source§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.Source§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.Source§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.Source§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.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 moreCreates a shared type from an unshared type.
Source§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
Source§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
Source§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 moreSource§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 moreSource§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
Source§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
Source§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.Source§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.Source§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.Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
Source§impl<T> Tap for T
impl<T> Tap for T
Source§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 moreSource§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 moreSource§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 moreSource§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 moreSource§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 moreSource§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 moreSource§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.Source§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.Source§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.Source§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.Source§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.Source§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.Source§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.