Examples of contain()

Examples of chunmap.model.elem.Envelope.contain()

57
58
59
60
61
62
63
64
65
66
67
  @Test
  public void testContain() {
    Envelope envelop1 = new Envelope(10, 16, 20, 22);
    CPoint p = new Coordinate2D(11, 17);

    boolean b1 = envelop1.contain(p);
    assertTrue(b1);
  }

  @Test
  public void testContain2() {
View Full Code Here

Examples of chunmap.model.elem.Envelope.contain()

66
67
68
69
70
71
72
73
74
75
76
  @Test
  public void testContain2() {
    Envelope envelop1 = new Envelope(10, 16, 10, 16);
    CPoint p = new Coordinate2D(10, 16);

    boolean b1 = envelop1.contain(p);
    assertTrue(b1);
  }

  @Test
  public void testContain3() {
View Full Code Here

Examples of chunmap.model.elem.Envelope.contain()

74
75
76
77
78
79
80
81
82
83
  @Test
  public void testContain3() {
    CPoint p = new Coordinate2D(10, 16);
    Envelope envelop1 = new GeoPoint(p).getEnvelop();
    boolean b1 = envelop1.contain(p);
    assertTrue(b1);
  }

}
View Full Code Here

Examples of com.sissi.protocol.muc.XUser.contain()

25
26
27
28
29
30
31
32
33
34
35
  }

  @Override
  public boolean input(JIDContext context, Protocol protocol) {
    XUser user = this.extracter.extract(protocol.cast(Owner.class).getX(), new XUser()).cast(XUser.class);
    if (user.contain()) {
      JID group = super.build(protocol.parent().getTo());
      Protocol message = new Message().noneThread().muc(user).setType(MessageType.GROUPCHAT).setFrom(group);
      for (JID jid : super.whoSubscribedMe(group)) {
        super.findOne(jid, true).write(message);
      }
View Full Code Here

Examples of net.alteiar.beans.map.elements.CircleElement.contain()

301
302
303
304
305
306
307
308
309
310
311
        circleClient.getAngle());
    assertEquals("The angle should be equals", isHidden,
        circleClient.isHiddenForPlayer());

    assertTrue("the circle not contain point (5,5)",
        !circleClient.contain(new Point(5, 5)));

    assertTrue("the circle contain point (32,32)",
        circleClient.contain(new Point(32, 32)));

    MapElementSize newCircleRadius = new MapElementSizeMeter(1.5);
View Full Code Here

Examples of net.alteiar.beans.map.elements.CircleElement.contain()

304
305
306
307
308
309
310
311
312
313
314
    assertTrue("the circle not contain point (5,5)",
        !circleClient.contain(new Point(5, 5)));

    assertTrue("the circle contain point (32,32)",
        circleClient.contain(new Point(32, 32)));

    MapElementSize newCircleRadius = new MapElementSizeMeter(1.5);
    circleClient.setRadius(newCircleRadius);
    sleep();
    assertEquals("radius should be equals",
View Full Code Here

Examples of net.alteiar.beans.map.elements.MapElement.contain()

76
77
78
79
80
81
82
83
84
85
86
    ArrayList<MapElement> elementsAt = new ArrayList<MapElement>();
    HashSet<UniqueID> elements = getElements();

    for (UniqueID id : elements) {
      MapElement element = CampaignClient.getInstance().getBean(id);
      if (element != null && element.contain(position)) {
        elementsAt.add(element);
      }
    }

    return elementsAt;
View Full Code Here

Examples of net.alteiar.campaign.player.gui.centerViews.map.drawable.button.ButtonDrawable.contain()

116
117
118
119
120
121
122
123
124
125
126
    Iterator<ButtonDrawable> ittBtn = buttons.iterator();
    while (ittBtn.hasNext() && !buttonFound) {
      ButtonDrawable button = ittBtn.next();

      // is the click on the button
      if (button.contain(orgEvent.getPoint())) {
        // fire button event
        button.fireMouseClicked(orgEvent);
        buttonFound = true;
      }
    }
View Full Code Here

Examples of util.objects.setDataStructures.ISet.contain()

67
68
69
70
71
72
73
74
75
76
77
    }

    public void findAllSCC() {
        ISet nodes = graph.getNodes();
        for (int i = 0; i < n; i++) {
            restriction.set(i, nodes.contain(i));
        }
        findAllSCCOf(restriction);
    }

    public void findAllSCCOf(BitSet restriction) {
View Full Code Here

Examples of util.objects.setDataStructures.ISet.contain()

94
95
96
97
98
99
100
101
102
103
104
    }

    private void findSingletons(BitSet restriction) {
        ISet nodes = graph.getNodes();
        for (int i = restriction.nextSetBit(0); i >= 0; i = restriction.nextSetBit(i + 1)) {
            if (nodes.contain(i) && graph.getPredOf(i).getSize() * graph.getSuccOf(i).getSize() == 0) {
                nodeSCC[i] = nbSCC;
                sccFirstNode[nbSCC++] = i;
                restriction.clear(i);
            }
        }
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.