[−][src]Struct websocket::server::WsServer

[+] Show declaration

pub struct WsServer<S, L> where
    S: OptionalTlsAcceptor,  {
    pub ssl_acceptor: S,
    // some fields omitted
}

[−]

Represents a WebSocket server which can work with either normal (non-secure) connections, or secure WebSocket connections.

This is a convenient way to implement WebSocket servers, however it is possible to use any sendable Reader and Writer to obtain a WebSocketClient, so if needed, an alternative server implementation can be used.

Synchronous Servers

Synchronous implementations of a websocket server are available below, each method is documented so the reader knows whether is it synchronous or asynchronous.

To use the synchronous implementation, you must have the sync feature enabled (it is enabled by default). To use the synchronous SSL implementation, you must have the sync-ssl feature enabled (it is enabled by default).

Asynchronous Servers

Asynchronous implementations of a websocket server are available below, each method is documented so the reader knows whether is it synchronous or asynchronous. Simply look out for the implementation of Server whose methods only return Futures (it is also written in the docs if the method is async).

To use the asynchronous implementation, you must have the async feature enabled (it is enabled by default). To use the asynchronous SSL implementation, you must have the async-ssl feature enabled (it is enabled by default).

A Hyper Server

This crates comes with hyper integration out of the box, you can create a hyper server and serve websocket and HTTP on the same port! check out the docs over at websocket::server::upgrade::sync::HyperRequest for an example.

A Custom Server

So you don't want to use any of our server implementations? That's O.K. All it takes is implementing the IntoWs trait for your server's streams, then calling .into_ws() on them. check out the docs over at websocket::server::upgrade::sync for more.

Fields

ssl_acceptor: S

[−]

The SSL acceptor given to the server

Methods

`impl WsServer<NoTlsAcceptor, TcpListener>`
[src]
[−]

[−]

Asynchronous methods for creating an async server and accepting incoming connections.

`pub fn bind<A: ToSocketAddrs>(addr: A, handle: &Handle) -> Result<Self>`
[src]
[−]

Bind a websocket server to an address. Creating a websocket server can be done immediately so this does not return a Future but a simple Result.

`pub fn incoming(self) -> Incoming<TcpStream>`
[src]
[−]

Turns the server into a stream of connection objects.

Each item of the stream is the address of the incoming connection and an Upgrade struct which lets the user decide whether to turn the connection into a websocket connection or reject it.

