|
| 1 | +module OpenDiffix.Core.AdaptiveBuckets.ForestTests |
| 2 | + |
| 3 | +open Xunit |
| 4 | +open FsUnit.Xunit |
| 5 | + |
| 6 | +open OpenDiffix.Core |
| 7 | +open OpenDiffix.Core.AdaptiveBuckets.Range |
| 8 | +open OpenDiffix.Core.AdaptiveBuckets.Forest |
| 9 | + |
| 10 | +[<Fact>] |
| 11 | +let ``Root ranges are anonymized`` () = |
| 12 | + let root, _ = |
| 13 | + [ |
| 14 | + [| List [ Integer 1 ]; Integer 0; Integer 1 |] |
| 15 | + [| List [ Integer 2 ]; Integer 0; Integer 5 |] |
| 16 | + [| List [ Integer 3 ]; Integer 0; Integer 2 |] |
| 17 | + [| List [ Integer 4 ]; Integer 0; Integer 7 |] |
| 18 | + [| List [ Integer 5 ]; Integer 0; Integer 21 |] |
| 19 | + [| List [ Integer 6 ]; Integer 0; Integer 4 |] |
| 20 | + [| List [ Integer 7 ]; Integer 0; Integer 21 |] |
| 21 | + [| List [ Integer 8 ]; Integer 0; Integer 28 |] |
| 22 | + [| List [ Integer 9 ]; Integer 0; Integer 19 |] |
| 23 | + [| List [ Integer 10 ]; Integer 0; Integer 2 |] |
| 24 | + [| List [ Integer 11 ]; Integer 1; Integer 1 |] |
| 25 | + [| List [ Integer 12 ]; Integer 1; Integer 13 |] |
| 26 | + [| List [ Integer 13 ]; Integer 1; Integer 25 |] |
| 27 | + [| List [ Integer 14 ]; Integer 1; Integer 30 |] |
| 28 | + [| List [ Integer 15 ]; Integer 1; Integer 6 |] |
| 29 | + [| List [ Integer 16 ]; Integer 1; Integer 2 |] |
| 30 | + [| List [ Integer 17 ]; Integer 1; Integer 15 |] |
| 31 | + [| List [ Integer 18 ]; Integer 1; Integer 24 |] |
| 32 | + [| List [ Integer 19 ]; Integer 1; Integer 9 |] |
| 33 | + [| List [ Integer 20 ]; Integer 0; Integer 100 |] |
| 34 | + [| List [ Integer 21 ]; Integer -5; Integer 0 |] |
| 35 | + ] |
| 36 | + |> buildForest defaultAnonContext 2 |
| 37 | + |
| 38 | + (Tree.nodeData root).SnappedRanges |
| 39 | + |> should equal [| { Min = 0.0; Max = 2.0 }; { Min = 0.0; Max = 32.0 } |] |
| 40 | + |
| 41 | +[<Fact>] |
| 42 | +let ``Multiple rows per AID`` () = |
| 43 | + let rows = |
| 44 | + [ |
| 45 | + [| List [ Integer 1 ]; Integer 1 |] |
| 46 | + [| List [ Integer 2 ]; Integer 1 |] |
| 47 | + [| List [ Integer 3 ]; Integer 1 |] |
| 48 | + [| List [ Integer 4 ]; Integer 1 |] |
| 49 | + [| List [ Integer 5 ]; Integer 1 |] |
| 50 | + [| List [ Integer 6 ]; Integer 1 |] |
| 51 | + [| List [ Integer 7 ]; Integer 1 |] |
| 52 | + [| List [ Integer 8 ]; Integer 1 |] |
| 53 | + [| List [ Integer 9 ]; Integer 1 |] |
| 54 | + [| List [ Integer 10 ]; Integer 0 |] |
| 55 | + [| List [ Integer 11 ]; Integer 0 |] |
| 56 | + [| List [ Integer 12 ]; Integer 0 |] |
| 57 | + [| List [ Integer 13 ]; Integer 0 |] |
| 58 | + [| List [ Integer 14 ]; Integer 0 |] |
| 59 | + [| List [ Integer 15 ]; Integer 0 |] |
| 60 | + [| List [ Integer 16 ]; Integer 0 |] |
| 61 | + [| List [ Integer 17 ]; Integer 0 |] |
| 62 | + ] |
| 63 | + |
| 64 | + let root, _ = rows |> buildForest defaultAnonContext 1 |
| 65 | + |
| 66 | + // Sanity check, there's enough AIDs to branch at least once. |
| 67 | + match root with |
| 68 | + | Tree.Branch _ -> () |
| 69 | + | _ -> failwith "Expected a branch root" |
| 70 | + |
| 71 | + let rowsAid = |
| 72 | + rows |
| 73 | + |> List.map (fun row -> row |> Array.tail |> Array.insertAt 0 (List [ Integer 1L ])) |
| 74 | + |
| 75 | + let rootAid, _ = rowsAid |> buildForest defaultAnonContext 1 |
| 76 | + |
| 77 | + match rootAid with |
| 78 | + | Tree.Leaf l -> |
| 79 | + let aidContributions = l.Data.Contributions.[0].AidContributions.Values |> Seq.toList |
| 80 | + |
| 81 | + // There's a single AID contributing all rows. |
| 82 | + aidContributions.Length |> should equal 1 |
| 83 | + aidContributions.Head |> should equal (float rows.Length) |
| 84 | + | _ -> failwith "Expected a leaf root" |
| 85 | + |
| 86 | +[<Fact>] |
| 87 | +let ``Outliers are not dropped from 1-dim trees`` () = |
| 88 | + let root, _ = |
| 89 | + [ |
| 90 | + [| List [ Integer 1 ]; Integer 1 |] |
| 91 | + [| List [ Integer 2 ]; Integer 5 |] |
| 92 | + [| List [ Integer 3 ]; Integer 2 |] |
| 93 | + [| List [ Integer 4 ]; Integer 7 |] |
| 94 | + [| List [ Integer 5 ]; Integer 21 |] |
| 95 | + [| List [ Integer 6 ]; Integer 4 |] |
| 96 | + [| List [ Integer 7 ]; Integer 21 |] |
| 97 | + [| List [ Integer 8 ]; Integer 28 |] |
| 98 | + [| List [ Integer 9 ]; Integer 19 |] |
| 99 | + [| List [ Integer 10 ]; Integer 2 |] |
| 100 | + [| List [ Integer 11 ]; Integer 1 |] |
| 101 | + [| List [ Integer 12 ]; Integer 13 |] |
| 102 | + [| List [ Integer 13 ]; Integer 25 |] |
| 103 | + [| List [ Integer 14 ]; Integer 30 |] |
| 104 | + [| List [ Integer 15 ]; Integer 6 |] |
| 105 | + [| List [ Integer 16 ]; Integer 2 |] |
| 106 | + [| List [ Integer 17 ]; Integer 15 |] |
| 107 | + [| List [ Integer 18 ]; Integer 24 |] |
| 108 | + [| List [ Integer 19 ]; Integer 9 |] |
| 109 | + [| List [ Integer 20 ]; Integer 100 |] |
| 110 | + [| List [ Integer 21 ]; Integer 0 |] |
| 111 | + ] |
| 112 | + |> buildForest noiselessAnonContext 1 |
| 113 | + |
| 114 | + root |> Tree.nodeData |> Tree.noisyRowCount |> should equal 21L |
0 commit comments