diff --git a/Changes b/Changes index 7ec8761..2b02686 100644 --- a/Changes +++ b/Changes @@ -2,6 +2,12 @@ Revision history for Array-Sparse {{$NEXT}} +0.0.9 2023-12-21T11:39:14+01:00 + - Up dependency on Array::Agnostic + - Use .rakutest extension for tests + - Add sponsor link + - Update copyright year + 0.0.8 2021-09-10T10:38:21+02:00 - Change file extension to .rakumod - Migrate to zef ecosystem diff --git a/META6.json b/META6.json index 51b3c22..a06df34 100644 --- a/META6.json +++ b/META6.json @@ -6,7 +6,7 @@ "build-depends": [ ], "depends": [ - "Array::Agnostic:ver<0.0.10>:auth" + "Array::Agnostic:ver<0.0.11>:auth" ], "description": "role for sparsely populated Arrays", "license": "Artistic-2.0", @@ -23,5 +23,5 @@ ], "test-depends": [ ], - "version": "0.0.8" + "version": "0.0.9" } diff --git a/README.md b/README.md index e35f28b..91b9864 100644 --- a/README.md +++ b/README.md @@ -33,10 +33,12 @@ Elizabeth Mattijsen Source can be located at: https://github.com/lizmat/Array-Sparse . Comments and Pull Requests are welcome. +If you like this module, or what I’m doing more generally, committing to a [small sponsorship](https://github.com/sponsors/lizmat/) would mean a great deal to me! + COPYRIGHT AND LICENSE ===================== -Copyright 2018, 2020, 2021 Elizabeth Mattijsen +Copyright 2018, 2020, 2021, 2023 Elizabeth Mattijsen This library is free software; you can redistribute it and/or modify it under the Artistic License 2.0. diff --git a/lib/Array/Sparse.rakumod b/lib/Array/Sparse.rakumod index 67ae82f..5931ed1 100644 --- a/lib/Array/Sparse.rakumod +++ b/lib/Array/Sparse.rakumod @@ -1,10 +1,8 @@ use v6.d; -use Array::Agnostic:ver<0.0.10>:auth; +use Array::Agnostic:ver<0.0.11>:auth; -role Array::Sparse:ver<0.0.8>:auth - does Array::Agnostic -{ +role Array::Sparse does Array::Agnostic { has %!sparse; has $.end = -1; @@ -180,9 +178,13 @@ Elizabeth Mattijsen Source can be located at: https://github.com/lizmat/Array-Sparse . Comments and Pull Requests are welcome. +If you like this module, or what I’m doing more generally, committing to a +L would mean a great +deal to me! + =head1 COPYRIGHT AND LICENSE -Copyright 2018, 2020, 2021 Elizabeth Mattijsen +Copyright 2018, 2020, 2021, 2023 Elizabeth Mattijsen This library is free software; you can redistribute it and/or modify it under the Artistic License 2.0. diff --git a/t/01-basic.t b/t/01-basic.rakutest similarity index 96% rename from t/01-basic.t rename to t/01-basic.rakutest index cbc626c..31622ba 100644 --- a/t/01-basic.t +++ b/t/01-basic.rakutest @@ -34,12 +34,15 @@ subtest { }, 'checking [* - x]'; subtest { - plan 5; + plan 8; ok @a[9]:exists, 'does last element exist'; is @a[9]:delete, 10, 'does :delete work on last element'; nok @a[9]:exists, 'does last element no longer exist'; - is @a.elems, 9, 'do we have one element less now: elems'; - is @a.end, 8, 'do we have one element less now: end'; + is-deeply @a.elems, 9, 'do we have one element less now: elems'; + is-deeply @a.end, 8, 'do we have one element less now: end'; + is-deeply +@a, 9, 'does it numerify ok'; + is-deeply @a.Int, 9, 'does it intify ok'; + is-deeply ?@a, True, 'does it boolify ok'; }, 'deletion of last element'; subtest {