Package lineage2.commons.geometry

Examples of lineage2.commons.geometry.Shape

144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
            }
            zoneDat.set("PKrestart_points", PKrestartPoints);
          }
          else if ((isShape = "rectangle".equalsIgnoreCase(n.getName())) || "banned_rectangle".equalsIgnoreCase(n.getName()))
          {
            Shape shape = parseRectangle(n);
            if (territory == null)
            {
              territory = new Territory();
              zoneDat.set("territory", territory);
            }
            if (isShape)
            {
              territory.add(shape);
            }
            else
            {
              territory.addBanned(shape);
            }
          }
          else if ((isShape = "circle".equalsIgnoreCase(n.getName())) || "banned_cicrcle".equalsIgnoreCase(n.getName()))
          {
            Shape shape = parseCircle(n);
            if (territory == null)
            {
              territory = new Territory();
              zoneDat.set("territory", territory);
            }
            if (isShape)
            {
              territory.add(shape);
            }
            else
            {
              territory.addBanned(shape);
            }
          }
          else if ((isShape = "polygon".equalsIgnoreCase(n.getName())) || "banned_polygon".equalsIgnoreCase(n.getName()))
          {
            Polygon shape = parsePolygon(n);
            if (!shape.validate())
            {
              error("ZoneParser: invalid territory data : " + shape + ", zone: " + zoneDat.getString("name") + "!");
            }
            if (territory == null)
            {
View Full Code Here
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
   * @return boolean * @see lineage2.commons.geometry.Shape#isInside(int, int)
   */
  @Override
  public boolean isInside(int x, int y)
  {
    Shape shape;
    for (int i = 0; i < include.size(); i++)
    {
      shape = include.get(i);
      if (shape.isInside(x, y))
      {
        return !isExcluded(x, y);
      }
    }
    return false;
View Full Code Here
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
  {
    if ((x < min.x) || (x > max.x) || (y < min.y) || (y > max.y) || (z < min.z) || (z > max.z))
    {
      return false;
    }
    Shape shape;
    for (int i = 0; i < include.size(); i++)
    {
      shape = include.get(i);
      if (shape.isInside(x, y, z))
      {
        return !isExcluded(x, y, z);
      }
    }
    return false;
View Full Code Here
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
   * @param y int
   * @return boolean
   */
  public boolean isExcluded(int x, int y)
  {
    Shape shape;
    for (int i = 0; i < exclude.size(); i++)
    {
      shape = exclude.get(i);
      if (shape.isInside(x, y))
      {
        return true;
      }
    }
    return false;
View Full Code Here
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
   * @param z int
   * @return boolean
   */
  public boolean isExcluded(int x, int y, int z)
  {
    Shape shape;
    for (int i = 0; i < exclude.size(); i++)
    {
      shape = exclude.get(i);
      if (shape.isInside(x, y, z))
      {
        return true;
      }
    }
    return false;
View Full Code Here
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
    Location pos = new Location();
    List<Shape> territories = territory.getTerritories();
    loop:
    for (int i = 0; i < 100; i++)
    {
      Shape shape = territories.get(Rnd.get(territories.size()));
      pos.x = Rnd.get(shape.getXmin(), shape.getXmax());
      pos.y = Rnd.get(shape.getYmin(), shape.getYmax());
      pos.z = shape.getZmin() + ((shape.getZmax() - shape.getZmin()) / 2);
      if (territory.isInside(pos.x, pos.y))
      {
        int tempz = GeoEngine.getHeight(pos, geoIndex);
        if (shape.getZmin() != shape.getZmax())
        {
          if ((tempz < shape.getZmin()) || (tempz > shape.getZmax()))
          {
            continue;
          }
        }
        else if ((tempz < (shape.getZmin() - 200)) || (tempz > (shape.getZmin() + 200)))
        {
          continue;
        }
        pos.z = tempz;
        int geoX = (pos.x - World.MAP_MIN_X) >> 4;
View Full Code Here
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
   * @param collision GeoCollision
   * @param geoIndex int
   */
  public static void removeGeoCollision(GeoCollision collision, int geoIndex)
  {
    Shape shape = collision.getShape();
    byte[][] around = collision.getGeoAround();
    if (around == null)
    {
      throw new RuntimeException("Attempt to remove unitialized collision: " + collision);
    }
    int minX = (shape.getXmin() - World.MAP_MIN_X - 16) >> 4;
    int minY = (shape.getYmin() - World.MAP_MIN_Y - 16) >> 4;
    int minZ = shape.getZmin();
    int maxZ = shape.getZmax();
    short height;
    byte old_nswe;
    for (int gX = 0; gX < around.length; gX++)
    {
      for (int gY = 0; gY < around[gX].length; gY++)
View Full Code Here
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
   * @param collision GeoCollision
   * @param geoIndex int
   */
  public static void applyGeoCollision(GeoCollision collision, int geoIndex)
  {
    Shape shape = collision.getShape();
    if ((shape.getXmax() == shape.getYmax()) && (shape.getXmax() == 0))
    {
      throw new RuntimeException("Attempt to add incorrect collision: " + collision);
    }
    boolean isFirstTime = false;
    int minX = (shape.getXmin() - World.MAP_MIN_X - 16) >> 4;
    int maxX = ((shape.getXmax() - World.MAP_MIN_X) + 16) >> 4;
    int minY = (shape.getYmin() - World.MAP_MIN_Y - 16) >> 4;
    int maxY = ((shape.getYmax() - World.MAP_MIN_Y) + 16) >> 4;
    int minZ = shape.getZmin();
    int maxZ = shape.getZmax();
    byte[][] around = collision.getGeoAround();
    if (around == null)
    {
      isFirstTime = true;
      byte[][] cells = new byte[(maxX - minX) + 1][(maxY - minY) + 1];
      for (int gX = minX; gX <= maxX; gX++)
      {
        for (int gY = minY; gY <= maxY; gY++)
        {
          int x = (gX << 4) + World.MAP_MIN_X;
          int y = (gY << 4) + World.MAP_MIN_Y;
          loop:
          for (int ax = x; ax < (x + 16); ax++)
          {
            for (int ay = y; ay < (y + 16); ay++)
            {
              if (shape.isInside(ax, ay))
              {
                cells[gX - minX][gY - minY] = 1;
                break loop;
              }
            }
View Full Code Here
118
119
120
121
122
123
124
125
126
127
128
  public void onEvtDead(Creature killer)
  {
    final NpcInstance actor = getActor();
    super.onEvtDead(killer);
    actor.deleteMe();
    ThreadPoolManager.getInstance().schedule(new RunnableImpl()
    {
      @Override
      public void runImpl()
      {
        final NpcTemplate template = NpcHolder.getInstance().getTemplate(18602);
View Full Code Here
83
84
85
86
87
88
89
90
91
92
93
          getZone("[soi_hos_attack_attackup_5]").setActive(false);
          spawnRoom(6);
        }
      }
      else if(self.getNpcId() == Yehan)
        ThreadPoolManager.getInstance().schedule(new RunnableImpl(){
          @Override
          public void runImpl() throws Exception
          {
            spawnRoom(7);
            setReenterTime(System.currentTimeMillis());
View Full Code Here
TOP

Related Classes of lineage2.commons.geometry.Shape

  • ai.BaiumNpc
  • ai.ElcardiaAssistant
  • ai.ElcardiaAssistant$ThinkFollow
  • ai.GraveRobberSummoner
  • ai.GuardianAngel
  • ai.hellbound.DarionFaithfulServant
  • ai.hellbound.MasterZelos
  • ai.hellbound.RankuScapegoat
  • ai.incubatorOfEvil.MonsterMage
  • ai.incubatorOfEvil.MonsterWarrior
    • Copyright © 2018 www.massapicom. 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.