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 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319
use bitvec::prelude::*; use ndarray::prelude::*; use num::ToPrimitive; #[derive(buffalo::Read, buffalo::Write)] #[buffalo(size = "dynamic")] pub struct Regressor { #[buffalo(id = 0, required)] pub bias: f32, #[buffalo(id = 1, required)] pub trees: Vec<Tree>, } #[derive(buffalo::Read, buffalo::Write)] #[buffalo(size = "dynamic")] pub struct BinaryClassifier { #[buffalo(id = 0, required)] pub bias: f32, #[buffalo(id = 1, required)] pub trees: Vec<Tree>, } #[derive(buffalo::Read, buffalo::Write)] #[buffalo(size = "dynamic")] pub struct MulticlassClassifier { #[buffalo(id = 0, required)] pub biases: Array1<f32>, #[buffalo(id = 1, required)] pub trees: Array2<Tree>, } #[derive(buffalo::Read, buffalo::Write)] #[buffalo(size = "dynamic")] pub struct Tree { #[buffalo(id = 0, required)] pub nodes: Vec<Node>, } #[derive(buffalo::Read, buffalo::Write)] #[buffalo(size = "static", value_size = 8)] pub enum Node { #[buffalo(id = 0)] Branch(BranchNode), #[buffalo(id = 1)] Leaf(LeafNode), } #[derive(buffalo::Read, buffalo::Write)] #[buffalo(size = "dynamic")] pub struct BranchNode { #[buffalo(id = 0, required)] pub left_child_index: u64, #[buffalo(id = 1, required)] pub right_child_index: u64, #[buffalo(id = 2, required)] pub split: BranchSplit, #[buffalo(id = 3, required)] pub examples_fraction: f32, } #[derive(buffalo::Read, buffalo::Write)] #[buffalo(size = "static", value_size = 8)] pub enum BranchSplit { #[buffalo(id = 0)] Continuous(BranchSplitContinuous), #[buffalo(id = 1)] Discrete(BranchSplitDiscrete), } #[derive(buffalo::Read, buffalo::Write)] #[buffalo(size = "dynamic")] pub struct BranchSplitContinuous { #[buffalo(id = 0, required)] pub feature_index: u64, #[buffalo(id = 1, required)] pub split_value: f32, #[buffalo(id = 2, required)] pub invalid_values_direction: SplitDirection, } #[derive(buffalo::Read, buffalo::Write)] #[buffalo(size = "dynamic")] pub struct BranchSplitDiscrete { #[buffalo(id = 0, required)] pub feature_index: u64, #[buffalo(id = 1, required)] pub directions: BitVec<Lsb0, u8>, } #[derive(buffalo::Read, buffalo::Write)] #[buffalo(size = "static", value_size = 0)] pub enum SplitDirection { #[buffalo(id = 0)] Left, #[buffalo(id = 1)] Right, } #[derive(buffalo::Read, buffalo::Write)] #[buffalo(size = "dynamic")] pub struct LeafNode { #[buffalo(id = 0, required)] pub value: f64, #[buffalo(id = 1, required)] pub examples_fraction: f32, } pub(crate) fn serialize_regressor( regressor: &crate::Regressor, writer: &mut buffalo::Writer, ) -> buffalo::Position<RegressorWriter> { let trees = regressor .trees .iter() .map(|tree| { let tree = serialize_tree(tree, writer); writer.write(&tree) }) .collect::<Vec<_>>(); let trees = writer.write(&trees); writer.write(&RegressorWriter { bias: regressor.bias, trees, }) } pub(crate) fn serialize_binary_classifier( binary_classifier: &crate::BinaryClassifier, writer: &mut buffalo::Writer, ) -> buffalo::Position<BinaryClassifierWriter> { let trees = binary_classifier .trees .iter() .map(|tree| { let tree = serialize_tree(tree, writer); writer.write(&tree) }) .collect::<Vec<_>>(); let trees = writer.write(&trees); writer.write(&BinaryClassifierWriter { bias: binary_classifier.bias, trees, }) } pub(crate) fn serialize_multiclass_classifier( multiclass_classifier: &crate::MulticlassClassifier, writer: &mut buffalo::Writer, ) -> buffalo::Position<MulticlassClassifierWriter> { let biases = writer.write(&multiclass_classifier.biases); let trees = multiclass_classifier.trees.map(|tree| { let tree = serialize_tree(tree, writer); writer.write(&tree) }); let trees = writer.write(&trees); writer.write(&MulticlassClassifierWriter { biases, trees }) } fn serialize_tree(tree: &crate::Tree, writer: &mut buffalo::Writer) -> TreeWriter { let nodes = tree .nodes .iter() .map(|node| serialize_node(node, writer)) .collect::<Vec<_>>(); let nodes = writer.write(&nodes); TreeWriter { nodes } } fn serialize_node(node: &crate::Node, writer: &mut buffalo::Writer) -> NodeWriter { match node { crate::Node::Branch(node) => { let split = serialize_branch_split(&node.split, writer); let node = writer.write(&BranchNodeWriter { left_child_index: node.left_child_index.to_u64().unwrap(), right_child_index: node.right_child_index.to_u64().unwrap(), split, examples_fraction: node.examples_fraction, }); NodeWriter::Branch(node) } crate::Node::Leaf(node) => { let node = writer.write(&LeafNodeWriter { value: node.value, examples_fraction: node.examples_fraction, }); NodeWriter::Leaf(node) } } } fn serialize_branch_split( branch_split: &crate::BranchSplit, writer: &mut buffalo::Writer, ) -> BranchSplitWriter { match branch_split { crate::BranchSplit::Continuous(split) => { let invalid_values_direction = serialize_split_direction(&split.invalid_values_direction, writer); let split = writer.write(&BranchSplitContinuousWriter { feature_index: split.feature_index.to_u64().unwrap(), split_value: split.split_value, invalid_values_direction, }); BranchSplitWriter::Continuous(split) } crate::BranchSplit::Discrete(split) => { let directions = writer.write(&split.directions); let split = writer.write(&BranchSplitDiscreteWriter { feature_index: split.feature_index.to_u64().unwrap(), directions, }); BranchSplitWriter::Discrete(split) } } } fn serialize_split_direction( split_direction: &crate::SplitDirection, _writer: &mut buffalo::Writer, ) -> SplitDirectionWriter { match split_direction { crate::SplitDirection::Left => SplitDirectionWriter::Left, crate::SplitDirection::Right => SplitDirectionWriter::Right, } } pub(crate) fn deserialize_regressor(model: RegressorReader) -> crate::Regressor { let bias = model.bias(); let trees = model .trees() .iter() .map(deserialize_tree) .collect::<Vec<_>>(); crate::Regressor { bias, trees } } pub(crate) fn deserialize_binary_classifier( model: BinaryClassifierReader, ) -> crate::BinaryClassifier { let bias = model.bias(); let trees = model .trees() .iter() .map(deserialize_tree) .collect::<Vec<_>>(); crate::BinaryClassifier { bias, trees } } pub(crate) fn deserialize_multiclass_classifier( model: MulticlassClassifierReader, ) -> crate::MulticlassClassifier { let biases = model.biases(); let trees = model.trees().mapv(deserialize_tree); crate::MulticlassClassifier { biases, trees } } fn deserialize_tree(tree: TreeReader) -> crate::Tree { let nodes = tree .nodes() .iter() .map(deserialize_node) .collect::<Vec<_>>(); crate::Tree { nodes } } fn deserialize_node(node: NodeReader) -> crate::Node { match node { NodeReader::Branch(node) => { let node = node.read(); let left_child_index = node.left_child_index().to_usize().unwrap(); let right_child_index = node.right_child_index().to_usize().unwrap(); let examples_fraction = node.examples_fraction(); let split = deserialize_branch_split(node.split()); crate::Node::Branch(crate::BranchNode { left_child_index, right_child_index, split, examples_fraction, }) } NodeReader::Leaf(node) => { let node = node.read(); let value = node.value(); let examples_fraction = node.examples_fraction(); crate::Node::Leaf(crate::LeafNode { value, examples_fraction, }) } } } fn deserialize_branch_split(branch_split: BranchSplitReader) -> crate::BranchSplit { match branch_split { BranchSplitReader::Continuous(split) => { let split = split.read(); let feature_index = split.feature_index().to_usize().unwrap(); let split_value = split.split_value(); let invalid_values_direction = match split.invalid_values_direction() { SplitDirectionReader::Left(_) => crate::SplitDirection::Left, SplitDirectionReader::Right(_) => crate::SplitDirection::Right, }; crate::BranchSplit::Continuous(crate::BranchSplitContinuous { feature_index, split_value, invalid_values_direction, }) } BranchSplitReader::Discrete(split) => { let split = split.read(); let feature_index = split.feature_index().to_usize().unwrap(); let directions = split.directions().to_owned(); crate::BranchSplit::Discrete(crate::BranchSplitDiscrete { feature_index, directions, }) } } }