Struct l337::Pool

pub struct Pool<C: ManageConnection + Send> { /* fields omitted */ }

General connection pool

Implementations

impl<C: ManageConnection> Pool<C>

pub fn min_conns(&self) -> usize

Minimum number of connections in the pool.

pub fn max_conns(&self) -> usize

Maximum possible number of connections in the pool.

impl<C: ManageConnection + Send> Pool<C>

pub async fn new(manager: C, config: Config) -> Result<Pool<C>, Error<C::Error>>

Creates a new connection pool

The returned future will resolve to the pool if successful, which can then be used immediately.

pub async fn connection(&self) -> Result<Conn<C>, Error<C::Error>>

Returns a future that resolves to a connection from the pool.

If there are connections that are available to be used, the future will resolve immediately, otherwise, the connection will be in a pending state until a future is returned to the pool.

Timeout ability can be added to this method by calling connection_timeout on the Config.

pub fn put_back(&self, conn: Live<C::Connection>)

Receive a connection back to be stored in the pool. This could have one of two outcomes:

• The connection will be passed to a waiting future, if any exist.
• The connection will be put back into the connection pool.

pub fn total_conns(&self) -> usize

The total number of connections in the pool.

pub fn idle_conns(&self) -> usize

The number of idle connections in the pool.

pub fn idle_conns_push_error(&self) -> usize

The number of errors when the connection push back to the pool.

pub fn waiters(&self) -> usize

The number of waiters for the next available connections.

Trait Implementations

impl<C> Clone for Pool<C> where
    C: ManageConnection, 

Returns a new Pool referencing the same state as self.

fn clone(&self) -> Pool<C>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<C: ManageConnection + Send + Debug> Debug for Pool<C>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.