@Test public void testGetTag() { Way way0 = new Way(1L, 0, new Date(), null, 0); way0.getTags().add(new Tag("name0", "value0")); assertEquals(WayHelper.getTag(way0, "name0"), "value0"); }
public static String getTag(final Collection<Tag> way, final String key) { for (Tag tag : way) { try { if (tag.getKey().equals(key)) return tag.getValue(); } catch (Exception e) { LOG.log(Level.WARNING, "Could not read tag. Skipping it.", e); } } return null; }
WayHelper { public static String getTag(final Collection<Tag> way, final String key) { for (Tag tag : way) { try { if (tag.getKey().equals(key)) return tag.getValue(); } catch (Exception e) { LOG.log(Level.WARNING, "Could not read tag. Skipping it.", e); } } return null; } }
WayHelper { public static String getTag(final Collection<Tag> way, final String key) { for (Tag tag : way) { try { if (tag.getKey().equals(key)) return tag.getValue(); } catch (Exception e) { LOG.log(Level.WARNING, "Could not read tag. Skipping it.", e); } } return null; } WayHelper(final IDataSet aMap); }
WayHelper { public static String getTag(final Collection<Tag> way, final String key) { for (Tag tag : way) { try { if (tag.getKey().equals(key)) return tag.getValue(); } catch (Exception e) { LOG.log(Level.WARNING, "Could not read tag. Skipping it.", e); } } return null; } WayHelper(final IDataSet aMap); IDataSet getMap(); static String getTag(final Collection<Tag> way, final String key); static String getTag(final Entity way, final String key); List<Node> getNodes(final Way aWay); List<Node> getNodes(final List<WayNode> aWay); Bounds getWayBounds(final Way way); Bounds getWayBounds(final Collection<Way> ways); List<WayNode> simplifyWay(final Way w); List<WayNode> simplifyWay(final Way w, final double threshold,
            final double maxNodeDistance,
            final boolean keepTaggedNodes,
            final boolean keepIntersectionNodes); List<WayNode> simplifyWay(final List<WayNode> wnew, final double threshold,
            final double minNodeDistance,
            final boolean keepTaggedNodes,
            final boolean keepIntersectionNodes); void simplifyWayRange(final List<WayNode> aWay, final int from,
                                 final int to,
                                 final double thr,
                                 final double minDist); static Bounds getBoundsForWay(final Way street, final IDataSet aMap); static boolean isPolygon(final Way aWay); static boolean isOneway(final Way way); static boolean isReverseOneway(final Way way); static boolean isBridge(final Way way); static long areaBoundingBox(final ExtendedWay way); static double area(final Coordinate[] polyPoints); static double[] centerOfMass(final Coordinate[] polyPoints); static boolean containsNode(final Way aToWay, final long aNodeID); static List<Node> isParallel(final List<Node> aFirstWay, final List<Node> aSecondWay); static double getDistanceAndInsert(final Node aNode, final List<Node> aWay); static double getDistance(final Node aNode, final Node aStart, final Node aEnd); }
WayHelper { public static String getTag(final Collection<Tag> way, final String key) { for (Tag tag : way) { try { if (tag.getKey().equals(key)) return tag.getValue(); } catch (Exception e) { LOG.log(Level.WARNING, "Could not read tag. Skipping it.", e); } } return null; } WayHelper(final IDataSet aMap); IDataSet getMap(); static String getTag(final Collection<Tag> way, final String key); static String getTag(final Entity way, final String key); List<Node> getNodes(final Way aWay); List<Node> getNodes(final List<WayNode> aWay); Bounds getWayBounds(final Way way); Bounds getWayBounds(final Collection<Way> ways); List<WayNode> simplifyWay(final Way w); List<WayNode> simplifyWay(final Way w, final double threshold,
            final double maxNodeDistance,
            final boolean keepTaggedNodes,
            final boolean keepIntersectionNodes); List<WayNode> simplifyWay(final List<WayNode> wnew, final double threshold,
            final double minNodeDistance,
            final boolean keepTaggedNodes,
            final boolean keepIntersectionNodes); void simplifyWayRange(final List<WayNode> aWay, final int from,
                                 final int to,
                                 final double thr,
                                 final double minDist); static Bounds getBoundsForWay(final Way street, final IDataSet aMap); static boolean isPolygon(final Way aWay); static boolean isOneway(final Way way); static boolean isReverseOneway(final Way way); static boolean isBridge(final Way way); static long areaBoundingBox(final ExtendedWay way); static double area(final Coordinate[] polyPoints); static double[] centerOfMass(final Coordinate[] polyPoints); static boolean containsNode(final Way aToWay, final long aNodeID); static List<Node> isParallel(final List<Node> aFirstWay, final List<Node> aSecondWay); static double getDistanceAndInsert(final Node aNode, final List<Node> aWay); static double getDistance(final Node aNode, final Node aStart, final Node aEnd);  }