arora-behavior-tree 9.2.0

use crate::{
    schema::{Expression, _RET_PARAM_ID},
    tree_node::TreeNode,
    variable::VariableCell,
};
use arora_types::value::Value;
use std::collections::HashMap;
use uuid::Uuid;

// To simulate statuses
//===============================================================
#[allow(unused)]
pub fn succeed() -> TreeNode {
    TreeNode::action_node(SUCCEED_FUNCTION_ID)
}

#[allow(unused)]
pub fn fail() -> TreeNode {
    TreeNode::action_node(FAIL_FUNCTION_ID)
}

#[allow(unused)]
pub fn run() -> TreeNode {
    TreeNode::action_node(RUN_FUNCTION_ID)
}

#[allow(unused)]
pub fn status_identity(value: VariableCell) -> TreeNode {
    TreeNode {
        function: STATUS_IDENTITY_FUNCTION_ID,
        children: None,
        parameters: HashMap::from([(STATUS_VALUE_PARAM_ID, Expression::Variable(value))]),
    }
}

// Core string nodes, dispatched natively (see `core_nodes`)
//==============================================================
#[allow(unused)]
pub fn set_str(variable: Expression, value: Expression) -> TreeNode {
    TreeNode {
        function: SET_STR_FUNCTION_ID,
        children: None,
        parameters: HashMap::from([
            (SET_STR_VARIABLE_PARAM_ID, variable),
            (SET_STR_VALUE_PARAM_ID, value),
        ]),
    }
}

#[allow(unused)]
pub fn unset_str(variable: Expression) -> TreeNode {
    TreeNode {
        function: UNSET_STR_FUNCTION_ID,
        children: None,
        parameters: HashMap::from([(UNSET_STR_VARIABLE_PARAM_ID, variable)]),
    }
}

#[allow(unused)]
pub fn is_str_set(value: Expression) -> TreeNode {
    TreeNode {
        function: IS_STR_SET_FUNCTION_ID,
        children: None,
        parameters: HashMap::from([(IS_STR_SET_VALUE_PARAM_ID, value)]),
    }
}

#[allow(unused)]
pub fn wait_str_set(value: Expression) -> TreeNode {
    TreeNode {
        function: WAIT_STR_SET_FUNCTION_ID,
        children: None,
        parameters: HashMap::from([(WAIT_STR_SET_VALUE_PARAM_ID, value)]),
    }
}

#[allow(unused)]
pub fn regex_match(value: Expression, matcher: Expression, first_match: Expression) -> TreeNode {
    TreeNode {
        function: REGEX_MATCH_FUNCTION_ID,
        children: None,
        parameters: HashMap::from([
            (REGEX_MATCH_VALUE_PARAM_ID, value),
            (REGEX_MATCH_MATCHER_PARAM_ID, matcher),
            (REGEX_MATCH_FIRST_MATCH_PARAM_ID, first_match),
        ]),
    }
}

// Test-only data nodes (the `test-behavior-tree-nodes` module)
//==============================================================
#[allow(unused)]
pub fn store(storage: Expression, value: Expression) -> TreeNode {
    TreeNode {
        function: STORE_FUNCTION_ID,
        children: None,
        parameters: HashMap::from([
            (STORE_STORAGE_PARAM_ID, storage),
            (STORE_VALUE_PARAM_ID, value),
        ]),
    }
}

#[allow(unused)]
pub fn increase(storage: Expression, delta: Expression) -> TreeNode {
    TreeNode {
        function: INCREASE_FUNCTION_ID,
        children: None,
        parameters: HashMap::from([
            (INCREASE_STORAGE_PARAM_ID, storage),
            (INCREASE_DELTA_PARAM_ID, delta),
        ]),
    }
}

// Basic control nodes
//==============================================================
#[allow(unused)]
pub fn seq(children: Vec<TreeNode>) -> TreeNode {
    TreeNode::control_node(SEQ_FUNCTION_ID, children)
}

#[allow(unused)]
pub fn seq_star(children: Vec<TreeNode>) -> TreeNode {
    TreeNode {
        function: SEQ_STAR_FUNCTION_ID,
        children: Some(children),
        parameters: HashMap::from([(
            SEQ_STAR_CURRENT_INDEX_PARAM_ID,
            Expression::Value(Value::U16(0)),
        )]),
    }
}

