Package org.apache.commons.collections.map

Examples of org.apache.commons.collections.map.MultiValueMap$ReflectionFactory

1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
                break;

            default:
                avas = new ArrayList<Ava>();

                avaTypes = new MultiValueMap();

                for ( int i = 0; i < nbAvas; i++ )
                {
                    Ava ava = new Ava( schemaManager );
                    ava.readExternal( in );
View Full Code Here
51
52
53
54
55
56
57
58
59
60
61
  private  FileChangedReloadingStrategy reloader = new FileChangedReloadingStrategy();
 
  private static Policies instance;
 
  private Policies() throws ConfigurationException{
    policies = new MultiValueMap();
    properties = new PropertiesConfiguration("policies");
    properties.setReloadingStrategy(reloader);
    properties.getLayout().setGlobalSeparator(" ");
    loadPolicies();
  }
View Full Code Here
173
174
175
176
177
178
179
180
        this.m_eventMMap = ecdw.get_eventMap();
        this.m_keyMMap = ecdw.get_keyMap();
    }

    protected final void createBlankCache() {
        this.m_eventMMap = new MultiValueMap();
        this.m_keyMMap = new MultiValueMap();
    }
View Full Code Here
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
    public void executeTask( DependencyGraph graph )
    {
        DependencyGraphWalker walker = new WalkDepthFirstSearch();
        RefineConflictsVisitor refineConflictsVisitor = new RefineConflictsVisitor();
       
        MultiValueMap depMap = new MultiValueMap();

        // Identify deps that need to be resolved.
        for ( DependencyGraphNode node : graph.getNodes() )
        {
            String key = DependencyGraphKeys.toManagementKey( node.getArtifact() );
            // This will add this node to the specified key, not replace a previous one.
            depMap.put( key, node );
        }

        // Process those depMap entries with more than 1 value.
        ToArtifactReferenceTransformer nodeToArtifact = new ToArtifactReferenceTransformer();

        Iterator<Map.Entry<String,Collection<DependencyGraphNode>>> it = depMap.entrySet().iterator();
        while ( it.hasNext() )
        {
            Map.Entry<String,Collection<DependencyGraphNode>> entry = it.next();
            Collection<DependencyGraphNode> nodes = entry.getValue();
            if ( nodes.size() > 1 )
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
61
62
        // defaults first
        parserRegistry.put("properties", new PropertiesDescriptorParser());

        final Iterator<DescriptorParser> it = ServiceRegistry.lookupProviders(DescriptorParser.class);

        MultiMap overrides = new MultiValueMap();
        while (it.hasNext())
        {
            final DescriptorParser parser = it.next();
            overrides.put(parser.getSupportedFormat(), parser);
        }
        mergeParserOverrides(overrides);
    }
View Full Code Here
353
354
355
356
357
358
359
360
361
362
363
                return;

            default:
                // We must duplicate the treeSet and the hashMap
                avas = new ArrayList<Ava>();
                avaTypes = new MultiValueMap();

                for ( Ava currentAva : rdn.avas )
                {
                    avas.add( ( Ava ) currentAva.clone() );
                    avaTypes.put( currentAva.getNormType(), currentAva );
View Full Code Here
507
508
509
510
511
512
513
514
515
516
517
                // First, create the HashMap,
                avas = new ArrayList<Ava>();

                // and store the existing Ava into it.
                avas.add( ava );
                avaTypes = new MultiValueMap();
                avaTypes.put( avaType, ava );

                ava = null;

                // Now, fall down to the commmon case
View Full Code Here
561
562
563
564
565
566
567
568
569
570
571
                // First, create the HashMap,
                avas = new ArrayList<Ava>();

                // and store the existing Ava into it.
                avas.add( ava );
                avaTypes = new MultiValueMap();
                avaTypes.put( avaType, ava );

                this.ava = null;

                // Now, fall down to the commmon case
View Full Code Here
776
777
778
779
780
781
782
783
784
785
786
                    rdn.avaTypes = avaTypes;
                    break;

                default:
                    // We must duplicate the treeSet and the hashMap
                    rdn.avaTypes = new MultiValueMap();
                    rdn.avas = new ArrayList<Ava>();

                    for ( Ava currentAva : this.avas )
                    {
                        rdn.avas.add( ( Ava ) currentAva.clone() );
View Full Code Here
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
                break;

            default:
                avas = new ArrayList<Ava>();

                avaTypes = new MultiValueMap();

                for ( int i = 0; i < nbAvas; i++ )
                {
                    Ava ava = new Ava( schemaManager );
                    ava.readExternal( in );
View Full Code Here
TOP

Related Classes of org.apache.commons.collections.map.MultiValueMap$ReflectionFactory

  • Main
  • Node
  • org.apache.cocoon.caching.impl.AbstractDoubleMapEventRegistry
  • org.apache.commons.collections.iterators.IteratorChain
  • org.apache.directory.api.ldap.model.name.Rdn
  • org.apache.directory.shared.ldap.model.name.Rdn
  • org.apache.directory.studio.schemaeditor.controller.ProjectsHandler
  • org.apache.directory.studio.schemaeditor.controller.SchemaHandler
  • org.apache.directory.studio.schemaeditor.model.DependenciesComputer
  • org.apache.directory.studio.schemaeditor.model.hierarchy.HierarchyManager
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.