/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
*
*
* The contents of this file are subject to the terms of either the GNU
* General Public License Version 2 only ("GPL") or the Common Development
* and Distribution License("CDDL") (collectively, the "License"). You
* may not use this file except in compliance with the License. You can
* obtain a copy of the License at
* or packager/legal/LICENSE.txt. See the License for the specific
* language governing permissions and limitations under the License.
*
* When distributing the software, include this License Header Notice in each
* file and include the License file at packager/legal/LICENSE.txt.
*
* GPL Classpath Exception:
* Oracle designates this particular file as subject to the "Classpath"
* exception as provided by Oracle in the GPL Version 2 section of the License
* file that accompanied this code.
*
* Modifications:
* If applicable, add the following below the License Header, with the fields
* enclosed by brackets [] replaced by your own identifying information:
* "Portions Copyright [year] [name of copyright owner]"
*
* Contributor(s):
* If you wish your version of this file to be governed by only the CDDL or
* only the GPL Version 2, indicate your decision by adding "[Contributor]
* elects to include this software in this distribution under the [CDDL or GPL
* Version 2] license." If you don't indicate a single choice of license, a
* recipient has the option to distribute your version of this file under
* either the CDDL, the GPL Version 2 or to extend the choice of license to
* its licensees as provided above. However, if you add GPL Version 2 code
* and therefore, elected the GPL Version 2 license, then the option applies
* only if the new code is made subject to such option by the copyright
* holder.
*/
/*
*
* Created on October 2, 2001, 2:53 PM
*/
/**
*
* @author bnevins
* @version
*/
public class SystemProps
{
{
// these 2 lines woul;d be nice -- but it's case-sensitive...
//Map sortedMap = new TreeMap(p);
//Set sortedSet = sortedMap.entrySet();
{
{
}
});
return list;
}
///////////////////////////////////////////////////////////////////////////
{
int longestKey = 0;
/* Go through the list twice.
* The first time through gets the maximum length entry
* The second time through uses that info for 'pretty printing'
*/
{
if(len > longestKey)
longestKey = len;
}
longestKey += 1;
{
}
}
///////////////////////////////////////////////////////////////////////////
private SystemProps()
{
}
///////////////////////////////////////////////////////////////////////////
{
}
}