Hello Processing Coders!

I would like my sketch to parse some text files in a subfolder to the sketches data folder, or perhaps in arbitrary folder. However, on a mac, the OS always creates a file called ".DS_Store". I would like my sketch to only read files that have a .txt extension. In general i would like to know how to code sketches that can use arbitrary file filters. Unfortunately the JavaDoc regarding the FileFilter interface is a bit over my head, and the processing.org documentation on file i/o is sparse. Any help or code snippets would be greatly appreciated!

I'd love to be able to change the white background to a quadrille ruled background. I think that would help me see the indentation levels better. Is it possible to do that?

Greetings all,

I have a HashMap that uses a String as they key, and a composite Object as value. I have been able to convert the keys used in the hashmap into an array of Strings with a two step process:

1. HashMap words;
2. String[] keyWords;
3. Object[] temp;
4. temp = words.keySet().toArray();
5. keyWords = new String[temp.length];
6. for(int i=0; i<temp.length; i++) {
7.       keyWords[i] = temp[i].toString();
8. }

Is there anyway to do away with the temporary Object[] array and the for-loop to convert the objects to strings?
Thanks!

Greetings all,

I am trying to create an associative dictionary. This is a database which contains a record for every unique word occurring in an arbitrary set of text files. Each record should contain the word, a list of files which contain the word, and the indices into those file of each occurrence of the word in that file. Something like this:

Word                  Files                  Occurrences
able                  file1.txt                 0, 20, 35, ....
                         file2.txt                 330, 450, 453....
baker                file1.txt                 1, 15
                         file3.txt                 1,4,9
charlie              fileN.txt                 i, i1,i2,...

What I have so far is a HashMap using a Word class as the value. The Word class contains another HashMap, this time for each file that contains an occurrence of a given word. It also contains an ArrayList for the indices at which that word occurs. I've been struggling with this for a while. Is there a design pattern for this situation? I'd hate to reinvent the wheel, especially as I'm a Processing (and programming generally) noob.

I've attached my code below - its messy I know. Sorry.

1. HashMap words;  // HashMap object
2. String[] tokens;  // Array of all words from input file
3. int counter;
4. void setup() {
5.  
6.   String path = sketchPath+"/data";
7.  
8.   String[] files = listFileNames(path);
9.   println(files);
10.  
11.   words = new HashMap();
12.   for(int a=0; a<files.length; a++) { // repeat this block for each file in 'files'
13.     // Load file and chop it up
14.     String[] lines = loadStrings(files[a]);
15.     String allText = join(lines, " ");
16.     tokens = splitTokens(allText, " ,.?!:;[]-");
17.     println("Done chopping up file #: "+a+" Called "+files[a]);
18.  
19.     // Look at words one at a time
20.     while(counter<tokens.length) {
21.       String s = tokens[counter];
22.  
23.       // Is the word in the HashMap
24.       if (words.containsKey(s)) {
25.         println("database already has an entry for "+s.toUpperCase());
26.         Word w=(Word) words.get(s);
27.         w.updateWord(files[a],counter);
28.         }
29.       else {
30.         println("make a new entry for "+s.toUpperCase());
31.         Word w = new Word(files[a], s,counter);
32.         words.put(s, w);   
33.       }
34.       counter++;
35.      
36.     } // end of while loop for each word in 'tokens'
37.    
38.   } // End of for loop for each file
39.   dumpDictionary();
40. }
41. /* A routine to print out the contents of the main hash map
42. */
43. void dumpDictionary() {
44.   Iterator i = words.keySet().iterator();
45.  
46.   while (i.hasNext()) {
47.     String w = (String) i.next();
48.     print(w+": ");
49.     Word wd = (Word) words.get(w);
50.     HashMap fi = wd.fileIndices;
51.     int fs = fi.size();
52.     println(fs);
53.     //Iterator j = fi.values().iterator();
54. /*
55.     while(j.hasNext()) {
56.       ArrayList ix = (ArrayList) fi.get(w);
57.       int sz = ix.size();
58.       for(int k=0; k<sz; k++){
59.         Integer m = (Integer) ix.get(k);
60.       }
61.     }
62. */
63.   }
64. }
65. // This function returns all the files in a directory as an array of Strings 
66. String[] listFileNames(String dir) {
67.   File file = new File(dir);
68.   if (file.isDirectory()) {
69.     String names[] = file.list();
70.     return names;
71.   } else {
72.     // If it's not a directory
73.     return null;
74.   }
75. }
76.    
77. /* Word object to store in associative dictionary.
78.    Each object should store the indices of the occurence of the word in every file that's sent to it.
79.    Indices should be kept as an Array this time; use append() to update
80.    For next version try using an ArrayList.
81.    ArrayList version seems to be working, now try it in hash map experiment.
82.    Handle all checking inside class
83. */
84. class Word {
85.   int count;
86.   String word;
87.   HashMap fileIndices; // A hashMap of fileIndexes, 1 entry per file
88.   Word() {   // null-arg constructor
89.     fileIndices = new HashMap();
90.   }
91.   Word(String fileName, String word, int index) {
92.     fileIndices = new HashMap();
93.     this.word = word;
94.     count = 1;
95.     ArrayList indices = new ArrayList();
96.     indices.add(new Integer(index));
97.     fileIndices.put(fileName, indices);
98.   }
99.  
100.   /*'updateWord()' method takes a file name and index as parameters.
101.   If 'fileName' is already stored, just updated the count for that file, otherwise add 'fileName' to database,
102.   and set its first entry as 'index'.
103.   */
104.   void updateWord(String fileName, int index) {
105.     //println("update this word with "+fileName+" and index "+index);
106.     // First, Check to see if this file has already been added to this word
107.     if(fileIndices.containsKey(fileName)) {
108.       //println("we've already had this name");
109.       ArrayList temp = (ArrayList) fileIndices.get(fileName);
110.       temp.add(new Integer(index));
111.       fileIndices.put(fileName, temp);
112.     }
113.     // otherwise, add a new binding to hashMap
114.     else {
115.       //println("this name is new");
116.       ArrayList temp = new ArrayList();
117.       temp.add(new Integer(index));
118.       fileIndices.put(fileName, temp);
119.     }
120.   count++; // add 1 to word count
121.   }
122.   void dumpWord() { // a debugging method to print the word's indices
123.     int len = fileIndices.size();
124.     println("\nthis word has "+len+" indices");
125.     Iterator i = fileIndices.keySet().iterator();
126.     while(i.hasNext()) {
127.       String n = (String) i.next();
128.       ArrayList ids = (ArrayList) fileIndices.get(n);
129.       print("key "+n+" has these indices: ");
130.       for(int j=0; j<ids.size(); j++) {
131.         Integer x = (Integer) ids.get(j);
132.         print(x.val+" | ");
133.       }
134.       println();
135.     }
136.   }
137.  
138.   int getSize() {  // Return size of hashMap
139.     return(fileIndices.size());
140.   }
141.   //'incCount()' method just increments the total count varible
142.   void incCount() {
143.     count++;
144.   }
145.  
146. } // End of Word class
147. class Integer {
148.   int val;
149.  
150.   Integer() {
151.     this.val = 0;
152.   }
153.  
154.   Integer(int i) {
155.     this.val = i;
156.   }
157.  
158.   int integerVal() {
159.     return(this.val);
160.   }
161. }  

I've been teaching myself Processing and exploring some contributed libraries. The SoundCipher site has some examples using Callbacks. I can intuit what they are generally, but where can I read up on the specifics? Links to Javadocs or tutorial pages greatly appreciated!
-L