LightJason - AgentSpeak(L++)
CEdgeListMultiple.java
Go to the documentation of this file.
1 /*
2  * @cond LICENSE
3  * ######################################################################################
4  * # LGPL License #
5  * # #
6  * # This file is part of the LightJason AgentSpeak(L++) #
7  * # Copyright (c) 2015-19, LightJason (info@lightjason.org) #
8  * # This program is free software: you can redistribute it and/or modify #
9  * # it under the terms of the GNU Lesser General Public License as #
10  * # published by the Free Software Foundation, either version 3 of the #
11  * # License, or (at your option) any later version. #
12  * # #
13  * # This program is distributed in the hope that it will be useful, #
14  * # but WITHOUT ANY WARRANTY; without even the implied warranty of #
15  * # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #
16  * # GNU Lesser General Public License for more details. #
17  * # #
18  * # You should have received a copy of the GNU Lesser General Public License #
19  * # along with this program. If not, see http://www.gnu.org/licenses/ #
20  * ######################################################################################
21  * @endcond
22  */
23 
24 package org.lightjason.agentspeak.action.builtin.graph;
25 
26 import edu.uci.ics.jung.graph.Graph;
29 
30 import javax.annotation.Nonnull;
31 import java.util.ArrayList;
32 import java.util.Collections;
33 import java.util.List;
34 
35 
44 public final class CEdgeListMultiple extends IApplyMultiple
45 {
49  private static final long serialVersionUID = -175626399205967595L;
50 
51  @Override
52  protected final int windowsize()
53  {
54  return 2;
55  }
56 
57  @Override
58  protected final void apply( final boolean p_parallel, @Nonnull final Graph<Object, Object> p_graph,
59  @Nonnull final List<ITerm> p_window, @Nonnull final List<ITerm> p_return )
60  {
61  final List<?> l_return = new ArrayList<>( p_graph.findEdgeSet( p_window.get( 0 ).raw(), p_window.get( 1 ) .raw() ) );
62 
63  p_return.add(
64  CRawTerm.from(
65  p_parallel
66  ? Collections.synchronizedList( l_return )
67  : l_return
68  )
69  );
70  }
71 }
final void apply(final boolean p_parallel, @Nonnull final Graph< Object, Object > p_graph, @Nonnull final List< ITerm > p_window, @Nonnull final List< ITerm > p_return)
returns all edges of all vertex tuples for a single graph instance.
static< N > CRawTerm< N > from(final N p_value)
factory for a raw term
Definition: CRawTerm.java:104
apply class for a single graph with multiple elements
term structure for simple datatypes
Definition: CRawTerm.java:45