Package com.dtrules.xmlparser.XMLTree

Examples of com.dtrules.xmlparser.XMLTree.Node

81
82
83
84
85
86
87
88
89
90
91
        protected Node         mappingRoot   = null;
       
       
        private Node loadTree(InputStream s){
            try {
                Node root = XMLTree.BuildTree(s,false,false);
                return root;
            } catch (Exception e) {
                return null;
            }
           
View Full Code Here
385
386
387
388
389
390
391
392
393
394
395
396
    *
    */
   public static ArrayList<Node> findMissingNodes(String attribs[], ArrayList<Node> dts1, ArrayList<Node> dts2){
       ArrayList<Node> missing = new ArrayList<Node>();
       for(int i = dts1.size()-1; i>=0; i--){
           Node t1 = dts1.get(i);
           Node match = null;
           for(Node t2: dts2){
              
               boolean allmatch = true;
               for(String attrib : attribs){
                   if(!t1.getAttributes().get(attrib).equals(t2.getAttributes().get(attrib))){
View Full Code Here
446
447
448
449
450
451
452
453
454
455
456
457
458
    *
    */
   public static ArrayList<Node> findMissingNodes(String attrib, String tag, ArrayList<Node> dts1, ArrayList<Node> dts2){
       ArrayList<Node> missing = new ArrayList<Node>();
       for(int i = dts1.size()-1; i>=0; i--){
           Node t1 = dts1.get(i);
           String t1name = getName(t1,attrib);
           Node match = null;
           for(Node t2: dts2){
               String t2name = getName(t2,attrib);
              
               if(t1name.equals(t2name)){
                   match = t2;
View Full Code Here
554
555
556
557
558
559
560
561
562
563
564
565
       if(rules1.dts == null || rules2.dts == null){
           report.closetag();
           return;
       }

       Node root1 = rules1.getDtsRoot();
       Node root2 = rules2.getDtsRoot();


       ArrayList<Node> decisionTables1 = findtables(root1);
       ArrayList<Node> decisionTables2 = findtables(root2);
View Full Code Here
664
665
666
667
668
669
670
671
672
673
674
675
           }      
           report.closetag();
           return;
       }
      
       Node root1 = rules1.getEddRoot();
       Node root2 = rules2.getEddRoot();
      
       ArrayList<Node> entities1 = findentities(root1);
       ArrayList<Node> entities2 = findentities(root2);
      
       if(entities1.size()==0){
View Full Code Here
739
740
741
742
743
744
745
746
747
748
749
750
       if(rules1.mapping == null || rules2.mapping == null){
           report.closetag();
           return differences;
       }
  
       Node root1 = rules1.getMappingRoot();
       Node root2 = rules2.getMappingRoot();
       {       
           ArrayList<Node> attributes1 = findnodes("setattribute",root1,null);
           ArrayList<Node> attributes2 = findnodes("setattribute",root2,null);
          
           if(attributes1.size()==0){
View Full Code Here
580
581
582
583
584
585
586
587
588
589
590
        boolean changes = false;
        boolean missingResults = false;
        File files[] = outputs.listFiles();
        for(File file : files){
            if(file.getName().endsWith("_results.xml")){
                Node result1=null, result2=null;
                try{
                    result1 = XMLTree.BuildTree(new FileInputStream(file),false,false);
                    result2 = XMLTree.BuildTree(new FileInputStream(getResultDirectory()+file.getName()),false, false);
                    if(result1 != null && result2 != null){
                        removeIds(result1);
View Full Code Here
383
384
385
386
387
388
389
390
391
392
393
394
    *
    */
   public static ArrayList<Node> findMissingNodes(String attribs[], ArrayList<Node> dts1, ArrayList<Node> dts2){
       ArrayList<Node> missing = new ArrayList<Node>();
       for(int i = dts1.size()-1; i>=0; i--){
           Node t1 = dts1.get(i);
           Node match = null;
           for(Node t2: dts2){
              
               boolean allmatch = true;
               for(String attrib : attribs){
                   if(!t1.getAttributes().get(attrib).equals(t2.getAttributes().get(attrib))){
View Full Code Here
444
445
446
447
448
449
450
451
452
453
454
455
456
    *
    */
   public static ArrayList<Node> findMissingNodes(String attrib, String tag, ArrayList<Node> dts1, ArrayList<Node> dts2){
       ArrayList<Node> missing = new ArrayList<Node>();
       for(int i = dts1.size()-1; i>=0; i--){
           Node t1 = dts1.get(i);
           String t1name = getName(t1,attrib);
           Node match = null;
           for(Node t2: dts2){
               String t2name = getName(t2,attrib);
              
               if(t1name.equals(t2name)){
                   match = t2;
View Full Code Here
552
553
554
555
556
557
558
559
560
561
562
563
       if(rules1.dts == null || rules2.dts == null){
           report.closetag();
           return;
       }

       Node root1 = rules1.getDtsRoot();
       Node root2 = rules2.getDtsRoot();


       ArrayList<Node> decisionTables1 = findtables(root1);
       ArrayList<Node> decisionTables2 = findtables(root2);
View Full Code Here
TOP

Related Classes of com.dtrules.xmlparser.XMLTree.Node

  • com.dtrules.automapping.access.XMLAttribute
  • com.dtrules.automapping.access.XMLSource
  • com.dtrules.automapping.AutoDataMap
  • com.dtrules.testsupport.ATestHarness
  • com.dtrules.testsupport.ChangeReport
  • com.dtrules.testsupport.ChangeReport$RulesConfig
    • 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.