Package edu.harvard.wcfia.yoshikoder.dictionary

Examples of edu.harvard.wcfia.yoshikoder.dictionary.Node

37
38
39
40
41
42
43
44
45
46
47
    }

    protected void recurse(Map nameToNodes, Node node){
        if (node instanceof CategoryNode){
            for (Enumeration en = node.children(); en.hasMoreElements();){
                Node n = (Node)en.nextElement();
                recurse(nameToNodes, n);
            }
        } else {
            String nodeName = node.getName();
            List l = (List)nameToNodes.get(nodeName);
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
    }
   
    public void actionPerformed(ActionEvent e) {
        YKDictionary dict = yoshikoder.getDictionary();
        Map nameToNodes = new HashMap();
        Node root = dict.getDictionaryRoot();
        recurse(nameToNodes, root); // full nameToNodes
        StringBuffer sb = new StringBuffer();
        int duplicatePatterns = 0;
        for (Iterator iter = nameToNodes.entrySet().iterator(); iter.hasNext();) {
            Map.Entry entry = (Map.Entry)iter.next();
            List l = (List)entry.getValue();
            if (l.size() > 1){
                duplicatePatterns++;
                sb.append("\"" + (String)entry.getKey() + "\" appears in categories:\n");
                for (Iterator iterator = l.iterator(); iterator.hasNext();) {
                    Node node = (Node) iterator.next();
                    TreePath path = dict.getPath((Node)node.getParent());
                    sb.append("\t" + path.getPathComponent(0).toString());
                    for (int ii = 1; ii < path.getPathCount(); ii++) {
                        sb.append(">" + path.getPathComponent(ii).toString()); // path
                    }
                    sb.append("\n");
View Full Code Here
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
           
            if ((doc1 == null) || (doc2 == null)){
                return;           
            }
           
            Node n = yoshikoder.getSelectedNode();
            CategoryNode cnode = null;
            if (n instanceof CategoryNode)
              cnode = (CategoryNode)n;
            else // patternnode
              cnode = (CategoryNode)n.getParent();
            final CategoryNode catnode = cnode;
           
            dworker = new DialogWorker(yoshikoder){
                protected void doWork() throws Exception {
                    DocumentList dl = new DocumentListImpl();
View Full Code Here
44
45
46
47
48
49
50
51
52
53
54
    public void dragEnter(DropTargetDragEvent dtde) {
        dragOver(dtde);
    }

    public void dragOver(DropTargetDragEvent dtde) {
        Node node = getNodeForEvent(dtde);
        if (node instanceof PatternNode)
            dtde.rejectDrag();
        else
            dtde.acceptDrag(DnDConstants.ACTION_MOVE);
    }
View Full Code Here
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
        TreePath parentpath = targetTree.getClosestPathForLocation(pt.x, pt.y);

        // For simplicity's sake, we'll assume that the tree uses the
        // DefaultTreeModel
        // and DefaultMutableTreeNode classes.
        Node parent = (Node)parentpath.getLastPathComponent();

        // Now check to see if it was dropped on a folder. If not, reject it.
        if (parent instanceof PatternNode) {
            dtde.rejectDrop();
            return;
        }

        try {
            // Grab the data.
            Transferable tr = dtde.getTransferable();
            DataFlavor[] flavors = tr.getTransferDataFlavors();
            for (int i = 0; i < flavors.length; i++) {
                if (tr.isDataFlavorSupported(flavors[i])) {
                    // It's a usable node, so pull it out of the transferable
                    // object and add it
                    // to our tree.
                    dtde.acceptDrop(DnDConstants.ACTION_MOVE);
                    TreePath p = (TreePath)tr.getTransferData(flavors[i]);
                    Node node = (Node)p.getLastPathComponent();
                    YKDictionary dict = (YKDictionary)targetTree.getModel();
                    if (node instanceof PatternNode)
                        dict.addPattern((PatternNode)node, (CategoryNode)parent);
                    else if (node instanceof CategoryNode)
                      dict.addCategory((CategoryNode)node, (CategoryNode)parent);   
View Full Code Here
96
97
98
99
100
101
102
103
104
105
    }

    protected TreePath getTreePath(Node n){
        List l = new ArrayList();
        l.add(n);
        Node parent = n;
        while ((parent = (Node)parent.getParent()) != null)
            l.add(0, parent);
        return new TreePath( l.toArray(new Node[l.size()]) );
    }
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
            boolean sel, boolean expanded, boolean leaf, int row,
            boolean focus) {

        super.getTreeCellRendererComponent(tree, value, sel, expanded,
                leaf, row, hasFocus);
        Node n = (Node)value;
        if (n instanceof PatternNode)
            setIcon(patternIcon);
        else
            if (expanded)
                setIcon(categoryOpenIcon);
            else
                setIcon(categoryClosedIcon);
        setToolTipText(n.getPopup());

        return this;
    }
View Full Code Here
170
171
172
173
174
175
176
177
178
179
180
            CategoryNode cn = (CategoryNode)n;          
            sb.append(toHTML(cn));
            sb.append("<ul>\n");
            Enumeration<Node> en = cn.children();
            while (en.hasMoreElements()){
                Node child = en.nextElement();
                recurseHTML(child, sb);
            }
            sb.append("</ul>\n");
        } else {
            PatternNode pn = (PatternNode)n;
View Full Code Here
678
679
680
681
682
683
684
685
686
687
688
        if (n instanceof CategoryNode){
            CategoryNode cn = (CategoryNode)n;
            sb.append(toXML(cn));
            Enumeration<Node> en = cn.children();
            while (en.hasMoreElements()){
                Node child = en.nextElement();
                recurse(child, sb);
            }
            sb.append("</cnode>\n");
        } else {
            PatternNode pn = (PatternNode)n;
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
    public void endElement(String uri, String localName, String qName)
      throws SAXException{
   
        if (qName.equals("name")){ //$NON-NLS-1$
            String name = sb.toString();
            Node node = (Node)stack.peek();
            node.setName(name);
           
            if (inPattern){
                try {
                    PatternNode pn = (PatternNode)node;
                    Pattern p = engine.makeRegexp(name); // because there will be only one word in it
                    pn.setPattern(p);
                } catch (PatternSyntaxException pse){
                    throw new SAXException(pse);
                }
            }
       
        } else if (qName.equals("score")){ //$NON-NLS-1$
            String score = sb.toString();
            try {
                double d = Double.parseDouble(score);
                Node node = (Node)stack.peek();
                node.setScore(new Double(d));
            } catch (NumberFormatException nfe){
                throw new SAXException(nfe);
            }
           
        } else if (qName.equals("comment")){ //$NON-NLS-1$
            CategoryNode node = (CategoryNode)stack.peek();
            node.setDescription(sb.toString());
           
        } else if (qName.equals("category")){ //$NON-NLS-1$
          stack.pop();
     
        } else if (qName.equals("pattern")){ //$NON-NLS-1$
View Full Code Here
TOP

Related Classes of edu.harvard.wcfia.yoshikoder.dictionary.Node

  • edu.harvard.wcfia.yoshikoder.AddCategoryAction
  • edu.harvard.wcfia.yoshikoder.AddHighlightsAction
  • edu.harvard.wcfia.yoshikoder.AddPatternAction
  • edu.harvard.wcfia.yoshikoder.AddWordsToCategoryAction
  • edu.harvard.wcfia.yoshikoder.ConcordanceFrequencyReportAction
  • edu.harvard.wcfia.yoshikoder.DictionaryRRDocumentComparisonAction
  • edu.harvard.wcfia.yoshikoder.DuplicateReportAction
  • edu.harvard.wcfia.yoshikoder.EditNodeAction
  • edu.harvard.wcfia.yoshikoder.MakeConcordanceAction
  • edu.harvard.wcfia.yoshikoder.MultipleConcordanceFrequencyReportAction
    • 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.