Package org.openbel.framework.common

Examples of org.openbel.framework.common.InvalidArgument

93
94
95
96
97
98
99
100
101
102
103
     * @throws InvalidArgument
     */
    public static Kam intersection(Kam kam1, Kam kam2) throws InvalidArgument {

        if (!kam1.getKamInfo().equals(kam2.getKamInfo())) {
            throw new InvalidArgument(
                    "Kam1 and Kam2 must reference the same kam in the KamStore");
        }
        List<KamEdge> kamEdges = new ArrayList<KamEdge>();

        // Check for edges in Kam1 that are also in Kam2
View Full Code Here
125
126
127
128
129
130
131
132
133
134
135
            throws InvalidArgument {

        // Make sure that all the edges in the edge list are associated with the Kam
        for (KamEdge kamEdge : kamEdges) {
            if (!kamEdge.getKam().getKamInfo().equals(kam.getKamInfo())) {
                throw new InvalidArgument(
                        "Kamedges do not reference the same Kam.");
            }
        }

        // Check for edges in Kam1 that are also in the list
View Full Code Here
155
156
157
158
159
160
161
162
163
164
165
            throws InvalidArgument {

        // Make sure that all the edges in the edge list are associated with the Kam
        for (KamEdge kamEdge : kamEdges) {
            if (!kamEdge.getKam().getKamInfo().equals(kam.getKamInfo())) {
                throw new InvalidArgument(
                        "Kamedges do not reference the same Kam.");
            }
        }

        // Create a new kam instance and add the edges
View Full Code Here
178
179
180
181
182
183
184
185
186
187
188
     * @throws InvalidArgument
     */
    public static Kam union(Kam kam1, Kam kam2) throws InvalidArgument {

        if (!kam1.getKamInfo().equals(kam2.getKamInfo())) {
            throw new InvalidArgument(
                    "Kam1 and Kam2 must reference the same kam in the KamStore");
        }
        Kam newKam = newInstance(kam1);
        newKam.union(kam1.getEdges());
        newKam.union(kam2.getEdges());
View Full Code Here
215
216
217
218
219
220
221
222
223
224
225
     * @throws InvalidArgument
     */
    public static Kam difference(Kam kam1, Kam kam2) throws InvalidArgument {

        if (!kam1.getKamInfo().equals(kam2.getKamInfo())) {
            throw new InvalidArgument(
                    "Kam1 and Kam2 must reference the same kam in the KamStore");
        }
        List<KamEdge> kamEdges = new ArrayList<KamEdge>();

        // First check for edges in Kam1 that are not in Kam2
View Full Code Here
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
     * {@inheritDoc}
     */
    @Override
    public SimplePath[] findPaths(KamNode source, KamNode target) {
        if (source == null) {
            throw new InvalidArgument("Source kam node cannot be null.");
        }

        if (target == null) {
            throw new InvalidArgument("Target kam node cannot be null.");
        }

        if (!kam.contains(source)) {
            throw new InvalidArgument("Source does not exist in KAM.");
        }

        if (!kam.contains(target)) {
            throw new InvalidArgument("Target does not exist in KAM.");
        }

        final Set<KamNode> targets = sizedHashSet(1);
        targets.add(target);

View Full Code Here
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
     * {@inheritDoc}
     */
    @Override
    public SimplePath[] findPaths(KamNode[] sources, KamNode[] targets) {
        if (sources == null || sources.length == 0) {
            throw new InvalidArgument(
                    "Source kam nodes cannot be null or empty.");
        }

        if (targets == null || targets.length == 0) {
            throw new InvalidArgument(
                    "Target kam nodes cannot be null or empty.");
        }

        for (final KamNode source : sources) {
            if (!kam.contains(source)) {
                throw new InvalidArgument("Source does not exist in KAM.");
            }
        }

        final Set<KamNode> targetSet = new HashSet<KamNode>(targets.length);
        for (final KamNode target : targets) {
            if (!kam.contains(target)) {
                throw new InvalidArgument("Target does not exist in KAM.");
            }

            targetSet.add(target);
        }

        final List<SimplePath> pathsFound = new ArrayList<SimplePath>();
        for (final KamNode source : sources) {
            if (!kam.contains(source)) {
                throw new InvalidArgument("Source does not exist in KAM.");
            }

            pathsFound.addAll(runDepthFirstSearch(kam, source, targetSet));
        }

View Full Code Here
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
     * {@inheritDoc}
     */
    @Override
    public SimplePath[] interconnect(KamNode[] sources) {
        if (sources == null || sources.length < 2) {
            throw new InvalidArgument(
                    "Source kam nodes cannot be null and must contain at least two source nodes.");
        }

        // build out target set, check that each node is in the KAM
        final Set<KamNode> targetSet = new HashSet<KamNode>(sources.length);
        for (int i = 0; i < sources.length; i++) {
            final KamNode source = sources[i];

            if (!kam.contains(source)) {
                throw new InvalidArgument("Source does not exist in KAM.");
            }

            targetSet.add(source);
        }

View Full Code Here
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
     * {@inheritDoc}
     */
    @Override
    public SimplePath[] scan(KamNode source) {
        if (source == null) {
            throw new InvalidArgument("Source kam node cannot be null.");
        }

        if (!kam.contains(source)) {
            throw new InvalidArgument("Source does not exist in KAM.");
        }

        final List<SimplePath> pathsFound = runDepthFirstScan(kam, source);
        return pathsFound.toArray(new SimplePath[pathsFound.size()]);
    }
View Full Code Here
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
     * {@inheritDoc}
     */
    @Override
    public SimplePath[] scan(KamNode[] sources) {
        if (sources == null || sources.length == 0) {
            throw new InvalidArgument(
                    "Source kam nodes cannot be null or empty.");
        }

        for (final KamNode source : sources) {
            if (!kam.contains(source)) {
                throw new InvalidArgument("Source does not exist in KAM.");
            }
        }

        final List<SimplePath> pathsFound = new ArrayList<SimplePath>();
        for (final KamNode source : sources) {
View Full Code Here
TOP

Related Classes of org.openbel.framework.common.InvalidArgument

  • org.openbel.framework.api.AbstractPathFinder
  • org.openbel.framework.api.BasicPathFinder
  • org.openbel.framework.api.DefaultKamCacheService
  • org.openbel.framework.api.Equivalencer
  • org.openbel.framework.api.internal.KAMCatalogDao
  • org.openbel.framework.api.internal.KAMStoreDaoImpl
  • org.openbel.framework.api.internal.KAMUpdateDaoImpl
  • org.openbel.framework.api.KamCacheService$LoadKAMResult
  • org.openbel.framework.api.KamImpl
  • org.openbel.framework.api.KAMStoreImpl
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.