jlObjectWrapper = getClassWrapper(J_L_OBJECT.replace(',', '.')); CallWrapper[] calls = jlObjectWrapper.getCalls(); for (int i = 0; i < calls.length; i++) { if (!"".equals(calls[i].getName())) objCalls.add(getObjComparableString(calls[i])); }
  private static void doJapize()      throws NoSuchMethodException, IllegalAccessException, IOException,             ClassNotFoundException {    // Print the header identifier. The syntax is "%%japi ver anything".    // The "anything" is currently used for name/value pairs indicating the    // creation date and creation tool.    out.println("%%japi 0.9.6 creator=japize date=" +        new SimpleDateFormat("yyyy/MM/dd_hh:mm:ss_z").format(new Date()));    // Identify whether java.lang,Object fits into our list of things to    // process. If it does, process it first, then add it to the list of    // things to avoid (and remove it from the list of roots if it appears    // there).    if (checkIncluded(J_L_OBJECT)) {      processClass(J_L_OBJECT);      if (roots.contains(J_L_OBJECT)) roots.remove(J_L_OBJECT);      exclusions.add(J_L_OBJECT);    }    // Then do the same thing with java.lang as a whole.    SortedSet langRoots = roots.subSet(J_LANG, J_LANG + '/');    if (checkIncluded(J_LANG)) {      processPackage(J_LANG);      exclusions.add(J_LANG);    // Even if java.lang isn't included, java.lang.something might be...    } else {      processRootSet(langRoots);    }        // Remove all roots that are subpackages of java.lang.    for (Iterator i = new TreeSet(langRoots).iterator(); i.hasNext(); ) {      roots.remove(i.next());    }    // Note that the following code would be more efficient but requires    // a fully-functional subSet() implementation. Doing it this way allows    // for the possibility of a hacky partial subSet() implementation, which    // could allow japize to run on Kaffe or Classpath. When they both get    // full subSet implementations, this should be changed to the more    // efficient code).//  for (Iterator i = langRoots.iterator(); i.hasNext(); ) {//    i.next(); i.remove();//  }    // Now process all the roots that are left.    processRootSet(roots);    progress("");  }