Denis Buzdalov
6dc06cd67d
[ base ] Add update functions to sorted maps
2023-09-23 22:47:05 +01:00
Denis Buzdalov
a4ccb27c83
[ base ] Add lists' infix-by functions, complementary to existing ones
2023-08-28 13:53:59 +01:00
russoul
ebbae42c85
Add uncons' to base; rewrite head' and tail' in terms of uncons'
2023-08-23 11:04:23 +01:00
Steve Dunham
badf1e98c8
[ base ] Make foldr1 and foldr1By public
2023-08-07 08:10:35 +01:00
scarf
c7abb148e8
feat: even and odd for Nat and Integral ( #3021 )
2023-07-31 08:36:40 +01:00
Saransh Chopra
4fcb0fb4a7
Remove decideLTE ( #3031 )
2023-07-27 08:04:24 +01:00
André Videla
a39bfc6ce3
Merge branch 'main' into constant_fin
2023-07-18 23:46:07 +09:00
scarf
388d217757
docs: typo in list difference documentation ( #3018 )
2023-07-16 10:39:36 -05:00
CodingCellist
18e887389f
[ papers ] Port the first part of "Deferring the details [...]" by Liam O'Connor ( #2974 )
...
Co-authored-by: Guillaume Allais <guillaume.allais@ens-lyon.org>
2023-07-05 16:42:58 +01:00
Robert Wright
754f6af55c
Add orBothFalse proof
2023-07-05 16:36:55 +01:00
Robert Wright
af3c5fd454
Generalize Prelude proof helpers
2023-07-05 16:36:09 +01:00
stefan-hoeck
c1a5be9b5b
[ performance ] make Eq and Ord for Fin run in constant time
2023-07-05 15:58:41 +02:00
Denis Buzdalov
c285ef06dd
[ re #2960 ] Move defs of closures data types to a separate module
2023-05-11 15:31:45 +01:00
Robert Wright
9bfa04921a
Add symmetric and transitive closure relations
2023-05-08 11:53:21 +01:00
stefan-hoeck
bc1a51ea18
[ regression ] revert to previous implementation of Show
2023-05-02 11:23:14 +02:00
stefan-hoeck
83f5ef27b6
[ new ] Eq, Ord, Semigroup, and Monoid for All
2023-05-02 11:23:14 +02:00
Denis Buzdalov
cf63ee2ef2
[ base ] Add extraction functions to Data.Singleton
2023-03-28 11:29:09 +01:00
Robert Wright
fb956802ab
Add Elem get and lookup functions
2023-03-23 19:36:20 +00:00
CodingCellist
7972c6acbd
[ new ] Implement bit-rotation operators ( #2903 )
...
* [ new ] Implement bit-rotation operators
Whereas `shiftR` and `shiftL` throw bits off the edge, the `rotR` and
`rotL` operations wrap the bits around to the start of the bit-stream.
* [ test ] visualise bit patterns instead
* [ fix ] print bit patterns the right way around
---------
Co-authored-by: Guillaume Allais <guillaume.allais@ens-lyon.org>
2023-03-04 14:41:54 +00:00
CodingCellist
ba24892e2f
[ new ] Couple of useful things for Vect ( #2904 )
...
Co-authored-by: Ohad Kammar <ohad.kammar@ed.ac.uk>
Co-authored-by: André Videla <andre.videla@gmail.com>
Co-authored-by: Guillaume Allais <guillaume.allais@ens-lyon.org>
2023-03-03 15:58:44 +00:00
Ohad Kammar
1ea1cbeede
Refactor Data.Nat to use preorder reasoning to improve readability
2023-03-03 15:45:31 +00:00
G. Allais
310a8f12cd
[ new ] missing buffer primitives ( #2893 )
2023-02-26 17:50:52 +00:00
crisoagf
7f9db70e15
Add PreorderReasoning comforts ( #2778 )
...
* Add PreorderReasoning comforts
* Drop interface approach in favour of computation
* Update libs/base/Syntax/PreorderReasoning.idr
---------
Co-authored-by: Cristóvão Gomes Ferreira <crisoagf@melo-gibson>
Co-authored-by: Ohad Kammar <ohad.kammar@gmail.com>
Co-authored-by: Guillaume Allais <guillaume.allais@ens-lyon.org>
CI integration co-authored-by: @stefan-hoeck
2023-02-17 17:47:54 +00:00
Stefan Höck
b543daf5ab
[ contrib ] move SortedMap and SortedSet to base ( #2884 )
2023-02-16 11:02:43 -06:00
Denis Buzdalov
bbe96929f1
[ minor, base ] Relax requirement of the These.bifold
2023-01-26 22:15:15 +00:00
Mathew Polzin
24ac56de88
Moving Data.List.HasLength into base ( #2844 )
2023-01-16 00:07:21 -06:00
Mathew Polzin
4005b40a95
[new] Vect.Quantifiers.All QoL ( #2843 )
...
* Add Show for Vect.All
* Add an alias for HVect to Data.Vect.Quantifiers.All
* Add a few utilities for Vect.Quantifiers.All to make it more at home in listy uses.
* Add CHANGELOG entries.
2023-01-09 00:57:00 -06:00
Denis Buzdalov
f4ebcadfad
[ base ] Add forgetting conversions of Vect.Quantifiers
2022-12-20 16:36:27 +00:00
Denis Buzdalov
ff6afb0c59
[ minor ] Make NotBothZero parameter of standard gcd to be erased
2022-12-05 15:10:16 +00:00
0xd34df00d
c6a8c9e7a7
[ base ] Move the worker outside of the Vect's reverse definition
2022-11-21 10:52:47 +00:00
Hattori, Hiroki
5c9f8e36a1
[ RefC ] Add 16 and 32 bit access to base/Data.Buffer . ( #2609 )
...
* Fix symbom mangling
* Revert "Fix symbom mangling"
This reverts commit 6481e80155#2609 ] Use 'UInt' instead of 'Word'
More descriptive/to the point / Less assumed knowledge.
There are no *LE suffixes for UInt8, since endianness is to do with
multiple bytes and UInt8 is a single one.
Co-authored-by: Guillaume Allais <guillaume.allais@ens-lyon.org>
Co-authored-by: Thomas E. Hansen <teh6@st-andrews.ac.uk>
2022-11-15 12:15:06 +01:00
CodingCellist
70ef197cf6
[ base ] Deprecate setByte in favour of setBits8 ( #2764 )
...
* [ base ] Deprecate setByte in favour of setBits8
Deprecate getByte; fix Core.Binary.Prims
Along with `setByte`, the `getByte` function should similarly be
deprecated since it also assumes the value will have the given size,
rather than guaranteeing it in the type.
CI highlighted some required changes in `Core.Binary.Prims` thanks to
`-Werror`. The fix was to add some `cast` calls where the old `getByte`
and `setByte` used to be.
The RefC buffer test will need updating once we remove the functions
completely. Added a note for future peeps.
2022-11-15 10:42:07 +01:00
Robert Wright
b2c42280bb
Erase Fin fromInteger upper bound
2022-11-11 15:34:58 +00:00
stefan-hoeck
6f5b19c389
[ cleanup ] bifoldMap already in Prelude
2022-11-03 14:11:15 +00:00
G. Allais
4cd38a8c5d
[ new ] deriving Show ( #2741 )
2022-11-02 11:57:07 +00:00
Stefan Höck
57c589ca80
[ performance ] More stack safety in the Prelude ( #2704 )
2022-10-26 09:54:53 +01:00
stefan-hoeck
0e956249cc
[ performance ] efficient foldr and foldMap for SnocList
2022-10-04 12:19:32 +02:00
0xd34df00d
c2dd824c58
[ base ] Implement Uninhabited for impossible Pointwise equalities
2022-10-02 21:41:26 +01:00
hilary888
9eaff9f728
Fix typo in documentation string
2022-09-30 22:35:36 +01:00
Stefan Höck
7eebeff905
[ fix ] natToFinLt is O(n) ( #2689 )
2022-09-29 14:36:32 +01:00
G. Allais
81ea363ae8
[ base ] deriving Traversable ( #2678 )
2022-09-24 12:43:49 +01:00
Joel Berkeley
c0153e72cd
[ base ] implement decEq for SnocList ( #2630 )
...
Co-authored-by: Guillaume Allais <guillaume.allais@ens-lyon.org>
2022-09-20 15:46:15 +01:00
0xd34df00d
b3c80e0765
[ base ] Add finToNatEqualityAsPointwise, an inverse of finToNatQuotient
2022-09-05 12:45:28 +01:00
Mathew Polzin
4a348c1f95
Public export remaining function to allow for proofs involving parsing numbers.
2022-07-18 14:10:05 +01:00
Jeroen de Haas
ea7e43ad74
[doc] Remove implicit argument in documentation for parseDouble
2022-07-03 22:00:31 +01:00
Denis Buzdalov
e856569d16
[ doc ] Clarify the doc comment of find* functions of SnocList
2022-06-20 12:13:37 +01:00
Denis Buzdalov
bc838467a3
[ base ] Add a function returning Dec for So
2022-06-17 19:52:35 +01:00
Guillaume Allais
381441d849
[ base ] maximum is an upper bound
2022-06-14 16:07:37 +01:00
Thomas E. Hansen
268a3520f3
[ base ] Port most of List.Quantifiers to List1
...
This doesn't include `Interleaving` and `Split`.
2022-06-09 09:05:10 +02:00
Thomas E. Hansen
5da3bc7d7c
[ base ] Port List.Elem to List1
2022-06-09 09:05:10 +02:00
