@cratis/chronicle.contracts 19.128.1 → 19.130.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/cjs/generated/descriptorSet.js +1 -1
- package/dist/cjs/generated/descriptorSet.js.map +1 -1
- package/dist/cjs/generated/index.d.ts +2 -2
- package/dist/cjs/generated/index.d.ts.map +1 -1
- package/dist/cjs/generated/observation_reducers.d.ts +7 -0
- package/dist/cjs/generated/observation_reducers.d.ts.map +1 -1
- package/dist/cjs/generated/observation_reducers.js +123 -2
- package/dist/cjs/generated/observation_reducers.js.map +1 -1
- package/dist/cjs/generated/projections.d.ts +96 -0
- package/dist/cjs/generated/projections.d.ts.map +1 -1
- package/dist/cjs/generated/projections.js +1471 -0
- package/dist/cjs/generated/projections.js.map +1 -1
- package/dist/cjs/index.js +16 -0
- package/dist/cjs/index.js.map +1 -1
- package/dist/esm/generated/descriptorSet.js +1 -1
- package/dist/esm/generated/descriptorSet.js.map +1 -1
- package/dist/esm/generated/index.d.ts +2 -2
- package/dist/esm/generated/index.d.ts.map +1 -1
- package/dist/esm/generated/observation_reducers.d.ts +7 -0
- package/dist/esm/generated/observation_reducers.d.ts.map +1 -1
- package/dist/esm/generated/observation_reducers.js +123 -3
- package/dist/esm/generated/observation_reducers.js.map +1 -1
- package/dist/esm/generated/projections.d.ts +96 -0
- package/dist/esm/generated/projections.d.ts.map +1 -1
- package/dist/esm/generated/projections.js +1457 -1
- package/dist/esm/generated/projections.js.map +1 -1
- package/dist/esm/index.js +2 -2
- package/dist/generated/descriptorSet.js +1 -1
- package/dist/generated/descriptorSet.js.map +1 -1
- package/dist/generated/index.d.ts +2 -2
- package/dist/generated/index.d.ts.map +1 -1
- package/dist/generated/index.js +2 -2
- package/dist/generated/index.js.map +1 -1
- package/dist/generated/observation_reducers.d.ts +7 -0
- package/dist/generated/observation_reducers.d.ts.map +1 -1
- package/dist/generated/observation_reducers.js +122 -2
- package/dist/generated/observation_reducers.js.map +1 -1
- package/dist/generated/projections.d.ts +96 -0
- package/dist/generated/projections.d.ts.map +1 -1
- package/dist/generated/projections.js +1456 -0
- package/dist/generated/projections.js.map +1 -1
- package/dist/tsconfig.tsbuildinfo +1 -1
- package/generated/descriptorSet.ts +1 -1
- package/generated/index.ts +2 -2
- package/generated/observation_reducers.ts +138 -2
- package/generated/projections.ts +1918 -194
- package/package.json +1 -1
|
@@ -1666,6 +1666,1444 @@ const GetAllDefinitionsRequest = {
|
|
|
1666
1666
|
return message;
|
|
1667
1667
|
},
|
|
1668
1668
|
};
|
|
1669
|
+
function createBaseGraphEdgeFromDefinition() {
|
|
1670
|
+
return { SourceKey: "", TargetKey: "", Identity: "", Properties: {} };
|
|
1671
|
+
}
|
|
1672
|
+
const GraphEdgeFromDefinition = {
|
|
1673
|
+
encode(message, writer = new BinaryWriter()) {
|
|
1674
|
+
if (message.SourceKey !== "") {
|
|
1675
|
+
writer.uint32(10).string(message.SourceKey);
|
|
1676
|
+
}
|
|
1677
|
+
if (message.TargetKey !== "") {
|
|
1678
|
+
writer.uint32(18).string(message.TargetKey);
|
|
1679
|
+
}
|
|
1680
|
+
if (message.Identity !== "") {
|
|
1681
|
+
writer.uint32(26).string(message.Identity);
|
|
1682
|
+
}
|
|
1683
|
+
globalThis.Object.entries(message.Properties).forEach(([key, value]) => {
|
|
1684
|
+
GraphEdgeFromDefinition_PropertiesEntry.encode({ key: key, value }, writer.uint32(34).fork()).join();
|
|
1685
|
+
});
|
|
1686
|
+
return writer;
|
|
1687
|
+
},
|
|
1688
|
+
decode(input, length) {
|
|
1689
|
+
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1690
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1691
|
+
if (previousRecursionDepth >= 100) {
|
|
1692
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1693
|
+
}
|
|
1694
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1695
|
+
try {
|
|
1696
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1697
|
+
const message = createBaseGraphEdgeFromDefinition();
|
|
1698
|
+
while (reader.pos < end) {
|
|
1699
|
+
const tag = reader.uint32();
|
|
1700
|
+
switch (tag >>> 3) {
|
|
1701
|
+
case 1: {
|
|
1702
|
+
if (tag !== 10) {
|
|
1703
|
+
break;
|
|
1704
|
+
}
|
|
1705
|
+
message.SourceKey = reader.string();
|
|
1706
|
+
continue;
|
|
1707
|
+
}
|
|
1708
|
+
case 2: {
|
|
1709
|
+
if (tag !== 18) {
|
|
1710
|
+
break;
|
|
1711
|
+
}
|
|
1712
|
+
message.TargetKey = reader.string();
|
|
1713
|
+
continue;
|
|
1714
|
+
}
|
|
1715
|
+
case 3: {
|
|
1716
|
+
if (tag !== 26) {
|
|
1717
|
+
break;
|
|
1718
|
+
}
|
|
1719
|
+
message.Identity = reader.string();
|
|
1720
|
+
continue;
|
|
1721
|
+
}
|
|
1722
|
+
case 4: {
|
|
1723
|
+
if (tag !== 34) {
|
|
1724
|
+
break;
|
|
1725
|
+
}
|
|
1726
|
+
const entry4 = GraphEdgeFromDefinition_PropertiesEntry.decode(reader, reader.uint32());
|
|
1727
|
+
if (entry4.value !== undefined) {
|
|
1728
|
+
message.Properties[entry4.key] = entry4.value;
|
|
1729
|
+
}
|
|
1730
|
+
continue;
|
|
1731
|
+
}
|
|
1732
|
+
}
|
|
1733
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1734
|
+
break;
|
|
1735
|
+
}
|
|
1736
|
+
reader.skip(tag & 7);
|
|
1737
|
+
}
|
|
1738
|
+
return message;
|
|
1739
|
+
}
|
|
1740
|
+
finally {
|
|
1741
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1742
|
+
}
|
|
1743
|
+
},
|
|
1744
|
+
fromJSON(object) {
|
|
1745
|
+
return {
|
|
1746
|
+
SourceKey: isSet(object.SourceKey) ? globalThis.String(object.SourceKey) : "",
|
|
1747
|
+
TargetKey: isSet(object.TargetKey) ? globalThis.String(object.TargetKey) : "",
|
|
1748
|
+
Identity: isSet(object.Identity) ? globalThis.String(object.Identity) : "",
|
|
1749
|
+
Properties: isObject(object.Properties)
|
|
1750
|
+
? globalThis.Object.entries(object.Properties).reduce((acc, [key, value]) => {
|
|
1751
|
+
globalThis.Object.defineProperty(acc, key, {
|
|
1752
|
+
value: globalThis.String(value),
|
|
1753
|
+
enumerable: true,
|
|
1754
|
+
configurable: true,
|
|
1755
|
+
writable: true,
|
|
1756
|
+
});
|
|
1757
|
+
return acc;
|
|
1758
|
+
}, {})
|
|
1759
|
+
: {},
|
|
1760
|
+
};
|
|
1761
|
+
},
|
|
1762
|
+
toJSON(message) {
|
|
1763
|
+
const obj = {};
|
|
1764
|
+
if (message.SourceKey !== "") {
|
|
1765
|
+
obj.SourceKey = message.SourceKey;
|
|
1766
|
+
}
|
|
1767
|
+
if (message.TargetKey !== "") {
|
|
1768
|
+
obj.TargetKey = message.TargetKey;
|
|
1769
|
+
}
|
|
1770
|
+
if (message.Identity !== "") {
|
|
1771
|
+
obj.Identity = message.Identity;
|
|
1772
|
+
}
|
|
1773
|
+
if (message.Properties) {
|
|
1774
|
+
const entries = globalThis.Object.entries(message.Properties);
|
|
1775
|
+
if (entries.length > 0) {
|
|
1776
|
+
obj.Properties = {};
|
|
1777
|
+
entries.forEach(([k, v]) => {
|
|
1778
|
+
obj.Properties[k] = v;
|
|
1779
|
+
});
|
|
1780
|
+
}
|
|
1781
|
+
}
|
|
1782
|
+
return obj;
|
|
1783
|
+
},
|
|
1784
|
+
create(base) {
|
|
1785
|
+
return GraphEdgeFromDefinition.fromPartial(base ?? {});
|
|
1786
|
+
},
|
|
1787
|
+
fromPartial(object) {
|
|
1788
|
+
const message = createBaseGraphEdgeFromDefinition();
|
|
1789
|
+
message.SourceKey = object.SourceKey ?? "";
|
|
1790
|
+
message.TargetKey = object.TargetKey ?? "";
|
|
1791
|
+
message.Identity = object.Identity ?? "";
|
|
1792
|
+
message.Properties = globalThis.Object.entries(object.Properties ?? {}).reduce((acc, [key, value]) => {
|
|
1793
|
+
if (value !== undefined) {
|
|
1794
|
+
acc[key] = globalThis.String(value);
|
|
1795
|
+
}
|
|
1796
|
+
return acc;
|
|
1797
|
+
}, {});
|
|
1798
|
+
return message;
|
|
1799
|
+
},
|
|
1800
|
+
};
|
|
1801
|
+
function createBaseGraphEdgeFromDefinition_PropertiesEntry() {
|
|
1802
|
+
return { key: "", value: "" };
|
|
1803
|
+
}
|
|
1804
|
+
const GraphEdgeFromDefinition_PropertiesEntry = {
|
|
1805
|
+
encode(message, writer = new BinaryWriter()) {
|
|
1806
|
+
if (message.key !== "") {
|
|
1807
|
+
writer.uint32(10).string(message.key);
|
|
1808
|
+
}
|
|
1809
|
+
if (message.value !== "") {
|
|
1810
|
+
writer.uint32(18).string(message.value);
|
|
1811
|
+
}
|
|
1812
|
+
return writer;
|
|
1813
|
+
},
|
|
1814
|
+
decode(input, length) {
|
|
1815
|
+
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1816
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1817
|
+
if (previousRecursionDepth >= 100) {
|
|
1818
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1819
|
+
}
|
|
1820
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1821
|
+
try {
|
|
1822
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1823
|
+
const message = createBaseGraphEdgeFromDefinition_PropertiesEntry();
|
|
1824
|
+
while (reader.pos < end) {
|
|
1825
|
+
const tag = reader.uint32();
|
|
1826
|
+
switch (tag >>> 3) {
|
|
1827
|
+
case 1: {
|
|
1828
|
+
if (tag !== 10) {
|
|
1829
|
+
break;
|
|
1830
|
+
}
|
|
1831
|
+
message.key = reader.string();
|
|
1832
|
+
continue;
|
|
1833
|
+
}
|
|
1834
|
+
case 2: {
|
|
1835
|
+
if (tag !== 18) {
|
|
1836
|
+
break;
|
|
1837
|
+
}
|
|
1838
|
+
message.value = reader.string();
|
|
1839
|
+
continue;
|
|
1840
|
+
}
|
|
1841
|
+
}
|
|
1842
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1843
|
+
break;
|
|
1844
|
+
}
|
|
1845
|
+
reader.skip(tag & 7);
|
|
1846
|
+
}
|
|
1847
|
+
return message;
|
|
1848
|
+
}
|
|
1849
|
+
finally {
|
|
1850
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1851
|
+
}
|
|
1852
|
+
},
|
|
1853
|
+
fromJSON(object) {
|
|
1854
|
+
return {
|
|
1855
|
+
key: isSet(object.key) ? globalThis.String(object.key) : "",
|
|
1856
|
+
value: isSet(object.value) ? globalThis.String(object.value) : "",
|
|
1857
|
+
};
|
|
1858
|
+
},
|
|
1859
|
+
toJSON(message) {
|
|
1860
|
+
const obj = {};
|
|
1861
|
+
if (message.key !== "") {
|
|
1862
|
+
obj.key = message.key;
|
|
1863
|
+
}
|
|
1864
|
+
if (message.value !== "") {
|
|
1865
|
+
obj.value = message.value;
|
|
1866
|
+
}
|
|
1867
|
+
return obj;
|
|
1868
|
+
},
|
|
1869
|
+
create(base) {
|
|
1870
|
+
return GraphEdgeFromDefinition_PropertiesEntry.fromPartial(base ?? {});
|
|
1871
|
+
},
|
|
1872
|
+
fromPartial(object) {
|
|
1873
|
+
const message = createBaseGraphEdgeFromDefinition_PropertiesEntry();
|
|
1874
|
+
message.key = object.key ?? "";
|
|
1875
|
+
message.value = object.value ?? "";
|
|
1876
|
+
return message;
|
|
1877
|
+
},
|
|
1878
|
+
};
|
|
1879
|
+
function createBaseGraphEdgeProjectionDefinition() {
|
|
1880
|
+
return { From: {}, RemovedWith: {} };
|
|
1881
|
+
}
|
|
1882
|
+
const GraphEdgeProjectionDefinition = {
|
|
1883
|
+
encode(message, writer = new BinaryWriter()) {
|
|
1884
|
+
globalThis.Object.entries(message.From).forEach(([key, value]) => {
|
|
1885
|
+
GraphEdgeProjectionDefinition_FromEntry.encode({ key: key, value }, writer.uint32(10).fork()).join();
|
|
1886
|
+
});
|
|
1887
|
+
globalThis.Object.entries(message.RemovedWith).forEach(([key, value]) => {
|
|
1888
|
+
GraphEdgeProjectionDefinition_RemovedWithEntry.encode({ key: key, value }, writer.uint32(18).fork())
|
|
1889
|
+
.join();
|
|
1890
|
+
});
|
|
1891
|
+
return writer;
|
|
1892
|
+
},
|
|
1893
|
+
decode(input, length) {
|
|
1894
|
+
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1895
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1896
|
+
if (previousRecursionDepth >= 100) {
|
|
1897
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1898
|
+
}
|
|
1899
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1900
|
+
try {
|
|
1901
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1902
|
+
const message = createBaseGraphEdgeProjectionDefinition();
|
|
1903
|
+
while (reader.pos < end) {
|
|
1904
|
+
const tag = reader.uint32();
|
|
1905
|
+
switch (tag >>> 3) {
|
|
1906
|
+
case 1: {
|
|
1907
|
+
if (tag !== 10) {
|
|
1908
|
+
break;
|
|
1909
|
+
}
|
|
1910
|
+
const entry1 = GraphEdgeProjectionDefinition_FromEntry.decode(reader, reader.uint32());
|
|
1911
|
+
if (entry1.value !== undefined) {
|
|
1912
|
+
message.From[entry1.key] = entry1.value;
|
|
1913
|
+
}
|
|
1914
|
+
continue;
|
|
1915
|
+
}
|
|
1916
|
+
case 2: {
|
|
1917
|
+
if (tag !== 18) {
|
|
1918
|
+
break;
|
|
1919
|
+
}
|
|
1920
|
+
const entry2 = GraphEdgeProjectionDefinition_RemovedWithEntry.decode(reader, reader.uint32());
|
|
1921
|
+
if (entry2.value !== undefined) {
|
|
1922
|
+
message.RemovedWith[entry2.key] = entry2.value;
|
|
1923
|
+
}
|
|
1924
|
+
continue;
|
|
1925
|
+
}
|
|
1926
|
+
}
|
|
1927
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1928
|
+
break;
|
|
1929
|
+
}
|
|
1930
|
+
reader.skip(tag & 7);
|
|
1931
|
+
}
|
|
1932
|
+
return message;
|
|
1933
|
+
}
|
|
1934
|
+
finally {
|
|
1935
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1936
|
+
}
|
|
1937
|
+
},
|
|
1938
|
+
fromJSON(object) {
|
|
1939
|
+
return {
|
|
1940
|
+
From: isObject(object.From)
|
|
1941
|
+
? globalThis.Object.entries(object.From).reduce((acc, [key, value]) => {
|
|
1942
|
+
globalThis.Object.defineProperty(acc, key, {
|
|
1943
|
+
value: GraphEdgeFromDefinition.fromJSON(value),
|
|
1944
|
+
enumerable: true,
|
|
1945
|
+
configurable: true,
|
|
1946
|
+
writable: true,
|
|
1947
|
+
});
|
|
1948
|
+
return acc;
|
|
1949
|
+
}, {})
|
|
1950
|
+
: {},
|
|
1951
|
+
RemovedWith: isObject(object.RemovedWith)
|
|
1952
|
+
? globalThis.Object.entries(object.RemovedWith).reduce((acc, [key, value]) => {
|
|
1953
|
+
globalThis.Object.defineProperty(acc, key, {
|
|
1954
|
+
value: GraphEdgeRemovedWithDefinition.fromJSON(value),
|
|
1955
|
+
enumerable: true,
|
|
1956
|
+
configurable: true,
|
|
1957
|
+
writable: true,
|
|
1958
|
+
});
|
|
1959
|
+
return acc;
|
|
1960
|
+
}, {})
|
|
1961
|
+
: {},
|
|
1962
|
+
};
|
|
1963
|
+
},
|
|
1964
|
+
toJSON(message) {
|
|
1965
|
+
const obj = {};
|
|
1966
|
+
if (message.From) {
|
|
1967
|
+
const entries = globalThis.Object.entries(message.From);
|
|
1968
|
+
if (entries.length > 0) {
|
|
1969
|
+
obj.From = {};
|
|
1970
|
+
entries.forEach(([k, v]) => {
|
|
1971
|
+
obj.From[k] = GraphEdgeFromDefinition.toJSON(v);
|
|
1972
|
+
});
|
|
1973
|
+
}
|
|
1974
|
+
}
|
|
1975
|
+
if (message.RemovedWith) {
|
|
1976
|
+
const entries = globalThis.Object.entries(message.RemovedWith);
|
|
1977
|
+
if (entries.length > 0) {
|
|
1978
|
+
obj.RemovedWith = {};
|
|
1979
|
+
entries.forEach(([k, v]) => {
|
|
1980
|
+
obj.RemovedWith[k] = GraphEdgeRemovedWithDefinition.toJSON(v);
|
|
1981
|
+
});
|
|
1982
|
+
}
|
|
1983
|
+
}
|
|
1984
|
+
return obj;
|
|
1985
|
+
},
|
|
1986
|
+
create(base) {
|
|
1987
|
+
return GraphEdgeProjectionDefinition.fromPartial(base ?? {});
|
|
1988
|
+
},
|
|
1989
|
+
fromPartial(object) {
|
|
1990
|
+
const message = createBaseGraphEdgeProjectionDefinition();
|
|
1991
|
+
message.From = globalThis.Object.entries(object.From ?? {}).reduce((acc, [key, value]) => {
|
|
1992
|
+
if (value !== undefined) {
|
|
1993
|
+
acc[key] = GraphEdgeFromDefinition.fromPartial(value);
|
|
1994
|
+
}
|
|
1995
|
+
return acc;
|
|
1996
|
+
}, {});
|
|
1997
|
+
message.RemovedWith =
|
|
1998
|
+
globalThis.Object.entries(object.RemovedWith ?? {}).reduce((acc, [key, value]) => {
|
|
1999
|
+
if (value !== undefined) {
|
|
2000
|
+
acc[key] = GraphEdgeRemovedWithDefinition.fromPartial(value);
|
|
2001
|
+
}
|
|
2002
|
+
return acc;
|
|
2003
|
+
}, {});
|
|
2004
|
+
return message;
|
|
2005
|
+
},
|
|
2006
|
+
};
|
|
2007
|
+
function createBaseGraphEdgeProjectionDefinition_FromEntry() {
|
|
2008
|
+
return { key: "", value: undefined };
|
|
2009
|
+
}
|
|
2010
|
+
const GraphEdgeProjectionDefinition_FromEntry = {
|
|
2011
|
+
encode(message, writer = new BinaryWriter()) {
|
|
2012
|
+
if (message.key !== "") {
|
|
2013
|
+
writer.uint32(10).string(message.key);
|
|
2014
|
+
}
|
|
2015
|
+
if (message.value !== undefined) {
|
|
2016
|
+
GraphEdgeFromDefinition.encode(message.value, writer.uint32(18).fork()).join();
|
|
2017
|
+
}
|
|
2018
|
+
return writer;
|
|
2019
|
+
},
|
|
2020
|
+
decode(input, length) {
|
|
2021
|
+
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2022
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2023
|
+
if (previousRecursionDepth >= 100) {
|
|
2024
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2025
|
+
}
|
|
2026
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2027
|
+
try {
|
|
2028
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2029
|
+
const message = createBaseGraphEdgeProjectionDefinition_FromEntry();
|
|
2030
|
+
while (reader.pos < end) {
|
|
2031
|
+
const tag = reader.uint32();
|
|
2032
|
+
switch (tag >>> 3) {
|
|
2033
|
+
case 1: {
|
|
2034
|
+
if (tag !== 10) {
|
|
2035
|
+
break;
|
|
2036
|
+
}
|
|
2037
|
+
message.key = reader.string();
|
|
2038
|
+
continue;
|
|
2039
|
+
}
|
|
2040
|
+
case 2: {
|
|
2041
|
+
if (tag !== 18) {
|
|
2042
|
+
break;
|
|
2043
|
+
}
|
|
2044
|
+
message.value = GraphEdgeFromDefinition.decode(reader, reader.uint32());
|
|
2045
|
+
continue;
|
|
2046
|
+
}
|
|
2047
|
+
}
|
|
2048
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2049
|
+
break;
|
|
2050
|
+
}
|
|
2051
|
+
reader.skip(tag & 7);
|
|
2052
|
+
}
|
|
2053
|
+
return message;
|
|
2054
|
+
}
|
|
2055
|
+
finally {
|
|
2056
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2057
|
+
}
|
|
2058
|
+
},
|
|
2059
|
+
fromJSON(object) {
|
|
2060
|
+
return {
|
|
2061
|
+
key: isSet(object.key) ? globalThis.String(object.key) : "",
|
|
2062
|
+
value: isSet(object.value) ? GraphEdgeFromDefinition.fromJSON(object.value) : undefined,
|
|
2063
|
+
};
|
|
2064
|
+
},
|
|
2065
|
+
toJSON(message) {
|
|
2066
|
+
const obj = {};
|
|
2067
|
+
if (message.key !== "") {
|
|
2068
|
+
obj.key = message.key;
|
|
2069
|
+
}
|
|
2070
|
+
if (message.value !== undefined) {
|
|
2071
|
+
obj.value = GraphEdgeFromDefinition.toJSON(message.value);
|
|
2072
|
+
}
|
|
2073
|
+
return obj;
|
|
2074
|
+
},
|
|
2075
|
+
create(base) {
|
|
2076
|
+
return GraphEdgeProjectionDefinition_FromEntry.fromPartial(base ?? {});
|
|
2077
|
+
},
|
|
2078
|
+
fromPartial(object) {
|
|
2079
|
+
const message = createBaseGraphEdgeProjectionDefinition_FromEntry();
|
|
2080
|
+
message.key = object.key ?? "";
|
|
2081
|
+
message.value = (object.value !== undefined && object.value !== null)
|
|
2082
|
+
? GraphEdgeFromDefinition.fromPartial(object.value)
|
|
2083
|
+
: undefined;
|
|
2084
|
+
return message;
|
|
2085
|
+
},
|
|
2086
|
+
};
|
|
2087
|
+
function createBaseGraphEdgeProjectionDefinition_RemovedWithEntry() {
|
|
2088
|
+
return { key: "", value: undefined };
|
|
2089
|
+
}
|
|
2090
|
+
const GraphEdgeProjectionDefinition_RemovedWithEntry = {
|
|
2091
|
+
encode(message, writer = new BinaryWriter()) {
|
|
2092
|
+
if (message.key !== "") {
|
|
2093
|
+
writer.uint32(10).string(message.key);
|
|
2094
|
+
}
|
|
2095
|
+
if (message.value !== undefined) {
|
|
2096
|
+
GraphEdgeRemovedWithDefinition.encode(message.value, writer.uint32(18).fork()).join();
|
|
2097
|
+
}
|
|
2098
|
+
return writer;
|
|
2099
|
+
},
|
|
2100
|
+
decode(input, length) {
|
|
2101
|
+
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2102
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2103
|
+
if (previousRecursionDepth >= 100) {
|
|
2104
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2105
|
+
}
|
|
2106
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2107
|
+
try {
|
|
2108
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2109
|
+
const message = createBaseGraphEdgeProjectionDefinition_RemovedWithEntry();
|
|
2110
|
+
while (reader.pos < end) {
|
|
2111
|
+
const tag = reader.uint32();
|
|
2112
|
+
switch (tag >>> 3) {
|
|
2113
|
+
case 1: {
|
|
2114
|
+
if (tag !== 10) {
|
|
2115
|
+
break;
|
|
2116
|
+
}
|
|
2117
|
+
message.key = reader.string();
|
|
2118
|
+
continue;
|
|
2119
|
+
}
|
|
2120
|
+
case 2: {
|
|
2121
|
+
if (tag !== 18) {
|
|
2122
|
+
break;
|
|
2123
|
+
}
|
|
2124
|
+
message.value = GraphEdgeRemovedWithDefinition.decode(reader, reader.uint32());
|
|
2125
|
+
continue;
|
|
2126
|
+
}
|
|
2127
|
+
}
|
|
2128
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2129
|
+
break;
|
|
2130
|
+
}
|
|
2131
|
+
reader.skip(tag & 7);
|
|
2132
|
+
}
|
|
2133
|
+
return message;
|
|
2134
|
+
}
|
|
2135
|
+
finally {
|
|
2136
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2137
|
+
}
|
|
2138
|
+
},
|
|
2139
|
+
fromJSON(object) {
|
|
2140
|
+
return {
|
|
2141
|
+
key: isSet(object.key) ? globalThis.String(object.key) : "",
|
|
2142
|
+
value: isSet(object.value) ? GraphEdgeRemovedWithDefinition.fromJSON(object.value) : undefined,
|
|
2143
|
+
};
|
|
2144
|
+
},
|
|
2145
|
+
toJSON(message) {
|
|
2146
|
+
const obj = {};
|
|
2147
|
+
if (message.key !== "") {
|
|
2148
|
+
obj.key = message.key;
|
|
2149
|
+
}
|
|
2150
|
+
if (message.value !== undefined) {
|
|
2151
|
+
obj.value = GraphEdgeRemovedWithDefinition.toJSON(message.value);
|
|
2152
|
+
}
|
|
2153
|
+
return obj;
|
|
2154
|
+
},
|
|
2155
|
+
create(base) {
|
|
2156
|
+
return GraphEdgeProjectionDefinition_RemovedWithEntry.fromPartial(base ?? {});
|
|
2157
|
+
},
|
|
2158
|
+
fromPartial(object) {
|
|
2159
|
+
const message = createBaseGraphEdgeProjectionDefinition_RemovedWithEntry();
|
|
2160
|
+
message.key = object.key ?? "";
|
|
2161
|
+
message.value = (object.value !== undefined && object.value !== null)
|
|
2162
|
+
? GraphEdgeRemovedWithDefinition.fromPartial(object.value)
|
|
2163
|
+
: undefined;
|
|
2164
|
+
return message;
|
|
2165
|
+
},
|
|
2166
|
+
};
|
|
2167
|
+
function createBaseGraphEdgeRemovedWithDefinition() {
|
|
2168
|
+
return { SourceKey: "", TargetKey: "", Identity: "" };
|
|
2169
|
+
}
|
|
2170
|
+
const GraphEdgeRemovedWithDefinition = {
|
|
2171
|
+
encode(message, writer = new BinaryWriter()) {
|
|
2172
|
+
if (message.SourceKey !== "") {
|
|
2173
|
+
writer.uint32(10).string(message.SourceKey);
|
|
2174
|
+
}
|
|
2175
|
+
if (message.TargetKey !== "") {
|
|
2176
|
+
writer.uint32(18).string(message.TargetKey);
|
|
2177
|
+
}
|
|
2178
|
+
if (message.Identity !== "") {
|
|
2179
|
+
writer.uint32(26).string(message.Identity);
|
|
2180
|
+
}
|
|
2181
|
+
return writer;
|
|
2182
|
+
},
|
|
2183
|
+
decode(input, length) {
|
|
2184
|
+
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2185
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2186
|
+
if (previousRecursionDepth >= 100) {
|
|
2187
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2188
|
+
}
|
|
2189
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2190
|
+
try {
|
|
2191
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2192
|
+
const message = createBaseGraphEdgeRemovedWithDefinition();
|
|
2193
|
+
while (reader.pos < end) {
|
|
2194
|
+
const tag = reader.uint32();
|
|
2195
|
+
switch (tag >>> 3) {
|
|
2196
|
+
case 1: {
|
|
2197
|
+
if (tag !== 10) {
|
|
2198
|
+
break;
|
|
2199
|
+
}
|
|
2200
|
+
message.SourceKey = reader.string();
|
|
2201
|
+
continue;
|
|
2202
|
+
}
|
|
2203
|
+
case 2: {
|
|
2204
|
+
if (tag !== 18) {
|
|
2205
|
+
break;
|
|
2206
|
+
}
|
|
2207
|
+
message.TargetKey = reader.string();
|
|
2208
|
+
continue;
|
|
2209
|
+
}
|
|
2210
|
+
case 3: {
|
|
2211
|
+
if (tag !== 26) {
|
|
2212
|
+
break;
|
|
2213
|
+
}
|
|
2214
|
+
message.Identity = reader.string();
|
|
2215
|
+
continue;
|
|
2216
|
+
}
|
|
2217
|
+
}
|
|
2218
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2219
|
+
break;
|
|
2220
|
+
}
|
|
2221
|
+
reader.skip(tag & 7);
|
|
2222
|
+
}
|
|
2223
|
+
return message;
|
|
2224
|
+
}
|
|
2225
|
+
finally {
|
|
2226
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2227
|
+
}
|
|
2228
|
+
},
|
|
2229
|
+
fromJSON(object) {
|
|
2230
|
+
return {
|
|
2231
|
+
SourceKey: isSet(object.SourceKey) ? globalThis.String(object.SourceKey) : "",
|
|
2232
|
+
TargetKey: isSet(object.TargetKey) ? globalThis.String(object.TargetKey) : "",
|
|
2233
|
+
Identity: isSet(object.Identity) ? globalThis.String(object.Identity) : "",
|
|
2234
|
+
};
|
|
2235
|
+
},
|
|
2236
|
+
toJSON(message) {
|
|
2237
|
+
const obj = {};
|
|
2238
|
+
if (message.SourceKey !== "") {
|
|
2239
|
+
obj.SourceKey = message.SourceKey;
|
|
2240
|
+
}
|
|
2241
|
+
if (message.TargetKey !== "") {
|
|
2242
|
+
obj.TargetKey = message.TargetKey;
|
|
2243
|
+
}
|
|
2244
|
+
if (message.Identity !== "") {
|
|
2245
|
+
obj.Identity = message.Identity;
|
|
2246
|
+
}
|
|
2247
|
+
return obj;
|
|
2248
|
+
},
|
|
2249
|
+
create(base) {
|
|
2250
|
+
return GraphEdgeRemovedWithDefinition.fromPartial(base ?? {});
|
|
2251
|
+
},
|
|
2252
|
+
fromPartial(object) {
|
|
2253
|
+
const message = createBaseGraphEdgeRemovedWithDefinition();
|
|
2254
|
+
message.SourceKey = object.SourceKey ?? "";
|
|
2255
|
+
message.TargetKey = object.TargetKey ?? "";
|
|
2256
|
+
message.Identity = object.Identity ?? "";
|
|
2257
|
+
return message;
|
|
2258
|
+
},
|
|
2259
|
+
};
|
|
2260
|
+
function createBaseGraphNodeFromDefinition() {
|
|
2261
|
+
return { Key: "", Properties: {}, UpdateOnly: false };
|
|
2262
|
+
}
|
|
2263
|
+
const GraphNodeFromDefinition = {
|
|
2264
|
+
encode(message, writer = new BinaryWriter()) {
|
|
2265
|
+
if (message.Key !== "") {
|
|
2266
|
+
writer.uint32(10).string(message.Key);
|
|
2267
|
+
}
|
|
2268
|
+
globalThis.Object.entries(message.Properties).forEach(([key, value]) => {
|
|
2269
|
+
GraphNodeFromDefinition_PropertiesEntry.encode({ key: key, value }, writer.uint32(18).fork()).join();
|
|
2270
|
+
});
|
|
2271
|
+
if (message.UpdateOnly !== false) {
|
|
2272
|
+
writer.uint32(24).bool(message.UpdateOnly);
|
|
2273
|
+
}
|
|
2274
|
+
return writer;
|
|
2275
|
+
},
|
|
2276
|
+
decode(input, length) {
|
|
2277
|
+
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2278
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2279
|
+
if (previousRecursionDepth >= 100) {
|
|
2280
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2281
|
+
}
|
|
2282
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2283
|
+
try {
|
|
2284
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2285
|
+
const message = createBaseGraphNodeFromDefinition();
|
|
2286
|
+
while (reader.pos < end) {
|
|
2287
|
+
const tag = reader.uint32();
|
|
2288
|
+
switch (tag >>> 3) {
|
|
2289
|
+
case 1: {
|
|
2290
|
+
if (tag !== 10) {
|
|
2291
|
+
break;
|
|
2292
|
+
}
|
|
2293
|
+
message.Key = reader.string();
|
|
2294
|
+
continue;
|
|
2295
|
+
}
|
|
2296
|
+
case 2: {
|
|
2297
|
+
if (tag !== 18) {
|
|
2298
|
+
break;
|
|
2299
|
+
}
|
|
2300
|
+
const entry2 = GraphNodeFromDefinition_PropertiesEntry.decode(reader, reader.uint32());
|
|
2301
|
+
if (entry2.value !== undefined) {
|
|
2302
|
+
message.Properties[entry2.key] = entry2.value;
|
|
2303
|
+
}
|
|
2304
|
+
continue;
|
|
2305
|
+
}
|
|
2306
|
+
case 3: {
|
|
2307
|
+
if (tag !== 24) {
|
|
2308
|
+
break;
|
|
2309
|
+
}
|
|
2310
|
+
message.UpdateOnly = reader.bool();
|
|
2311
|
+
continue;
|
|
2312
|
+
}
|
|
2313
|
+
}
|
|
2314
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2315
|
+
break;
|
|
2316
|
+
}
|
|
2317
|
+
reader.skip(tag & 7);
|
|
2318
|
+
}
|
|
2319
|
+
return message;
|
|
2320
|
+
}
|
|
2321
|
+
finally {
|
|
2322
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2323
|
+
}
|
|
2324
|
+
},
|
|
2325
|
+
fromJSON(object) {
|
|
2326
|
+
return {
|
|
2327
|
+
Key: isSet(object.Key) ? globalThis.String(object.Key) : "",
|
|
2328
|
+
Properties: isObject(object.Properties)
|
|
2329
|
+
? globalThis.Object.entries(object.Properties).reduce((acc, [key, value]) => {
|
|
2330
|
+
globalThis.Object.defineProperty(acc, key, {
|
|
2331
|
+
value: globalThis.String(value),
|
|
2332
|
+
enumerable: true,
|
|
2333
|
+
configurable: true,
|
|
2334
|
+
writable: true,
|
|
2335
|
+
});
|
|
2336
|
+
return acc;
|
|
2337
|
+
}, {})
|
|
2338
|
+
: {},
|
|
2339
|
+
UpdateOnly: isSet(object.UpdateOnly) ? globalThis.Boolean(object.UpdateOnly) : false,
|
|
2340
|
+
};
|
|
2341
|
+
},
|
|
2342
|
+
toJSON(message) {
|
|
2343
|
+
const obj = {};
|
|
2344
|
+
if (message.Key !== "") {
|
|
2345
|
+
obj.Key = message.Key;
|
|
2346
|
+
}
|
|
2347
|
+
if (message.Properties) {
|
|
2348
|
+
const entries = globalThis.Object.entries(message.Properties);
|
|
2349
|
+
if (entries.length > 0) {
|
|
2350
|
+
obj.Properties = {};
|
|
2351
|
+
entries.forEach(([k, v]) => {
|
|
2352
|
+
obj.Properties[k] = v;
|
|
2353
|
+
});
|
|
2354
|
+
}
|
|
2355
|
+
}
|
|
2356
|
+
if (message.UpdateOnly !== false) {
|
|
2357
|
+
obj.UpdateOnly = message.UpdateOnly;
|
|
2358
|
+
}
|
|
2359
|
+
return obj;
|
|
2360
|
+
},
|
|
2361
|
+
create(base) {
|
|
2362
|
+
return GraphNodeFromDefinition.fromPartial(base ?? {});
|
|
2363
|
+
},
|
|
2364
|
+
fromPartial(object) {
|
|
2365
|
+
const message = createBaseGraphNodeFromDefinition();
|
|
2366
|
+
message.Key = object.Key ?? "";
|
|
2367
|
+
message.Properties = globalThis.Object.entries(object.Properties ?? {}).reduce((acc, [key, value]) => {
|
|
2368
|
+
if (value !== undefined) {
|
|
2369
|
+
acc[key] = globalThis.String(value);
|
|
2370
|
+
}
|
|
2371
|
+
return acc;
|
|
2372
|
+
}, {});
|
|
2373
|
+
message.UpdateOnly = object.UpdateOnly ?? false;
|
|
2374
|
+
return message;
|
|
2375
|
+
},
|
|
2376
|
+
};
|
|
2377
|
+
function createBaseGraphNodeFromDefinition_PropertiesEntry() {
|
|
2378
|
+
return { key: "", value: "" };
|
|
2379
|
+
}
|
|
2380
|
+
const GraphNodeFromDefinition_PropertiesEntry = {
|
|
2381
|
+
encode(message, writer = new BinaryWriter()) {
|
|
2382
|
+
if (message.key !== "") {
|
|
2383
|
+
writer.uint32(10).string(message.key);
|
|
2384
|
+
}
|
|
2385
|
+
if (message.value !== "") {
|
|
2386
|
+
writer.uint32(18).string(message.value);
|
|
2387
|
+
}
|
|
2388
|
+
return writer;
|
|
2389
|
+
},
|
|
2390
|
+
decode(input, length) {
|
|
2391
|
+
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2392
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2393
|
+
if (previousRecursionDepth >= 100) {
|
|
2394
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2395
|
+
}
|
|
2396
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2397
|
+
try {
|
|
2398
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2399
|
+
const message = createBaseGraphNodeFromDefinition_PropertiesEntry();
|
|
2400
|
+
while (reader.pos < end) {
|
|
2401
|
+
const tag = reader.uint32();
|
|
2402
|
+
switch (tag >>> 3) {
|
|
2403
|
+
case 1: {
|
|
2404
|
+
if (tag !== 10) {
|
|
2405
|
+
break;
|
|
2406
|
+
}
|
|
2407
|
+
message.key = reader.string();
|
|
2408
|
+
continue;
|
|
2409
|
+
}
|
|
2410
|
+
case 2: {
|
|
2411
|
+
if (tag !== 18) {
|
|
2412
|
+
break;
|
|
2413
|
+
}
|
|
2414
|
+
message.value = reader.string();
|
|
2415
|
+
continue;
|
|
2416
|
+
}
|
|
2417
|
+
}
|
|
2418
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2419
|
+
break;
|
|
2420
|
+
}
|
|
2421
|
+
reader.skip(tag & 7);
|
|
2422
|
+
}
|
|
2423
|
+
return message;
|
|
2424
|
+
}
|
|
2425
|
+
finally {
|
|
2426
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2427
|
+
}
|
|
2428
|
+
},
|
|
2429
|
+
fromJSON(object) {
|
|
2430
|
+
return {
|
|
2431
|
+
key: isSet(object.key) ? globalThis.String(object.key) : "",
|
|
2432
|
+
value: isSet(object.value) ? globalThis.String(object.value) : "",
|
|
2433
|
+
};
|
|
2434
|
+
},
|
|
2435
|
+
toJSON(message) {
|
|
2436
|
+
const obj = {};
|
|
2437
|
+
if (message.key !== "") {
|
|
2438
|
+
obj.key = message.key;
|
|
2439
|
+
}
|
|
2440
|
+
if (message.value !== "") {
|
|
2441
|
+
obj.value = message.value;
|
|
2442
|
+
}
|
|
2443
|
+
return obj;
|
|
2444
|
+
},
|
|
2445
|
+
create(base) {
|
|
2446
|
+
return GraphNodeFromDefinition_PropertiesEntry.fromPartial(base ?? {});
|
|
2447
|
+
},
|
|
2448
|
+
fromPartial(object) {
|
|
2449
|
+
const message = createBaseGraphNodeFromDefinition_PropertiesEntry();
|
|
2450
|
+
message.key = object.key ?? "";
|
|
2451
|
+
message.value = object.value ?? "";
|
|
2452
|
+
return message;
|
|
2453
|
+
},
|
|
2454
|
+
};
|
|
2455
|
+
function createBaseGraphNodeProjectionDefinition() {
|
|
2456
|
+
return { From: {}, RemovedWith: {} };
|
|
2457
|
+
}
|
|
2458
|
+
const GraphNodeProjectionDefinition = {
|
|
2459
|
+
encode(message, writer = new BinaryWriter()) {
|
|
2460
|
+
globalThis.Object.entries(message.From).forEach(([key, value]) => {
|
|
2461
|
+
GraphNodeProjectionDefinition_FromEntry.encode({ key: key, value }, writer.uint32(10).fork()).join();
|
|
2462
|
+
});
|
|
2463
|
+
globalThis.Object.entries(message.RemovedWith).forEach(([key, value]) => {
|
|
2464
|
+
GraphNodeProjectionDefinition_RemovedWithEntry.encode({ key: key, value }, writer.uint32(18).fork())
|
|
2465
|
+
.join();
|
|
2466
|
+
});
|
|
2467
|
+
return writer;
|
|
2468
|
+
},
|
|
2469
|
+
decode(input, length) {
|
|
2470
|
+
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2471
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2472
|
+
if (previousRecursionDepth >= 100) {
|
|
2473
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2474
|
+
}
|
|
2475
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2476
|
+
try {
|
|
2477
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2478
|
+
const message = createBaseGraphNodeProjectionDefinition();
|
|
2479
|
+
while (reader.pos < end) {
|
|
2480
|
+
const tag = reader.uint32();
|
|
2481
|
+
switch (tag >>> 3) {
|
|
2482
|
+
case 1: {
|
|
2483
|
+
if (tag !== 10) {
|
|
2484
|
+
break;
|
|
2485
|
+
}
|
|
2486
|
+
const entry1 = GraphNodeProjectionDefinition_FromEntry.decode(reader, reader.uint32());
|
|
2487
|
+
if (entry1.value !== undefined) {
|
|
2488
|
+
message.From[entry1.key] = entry1.value;
|
|
2489
|
+
}
|
|
2490
|
+
continue;
|
|
2491
|
+
}
|
|
2492
|
+
case 2: {
|
|
2493
|
+
if (tag !== 18) {
|
|
2494
|
+
break;
|
|
2495
|
+
}
|
|
2496
|
+
const entry2 = GraphNodeProjectionDefinition_RemovedWithEntry.decode(reader, reader.uint32());
|
|
2497
|
+
if (entry2.value !== undefined) {
|
|
2498
|
+
message.RemovedWith[entry2.key] = entry2.value;
|
|
2499
|
+
}
|
|
2500
|
+
continue;
|
|
2501
|
+
}
|
|
2502
|
+
}
|
|
2503
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2504
|
+
break;
|
|
2505
|
+
}
|
|
2506
|
+
reader.skip(tag & 7);
|
|
2507
|
+
}
|
|
2508
|
+
return message;
|
|
2509
|
+
}
|
|
2510
|
+
finally {
|
|
2511
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2512
|
+
}
|
|
2513
|
+
},
|
|
2514
|
+
fromJSON(object) {
|
|
2515
|
+
return {
|
|
2516
|
+
From: isObject(object.From)
|
|
2517
|
+
? globalThis.Object.entries(object.From).reduce((acc, [key, value]) => {
|
|
2518
|
+
globalThis.Object.defineProperty(acc, key, {
|
|
2519
|
+
value: GraphNodeFromDefinition.fromJSON(value),
|
|
2520
|
+
enumerable: true,
|
|
2521
|
+
configurable: true,
|
|
2522
|
+
writable: true,
|
|
2523
|
+
});
|
|
2524
|
+
return acc;
|
|
2525
|
+
}, {})
|
|
2526
|
+
: {},
|
|
2527
|
+
RemovedWith: isObject(object.RemovedWith)
|
|
2528
|
+
? globalThis.Object.entries(object.RemovedWith).reduce((acc, [key, value]) => {
|
|
2529
|
+
globalThis.Object.defineProperty(acc, key, {
|
|
2530
|
+
value: GraphNodeRemovedWithDefinition.fromJSON(value),
|
|
2531
|
+
enumerable: true,
|
|
2532
|
+
configurable: true,
|
|
2533
|
+
writable: true,
|
|
2534
|
+
});
|
|
2535
|
+
return acc;
|
|
2536
|
+
}, {})
|
|
2537
|
+
: {},
|
|
2538
|
+
};
|
|
2539
|
+
},
|
|
2540
|
+
toJSON(message) {
|
|
2541
|
+
const obj = {};
|
|
2542
|
+
if (message.From) {
|
|
2543
|
+
const entries = globalThis.Object.entries(message.From);
|
|
2544
|
+
if (entries.length > 0) {
|
|
2545
|
+
obj.From = {};
|
|
2546
|
+
entries.forEach(([k, v]) => {
|
|
2547
|
+
obj.From[k] = GraphNodeFromDefinition.toJSON(v);
|
|
2548
|
+
});
|
|
2549
|
+
}
|
|
2550
|
+
}
|
|
2551
|
+
if (message.RemovedWith) {
|
|
2552
|
+
const entries = globalThis.Object.entries(message.RemovedWith);
|
|
2553
|
+
if (entries.length > 0) {
|
|
2554
|
+
obj.RemovedWith = {};
|
|
2555
|
+
entries.forEach(([k, v]) => {
|
|
2556
|
+
obj.RemovedWith[k] = GraphNodeRemovedWithDefinition.toJSON(v);
|
|
2557
|
+
});
|
|
2558
|
+
}
|
|
2559
|
+
}
|
|
2560
|
+
return obj;
|
|
2561
|
+
},
|
|
2562
|
+
create(base) {
|
|
2563
|
+
return GraphNodeProjectionDefinition.fromPartial(base ?? {});
|
|
2564
|
+
},
|
|
2565
|
+
fromPartial(object) {
|
|
2566
|
+
const message = createBaseGraphNodeProjectionDefinition();
|
|
2567
|
+
message.From = globalThis.Object.entries(object.From ?? {}).reduce((acc, [key, value]) => {
|
|
2568
|
+
if (value !== undefined) {
|
|
2569
|
+
acc[key] = GraphNodeFromDefinition.fromPartial(value);
|
|
2570
|
+
}
|
|
2571
|
+
return acc;
|
|
2572
|
+
}, {});
|
|
2573
|
+
message.RemovedWith =
|
|
2574
|
+
globalThis.Object.entries(object.RemovedWith ?? {}).reduce((acc, [key, value]) => {
|
|
2575
|
+
if (value !== undefined) {
|
|
2576
|
+
acc[key] = GraphNodeRemovedWithDefinition.fromPartial(value);
|
|
2577
|
+
}
|
|
2578
|
+
return acc;
|
|
2579
|
+
}, {});
|
|
2580
|
+
return message;
|
|
2581
|
+
},
|
|
2582
|
+
};
|
|
2583
|
+
function createBaseGraphNodeProjectionDefinition_FromEntry() {
|
|
2584
|
+
return { key: "", value: undefined };
|
|
2585
|
+
}
|
|
2586
|
+
const GraphNodeProjectionDefinition_FromEntry = {
|
|
2587
|
+
encode(message, writer = new BinaryWriter()) {
|
|
2588
|
+
if (message.key !== "") {
|
|
2589
|
+
writer.uint32(10).string(message.key);
|
|
2590
|
+
}
|
|
2591
|
+
if (message.value !== undefined) {
|
|
2592
|
+
GraphNodeFromDefinition.encode(message.value, writer.uint32(18).fork()).join();
|
|
2593
|
+
}
|
|
2594
|
+
return writer;
|
|
2595
|
+
},
|
|
2596
|
+
decode(input, length) {
|
|
2597
|
+
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2598
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2599
|
+
if (previousRecursionDepth >= 100) {
|
|
2600
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2601
|
+
}
|
|
2602
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2603
|
+
try {
|
|
2604
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2605
|
+
const message = createBaseGraphNodeProjectionDefinition_FromEntry();
|
|
2606
|
+
while (reader.pos < end) {
|
|
2607
|
+
const tag = reader.uint32();
|
|
2608
|
+
switch (tag >>> 3) {
|
|
2609
|
+
case 1: {
|
|
2610
|
+
if (tag !== 10) {
|
|
2611
|
+
break;
|
|
2612
|
+
}
|
|
2613
|
+
message.key = reader.string();
|
|
2614
|
+
continue;
|
|
2615
|
+
}
|
|
2616
|
+
case 2: {
|
|
2617
|
+
if (tag !== 18) {
|
|
2618
|
+
break;
|
|
2619
|
+
}
|
|
2620
|
+
message.value = GraphNodeFromDefinition.decode(reader, reader.uint32());
|
|
2621
|
+
continue;
|
|
2622
|
+
}
|
|
2623
|
+
}
|
|
2624
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2625
|
+
break;
|
|
2626
|
+
}
|
|
2627
|
+
reader.skip(tag & 7);
|
|
2628
|
+
}
|
|
2629
|
+
return message;
|
|
2630
|
+
}
|
|
2631
|
+
finally {
|
|
2632
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2633
|
+
}
|
|
2634
|
+
},
|
|
2635
|
+
fromJSON(object) {
|
|
2636
|
+
return {
|
|
2637
|
+
key: isSet(object.key) ? globalThis.String(object.key) : "",
|
|
2638
|
+
value: isSet(object.value) ? GraphNodeFromDefinition.fromJSON(object.value) : undefined,
|
|
2639
|
+
};
|
|
2640
|
+
},
|
|
2641
|
+
toJSON(message) {
|
|
2642
|
+
const obj = {};
|
|
2643
|
+
if (message.key !== "") {
|
|
2644
|
+
obj.key = message.key;
|
|
2645
|
+
}
|
|
2646
|
+
if (message.value !== undefined) {
|
|
2647
|
+
obj.value = GraphNodeFromDefinition.toJSON(message.value);
|
|
2648
|
+
}
|
|
2649
|
+
return obj;
|
|
2650
|
+
},
|
|
2651
|
+
create(base) {
|
|
2652
|
+
return GraphNodeProjectionDefinition_FromEntry.fromPartial(base ?? {});
|
|
2653
|
+
},
|
|
2654
|
+
fromPartial(object) {
|
|
2655
|
+
const message = createBaseGraphNodeProjectionDefinition_FromEntry();
|
|
2656
|
+
message.key = object.key ?? "";
|
|
2657
|
+
message.value = (object.value !== undefined && object.value !== null)
|
|
2658
|
+
? GraphNodeFromDefinition.fromPartial(object.value)
|
|
2659
|
+
: undefined;
|
|
2660
|
+
return message;
|
|
2661
|
+
},
|
|
2662
|
+
};
|
|
2663
|
+
function createBaseGraphNodeProjectionDefinition_RemovedWithEntry() {
|
|
2664
|
+
return { key: "", value: undefined };
|
|
2665
|
+
}
|
|
2666
|
+
const GraphNodeProjectionDefinition_RemovedWithEntry = {
|
|
2667
|
+
encode(message, writer = new BinaryWriter()) {
|
|
2668
|
+
if (message.key !== "") {
|
|
2669
|
+
writer.uint32(10).string(message.key);
|
|
2670
|
+
}
|
|
2671
|
+
if (message.value !== undefined) {
|
|
2672
|
+
GraphNodeRemovedWithDefinition.encode(message.value, writer.uint32(18).fork()).join();
|
|
2673
|
+
}
|
|
2674
|
+
return writer;
|
|
2675
|
+
},
|
|
2676
|
+
decode(input, length) {
|
|
2677
|
+
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2678
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2679
|
+
if (previousRecursionDepth >= 100) {
|
|
2680
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2681
|
+
}
|
|
2682
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2683
|
+
try {
|
|
2684
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2685
|
+
const message = createBaseGraphNodeProjectionDefinition_RemovedWithEntry();
|
|
2686
|
+
while (reader.pos < end) {
|
|
2687
|
+
const tag = reader.uint32();
|
|
2688
|
+
switch (tag >>> 3) {
|
|
2689
|
+
case 1: {
|
|
2690
|
+
if (tag !== 10) {
|
|
2691
|
+
break;
|
|
2692
|
+
}
|
|
2693
|
+
message.key = reader.string();
|
|
2694
|
+
continue;
|
|
2695
|
+
}
|
|
2696
|
+
case 2: {
|
|
2697
|
+
if (tag !== 18) {
|
|
2698
|
+
break;
|
|
2699
|
+
}
|
|
2700
|
+
message.value = GraphNodeRemovedWithDefinition.decode(reader, reader.uint32());
|
|
2701
|
+
continue;
|
|
2702
|
+
}
|
|
2703
|
+
}
|
|
2704
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2705
|
+
break;
|
|
2706
|
+
}
|
|
2707
|
+
reader.skip(tag & 7);
|
|
2708
|
+
}
|
|
2709
|
+
return message;
|
|
2710
|
+
}
|
|
2711
|
+
finally {
|
|
2712
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2713
|
+
}
|
|
2714
|
+
},
|
|
2715
|
+
fromJSON(object) {
|
|
2716
|
+
return {
|
|
2717
|
+
key: isSet(object.key) ? globalThis.String(object.key) : "",
|
|
2718
|
+
value: isSet(object.value) ? GraphNodeRemovedWithDefinition.fromJSON(object.value) : undefined,
|
|
2719
|
+
};
|
|
2720
|
+
},
|
|
2721
|
+
toJSON(message) {
|
|
2722
|
+
const obj = {};
|
|
2723
|
+
if (message.key !== "") {
|
|
2724
|
+
obj.key = message.key;
|
|
2725
|
+
}
|
|
2726
|
+
if (message.value !== undefined) {
|
|
2727
|
+
obj.value = GraphNodeRemovedWithDefinition.toJSON(message.value);
|
|
2728
|
+
}
|
|
2729
|
+
return obj;
|
|
2730
|
+
},
|
|
2731
|
+
create(base) {
|
|
2732
|
+
return GraphNodeProjectionDefinition_RemovedWithEntry.fromPartial(base ?? {});
|
|
2733
|
+
},
|
|
2734
|
+
fromPartial(object) {
|
|
2735
|
+
const message = createBaseGraphNodeProjectionDefinition_RemovedWithEntry();
|
|
2736
|
+
message.key = object.key ?? "";
|
|
2737
|
+
message.value = (object.value !== undefined && object.value !== null)
|
|
2738
|
+
? GraphNodeRemovedWithDefinition.fromPartial(object.value)
|
|
2739
|
+
: undefined;
|
|
2740
|
+
return message;
|
|
2741
|
+
},
|
|
2742
|
+
};
|
|
2743
|
+
function createBaseGraphNodeRemovedWithDefinition() {
|
|
2744
|
+
return { Key: "", Detach: false };
|
|
2745
|
+
}
|
|
2746
|
+
const GraphNodeRemovedWithDefinition = {
|
|
2747
|
+
encode(message, writer = new BinaryWriter()) {
|
|
2748
|
+
if (message.Key !== "") {
|
|
2749
|
+
writer.uint32(10).string(message.Key);
|
|
2750
|
+
}
|
|
2751
|
+
if (message.Detach !== false) {
|
|
2752
|
+
writer.uint32(16).bool(message.Detach);
|
|
2753
|
+
}
|
|
2754
|
+
return writer;
|
|
2755
|
+
},
|
|
2756
|
+
decode(input, length) {
|
|
2757
|
+
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2758
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2759
|
+
if (previousRecursionDepth >= 100) {
|
|
2760
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2761
|
+
}
|
|
2762
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2763
|
+
try {
|
|
2764
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2765
|
+
const message = createBaseGraphNodeRemovedWithDefinition();
|
|
2766
|
+
while (reader.pos < end) {
|
|
2767
|
+
const tag = reader.uint32();
|
|
2768
|
+
switch (tag >>> 3) {
|
|
2769
|
+
case 1: {
|
|
2770
|
+
if (tag !== 10) {
|
|
2771
|
+
break;
|
|
2772
|
+
}
|
|
2773
|
+
message.Key = reader.string();
|
|
2774
|
+
continue;
|
|
2775
|
+
}
|
|
2776
|
+
case 2: {
|
|
2777
|
+
if (tag !== 16) {
|
|
2778
|
+
break;
|
|
2779
|
+
}
|
|
2780
|
+
message.Detach = reader.bool();
|
|
2781
|
+
continue;
|
|
2782
|
+
}
|
|
2783
|
+
}
|
|
2784
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2785
|
+
break;
|
|
2786
|
+
}
|
|
2787
|
+
reader.skip(tag & 7);
|
|
2788
|
+
}
|
|
2789
|
+
return message;
|
|
2790
|
+
}
|
|
2791
|
+
finally {
|
|
2792
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2793
|
+
}
|
|
2794
|
+
},
|
|
2795
|
+
fromJSON(object) {
|
|
2796
|
+
return {
|
|
2797
|
+
Key: isSet(object.Key) ? globalThis.String(object.Key) : "",
|
|
2798
|
+
Detach: isSet(object.Detach) ? globalThis.Boolean(object.Detach) : false,
|
|
2799
|
+
};
|
|
2800
|
+
},
|
|
2801
|
+
toJSON(message) {
|
|
2802
|
+
const obj = {};
|
|
2803
|
+
if (message.Key !== "") {
|
|
2804
|
+
obj.Key = message.Key;
|
|
2805
|
+
}
|
|
2806
|
+
if (message.Detach !== false) {
|
|
2807
|
+
obj.Detach = message.Detach;
|
|
2808
|
+
}
|
|
2809
|
+
return obj;
|
|
2810
|
+
},
|
|
2811
|
+
create(base) {
|
|
2812
|
+
return GraphNodeRemovedWithDefinition.fromPartial(base ?? {});
|
|
2813
|
+
},
|
|
2814
|
+
fromPartial(object) {
|
|
2815
|
+
const message = createBaseGraphNodeRemovedWithDefinition();
|
|
2816
|
+
message.Key = object.Key ?? "";
|
|
2817
|
+
message.Detach = object.Detach ?? false;
|
|
2818
|
+
return message;
|
|
2819
|
+
},
|
|
2820
|
+
};
|
|
2821
|
+
function createBaseGraphProjectionDefinition() {
|
|
2822
|
+
return { Nodes: {}, Edges: {} };
|
|
2823
|
+
}
|
|
2824
|
+
const GraphProjectionDefinition = {
|
|
2825
|
+
encode(message, writer = new BinaryWriter()) {
|
|
2826
|
+
globalThis.Object.entries(message.Nodes).forEach(([key, value]) => {
|
|
2827
|
+
GraphProjectionDefinition_NodesEntry.encode({ key: key, value }, writer.uint32(10).fork()).join();
|
|
2828
|
+
});
|
|
2829
|
+
globalThis.Object.entries(message.Edges).forEach(([key, value]) => {
|
|
2830
|
+
GraphProjectionDefinition_EdgesEntry.encode({ key: key, value }, writer.uint32(18).fork()).join();
|
|
2831
|
+
});
|
|
2832
|
+
return writer;
|
|
2833
|
+
},
|
|
2834
|
+
decode(input, length) {
|
|
2835
|
+
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2836
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2837
|
+
if (previousRecursionDepth >= 100) {
|
|
2838
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2839
|
+
}
|
|
2840
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2841
|
+
try {
|
|
2842
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2843
|
+
const message = createBaseGraphProjectionDefinition();
|
|
2844
|
+
while (reader.pos < end) {
|
|
2845
|
+
const tag = reader.uint32();
|
|
2846
|
+
switch (tag >>> 3) {
|
|
2847
|
+
case 1: {
|
|
2848
|
+
if (tag !== 10) {
|
|
2849
|
+
break;
|
|
2850
|
+
}
|
|
2851
|
+
const entry1 = GraphProjectionDefinition_NodesEntry.decode(reader, reader.uint32());
|
|
2852
|
+
if (entry1.value !== undefined) {
|
|
2853
|
+
message.Nodes[entry1.key] = entry1.value;
|
|
2854
|
+
}
|
|
2855
|
+
continue;
|
|
2856
|
+
}
|
|
2857
|
+
case 2: {
|
|
2858
|
+
if (tag !== 18) {
|
|
2859
|
+
break;
|
|
2860
|
+
}
|
|
2861
|
+
const entry2 = GraphProjectionDefinition_EdgesEntry.decode(reader, reader.uint32());
|
|
2862
|
+
if (entry2.value !== undefined) {
|
|
2863
|
+
message.Edges[entry2.key] = entry2.value;
|
|
2864
|
+
}
|
|
2865
|
+
continue;
|
|
2866
|
+
}
|
|
2867
|
+
}
|
|
2868
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2869
|
+
break;
|
|
2870
|
+
}
|
|
2871
|
+
reader.skip(tag & 7);
|
|
2872
|
+
}
|
|
2873
|
+
return message;
|
|
2874
|
+
}
|
|
2875
|
+
finally {
|
|
2876
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2877
|
+
}
|
|
2878
|
+
},
|
|
2879
|
+
fromJSON(object) {
|
|
2880
|
+
return {
|
|
2881
|
+
Nodes: isObject(object.Nodes)
|
|
2882
|
+
? globalThis.Object.entries(object.Nodes).reduce((acc, [key, value]) => {
|
|
2883
|
+
globalThis.Object.defineProperty(acc, key, {
|
|
2884
|
+
value: GraphNodeProjectionDefinition.fromJSON(value),
|
|
2885
|
+
enumerable: true,
|
|
2886
|
+
configurable: true,
|
|
2887
|
+
writable: true,
|
|
2888
|
+
});
|
|
2889
|
+
return acc;
|
|
2890
|
+
}, {})
|
|
2891
|
+
: {},
|
|
2892
|
+
Edges: isObject(object.Edges)
|
|
2893
|
+
? globalThis.Object.entries(object.Edges).reduce((acc, [key, value]) => {
|
|
2894
|
+
globalThis.Object.defineProperty(acc, key, {
|
|
2895
|
+
value: GraphEdgeProjectionDefinition.fromJSON(value),
|
|
2896
|
+
enumerable: true,
|
|
2897
|
+
configurable: true,
|
|
2898
|
+
writable: true,
|
|
2899
|
+
});
|
|
2900
|
+
return acc;
|
|
2901
|
+
}, {})
|
|
2902
|
+
: {},
|
|
2903
|
+
};
|
|
2904
|
+
},
|
|
2905
|
+
toJSON(message) {
|
|
2906
|
+
const obj = {};
|
|
2907
|
+
if (message.Nodes) {
|
|
2908
|
+
const entries = globalThis.Object.entries(message.Nodes);
|
|
2909
|
+
if (entries.length > 0) {
|
|
2910
|
+
obj.Nodes = {};
|
|
2911
|
+
entries.forEach(([k, v]) => {
|
|
2912
|
+
obj.Nodes[k] = GraphNodeProjectionDefinition.toJSON(v);
|
|
2913
|
+
});
|
|
2914
|
+
}
|
|
2915
|
+
}
|
|
2916
|
+
if (message.Edges) {
|
|
2917
|
+
const entries = globalThis.Object.entries(message.Edges);
|
|
2918
|
+
if (entries.length > 0) {
|
|
2919
|
+
obj.Edges = {};
|
|
2920
|
+
entries.forEach(([k, v]) => {
|
|
2921
|
+
obj.Edges[k] = GraphEdgeProjectionDefinition.toJSON(v);
|
|
2922
|
+
});
|
|
2923
|
+
}
|
|
2924
|
+
}
|
|
2925
|
+
return obj;
|
|
2926
|
+
},
|
|
2927
|
+
create(base) {
|
|
2928
|
+
return GraphProjectionDefinition.fromPartial(base ?? {});
|
|
2929
|
+
},
|
|
2930
|
+
fromPartial(object) {
|
|
2931
|
+
const message = createBaseGraphProjectionDefinition();
|
|
2932
|
+
message.Nodes = globalThis.Object.entries(object.Nodes ?? {}).reduce((acc, [key, value]) => {
|
|
2933
|
+
if (value !== undefined) {
|
|
2934
|
+
acc[key] = GraphNodeProjectionDefinition.fromPartial(value);
|
|
2935
|
+
}
|
|
2936
|
+
return acc;
|
|
2937
|
+
}, {});
|
|
2938
|
+
message.Edges = globalThis.Object.entries(object.Edges ?? {}).reduce((acc, [key, value]) => {
|
|
2939
|
+
if (value !== undefined) {
|
|
2940
|
+
acc[key] = GraphEdgeProjectionDefinition.fromPartial(value);
|
|
2941
|
+
}
|
|
2942
|
+
return acc;
|
|
2943
|
+
}, {});
|
|
2944
|
+
return message;
|
|
2945
|
+
},
|
|
2946
|
+
};
|
|
2947
|
+
function createBaseGraphProjectionDefinition_NodesEntry() {
|
|
2948
|
+
return { key: "", value: undefined };
|
|
2949
|
+
}
|
|
2950
|
+
const GraphProjectionDefinition_NodesEntry = {
|
|
2951
|
+
encode(message, writer = new BinaryWriter()) {
|
|
2952
|
+
if (message.key !== "") {
|
|
2953
|
+
writer.uint32(10).string(message.key);
|
|
2954
|
+
}
|
|
2955
|
+
if (message.value !== undefined) {
|
|
2956
|
+
GraphNodeProjectionDefinition.encode(message.value, writer.uint32(18).fork()).join();
|
|
2957
|
+
}
|
|
2958
|
+
return writer;
|
|
2959
|
+
},
|
|
2960
|
+
decode(input, length) {
|
|
2961
|
+
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2962
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2963
|
+
if (previousRecursionDepth >= 100) {
|
|
2964
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2965
|
+
}
|
|
2966
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2967
|
+
try {
|
|
2968
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2969
|
+
const message = createBaseGraphProjectionDefinition_NodesEntry();
|
|
2970
|
+
while (reader.pos < end) {
|
|
2971
|
+
const tag = reader.uint32();
|
|
2972
|
+
switch (tag >>> 3) {
|
|
2973
|
+
case 1: {
|
|
2974
|
+
if (tag !== 10) {
|
|
2975
|
+
break;
|
|
2976
|
+
}
|
|
2977
|
+
message.key = reader.string();
|
|
2978
|
+
continue;
|
|
2979
|
+
}
|
|
2980
|
+
case 2: {
|
|
2981
|
+
if (tag !== 18) {
|
|
2982
|
+
break;
|
|
2983
|
+
}
|
|
2984
|
+
message.value = GraphNodeProjectionDefinition.decode(reader, reader.uint32());
|
|
2985
|
+
continue;
|
|
2986
|
+
}
|
|
2987
|
+
}
|
|
2988
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2989
|
+
break;
|
|
2990
|
+
}
|
|
2991
|
+
reader.skip(tag & 7);
|
|
2992
|
+
}
|
|
2993
|
+
return message;
|
|
2994
|
+
}
|
|
2995
|
+
finally {
|
|
2996
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2997
|
+
}
|
|
2998
|
+
},
|
|
2999
|
+
fromJSON(object) {
|
|
3000
|
+
return {
|
|
3001
|
+
key: isSet(object.key) ? globalThis.String(object.key) : "",
|
|
3002
|
+
value: isSet(object.value) ? GraphNodeProjectionDefinition.fromJSON(object.value) : undefined,
|
|
3003
|
+
};
|
|
3004
|
+
},
|
|
3005
|
+
toJSON(message) {
|
|
3006
|
+
const obj = {};
|
|
3007
|
+
if (message.key !== "") {
|
|
3008
|
+
obj.key = message.key;
|
|
3009
|
+
}
|
|
3010
|
+
if (message.value !== undefined) {
|
|
3011
|
+
obj.value = GraphNodeProjectionDefinition.toJSON(message.value);
|
|
3012
|
+
}
|
|
3013
|
+
return obj;
|
|
3014
|
+
},
|
|
3015
|
+
create(base) {
|
|
3016
|
+
return GraphProjectionDefinition_NodesEntry.fromPartial(base ?? {});
|
|
3017
|
+
},
|
|
3018
|
+
fromPartial(object) {
|
|
3019
|
+
const message = createBaseGraphProjectionDefinition_NodesEntry();
|
|
3020
|
+
message.key = object.key ?? "";
|
|
3021
|
+
message.value = (object.value !== undefined && object.value !== null)
|
|
3022
|
+
? GraphNodeProjectionDefinition.fromPartial(object.value)
|
|
3023
|
+
: undefined;
|
|
3024
|
+
return message;
|
|
3025
|
+
},
|
|
3026
|
+
};
|
|
3027
|
+
function createBaseGraphProjectionDefinition_EdgesEntry() {
|
|
3028
|
+
return { key: "", value: undefined };
|
|
3029
|
+
}
|
|
3030
|
+
const GraphProjectionDefinition_EdgesEntry = {
|
|
3031
|
+
encode(message, writer = new BinaryWriter()) {
|
|
3032
|
+
if (message.key !== "") {
|
|
3033
|
+
writer.uint32(10).string(message.key);
|
|
3034
|
+
}
|
|
3035
|
+
if (message.value !== undefined) {
|
|
3036
|
+
GraphEdgeProjectionDefinition.encode(message.value, writer.uint32(18).fork()).join();
|
|
3037
|
+
}
|
|
3038
|
+
return writer;
|
|
3039
|
+
},
|
|
3040
|
+
decode(input, length) {
|
|
3041
|
+
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3042
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
3043
|
+
if (previousRecursionDepth >= 100) {
|
|
3044
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
3045
|
+
}
|
|
3046
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
3047
|
+
try {
|
|
3048
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
3049
|
+
const message = createBaseGraphProjectionDefinition_EdgesEntry();
|
|
3050
|
+
while (reader.pos < end) {
|
|
3051
|
+
const tag = reader.uint32();
|
|
3052
|
+
switch (tag >>> 3) {
|
|
3053
|
+
case 1: {
|
|
3054
|
+
if (tag !== 10) {
|
|
3055
|
+
break;
|
|
3056
|
+
}
|
|
3057
|
+
message.key = reader.string();
|
|
3058
|
+
continue;
|
|
3059
|
+
}
|
|
3060
|
+
case 2: {
|
|
3061
|
+
if (tag !== 18) {
|
|
3062
|
+
break;
|
|
3063
|
+
}
|
|
3064
|
+
message.value = GraphEdgeProjectionDefinition.decode(reader, reader.uint32());
|
|
3065
|
+
continue;
|
|
3066
|
+
}
|
|
3067
|
+
}
|
|
3068
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
3069
|
+
break;
|
|
3070
|
+
}
|
|
3071
|
+
reader.skip(tag & 7);
|
|
3072
|
+
}
|
|
3073
|
+
return message;
|
|
3074
|
+
}
|
|
3075
|
+
finally {
|
|
3076
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3077
|
+
}
|
|
3078
|
+
},
|
|
3079
|
+
fromJSON(object) {
|
|
3080
|
+
return {
|
|
3081
|
+
key: isSet(object.key) ? globalThis.String(object.key) : "",
|
|
3082
|
+
value: isSet(object.value) ? GraphEdgeProjectionDefinition.fromJSON(object.value) : undefined,
|
|
3083
|
+
};
|
|
3084
|
+
},
|
|
3085
|
+
toJSON(message) {
|
|
3086
|
+
const obj = {};
|
|
3087
|
+
if (message.key !== "") {
|
|
3088
|
+
obj.key = message.key;
|
|
3089
|
+
}
|
|
3090
|
+
if (message.value !== undefined) {
|
|
3091
|
+
obj.value = GraphEdgeProjectionDefinition.toJSON(message.value);
|
|
3092
|
+
}
|
|
3093
|
+
return obj;
|
|
3094
|
+
},
|
|
3095
|
+
create(base) {
|
|
3096
|
+
return GraphProjectionDefinition_EdgesEntry.fromPartial(base ?? {});
|
|
3097
|
+
},
|
|
3098
|
+
fromPartial(object) {
|
|
3099
|
+
const message = createBaseGraphProjectionDefinition_EdgesEntry();
|
|
3100
|
+
message.key = object.key ?? "";
|
|
3101
|
+
message.value = (object.value !== undefined && object.value !== null)
|
|
3102
|
+
? GraphEdgeProjectionDefinition.fromPartial(object.value)
|
|
3103
|
+
: undefined;
|
|
3104
|
+
return message;
|
|
3105
|
+
},
|
|
3106
|
+
};
|
|
1669
3107
|
function createBaseIEnumerableProjectionDefinition() {
|
|
1670
3108
|
return { items: [] };
|
|
1671
3109
|
}
|
|
@@ -2874,6 +4312,7 @@ function createBaseProjectionDefinition() {
|
|
|
2874
4312
|
SubscribesToAllEvents: false,
|
|
2875
4313
|
NoAutoMapProperties: [],
|
|
2876
4314
|
GenerationDelivery: 0,
|
|
4315
|
+
Graph: undefined,
|
|
2877
4316
|
};
|
|
2878
4317
|
}
|
|
2879
4318
|
const ProjectionDefinition = {
|
|
@@ -2941,6 +4380,9 @@ const ProjectionDefinition = {
|
|
|
2941
4380
|
if (message.GenerationDelivery !== 0) {
|
|
2942
4381
|
writer.uint32(168).int32(message.GenerationDelivery);
|
|
2943
4382
|
}
|
|
4383
|
+
if (message.Graph !== undefined) {
|
|
4384
|
+
GraphProjectionDefinition.encode(message.Graph, writer.uint32(178).fork()).join();
|
|
4385
|
+
}
|
|
2944
4386
|
return writer;
|
|
2945
4387
|
},
|
|
2946
4388
|
decode(input, length) {
|
|
@@ -3109,6 +4551,13 @@ const ProjectionDefinition = {
|
|
|
3109
4551
|
message.GenerationDelivery = reader.int32();
|
|
3110
4552
|
continue;
|
|
3111
4553
|
}
|
|
4554
|
+
case 22: {
|
|
4555
|
+
if (tag !== 178) {
|
|
4556
|
+
break;
|
|
4557
|
+
}
|
|
4558
|
+
message.Graph = GraphProjectionDefinition.decode(reader, reader.uint32());
|
|
4559
|
+
continue;
|
|
4560
|
+
}
|
|
3112
4561
|
}
|
|
3113
4562
|
if ((tag & 7) === 4 || tag === 0) {
|
|
3114
4563
|
break;
|
|
@@ -3182,6 +4631,7 @@ const ProjectionDefinition = {
|
|
|
3182
4631
|
GenerationDelivery: isSet(object.GenerationDelivery)
|
|
3183
4632
|
? eventGenerationDeliveryFromJSON(object.GenerationDelivery)
|
|
3184
4633
|
: 0,
|
|
4634
|
+
Graph: isSet(object.Graph) ? GraphProjectionDefinition.fromJSON(object.Graph) : undefined,
|
|
3185
4635
|
};
|
|
3186
4636
|
},
|
|
3187
4637
|
toJSON(message) {
|
|
@@ -3261,6 +4711,9 @@ const ProjectionDefinition = {
|
|
|
3261
4711
|
if (message.GenerationDelivery !== 0) {
|
|
3262
4712
|
obj.GenerationDelivery = eventGenerationDeliveryToJSON(message.GenerationDelivery);
|
|
3263
4713
|
}
|
|
4714
|
+
if (message.Graph !== undefined) {
|
|
4715
|
+
obj.Graph = GraphProjectionDefinition.toJSON(message.Graph);
|
|
4716
|
+
}
|
|
3264
4717
|
return obj;
|
|
3265
4718
|
},
|
|
3266
4719
|
create(base) {
|
|
@@ -3307,6 +4760,9 @@ const ProjectionDefinition = {
|
|
|
3307
4760
|
message.SubscribesToAllEvents = object.SubscribesToAllEvents ?? false;
|
|
3308
4761
|
message.NoAutoMapProperties = object.NoAutoMapProperties?.map((e) => e) || [];
|
|
3309
4762
|
message.GenerationDelivery = object.GenerationDelivery ?? 0;
|
|
4763
|
+
message.Graph = (object.Graph !== undefined && object.Graph !== null)
|
|
4764
|
+
? GraphProjectionDefinition.fromPartial(object.Graph)
|
|
4765
|
+
: undefined;
|
|
3310
4766
|
return message;
|
|
3311
4767
|
},
|
|
3312
4768
|
};
|
|
@@ -4661,5 +6117,5 @@ function isSet(value) {
|
|
|
4661
6117
|
return value !== null && value !== undefined;
|
|
4662
6118
|
}
|
|
4663
6119
|
|
|
4664
|
-
export { AutoMap, ChildrenDefinition, ChildrenDefinition_ChildrenEntry, ChildrenDefinition_NestedEntry, DraftReadModelDefinition, EventGenerationDelivery, EventSequenceSinkConfiguration, EventType, FromDefinition, FromDefinition_PropertiesEntry, FromDerivativesDefinition, FromEventPropertyDefinition, FromEveryDefinition, FromEveryDefinition_PropertiesEntry, GetAllDeclarationsRequest, GetAllDefinitionsRequest, IEnumerableProjectionDefinition, IEnumerableProjectionWithDeclaration, IndexDefinition, IndexProperty, JoinDefinition, JoinDefinition_PropertiesEntry, KeyValuePairEventTypeFromDefinition, KeyValuePairEventTypeJoinDefinition, KeyValuePairEventTypeRemovedWithDefinition, KeyValuePairEventTypeRemovedWithJoinDefinition, OneOfProjectionPreviewProjectionDeclarationParsingErrors, PreviewProjectionRequest, ProjectionDeclarationParsingErrors, ProjectionDeclarationSyntaxError, ProjectionDefinition, ProjectionDefinition_ChildrenEntry, ProjectionDefinition_NestedEntry, ProjectionOwner, ProjectionPreview, ProjectionWithDeclaration, ProjectionsDefinition, ReadModelDefinition, ReadModelObserverType, ReadModelOwner, ReadModelSource, ReadModelType, RegisterRequest, RemovedWithDefinition, RemovedWithJoinDefinition, SaveProjectionRequest, SaveProjectionResult, SerializableDateTimeOffset, SinkDefinition, autoMapFromJSON, autoMapToJSON, eventGenerationDeliveryFromJSON, eventGenerationDeliveryToJSON, projectionOwnerFromJSON, projectionOwnerToJSON, readModelObserverTypeFromJSON, readModelObserverTypeToJSON, readModelOwnerFromJSON, readModelOwnerToJSON, readModelSourceFromJSON, readModelSourceToJSON };
|
|
6120
|
+
export { AutoMap, ChildrenDefinition, ChildrenDefinition_ChildrenEntry, ChildrenDefinition_NestedEntry, DraftReadModelDefinition, EventGenerationDelivery, EventSequenceSinkConfiguration, EventType, FromDefinition, FromDefinition_PropertiesEntry, FromDerivativesDefinition, FromEventPropertyDefinition, FromEveryDefinition, FromEveryDefinition_PropertiesEntry, GetAllDeclarationsRequest, GetAllDefinitionsRequest, GraphEdgeFromDefinition, GraphEdgeFromDefinition_PropertiesEntry, GraphEdgeProjectionDefinition, GraphEdgeProjectionDefinition_FromEntry, GraphEdgeProjectionDefinition_RemovedWithEntry, GraphEdgeRemovedWithDefinition, GraphNodeFromDefinition, GraphNodeFromDefinition_PropertiesEntry, GraphNodeProjectionDefinition, GraphNodeProjectionDefinition_FromEntry, GraphNodeProjectionDefinition_RemovedWithEntry, GraphNodeRemovedWithDefinition, GraphProjectionDefinition, GraphProjectionDefinition_EdgesEntry, GraphProjectionDefinition_NodesEntry, IEnumerableProjectionDefinition, IEnumerableProjectionWithDeclaration, IndexDefinition, IndexProperty, JoinDefinition, JoinDefinition_PropertiesEntry, KeyValuePairEventTypeFromDefinition, KeyValuePairEventTypeJoinDefinition, KeyValuePairEventTypeRemovedWithDefinition, KeyValuePairEventTypeRemovedWithJoinDefinition, OneOfProjectionPreviewProjectionDeclarationParsingErrors, PreviewProjectionRequest, ProjectionDeclarationParsingErrors, ProjectionDeclarationSyntaxError, ProjectionDefinition, ProjectionDefinition_ChildrenEntry, ProjectionDefinition_NestedEntry, ProjectionOwner, ProjectionPreview, ProjectionWithDeclaration, ProjectionsDefinition, ReadModelDefinition, ReadModelObserverType, ReadModelOwner, ReadModelSource, ReadModelType, RegisterRequest, RemovedWithDefinition, RemovedWithJoinDefinition, SaveProjectionRequest, SaveProjectionResult, SerializableDateTimeOffset, SinkDefinition, autoMapFromJSON, autoMapToJSON, eventGenerationDeliveryFromJSON, eventGenerationDeliveryToJSON, projectionOwnerFromJSON, projectionOwnerToJSON, readModelObserverTypeFromJSON, readModelObserverTypeToJSON, readModelOwnerFromJSON, readModelOwnerToJSON, readModelSourceFromJSON, readModelSourceToJSON };
|
|
4665
6121
|
//# sourceMappingURL=projections.js.map
|