Remove blank lines instead of emptying it's contents

src/models/concrete_syntax.rs

@@ -65,13 +65,13 @@ pub(crate) fn get_all_matches_for_concrete_syntax(
     };
 
     match_map.insert(replace_node_key, replace_node_match.clone());
-
     matches.push(Match {
       matched_string: replace_node_match.text,
       range: replace_node_match.range,
       matches: match_map.into_iter().map(|(k, v)| (k, v.text)).collect(),
       associated_comma: None,
       associated_comments: Vec::new(),
+      associated_leading_empty_lines: Vec::new(),
     });
   }
   if recursive {

src/models/matches.rs

@@ -51,6 +51,10 @@ pub struct Match {
   #[get_mut]
   #[serde(skip)]
   pub(crate) associated_comments: Vec<Range>,
+  #[get]
+  #[get_mut]
+  #[serde(skip)]
+  pub(crate) associated_leading_empty_lines: Vec<Range>,
 }
 
 #[pymethods]
@@ -74,6 +78,7 @@ impl Match {
       matches,
       associated_comma: None,
       associated_comments: Vec::new(),
+      associated_leading_empty_lines: Vec::new(),
     }
   }
 
@@ -85,6 +90,7 @@ impl Match {
     let associated_ranges = [
       self.associated_comma().iter().collect_vec(),
       self.associated_comments().iter().collect_vec(),
+      self.associated_leading_empty_lines().iter().collect_vec(),
     ]
     .concat()
     .iter()
@@ -117,8 +123,45 @@ impl Match {
   ) {
     self.get_associated_elements(node, code, piranha_arguments, true);
     self.get_associated_elements(node, code, piranha_arguments, false);
+    self.get_associated_leading_empty_lines(node, code);
+  }
+
+  fn get_associated_leading_empty_lines(&mut self, matched_node: &Node, code: &String) -> () {
+    if let Some(empty_range) = self.find_empty_line_range(code, matched_node.start_byte()) {
+      let skipped_range = Range {
+        start_byte: empty_range.start,
+        end_byte: empty_range.end,
+        start_point: position_for_offset(code.as_bytes(), empty_range.start),
+        end_point: position_for_offset(code.as_bytes(), empty_range.end),
+      };
+      self
+        .associated_leading_empty_lines_mut()
+        .push(skipped_range);
+    }
   }
 
+  fn find_empty_line_range(&self, code: &str, start_byte: usize) -> Option<std::ops::Range<usize>> {
+    let mut end_byte = start_byte;
+    let code_bytes = code.as_bytes();
+    let mut found = false;
+    while end_byte > 0 {
+      let prev_char = code_bytes[end_byte - 1] as char;
+      if prev_char.is_whitespace() {
+        end_byte -= 1;
+        if prev_char == '\n' {
+          found = true;
+          break;
+        }
+      } else {
+        break;
+      }
+    }
+    if found {
+      Some(end_byte..start_byte)
+    } else {
+      None
+    }
+  }
   fn found_comma(&self) -> bool {
     self.associated_comma().is_some()
   }
@@ -143,7 +186,6 @@ impl Match {
         current_node.prev_sibling()
       } {
         // Check if the sibling is a comma
-
         if !self.found_comma() && self.is_comma_safe_to_delete(&sibling, code, trailing) {
           // Add the comma to the associated matches
           self.associated_comma = Some(sibling.range().into());

src/models/unit_tests/source_code_unit_test.rs

@@ -16,7 +16,7 @@ use tree_sitter::Parser;
 use crate::{
   filter,
   models::{
-    default_configs::{JAVA, UNUSED_CODE_PATH},
+    default_configs::{JAVA, RUBY, UNUSED_CODE_PATH},
     filter::Filter,
     language::PiranhaLanguage,
     matches::{Point, Range},
@@ -699,3 +699,77 @@ fn test_satisfies_outermost_enclosing_node() {
 
   assert!(source_code_unit.is_satisfied(*node, &rule_positive, &HashMap::new(), &mut rule_store,));
 }
+
+#[test]
+fn test_removes_blank_lines_after_inline_cleanup() {
+  let inline_cleanup_rule = piranha_rule! {
+    name= "inline_cleanup_rule",
+    query= "
+    (
+      (if_modifier
+          body : ((_) @body)
+          [
+            condition: (false)
+            condition: (parenthesized_statements (false))
+          ]
+      )@if_modifier
+    )          
+    ",
+    replace_node = "if_modifier",
+    replace = ""
+  };
+
+  let inline_rule = InstantiatedRule::new(&inline_cleanup_rule, &HashMap::new());
+
+  let source_code = r#"
+      def method_name
+        do_something if false
+      end
+  "#
+  .trim();
+
+  let piranha_arguments = PiranhaArgumentsBuilder::default()
+    .paths_to_codebase(vec![UNUSED_CODE_PATH.to_string()])
+    .language(PiranhaLanguage::from(RUBY))
+    .build();
+
+  let mut rule_store = RuleStore::new(&piranha_arguments);
+  let mut parser = piranha_arguments.language().parser();
+
+  let source_code_unit = SourceCodeUnit::new(
+    &mut parser,
+    source_code.to_string(),
+    &HashMap::new(),
+    PathBuf::new().as_path(),
+    &piranha_arguments,
+  );
+  let matches = source_code_unit.get_matches(
+    &inline_rule,
+    &mut rule_store,
+    source_code_unit.root_node(),
+    true,
+  );
+  assert_eq!(matches.len(), 1);
+  assert_eq!(
+    matches
+      .first()
+      .unwrap()
+      .associated_leading_empty_lines
+      .len(),
+    1
+  );
+  assert_eq!(
+    *matches
+      .first()
+      .unwrap()
+      .associated_leading_empty_lines
+      .first()
+      .unwrap(),
+    Range {
+      start_byte: 15,
+      end_byte: 24,
+      start_point: Point { row: 0, column: 15 },
+      end_point: Point { row: 1, column: 8 }
+    }
+  );
+}