Package net.sourceforge.processdash.data

Examples of net.sourceforge.processdash.data.ListData.asList()


            this.context = context;
        }

        public List getTaggedData(String dataName) {
            ListData result = ListData.asListData(context.get(dataName));
            return (result == null ? null : result.asList());
        }

    }

}
View Full Code Here


        SimpleData sd = getSimpleValue(dataName);
        ListData ld = ListData.asListData(sd);
        if (ld == null)
            return null;

        List result = new ArrayList(ld.asList());
        for (int i = result.size(); i-- > 0;) {
            Object item = result.get(i);
            if (item instanceof SimpleData)
                result.set(i, convert((SimpleData) item));
        }
View Full Code Here

        // get a list of the official, acceptable phases in the controlling
        // process definition.
        ListData phaseListSpec = onePmTask.getAcceptableNodeTypes();
        if (phaseListSpec == null || !phaseListSpec.test())
            return;
        List phaseList = phaseListSpec.asList();
        int postmortemPos = phaseList.indexOf("Postmortem");
        if (postmortemPos == -1)
            return;

        // find the tasks that immediately follow this postmortem task which
View Full Code Here

        if (queryParameters.containsKey(DB_MODE_PARAM)) {
            DatabasePlugin plugin = QueryUtils.getDatabasePlugin(data);
            ListData criteria = getDatabaseCriteria(data, prefix,
                queryParameters);
            if (plugin != null && criteria != null)
                ImportedDefectManager.run(plugin, criteria.asList(), t);

        } else {
            String [] prefixes = ResultSet.getPrefixList
                    (data, queryParameters, prefix);
            boolean includeChildren = !queryParameters.containsKey(NO_CHILDREN_PARAM);
View Full Code Here

    }
   
    private void recalcNodeTypeSpecs(EVTask task, Set result) {
        ListData l = task.nodeTypeSpec;
        if (l != null && l.size() > 0)
            result.add(l.asList());
        for (int i = task.getNumChildren();  i-- > 0; )
            recalcNodeTypeSpecs(task.getChild(i), result);
    }

    public List findTasksByFullName(String fullName) {
View Full Code Here

        // complete filter criteria for the current project.
        if (filterMode == FilterMode.ALL) {
            ListData filter = ListData.asListData(ctx.getData()
                    .getInheritableValue(prefix, "DB_Filter_Criteria"));
            if (filter != null)
                return filter.asList();
        }

        // otherwise, construct a filter limiting to the current project.
        List result = new ArrayList();
        result.add(QueryUtils.PROJECT_CRITERIA);
View Full Code Here

        result.add(QueryUtils.PROJECT_CRITERIA);

        ListData filter = ListData.asListData(ctx.getData()
                .getInheritableValue(prefix, "DB_Project_Keys"));
        if (filter != null)
            result.addAll(filter.asList());

        return result;
    }

    private Collection<String> getPlanItemEntityNames() {
View Full Code Here

                + CHART_ORDERING_SETTING);
        if (sd == null)
            sd = data.getSimpleValue(SETTINGS_PREFIX + GLOBAL_QUALIFIER
                    + CHART_ORDERING_SETTING);
        ListData l = ListData.asListData(sd);
        return (l == null ? Collections.EMPTY_LIST : l.asList());
    }
   
    /**
     * In some settings, the user is given an option of selecting a subset of
     * charts and arranging them in a preferred ordering.  This method will
View Full Code Here

        DeferredLabelLookup(DataRepository data) {
            this.data = data;
        }
        public List getTaggedData(String dataName) {
            ListData result = ListData.asListData(data.getSimpleValue(dataName));
            return (result == null ? null : result.asList());
        }
    }

}
View Full Code Here

        ListData firstItem = asList((SimpleData) i.next());
        if (firstItem == null)
            intersection = Collections.EMPTY_SET;
        else
            intersection = new HashSet(firstItem.asList());

        while (!intersection.isEmpty() && i.hasNext()) {
            ListData nextItem = asList((SimpleData) i.next());
            if (nextItem == null)
                intersection = Collections.EMPTY_SET;
View Full Code Here

TOP
Copyright © 2018 www.massapi.com. 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.