Start line:  
End line:  

Snippet Preview

Snippet HTML Code

Stack Overflow Questions
 // Copyright (C) 2003  Rafael H. Bordini, Jomi F. Hubner, et al.
 // This library is free software; you can redistribute it and/or
 // modify it under the terms of the GNU Lesser General Public
 // License as published by the Free Software Foundation; either
 // version 2.1 of the License, or (at your option) any later version.
 // This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// Lesser General Public License for more details.
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
// To contact the authors:
package jason.stdlib;

Internal action: .intersection(S1,S2,S3).

Description: S3 is the intersection of the sets S1 and S2 (represented by lists). The result set is sorted.


  • + arg[0] (a list).
  • + arg[1] (a list).
  • +/- arg[2]: the result of the intersection.


  • .intersection("[a,b,c]","[b,e]",X): X unifies with "[b]".
  • .intersection("[a,b,a,c]","[f,e,a,c]",X): X unifies with "[a,c]".

public class intersection extends difference { // to inherit checkArgs
    private static InternalAction singleton = null;
    public static InternalAction create() {
        if ( == null
             = new intersection();
        return ;
    public Object execute(TransitionSystem tsUnifier unTerm[] argsthrows Exception {
        return un.unifies(args[2], ((ListTerm)args[0]).intersection( (ListTerm)args[1]) );
New to GrepCode? Check out our FAQ X