|
Java example source code file (Tree.java)
The Tree.java Java example source code/* * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. Oracle designates this * particular file as subject to the "Classpath" exception as provided * by Oracle in the LICENSE file that accompanied this code. * * This code 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 General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ package com.sun.xml.internal.bind.v2.schemagen; import java.util.ArrayList; import java.util.Arrays; import java.util.List; import com.sun.xml.internal.bind.v2.schemagen.xmlschema.ContentModelContainer; import com.sun.xml.internal.bind.v2.schemagen.xmlschema.Particle; import com.sun.xml.internal.bind.v2.schemagen.xmlschema.TypeDefParticle; import com.sun.xml.internal.bind.v2.schemagen.xmlschema.Occurs; /** * Normalized representation of the content model. * * <p> * This is built from bottom up so that we can eliminate redundant constructs, * and produce the most concise content model definition in XML. * * @author Kohsuke Kawaguchi */ abstract class Tree { /** * Returns "T?" from "T". * * @param really * if false this method becomes no-op. This is so that we can write * the caller fluently. */ Tree makeOptional(boolean really) { return really?new Optional(this) :this; } /** * Returns "T+" from "T". * * @param really * if false this method becomes no-op. This is so that we can write * the caller fluently. */ Tree makeRepeated(boolean really) { return really?new Repeated(this) :this; } /** * Returns a group tree. */ static Tree makeGroup(GroupKind kind, List<Tree> children ) { // pointless binary operator. if(children.size()==1) return children.get(0); // we neither have epsilon or emptySet, so can't handle children.length==0 nicely // eliminated nesting groups of the same kind. // this is where binary tree would have shined. List<Tree> normalizedChildren = new ArrayList Other Java examples (source code examples)Here is a short list of links related to this Java Tree.java source code file: |
... this post is sponsored by my books ... | |
#1 New Release! |
FP Best Seller |
Copyright 1998-2021 Alvin Alexander, alvinalexander.com
All Rights Reserved.
A percentage of advertising revenue from
pages under the /java/jwarehouse
URI on this website is
paid back to open source projects.