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

com.google.gwt.validation.client.impl.PathImpl Maven / Gradle / Ivy

Go to download

Vaadin is a web application framework for Rich Internet Applications (RIA). Vaadin enables easy development and maintenance of fast and secure rich web applications with a stunning look and feel and a wide browser support. It features a server-side architecture with the majority of the logic running on the server. Ajax technology is used at the browser-side to ensure a rich and interactive user experience.

There is a newer version: 8.27.1
Show newest version
/*
 * Copyright 2010 Google Inc.
 *
 * Licensed under the Apache License, Version 2.0 (the "License"); you may not
 * use this file except in compliance with the License. You may obtain a copy of
 * the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
 * License for the specific language governing permissions and limitations under
 * the License.
 */
package com.google.gwt.validation.client.impl;

import java.io.Serializable;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;

import javax.validation.Path;

/**
 * An immutable GWT safe implementation of {@link Path}.
 */
public final class PathImpl implements Path, Serializable {

  private static final long serialVersionUID = 1L;

  private final List nodes = new ArrayList();

  /**
   * Creates a new path containing only the root (null)
   * {@link javax.validation.Path.Node Node}.
   */
  public PathImpl() {
    nodes.add(NodeImpl.ROOT_NODE);
  }

  private PathImpl(PathImpl originalPath, Node node) {
    if (!originalPath.isRoot()) {
      nodes.addAll(originalPath.nodes);
    }
    nodes.add(node);
  }

  private PathImpl(List nodes) {
    this.nodes.addAll(nodes);
  }

  /**
   * Create a new path with a node named name appended to the
   * existing path.
   *
   * @param name
   * @return The new path with appended node.
   */
  public PathImpl append(String name) {
    return new PathImpl(this, NodeImpl.createNode(name));
  }

  /**
   * Create a new path with an indexed node named name appended to
   * the existing path.
   *
   * @param name
   * @param index
   * @return The new path with appended node.
   */
  public PathImpl appendIndex(String name, int index) {
    return new PathImpl(this, NodeImpl.createIndexedNode(name, index));
  }

  /**
   * Create a new path with an iterable node named name appended to
   * the existing path.
   *
   * @param name
   * @return The new path with appended node.
   */
  public PathImpl appendIterable(String name) {
    return new PathImpl(this, NodeImpl.createIterableNode(name));
  }

  /**
   * Create a new path with a keyed node named name appended to the
   * existing path.
   *
   * @param name
   * @param key
   * @return The new path with appended node.
   */
  public PathImpl appendKey(String name, Object key) {
    return new PathImpl(this, NodeImpl.createKeyedNode(name, key));
  }

  @Override
  public boolean equals(Object obj) {
    if (this == obj) {
      return true;
    }
    if (!(obj instanceof PathImpl)) {
      return false;
    }
    PathImpl that = (PathImpl) obj;
    return this.nodes.equals(that.nodes);
  }

  public Node getLeafNode() {
    return nodes.get(nodes.size() - 1);
  }

  public PathImpl getPathWithoutLeafNode() {
    List nodesCopy = new ArrayList(nodes);
    PathImpl path = this;
    if (!nodesCopy.isEmpty()) {
      nodesCopy.remove(nodesCopy.size() - 1);
      path = new PathImpl(nodesCopy);
    }
    return path;
  }

  @Override
  public int hashCode() {
    return nodes.hashCode();
  }

  @Override
  public Iterator iterator() {
    return nodes.iterator();
  }

  @Override
  public String toString() {
    StringBuilder sb = new StringBuilder();
    for (Node n : nodes) {
      if (sb.length() > 0) {
        sb.append('.');
      }
      sb.append(n);
    }
    return sb.toString();
  }

  private boolean isRoot() {
    return nodes.size() == 1 && nodes.get(0) == NodeImpl.ROOT_NODE;
  }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy