All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.opencms.gwt.client.util.CmsClientCollectionUtil Maven / Gradle / Ivy

Go to download

OpenCms is an enterprise-ready, easy to use website content management system based on Java and XML technology. Offering a complete set of features, OpenCms helps content managers worldwide to create and maintain beautiful websites fast and efficiently.

There is a newer version: 18.0
Show newest version
/*
 * This library is part of OpenCms -
 * the Open Source Content Management System
 *
 * Copyright (c) Alkacon Software GmbH & Co. KG (http://www.alkacon.com)
 *
 * 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.
 *
 * For further information about Alkacon Software, please see the
 * company website: http://www.alkacon.com
 *
 * For further information about OpenCms, please see the
 * project website: http://www.opencms.org
 *
 * 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
 */

package org.opencms.gwt.client.util;

import java.util.Collection;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

/**
 * A utility class with functions for dealing with maps.

* * @since 8.0.0 */ public final class CmsClientCollectionUtil { /** * Hide default constructor.

*/ private CmsClientCollectionUtil() { // do nothing } /** * Returns the intersection of two sets without modifying the original sets.

* * @param the type of objects contained in the sets * * @param first the first set * @param second the second set * * @return the intersection of both sets */ public static Set intersection(Set first, Set second) { HashSet result = new HashSet(first); result.retainAll(second); return result; } /** * Checks whether a collection is empty or null.

* * @param collection a collection * @return true if collection is null or empty. */ public static boolean isEmptyOrNull(Collection collection) { return (collection == null) || collection.isEmpty(); } /** * Parses properties from a string and returns them in a map.

* * @param text the text containing the properties * @return the map with the parsed properties */ public static Map parseProperties(String text) { String[] lines = text.split("\n"); Map result = new HashMap(); for (String line : lines) { line = line.replaceFirst("^ +", ""); line = line.replaceAll("\r", ""); if (line.startsWith("#")) { continue; } int eqPos = line.indexOf('='); if (eqPos > 0) { String key = line.substring(0, eqPos); String value = line.substring(eqPos + 1); result.put(key, value); } } return result; } /** * Returns a new map with all entries of the input map except those which have a value of null.

* * @param the key type of the map * @param the value type of the map * @param map the input map * * @return a map with all null entries removed */ public static Map removeNullEntries(Map map) { HashMap result = new HashMap(); for (Map.Entry entry : map.entrySet()) { if (entry.getValue() != null) { result.put(entry.getKey(), entry.getValue()); } } return result; } /** * Copies entries from one map to another and deletes those entries in the target map for which * the value in the source map is null.

* * @param the key type of the map * @param the value type of the map * @param source the source map * @param target the target map */ public static void updateMapAndRemoveNulls(Map source, Map target) { assert source != target; for (Map.Entry entry : source.entrySet()) { A key = entry.getKey(); B value = entry.getValue(); if (value != null) { target.put(key, value); } else { target.remove(key); } } } }