pub struct TaskWaitingCost {
sender: Sender<()>,
cur_cost: usize,
}
Expand description
Holds all tasks waiting for a cost limit to be released.
Fields§
§sender: Sender<()>
§cur_cost: usize
Implementations§
Source§impl TaskWaitingCost
impl TaskWaitingCost
Sourcepub async fn inc_cost(&mut self, problem: &mut Problem, amount: usize)
pub async fn inc_cost(&mut self, problem: &mut Problem, amount: usize)
Increments the cost associated with a task and updates the problem’s used cost.
It will wait for the specified amount of cost to be released before proceeding.
Sourcepub fn release_cost_limit(&mut self, count: usize)
pub fn release_cost_limit(&mut self, count: usize)
Releases a specified number of waiting slots on a task queue.
This function sends a signal to the task queue, allowing the specified number of tasks to proceed.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for TaskWaitingCost
impl !RefUnwindSafe for TaskWaitingCost
impl !Send for TaskWaitingCost
impl !Sync for TaskWaitingCost
impl Unpin for TaskWaitingCost
impl !UnwindSafe for TaskWaitingCost
Blanket Implementations§
Source§impl<T> AllocForAny<T> for T
impl<T> AllocForAny<T> for T
Source§fn galloc(self) -> &'static T
fn galloc(self) -> &'static T
Provides a method to allocate an instance of T
on the heap with a static lifetime.
This implementation of galloc
takes ownership of the T
instance and uses the alloc
function to place it in a location with a static lifetime, presumably managing it in a way that ensures its persistence for the duration of the program.
This can be particularly useful for scenarios where a static lifetime is required, such as when interfacing with systems or patterns that necessitate global state or long-lived data.
Source§fn galloc_mut(self) -> &'static T
fn galloc_mut(self) -> &'static T
Provides a method that moves the instance and returns a reference to it allocated with a static lifetime.
This method utilizes alloc_mut
to perform the allocation, likely involving allocating the resource in a manner that ensures it lives for the entire duration of the application.
These semantics allow the user to safely assume that the reference will not expire during the program’s execution, making it suitable for long-lived data structures or operations that require such guarantees.
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
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>
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>
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