CFindEdgeSingle.java

  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. package org.lightjason.agentspeak.action.builtin.graph;

  24. import edu.uci.ics.jung.graph.Graph;
  25. import org.lightjason.agentspeak.language.CRawTerm;
  26. import org.lightjason.agentspeak.language.ITerm;

  27. import javax.annotation.Nonnull;
  28. import java.util.List;


  29. /**
  30.  * returns an edge between vertices for each graph instance.
  31.  * The action returns an edge between two vertices,
  32.  * the first two arguments are vertices, all other arguments
  33.  * are graphs, returning values are edges of each graph instance,
  34.  * the action never fails
  35.  *
  36.  * {@code [E1|E2|E3] = graph/findedgesingle( Vertex1, Vertex2, Graph1, Graph2, Graph3 );}
  37.  */
  38. public final class CFindEdgeSingle extends IApplySingle
  39. {
  40.     /**
  41.      * serial id
  42.      */
  43.     private static final long serialVersionUID = 7993867869271781718L;

  44.     @Override
  45.     protected final int skipsize()
  46.     {
  47.         return 2;
  48.     }

  49.     @Override
  50.     protected void apply( final boolean p_parallel, @Nonnull final Graph<Object, Object> p_graph,
  51.                           @Nonnull final List<ITerm> p_window, @Nonnull final List<ITerm> p_return )
  52.     {
  53.         p_return.add(
  54.             CRawTerm.from(
  55.                 p_graph.findEdge( p_window.get( 0 ).raw(), p_window.get( 1 ).raw() )
  56.             )
  57.         );
  58.     }
  59. }