#[allow(unused)]
pub fn fallback(children: Vec<TreeNode>) -> TreeNode {
    TreeNode::control_node(FALLBACK_FUNCTION_ID, children)
}

#[allow(unused)]
pub fn parallel(children: Vec<TreeNode>) -> TreeNode {
    TreeNode::control_node(PARALLEL_FUNCTION_ID, children)
}

// Other functions from other modules
//================================================================
#[allow(unused)]
pub fn cos(angle: Expression, res: Expression) -> TreeNode {
    TreeNode {
        function: COS_FUNCTION_ID,
        children: None,
        parameters: HashMap::from([(COS_ANGLE_PARAM_ID, angle), (COS_RES_PARAM_ID, res)]),
    }
}

pub const SUCCEED_FUNCTION_ID: Uuid = Uuid::from_bytes([
    0x66, 0x96, 0xF0, 0xBD, 0xE7, 0x81, 0x40, 0xCD, 0xAE, 0xB5, 0x8D, 0xC6, 0x16, 0xF8, 0x10, 0xD2,
]);
pub const FAIL_FUNCTION_ID: Uuid = Uuid::from_bytes([
    0x3a, 0xbb, 0xbf, 0xb6, 0xd0, 0x0d, 0x41, 0xeb, 0x88, 0xbb, 0x97, 0x87, 0x42, 0x67, 0xea, 0xf6,
]);
pub const RUN_FUNCTION_ID: Uuid = Uuid::from_bytes([
    0x41, 0xae, 0x5e, 0xd0, 0x1d, 0x12, 0x4b, 0x71, 0xaa, 0xb8, 0x02, 0xe7, 0xef, 0xed, 0xf1, 0x77,
]);
pub const STATUS_IDENTITY_FUNCTION_ID: Uuid = Uuid::from_bytes([
    0xef, 0x48, 0xe6, 0xd3, 0xc7, 0x35, 0x4b, 0x5c, 0x8f, 0x63, 0xfc, 0x54, 0xd9, 0x4d, 0xd4, 0xee,
]);
pub const STATUS_VALUE_PARAM_ID: Uuid = Uuid::from_bytes([
    0xe1, 0xf1, 0x74, 0xe6, 0xca, 0x9e, 0x43, 0x44, 0x84, 0xcb, 0x7f, 0x3f, 0x22, 0x11, 0x52, 0x39,
]);

pub const STORE_FUNCTION_ID: Uuid = Uuid::from_bytes([
    0xb8, 0x34, 0x9b, 0x96, 0xab, 0xc7, 0x4a, 0x31, 0x90, 0x6c, 0xda, 0x1c, 0xe6, 0xfa, 0x35, 0x6e,
]);
pub const STORE_STORAGE_PARAM_ID: Uuid = Uuid::from_bytes([
    0x23, 0x45, 0xa3, 0xa5, 0xa8, 0x0d, 0x44, 0x80, 0x99, 0x27, 0x3c, 0x65, 0xbd, 0x2b, 0x75, 0x43,
]);
pub const STORE_VALUE_PARAM_ID: Uuid = Uuid::from_bytes([
    0x0a, 0x07, 0x78, 0xcd, 0xcb, 0x7a, 0x41, 0xfc, 0x96, 0xd4, 0x51, 0x2c, 0xc8, 0x53, 0x8c, 0xe2,
]);

pub const INCREASE_FUNCTION_ID: Uuid = Uuid::from_bytes([
    0x7f, 0x6f, 0xc4, 0xa9, 0x56, 0x7c, 0x4f, 0x15, 0x87, 0xcc, 0x7c, 0xa3, 0x4a, 0xe1, 0x45, 0x6f,
]);
pub const INCREASE_STORAGE_PARAM_ID: Uuid = Uuid::from_bytes([
    0xe8, 0x98, 0xfe, 0x88, 0xcc, 0x61, 0x46, 0xd2, 0xae, 0xcc, 0xb4, 0xfc, 0x0b, 0xeb, 0x86, 0x2f,
]);
pub const INCREASE_DELTA_PARAM_ID: Uuid = Uuid::from_bytes([
    0x10, 0x18, 0xeb, 0x85, 0x2d, 0x04, 0x49, 0x95, 0xa3, 0x49, 0xb6, 0xc8, 0x3c, 0x27, 0xf2, 0x87,
]);

