Bin given limits: Difference between revisions
Content deleted Content added
Added Rust version. |
m Reordered submissions alphabetically. |
||
Line 212: | Line 212: | ||
>= 634 .. < 720 := 16 |
>= 634 .. < 720 := 16 |
||
>= 720 := 59</pre> |
>= 720 := 59</pre> |
||
=={{header|Raku}}== |
|||
<lang perl6> |
|||
sub bin_it ( @limits, @data ) { |
|||
my @ranges = ( -Inf, |@limits, Inf ).rotor( 2 => -1 ).map: { .[0] ..^ .[1] }; |
|||
my @binned = @data.classify(-> $d { @ranges.grep(-> $r { $d ~~ $r }) }); |
|||
my %counts = @binned.map: { .key => .value.elems }; |
|||
return @ranges.map: { $_ => ( %counts{$_} // 0 ) }; |
|||
} |
|||
sub bin_format ( @bins ) { |
|||
return @bins.map: { .key.gist.fmt('%9s => ') ~ .value.fmt('%2d') }; |
|||
} |
|||
my @tests = |
|||
{ |
|||
limits => (23, 37, 43, 53, 67, 83), |
|||
data => (95,21,94,12,99,4,70,75,83,93,52,80,57,5,53,86,65,17,92,83,71,61,54,58,47,16,8,9,32,84,7,87,46,19,30,37,96,6,98,40,79,97,45,64,60,29,49,36,43,55), |
|||
}, |
|||
{ |
|||
limits => (14, 18, 249, 312, 389, 392, 513, 591, 634, 720), |
|||
data => ( |
|||
445,814,519,697,700,130,255,889,481,122,932, 77,323,525,570,219,367,523,442,933,416,589,930,373,202,253,775, 47,731,685,293,126,133,450,545,100,741,583,763,306, |
|||
655,267,248,477,549,238, 62,678, 98,534,622,907,406,714,184,391,913, 42,560,247,346,860, 56,138,546, 38,985,948, 58,213,799,319,390,634,458,945,733,507,916,123, |
|||
345,110,720,917,313,845,426, 9,457,628,410,723,354,895,881,953,677,137,397, 97,854,740, 83,216,421, 94,517,479,292,963,376,981,480, 39,257,272,157, 5,316,395, |
|||
787,942,456,242,759,898,576, 67,298,425,894,435,831,241,989,614,987,770,384,692,698,765,331,487,251,600,879,342,982,527,736,795,585, 40, 54,901,408,359,577,237, |
|||
605,847,353,968,832,205,838,427,876,959,686,646,835,127,621,892,443,198,988,791,466, 23,707,467, 33,670,921,180,991,396,160,436,717,918, 8,374,101,684,727,749 |
|||
), |
|||
}, |
|||
; |
|||
for @tests -> ( :@limits, :@data ) { |
|||
my @bins = bin_it( @limits, @data ); |
|||
.say for bin_format(@bins); |
|||
say ''; |
|||
} |
|||
</lang> |
|||
{{out}} |
|||
<pre> |
|||
-Inf..^23 => 11 |
|||
23..^37 => 4 |
|||
37..^43 => 2 |
|||
43..^53 => 6 |
|||
53..^67 => 9 |
|||
67..^83 => 5 |
|||
83..^Inf => 13 |
|||
-Inf..^14 => 3 |
|||
14..^18 => 0 |
|||
18..^249 => 44 |
|||
249..^312 => 10 |
|||
312..^389 => 16 |
|||
389..^392 => 2 |
|||
392..^513 => 28 |
|||
513..^591 => 16 |
|||
591..^634 => 6 |
|||
634..^720 => 16 |
|||
720..^Inf => 59 |
|||
</pre> |
|||
=={{header|REXX}}== |
=={{header|REXX}}== |
||
Line 287: | Line 344: | ||
</pre> |
</pre> |
||
=={{header| |
=={{header|Rust}}== |
||
{{works with|rustc|1.49.0}} |
|||
<lang perl6> |
|||
sub bin_it ( @limits, @data ) { |
|||
A very simple and naive algorithm that uses nested dynamic arrays. |
|||
my @ranges = ( -Inf, |@limits, Inf ).rotor( 2 => -1 ).map: { .[0] ..^ .[1] }; |
|||
my @binned = @data.classify(-> $d { @ranges.grep(-> $r { $d ~~ $r }) }); |
|||
<lang rust>fn make_bins(limits: &Vec<usize>, data: &Vec<usize>) -> Vec<Vec<usize>> { |
|||
my %counts = @binned.map: { .key => .value.elems }; |
|||
let mut bins: Vec<Vec<usize>> = Vec::with_capacity(limits.len() + 1); |
|||
return @ranges.map: { $_ => ( %counts{$_} // 0 ) }; |
|||
for _ in 0..=limits.len() {bins.push(Vec::new());} |
|||
limits.iter().enumerate().for_each(|(idx, limit)| { |
|||
data.iter().for_each(|elem| { |
|||
if idx == 0 && elem < limit { bins[0].push(*elem); } // smaller than the smallest limit |
|||
else if idx == limits.len()-1 && elem >= limit { bins[limits.len()].push(*elem); } // larger than the largest limit |
|||
else if elem < limit && elem >= &limits[idx-1] { bins[idx].push(*elem); } // otherwise |
|||
}); |
|||
}); |
|||
bins |
|||
} |
} |
||
sub bin_format ( @bins ) { |
|||
fn print_bins(limits: &Vec<usize>, bins: &Vec<Vec<usize>>) { |
|||
return @bins.map: { .key.gist.fmt('%9s => ') ~ .value.fmt('%2d') }; |
|||
for (idx, bin) in bins.iter().enumerate() { |
|||
if idx == 0 { |
|||
println!(" < {:3} := {:3}", limits[idx], bin.len()); |
|||
} else if idx == limits.len() { |
|||
println!(">= {:3} := {:3}", limits[idx-1], bin.len()); |
|||
}else { |
|||
println!(">= {:3} .. < {:3} := {:3}", limits[idx-1], limits[idx], bin.len()); |
|||
} |
|||
}; |
|||
} |
} |
||
fn main() { |
|||
my @tests = |
|||
let limits1 = vec![23, 37, 43, 53, 67, 83]; |
|||
{ |
|||
let data1 = vec![95,21,94,12,99,4,70,75,83,93,52,80,57,5,53,86,65,17,92,83,71,61,54,58,47, |
|||
limits => (23, 37, 43, 53, 67, 83), |
|||
16,8,9,32,84,7,87,46,19,30,37,96,6,98,40,79,97,45,64,60,29,49,36,43,55]; |
|||
}, |
|||
let limits2 = vec![14, 18, 249, 312, 389, 392, 513, 591, 634, 720]; |
|||
{ |
|||
let data2 = vec![ |
|||
limits => (14, 18, 249, 312, 389, 392, 513, 591, 634, 720), |
|||
445,814,519,697,700,130,255,889,481,122, |
|||
data => ( |
|||
932, 77,323,525,570,219,367,523,442,933, |
|||
416,589,930,373,202,253,775, 47,731,685, |
|||
655,267,248,477,549,238, 62,678, 98,534,622,907,406,714,184,391,913, 42,560,247,346,860, 56,138,546, 38,985,948, 58,213,799,319,390,634,458,945,733,507,916,123, |
|||
293,126,133,450,545,100,741,583,763,306, |
|||
345,110,720,917,313,845,426, 9,457,628,410,723,354,895,881,953,677,137,397, 97,854,740, 83,216,421, 94,517,479,292,963,376,981,480, 39,257,272,157, 5,316,395, |
|||
655,267,248,477,549,238, 62,678, 98,534, |
|||
787,942,456,242,759,898,576, 67,298,425,894,435,831,241,989,614,987,770,384,692,698,765,331,487,251,600,879,342,982,527,736,795,585, 40, 54,901,408,359,577,237, |
|||
622,907,406,714,184,391,913, 42,560,247, |
|||
605,847,353,968,832,205,838,427,876,959,686,646,835,127,621,892,443,198,988,791,466, 23,707,467, 33,670,921,180,991,396,160,436,717,918, 8,374,101,684,727,749 |
|||
346,860, 56,138,546, 38,985,948, 58,213, |
|||
), |
|||
799,319,390,634,458,945,733,507,916,123, |
|||
}, |
|||
345,110,720,917,313,845,426, 9,457,628, |
|||
; |
|||
410,723,354,895,881,953,677,137,397, 97, |
|||
for @tests -> ( :@limits, :@data ) { |
|||
854,740, 83,216,421, 94,517,479,292,963, |
|||
my @bins = bin_it( @limits, @data ); |
|||
376,981,480, 39,257,272,157, 5,316,395, |
|||
.say for bin_format(@bins); |
|||
787,942,456,242,759,898,576, 67,298,425, |
|||
say ''; |
|||
894,435,831,241,989,614,987,770,384,692, |
|||
698,765,331,487,251,600,879,342,982,527, |
|||
736,795,585, 40, 54,901,408,359,577,237, |
|||
605,847,353,968,832,205,838,427,876,959, |
|||
686,646,835,127,621,892,443,198,988,791, |
|||
466, 23,707,467, 33,670,921,180,991,396, |
|||
160,436,717,918, 8,374,101,684,727,749 |
|||
]; |
|||
// Why are we calling it RC anyways??? |
|||
println!("RC FIRST EXAMPLE"); |
|||
let bins1 = make_bins(&limits1, &data1); |
|||
print_bins(&limits1, &bins1); |
|||
println!("\nRC SECOND EXAMPLE"); |
|||
let bins2 = make_bins(&limits2, &data2); |
|||
print_bins(&limits2, &bins2); |
|||
} |
} |
||
</lang> |
</lang> |
||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
RC FIRST EXAMPLE |
|||
-Inf..^23 => 11 |
|||
23 |
< 23 := 11 |
||
>= 23 .. < 37 := 4 |
|||
>= 37 .. < 43 := 2 |
|||
>= 43 .. < 53 := 6 |
|||
>= 53 .. < 67 := 9 |
|||
>= 67 .. < 83 := 5 |
|||
83..^Inf => 13 |
|||
>= 83 := 13 |
|||
RC SECOND EXAMPLE |
|||
-Inf..^14 => 3 |
|||
14 |
< 14 := 3 |
||
>= 14 .. < 18 := 0 |
|||
18..^249 => 44 |
|||
>= 18 .. < 249 := 44 |
|||
249..^312 => 10 |
|||
>= 249 .. < 312 := 10 |
|||
312..^389 => 16 |
|||
>= 312 .. < 389 := 16 |
|||
>= 389 .. < 392 := 2 |
|||
392..^513 => 28 |
|||
>= 392 .. < 513 := 28 |
|||
513..^591 => 16 |
|||
>= 513 .. < 591 := 16 |
|||
>= 591 .. < 634 := 6 |
|||
634..^720 => 16 |
|||
>= 634 .. < 720 := 16 |
|||
720..^Inf => 59 |
|||
>= 720 := 59 |
|||
</pre> |
</pre> |
||
=={{header|Wren}}== |
=={{header|Wren}}== |
||
{{libheader|Wren-sort}} |
{{libheader|Wren-sort}} |
||
Line 440: | Line 539: | ||
>= 634 and < 720 = 16 |
>= 634 and < 720 = 16 |
||
>= 720 = 59 |
>= 720 = 59 |
||
</pre> |
|||
=={{header|Rust}}== |
|||
{{works with|rustc|1.49.0}} |
|||
A very simple and naive algorithm that uses nested dynamic arrays. |
|||
<lang rust>fn make_bins(limits: &Vec<usize>, data: &Vec<usize>) -> Vec<Vec<usize>> { |
|||
let mut bins: Vec<Vec<usize>> = Vec::with_capacity(limits.len() + 1); |
|||
for _ in 0..=limits.len() {bins.push(Vec::new());} |
|||
limits.iter().enumerate().for_each(|(idx, limit)| { |
|||
data.iter().for_each(|elem| { |
|||
if idx == 0 && elem < limit { bins[0].push(*elem); } // smaller than the smallest limit |
|||
else if idx == limits.len()-1 && elem >= limit { bins[limits.len()].push(*elem); } // larger than the largest limit |
|||
else if elem < limit && elem >= &limits[idx-1] { bins[idx].push(*elem); } // otherwise |
|||
}); |
|||
}); |
|||
bins |
|||
} |
|||
fn print_bins(limits: &Vec<usize>, bins: &Vec<Vec<usize>>) { |
|||
for (idx, bin) in bins.iter().enumerate() { |
|||
if idx == 0 { |
|||
println!(" < {:3} := {:3}", limits[idx], bin.len()); |
|||
} else if idx == limits.len() { |
|||
println!(">= {:3} := {:3}", limits[idx-1], bin.len()); |
|||
}else { |
|||
println!(">= {:3} .. < {:3} := {:3}", limits[idx-1], limits[idx], bin.len()); |
|||
} |
|||
}; |
|||
} |
|||
fn main() { |
|||
let limits1 = vec![23, 37, 43, 53, 67, 83]; |
|||
let data1 = vec![95,21,94,12,99,4,70,75,83,93,52,80,57,5,53,86,65,17,92,83,71,61,54,58,47, |
|||
16,8,9,32,84,7,87,46,19,30,37,96,6,98,40,79,97,45,64,60,29,49,36,43,55]; |
|||
let limits2 = vec![14, 18, 249, 312, 389, 392, 513, 591, 634, 720]; |
|||
let data2 = vec![ |
|||
445,814,519,697,700,130,255,889,481,122, |
|||
932, 77,323,525,570,219,367,523,442,933, |
|||
416,589,930,373,202,253,775, 47,731,685, |
|||
293,126,133,450,545,100,741,583,763,306, |
|||
655,267,248,477,549,238, 62,678, 98,534, |
|||
622,907,406,714,184,391,913, 42,560,247, |
|||
346,860, 56,138,546, 38,985,948, 58,213, |
|||
799,319,390,634,458,945,733,507,916,123, |
|||
345,110,720,917,313,845,426, 9,457,628, |
|||
410,723,354,895,881,953,677,137,397, 97, |
|||
854,740, 83,216,421, 94,517,479,292,963, |
|||
376,981,480, 39,257,272,157, 5,316,395, |
|||
787,942,456,242,759,898,576, 67,298,425, |
|||
894,435,831,241,989,614,987,770,384,692, |
|||
698,765,331,487,251,600,879,342,982,527, |
|||
736,795,585, 40, 54,901,408,359,577,237, |
|||
605,847,353,968,832,205,838,427,876,959, |
|||
686,646,835,127,621,892,443,198,988,791, |
|||
466, 23,707,467, 33,670,921,180,991,396, |
|||
160,436,717,918, 8,374,101,684,727,749 |
|||
]; |
|||
// Why are we calling it RC anyways??? |
|||
println!("RC FIRST EXAMPLE"); |
|||
let bins1 = make_bins(&limits1, &data1); |
|||
print_bins(&limits1, &bins1); |
|||
println!("\nRC SECOND EXAMPLE"); |
|||
let bins2 = make_bins(&limits2, &data2); |
|||
print_bins(&limits2, &bins2); |
|||
} |
|||
</lang> |
|||
{{out}} |
|||
<pre> |
|||
RC FIRST EXAMPLE |
|||
< 23 := 11 |
|||
>= 23 .. < 37 := 4 |
|||
>= 37 .. < 43 := 2 |
|||
>= 43 .. < 53 := 6 |
|||
>= 53 .. < 67 := 9 |
|||
>= 67 .. < 83 := 5 |
|||
>= 83 := 13 |
|||
RC SECOND EXAMPLE |
|||
< 14 := 3 |
|||
>= 14 .. < 18 := 0 |
|||
>= 18 .. < 249 := 44 |
|||
>= 249 .. < 312 := 10 |
|||
>= 312 .. < 389 := 16 |
|||
>= 389 .. < 392 := 2 |
|||
>= 392 .. < 513 := 28 |
|||
>= 513 .. < 591 := 16 |
|||
>= 591 .. < 634 := 6 |
|||
>= 634 .. < 720 := 16 |
|||
>= 720 := 59 |
|||
</pre> |
</pre> |