arranged 0.1.1

Statically bounds-checked (machine-word-abstracting? TBD) ranged types as zero or low-runtime overhead abstractions providing safe (no unintentional overflow) arithmetic.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29

# arranged

**A** **R**ust **ranged**-type library.

Support for (machine-word-abstracting? TBD) ranged types as zero or low-runtime overhead abstractions using safe and
conventional arithmetic wrappers, written in Rust.

Currently at a pre-alpha experimental (PoC stage) of development--Can this concept even be implemented in Rust?  If yes, 
how efficient is the release code?  Is this *useful*, in the end?.

## Usage

```rust
// Create a `u8`-based `RangeInclusive`-style type limited to `1..=100`, set to the value 42
let my_ranged_value = Ranged::<RiU8<1, 100>>::from(42);
```

## License

Licensed under either:

* MIT license (see LICENSE-MIT file)
* Apache License, Version 2.0 (see LICENSE-APACHE file)
  at your option.

## Contributions

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you shall
be dual licensed as above, without any additional terms or conditions.