[−][src]Struct bill::Bill
This is where the magic happens.
Fields
items_by_tax: BTreeMap<Tax, ItemList<P>>
Methods
impl<P: BillProduct> Bill<P>
[src]
impl<P: BillProduct> Bill<P>
pub fn new() -> Self | [src] |
Instantiates a new Bill
pub fn to_items_with_tax(&self) -> BTreeMap<Tax, &BillItem<P>> | [src] |
pub fn as_items_with_tax(&self) -> Vec<(Tax, &BillItem<P>)> | [src] |
Returns a Vec
of Tax
and BillItem
pub fn as_items(&self) -> Vec<&BillItem<P>> | [src] |
Returns a Vec
of BillItem
pub fn add(&mut self, item: BillItem<P>) | [src] |
Adds a new BillItem
to the list.
pub fn add_item(&mut self, amount: Amount, product: P) | [src] |
Instantiates and adds a new BillItem
to the list.
pub fn sums_by_tax(&self) -> BTreeMap<Tax, Money> | [src] |
pub fn gross_total(&self) -> Money | [src] |
pub fn tax_total(&self) -> Money | [src] |
pub fn net_total(&self) -> Money | [src] |
Methods from Deref<Target = BTreeMap<Tax, ItemList<P>>>
pub fn get<Q>(&self, key: &Q) -> Option<&V> where | 1.0.0 [src] |
Returns a reference to the value corresponding to the key.
The key may be any borrowed form of the map's key type, but the ordering on the borrowed form must match the ordering on the key type.
Examples
Basic usage:
use std::collections::BTreeMap; let mut map = BTreeMap::new(); map.insert(1, "a"); assert_eq!(map.get(&1), Some(&"a")); assert_eq!(map.get(&2), None);
pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)> where | [src] |
map_get_key_value
)Returns the key-value pair corresponding to the supplied key.
The supplied key may be any borrowed form of the map's key type, but the ordering on the borrowed form must match the ordering on the key type.
Examples
#![feature(map_get_key_value)] use std::collections::BTreeMap; let mut map = BTreeMap::new(); map.insert(1, "a"); assert_eq!(map.get_key_value(&1), Some((&1, &"a"))); assert_eq!(map.get_key_value(&2), None);
pub fn contains_key<Q>(&self, key: &Q) -> bool where | 1.0.0 [src] |
Returns true
if the map contains a value for the specified key.
The key may be any borrowed form of the map's key type, but the ordering on the borrowed form must match the ordering on the key type.
Examples
Basic usage:
use std::collections::BTreeMap; let mut map = BTreeMap::new(); map.insert(1, "a"); assert_eq!(map.contains_key(&1), true); assert_eq!(map.contains_key(&2), false);
pub fn range<T, R>(&self, range: R) -> Range<K, V> where | 1.17.0 [src] |
Constructs a double-ended iterator over a sub-range of elements in the map.
The simplest way is to use the range syntax min..max
, thus range(min..max)
will
yield elements from min (inclusive) to max (exclusive).
The range may also be entered as (Bound<T>, Bound<T>)
, so for example
range((Excluded(4), Included(10)))
will yield a left-exclusive, right-inclusive
range from 4 to 10.
Panics
Panics if range start > end
.
Panics if range start == end
and both bounds are Excluded
.
Examples
Basic usage:
use std::collections::BTreeMap; use std::ops::Bound::Included; let mut map = BTreeMap::new(); map.insert(3, "a"); map.insert(5, "b"); map.insert(8, "c"); for (&key, &value) in map.range((Included(&4), Included(&8))) { println!("{}: {}", key, value); } assert_eq!(Some((&5, &"b")), map.range(4..).next());
pub fn iter(&self) -> Iter<K, V> | 1.0.0 [src] |
Gets an iterator over the entries of the map, sorted by key.
Examples
Basic usage:
use std::collections::BTreeMap; let mut map = BTreeMap::new(); map.insert(3, "c"); map.insert(2, "b"); map.insert(1, "a"); for (key, value) in map.iter() { println!("{}: {}", key, value); } let (first_key, first_value) = map.iter().next().unwrap(); assert_eq!((*first_key, *first_value), (1, "a"));
pub fn keys(&'a self) -> Keys<'a, K, V> | 1.0.0 [src] |
Gets an iterator over the keys of the map, in sorted order.
Examples
Basic usage:
use std::collections::BTreeMap; let mut a = BTreeMap::new(); a.insert(2, "b"); a.insert(1, "a"); let keys: Vec<_> = a.keys().cloned().collect(); assert_eq!(keys, [1, 2]);
pub fn values(&'a self) -> Values<'a, K, V> | 1.0.0 [src] |
Gets an iterator over the values of the map, in order by key.
Examples
Basic usage:
use std::collections::BTreeMap; let mut a = BTreeMap::new(); a.insert(1, "hello"); a.insert(2, "goodbye"); let values: Vec<&str> = a.values().cloned().collect(); assert_eq!(values, ["hello", "goodbye"]);
pub fn len(&self) -> usize | 1.0.0 [src] |
Returns the number of elements in the map.
Examples
Basic usage:
use std::collections::BTreeMap; let mut a = BTreeMap::new(); assert_eq!(a.len(), 0); a.insert(1, "a"); assert_eq!(a.len(), 1);
pub fn is_empty(&self) -> bool | 1.0.0 [src] |
Returns true
if the map contains no elements.
Examples
Basic usage:
use std::collections::BTreeMap; let mut a = BTreeMap::new(); assert!(a.is_empty()); a.insert(1, "a"); assert!(!a.is_empty());
Trait Implementations
impl<P: Default> Default for Bill<P>
[src]
impl<P: Default> Default for Bill<P>
impl<P: Debug> Debug for Bill<P>
[src]
impl<P: Debug> Debug for Bill<P>
impl<P: BillProduct> Deref for Bill<P>
[src]
impl<P: BillProduct> Deref for Bill<P>
Auto Trait Implementations
Blanket Implementations
impl<T, U> Into for T where
U: From<T>,
[src]
impl<T, U> Into for T where
U: From<T>,
impl<T> From for T
[src]
impl<T> From for T
impl<T, U> TryFrom for T where
T: From<U>,
[src]
impl<T, U> TryFrom for T where
T: From<U>,
type Error = !
try_from
)The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error> | [src] |
impl<T> Borrow for T where
T: ?Sized,
[src]
impl<T> Borrow for T where
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
impl<T> Any for T where
T: 'static + ?Sized,
fn get_type_id(&self) -> TypeId | [src] |
impl<T, U> TryInto for T where
U: TryFrom<T>,
[src]
impl<T, U> TryInto for T where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
try_from
)The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error> | [src] |
impl<T> BorrowMut for T where
T: ?Sized,
[src]
impl<T> BorrowMut for T where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T | [src] |