1use super::*;
2use formualizer_common::parse_a1_1based;
3
4#[inline]
5fn normalize_name_key(name: &str) -> String {
6 name.to_lowercase()
7}
8
9fn is_valid_excel_name(name: &str) -> bool {
11 if name.is_empty() || name.len() > 255 {
19 return false;
20 }
21
22 if parse_a1_1based(name).is_ok() {
23 return false;
24 }
25
26 let mut chars = name.chars();
27
28 if let Some(first) = chars.next()
30 && !first.is_alphabetic()
31 && first != '_'
32 && first != '\\'
33 {
34 return false;
35 }
36
37 for c in chars {
39 if !c.is_alphanumeric() && c != '.' && c != '_' {
40 return false;
41 }
42 }
43
44 true
45}
46
47fn adjust_named_definition(
49 definition: &mut NamedDefinition,
50 adjuster: &crate::engine::graph::editor::reference_adjuster::ReferenceAdjuster,
51 operation: &crate::engine::graph::editor::reference_adjuster::ShiftOperation,
52) -> Result<(), ExcelError> {
53 match definition {
54 NamedDefinition::Cell(cell_ref) => {
55 if let Some(adjusted) = adjuster.adjust_cell_ref(cell_ref, operation) {
56 *cell_ref = adjusted;
57 } else {
58 return Err(ExcelError::new(ExcelErrorKind::Ref));
59 }
60 }
61 NamedDefinition::Range(range_ref) => {
62 let adjusted_start = adjuster.adjust_cell_ref(&range_ref.start, operation);
63 let adjusted_end = adjuster.adjust_cell_ref(&range_ref.end, operation);
64
65 if let (Some(start), Some(end)) = (adjusted_start, adjusted_end) {
66 range_ref.start = start;
67 range_ref.end = end;
68 } else {
69 return Err(ExcelError::new(ExcelErrorKind::Ref));
70 }
71 }
72 NamedDefinition::Literal(_) => {
73 }
75 NamedDefinition::Formula {
76 ast,
77 dependencies,
78 range_deps,
79 } => {
80 let adjusted_ast = adjuster.adjust_ast(ast, operation);
81 *ast = adjusted_ast;
82
83 dependencies.clear();
84 range_deps.clear();
85 }
86 }
87 Ok(())
88}
89
90impl DependencyGraph {
91 #[inline]
92 pub(crate) fn name_lookup_key(&self, name: &str) -> String {
93 if self.config.case_sensitive_names {
94 name.to_string()
95 } else {
96 normalize_name_key(name)
97 }
98 }
99
100 fn canonical_name_in_scope(&self, scope: NameScope, name: &str) -> Option<String> {
101 let key = self.name_lookup_key(name);
102 match scope {
103 NameScope::Workbook => self.named_ranges_lookup.get(&key).cloned(),
104 NameScope::Sheet(sheet_id) => self
105 .sheet_named_ranges_lookup
106 .get(&(sheet_id, key))
107 .cloned(),
108 }
109 }
110
111 fn next_name_coord(&mut self) -> AbsCoord {
112 let seq = self.name_vertex_seq;
113 self.name_vertex_seq = self.name_vertex_seq.wrapping_add(1);
114 let row = (seq / 16_384).min(0x000F_FFFF);
115 let col = seq % 16_384;
116 AbsCoord::new(row, col)
117 }
118
119 pub(super) fn allocate_name_vertex(&mut self, scope: NameScope) -> VertexId {
120 let coord = self.next_name_coord();
121 let sheet_id = match scope {
122 NameScope::Sheet(id) => id,
123 NameScope::Workbook => self.default_sheet_id,
124 };
125 let vertex_id = self.store.allocate(coord, sheet_id, 0x01);
126 self.store.set_kind(vertex_id, VertexKind::NamedScalar);
127 self.store.set_dirty(vertex_id, true);
128 self.edges.add_vertex(coord, vertex_id.0);
129 self.dirty_vertices.insert(vertex_id);
130 vertex_id
131 }
132
133 pub fn define_name(
137 &mut self,
138 name: &str,
139 definition: NamedDefinition,
140 scope: NameScope,
141 ) -> Result<(), ExcelError> {
142 if !is_valid_excel_name(name) {
144 return Err(
145 ExcelError::new(ExcelErrorKind::Name).with_message(format!("Invalid name: {name}"))
146 );
147 }
148
149 let lookup_key = self.name_lookup_key(name);
151 match scope {
152 NameScope::Workbook => {
153 if let Some(existing) = self.named_ranges_lookup.get(&lookup_key) {
154 return Err(ExcelError::new(ExcelErrorKind::Name).with_message(format!(
155 "Name collision under normalization: '{name}' conflicts with '{existing}'"
156 )));
157 }
158 }
159 NameScope::Sheet(sheet_id) => {
160 if let Some(existing) = self
161 .sheet_named_ranges_lookup
162 .get(&(sheet_id, lookup_key.clone()))
163 {
164 return Err(ExcelError::new(ExcelErrorKind::Name).with_message(format!(
165 "Name collision under normalization in sheet: '{name}' conflicts with '{existing}'"
166 )));
167 }
168 }
169 }
170
171 let mut final_definition = definition;
172 if let NamedDefinition::Formula { ref ast, .. } = final_definition {
174 let (deps, range_deps, _, _) = self.extract_dependencies(
175 ast,
176 match scope {
177 NameScope::Sheet(id) => id,
178 NameScope::Workbook => self.default_sheet_id,
179 },
180 )?;
181 final_definition = NamedDefinition::Formula {
182 ast: ast.clone(),
183 dependencies: deps,
184 range_deps,
185 };
186 }
187
188 let vertex_id = self.allocate_name_vertex(scope);
190
191 let named_range = NamedRange {
192 definition: final_definition,
193 scope,
194 dependents: FxHashSet::default(),
195 vertex: vertex_id,
196 };
197
198 if matches!(named_range.definition, NamedDefinition::Range(_)) {
199 self.store.set_kind(vertex_id, VertexKind::NamedArray);
200 } else {
201 self.store.set_kind(vertex_id, VertexKind::NamedScalar);
202 }
203
204 let referenced_names =
205 self.rebuild_name_dependencies(vertex_id, &named_range.definition, scope);
206 if !referenced_names.is_empty() {
207 self.attach_vertex_to_names(vertex_id, &referenced_names);
208 }
209
210 let key = name.to_string();
211
212 match scope {
213 NameScope::Workbook => {
214 self.named_ranges.insert(key.clone(), named_range);
215 self.named_ranges_lookup
216 .insert(self.name_lookup_key(&key), key.clone());
217 }
218 NameScope::Sheet(id) => {
219 self.sheet_named_ranges
220 .insert((id, key.clone()), named_range);
221 self.sheet_named_ranges_lookup
222 .insert((id, self.name_lookup_key(&key)), key.clone());
223 }
224 }
225
226 self.name_vertex_lookup.insert(vertex_id, (scope, key));
227 self.resolve_pending_name_references(scope, name);
228
229 Ok(())
230 }
231
232 pub fn named_ranges_iter(&self) -> impl Iterator<Item = (&String, &NamedRange)> {
234 self.named_ranges.iter()
235 }
236
237 pub fn sheet_named_ranges_iter(
239 &self,
240 ) -> impl Iterator<Item = (&(SheetId, String), &NamedRange)> {
241 self.sheet_named_ranges.iter()
242 }
243
244 pub fn resolve_name_entry(&self, name: &str, current_sheet: SheetId) -> Option<&NamedRange> {
245 if self.config.case_sensitive_names {
246 self.sheet_named_ranges
247 .get(&(current_sheet, name.to_string()))
248 .or_else(|| self.named_ranges.get(name))
249 } else {
250 let key = self.name_lookup_key(name);
251 self.sheet_named_ranges_lookup
252 .get(&(current_sheet, key.clone()))
253 .and_then(|canon| self.sheet_named_ranges.get(&(current_sheet, canon.clone())))
254 .or_else(|| {
255 self.named_ranges_lookup
256 .get(&key)
257 .and_then(|canon| self.named_ranges.get(canon))
258 })
259 }
260 }
261
262 pub fn resolve_name(&self, name: &str, current_sheet: SheetId) -> Option<&NamedDefinition> {
264 self.resolve_name_entry(name, current_sheet)
265 .map(|nr| &nr.definition)
266 }
267
268 pub fn named_range_by_vertex(&self, vertex: VertexId) -> Option<&NamedRange> {
269 self.name_vertex_lookup
270 .get(&vertex)
271 .and_then(|(scope, name)| match scope {
272 NameScope::Workbook => self.named_ranges.get(name),
273 NameScope::Sheet(sheet_id) => {
274 self.sheet_named_ranges.get(&(*sheet_id, name.clone()))
275 }
276 })
277 }
278
279 pub fn update_name(
281 &mut self,
282 name: &str,
283 new_definition: NamedDefinition,
284 scope: NameScope,
285 ) -> Result<(), ExcelError> {
286 let Some(canon_name) = self.canonical_name_in_scope(scope, name) else {
287 return Err(ExcelError::new(ExcelErrorKind::Name)
288 .with_message(format!("Name not found: {name}")));
289 };
290
291 let dependents_to_dirty = match scope {
293 NameScope::Workbook => self
294 .named_ranges
295 .get(&canon_name)
296 .map(|nr| nr.dependents.iter().copied().collect::<Vec<_>>()),
297 NameScope::Sheet(id) => self
298 .sheet_named_ranges
299 .get(&(id, canon_name.clone()))
300 .map(|nr| nr.dependents.iter().copied().collect::<Vec<_>>()),
301 };
302
303 if let Some(dependents) = dependents_to_dirty {
304 for vertex_id in dependents {
306 self.mark_vertex_dirty(vertex_id);
307 }
308
309 let named_range = match scope {
311 NameScope::Workbook => self.named_ranges.get_mut(&canon_name),
312 NameScope::Sheet(id) => self.sheet_named_ranges.get_mut(&(id, canon_name.clone())),
313 };
314
315 let mut update_data: Option<(VertexId, NameScope, NamedDefinition, bool)> = None;
316 if let Some(named_range) = named_range {
317 named_range.definition = new_definition;
318 let is_range = matches!(named_range.definition, NamedDefinition::Range(_));
319 update_data = Some((
320 named_range.vertex,
321 named_range.scope,
322 named_range.definition.clone(),
323 is_range,
324 ));
325 }
326
327 if let Some((vertex, scope_value, definition_snapshot, is_range)) = update_data {
328 self.detach_vertex_from_names(vertex);
329
330 if is_range {
331 self.store.set_kind(vertex, VertexKind::NamedArray);
332 } else {
333 self.store.set_kind(vertex, VertexKind::NamedScalar);
334 }
335 self.store.set_dirty(vertex, true);
336 self.dirty_vertices.insert(vertex);
337
338 let referenced_names =
339 self.rebuild_name_dependencies(vertex, &definition_snapshot, scope_value);
340 if !referenced_names.is_empty() {
341 self.attach_vertex_to_names(vertex, &referenced_names);
342 }
343 }
344
345 Ok(())
346 } else {
347 Err(ExcelError::new(ExcelErrorKind::Name)
348 .with_message(format!("Name not found: {name}")))
349 }
350 }
351
352 pub fn delete_name(&mut self, name: &str, scope: NameScope) -> Result<(), ExcelError> {
354 let Some(canon_name) = self.canonical_name_in_scope(scope, name) else {
355 return Err(ExcelError::new(ExcelErrorKind::Name)
356 .with_message(format!("Name not found: {name}")));
357 };
358
359 let named_range = match scope {
360 NameScope::Workbook => {
361 let removed = self.named_ranges.remove(&canon_name);
362 let key = self.name_lookup_key(&canon_name);
363 self.named_ranges_lookup.remove(&key);
364 removed
365 }
366 NameScope::Sheet(id) => {
367 let removed = self.sheet_named_ranges.remove(&(id, canon_name.clone()));
368 let key = self.name_lookup_key(&canon_name);
369 self.sheet_named_ranges_lookup.remove(&(id, key));
370 removed
371 }
372 };
373
374 if let Some(named_range) = named_range {
375 let mut affected: FxHashSet<VertexId> = FxHashSet::default();
376 for &vertex_id in &named_range.dependents {
377 affected.insert(vertex_id);
378 }
379 for (vertex_id, names) in self.vertex_to_names.iter() {
380 if names.contains(&named_range.vertex) {
381 affected.insert(*vertex_id);
382 }
383 }
384 for vertex_id in affected {
385 self.mark_vertex_dirty(vertex_id);
386 if let Some(names) = self.vertex_to_names.get_mut(&vertex_id) {
387 names.retain(|vid| *vid != named_range.vertex);
388 if names.is_empty() {
389 self.vertex_to_names.remove(&vertex_id);
390 }
391 }
392 }
393 self.mark_named_vertex_deleted(&named_range);
394 Ok(())
395 } else {
396 Err(ExcelError::new(ExcelErrorKind::Name)
397 .with_message(format!("Name not found: {name}")))
398 }
399 }
400
401 pub(super) fn detach_vertex_from_names(&mut self, vertex: VertexId) {
402 if let Some(prior) = self.vertex_to_names.remove(&vertex) {
403 for name_vertex in prior {
404 if let Some((scope, name)) = self.name_vertex_lookup.get(&name_vertex).cloned() {
405 match scope {
406 NameScope::Workbook => {
407 if let Some(entry) = self.named_ranges.get_mut(&name) {
408 entry.dependents.remove(&vertex);
409 }
410 }
411 NameScope::Sheet(sheet_id) => {
412 if let Some(entry) =
413 self.sheet_named_ranges.get_mut(&(sheet_id, name.clone()))
414 {
415 entry.dependents.remove(&vertex);
416 }
417 }
418 }
419 }
420 }
421 }
422 }
423
424 pub(crate) fn attach_vertex_to_names(&mut self, vertex: VertexId, names: &[VertexId]) {
425 if names.is_empty() {
426 return;
427 }
428 let mut unique = FxHashSet::default();
429 let mut recorded = Vec::new();
430 for &name_vertex in names {
431 if !unique.insert(name_vertex) {
432 continue;
433 }
434 if let Some((scope, name)) = self.name_vertex_lookup.get(&name_vertex).cloned() {
435 match scope {
436 NameScope::Workbook => {
437 if let Some(entry) = self.named_ranges.get_mut(&name) {
438 entry.dependents.insert(vertex);
439 }
440 }
441 NameScope::Sheet(sheet_id) => {
442 if let Some(entry) =
443 self.sheet_named_ranges.get_mut(&(sheet_id, name.clone()))
444 {
445 entry.dependents.insert(vertex);
446 }
447 }
448 }
449 recorded.push(name_vertex);
450 }
451 }
452 if !recorded.is_empty() {
453 self.vertex_to_names.insert(vertex, recorded);
454 }
455 }
456
457 pub(super) fn unregister_name_cell_dependencies(&mut self, name_vertex: VertexId) {
458 if let Some(prev) = self.name_to_cell_dependencies.remove(&name_vertex) {
459 for dep in prev {
460 if let Some(set) = self.cell_to_name_dependents.get_mut(&dep) {
461 set.remove(&name_vertex);
462 if set.is_empty() {
463 self.cell_to_name_dependents.remove(&dep);
464 }
465 }
466 }
467 }
468 }
469
470 pub(super) fn register_name_cell_dependencies(
471 &mut self,
472 name_vertex: VertexId,
473 dependencies: &[VertexId],
474 ) {
475 self.unregister_name_cell_dependencies(name_vertex);
476 if dependencies.is_empty() {
477 return;
478 }
479 for dep in dependencies {
480 self.cell_to_name_dependents
481 .entry(*dep)
482 .or_default()
483 .insert(name_vertex);
484 }
485 self.name_to_cell_dependencies
486 .insert(name_vertex, dependencies.to_vec());
487 }
488
489 pub(crate) fn record_pending_name_reference(
490 &mut self,
491 sheet_id: SheetId,
492 name: &str,
493 formula_vertex: VertexId,
494 ) {
495 let key = self.name_lookup_key(name);
496 self.pending_name_links
497 .entry(key.clone())
498 .or_default()
499 .insert((sheet_id, formula_vertex));
500 self.vertex_to_pending_names
501 .entry(formula_vertex)
502 .or_default()
503 .insert(key);
504 }
505
506 pub(crate) fn clear_pending_name_references(&mut self, formula_vertex: VertexId) {
507 let Some(keys) = self.vertex_to_pending_names.remove(&formula_vertex) else {
508 return;
509 };
510
511 for key in keys {
512 let mut remove_key = false;
513 if let Some(entries) = self.pending_name_links.get_mut(&key) {
514 entries.retain(|(_, vertex_id)| *vertex_id != formula_vertex);
515 remove_key = entries.is_empty();
516 }
517 if remove_key {
518 self.pending_name_links.remove(&key);
519 }
520 }
521 }
522
523 pub(super) fn resolve_pending_name_references(&mut self, scope: NameScope, name: &str) {
524 let key = self.name_lookup_key(name);
525 if let Some(entries) = self.pending_name_links.remove(&key) {
526 for (sheet_id, formula_vertex) in entries {
527 let attach = match scope {
528 NameScope::Workbook => true,
529 NameScope::Sheet(expected) => expected == sheet_id,
530 };
531 if attach {
532 if let Some(ast) = self.get_formula(formula_vertex) {
533 self.rebuild_formula_dependencies(formula_vertex, &ast);
534 } else {
535 self.clear_pending_name_references(formula_vertex);
536 }
537 } else {
538 self.record_pending_name_reference(sheet_id, name, formula_vertex);
539 }
540 }
541 }
542 }
543
544 pub(super) fn name_depends_on_vertex(
545 &self,
546 name_vertex: VertexId,
547 target: VertexId,
548 visited: &mut FxHashSet<VertexId>,
549 ) -> bool {
550 if !visited.insert(name_vertex) {
551 return false;
552 }
553
554 for dependency in self.edges.out_edges(name_vertex).iter().copied() {
555 if dependency == target {
556 return true;
557 }
558
559 if matches!(
560 self.store.kind(dependency),
561 VertexKind::NamedScalar | VertexKind::NamedArray
562 ) && self.name_depends_on_vertex(dependency, target, visited)
563 {
564 return true;
565 }
566 }
567
568 false
569 }
570
571 pub(super) fn rebuild_name_dependencies(
572 &mut self,
573 vertex: VertexId,
574 definition: &NamedDefinition,
575 scope: NameScope,
576 ) -> Vec<VertexId> {
577 self.remove_dependent_edges(vertex);
578 self.unregister_name_cell_dependencies(vertex);
579
580 let mut dependencies: Vec<VertexId> = Vec::new();
581 let mut range_dependencies: Vec<SharedRangeRef<'static>> = Vec::new();
582 let mut placeholders = Vec::new();
583
584 match definition {
585 NamedDefinition::Cell(cell_ref) => {
586 let vertex_id = self.get_or_create_vertex(cell_ref, &mut placeholders);
587 dependencies.push(vertex_id);
588 }
589 NamedDefinition::Range(range_ref) => {
590 let height = range_ref
591 .end
592 .coord
593 .row()
594 .saturating_sub(range_ref.start.coord.row())
595 + 1;
596 let width = range_ref
597 .end
598 .coord
599 .col()
600 .saturating_sub(range_ref.start.coord.col())
601 + 1;
602 let size = (width * height) as usize;
603
604 if size <= self.config.range_expansion_limit {
605 for row in range_ref.start.coord.row()..=range_ref.end.coord.row() {
606 for col in range_ref.start.coord.col()..=range_ref.end.coord.col() {
607 let coord = Coord::new(row, col, true, true);
608 let addr = CellRef::new(range_ref.start.sheet_id, coord);
609 let vertex_id = self.get_or_create_vertex(&addr, &mut placeholders);
610 dependencies.push(vertex_id);
611 }
612 }
613 } else {
614 let sheet_loc = SharedSheetLocator::Id(range_ref.start.sheet_id);
615 let sr = formualizer_common::AxisBound::new(
616 range_ref.start.coord.row(),
617 range_ref.start.coord.row_abs(),
618 );
619 let sc = formualizer_common::AxisBound::new(
620 range_ref.start.coord.col(),
621 range_ref.start.coord.col_abs(),
622 );
623 let er = formualizer_common::AxisBound::new(
624 range_ref.end.coord.row(),
625 range_ref.end.coord.row_abs(),
626 );
627 let ec = formualizer_common::AxisBound::new(
628 range_ref.end.coord.col(),
629 range_ref.end.coord.col_abs(),
630 );
631 if let Ok(r) = SharedRangeRef::from_parts(
632 sheet_loc,
633 Some(sr),
634 Some(sc),
635 Some(er),
636 Some(ec),
637 ) {
638 range_dependencies.push(r.into_owned());
639 }
640 }
641 }
642 NamedDefinition::Literal(_) => {
643 }
645 NamedDefinition::Formula {
646 dependencies: formula_deps,
647 range_deps,
648 ..
649 } => {
650 dependencies.extend(formula_deps.iter().copied());
651 range_dependencies.extend(range_deps.iter().cloned());
652 }
653 }
654
655 if !dependencies.is_empty() {
656 self.add_dependent_edges(vertex, &dependencies);
657 }
658 self.register_name_cell_dependencies(vertex, &dependencies);
659
660 if !range_dependencies.is_empty() {
661 let sheet_id = match scope {
662 NameScope::Sheet(id) => id,
663 NameScope::Workbook => self.default_sheet_id,
664 };
665 self.add_range_dependent_edges(vertex, &range_dependencies, sheet_id);
666 }
667
668 dependencies
669 .iter()
670 .filter(|vid| {
671 matches!(
672 self.store.kind(**vid),
673 VertexKind::NamedScalar | VertexKind::NamedArray
674 )
675 })
676 .copied()
677 .collect()
678 }
679
680 pub fn adjust_named_ranges(
681 &mut self,
682 operation: &crate::engine::graph::editor::reference_adjuster::ShiftOperation,
683 ) -> Result<(), ExcelError> {
684 let adjuster = crate::engine::graph::editor::reference_adjuster::ReferenceAdjuster::new();
685
686 for named_range in self.named_ranges.values_mut() {
688 adjust_named_definition(&mut named_range.definition, &adjuster, operation)?;
689 }
690
691 for named_range in self.sheet_named_ranges.values_mut() {
693 adjust_named_definition(&mut named_range.definition, &adjuster, operation)?;
694 }
695
696 Ok(())
697 }
698
699 pub fn mark_as_name_error(&mut self, vertex_id: VertexId) {
701 self.mark_vertex_dirty(vertex_id);
703 }
704
705 pub(super) fn mark_named_vertex_deleted(&mut self, named_range: &NamedRange) {
706 self.detach_vertex_from_names(named_range.vertex);
707 self.remove_dependent_edges(named_range.vertex);
708 self.unregister_name_cell_dependencies(named_range.vertex);
709 self.store.mark_deleted(named_range.vertex, true);
710 self.vertex_values.remove(&named_range.vertex);
711 self.vertex_formulas.remove(&named_range.vertex);
712 self.dirty_vertices.remove(&named_range.vertex);
713 self.volatile_vertices.remove(&named_range.vertex);
714 self.vertex_to_names.remove(&named_range.vertex);
715 self.name_vertex_lookup.remove(&named_range.vertex);
716 }
717}