|
2 | 2 | # deprecation staging area
|
3 | 3 | ##==============================================================================
|
4 | 4 |
|
| 5 | + |
5 | 6 | ##==============================================================================
|
6 |
| -## Remove in 0.7 |
| 7 | +## Remove in 0.8 |
7 | 8 | ##==============================================================================
|
8 | 9 |
|
9 |
| -Base.getproperty(x::DFGVariable,f::Symbol) = begin |
10 |
| - if f == :estimateDict |
11 |
| - @warn "estimateDict is deprecated, use ppeDict instead" |
12 |
| - getfield(x, :ppeDict) |
13 |
| - elseif f == :solvable |
14 |
| - getfield(x,:_dfgNodeParams).solvable |
15 |
| - elseif f == :_internalId |
16 |
| - getfield(x,:_dfgNodeParams)._internalId |
17 |
| - else |
18 |
| - getfield(x,f) |
19 |
| - end |
20 |
| - end |
| 10 | +#TODO alias or deprecate |
| 11 | +@deprecate getVariableIds(dfg::AbstractDFG, regexFilter::Union{Nothing, Regex}=nothing; tags::Vector{Symbol}=Symbol[], solvable::Int=0) listVariables(dfg, regexFilter, tags=tags, solvable=solvable) |
21 | 12 |
|
22 |
| -Base.setproperty!(x::DFGVariable,f::Symbol, val) = begin |
23 |
| - if f == :estimateDict |
24 |
| - error("estimateDict is deprecated, use ppeDict instead") |
25 |
| - elseif f == :solvable |
26 |
| - getfield(x,:_dfgNodeParams).solvable = val |
27 |
| - elseif f == :_internalId |
28 |
| - getfield(x,:_dfgNodeParams)._internalId = val |
29 |
| - else |
30 |
| - setfield!(x,f,val) |
31 |
| - end |
32 |
| - end |
| 13 | +@deprecate getFactorIds(dfg, regexFilter=nothing; solvable=0) listFactors(dfg, regexFilter, solvable=solvable) |
33 | 14 |
|
34 |
| -Base.getproperty(x::DFGVariableSummary,f::Symbol) = begin |
35 |
| - if f == :estimateDict |
36 |
| - @warn "estimateDict is deprecated, use ppeDict instead" |
37 |
| - getfield(x, :ppeDict) |
38 |
| - else |
39 |
| - getfield(x,f) |
40 |
| - end |
41 |
| - end |
| 15 | + |
| 16 | +export getLabelDict |
| 17 | +getLabelDict(dfg::AbstractDFG) = error("getLabelDict is deprecated, consider using listing functions") |
| 18 | + |
| 19 | +export getAdjacencyMatrix |
| 20 | +""" |
| 21 | + $(SIGNATURES) |
| 22 | +Get a matrix indicating relationships between variables and factors. Rows are |
| 23 | +all factors, columns are all variables, and each cell contains either nothing or |
| 24 | +the symbol of the relating factor. The first row and first column are factor and |
| 25 | +variable headings respectively. |
| 26 | +""" |
| 27 | +function getAdjacencyMatrix(dfg::AbstractDFG; solvable::Int=0)::Matrix{Union{Nothing, Symbol}} |
| 28 | + error("Deprecated function, please use getBiadjacencyMatrix") |
| 29 | +end |
| 30 | + |
| 31 | +@deprecate getAdjacencyMatrixSparse(dfg::AbstractDFG; solvable::Int=0) getBiadjacencyMatrix(dfg, solvable=solvable) |
42 | 32 |
|
43 | 33 |
|
44 | 34 | Base.getproperty(x::DFGFactor,f::Symbol) = begin
|
@@ -78,87 +68,30 @@ Base.setproperty!(x::DFGFactor,f::Symbol, val) = begin
|
78 | 68 | end
|
79 | 69 | end
|
80 | 70 |
|
81 |
| -Base.getproperty(x::GenericFunctionNodeData,f::Symbol) = begin |
82 |
| - f == :fncargvID && Base.depwarn("GenericFunctionNodeData field fncargvID will be deprecated, use `getVariableOrder` instead",:getproperty)#@warn "fncargvID is deprecated, use `getVariableOrder` instead" |
83 |
| - |
84 |
| - getfield(x, f) |
85 |
| - |
86 |
| -end |
87 |
| - |
88 |
| -Base.setproperty!(x::GenericFunctionNodeData,f::Symbol, val) = begin |
89 |
| - f == :fncargvID && Base.depwarn("GenericFunctionNodeData field fncargvID will be deprecated, use `getVariableOrder` instead",:getproperty)#@warn "fncargvID is deprecated, use `getVariableOrder` instead" |
90 |
| - |
91 |
| - setfield!(x,f,val) |
92 |
| - |
93 |
| -end |
94 |
| - |
95 |
| -# update is implied, see API wiki |
96 |
| -@deprecate mergeUpdateVariableSolverData!(dfg, sourceVariable) mergeVariableData!(dfg, sourceVariable) |
97 |
| -@deprecate mergeUpdateGraphSolverData!(sourceDFG, destDFG, varSyms) mergeGraphVariableData!(destDFG, sourceDFG, varSyms) |
98 |
| - |
99 |
| -#TODO alias or deprecate |
100 |
| -@deprecate getVariableIds(dfg::AbstractDFG, regexFilter::Union{Nothing, Regex}=nothing; tags::Vector{Symbol}=Symbol[], solvable::Int=0) listVariables(dfg, regexFilter, tags=tags, solvable=solvable) |
101 |
| - |
102 |
| -@deprecate getFactorIds(dfg, regexFilter=nothing; solvable=0) listFactors(dfg, regexFilter, solvable=solvable) |
103 |
| - |
104 |
| -#NOTE too many aliases on PPE |
105 |
| - |
106 |
| -@deprecate getVariablePPEs(v::VariableDataLevel1) getPPEDict(v) |
107 |
| - |
108 |
| -@deprecate getPPEs(vari::VariableDataLevel1) getPPEDict(v) |
109 |
| - |
110 |
| -@deprecate getVariablePPE(args...) getPPE(args...) |
111 |
| - |
112 |
| - |
113 |
| -#TODO doesn't look like this existed |
114 |
| -# @deprecate timestamp(v) getTimestamp(v) |
115 |
| - |
116 |
| -@deprecate setSolverParams(args...) setSolverParams!(args...) |
117 |
| - |
118 |
| -@deprecate setDescription(args...) setDescription!(args...) |
119 |
| - |
120 |
| -@deprecate getAdjacencyMatrixSparse(dfg::AbstractDFG; solvable::Int=0) getBiadjacencyMatrix(dfg, solvable=solvable) |
121 |
| - |
122 |
| -@deprecate solverData(f::DFGFactor) getSolverData(f) |
123 |
| - |
124 |
| -@deprecate solverData(v::DFGVariable, key::Symbol=:default) getSolverData(v, key) |
125 |
| - |
126 |
| -@deprecate solverDataDict(args...) getSolverDataDict(args...) |
127 |
| - |
128 |
| -@deprecate internalId(args...) getInternalId(args...) |
129 |
| - |
130 |
| -@deprecate pack(dfg::AbstractDFG, d::VariableNodeData) packVariableNodeData(dfg, d) |
131 |
| -@deprecate unpack(dfg::AbstractDFG, d::PackedVariableNodeData) unpackVariableNodeData(dfg, d) |
132 |
| - |
133 |
| -export getLabelDict |
134 |
| -getLabelDict(dfg::AbstractDFG) = error("getLabelDict is deprecated, consider using listing functions") |
135 |
| - |
136 |
| -export getAdjacencyMatrix |
137 |
| -""" |
138 |
| - $(SIGNATURES) |
139 |
| -Get a matrix indicating relationships between variables and factors. Rows are |
140 |
| -all factors, columns are all variables, and each cell contains either nothing or |
141 |
| -the symbol of the relating factor. The first row and first column are factor and |
142 |
| -variable headings respectively. |
143 |
| -""" |
144 |
| -function getAdjacencyMatrix(dfg::AbstractDFG; solvable::Int=0)::Matrix{Union{Nothing, Symbol}} |
145 |
| - error("Deprecated function, please use getBiadjacencyMatrix") |
146 |
| -end |
147 |
| - |
148 |
| - |
149 |
| -export buildSubgraphFromLabels |
150 |
| -function buildSubgraphFromLabels(dfg::G, |
151 |
| - syms::Vector{Symbol}; |
152 |
| - subfg::AbstractDFG=(G <: InMemoryDFGTypes ? G : GraphsDFG)(params=getSolverParams(dfg)), |
153 |
| - solvable::Int=0, |
154 |
| - allowedFactors::Union{Nothing, Vector{Symbol}}=nothing )::G where G <: AbstractDFG |
155 |
| - # |
156 |
| - @warn "Deprecated buildSubgraphFromLabels, use buildSubgraphFromLabels! instead." |
157 |
| - buildSubgraphFromLabels!(dfg, syms, subfg=subfg, solvable=solvable, allowedFactors=allowedFactors ) |
158 |
| -end |
| 71 | + Base.getproperty(x::DFGVariable,f::Symbol) = begin |
| 72 | + # if f == :estimateDict |
| 73 | + # @warn "estimateDict is deprecated, use ppeDict instead" |
| 74 | + # getfield(x, :ppeDict) |
| 75 | + if f == :solvable |
| 76 | + getfield(x,:_dfgNodeParams).solvable |
| 77 | + elseif f == :_internalId |
| 78 | + getfield(x,:_dfgNodeParams)._internalId |
| 79 | + else |
| 80 | + getfield(x,f) |
| 81 | + end |
| 82 | + end |
159 | 83 |
|
160 |
| -@deprecate sortVarNested(vars::Vector{Symbol}) sortDFG(vars) |
| 84 | + Base.setproperty!(x::DFGVariable,f::Symbol, val) = begin |
| 85 | + # if f == :estimateDict |
| 86 | + # error("estimateDict is deprecated, use ppeDict instead") |
| 87 | + if f == :solvable |
| 88 | + getfield(x,:_dfgNodeParams).solvable = val |
| 89 | + elseif f == :_internalId |
| 90 | + getfield(x,:_dfgNodeParams)._internalId = val |
| 91 | + else |
| 92 | + setfield!(x,f,val) |
| 93 | + end |
| 94 | + end |
161 | 95 |
|
162 | 96 |
|
163 |
| -#NOTE This one is still used in IIF so maybe leave a bit longer |
164 |
| -@deprecate getfnctype(args...) getFactorType(args...) |
| 97 | +# |
0 commit comments