See the [examples/async-server.rs] (https://github.com/cyderize/rust-websocket/blob/master/examples/async-server.rs) example for a good echo server example.

`impl WsServer<TlsAcceptor, TcpListener>`
[src]
[−]

[−]

Asynchronous methods for creating an async SSL server and accepting incoming connections.

`pub fn bind_secure<A: ToSocketAddrs>( addr: A, acceptor: TlsAcceptor, handle: &Handle ) -> Result<Self>`
[src]
[−]

Bind an SSL websocket server to an address. Creating a websocket server can be done immediately so this does not return a Future but a simple Result.

Since this is an SSL server one needs to provide a TlsAcceptor that contains the server's SSL information.

`pub fn incoming(self) -> Incoming<TlsStream<TcpStream>>`
[src]
[−]

Turns the server into a stream of connection objects.

Each item of the stream is the address of the incoming connection and an Upgrade struct which lets the user decide whether to turn the connection into a websocket connection or reject it.

See the [examples/async-server.rs] (https://github.com/cyderize/rust-websocket/blob/master/examples/async-server.rs) example for a good echo server example.

`impl<S> WsServer<S, TcpListener> where S: OptionalTlsAcceptor,`
[src]
[−]

[−]

Synchronous methods for creating a server and accepting incoming connections.

`pub fn local_addr(&self) -> Result<SocketAddr>`
[src]
[−]

Get the socket address of this server

`pub fn set_nonblocking(&self, nonblocking: bool) -> Result<()>`
[src]
[−]

Changes whether the Server is in nonblocking mode. NOTE: It is strongly encouraged to use the websocket::async module instead of this. It provides high level APIs for creating asynchronous servers.

If it is in nonblocking mode, accept() will return an error instead of blocking when there are no incoming connections.

 // Suppose we have to work in a single thread, but want to
 // accomplish two unrelated things:
 // (1) Once in a while we want to check if anybody tried to connect to
 // our websocket server, and if so, handle the TcpStream.
 // (2) In between we need to something else, possibly unrelated to networking.

 let mut server = Server::bind("127.0.0.1:0").unwrap();

 // Set the server to non-blocking.
 server.set_nonblocking(true);

 for i in 1..3 {
    let result = match server.accept() {
        Ok(wsupgrade) => {
            // Do something with the established TcpStream.
        }
        _ => {
            // Nobody tried to connect, move on.
        }
    };
    // Perform another task. Because we have a non-blocking server,
    // this will execute independent of whether someone tried to
    // establish a connection.
    let two = 1+1;
 }

`pub fn into_async(self, handle: &Handle) -> Result<Server<S>>`
[src]
[−]

Turns an existing synchronous server into an asynchronous one. This will only work if the stream used for this server S already implements AsyncRead + AsyncWrite. Useful if you would like some blocking things to happen at the start of your server.

`impl WsServer<TlsAcceptor, TcpListener>`
[src]
[−]

[−]

Synchronous methods for creating an SSL server and accepting incoming connections.

`pub fn bind_secure<A>(addr: A, acceptor: TlsAcceptor) -> Result<Self> where A: ToSocketAddrs,`
[src]
[−]

Bind this Server to this socket, utilising the given SslContext

Secure Servers

extern crate websocket;
extern crate native_tls;
use std::thread;
use std::io::Read;
use std::fs::File;
use websocket::Message;
use websocket::sync::Server;
use native_tls::{Identity, TlsAcceptor};

// In this example we retrieve our keypair and certificate chain from a PKCS #12 archive,
// but but they can also be retrieved from, for example, individual PEM- or DER-formatted
// files. See the documentation for the `PKey` and `X509` types for more details.
let mut file = File::open("identity.pfx").unwrap();
let mut pkcs12 = vec![];
file.read_to_end(&mut pkcs12).unwrap();
let pkcs12 = Identity::from_pkcs12(&pkcs12, "hacktheplanet").unwrap();

let acceptor = TlsAcceptor::builder(pkcs12).build().unwrap();

let server = Server::bind_secure("127.0.0.1:1234", acceptor).unwrap();

for connection in server.filter_map(Result::ok) {
    // Spawn a new thread for each connection.
    thread::spawn(move || {
            let mut client = connection.accept().unwrap();

            let message = Message::text("Hello, client!");
            let _ = client.send_message(&message);

            // ...
    });
}

`pub fn accept(&mut self) -> AcceptResult<TlsStream<TcpStream>>`
[src]
[−]

Wait for and accept an incoming WebSocket connection, returning a WebSocketRequest

`impl WsServer<NoTlsAcceptor, TcpListener>`
[src]
[−]

`pub fn bind<A: ToSocketAddrs>(addr: A) -> Result<Self>`
[src]
[−]

Bind this Server to this socket

Non-secure Servers

extern crate websocket;
use std::thread;
use websocket::Message;
use websocket::sync::Server;

let server = Server::bind("127.0.0.1:1234").unwrap();

for connection in server.filter_map(Result::ok) {
    // Spawn a new thread for each connection.
    thread::spawn(move || {
          let mut client = connection.accept().unwrap();

          let message = Message::text("Hello, client!");
          let _ = client.send_message(&message);

          // ...
   });
}

`pub fn accept(&mut self) -> AcceptResult<TcpStream>`
[src]
[−]

Wait for and accept an incoming WebSocket connection, returning a WebSocketRequest

`pub fn try_clone(&self) -> Result<Self>`
[src]
[−]

Create a new independently owned handle to the underlying socket.

Trait Implementations

`impl Iterator for WsServer<TlsAcceptor, TcpListener>`
[src]
[+]

`type Item = AcceptResult<TlsStream<TcpStream>>`

The type of the elements being iterated over.

`fn next(&mut self) -> Option<Self::Item>`
[src]
[−]

Advances the iterator and returns the next value. Read more

`fn size_hint(&self) -> (usize, Option<usize>)`
1.0.0
[src]
[−]

Returns the bounds on the remaining length of the iterator. Read more

`fn count(self) -> usize`
1.0.0
[src]
[−]

Consumes the iterator, counting the number of iterations and returning it. Read more

`fn last(self) -> Option<Self::Item>`
1.0.0
[src]
[−]

Consumes the iterator, returning the last element. Read more

`fn nth(&mut self, n: usize) -> Option<Self::Item>`
1.0.0
[src]
[−]

Returns the nth element of the iterator. Read more

`fn step_by(self, step: usize) -> StepBy<Self>`
1.28.0
[src]
[−]

Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Read more

`fn chain(self, other: U) -> Chain<Self, ::IntoIter> where U: IntoIterator<Item = Self::Item>,`
1.0.0
[src]
[−]

Takes two iterators and creates a new iterator over both in sequence. Read more

`fn zip(self, other: U) -> Zip<Self, ::IntoIter> where U: IntoIterator,`
1.0.0
[src]
[−]

'Zips up' two iterators into a single iterator of pairs. Read more

`fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B,`
1.0.0
[src]
[−]

Takes a closure and creates an iterator which calls that closure on each element. Read more

`fn for_each<F>(self, f: F) where F: FnMut(Self::Item),`
1.21.0
[src]
[−]

Calls a closure on each element of an iterator. Read more

`fn filter(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool,`
1.0.0
[src]
[−]

Creates an iterator which uses a closure to determine if an element should be yielded. Read more

`fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option,`
1.0.0
[src]
[−]

Creates an iterator that both filters and maps. Read more

`fn enumerate(self) -> Enumerate<Self>`
1.0.0
[src]
[−]

Creates an iterator which gives the current iteration count as well as the next value. Read more

`fn peekable(self) -> Peekable<Self>`
1.0.0
[src]
[−]

Creates an iterator which can use peek to look at the next element of the iterator without consuming it. Read more

`fn skip_while(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool,`
1.0.0
[src]
[−]

Creates an iterator that [skip]s elements based on a predicate. Read more

`fn take_while(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool,`
1.0.0
[src]
[−]

Creates an iterator that yields elements based on a predicate. Read more

`fn skip(self, n: usize) -> Skip<Self>`
1.0.0
[src]
[−]

Creates an iterator that skips the first n elements. Read more

`fn take(self, n: usize) -> Take<Self>`
1.0.0
[src]
[−]

Creates an iterator that yields its first n elements. Read more

`fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option,`
1.0.0
[src]
[−]

An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

`fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator,`
1.0.0
[src]
[−]

Creates an iterator that works like map, but flattens nested structure. Read more

`fn flatten(self) -> Flatten<Self> where Self::Item: IntoIterator,`
1.29.0
[src]
[−]

Creates an iterator that flattens nested structure. Read more

`fn fuse(self) -> Fuse<Self>`
1.0.0
[src]
[−]

Creates an iterator which ends after the first [None]. Read more

`fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item),`
1.0.0
[src]
[−]

Do something with each element of an iterator, passing the value on. Read more

`fn by_ref(&mut self) -> &mut Self`
1.0.0
[src]
[−]

Borrows an iterator, rather than consuming it. Read more

[+] Expand attributes #[must_use = "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"] fn collect(self) -> B where B: FromIterator<Self::Item>,
1.0.0
[src]
[−]

Transforms an iterator into a collection. Read more

`fn partition<B, F>(self, f: F) -> (B, B) where B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool,`
1.0.0
[src]
[−]

Consumes an iterator, creating two collections from it. Read more

`fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where F: FnMut(B, Self::Item) -> R, R: Try<Ok = B>,`
1.27.0
[src]
[−]

An iterator method that applies a function as long as it returns successfully, producing a single, final value. Read more

`fn try_for_each<F, R>(&mut self, f: F) -> R where F: FnMut(Self::Item) -> R, R: Try<Ok = ()>,`
1.27.0
[src]
[−]

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error. Read more

`fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B,`
1.0.0
[src]
[−]

An iterator method that applies a function, producing a single, final value. Read more

`fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool,`
1.0.0
[src]
[−]

Tests if every element of the iterator matches a predicate. Read more

`fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool,`
1.0.0
[src]
[−]

Tests if any element of the iterator matches a predicate. Read more

`fn find(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool,`
1.0.0
[src]
[−]

Searches for an element of an iterator that satisfies a predicate. Read more

`fn find_map<B, F>(&mut self, f: F) -> Option where F: FnMut(Self::Item) -> Option,`
1.30.0
[src]
[−]

Applies function to the elements of iterator and returns the first non-none result. Read more

`fn position(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool,`
1.0.0
[src]
[−]

Searches for an element in an iterator, returning its index. Read more

`fn rposition(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator,`
1.0.0
[src]
[−]

Searches for an element in an iterator from the right, returning its index. Read more

`fn max(self) -> Option<Self::Item> where Self::Item: Ord,`
1.0.0
[src]
[−]

Returns the maximum element of an iterator. Read more

`fn min(self) -> Option<Self::Item> where Self::Item: Ord,`
1.0.0
[src]
[−]

Returns the minimum element of an iterator. Read more

`fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B,`
1.6.0
[src]
[−]

Returns the element that gives the maximum value from the specified function. Read more

`fn max_by<F>(self, compare: F) -> Option<Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering,`
1.15.0
[src]
[−]

Returns the element that gives the maximum value with respect to the specified comparison function. Read more

`fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B,`
1.6.0
[src]
[−]

Returns the element that gives the minimum value from the specified function. Read more

`fn min_by<F>(self, compare: F) -> Option<Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering,`
1.15.0
[src]
[−]

Returns the element that gives the minimum value with respect to the specified comparison function. Read more

`fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator,`
1.0.0
[src]
[−]

Reverses an iterator's direction. Read more

`fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromA: Default + Extend<A>, FromB: Default + Extend, Self: Iterator<Item = (A, B)>,`
1.0.0
[src]
[−]

Converts an iterator of pairs into a pair of containers. Read more

`fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item = &'a T>, T: 'a + Clone,`
1.0.0
[src]
[−]

Creates an iterator which [clone]s all of its elements. Read more

`fn cycle(self) -> Cycle<Self> where Self: Clone,`
1.0.0
[src]
[−]

Repeats an iterator endlessly. Read more

`fn sum<S>(self) -> S where S: Sum<Self::Item>,`
1.11.0
[src]
[−]

Sums the elements of an iterator. Read more

`fn product(self) -> P where P: Product<Self::Item>,`
1.11.0
[src]
[−]

Iterates over the entire iterator, multiplying all the elements Read more

`fn cmp(self, other: I) -> Ordering where I: IntoIterator<Item = Self::Item>, Self::Item: Ord,`
1.5.0
[src]
[−]

Lexicographically compares the elements of this Iterator with those of another. Read more

`fn partial_cmp(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<::Item>,`
1.5.0
[src]
[−]

Lexicographically compares the elements of this Iterator with those of another. Read more

`fn eq(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<::Item>,`
1.5.0
[src]
[−]

Determines if the elements of this Iterator are equal to those of another. Read more

`fn ne(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<::Item>,`
1.5.0
[src]
[−]

Determines if the elements of this Iterator are unequal to those of another. Read more

`fn lt(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<::Item>,`
1.5.0
[src]
[−]

Determines if the elements of this Iterator are lexicographically less than those of another. Read more

`fn le(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<::Item>,`
1.5.0
[src]
[−]

Determines if the elements of this Iterator are lexicographically less or equal to those of another. Read more

`fn gt(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<::Item>,`
1.5.0
[src]
[−]

Determines if the elements of this Iterator are lexicographically greater than those of another. Read more

`fn ge(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<::Item>,`
1.5.0
[src]
[−]

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another. Read more

`impl Iterator for WsServer<NoTlsAcceptor, TcpListener>`
[src]
[+]

`type Item = AcceptResult<TcpStream>`

The type of the elements being iterated over.

`fn next(&mut self) -> Option<Self::Item>`
[src]
[−]

Advances the iterator and returns the next value. Read more

`fn size_hint(&self) -> (usize, Option<usize>)`
1.0.0
[src]
[−]

Returns the bounds on the remaining length of the iterator. Read more

`fn count(self) -> usize`
1.0.0
[src]
[−]

Consumes the iterator, counting the number of iterations and returning it. Read more

`fn last(self) -> Option<Self::Item>`
1.0.0
[src]
[−]

Consumes the iterator, returning the last element. Read more

`fn nth(&mut self, n: usize) -> Option<Self::Item>`
1.0.0
[src]
[−]

Returns the nth element of the iterator. Read more

`fn step_by(self, step: usize) -> StepBy<Self>`
1.28.0
[src]
[−]

Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Read more

`fn chain(self, other: U) -> Chain<Self, ::IntoIter> where U: IntoIterator<Item = Self::Item>,`
1.0.0
[src]
[−]

Takes two iterators and creates a new iterator over both in sequence. Read more

`fn zip(self, other: U) -> Zip<Self, ::IntoIter> where U: IntoIterator,`
1.0.0
[src]
[−]

'Zips up' two iterators into a single iterator of pairs. Read more

`fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B,`
1.0.0
[src]
[−]

Takes a closure and creates an iterator which calls that closure on each element. Read more

`fn for_each<F>(self, f: F) where F: FnMut(Self::Item),`
1.21.0
[src]
[−]

Calls a closure on each element of an iterator. Read more

`fn filter(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool,`
1.0.0
[src]
[−]

Creates an iterator which uses a closure to determine if an element should be yielded. Read more

`fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option,`
1.0.0
[src]
[−]

Creates an iterator that both filters and maps. Read more

`fn enumerate(self) -> Enumerate<Self>`
1.0.0
[src]
[−]

Creates an iterator which gives the current iteration count as well as the next value. Read more

`fn peekable(self) -> Peekable<Self>`
1.0.0
[src]
[−]

Creates an iterator which can use peek to look at the next element of the iterator without consuming it. Read more

`fn skip_while(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool,`
1.0.0
[src]
[−]

Creates an iterator that [skip]s elements based on a predicate. Read more

`fn take_while(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool,`
1.0.0
[src]
[−]

Creates an iterator that yields elements based on a predicate. Read more

`fn skip(self, n: usize) -> Skip<Self>`
1.0.0
[src]
[−]

Creates an iterator that skips the first n elements. Read more

`fn take(self, n: usize) -> Take<Self>`
1.0.0
[src]
[−]

Creates an iterator that yields its first n elements. Read more

`fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option,`
1.0.0
[src]
[−]

An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

`fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator,`
1.0.0
[src]
[−]

Creates an iterator that works like map, but flattens nested structure. Read more

`fn flatten(self) -> Flatten<Self> where Self::Item: IntoIterator,`
1.29.0
[src]
[−]

Creates an iterator that flattens nested structure. Read more

`fn fuse(self) -> Fuse<Self>`
1.0.0
[src]
[−]

Creates an iterator which ends after the first [None]. Read more

`fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item),`
1.0.0
[src]
[−]

Do something with each element of an iterator, passing the value on. Read more

`fn by_ref(&mut self) -> &mut Self`
1.0.0
[src]
[−]

Borrows an iterator, rather than consuming it. Read more

[+] Expand attributes #[must_use = "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"] fn collect(self) -> B where B: FromIterator<Self::Item>,
1.0.0
[src]
[−]

Transforms an iterator into a collection. Read more

`fn partition<B, F>(self, f: F) -> (B, B) where B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool,`
1.0.0
[src]
[−]

Consumes an iterator, creating two collections from it. Read more

`fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where F: FnMut(B, Self::Item) -> R, R: Try<Ok = B>,`
1.27.0
[src]
[−]

An iterator method that applies a function as long as it returns successfully, producing a single, final value. Read more

`fn try_for_each<F, R>(&mut self, f: F) -> R where F: FnMut(Self::Item) -> R, R: Try<Ok = ()>,`
1.27.0
[src]
[−]

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error. Read more

`fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B,`
1.0.0
[src]
[−]

An iterator method that applies a function, producing a single, final value. Read more

`fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool,`
1.0.0
[src]
[−]

Tests if every element of the iterator matches a predicate. Read more

`fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool,`
1.0.0
[src]
[−]

Tests if any element of the iterator matches a predicate. Read more

`fn find(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool,`
1.0.0
[src]
[−]

Searches for an element of an iterator that satisfies a predicate. Read more

`fn find_map<B, F>(&mut self, f: F) -> Option where F: FnMut(Self::Item) -> Option,`
1.30.0
[src]
[−]

Applies function to the elements of iterator and returns the first non-none result. Read more

`fn position(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool,`
1.0.0
[src]
[−]

Searches for an element in an iterator, returning its index. Read more

`fn rposition(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator,`
1.0.0
[src]
[−]

Searches for an element in an iterator from the right, returning its index. Read more

`fn max(self) -> Option<Self::Item> where Self::Item: Ord,`
1.0.0
[src]
[−]

Returns the maximum element of an iterator. Read more

`fn min(self) -> Option<Self::Item> where Self::Item: Ord,`
1.0.0
[src]
[−]

Returns the minimum element of an iterator. Read more

`fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B,`
1.6.0
[src]
[−]

Returns the element that gives the maximum value from the specified function. Read more

`fn max_by<F>(self, compare: F) -> Option<Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering,`
1.15.0
[src]
[−]

Returns the element that gives the maximum value with respect to the specified comparison function. Read more

`fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B,`
1.6.0
[src]
[−]

Returns the element that gives the minimum value from the specified function. Read more

`fn min_by<F>(self, compare: F) -> Option<Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering,`
1.15.0
[src]
[−]

Returns the element that gives the minimum value with respect to the specified comparison function. Read more

`fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator,`
1.0.0
[src]
[−]

Reverses an iterator's direction. Read more

`fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromA: Default + Extend<A>, FromB: Default + Extend, Self: Iterator<Item = (A, B)>,`
1.0.0
[src]
[−]

Converts an iterator of pairs into a pair of containers. Read more

`fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item = &'a T>, T: 'a + Clone,`
1.0.0
[src]
[−]

Creates an iterator which [clone]s all of its elements. Read more

`fn cycle(self) -> Cycle<Self> where Self: Clone,`
1.0.0
[src]
[−]

Repeats an iterator endlessly. Read more

`fn sum<S>(self) -> S where S: Sum<Self::Item>,`
1.11.0
[src]
[−]

Sums the elements of an iterator. Read more

`fn product(self) -> P where P: Product<Self::Item>,`
1.11.0
[src]
[−]

Iterates over the entire iterator, multiplying all the elements Read more

`fn cmp(self, other: I) -> Ordering where I: IntoIterator<Item = Self::Item>, Self::Item: Ord,`
1.5.0
[src]
[−]

Lexicographically compares the elements of this Iterator with those of another. Read more

`fn partial_cmp(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<::Item>,`
1.5.0
[src]
[−]

Lexicographically compares the elements of this Iterator with those of another. Read more

`fn eq(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<::Item>,`
1.5.0
[src]
[−]

Determines if the elements of this Iterator are equal to those of another. Read more

`fn ne(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<::Item>,`
1.5.0
[src]
[−]

Determines if the elements of this Iterator are unequal to those of another. Read more

`fn lt(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<::Item>,`
1.5.0
[src]
[−]

Determines if the elements of this Iterator are lexicographically less than those of another. Read more

`fn le(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<::Item>,`
1.5.0
[src]
[−]

Determines if the elements of this Iterator are lexicographically less or equal to those of another. Read more

`fn gt(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<::Item>,`
1.5.0
[src]
[−]

Determines if the elements of this Iterator are lexicographically greater than those of another. Read more

`fn ge(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<::Item>,`
1.5.0
[src]
[−]

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another. Read more

Auto Trait Implementations

`impl<S, L> Send for WsServer<S, L> where L: Send, S: Send,`

`impl<S, L> Sync for WsServer<S, L> where L: Sync, S: Sync,`

Blanket Implementations

`impl<T, U> Into for T where U: From<T>,`
[src]
[−]

`fn into(self) -> U`
[src]
[−]

Performs the conversion.

`impl<T> From for T`
[src]
[−]

`fn from(t: T) -> T`
[src]
[−]

Performs the conversion.

`impl IntoIterator for I where I: Iterator,`
[src]
[−]

`type Item = ::Item`

The type of the elements being iterated over.

`type IntoIter = I`

Which kind of iterator are we turning this into?

`fn into_iter(self) -> I`
[src]
[−]

Creates an iterator from a value. Read more

`impl<T, U> TryFrom for T where T: From,`
[src]
[−]

`type Error = !`

🔬 This is a nightly-only experimental API. (try_from)

The type returned in the event of a conversion error.

`fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>`
[src]
[−]

🔬 This is a nightly-only experimental API. (try_from)

Performs the conversion.

`impl<T> Borrow for T where T: ?Sized,`
[src]
[−]

`fn borrow(&self) -> &T`
[src]
[−]

Immutably borrows from an owned value. Read more

`impl<T> BorrowMut for T where T: ?Sized,`
[src]
[−]

`fn borrow_mut(&mut self) -> &mut T`
[src]
[−]

Mutably borrows from an owned value. Read more

`impl<T, U> TryInto for T where U: TryFrom<T>,`
[src]
[−]

`type Error = >::Error`

🔬 This is a nightly-only experimental API. (try_from)

The type returned in the event of a conversion error.

`fn try_into(self) -> Result<U, >::Error>`
[src]
[−]

🔬 This is a nightly-only experimental API. (try_from)

Performs the conversion.

`impl<T> Any for T where T: 'static + ?Sized,`
[src]
[−]

`fn get_type_id(&self) -> TypeId`
[src]
[−]

🔬 This is a nightly-only experimental API. (get_type_id)

this method will likely be replaced by an associated static

Gets the TypeId of self. Read more

`impl<T> Typeable for T where T: Any,`
[src]
[−]

`fn get_type(&self) -> TypeId`
[src]
[−]

Get the TypeId of this object.

`impl UnicodeNormalization for I where I: Iterator<Item = char>,`
[src]
[−]

`fn nfd(self) -> Decompositions`
[src]
[−]

Returns an iterator over the string in Unicode Normalization Form D (canonical decomposition). Read more

`fn nfkd(self) -> Decompositions`
[src]
[−]

Returns an iterator over the string in Unicode Normalization Form KD (compatibility decomposition). Read more

`fn nfc(self) -> Recompositions`
[src]
[−]

An Iterator over the string in Unicode Normalization Form C (canonical decomposition followed by canonical composition). Read more

`fn nfkc(self) -> Recompositions`
[src]
[−]

An Iterator over the string in Unicode Normalization Form KC (compatibility decomposition followed by canonical composition). Read more

`fn stream_safe(self) -> StreamSafe`
[src]
[−]

An Iterator over the string with Conjoining Grapheme Joiner characters inserted according to the Stream-Safe Text Process (UAX15-D4) Read more

[−][src]Struct websocket::server::WsServer

Synchronous Servers

Asynchronous Servers

A Hyper Server

A Custom Server

Fields

Methods

impl WsServer<NoTlsAcceptor, TcpListener>[src][−]

pub fn bind<A: ToSocketAddrs>(addr: A, handle: &Handle) -> Result<Self>[src][−]

pub fn incoming(self) -> Incoming<TcpStream>[src][−]

impl WsServer<TlsAcceptor, TcpListener>[src][−]

pub fn bind_secure<A: ToSocketAddrs>( addr: A, acceptor: TlsAcceptor, handle: &Handle) -> Result<Self>[src][−]

pub fn incoming(self) -> Incoming<TlsStream<TcpStream>>[src][−]

impl<S> WsServer<S, TcpListener> where S: OptionalTlsAcceptor, [src][−]

pub fn local_addr(&self) -> Result<SocketAddr>[src][−]

pub fn set_nonblocking(&self, nonblocking: bool) -> Result<()>[src][−]

pub fn into_async(self, handle: &Handle) -> Result<Server<S>>[src][−]

impl WsServer<TlsAcceptor, TcpListener>[src][−]

pub fn bind_secure<A>(addr: A, acceptor: TlsAcceptor) -> Result<Self> where A: ToSocketAddrs, [src][−]

Secure Servers

pub fn accept(&mut self) -> AcceptResult<TlsStream<TcpStream>>[src][−]

impl WsServer<NoTlsAcceptor, TcpListener>[src][−]

pub fn bind<A: ToSocketAddrs>(addr: A) -> Result<Self>[src][−]

Non-secure Servers

pub fn accept(&mut self) -> AcceptResult<TcpStream>[src][−]

pub fn try_clone(&self) -> Result<Self>[src][−]

Trait Implementations

impl Iterator for WsServer<TlsAcceptor, TcpListener>[src][+]

type Item = AcceptResult<TlsStream<TcpStream>>

fn next(&mut self) -> Option<Self::Item>[src][−]

fn size_hint(&self) -> (usize, Option<usize>)1.0.0[src][−]

fn count(self) -> usize1.0.0[src][−]

fn last(self) -> Option<Self::Item>1.0.0[src][−]

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0[src][−]

fn step_by(self, step: usize) -> StepBy<Self>1.28.0[src][−]

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where U: IntoIterator<Item = Self::Item>, 1.0.0[src][−]

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where U: IntoIterator, 1.0.0[src][−]

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B, 1.0.0[src][−]

fn for_each<F>(self, f: F) where F: FnMut(Self::Item), 1.21.0[src][−]

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool, 1.0.0[src][−]

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>, 1.0.0[src][−]

fn enumerate(self) -> Enumerate<Self>1.0.0[src][−]

fn peekable(self) -> Peekable<Self>1.0.0[src][−]

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool, 1.0.0[src][−]

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool, 1.0.0[src][−]

fn skip(self, n: usize) -> Skip<Self>1.0.0[src][−]

fn take(self, n: usize) -> Take<Self>1.0.0[src][−]

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>, 1.0.0[src][−]

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator, 1.0.0[src][−]

fn flatten(self) -> Flatten<Self> where Self::Item: IntoIterator, 1.29.0[src][−]

fn fuse(self) -> Fuse<Self>1.0.0[src][−]

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item), 1.0.0[src][−]

fn by_ref(&mut self) -> &mut Self1.0.0[src][−]

[+] Expand attributes#[must_use = "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"] fn collect<B>(self) -> B where B: FromIterator<Self::Item>, 1.0.0[src][−]

fn partition<B, F>(self, f: F) -> (B, B) where B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool, 1.0.0[src][−]

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where F: FnMut(B, Self::Item) -> R, R: Try<Ok = B>, 1.27.0[src][−]

fn try_for_each<F, R>(&mut self, f: F) -> R where F: FnMut(Self::Item) -> R, R: Try<Ok = ()>, 1.27.0[src][−]

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B, 1.0.0[src][−]

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool, 1.0.0[src][−]

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool, 1.0.0[src][−]

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool, 1.0.0[src][−]

fn find_map<B, F>(&mut self, f: F) -> Option<B> where F: FnMut(Self::Item) -> Option<B>, 1.30.0[src][−]

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, 1.0.0[src][−]

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator, 1.0.0[src][−]

fn max(self) -> Option<Self::Item> where Self::Item: Ord, 1.0.0[src][−]

fn min(self) -> Option<Self::Item> where Self::Item: Ord, 1.0.0[src][−]

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B, 1.6.0[src][−]

fn max_by<F>(self, compare: F) -> Option<Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering, 1.15.0[src][−]

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B, 1.6.0[src][−]

fn min_by<F>(self, compare: F) -> Option<Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering, 1.15.0[src][−]

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator, 1.0.0[src][−]

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Iterator<Item = (A, B)>, 1.0.0[src][−]

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item = &'a T>, T: 'a + Clone, 1.0.0[src][−]

fn cycle(self) -> Cycle<Self> where Self: Clone, 1.0.0[src][−]

fn sum<S>(self) -> S where S: Sum<Self::Item>, 1.11.0[src][−]

fn product<P>(self) -> P where P: Product<Self::Item>, 1.11.0[src][−]

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item = Self::Item>, Self::Item: Ord, 1.5.0[src][−]

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, 1.5.0[src][−]

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, 1.5.0[src][−]

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, 1.5.0[src][−]

`impl WsServer<NoTlsAcceptor, TcpListener>`
[src]
[−]

`pub fn bind<A: ToSocketAddrs>(addr: A, handle: &Handle) -> Result<Self>`
[src]
[−]

`pub fn incoming(self) -> Incoming<TcpStream>`
[src]
[−]

`impl WsServer<TlsAcceptor, TcpListener>`
[src]
[−]

`pub fn bind_secure<A: ToSocketAddrs>( addr: A, acceptor: TlsAcceptor, handle: &Handle ) -> Result<Self>`
[src]
[−]

`pub fn incoming(self) -> Incoming<TlsStream<TcpStream>>`
[src]
[−]

`impl<S> WsServer<S, TcpListener> where S: OptionalTlsAcceptor,`
[src]
[−]

`pub fn local_addr(&self) -> Result<SocketAddr>`
[src]
[−]

`pub fn set_nonblocking(&self, nonblocking: bool) -> Result<()>`
[src]
[−]

`pub fn into_async(self, handle: &Handle) -> Result<Server<S>>`
[src]
[−]

`impl WsServer<TlsAcceptor, TcpListener>`
[src]
[−]

`pub fn bind_secure<A>(addr: A, acceptor: TlsAcceptor) -> Result<Self> where A: ToSocketAddrs,`
[src]
[−]

`pub fn accept(&mut self) -> AcceptResult<TlsStream<TcpStream>>`
[src]
[−]

`impl WsServer<NoTlsAcceptor, TcpListener>`
[src]
[−]

`pub fn bind<A: ToSocketAddrs>(addr: A) -> Result<Self>`
[src]
[−]

`pub fn accept(&mut self) -> AcceptResult<TcpStream>`
[src]
[−]

`pub fn try_clone(&self) -> Result<Self>`
[src]
[−]

`impl Iterator for WsServer<TlsAcceptor, TcpListener>`
[src]
[+]

`type Item = AcceptResult<TlsStream<TcpStream>>`

`fn next(&mut self) -> Option<Self::Item>`
[src]
[−]

`fn size_hint(&self) -> (usize, Option<usize>)`
1.0.0
[src]
[−]

`fn count(self) -> usize`
1.0.0
[src]
[−]

`fn last(self) -> Option<Self::Item>`
1.0.0
[src]
[−]

`fn nth(&mut self, n: usize) -> Option<Self::Item>`
1.0.0
[src]
[−]

`fn step_by(self, step: usize) -> StepBy<Self>`
1.28.0
[src]
[−]

`fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where U: IntoIterator<Item = Self::Item>,`
1.0.0
[src]
[−]

`fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where U: IntoIterator,`
1.0.0
[src]
[−]

`fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B,`
1.0.0
[src]
[−]

`fn for_each<F>(self, f: F) where F: FnMut(Self::Item),`
1.21.0
[src]
[−]

`fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool,`
1.0.0
[src]
[−]

`fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>,`
1.0.0
[src]
[−]

`fn enumerate(self) -> Enumerate<Self>`
1.0.0
[src]
[−]

`fn peekable(self) -> Peekable<Self>`
1.0.0
[src]
[−]

`fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool,`
1.0.0
[src]
[−]

`fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool,`
1.0.0
[src]
[−]

`fn skip(self, n: usize) -> Skip<Self>`
1.0.0
[src]
[−]

`fn take(self, n: usize) -> Take<Self>`
1.0.0
[src]
[−]

`fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>,`
1.0.0
[src]
[−]

`fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator,`
1.0.0
[src]
[−]

`fn flatten(self) -> Flatten<Self> where Self::Item: IntoIterator,`
1.29.0
[src]
[−]

`fn fuse(self) -> Fuse<Self>`
1.0.0
[src]
[−]

`fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item),`
1.0.0
[src]
[−]

`fn by_ref(&mut self) -> &mut Self`
1.0.0
[src]
[−]

[+] Expand attributes #[must_use = "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"] fn collect<B>(self) -> B where B: FromIterator<Self::Item>,
1.0.0
[src]
[−]

`fn partition<B, F>(self, f: F) -> (B, B) where B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool,`
1.0.0
[src]
[−]

`fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where F: FnMut(B, Self::Item) -> R, R: Try<Ok = B>,`
1.27.0
[src]
[−]

`fn try_for_each<F, R>(&mut self, f: F) -> R where F: FnMut(Self::Item) -> R, R: Try<Ok = ()>,`
1.27.0
[src]
[−]

`fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B,`
1.0.0
[src]
[−]

`fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool,`
1.0.0
[src]
[−]

`fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool,`
1.0.0
[src]
[−]

`fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool,`
1.0.0
[src]
[−]

`fn find_map<B, F>(&mut self, f: F) -> Option<B> where F: FnMut(Self::Item) -> Option<B>,`
1.30.0
[src]
[−]

`fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool,`
1.0.0
[src]
[−]

`fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator,`
1.0.0
[src]
[−]

`fn max(self) -> Option<Self::Item> where Self::Item: Ord,`
1.0.0
[src]
[−]

`fn min(self) -> Option<Self::Item> where Self::Item: Ord,`
1.0.0
[src]
[−]

`fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B,`
1.6.0
[src]
[−]

`fn max_by<F>(self, compare: F) -> Option<Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering,`
1.15.0
[src]
[−]

`fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B,`
1.6.0
[src]
[−]

`fn min_by<F>(self, compare: F) -> Option<Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering,`
1.15.0
[src]
[−]

`fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator,`
1.0.0
[src]
[−]

`fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Iterator<Item = (A, B)>,`
1.0.0
[src]
[−]

`fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item = &'a T>, T: 'a + Clone,`
1.0.0
[src]
[−]

`fn cycle(self) -> Cycle<Self> where Self: Clone,`
1.0.0
[src]
[−]

`fn sum<S>(self) -> S where S: Sum<Self::Item>,`
1.11.0
[src]
[−]

`fn product<P>(self) -> P where P: Product<Self::Item>,`
1.11.0
[src]
[−]

`fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item = Self::Item>, Self::Item: Ord,`
1.5.0
[src]
[−]

`fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>,`
1.5.0
[src]
[−]

`fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>,`
1.5.0
[src]
[−]

`fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>,`
1.5.0
[src]
[−]

`fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>,`
1.5.0
[src]
[−]

`fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>,`
1.5.0
[src]
[−]

`fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>,`
1.5.0
[src]
[−]

`fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>,`
1.5.0
[src]
[−]

`impl Iterator for WsServer<NoTlsAcceptor, TcpListener>`
[src]
[+]

`type Item = AcceptResult<TcpStream>`

`fn next(&mut self) -> Option<Self::Item>`
[src]
[−]

`fn size_hint(&self) -> (usize, Option<usize>)`
1.0.0
[src]
[−]

`fn count(self) -> usize`
1.0.0
[src]
[−]

`fn last(self) -> Option<Self::Item>`
1.0.0
[src]
[−]