| | | 1 | | using Blazored.LocalStorage; |
| | | 2 | | using Chronicis.Client.Models; |
| | | 3 | | |
| | | 4 | | namespace Chronicis.Client.Services.Tree; |
| | | 5 | | |
| | | 6 | | /// <summary> |
| | | 7 | | /// Manages UI-related state for the tree: expansion, selection, search filtering, and persistence. |
| | | 8 | | /// This component does not perform any API calls - it operates purely on the in-memory node index. |
| | | 9 | | /// </summary> |
| | | 10 | | internal sealed class TreeUiState |
| | | 11 | | { |
| | | 12 | | private readonly ILocalStorageService _localStorage; |
| | | 13 | | private readonly ILogger _logger; |
| | | 14 | | |
| | | 15 | | private const string ExpandedNodesStorageKey = "chronicis_expanded_nodes"; |
| | | 16 | | |
| | | 17 | | // Shared node index (owned by TreeStateService, passed in) |
| | 25 | 18 | | private TreeNodeIndex _nodeIndex = new(); |
| | | 19 | | |
| | | 20 | | // UI State |
| | 25 | 21 | | private readonly HashSet<Guid> _expandedNodeIds = new(); |
| | | 22 | | private Guid? _selectedNodeId; |
| | | 23 | | private Guid? _pendingSelectionId; |
| | 25 | 24 | | private string _searchQuery = string.Empty; |
| | | 25 | | |
| | 25 | 26 | | public TreeUiState(ILocalStorageService localStorage, ILogger logger) |
| | | 27 | | { |
| | 25 | 28 | | _localStorage = localStorage; |
| | 25 | 29 | | _logger = logger; |
| | 25 | 30 | | } |
| | | 31 | | |
| | | 32 | | // ============================================ |
| | | 33 | | // State Properties |
| | | 34 | | // ============================================ |
| | | 35 | | |
| | | 36 | | /// <summary> |
| | | 37 | | /// Gets the currently selected node ID. |
| | | 38 | | /// </summary> |
| | 6 | 39 | | public Guid? SelectedNodeId => _selectedNodeId; |
| | | 40 | | |
| | | 41 | | /// <summary> |
| | | 42 | | /// Gets the current search query. |
| | | 43 | | /// </summary> |
| | 2 | 44 | | public string SearchQuery => _searchQuery; |
| | | 45 | | |
| | | 46 | | /// <summary> |
| | | 47 | | /// Gets whether a search filter is currently active. |
| | | 48 | | /// </summary> |
| | 11 | 49 | | public bool IsSearchActive => !string.IsNullOrWhiteSpace(_searchQuery); |
| | | 50 | | |
| | | 51 | | /// <summary> |
| | | 52 | | /// Gets the pending selection ID (for selection before tree is initialized). |
| | | 53 | | /// </summary> |
| | 2 | 54 | | public Guid? PendingSelectionId => _pendingSelectionId; |
| | | 55 | | |
| | | 56 | | /// <summary> |
| | | 57 | | /// Gets the set of expanded node IDs. |
| | | 58 | | /// </summary> |
| | 7 | 59 | | public IReadOnlySet<Guid> ExpandedNodeIds => _expandedNodeIds; |
| | | 60 | | |
| | | 61 | | // ============================================ |
| | | 62 | | // Initialization |
| | | 63 | | // ============================================ |
| | | 64 | | |
| | | 65 | | /// <summary> |
| | | 66 | | /// Sets the node index reference. Called after tree is built. |
| | | 67 | | /// </summary> |
| | | 68 | | public void SetNodeIndex(TreeNodeIndex nodeIndex) |
| | | 69 | | { |
| | 22 | 70 | | _nodeIndex = nodeIndex; |
| | 22 | 71 | | } |
| | | 72 | | |
| | | 73 | | /// <summary> |
| | | 74 | | /// Resets UI state (called before tree rebuild). |
| | | 75 | | /// </summary> |
| | | 76 | | public void Reset() |
| | | 77 | | { |
| | 1 | 78 | | _expandedNodeIds.Clear(); |
| | 1 | 79 | | _selectedNodeId = null; |
| | 1 | 80 | | _searchQuery = string.Empty; |
| | 1 | 81 | | } |
| | | 82 | | |
| | | 83 | | /// <summary> |
| | | 84 | | /// Clears the pending selection. |
| | | 85 | | /// </summary> |
| | | 86 | | public void ClearPendingSelection() |
| | | 87 | | { |
| | 0 | 88 | | _pendingSelectionId = null; |
| | 0 | 89 | | } |
| | | 90 | | |
| | | 91 | | /// <summary> |
| | | 92 | | /// Checks if there's a pending selection and returns it, clearing the pending state. |
| | | 93 | | /// </summary> |
| | | 94 | | public Guid? ConsumePendingSelection() |
| | | 95 | | { |
| | 1 | 96 | | var pending = _pendingSelectionId; |
| | 1 | 97 | | _pendingSelectionId = null; |
| | 1 | 98 | | return pending; |
| | | 99 | | } |
| | | 100 | | |
| | | 101 | | // ============================================ |
| | | 102 | | // Node Operations |
| | | 103 | | // ============================================ |
| | | 104 | | |
| | | 105 | | /// <summary> |
| | | 106 | | /// Expands a node to show its children. |
| | | 107 | | /// </summary> |
| | | 108 | | /// <returns>True if the node was found and expanded.</returns> |
| | | 109 | | public bool ExpandNode(Guid nodeId) |
| | | 110 | | { |
| | 10 | 111 | | if (_nodeIndex.TryGetNode(nodeId, out var node) && node != null) |
| | | 112 | | { |
| | 9 | 113 | | node.IsExpanded = true; |
| | 9 | 114 | | _expandedNodeIds.Add(nodeId); |
| | 9 | 115 | | _ = SaveExpandedStateAsync(); |
| | 9 | 116 | | return true; |
| | | 117 | | } |
| | 1 | 118 | | return false; |
| | | 119 | | } |
| | | 120 | | |
| | | 121 | | /// <summary> |
| | | 122 | | /// Collapses a node to hide its children. |
| | | 123 | | /// </summary> |
| | | 124 | | /// <returns>True if the node was found and collapsed.</returns> |
| | | 125 | | public bool CollapseNode(Guid nodeId) |
| | | 126 | | { |
| | 3 | 127 | | if (_nodeIndex.TryGetNode(nodeId, out var node) && node != null) |
| | | 128 | | { |
| | 3 | 129 | | node.IsExpanded = false; |
| | 3 | 130 | | _expandedNodeIds.Remove(nodeId); |
| | 3 | 131 | | _ = SaveExpandedStateAsync(); |
| | 3 | 132 | | return true; |
| | | 133 | | } |
| | 0 | 134 | | return false; |
| | | 135 | | } |
| | | 136 | | |
| | | 137 | | /// <summary> |
| | | 138 | | /// Toggles a node's expanded state. |
| | | 139 | | /// </summary> |
| | | 140 | | /// <returns>True if the node was found and toggled.</returns> |
| | | 141 | | public bool ToggleNode(Guid nodeId) |
| | | 142 | | { |
| | 4 | 143 | | if (_nodeIndex.TryGetNode(nodeId, out var node) && node != null) |
| | | 144 | | { |
| | 4 | 145 | | if (node.IsExpanded) |
| | 1 | 146 | | return CollapseNode(nodeId); |
| | | 147 | | else |
| | 3 | 148 | | return ExpandNode(nodeId); |
| | | 149 | | } |
| | 0 | 150 | | return false; |
| | | 151 | | } |
| | | 152 | | |
| | | 153 | | /// <summary> |
| | | 154 | | /// Selects a node. For virtual groups, toggles expansion instead. |
| | | 155 | | /// </summary> |
| | | 156 | | /// <returns>True if selection changed or node was toggled.</returns> |
| | | 157 | | public bool SelectNode(Guid nodeId) |
| | | 158 | | { |
| | | 159 | | // Deselect previous |
| | 10 | 160 | | if (_selectedNodeId.HasValue && _nodeIndex.TryGetNode(_selectedNodeId.Value, out var previousNode) && previousNo |
| | | 161 | | { |
| | 2 | 162 | | previousNode.IsSelected = false; |
| | | 163 | | } |
| | | 164 | | |
| | 10 | 165 | | if (_nodeIndex.TryGetNode(nodeId, out var node) && node != null) |
| | | 166 | | { |
| | | 167 | | // Selectable node types: Article, World, Campaign, Arc |
| | 9 | 168 | | if (node.NodeType == TreeNodeType.Article || |
| | 9 | 169 | | node.NodeType == TreeNodeType.World || |
| | 9 | 170 | | node.NodeType == TreeNodeType.Campaign || |
| | 9 | 171 | | node.NodeType == TreeNodeType.Arc) |
| | | 172 | | { |
| | 8 | 173 | | node.IsSelected = true; |
| | 8 | 174 | | _selectedNodeId = nodeId; |
| | | 175 | | |
| | | 176 | | // Auto-expand if node has children |
| | 8 | 177 | | if (node.HasChildren && !node.IsExpanded) |
| | | 178 | | { |
| | 1 | 179 | | node.IsExpanded = true; |
| | 1 | 180 | | _expandedNodeIds.Add(nodeId); |
| | 1 | 181 | | _ = SaveExpandedStateAsync(); |
| | | 182 | | } |
| | 8 | 183 | | return true; |
| | | 184 | | } |
| | | 185 | | else |
| | | 186 | | { |
| | | 187 | | // For virtual groups, just toggle expand |
| | 1 | 188 | | ToggleNode(nodeId); |
| | 1 | 189 | | _selectedNodeId = null; |
| | 1 | 190 | | return true; |
| | | 191 | | } |
| | | 192 | | } |
| | | 193 | | else |
| | | 194 | | { |
| | 1 | 195 | | _selectedNodeId = null; |
| | 1 | 196 | | return false; |
| | | 197 | | } |
| | | 198 | | } |
| | | 199 | | |
| | | 200 | | /// <summary> |
| | | 201 | | /// Expands the path to a node, collapses nodes not in the path, and selects the target. |
| | | 202 | | /// If tree is not initialized, stores as pending selection. |
| | | 203 | | /// </summary> |
| | | 204 | | /// <param name="nodeId">The node to navigate to.</param> |
| | | 205 | | /// <param name="isInitialized">Whether the tree is initialized.</param> |
| | | 206 | | /// <returns>True if the operation was performed, false if deferred as pending.</returns> |
| | | 207 | | public bool ExpandPathToAndSelect(Guid nodeId, bool isInitialized) |
| | | 208 | | { |
| | 4 | 209 | | if (!isInitialized) |
| | | 210 | | { |
| | 2 | 211 | | _pendingSelectionId = nodeId; |
| | 2 | 212 | | _selectedNodeId = nodeId; |
| | 2 | 213 | | return false; |
| | | 214 | | } |
| | | 215 | | |
| | 2 | 216 | | if (!_nodeIndex.TryGetNode(nodeId, out var targetNode) || targetNode == null) |
| | | 217 | | { |
| | 0 | 218 | | _logger.LogWarning("ExpandPathToAndSelect: Node {NodeId} not found", nodeId); |
| | 0 | 219 | | return false; |
| | | 220 | | } |
| | | 221 | | |
| | | 222 | | // Build path from root to target |
| | 2 | 223 | | var path = BuildPathToNode(targetNode); |
| | 6 | 224 | | var pathNodeIds = new HashSet<Guid>(path.Select(n => n.Id)); |
| | | 225 | | |
| | | 226 | | // Collapse all nodes that are NOT in the path to the target |
| | 14 | 227 | | foreach (var node in _nodeIndex.AllNodes) |
| | | 228 | | { |
| | 5 | 229 | | if (node.IsExpanded && !pathNodeIds.Contains(node.Id)) |
| | | 230 | | { |
| | 1 | 231 | | node.IsExpanded = false; |
| | 1 | 232 | | _expandedNodeIds.Remove(node.Id); |
| | | 233 | | } |
| | | 234 | | } |
| | | 235 | | |
| | | 236 | | // Expand all ancestors in the path (except the target itself) |
| | 8 | 237 | | for (int i = 0; i < path.Count - 1; i++) |
| | | 238 | | { |
| | 2 | 239 | | var node = path[i]; |
| | 2 | 240 | | node.IsExpanded = true; |
| | 2 | 241 | | _expandedNodeIds.Add(node.Id); |
| | | 242 | | } |
| | | 243 | | |
| | | 244 | | // Select the target |
| | 2 | 245 | | SelectNode(nodeId); |
| | | 246 | | |
| | 2 | 247 | | _ = SaveExpandedStateAsync(); |
| | 2 | 248 | | return true; |
| | | 249 | | } |
| | | 250 | | |
| | | 251 | | /// <summary> |
| | | 252 | | /// Builds the path from root to the given node. |
| | | 253 | | /// </summary> |
| | | 254 | | private List<TreeNode> BuildPathToNode(TreeNode targetNode) |
| | | 255 | | { |
| | 2 | 256 | | var path = new List<TreeNode>(); |
| | 2 | 257 | | var current = targetNode; |
| | | 258 | | |
| | 6 | 259 | | while (current != null) |
| | | 260 | | { |
| | 4 | 261 | | path.Insert(0, current); |
| | | 262 | | |
| | 4 | 263 | | if (current.ParentId.HasValue && _nodeIndex.TryGetNode(current.ParentId.Value, out var parent) && parent != |
| | | 264 | | { |
| | 2 | 265 | | current = parent; |
| | | 266 | | } |
| | | 267 | | else |
| | | 268 | | { |
| | | 269 | | // Check if this node is a child of a world/group node |
| | 2 | 270 | | current = _nodeIndex.FindParentNode(current); |
| | | 271 | | } |
| | | 272 | | } |
| | | 273 | | |
| | 2 | 274 | | return path; |
| | | 275 | | } |
| | | 276 | | |
| | | 277 | | /// <summary> |
| | | 278 | | /// Clears the current selection. |
| | | 279 | | /// </summary> |
| | | 280 | | public void ClearSelection() |
| | | 281 | | { |
| | 1 | 282 | | if (_selectedNodeId.HasValue && _nodeIndex.TryGetNode(_selectedNodeId.Value, out var node) && node != null) |
| | | 283 | | { |
| | 1 | 284 | | node.IsSelected = false; |
| | | 285 | | } |
| | 1 | 286 | | _selectedNodeId = null; |
| | 1 | 287 | | } |
| | | 288 | | |
| | | 289 | | // ============================================ |
| | | 290 | | // Search/Filter |
| | | 291 | | // ============================================ |
| | | 292 | | |
| | | 293 | | /// <summary> |
| | | 294 | | /// Sets the search query and filters the tree. |
| | | 295 | | /// </summary> |
| | | 296 | | public void SetSearchQuery(string query) |
| | | 297 | | { |
| | 7 | 298 | | _searchQuery = query?.Trim() ?? string.Empty; |
| | 7 | 299 | | ApplySearchFilter(); |
| | 7 | 300 | | } |
| | | 301 | | |
| | | 302 | | /// <summary> |
| | | 303 | | /// Clears the search filter and makes all nodes visible. |
| | | 304 | | /// </summary> |
| | | 305 | | public void ClearSearch() |
| | | 306 | | { |
| | 2 | 307 | | _searchQuery = string.Empty; |
| | | 308 | | |
| | 10 | 309 | | foreach (var node in _nodeIndex.AllNodes) |
| | | 310 | | { |
| | 3 | 311 | | node.IsVisible = true; |
| | | 312 | | } |
| | 2 | 313 | | } |
| | | 314 | | |
| | | 315 | | /// <summary> |
| | | 316 | | /// Applies the current search filter to the tree. |
| | | 317 | | /// </summary> |
| | | 318 | | public void ApplySearchFilter() |
| | | 319 | | { |
| | 7 | 320 | | if (!IsSearchActive) |
| | | 321 | | { |
| | 1 | 322 | | ClearSearch(); |
| | 1 | 323 | | return; |
| | | 324 | | } |
| | | 325 | | |
| | 6 | 326 | | var searchLower = _searchQuery.ToLowerInvariant(); |
| | 6 | 327 | | var matchingNodeIds = new HashSet<Guid>(); |
| | | 328 | | |
| | | 329 | | // Find all matching nodes (articles only for search) |
| | 30 | 330 | | foreach (var node in _nodeIndex.AllNodes) |
| | | 331 | | { |
| | 9 | 332 | | if (node.NodeType == TreeNodeType.Article && |
| | 9 | 333 | | node.Title.Contains(searchLower, StringComparison.OrdinalIgnoreCase)) |
| | | 334 | | { |
| | 6 | 335 | | AddNodeAndAncestors(node, matchingNodeIds); |
| | | 336 | | } |
| | | 337 | | } |
| | | 338 | | |
| | | 339 | | // Set visibility |
| | 30 | 340 | | foreach (var node in _nodeIndex.AllNodes) |
| | | 341 | | { |
| | 9 | 342 | | node.IsVisible = matchingNodeIds.Contains(node.Id); |
| | | 343 | | } |
| | | 344 | | |
| | | 345 | | // Expand nodes that have visible children |
| | 26 | 346 | | foreach (var nodeId in matchingNodeIds) |
| | | 347 | | { |
| | 7 | 348 | | if (_nodeIndex.TryGetNode(nodeId, out var node) && node != null) |
| | | 349 | | { |
| | 8 | 350 | | if (node.Children.Any(c => c.IsVisible)) |
| | | 351 | | { |
| | 1 | 352 | | node.IsExpanded = true; |
| | 1 | 353 | | _expandedNodeIds.Add(nodeId); |
| | | 354 | | } |
| | | 355 | | } |
| | | 356 | | } |
| | 6 | 357 | | } |
| | | 358 | | |
| | | 359 | | /// <summary> |
| | | 360 | | /// Recursively adds a node and all its ancestors to the set. |
| | | 361 | | /// </summary> |
| | | 362 | | private void AddNodeAndAncestors(TreeNode node, HashSet<Guid> set) |
| | | 363 | | { |
| | 7 | 364 | | set.Add(node.Id); |
| | | 365 | | |
| | | 366 | | // Add direct parent |
| | 7 | 367 | | if (node.ParentId.HasValue && _nodeIndex.TryGetNode(node.ParentId.Value, out var parent) && parent != null) |
| | | 368 | | { |
| | 1 | 369 | | AddNodeAndAncestors(parent, set); |
| | | 370 | | } |
| | | 371 | | |
| | | 372 | | // Also find the containing node (for virtual groups, etc.) |
| | 7 | 373 | | var container = _nodeIndex.FindParentNode(node); |
| | 7 | 374 | | if (container != null && !set.Contains(container.Id)) |
| | | 375 | | { |
| | 0 | 376 | | AddNodeAndAncestors(container, set); |
| | | 377 | | } |
| | 7 | 378 | | } |
| | | 379 | | |
| | | 380 | | // ============================================ |
| | | 381 | | // Persistence |
| | | 382 | | // ============================================ |
| | | 383 | | |
| | | 384 | | /// <summary> |
| | | 385 | | /// Gets the IDs of all currently expanded nodes. |
| | | 386 | | /// </summary> |
| | 0 | 387 | | public IReadOnlySet<Guid> GetExpandedNodeIds() => _expandedNodeIds; |
| | | 388 | | |
| | | 389 | | /// <summary> |
| | | 390 | | /// Restores expanded state from a set of node IDs. |
| | | 391 | | /// </summary> |
| | | 392 | | public void RestoreExpandedNodes(IEnumerable<Guid> nodeIds) |
| | | 393 | | { |
| | 2 | 394 | | _expandedNodeIds.Clear(); |
| | | 395 | | |
| | 10 | 396 | | foreach (var nodeId in nodeIds) |
| | | 397 | | { |
| | 3 | 398 | | if (_nodeIndex.TryGetNode(nodeId, out var node) && node != null) |
| | | 399 | | { |
| | 2 | 400 | | node.IsExpanded = true; |
| | 2 | 401 | | _expandedNodeIds.Add(nodeId); |
| | | 402 | | } |
| | | 403 | | } |
| | 2 | 404 | | } |
| | | 405 | | |
| | | 406 | | /// <summary> |
| | | 407 | | /// Restores expanded state from a previously saved set, preserving additional expanded nodes. |
| | | 408 | | /// Used during refresh to maintain state. |
| | | 409 | | /// </summary> |
| | | 410 | | public void RestoreExpandedNodesPreserving(IEnumerable<Guid> nodeIds) |
| | | 411 | | { |
| | 0 | 412 | | foreach (var nodeId in nodeIds) |
| | | 413 | | { |
| | 0 | 414 | | if (_nodeIndex.TryGetNode(nodeId, out var node) && node != null) |
| | | 415 | | { |
| | 0 | 416 | | node.IsExpanded = true; |
| | 0 | 417 | | _expandedNodeIds.Add(nodeId); |
| | | 418 | | } |
| | | 419 | | } |
| | 0 | 420 | | } |
| | | 421 | | |
| | | 422 | | /// <summary> |
| | | 423 | | /// Saves the current expanded state to localStorage. |
| | | 424 | | /// </summary> |
| | | 425 | | public async Task SaveExpandedStateAsync() |
| | | 426 | | { |
| | | 427 | | try |
| | | 428 | | { |
| | 15 | 429 | | await _localStorage.SetItemAsync(ExpandedNodesStorageKey, _expandedNodeIds.ToList()); |
| | 15 | 430 | | } |
| | 0 | 431 | | catch (Exception ex) |
| | | 432 | | { |
| | 0 | 433 | | _logger.LogWarning(ex, "Failed to save expanded state"); |
| | 0 | 434 | | } |
| | 15 | 435 | | } |
| | | 436 | | |
| | | 437 | | /// <summary> |
| | | 438 | | /// Restores expanded state from localStorage. |
| | | 439 | | /// </summary> |
| | | 440 | | public async Task RestoreExpandedStateFromStorageAsync() |
| | | 441 | | { |
| | | 442 | | try |
| | | 443 | | { |
| | 2 | 444 | | var savedIds = await _localStorage.GetItemAsync<List<Guid>>(ExpandedNodesStorageKey); |
| | | 445 | | |
| | 2 | 446 | | if (savedIds != null) |
| | | 447 | | { |
| | 1 | 448 | | RestoreExpandedNodes(savedIds); |
| | | 449 | | } |
| | 2 | 450 | | } |
| | 0 | 451 | | catch (Exception ex) |
| | | 452 | | { |
| | 0 | 453 | | _logger.LogWarning(ex, "Failed to restore expanded state"); |
| | 0 | 454 | | } |
| | 2 | 455 | | } |
| | | 456 | | |
| | | 457 | | /// <summary> |
| | | 458 | | /// Gets the localStorage key used for expanded nodes persistence. |
| | | 459 | | /// Exposed for testing purposes. |
| | | 460 | | /// </summary> |
| | 1 | 461 | | public static string GetExpandedNodesStorageKey() => ExpandedNodesStorageKey; |
| | | 462 | | } |