Examples of Point

Examples of com.android.chimpchat.adb.LinearInterpolator.Point

302
303
304
305
306
307
308
309
310
311
312
313
314
  }

  @Override
  public void touch(String imageName, TouchPressType pressType)
      throws IOException {
    Point point = findClickPoint(imageName);
    if (null != point) {
      device.touch(point.getX(), point.getY(), TouchPressType.DOWN_AND_UP);
    }
    else{
      //FIXME - Log
    }
  }
View Full Code Here

Examples of com.ardor3d.scenegraph.Point

275
276
277
278
279
280
281
282
283
284
285
        public Line line;

        public LineEntry(final int maxSamples, final StatType type) {
            this.maxSamples = maxSamples;

            point = new Point("p", BufferUtils.createVector3Buffer(maxSamples), null, null, null);
            point.getSceneHints().setRenderBucketType(RenderBucketType.Ortho);

            point.setDefaultColor(getColorConfig(type, ConfigKeys.PointColor.name(), new ColorRGBA(ColorRGBA.WHITE)));
            point.setPointSize(getIntConfig(type, ConfigKeys.PointSize.name(), 5));
            point.setAntialiased(getBooleanConfig(type, ConfigKeys.Antialias.name(), true));
View Full Code Here

Examples of com.barrybecker4.ca.dj.jigo.sgf.Point

59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
  {
        if( st.nextToken() != (int)'[' )
            return false;
        int token = st.nextToken();

        wallPoint1 = new Point();
        wallPoint1.x =  ( coordFromChar( st.sval.charAt( 0 ) ) );
        wallPoint1.y = ( coordFromChar( st.sval.charAt( 1 ) ) );

        boolean parsed =  (st.nextToken() == (int)']' && st.nextToken() == (int)'[');

        token = st.nextToken();

        wallPoint2 = new Point();
        wallPoint2.x =  ( coordFromChar( st.sval.charAt( 0 ) ) );
        wallPoint2.y = ( coordFromChar( st.sval.charAt( 1 ) ) );

        parsed = parsed && (st.nextToken() == (int)']');
        return parsed;
View Full Code Here

Examples of com.beoui.geocell.model.Point

295
296
297
298
299
300
301
302
303
304
305
    PersistenceManager pm = PMF.get().getPersistenceManager();

    List<Participant> results = null;

    Point center = new Point(l.getLatitude(), l.getLongitude());

    List<Object> params = new ArrayList<Object>();
    params.add(subject);

    String filter = has ? "hasSubjects == param" : "needSubjects == param";
View Full Code Here

Examples of com.esri.core.geometry.Point

72
73
74
75
76
77
78
79
80
81
82
83
      int nPath = lines.getPathCount();
      double length = 0.;
      for (int ix = 0; ix < nPath; ix++) {
        int curPt = lines.getPathStart(ix);
        int pastPt = lines.getPathEnd(ix);
        Point fromPt = lines.getPoint(curPt);
        Point toPt = null;
        for (int vx = curPt+1; vx < pastPt; vx++) {
          toPt = lines.getPoint(vx);
          length += GeometryEngine.geodesicDistanceOnWGS84(fromPt, toPt);
          fromPt = toPt;
        }
View Full Code Here

Examples of com.extjs.gxt.ui.client.util.Point

124
125
126
127
128
129
130
131
132
133
134
    super.show();

    updateContent();

    doAutoWidth();
    Point p = new Point(x, y);
    if (constrainPosition) {
      p = el().adjustForConstraints(p);
    }
    setPagePosition(p.x + XDOM.getBodyScrollLeft(), p.y + XDOM.getBodyScrollTop());
    setStyleAttribute("visibility", "visible");
View Full Code Here

Examples of com.facebook.LinkBench.distributions.PiecewiseLinearDistribution.Point

28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
  @Override
  public void setUp() throws Exception {
    super.setUp();
    // Make up an arbitrary distribution
    testDistribution = new ArrayList<Point>();
    testDistribution.add(new Point(0, 0.1));
    testDistribution.add(new Point(1, 0.15));
    testDistribution.add(new Point(2, 0.17));
    testDistribution.add(new Point(3, 0.20));
    testDistribution.add(new Point(4, 0.23));
    testDistribution.add(new Point(10, 0.26));
    testDistribution.add(new Point(20, 0.4));
    testDistribution.add(new Point(30, 0.45));
    testDistribution.add(new Point(40, 0.6));
    testDistribution.add(new Point(55, 0.64));
    testDistribution.add(new Point(70, 0.70));
    testDistribution.add(new Point(90, 0.75));
    testDistribution.add(new Point(100, 0.82));
    testDistribution.add(new Point(110, 0.92));
    testDistribution.add(new Point(120, 1.0));
  }
View Full Code Here

Examples of com.forgeessentials.util.AreaSelector.Point

39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
            {
                OutputHandler.chatError(player, "Invalid selection detected. Please check your selection.");
                return;
            }
            int radius = -1;
            Point effectPosition = null;

            try
            {
                radius = Integer.parseInt(args[0]);
            }
            catch (Exception e)
            {
                error(player);
                radius = -1;
            }

            if (args.length == 1)
            {
                effectPosition = new Point((int) player.posX - 1, (int) player.posY, (int) player.posZ);
            }
            else
            {
                int x;
                int z;

                try
                {
                    x = Integer.parseInt(args[1]);
                    z = Integer.parseInt(args[2]);

                    effectPosition = new Point(x, 0, z);
                }
                catch (Exception e)
                {
                    error(player);
                }
View Full Code Here

Examples of com.forgeessentials.util.selections.Point

67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
           
            if (region instanceof CuboidRegion)
            {
                Vector wepos1 = ((CuboidRegion) region).getPos1();
                Vector wepos2 = ((CuboidRegion) region).getPos2();
                Point fepos1 = new Point(wepos1.getBlockX(), wepos1.getBlockY(), wepos1.getBlockZ());
                Point fepos2 = new Point(wepos2.getBlockX(), wepos2.getBlockY(), wepos2.getBlockZ());

                points[0] = fepos1;
                points[1] = fepos2;
                return points;
            }
            else if (region instanceof Polygonal2DRegion)
            {
                Polygonal2DRegion polygon = (Polygonal2DRegion) region;
                Point fepos1 = new Point(polygon.getMinimumPoint().getBlockX(), polygon.getMinimumPoint().getBlockY(), polygon.getMinimumPoint().getBlockZ());
                Point fepos2 = new Point(polygon.getMaximumPoint().getBlockX(), polygon.getMaximumPoint().getBlockY(), polygon.getMaximumPoint().getBlockZ());
                points[0] = fepos1;
                points[1] = fepos2;
                return points;
            }
            else
View Full Code Here

Examples of com.gameloftProgrammersCup.clientInterfaces.Point

92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
      int limiteDerecho=(centroX+rango)<fortaleza.anchoMapa ? centroX+rango : fortaleza.anchoMapa-1;
      int limiteSuperior=(centroY-rango)>=0 ? centroY-rango : 0;
      int limiteInferior=(centroY+rango)<fortaleza.altoMapa ? centroY+rango : fortaleza.altoMapa-1;
      for (int i = limiteIzquierdo; i<=limiteDerecho;i++  ){
        for (int j=limiteSuperior;j<=limiteInferior;j++){
          Point posibleSalto=new Point(i,j);
          //chequeo que no este en la closed list ��
          Iterator itClosed=closed.iterator();
          boolean enClosed=false;
          while (itClosed.hasNext()){
            Nodo nodo=(Nodo)itClosed.next();
            if (nodo.getPunto().getX()==i && nodo.getPunto().getY()==j){
              enClosed=true;
              break;
            }
          }
          if (enClosed)
            continue;
          if ((!unidad.isFavorecerDiagonalesImperfectas() && !(i==centroX && j==centroY) && nodoAExplorar.getPunto().distance(posibleSalto)<=rango)
            || (unidad.isFavorecerDiagonalesImperfectas() && !(i==centroX) && !(j==centroY) && i!=j && nodoAExplorar.getPunto().distance(posibleSalto)<=rango)){
            puntoInvalido=false;
            List puntosIntermedios=new ArrayList();
            int desplazamientoX=posibleSalto.getX()-centroX;
            int desplazamientoY=posibleSalto.getY()-centroY;
            int cantidadDiagonalesExactas=Math.min(Math.abs(desplazamientoX), Math.abs(desplazamientoY));
            int diagonalX=desplazamientoX>0 ? 1: -1;
            int diagonalY=desplazamientoY>0 ? 1: -1;
            desplazamientoX=Math.abs(desplazamientoX-cantidadDiagonalesExactas*diagonalX);
            desplazamientoY=Math.abs(desplazamientoY-cantidadDiagonalesExactas*diagonalY);
            while (desplazamientoX>0){//es uno u el otro
              puntosIntermedios.add(new Point(centroX+desplazamientoX*diagonalX,centroY));
              desplazamientoX--;
            }
            while (desplazamientoY>0){//es uno u el otro
              puntosIntermedios.add(new Point(centroX,centroY+desplazamientoY*diagonalY));
              desplazamientoY--;
            } 
            while (cantidadDiagonalesExactas>0){
              cantidadDiagonalesExactas--;
              puntosIntermedios.add(new Point(posibleSalto.getX()-diagonalX*cantidadDiagonalesExactas,posibleSalto.getY()-diagonalY*cantidadDiagonalesExactas));
            }
            //chequear camino a ese vecino
            Iterator it=puntosInvalidos.iterator();
            while (it.hasNext()){
              MapElement invalido=(MapElement)it.next();
              Iterator it2=puntosIntermedios.iterator();
              while (it2.hasNext()){
                Point wayPoint=(Point)it2.next();
                if (invalido.getPosition().equals(wayPoint)){
                  puntoInvalido=true;
                  break;
                }
              }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.