Package xal.extension.widgets.plot

Class GraphDataOperations

java.lang.Object

xal.extension.widgets.plot.GraphDataOperations

public class GraphDataOperations
extends Object

Method Summary

Modifier and Type	Method	Description
static Double[]	findIntersection(Vector<BasicGraphData> gdV, double xMin, double xMax, double eps)
static Double[]	findIntersection(Vector<BasicGraphData> gdV, double xMin, double xMax, double yMin, double yMax, double eps)
static Double[]	findIntersection(BasicGraphData gd1, BasicGraphData gd2, double xMin, double xMax, double eps)
static Double[]	findIntersection(BasicGraphData gd1, BasicGraphData gd2, double xMinIni, double xMaxIni, double yMinIni, double yMaxIni, double eps)
static Double	findIntersectionX(Vector<BasicGraphData> gdV, double xMin, double xMax, double eps)
static Double	findIntersectionX(Vector<BasicGraphData> gdV, double xMin, double xMax, double yMin, double yMax, double eps)
static Double	findIntersectionX(BasicGraphData gd1, BasicGraphData gd2, double xMin, double xMax, double eps)
static Double	findIntersectionX(BasicGraphData gd1, BasicGraphData gd2, double xMin, double xMax, double yMin, double yMax, double eps)
static Double	findIntersectionY(Vector<BasicGraphData> gdV, double xMin, double xMax, double eps)
static Double	findIntersectionY(Vector<BasicGraphData> gdV, double xMin, double xMax, double yMin, double yMax, double eps)
static Double	findIntersectionY(BasicGraphData gd1, BasicGraphData gd2, double xMin, double xMax, double eps)
static Double	findIntersectionY(BasicGraphData gd1, BasicGraphData gd2, double xMin, double xMax, double yMin, double yMax, double eps)
static Vector<BasicGraphData>	getDataInsideRectangle(Vector<BasicGraphData> gdV, double xMin, double xMax, double yMin, double yMax)	Returns the vector of BasicGraphData whose at least one point is inside rectangle.
static double	getExtremumPosition(BasicGraphData gd, double xMin, double xMax)
static Object[]	getGraphDataAndPointIndexInside(Vector<BasicGraphData> gdV, double xMin, double xMax, double yMin, double yMax)	Returns graph data object and index of the point that are currently displayed on the graph pane if it is only one point.
static boolean	isIntersectRectangle(BasicGraphData gd, double xMin, double xMax, double yMin, double yMax)	Returns true if one of the points is inside rectangle.
static void	main(String[] args)
static double	polynom(double x, double[] coeff)
static double	polynom(double x, int order)
static double[][]	polynomialFit(BasicGraphData gd, double xMin, double xMax, int nOrderIn)
static void	polynomialFit(BasicGraphData gdSource, BasicGraphData gdTarget, double xMin, double xMax)
static void	polynomialFit(BasicGraphData gdSource, BasicGraphData gdTarget, double xMin, double xMax, int nOrder)
static void	polynomialFit(BasicGraphData gdSource, BasicGraphData gdTarget, double xMin, double xMax, int nOrder, int nInterP)
static void	polynomialFit(BasicGraphData gdSource, BasicGraphData gdTarget, int nOrder)
static boolean	reverseMatrix(double[][] a)
static double	unwrap(double y, double yIn)	this method finds +-2*PI to produce the nearest points
static void	unwrapData(BasicGraphData gd)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Details

findIntersectionX

public static Double findIntersectionX(Vector<BasicGraphData> gdV,
 double xMin,
 double xMax,
 double eps)

findIntersectionY

public static Double findIntersectionY(Vector<BasicGraphData> gdV,
 double xMin,
 double xMax,
 double eps)

findIntersection

public static Double[] findIntersection(Vector<BasicGraphData> gdV,
 double xMin,
 double xMax,
 double eps)

findIntersectionX

public static Double findIntersectionX(Vector<BasicGraphData> gdV,
 double xMin,
 double xMax,
 double yMin,
 double yMax,
 double eps)

findIntersectionY

public static Double findIntersectionY(Vector<BasicGraphData> gdV,
 double xMin,
 double xMax,
 double yMin,
 double yMax,
 double eps)

findIntersection

public static Double[] findIntersection(Vector<BasicGraphData> gdV,
 double xMin,
 double xMax,
 double yMin,
 double yMax,
 double eps)

findIntersectionX

public static Double findIntersectionX(BasicGraphData gd1,
 BasicGraphData gd2,
 double xMin,
 double xMax,
 double eps)

findIntersectionY

public static Double findIntersectionY(BasicGraphData gd1,
 BasicGraphData gd2,
 double xMin,
 double xMax,
 double eps)

findIntersectionX

public static Double findIntersectionX(BasicGraphData gd1,
 BasicGraphData gd2,
 double xMin,
 double xMax,
 double yMin,
 double yMax,
 double eps)

findIntersectionY

public static Double findIntersectionY(BasicGraphData gd1,
 BasicGraphData gd2,
 double xMin,
 double xMax,
 double yMin,
 double yMax,
 double eps)

findIntersection

public static Double[] findIntersection(BasicGraphData gd1,
 BasicGraphData gd2,
 double xMin,
 double xMax,
 double eps)

findIntersection

public static Double[] findIntersection(BasicGraphData gd1,
 BasicGraphData gd2,
 double xMinIni,
 double xMaxIni,
 double yMinIni,
 double yMaxIni,
 double eps)

polynom

public static double polynom(double x,
 int order)

polynom

public static double polynom(double x,
 double[] coeff)

getExtremumPosition

public static double getExtremumPosition(BasicGraphData gd,
 double xMin,
 double xMax)

polynomialFit

public static void polynomialFit(BasicGraphData gdSource,
 BasicGraphData gdTarget,
 double xMin,
 double xMax)

polynomialFit

public static void polynomialFit(BasicGraphData gdSource,
 BasicGraphData gdTarget,
 int nOrder)

polynomialFit

public static void polynomialFit(BasicGraphData gdSource,
 BasicGraphData gdTarget,
 double xMin,
 double xMax,
 int nOrder)

polynomialFit

public static void polynomialFit(BasicGraphData gdSource,
 BasicGraphData gdTarget,
 double xMin,
 double xMax,
 int nOrder,
 int nInterP)

polynomialFit

public static double[][] polynomialFit(BasicGraphData gd,
 double xMin,
 double xMax,
 int nOrderIn)

reverseMatrix

public static boolean reverseMatrix(double[][] a)

unwrapData

public static void unwrapData(BasicGraphData gd)

unwrap

public static double unwrap(double y,
 double yIn)

this method finds +-2*PI to produce the nearest points

getGraphDataAndPointIndexInside

public static Object[] getGraphDataAndPointIndexInside(Vector<BasicGraphData> gdV,
 double xMin,
 double xMax,
 double yMin,
 double yMax)

Returns graph data object and index of the point that are currently displayed on the graph pane if it is only one point.

Returns:

Object[2] - Object[0] is BasicGraphData class instnce Object[1] - Integer instance with point index

getDataInsideRectangle

public static Vector<BasicGraphData> getDataInsideRectangle(Vector<BasicGraphData> gdV,
 double xMin,
 double xMax,
 double yMin,
 double yMax)

Returns the vector of BasicGraphData whose at least one point is inside rectangle.

isIntersectRectangle

public static boolean isIntersectRectangle(BasicGraphData gd,
 double xMin,
 double xMax,
 double yMin,
 double yMax)

Returns true if one of the points is inside rectangle.

main

public static void main(String[] args)