📄 transformation.java
字号:
/*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
/**
* Title: XELOPES Data Mining Library
* Description: The XELOPES library is an open platform-independent and data-source-independent library for Embedded Data Mining.
* Copyright: Copyright (c) 2002 Prudential Systems Software GmbH
* Company: ZSoft (www.zsoft.ru), Prudsys (www.prudsys.com)
* @author Valentine Stepanenko (valentine.stepanenko@zsoft.ru)
* @version 1.0
*/
package com.prudsys.pdm.Cwm.Transformation;
import java.util.Collection;
import java.util.Iterator;
import com.prudsys.pdm.Cwm.Core.CWMTools;
import com.prudsys.pdm.Cwm.Core.Dependency;
import com.prudsys.pdm.Cwm.Core.Namespace;
import com.prudsys.pdm.Cwm.Core.ProcedureExpression;
/**
* This represents a transformation from a set of sources to a set of targets.
*
*
*
* If a model already exists for the object that performs the Transformation, then
* the model can be related to the Transformation via a TransformationUse
* dependency.
*/
public class Transformation extends Namespace implements org.omg.cwm.analysis.transformation.Transformation
{
/**
* Any code or script for the Transformation.
*/
public ProcedureExpression function;
/**
* A short description for any code or script performed by the Transformation.
*/
public com.prudsys.pdm.Cwm.Core.String functionDescription;
/**
* This Transformation is the primary transformation for the associated
* TransformationTask.
*/
public com.prudsys.pdm.Cwm.Core.Boolean isPrimary;
// public Dependency use;
public Dependency use[]; // manually corrected by M. Thess, 26.12.2003
public DataObjectSet source[];
public DataObjectSet target[];
public TransformationTask task[];
public Transformation()
{
}
public java.lang.String getFunctionDescription() {
return functionDescription.getString();
}
public void setFunctionDescription(java.lang.String functionDescription) {
com.prudsys.pdm.Cwm.Core.String s = new com.prudsys.pdm.Cwm.Core.String();
s.setString(functionDescription);
this.functionDescription = s;
}
public org.omg.cwm.objectmodel.core.ProcedureExpression getFunction() {
return function;
}
public void setFunction(org.omg.cwm.objectmodel.core.ProcedureExpression function) {
this.function = (ProcedureExpression) function;
}
public java.lang.Boolean getIsPrimary() {
return isPrimary.getBoolean();
}
public void setIsPrimary(java.lang.Boolean isPrimary) {
com.prudsys.pdm.Cwm.Core.Boolean b = new com.prudsys.pdm.Cwm.Core.Boolean();
b.setBoolean(isPrimary);
this.isPrimary = b;
}
public boolean isPrimaryValue() {
return isPrimary.isBooleanValue();
}
public void setIsPrimary(boolean input) {
setIsPrimary( new java.lang.Boolean(input) );
}
public Collection getSource() {
return CWMTools.ArrayToList(source);
}
public void setSource(Collection source) {
this.source = new DataObjectSet[ source.size() ];
Iterator it = source.iterator();
for (int i = 0; i < source.size(); i++)
this.source[i] = (DataObjectSet) it.next();
}
public void addSource( org.omg.cwm.analysis.transformation.DataObjectSet input) {
int size = (source == null) ? 0 : source.length;
DataObjectSet[] oldData = source;
source = new DataObjectSet[size+1];
if (size > 0) System.arraycopy(oldData, 0, source, 0, size);
source[size] = (DataObjectSet) input;
}
public void removeSource( org.omg.cwm.analysis.transformation.DataObjectSet input) {
int size = (source == null) ? 0 : source.length;
if (size == 0)
return;
int ipos = -1;
for (int i = 0; i < size; i++)
if (source[i].equals(input)) {
ipos = i;
break;
}
if (ipos == -1)
return;
DataObjectSet[] oldData = source;
source = new DataObjectSet[size-1];
for (int i = 0; i < ipos; i++)
source[i] = oldData[i];
for (int i = ipos+1; i < size; i++)
source[i-1] = oldData[i];
}
public Collection getTarget() {
return CWMTools.ArrayToList(target);
}
public void setTarget(Collection target) {
this.target = new DataObjectSet[ target.size() ];
Iterator it = target.iterator();
for (int i = 0; i < target.size(); i++)
this.target[i] = (DataObjectSet) it.next();
}
public void addTarget( org.omg.cwm.analysis.transformation.DataObjectSet input) {
int size = (target == null) ? 0 : target.length;
DataObjectSet[] oldData = target;
target = new DataObjectSet[size+1];
if (size > 0) System.arraycopy(oldData, 0, target, 0, size);
target[size] = (DataObjectSet) input;
}
public void removeTarget( org.omg.cwm.analysis.transformation.DataObjectSet input) {
int size = (target == null) ? 0 : target.length;
if (size == 0)
return;
int ipos = -1;
for (int i = 0; i < size; i++)
if (target[i].equals(input)) {
ipos = i;
break;
}
if (ipos == -1)
return;
DataObjectSet[] oldData = target;
target = new DataObjectSet[size-1];
for (int i = 0; i < ipos; i++)
target[i] = oldData[i];
for (int i = ipos+1; i < size; i++)
target[i-1] = oldData[i];
}
public Collection getUse() {
return CWMTools.ArrayToList(use);
}
public void setUse(Collection use) {
this.use = new Dependency[ use.size() ];
Iterator it = use.iterator();
for (int i = 0; i < use.size(); i++)
this.use[i] = (Dependency) it.next();
}
public void addUse( org.omg.cwm.objectmodel.core.Dependency input){
int size = (use == null) ? 0 : use.length;
Dependency[] oldData = use;
use = new Dependency[size+1];
if (size > 0) System.arraycopy(oldData, 0, use, 0, size);
use[size] = (Dependency) input;
}
public void removeUse( org.omg.cwm.objectmodel.core.Dependency input){
int size = (use == null) ? 0 : use.length;
if (size == 0)
return;
int ipos = -1;
for (int i = 0; i < size; i++)
if (use[i].equals(input)) {
ipos = i;
break;
}
if (ipos == -1)
return;
Dependency[] oldData = use;
use = new Dependency[size-1];
for (int i = 0; i < ipos; i++)
use[i] = oldData[i];
for (int i = ipos+1; i < size; i++)
use[i-1] = oldData[i];
}
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -