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