00001 /* 00002 * ################################################################ 00003 * 00004 * ProActive: The Java(TM) library for Parallel, Distributed, 00005 * Concurrent computing with Security and Mobility 00006 * 00007 * Copyright (C) 1997-2007 INRIA/University of Nice-Sophia Antipolis 00008 * Contact: proactive@objectweb.org 00009 * 00010 * This library is free software; you can redistribute it and/or 00011 * modify it under the terms of the GNU Lesser General Public 00012 * License as published by the Free Software Foundation; either 00013 * version 2.1 of the License, or any later version. 00014 * 00015 * This library is distributed in the hope that it will be useful, 00016 * but WITHOUT ANY WARRANTY; without even the implied warranty of 00017 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00018 * Lesser General Public License for more details. 00019 * 00020 * You should have received a copy of the GNU Lesser General Public 00021 * License along with this library; if not, write to the Free Software 00022 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 00023 * USA 00024 * 00025 * Initial developer(s): The ProActive Team 00026 * http://www.inria.fr/oasis/ProActive/contacts.html 00027 * Contributor(s): 00028 * 00029 * ################################################################ 00030 */ 00031 package org.objectweb.proactive.calcium.skeletons; 00032 00033 import org.objectweb.proactive.calcium.Task; 00034 import org.objectweb.proactive.calcium.exceptions.EnvironmentException; 00035 import org.objectweb.proactive.calcium.interfaces.Conquer; 00036 import org.objectweb.proactive.calcium.interfaces.Divide; 00037 import org.objectweb.proactive.calcium.interfaces.Skeleton; 00038 00050 public class Map<T> extends DaC<T> { 00051 00052 public Map(Divide<T> div, Skeleton<T> child, Conquer<T> conq){ 00053 00054 super(div, null,child,conq); 00055 } 00056 00057 //Override parent method to avoid using the condition 00058 public Task<T> compute(Task<T> t) throws EnvironmentException { 00059 00060 //Split the task if not already splitted 00061 if(!t.hasFinishedChild()){ 00062 return divide(t); 00063 } 00064 00065 //else conquer the subtask 00066 return conquer(t); 00067 } 00068 00069 }
1.5.1