rgapi 0.1.25__tar.gz → 0.1.26__tar.gz

{rgapi-0.1.25 → rgapi-0.1.26}/Cargo.lock

@@ -36,9 +36,9 @@ checksum = "7f8f80099a98041a3d1622845c271458a2d73e688351bf3cb999266764b81d48"
 
 [[package]]
 name = "crc32fast"
-version = "1.5.1"
+version = "1.5.2"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "8498c871161e1742aaa9d52551b2d6ebdd4c3d45a3be423e3728f33b955be550"
+checksum = "01a7799fd6b852db0e61728dde9a204c423b44d689dbd432522543614b490e78"
 dependencies = [
  "cfg-if",
 ]
@@ -70,9 +70,9 @@ checksum = "a31eee39dddec8330830986fcd7625edb5a24ec90ea038215273bbc3adb08ac6"
 
 [[package]]
 name = "encoding_rs"
-version = "0.8.40"
+version = "0.8.41"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "2a7a45518d2863d18aa47f4a0cf9faec2aa4304cc09df5e41299f276b3ad135e"
+checksum = "7b5ef0006ac9ab233c38522f5ae99cae3625151de8f706cacee1cba4b8e2832a"
 dependencies = [
  "cfg-if",
  "core_detect",
@@ -199,24 +199,23 @@ dependencies = [
 
 [[package]]
 name = "multiversion"
-version = "0.8.0"
+version = "0.9.0"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "7edb7f0ff51249dfda9ab96b5823695e15a052dc15074c9dbf3d118afaf2c201"
+checksum = "b4ca4bea16ffc3f443cf7d866912118196bfef4c6a1556ca00f9f9b00bb43f7c"
 dependencies = [
  "multiversion-macros",
- "target-features",
 ]
 
 [[package]]
 name = "multiversion-macros"
-version = "0.8.0"
+version = "0.9.0"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "b093064383341eb3271f42e381cb8f10a01459478446953953c75d24bd339fc0"
+checksum = "0d416831a7317ef4b08bee00b69cbbb9c8763da7959a7026244d6266869f9c83"
 dependencies = [
  "proc-macro2",
  "quote",
- "syn 2.0.119",
- "target-features",
+ "rustversion",
+ "syn 3.0.5",
 ]
 
 [[package]]
@@ -331,7 +330,7 @@ checksum = "d6f6ff9a378485b298a5286656da665ba74413d36db0979633275d2e708145d4"
 
 [[package]]
 name = "rgapi"
-version = "0.1.25"
+version = "0.1.26"
 dependencies = [
  "crc32fast",
  "globset",
@@ -436,12 +435,6 @@ dependencies = [
  "unicode-ident",
 ]
 
-[[package]]
-name = "target-features"
-version = "0.1.6"
-source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "c1bbb9f3c5c463a01705937a24fdabc5047929ac764b2d5b9cf681c1f5041ed5"
-
 [[package]]
 name = "target-lexicon"
 version = "0.13.5"

{rgapi-0.1.25 → rgapi-0.1.26}/Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "rgapi"
-version = "0.1.25"
+version = "0.1.26"
 edition = "2024"
 rust-version = "1.91"
 license = "Apache-2.0"

{rgapi-0.1.25 → rgapi-0.1.26}/DEV.md

@@ -50,4 +50,6 @@ Path results are `FileEntry` rows: a `str` subclass carrying the walk root, so p
 
 Rust callers can consume a `StreamIter` with `cancel_and_join()` to cancel, drain queued results, and wait for the walk's workers to finish. `Drop` remains nonblocking. Since filesystem calls already in progress must return before joining completes, keep `cancel_and_join()` off async executors.
 
+Notebook hierarchy uses `heading_level(source)`, `section_range(levels, idx)` and `ancestor_indices(levels, idx)`. Callers supply zero for non-heading cells. Heading detection skips blank lines and lines starting with `#|`, then checks the first remaining line against `^#{1,6} \w`. It does not search past ordinary text. Section ranges include the addressed cell and end before the next equal-or-higher heading; non-headings select themselves. Ancestors exclude the addressed cell and are returned outermost first. These are calculations over the supplied levels, without retained outline state. Rustygate uses them for its cell selectors.
+
 This package intentionally has no CLI. Python is the interface.

{rgapi-0.1.25 → rgapi-0.1.26}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: rgapi
-Version: 0.1.25
+Version: 0.1.26
 Classifier: Programming Language :: Rust
 Classifier: Programming Language :: Python :: Implementation :: CPython
 Requires-Dist: fastcore>=1.14.6

{rgapi-0.1.25 → rgapi-0.1.26}/src/lib.rs

@@ -9,7 +9,7 @@ mod walk;
 mod python;
 
 pub use block::{BlockIter, SearchBlock, block_iter};
-pub use nb::{NbCell, NbIter, NbOptions, nb_iter, nb_search, nb_search_file};
+pub use nb::{NbCell, NbIter, NbOptions, ancestor_indices, heading_level, nb_iter, nb_search, nb_search_file, section_range};
 pub use search::{MatchSpan, RgIter, RgOptions, SearchKind, SearchLine, compile_regex, rg, rg_iter, search_path, search_text};
 pub use walk::{FindIter, FindOptions, StreamIter, find, find_iter};
 

{rgapi-0.1.25 → rgapi-0.1.26}/src/nb.rs

@@ -1,8 +1,9 @@
 use std::collections::{BTreeMap, HashMap};
 use std::path::{Path, PathBuf};
-use std::sync::Arc;
+use std::sync::{Arc, LazyLock};
 use std::sync::atomic::Ordering;
 
+use grep_matcher::Matcher;
 use grep_regex::RegexMatcher;
 use ignore::{DirEntry, WalkState};
 use serde::Deserialize;
@@ -11,6 +12,36 @@ use crate::RgApiError;
 use crate::search::{SearchLine, compile_regex, search_text};
 use crate::walk::{PathFilters, StreamIter, entry_err, file_root_flags, normalize_root, rel_path, spawn_walk};
 
+static HEADING_RE: LazyLock<RegexMatcher> = LazyLock::new(|| RegexMatcher::new(r"^#{1,6} \w").unwrap());
+
+/// Heading level of the first nonblank line after skipping `#|` directives; zero unless it matches `^#{1,6} \w`.
+pub fn heading_level(source: &str) -> usize {
+    let line = source.lines().find(|l| !l.trim().is_empty() && !l.starts_with("#|")).unwrap_or("");
+    if !HEADING_RE.is_match(line.as_bytes()).unwrap_or(false) { return 0; }
+    line.bytes().take_while(|&b| b == b'#').count()
+}
+
+/// A heading and its descendants; a non-heading selects itself. Zero levels represent non-heading cells.
+pub fn section_range(levels: &[usize], idx: usize) -> std::ops::Range<usize> {
+    if levels[idx] == 0 { return idx..idx + 1; }
+    let end = (idx + 1..levels.len()).find(|&i| levels[i] > 0 && levels[i] <= levels[idx]).unwrap_or(levels.len());
+    idx..end
+}
+
+/// Enclosing heading indices, outermost first, excluding the addressed cell.
+pub fn ancestor_indices(levels: &[usize], idx: usize) -> Vec<usize> {
+    let mut level = if levels[idx] == 0 { 7 } else { levels[idx] };
+    let mut parents = Vec::new();
+    for i in (0..idx).rev() {
+        if levels[i] > 0 && levels[i] < level {
+            parents.push(i);
+            level = levels[i];
+        }
+    }
+    parents.reverse();
+    parents
+}
+
 #[derive(Debug, Clone)]
 pub struct NbOptions {
     pub root: PathBuf,