plot_interface 0.1.3

Plot interface.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68

#[ allow( unused_imports ) ]
use super::*;

//

#[ cfg( any( feature = "use_std", feature = "use_alloc" ) ) ]
#[ cfg( feature = "prelude" ) ]
tests_impls!
{
  fn basic()
  {
    use TheModule::prelude::*;

    /* test.case( "Vec" ) */
    let src = Vec::< i32 >::new();
    a_true!( src.is_empty() );

    /* test.case( "DynArray" ) */
    let src = DynArray::< i32 >::new();
    a_true!( src.is_empty() );

    /* test.case( "HashMap" ) */
    let src = HashMap::< i32, i32 >::new();
    a_true!( src.is_empty() );

    /* test.case( "Map" ) */
    let src = Map::< i32, i32 >::new();
    a_true!( src.is_empty() );

    /* test.case( "HashSet" ) */
    let src = HashSet::< i32 >::new();
    a_true!( src.is_empty() );

    /* test.case( "Set" ) */
    let src = Set::< i32 >::new();
    a_true!( src.is_empty() );

    /* test.case( "BTreeMap" ) */
    let src = BTreeMap::< i32, i32 >::new();
    a_true!( src.is_empty() );

    /* test.case( "BTreeSet" ) */
    let src = BTreeSet::< i32 >::new();
    a_true!( src.is_empty() );

    /* test.case( "BinaryHeap" ) */
    let src = BinaryHeap::< i32 >::new();
    a_true!( src.is_empty() );

    /* test.case( "LinkedList" ) */
    let src = LinkedList::< i32 >::new();
    a_true!( src.is_empty() );

    /* test.case( "VecDeque" ) */
    let src = VecDeque::< i32 >::new();
    a_true!( src.is_empty() );

  }
}

//

#[ cfg( any( feature = "use_std", feature = "use_alloc" ) ) ]
#[ cfg( feature = "prelude" ) ]
tests_index!
{
  basic,
}