LightJason - AgentSpeak(L++)
CSuccessorCountMultiple.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.List;
32 
33 
37 public final class CSuccessorCountMultiple extends IApplyMultiple
38 {
42  private static final long serialVersionUID = -3354752194496824469L;
43 
44  @Override
45  protected final int windowsize()
46  {
47  return 1;
48  }
49 
50  @Override
51  protected final void apply( final boolean p_parallel, @Nonnull final Graph<Object, Object> p_graph,
52  @Nonnull final List<ITerm> p_window, @Nonnull final List<ITerm> p_return )
53  {
54  p_return.add(
55  CRawTerm.from(
56  (double) p_graph.getSuccessorCount( p_window.get( 0 ).raw() )
57  )
58  );
59  }
60 }
returns the number of successors of each vertex of a single graph instance.
static< N > CRawTerm< N > from(final N p_value)
factory for a raw term
Definition: CRawTerm.java:104
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)
apply class for a single graph with multiple elements
term structure for simple datatypes
Definition: CRawTerm.java:45