// The core string nodes' ids: those of the `test-behavior-tree-nodes` module
// that first implemented them, so trees and builders written against the
// module keep their meaning now that the nodes are native.
pub const SET_STR_FUNCTION_ID: Uuid = Uuid::from_u128(0xc803889f_4757_4b56_908f_4b2b47041eff);
pub const SET_STR_VARIABLE_PARAM_ID: Uuid = Uuid::from_u128(0x8fa2f965_1eb5_40d9_baca_8facef0d31a8);
pub const SET_STR_VALUE_PARAM_ID: Uuid = Uuid::from_u128(0x88438955_7872_44ad_8464_d636dc5fe26f);
pub const UNSET_STR_FUNCTION_ID: Uuid = Uuid::from_u128(0x7dce01ed_9818_4b7d_b45a_2e7fdece3633);
pub const UNSET_STR_VARIABLE_PARAM_ID: Uuid =
    Uuid::from_u128(0x2c84bf0f_4ec2_41a4_83ee_3f92a53be79d);
pub const IS_STR_SET_FUNCTION_ID: Uuid = Uuid::from_u128(0x20ba3f0f_309e_4cd2_adfc_aca6cc432526);
pub const IS_STR_SET_VALUE_PARAM_ID: Uuid = Uuid::from_u128(0xc4f1e72d_30fe_400b_a584_f08e93944026);
pub const WAIT_STR_SET_FUNCTION_ID: Uuid = Uuid::from_u128(0x3180977c_25a1_458e_ab82_11f36c654518);
pub const WAIT_STR_SET_VALUE_PARAM_ID: Uuid =
    Uuid::from_u128(0x8f190079_e519_44d3_ac36_3bfc322e87eb);
pub const REGEX_MATCH_FUNCTION_ID: Uuid = Uuid::from_u128(0x8e3dbcc1_1a81_4cf6_a457_6e0c075456fd);
pub const REGEX_MATCH_VALUE_PARAM_ID: Uuid =
    Uuid::from_u128(0x3267f093_8a7f_4b77_b74c_3bd2e7ad40f9);
pub const REGEX_MATCH_MATCHER_PARAM_ID: Uuid =
    Uuid::from_u128(0x6702e02d_f6ba_4c5d_acab_9ade0a690afa);
pub const REGEX_MATCH_FIRST_MATCH_PARAM_ID: Uuid =
    Uuid::from_u128(0xe8b71df7_2bb5_4498_8bc3_833c5bc8eadc);

// Task-run scaffolding nodes: the graph pieces a spawned run is made of (see
// `behavior::BehaviorTreeInterpreter`'s runner scaffold). A run-call leaf
// carries its full `Call` as one literal parameter; a run-status decorator
// forwards its child's status onto a bound status output and latches at
// terminal.
pub const RUN_CALL_FUNCTION_ID: Uuid = Uuid::from_bytes([
    0x5d, 0x2e, 0x8a, 0x41, 0x0b, 0x67, 0x4c, 0x25, 0x91, 0x3f, 0x6e, 0xd8, 0x2b, 0x94, 0xa7, 0x10,
]);
pub const RUN_CALL_PARAM_ID: Uuid = Uuid::from_bytes([
    0x9c, 0x51, 0x3b, 0x77, 0x24, 0x89, 0x4e, 0xb3, 0x8d, 0x02, 0x51, 0xc6, 0xe9, 0x38, 0x5f, 0x21,
]);
pub const RUN_STATUS_FUNCTION_ID: Uuid = Uuid::from_bytes([
    0x1e, 0x84, 0xd0, 0x6a, 0x93, 0x2c, 0x45, 0x71, 0xb6, 0x4d, 0x18, 0x0a, 0x73, 0xc5, 0x92, 0x36,
]);
pub const RUN_STATUS_OUT_PARAM_ID: Uuid = Uuid::from_bytes([
    0x64, 0x0f, 0x2b, 0x95, 0x5e, 0x13, 0x48, 0x86, 0xa2, 0x79, 0x3c, 0xe1, 0x07, 0x6b, 0xd4, 0x42,
]);
pub const RUN_STATUS_LATCH_PARAM_ID: Uuid = Uuid::from_bytes([
    0xb7, 0x38, 0x91, 0x2d, 0xc0, 0x54, 0x4a, 0x19, 0x8f, 0xe6, 0x25, 0x70, 0x4c, 0xa8, 0x13, 0x57,
]);

// Data nodes: a condition over two values, an array spread over output ports,
// and an array written to keys named by data. They are ticked natively (see
// `behavior_tree::tick_builtin`).

