*
 * <p>If you have your own graph implementation based around a custom node type {@code MyNode},
 * which has a method {@code getParents()} that retrieves its predecessors in a graph:
 *
 * {@snippet :
 * someGraphAlgorithm(startNode, MyNode::getParents);
 * }
 *
 * <p>If you have some other mechanism for returning the predecessors of a node, or one that doesn't

                        Files.createDirectories(path.getParent());
                        Files.copy(zis, path, StandardCopyOption.REPLACE_EXISTING);
                    } else if ("css".equals(names[0])) {
                        names[0] = themeName;
                        final Path path = ResourceUtil.getCssPath(names);
                        Files.createDirectories(path.getParent());

    @Override
    public ClassLoader next() {
        if (!hasNext()) {
            throw new NoSuchElementException();
        }
        final ClassLoader result = classLoader;
        classLoader = classLoader.getParent();
        return result;
    }

    @Override
    public void remove() {
        throw new ClUnsupportedOperationException("remove");
    }

     */
    public ParamMap(final Map<K, V> parent) {
        this.parent = parent;
    }

    /**
     * Gets the parent map.
     *
     * @return the parent map
     */
    public Map<K, V> getParent() {
        return parent;
    }

    /**
     * Converts a key to camelCase.
     *
     * @param key the key to convert
     * @return the converted key
     */

     */
    protected static Map<String, Object> getDataMap(final Map<String, Object> params) {
        if (params instanceof final ParamMap<String, Object> paramMap) {
            return paramMap.getParent();
        }
        return params;
    }