use nu_cmd_base::input_handler::{operate, CmdArgument}; use nu_engine::CallExt; use nu_protocol::{ ast::{Call, CellPath}, engine::{Command, EngineState, Stack}, record, Category, Example, PipelineData, ShellError, Signature, Span, Spanned, SyntaxShape, Type, Value, }; struct Arguments { find: Vec, replace: Vec, cell_paths: Option>, all: bool, } impl CmdArgument for Arguments { fn take_cell_paths(&mut self) -> Option> { self.cell_paths.take() } } #[derive(Clone)] pub struct BytesReplace; impl Command for BytesReplace { fn name(&self) -> &str { "bytes replace" } fn signature(&self) -> Signature { Signature::build("bytes replace") .input_output_types(vec![ (Type::Binary, Type::Binary), (Type::Table(vec![]), Type::Table(vec![])), (Type::Record(vec![]), Type::Record(vec![])), ]) .allow_variants_without_examples(true) .required("find", SyntaxShape::Binary, "The pattern to find.") .required("replace", SyntaxShape::Binary, "The replacement pattern.") .rest( "rest", SyntaxShape::CellPath, "For a data structure input, replace bytes in data at the given cell paths.", ) .switch("all", "replace all occurrences of find binary", Some('a')) .category(Category::Bytes) } fn usage(&self) -> &str { "Find and replace binary." } fn search_terms(&self) -> Vec<&str> { vec!["search", "shift", "switch"] } fn run( &self, engine_state: &EngineState, stack: &mut Stack, call: &Call, input: PipelineData, ) -> Result { let cell_paths: Vec = call.rest(engine_state, stack, 2)?; let cell_paths = (!cell_paths.is_empty()).then_some(cell_paths); let find = call.req::>>(engine_state, stack, 0)?; if find.item.is_empty() { return Err(ShellError::TypeMismatch { err_message: "the pattern to find cannot be empty".to_string(), span: find.span, }); } let arg = Arguments { find: find.item, replace: call.req::>(engine_state, stack, 1)?, cell_paths, all: call.has_flag("all"), }; operate(replace, arg, input, call.head, engine_state.ctrlc.clone()) } fn examples(&self) -> Vec { vec![ Example { description: "Find and replace contents", example: "0x[10 AA FF AA FF] | bytes replace 0x[10 AA] 0x[FF]", result: Some(Value::test_binary ( vec![0xFF, 0xFF, 0xAA, 0xFF], )), }, Example { description: "Find and replace all occurrences of find binary", example: "0x[10 AA 10 BB 10] | bytes replace --all 0x[10] 0x[A0]", result: Some(Value::test_binary ( vec![0xA0, 0xAA, 0xA0, 0xBB, 0xA0], )), }, Example { description: "Find and replace all occurrences of find binary in table", example: "[[ColA ColB ColC]; [0x[11 12 13] 0x[14 15 16] 0x[17 18 19]]] | bytes replace --all 0x[11] 0x[13] ColA ColC", result: Some(Value::test_list ( vec![Value::test_record(record! { "ColA" => Value::test_binary(vec![0x13, 0x12, 0x13]), "ColB" => Value::test_binary(vec![0x14, 0x15, 0x16]), "ColC" => Value::test_binary(vec![0x17, 0x18, 0x19]), })], )), }, ] } } fn replace(val: &Value, args: &Arguments, span: Span) -> Value { let val_span = val.span(); match val { Value::Binary { val, .. } => replace_impl(val, args, val_span), // Propagate errors by explicitly matching them before the final case. Value::Error { .. } => val.clone(), other => Value::error( ShellError::OnlySupportsThisInputType { exp_input_type: "binary".into(), wrong_type: other.get_type().to_string(), dst_span: span, src_span: other.span(), }, span, ), } } fn replace_impl(input: &[u8], arg: &Arguments, span: Span) -> Value { let mut replaced = vec![]; let replace_all = arg.all; // doing find-and-replace stuff. let (mut left, mut right) = (0, arg.find.len()); let input_len = input.len(); let pattern_len = arg.find.len(); while right <= input_len { if input[left..right] == arg.find { let mut to_replace = arg.replace.clone(); replaced.append(&mut to_replace); left += pattern_len; right += pattern_len; if !replace_all { break; } } else { replaced.push(input[left]); left += 1; right += 1; } } let mut remain = input[left..].to_vec(); replaced.append(&mut remain); Value::binary(replaced, span) } #[cfg(test)] mod tests { use super::*; #[test] fn test_examples() { use crate::test_examples; test_examples(BytesReplace {}) } }