/// `Equal(a, b)`: Success when the two values are equal — the same type and
/// the same value, so `U64(1)` and `U32(1)` differ, and NaN equals nothing —
/// Failure otherwise. Each argument is any link source, a selection included;
/// both must be linked. A selection that does not apply to its source's value
/// errors the tick.
pub const EQUAL_FUNCTION_ID: Uuid = uuid::uuid!("a67583f5-7b1f-4081-a210-b710bd41d88a");
/// [`EQUAL_FUNCTION_ID`]'s first value.
pub const EQUAL_A_PARAM_ID: Uuid = uuid::uuid!("75664d78-aa45-44a7-b1fc-0ab220b933ee");
/// [`EQUAL_FUNCTION_ID`]'s second value.
pub const EQUAL_B_PARAM_ID: Uuid = uuid::uuid!("9399b82f-7ace-41fc-8732-38a42a800698");

/// `Unpack(values, out_0 … out_63)`: writes element `i` of the array `values`
/// to the variable bound to the output port `out_i`, and succeeds. An unbound
/// port is skipped, and so is a `Unit` element, which leaves its variable as
/// it is; elements past the last bound port are ignored. It fails, writing
/// nothing, when `values` is not an array or has fewer elements than the last
/// bound port needs.
///
/// Each `out_i` is an ordinary port binding: a variable (`out_0="{face/k0}"`),
/// bound to its cell when the tree is lowered as any port is — under the
/// Direct convention, the store key of the variable's name. A port bound to
/// anything but a variable, or two ports bound to one variable or one name, is
/// refused at lowering: one tick writes each variable once. `values` is any
/// link source, a selection included, and must be linked. A port's variable
/// is written on every tick; a slot notifies a change only when the value
/// differs from the one it holds (the `Slot` contract), so a value that does
/// not move makes no store change and nothing reaches a bridge. A write the store refuses is not
/// reported by the node, as for any variable.
pub const UNPACK_FUNCTION_ID: Uuid = uuid::uuid!("72d3c388-9fe0-4fe9-9b04-38f9e92d6c78");
/// [`UNPACK_FUNCTION_ID`]'s array.
pub const UNPACK_VALUES_PARAM_ID: Uuid = uuid::uuid!("aa7e72c3-f979-4e94-b11f-f69014ace7cd");
/// The number of [`UNPACK_FUNCTION_ID`]'s output ports, `out_0` to `out_63`.
///
/// Every port is declared — in the Groot palette, one line each, and in
/// Groot's port editor, one row each — so the count is what a node can show:
/// 64 holds a face's 52 ARKit blend shapes with head and eye pose beside them.
/// A longer array, or one whose keys come as data, is written by
/// [`SCATTER_FUNCTION_ID`].
pub const UNPACK_PORTS: usize = 64;
/// [`UNPACK_FUNCTION_ID`]'s output ports: `UNPACK_OUT_PARAM_IDS[i]` is
/// `out_i`. They differ only in their last byte, which is `i`.
pub const UNPACK_OUT_PARAM_IDS: [Uuid; UNPACK_PORTS] = {
    let mut ids = [Uuid::nil(); UNPACK_PORTS];
    let mut i = 0;
    while i < UNPACK_PORTS {
        ids[i] = Uuid::from_u128(UNPACK_OUT_BASE + i as u128);
        i += 1;
    }
    ids
};
/// `out_0`; `out_i` adds `i` to it.
const UNPACK_OUT_BASE: u128 = uuid::uuid!("ae061284-22e5-4149-909a-e74a02524800").as_u128();

/// The index `i` of the output port `out_i` of [`UNPACK_FUNCTION_ID`] that
/// `param` is, if it is one.
pub fn unpack_out_index(param: Uuid) -> Option<usize> {
    let index = param.as_u128().checked_sub(UNPACK_OUT_BASE)?;
    (index < UNPACK_PORTS as u128).then_some(index as usize)
}

