git.iko.soy/Idris-dev
on bee324c help sign in
bee324cFix ashr behavior on non-native bitfield widthsBenjamin Saunders 601f694Defined complement operator for bitfieldsBenjamin Saunders 602a3d9Fixed the C codegen's bitfield comparison primitivesBenjamin Saunders 0ffb7b6Fix violations of parametricityBenjamin Saunders cbc8a13ConcisenessBenjamin Saunders 4ea88e1Remainder primitives for C codegenBenjamin Saunders d20d0b9Debuggable CodegenC primitive match failuresBenjamin Saunders 58a36efFix a missing prototypeBenjamin Saunders 46bf6a4Include bitstring prototypes in C codegenBenjamin Saunders eff298eAdd missing VM argumentsBenjamin Saunders 70cc9cdCleanupBenjamin Saunders 7f7af8dFix a few missing linesBenjamin Saunders 9804938Base 10 show for Mod2 and various cleanupBenjamin Saunders b2b4d1eMore general safe bitsToStrBenjamin Saunders 01771e6Fix left shift on non-power-of-two length bitstrings and add bitSet testBenjamin Saunders 20d9515DRYerBenjamin Saunders 1115dd5Eq and Ord for Mod2Benjamin Saunders c4c3b91Fall back on base 2 printing for Mod2 for nowBenjamin Saunders 42405c8DRYBenjamin Saunders 5634a77Eq and Ord instances for BitsBenjamin Saunders 45bbe39Mark bit divisions/remainders as partialBenjamin Saunders 9e543e6Remainder primitives for bitsBenjamin Saunders 5f6ac67In-lang stringification of BitsBenjamin Saunders 9909d70More concise (and less fragile) boolean comparison wrappersBenjamin Saunders 358c623Partially restore access qualifiersBenjamin Saunders da79c5eComparisons on bitsBenjamin Saunders ee40d17Strip access qualifiers pending resolution of issue #143Benjamin Saunders c3cb8a4Correct module namesBenjamin Saunders 2308c53More optimization-friendly intToBitsBenjamin Saunders 88eb2bfC codegen for bitmanip and bit comparatorsErkin Batu Altunbaş ebacfeeEquality result typeBenjamin Saunders df10078Complement primitive for bit typesBenjamin Saunders 12615d4Swapped bitsEq Either ordering to be in the spirit of Right=successBenjamin Saunders c3f27f7Safe bitsEqBenjamin Saunders 927fd18Machine integer comparison primitives and a proofy interface to the equality caseBenjamin Saunders 0b96076Cast instances for Mod2 <=> Bits and Int => BitsBenjamin Saunders ef96397Replace general modulo type with modulo 2^n typeBenjamin Saunders 1006d3aCorrect behavior of operations on non-native bit widthsBenjamin Saunders 5a26a74Show instance for ModuloBenjamin Saunders 279b02dAccess qualifiers for ModuloBenjamin Saunders 8252b94Strongly-typed bitsBenjamin Saunders 001469dCast Int (Bits n) instanceBenjamin Saunders 8216c7fBasic bit-twiddling primitivesBenjamin Saunders 348cf91String primitivesBenjamin Saunders 0045b68Resolve implicit definition warnings relating to bitstringsBenjamin Saunders 5734ddfBeginnings of generic machine integer supportBenjamin Saunders e2807a1Verified numbersBenjamin Saunders b3ba46ePrimitives for interconversion of Bits32 and IntBenjamin Saunders 103d65eflooring log2 for NatsBenjamin Saunders 7518b0cAbsolutely untested implementations of a few bitstring primitives.Irene Knapp