Blyx

KeyOrders

Library · 0.1.0

Check a cursor key sequence for repeated and descending adjacent values.

Framework using this library

Install with Conda

Create an environment containing KeyOrders 0.1.0, its Blyx source and a runnable example. Run the second command with Blyx 0.2.1, Rust and a host linker installed.

conda create -y --prefix ./blyx-env --override-channels -c https://rahulchaube1.github.io/blyx-packages blyx-keyorders=0.1.0=0
blyxc native-run ./blyx-env/share/blyx/keyorders/main.blyx

To use this package in your application, copy share/blyx/keyorders/vendor/keyorders from the environment into your project's vendor directory.

Install the full collection with Homebrew or Scoop

Import into a Blyx project

Install Blyx 0.2.1, Rust 1.85 or newer and a host linker. From the directory containing your entry file, clone this tagged release.

git clone --depth 1 --branch v0.1.0 https://github.com/Rahulchaube1/blyx-keyorders.git vendor/keyorders

You can also download KeyOrders as a ZIP. Extract its contents into vendor/keyorders.

Save this as main.blyx beside vendor and run blyxc native-run main.blyx.

use vendor::keyorders::keyorders;

fn main() {
    let keys = [1, 1, 0, 3];
    let result = keyorders_strict(keys);
    if len(result) == 0 { println!("invalid"); return; }
    let mut i = 0;
    while i < len(result) {
        println!(at(result, i));
        i += 1;
    }
}

Expected output

0
1
1

API and input requirements

Returns [strictly increasing, adjacent duplicates, descending pairs]. Intended for unique ordered numeric keys. Invalid arguments and nonfinite results return an empty vector.

APIUse
keyorders_strict(keys)Returns [strictly increasing, adjacent duplicates, descending pairs]. Intended for unique ordered numeric keys.

Develop and contribute

Open the tagged source to read the implementation and examples. Include the smallest reproducible Blyx program, compiler version and expected result when reporting an issue.