/// `Scatter(values, keys, within)`: writes element `i` of the array `values`
/// to the store key named by element `i` of the array `keys`, and succeeds. A
/// `Unit` element leaves its key as it is.
///
/// `within` is a key prefix, a literal string fixed when the tree is lowered:
/// every key must be `within` or under it (its path continues `within` past a
/// `/`, as [`prefix_covers`](arora_types::data::prefix_covers) says), so the
/// keys a tree can write are read off its graph whatever data reaches the
/// node. Lowering refuses a `within` that is not a literal string, is empty,
/// ends with `/` or is tree-local. Keys are store keys under the Direct
/// convention: paths in the store the tree runs over, a device's own keys.
///
/// A tick checks before it writes, and writes all its keys or none:
///
/// - it fails, writing nothing, when `values` or `keys` is not an array, an
///   element of `keys` is not a string, or the two arrays differ in length —
///   a table whose keys and values do not match yet;
/// - it errors, writing nothing, when a key is outside `within` or is named
///   twice in `keys`: the tree would write a key its graph does not name, or
///   one key twice in a tick. A key under `within` is never tree-local.
///
/// The failures are checked first: a table that does not match yet fails
/// whatever its keys name, and a guard can wait it out.
///
/// The node keeps the store slots its last keys resolved to: a tick whose
/// `keys` equal the previous tick's resolves none, and a tick with other keys
/// resolves them all again. A slot notifies a change only when the value
/// differs from the one it holds (the `Slot` contract), so a value that does
/// not move makes no store change. A write the store refuses is not reported
/// by the node, as for any variable. `values` and `keys` are any link source,
/// a selection included; all three arguments must be linked.
pub const SCATTER_FUNCTION_ID: Uuid = uuid::uuid!("eb0a42a1-6596-46f7-83c3-990632bfff94");
/// [`SCATTER_FUNCTION_ID`]'s values.
pub const SCATTER_VALUES_PARAM_ID: Uuid = uuid::uuid!("40940dc9-27ce-41b2-be54-4203665eda66");
/// [`SCATTER_FUNCTION_ID`]'s keys, one per value.
pub const SCATTER_KEYS_PARAM_ID: Uuid = uuid::uuid!("4056190c-ced0-4547-90c3-26d6a93c30b4");
/// [`SCATTER_FUNCTION_ID`]'s key prefix, which every key is under.
pub const SCATTER_WITHIN_PARAM_ID: Uuid = uuid::uuid!("4d773cff-49a7-4b2f-88c8-c6af05f96673");

pub const SEQ_FUNCTION_ID: Uuid = Uuid::from_bytes([
    0x32, 0x24, 0x6d, 0xf6, 0xab, 0x5d, 0x4f, 0x18, 0x92, 0x21, 0x23, 0xe2, 0x87, 0x31, 0xde, 0x93,
]);
pub const SEQ_STAR_FUNCTION_ID: Uuid = Uuid::from_bytes([
    0xc2, 0xd5, 0xed, 0x72, 0x79, 0x8c, 0x41, 0x74, 0x94, 0xf7, 0x13, 0x37, 0x8b, 0xd9, 0xbf, 0x1f,
]);
pub const SEQ_STAR_CURRENT_INDEX_PARAM_ID: Uuid = Uuid::from_bytes([
    0x4d, 0xe5, 0x02, 0xdf, 0x3f, 0x48, 0x45, 0x41, 0x94, 0xd8, 0xdd, 0x68, 0xfe, 0x92, 0xbc, 0x8e,
]);
pub const FALLBACK_FUNCTION_ID: Uuid = Uuid::from_bytes([
    0xbf, 0xa8, 0x9a, 0x4e, 0xc3, 0x69, 0x43, 0x0e, 0xbe, 0x78, 0x0d, 0xc0, 0x73, 0x11, 0x39, 0x1c,
]);
pub const PARALLEL_FUNCTION_ID: Uuid = Uuid::from_bytes([
    0xa9, 0x34, 0x02, 0x89, 0x1f, 0x30, 0x41, 0x1f, 0x9f, 0xaa, 0x0f, 0x07, 0xd5, 0x46, 0x13, 0xe8,
]);

// Direct action nodes from test-rust-wasm (non-Status returns via _ret out-parameter)
//==============================================================
#[allow(unused)]
pub fn cos_raw(angle: Expression, result: VariableCell) -> TreeNode {
    TreeNode {
        function: TEST_RUST_WASM_COS_FUNCTION_ID,
        children: None,
        parameters: HashMap::from([
            (TEST_RUST_WASM_COS_ANGLE_PARAM_ID, angle),
            (_RET_PARAM_ID, Expression::Variable(result)),
        ]),
    }
}

