Examples of org.eclipse.swt.graphics.Rectangle.intersects()

Class org.eclipse.swt.graphics.Rectangle

Examples of org.eclipse.swt.graphics.Rectangle.intersects()

org.eclipse.swt.graphics.Rectangle.intersects()
Returns true if the rectangle described by the arguments intersects with the receiver and false otherwise.
Two rectangles intersect if the area of the rectangle representing their intersection is not empty.
@param x the x coordinate of the origin of the rectangle @param y the y coordinate of the origin of the rectangle @param width the width of the rectangle @param height the height of the rectangle @return true if the rectangle intersects with the receiver, and false otherwise @exception IllegalArgumentException
- ERROR_NULL_ARGUMENT - if the argument is null
@see #intersection(Rectangle) @see #isEmpty() @since 3.0

                  
                  Object[]  old = (Object[])it.next();
                  
                  Rectangle old_coords = (Rectangle)old[1];
                  
                  if ( old_coords.intersects( text_rect )){
                  
                    it.remove();
                  }
                }

View Full Code Here

            + PopupDialog.POPUP_HORIZONTALSPACING, parentBounds.y
            + PopupDialog.POPUP_VERTICALSPACING,
            parentBounds.width, parentBounds.height);
        rightProposedBounds = getConstrainedShellBounds(rightProposedBounds);
        // If it won't fit on the right, try the left
        if (rightProposedBounds.intersects(parentBounds)) {
          Rectangle leftProposedBounds = new Rectangle(parentBounds.x
              - parentBounds.width - POPUP_HORIZONTALSPACING - 1,
              parentBounds.y, parentBounds.width,
              parentBounds.height);
          leftProposedBounds = getConstrainedShellBounds(leftProposedBounds);

View Full Code Here

              parentBounds.y, parentBounds.width,
              parentBounds.height);
          leftProposedBounds = getConstrainedShellBounds(leftProposedBounds);
          // If it won't fit on the left, choose the proposed bounds
          // that fits the best
          if (leftProposedBounds.intersects(parentBounds)) {
            if (rightProposedBounds.x - parentBounds.x >= parentBounds.x
                - leftProposedBounds.x) {
              rightProposedBounds.x = parentBounds.x
                  + parentBounds.width
                  + PopupDialog.POPUP_HORIZONTALSPACING;

View Full Code Here

          return;
        }
        Rectangle redrawArea = new Rectangle(e.x, e.y, e.width, e.height);
        for (PlayerSeatComposite pc : getPlayerSeatComposites(true)) {
          
          if (getBetPile(pc.getPlayerId()).size() > 0 && redrawArea.intersects(pc.getChipsArea().getBounds())) {
            drawChips(e.gc, pc.getChipsArea().getBounds(), getBetPile(pc.getPlayerId()), false, false);
            
          }
        }
        // Draw dealer chip

View Full Code Here

          }
        }
        // Draw dealer chip
        NavigableMap<Chip, Integer> dealerChip = new TreeMap<Chip, Integer>();
        dealerChip.put(Chip.DEALER, 1);
        if (dealer != null && redrawArea.intersects(dealer.getDealerChipLocation())) {
          drawChips(e.gc, dealer.getDealerChipLocation(), Arrays.asList(dealerChip), false, true);
        }
        if (redrawArea.intersects(potChipsArea.getBounds()) && redrawArea.intersects(potChipsArea.getBounds())) {
          int potSize = 0;
          try {

View Full Code Here

        NavigableMap<Chip, Integer> dealerChip = new TreeMap<Chip, Integer>();
        dealerChip.put(Chip.DEALER, 1);
        if (dealer != null && redrawArea.intersects(dealer.getDealerChipLocation())) {
          drawChips(e.gc, dealer.getDealerChipLocation(), Arrays.asList(dealerChip), false, true);
        }
        if (redrawArea.intersects(potChipsArea.getBounds()) && redrawArea.intersects(potChipsArea.getBounds())) {
          int potSize = 0;
          try {
            potSize = getGameState().getPreviousRoundsPotSize();
          } catch (Exception e1) {
            logger.warn(e1);

View Full Code Here

        NavigableMap<Chip, Integer> dealerChip = new TreeMap<Chip, Integer>();
        dealerChip.put(Chip.DEALER, 1);
        if (dealer != null && redrawArea.intersects(dealer.getDealerChipLocation())) {
          drawChips(e.gc, dealer.getDealerChipLocation(), Arrays.asList(dealerChip), false, true);
        }
        if (redrawArea.intersects(potChipsArea.getBounds()) && redrawArea.intersects(potChipsArea.getBounds())) {
          int potSize = 0;
          try {
            potSize = getGameState().getPreviousRoundsPotSize();
          } catch (Exception e1) {
            logger.warn(e1);

View Full Code Here

              text.setText(item.getText(i));
              text.selectAll();
              text.setFocus();
              return;
            }
            if (!visible && rect.intersects(clientArea)) {
              visible = true;
            }
          }
          if (!visible)
            return;

View Full Code Here

                text.setText(item.getText(i));
                text.selectAll();
                text.setFocus();
                return;
              }
              if (!visible && rect.intersects(clientArea)) {
                visible = true;
              }
            }
            if (!visible)
              return;

View Full Code Here

          if (rect.contains(pt)) {
            beforeEdit();
            clickRow(item, i);
            return;
          }
          if (!visible && rect.intersects(clientArea)) {
            visible = true;
          }
        }
        if (!visible)
          return;

View Full Code Here

0 1 2 3

TOP

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.