/// <summary>
/// Adds the intersection of this tree with the given <paramref name="path"/> to <paramref name="output"/>.
/// </summary>
public void IntersectFieldPath(string path, FieldMaskTree output)
{
if (root.Children.Count == 0)
{
return;
}
var parts = path.Split(FIELD_PATH_SEPARATOR);
if (parts.Length == 0)
{
return;
}
var node = root;
foreach (var part in parts)
{
if (node != root &&
node.Children.Count == 0)
{
// The given path is a sub-path of an existing leaf node in the tree.
output.AddFieldPath(path);
return;
}
if (!node.Children.TryGetValue(part, out node))
{
return;
}
}
// We found a matching node for the path. All leaf children of this matching
// node is in the intersection.
var paths = new List <string>();
GetFieldPaths(node, path, paths);
foreach (var value in paths)
{
output.AddFieldPath(value);
}
}
public void AddFieldPath()
{
FieldMaskTree tree = new FieldMaskTree();
RepeatedField <string> paths = tree.ToFieldMask().Paths;
Assert.AreEqual(0, paths.Count);
tree.AddFieldPath("");
paths = tree.ToFieldMask().Paths;
Assert.AreEqual(1, paths.Count);
Assert.Contains("", paths);
// New branch.
tree.AddFieldPath("foo");
paths = tree.ToFieldMask().Paths;
Assert.AreEqual(2, paths.Count);
Assert.Contains("foo", paths);
// Redundant path.
tree.AddFieldPath("foo");
paths = tree.ToFieldMask().Paths;
Assert.AreEqual(2, paths.Count);
// New branch.
tree.AddFieldPath("bar.baz");
paths = tree.ToFieldMask().Paths;
Assert.AreEqual(3, paths.Count);
Assert.Contains("bar.baz", paths);
// Redundant sub-path.
tree.AddFieldPath("foo.bar");
paths = tree.ToFieldMask().Paths;
Assert.AreEqual(3, paths.Count);
// New branch from a non-root node.
tree.AddFieldPath("bar.quz");
paths = tree.ToFieldMask().Paths;
Assert.AreEqual(4, paths.Count);
Assert.Contains("bar.quz", paths);
// A path that matches several existing sub-paths.
tree.AddFieldPath("bar");
paths = tree.ToFieldMask().Paths;
Assert.AreEqual(3, paths.Count);
Assert.Contains("foo", paths);
Assert.Contains("bar", paths);
}