@@ -0,0 +1,2256 @@
+/**%0A *  Copyright (c) 1999-2011, Ecole des Mines de Nantes%0A *  All rights reserved.%0A *  Redistribution and use in source and binary forms, with or without%0A *  modification, are permitted provided that the following conditions are met:%0A *%0A *      * Redistributions of source code must retain the above copyright%0A *        notice, this list of conditions and the following disclaimer.%0A *      * Redistributions in binary form must reproduce the above copyright%0A *        notice, this list of conditions and the following disclaimer in the%0A *        documentation and/or other materials provided with the distribution.%0A *      * Neither the name of the Ecole des Mines de Nantes nor the%0A *        names of its contributors may be used to endorse or promote products%0A *        derived from this software without specific prior written permission.%0A *%0A *  THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS %60%60AS IS'' AND ANY%0A *  EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED%0A *  WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE%0A *  DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY%0A *  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES%0A *  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;%0A *  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND%0A *  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT%0A *  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS%0A *  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.%0A */%0A%0A%0A/**%0A * @author Jean-Guillaume Fages%0A * @since 19/09/14%0A * Created by IntelliJ IDEA.%0A */%0Apackage solver.constraints.nary;%0A%0Aimport org.testng.annotations.Test;%0Aimport solver.Solver;%0Aimport solver.constraints.ICF;%0Aimport solver.search.loop.monitors.SMF;%0Aimport solver.variables.IntVar;%0Aimport solver.variables.VF;%0A%0Apublic class TreeTest %7B%0A%0A%09@Test(groups = %221s%22)%0A%09public void test1() %7B%0A%09%09Solver solver = new Solver();%0A%09%09IntVar%5B%5D VS = VF.enumeratedArray(%22VS%22, 4, 0, 4, solver);%0A%09%09IntVar NT = VF.enumerated(%22NT%22, 2, 3, solver);%0A%09%09solver.post(ICF.tree(VS, NT, 0));%0A%09%09SMF.log(solver, true, false);%0A%09%09solver.findAllSolutions();%0A%09%7D%0A%7D%0A

add test