Use smaller discriminants for generators
This commit is contained in:
parent
42ce9b4e90
commit
b2779d8596
5 changed files with 31 additions and 28 deletions
|
|
@ -110,9 +110,9 @@ async fn mixed_sizes() {
|
|||
}
|
||||
|
||||
fn main() {
|
||||
assert_eq!(1028, std::mem::size_of_val(&single()));
|
||||
assert_eq!(1032, std::mem::size_of_val(&single_with_noop()));
|
||||
assert_eq!(3084, std::mem::size_of_val(&joined()));
|
||||
assert_eq!(3084, std::mem::size_of_val(&joined_with_noop()));
|
||||
assert_eq!(7188, std::mem::size_of_val(&mixed_sizes()));
|
||||
assert_eq!(1025, std::mem::size_of_val(&single()));
|
||||
assert_eq!(1026, std::mem::size_of_val(&single_with_noop()));
|
||||
assert_eq!(3078, std::mem::size_of_val(&joined()));
|
||||
assert_eq!(3079, std::mem::size_of_val(&joined_with_noop()));
|
||||
assert_eq!(7181, std::mem::size_of_val(&mixed_sizes()));
|
||||
}
|
||||
|
|
|
|||
|
|
@ -95,9 +95,9 @@ async fn join_retval() -> Joiner {
|
|||
}
|
||||
|
||||
fn main() {
|
||||
assert_eq!(8, std::mem::size_of_val(&single()));
|
||||
assert_eq!(12, std::mem::size_of_val(&single_with_noop()));
|
||||
assert_eq!(3084, std::mem::size_of_val(&joined()));
|
||||
assert_eq!(3084, std::mem::size_of_val(&joined_with_noop()));
|
||||
assert_eq!(3080, std::mem::size_of_val(&join_retval()));
|
||||
assert_eq!(2, std::mem::size_of_val(&single()));
|
||||
assert_eq!(3, std::mem::size_of_val(&single_with_noop()));
|
||||
assert_eq!(3078, std::mem::size_of_val(&joined()));
|
||||
assert_eq!(3078, std::mem::size_of_val(&joined_with_noop()));
|
||||
assert_eq!(3074, std::mem::size_of_val(&join_retval()));
|
||||
}
|
||||
|
|
|
|||
|
|
@ -86,13 +86,13 @@ async fn await3_level5() -> u8 {
|
|||
|
||||
fn main() {
|
||||
assert_eq!(2, std::mem::size_of_val(&base()));
|
||||
assert_eq!(8, std::mem::size_of_val(&await1_level1()));
|
||||
assert_eq!(12, std::mem::size_of_val(&await2_level1()));
|
||||
assert_eq!(12, std::mem::size_of_val(&await3_level1()));
|
||||
assert_eq!(24, std::mem::size_of_val(&await3_level2()));
|
||||
assert_eq!(36, std::mem::size_of_val(&await3_level3()));
|
||||
assert_eq!(48, std::mem::size_of_val(&await3_level4()));
|
||||
assert_eq!(60, std::mem::size_of_val(&await3_level5()));
|
||||
assert_eq!(3, std::mem::size_of_val(&await1_level1()));
|
||||
assert_eq!(4, std::mem::size_of_val(&await2_level1()));
|
||||
assert_eq!(5, std::mem::size_of_val(&await3_level1()));
|
||||
assert_eq!(8, std::mem::size_of_val(&await3_level2()));
|
||||
assert_eq!(11, std::mem::size_of_val(&await3_level3()));
|
||||
assert_eq!(14, std::mem::size_of_val(&await3_level4()));
|
||||
assert_eq!(17, std::mem::size_of_val(&await3_level5()));
|
||||
|
||||
assert_eq!(1, wait(base()));
|
||||
assert_eq!(1, wait(await1_level1()));
|
||||
|
|
|
|||
|
|
@ -58,7 +58,7 @@ fn overlap_move_points() -> impl Generator<Yield = (), Return = ()> {
|
|||
}
|
||||
}
|
||||
|
||||
fn overlap_x_and_y() -> impl Generator<Yield = (), Return = ()>{
|
||||
fn overlap_x_and_y() -> impl Generator<Yield = (), Return = ()> {
|
||||
static || {
|
||||
let x = Foo([0; FOO_SIZE]);
|
||||
yield;
|
||||
|
|
@ -70,8 +70,8 @@ fn overlap_x_and_y() -> impl Generator<Yield = (), Return = ()>{
|
|||
}
|
||||
|
||||
fn main() {
|
||||
assert_eq!(1028, std::mem::size_of_val(&move_before_yield()));
|
||||
assert_eq!(1032, std::mem::size_of_val(&move_before_yield_with_noop()));
|
||||
assert_eq!(2056, std::mem::size_of_val(&overlap_move_points()));
|
||||
assert_eq!(1032, std::mem::size_of_val(&overlap_x_and_y()));
|
||||
assert_eq!(1025, std::mem::size_of_val(&move_before_yield()));
|
||||
assert_eq!(1026, std::mem::size_of_val(&move_before_yield_with_noop()));
|
||||
assert_eq!(2051, std::mem::size_of_val(&overlap_move_points()));
|
||||
assert_eq!(1026, std::mem::size_of_val(&overlap_x_and_y()));
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue