let mut result_stack = SmallVec::<[T; 8]>::new(); // We store the expression as postfix, so just evaluate each license // requirement in the order it comes, and then combining the previous @@ -198,26 +236,22 @@ impl Expression { } ExprNode::Fn(Func::All(count)) => { //...
the matching of messages to update the messages which were deemed worthy of waking up the on-call engineer. They shouldn't need to worry about rebuilding the on-call application, nor should they need to understand Go. So the logic was moved into a script and this evaluation engine was ...