Java tutorial
//package com.java2s; /*---------------- FILE HEADER ------------------------------------------ This file is part of deegree. Copyright (C) 2001 by: EXSE, Department of Geography, University of Bonn http://www.giub.uni-bonn.de/exse/ lat/lon Fitzke/Fretter/Poth GbR http://www.lat-lon.de This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Contact: Andreas Poth lat/lon Fitzke/Fretter/Poth GbR Meckenheimer Allee 176 53115 Bonn Germany E-Mail: poth@lat-lon.de Jens Fitzke Department of Geography University of Bonn Meckenheimer Allee 166 53115 Bonn Germany E-Mail: jens.fitzke@uni-bonn.de ---------------------------------------------------------------------------*/ import org.w3c.dom.Node; public class Main { /** * @param colorNode * @return the hex color */ public static String toHexColor(Node colorNode) { String value = "#000000"; if (colorNode == null) return value; try {// FIXME no good to grab 1st child and then node val if (colorNode.getFirstChild() == null) return value; String nodeVal = colorNode.getFirstChild().getNodeValue(); String[] components = nodeVal.split(", "); StringBuffer sb = new StringBuffer(100); sb.append("#"); for (int i = 0; i < components.length - 1; i++) { String uglyHack = Integer.toHexString(Integer.parseInt(components[i])); uglyHack = uglyHack.length() == 1 ? "0" + uglyHack : uglyHack; sb.append(uglyHack); } value = sb.toString(); } catch (Exception e) { e.printStackTrace(); } return value; } }