Struct Logins 

pub struct Logins {
    items: Vec<Item>,
    searched: Vec<Searched>,
}

The vault’s logins, opened, with what each is searched by.

Fields

items: Vec<Item>

searched: Vec<Searched>

Implementations

impl Logins

pub fn new(items: Vec<Item>) -> Logins

pub fn items(&self) -> &[Item]

pub fn opening(&self, page: &str, last: Option<&str>) -> Opening

What the chooser opens with for a page, and what “Fill the login” fills at once; last is the login chosen there last.

pub fn for_site(&self, page: &str) -> Vec<&Item>

The logins for a page: those made for its domain, its own host first.

pub fn find( &self, site: &str, user: &str, page: &str, first: Option<&str>, limit: usize, ) -> (Vec<Found<'_>>, usize)

The logins by site and by user name, each optional, both matching when both are given; nothing when neither is.

• site matches the login’s sites: the same host, then the same registrable domain, then a host whose labels begin with the words typed (“ameli”: ameli.fr, assure.ameli.fr, not camelia.com), then the login’s name (an address’s own name, “ameli” for ameli.fr). Never its user name: “gmail” finds Gmail, not the logins with a Gmail address.
• user matches the user name only, holding every word typed.

Case and accents aside. The best limit of them, the best first: first (the login chosen last for the page), then by how the site matched, the page’s own (its host, then its domain), the user name typed whole, the name; and how many matched in all. Only those kept are sorted: a large vault, all of it matching, costs one pass.