View Javadoc

1   /*
2    * Copyright (c) 2003, Henri Yandell
3    * All rights reserved.
4    * 
5    * Redistribution and use in source and binary forms, with or 
6    * without modification, are permitted provided that the 
7    * following conditions are met:
8    * 
9    * + Redistributions of source code must retain the above copyright notice, 
10   *   this list of conditions and the following disclaimer.
11   * 
12   * + Redistributions in binary form must reproduce the above copyright notice, 
13   *   this list of conditions and the following disclaimer in the documentation 
14   *   and/or other materials provided with the distribution.
15   * 
16   * + Neither the name of Genjava-Core nor the names of its contributors 
17   *   may be used to endorse or promote products derived from this software 
18   *   without specific prior written permission.
19   * 
20   * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 
21   * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
22   * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 
23   * ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 
24   * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 
25   * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 
26   * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
27   * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 
28   * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 
29   * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 
30   * POSSIBILITY OF SUCH DAMAGE.
31   */
32  // @file   ZipFinder.java
33  // @author bayard@generationjava.com
34  // @create 2000-11-18
35  // @modify 2001-05-27
36  
37  package com.generationjava.io.find;
38  
39  import java.io.File;
40  import java.util.List;
41  import java.util.ArrayList;
42  import java.util.LinkedList;
43  import java.util.Iterator;
44  import java.util.Enumeration;
45  import java.util.Map;
46  import java.util.zip.ZipFile;
47  import java.util.zip.ZipEntry;  
48  import java.util.zip.ZipException;  
49  import java.io.IOException;
50  
51  /***
52   * A Finder which finds files inside a Zip file.
53   * Will also work for jar files.
54   */
55  public class ZipFinder implements Finder {
56  
57      private List findListeners;
58  
59      public File[] find(File zip) {
60          return find(zip, new java.util.HashMap());
61      }
62  
63      public File[] find(File zipfile, Map options) {
64          String extension = null;
65          if(options.containsKey(Finder.NAME)) {
66              extension = options.get(Finder.NAME).toString();
67          }
68          List retlist = new ArrayList();
69  
70          try {
71              ZipFile zip = new ZipFile(zipfile);
72              Enumeration enum = zip.entries();
73              while(enum.hasMoreElements()) {
74                  ZipEntry entry = (ZipEntry)enum.nextElement();
75                  if(extension != null) {
76                      if(entry.getName().endsWith(extension)) {
77                          addFile(retlist, entry.getName());
78                      }
79                  } else {
80                      addFile(retlist, entry.getName());
81                  }
82              }
83          } catch(ZipException ze) {
84              throw new FinderException(ze);
85          } catch(IOException ioe) {
86              throw new FinderException(ioe);
87          }
88  
89          return (File[]) retlist.toArray(new File[0]);
90      }
91  
92      private void addFile(List list, String file) {
93          if(file.endsWith("/")) {
94              // directory
95              file = file.substring(0, file.length() - 1);
96              int idx = file.lastIndexOf("/");
97              if(idx != -1) {
98                  file = file.substring(idx+1);
99              }
100             return;
101         }
102 
103         int idx = file.lastIndexOf("/");
104         String directory = "";
105         if(idx != -1) {
106             directory = file.substring(0,idx);
107             file = file.substring(idx+1);
108         }
109         notifyFileFound(new File(directory), new File(directory, file));
110         list.add(file);
111     }
112     
113     public void addFindListener(FindListener fl) {
114         if(findListeners == null) {
115             findListeners = new LinkedList();
116         }
117         findListeners.add(fl);
118     }
119 
120     public void removeFindListener(FindListener fl) {
121         if(findListeners != null) {
122             findListeners.remove(fl);
123         }
124     }
125 
126     public void notifyDirectoryStarted(File directory) {
127         if(findListeners != null) {
128             FindEvent fe = new FindEvent(this,"directoryStarted",directory);
129             Iterator itr = findListeners.iterator();
130             while(itr.hasNext()) {
131                 FindListener findListener = (FindListener)itr.next();
132                 findListener.directoryStarted( fe );
133             }
134         }
135     }
136 
137     public void notifyDirectoryFinished(File directory, File[] files) {
138         if(findListeners != null) {
139             FindEvent fe = new FindEvent(this,"directoryFinished",directory,files);
140             Iterator itr = findListeners.iterator();
141             while(itr.hasNext()) {
142                 FindListener findListener = (FindListener)itr.next();
143                 findListener.directoryFinished( fe );
144             }
145         }
146     }
147 
148     public void notifyFileFound(File directory, File file) {
149         if(findListeners != null) {
150             FindEvent fe = new FindEvent(this,"fileFound",directory,file);
151             Iterator itr = findListeners.iterator();
152             while(itr.hasNext()) {
153                 FindListener findListener = (FindListener)itr.next();
154                 findListener.fileFound( fe );
155             }
156         }
157     }
158     
159 }