#[allow(unused)]
pub fn add_raw(a: Expression, b: Expression, result: VariableCell) -> TreeNode {
    TreeNode {
        function: TEST_RUST_WASM_ADD_FUNCTION_ID,
        children: None,
        parameters: HashMap::from([
            (TEST_RUST_WASM_ADD_A_PARAM_ID, a),
            (TEST_RUST_WASM_ADD_B_PARAM_ID, b),
            (_RET_PARAM_ID, Expression::Variable(result)),
        ]),
    }
}

pub const TEST_RUST_WASM_COS_FUNCTION_ID: Uuid = Uuid::from_bytes([
    0xc1, 0x37, 0x57, 0xcb, 0x23, 0x11, 0x4c, 0x93, 0xab, 0xcc, 0xcb, 0x12, 0xd6, 0xcb, 0xb8, 0x59,
]);
pub const TEST_RUST_WASM_COS_ANGLE_PARAM_ID: Uuid = Uuid::from_bytes([
    0x6c, 0x2a, 0x15, 0x7c, 0x42, 0x35, 0x47, 0xb0, 0xbf, 0xf3, 0x1e, 0xee, 0xf3, 0xe5, 0x74, 0x7d,
]);
pub const TEST_RUST_WASM_ADD_FUNCTION_ID: Uuid = Uuid::from_bytes([
    0xe4, 0xb0, 0xa2, 0xf3, 0x6c, 0x7d, 0x4e, 0x8f, 0x9a, 0x0b, 0x1c, 0x2d, 0x3e, 0x4f, 0x5a, 0x6b,
]);
pub const TEST_RUST_WASM_ADD_A_PARAM_ID: Uuid = Uuid::from_bytes([
    0xa1, 0xb2, 0xc3, 0xd4, 0xe5, 0xf6, 0x4a, 0x8b, 0x9c, 0x0d, 0xe1, 0xf2, 0xa3, 0xb4, 0xc5, 0xd6,
]);
pub const TEST_RUST_WASM_ADD_B_PARAM_ID: Uuid = Uuid::from_bytes([
    0xb2, 0xc3, 0xd4, 0xe5, 0xf6, 0xa7, 0x4b, 0x9c, 0x8d, 0x1e, 0xf2, 0xa3, 0xb4, 0xc5, 0xd6, 0xe7,
]);
pub const COS_FUNCTION_ID: Uuid = Uuid::from_bytes([
    0x10, 0x4b, 0x97, 0x10, 0x5d, 0x43, 0x4a, 0x93, 0x94, 0x4c, 0xd6, 0x4b, 0xdd, 0xb3, 0x0e, 0xf8,
]);
pub const COS_ANGLE_PARAM_ID: Uuid = Uuid::from_bytes([
    0x27, 0x2f, 0xba, 0xfd, 0xc2, 0xa5, 0x4f, 0xfe, 0xa2, 0x94, 0x9c, 0xab, 0xe6, 0xe6, 0xc1, 0xe7,
]);
pub const COS_RES_PARAM_ID: Uuid = Uuid::from_bytes([
    0x1d, 0x10, 0x16, 0x86, 0x05, 0xd8, 0x47, 0xb4, 0x92, 0x92, 0xfd, 0xc9, 0xe5, 0xa0, 0xda, 0xeb,
]);

pub const ADD_FUNCTION_ID: Uuid = Uuid::from_bytes([
    0x65, 0xbe, 0x1f, 0xe9, 0xac, 0x2a, 0x4b, 0x6e, 0x88, 0x70, 0x68, 0xac, 0x7b, 0xde, 0x6f, 0x0a,
]);
pub const ADD_A_PARAM_ID: Uuid = Uuid::from_bytes([
    0x0b, 0x88, 0x85, 0xb0, 0xaf, 0xca, 0x43, 0x78, 0xab, 0xe6, 0x79, 0xe2, 0xff, 0x0e, 0xe7, 0x2b,
]);
pub const ADD_B_PARAM_ID: Uuid = Uuid::from_bytes([
    0xcb, 0xb2, 0x1d, 0x3d, 0x69, 0xb1, 0x48, 0x8b, 0xa3, 0xc8, 0x23, 0x6c, 0xa6, 0x82, 0x63, 0xae,
]);
pub const ADD_RES_PARAM_ID: Uuid = Uuid::from_bytes([
    0x13, 0xd7, 0xa1, 0xc2, 0x2d, 0x37, 0x4d, 0x0e, 0xb3, 0x17, 0x29, 0x24, 0x67, 0x1d, 0x22, 0x10,
]);