File Coverage

blib/lib/Tree/SizeBalanced/num_void.pm
Criterion Covered Total %
statement 9 9 100.0
branch n/a
condition n/a
subroutine 3 3 100.0
pod n/a
total 12 12 100.0


line stmt bran cond sub pod time code
1             package Tree::SizeBalanced::num_void;
2              
3 1     1   3 use strict;
  1         1  
  1         21  
4 1     1   3 use warnings;
  1         1  
  1         650  
5              
6 1     1   4 use Tree::SizeBalanced;
  1         1  
  1         220  
7              
8             *new = \&Tree::SizeBalanced::Core::new_num_void;
9             *DESTROY = \&Tree::SizeBalanced::Core::DESTROY_num_void;
10             *size = \&Tree::SizeBalanced::Core::size_num_void;
11             *ever_height = \&Tree::SizeBalanced::Core::ever_height_num_void;
12             *insert = \&Tree::SizeBalanced::Core::insert_num_void;
13             *insert_before = \&Tree::SizeBalanced::Core::insert_before_num_void;
14             *insert_after = \&Tree::SizeBalanced::Core::insert_after_num_void;
15             *delete = \&Tree::SizeBalanced::Core::delete_num_void;
16             *delete_first = \&Tree::SizeBalanced::Core::delete_first_num_void;
17             *delete_last = \&Tree::SizeBalanced::Core::delete_last_num_void;
18             *find = \&Tree::SizeBalanced::Core::find_num_void;
19             *find_first = \&Tree::SizeBalanced::Core::find_first_num_void;
20             *find_last = \&Tree::SizeBalanced::Core::find_last_num_void;
21             *find_lt = \&Tree::SizeBalanced::Core::find_lt_num_void;
22             *find_le = \&Tree::SizeBalanced::Core::find_le_num_void;
23             *find_gt = \&Tree::SizeBalanced::Core::find_gt_num_void;
24             *find_ge = \&Tree::SizeBalanced::Core::find_ge_num_void;
25             *find_gt_lt = \&Tree::SizeBalanced::Core::find_gt_lt_num_void;
26             *find_ge_lt = \&Tree::SizeBalanced::Core::find_ge_lt_num_void;
27             *find_gt_le = \&Tree::SizeBalanced::Core::find_gt_le_num_void;
28             *find_ge_le = \&Tree::SizeBalanced::Core::find_ge_le_num_void;
29             *count_lt = \&Tree::SizeBalanced::Core::count_lt_num_void;
30             *count_le = \&Tree::SizeBalanced::Core::count_le_num_void;
31             *count_gt = \&Tree::SizeBalanced::Core::count_gt_num_void;
32             *count_ge = \&Tree::SizeBalanced::Core::count_ge_num_void;
33             *find_min = \&Tree::SizeBalanced::Core::find_min_num_void;
34             *find_max = \&Tree::SizeBalanced::Core::find_max_num_void;
35             *skip_l = \&Tree::SizeBalanced::Core::skip_l_num_void;
36             *skip_g = \&Tree::SizeBalanced::Core::skip_g_num_void;
37             *dump = \&Tree::SizeBalanced::Core::dump_num_void;
38             *check = \&Tree::SizeBalanced::Core::check_num_void;
39              
40             1;