mirror of
https://github.com/SHOGGOTH-SECTOR/sica-fondt.git
synced 2026-08-01 08:30:20 +00:00
24f816b6a3
Place useful parts of the surrounding repos into sica-fondt by layer, per the
body model (Ada = membrane; brain/endocrine/capabilities/knowledge non-Ada):
- brain/ LLM reasoning + providers (dapr, hermes, MoMoA)
- capabilities/ REPRAG sidecars: hermes tools/skills, dapr tools, parallel
dispatch, A51 channels, and the OSINT cluster
- knowledge/ LORAG corpus: 754 cyber-skills, agency personas, secure-coding,
MITRE ATT&CK data
- reference/ defensive threat-reference (C3, shhbruh doc) + AdaYaml parser
License handling: AGPL sources (worldosint, advanced_evolution, mercury,
Reticulum) and GPL DeTTECT are SPEC-only clean-room/port descriptions — no
copyleft code copied. MIT/Apache/data parts copied as working trees.
Safety: shhbruh escape/persistence material and C3 covert-C2 kept as reference
only, not wired into the running organism. See CONSOLIDATION.md.
https://claude.ai/code/session_01UehUqEXXJJCsHoA4voCU5c
62 lines
2.1 KiB
Ada
62 lines
2.1 KiB
Ada
-- part of AdaYaml, (c) 2017 Felix Krause
|
|
-- released under the terms of the MIT license, see the file "copying.txt"
|
|
|
|
private with Ada.Containers.Indefinite_Hashed_Sets;
|
|
private with System.Storage_Elements;
|
|
with Yaml.Dom.Node;
|
|
|
|
private package Yaml.Dom.Node_Memory is
|
|
type Instance is tagged limited private;
|
|
|
|
procedure Visit (Object : in out Instance;
|
|
Value : not null access Node.Instance;
|
|
Previously_Visited : out Boolean);
|
|
|
|
procedure Forget (Object : in out Instance;
|
|
Value : not null access Node.Instance);
|
|
|
|
function Pop_First (Object : in out Instance)
|
|
return not null access Node.Instance;
|
|
|
|
function Is_Empty (Object : Instance) return Boolean;
|
|
|
|
type Pair_Instance is tagged limited private;
|
|
|
|
procedure Visit (Object : in out Pair_Instance;
|
|
Left, Right : not null access Node.Instance;
|
|
Previously_Visited : out Boolean);
|
|
private
|
|
function Hash (Value : Node_Pointer) return Ada.Containers.Hash_Type is
|
|
(Ada.Containers.Hash_Type'Mod (System.Storage_Elements.To_Integer (Value.all'Address)));
|
|
|
|
package Pointer_Sets is new Ada.Containers.Indefinite_Hashed_Sets
|
|
(Node_Pointer, Hash, Dom."=");
|
|
|
|
type Instance is tagged limited record
|
|
Data : Pointer_Sets.Set;
|
|
end record;
|
|
|
|
type Pointer_Pair is record
|
|
Left, Right : not null access Node.Instance;
|
|
end record;
|
|
|
|
use type Ada.Containers.Hash_Type;
|
|
|
|
function Hash (Value : Pointer_Pair) return Ada.Containers.Hash_Type is
|
|
(Hash (Value.Left) xor Hash (Value.Right));
|
|
|
|
function Equal_Nodes (Left, Right : Node_Pointer) return Boolean is
|
|
(Left = Right or else Node."=" (Left.all, Right.all));
|
|
|
|
function "=" (Left, Right : Pointer_Pair) return Boolean is
|
|
(Equal_Nodes (Left.Left, Right.Left) and then
|
|
Equal_Nodes (Left.Right, Right.Right));
|
|
|
|
package Pair_Sets is new Ada.Containers.Indefinite_Hashed_Sets
|
|
(Pointer_Pair, Hash, Node_Memory."=", Node_Memory."=");
|
|
|
|
type Pair_Instance is tagged limited record
|
|
Data : Pair_Sets.Set;
|
|
end record;
|
|
end Yaml.Dom.Node_Memory;
|