Searched refs:toRemove (Results 1 - 9 of 9) sorted by relevance

/openjdk7/jdk/src/share/sample/nio/file/
H A DChmod.java122 final Set<PosixFilePermission> toRemove = new HashSet<PosixFilePermission>();
204 if (r) toRemove.add(OWNER_READ);
205 if (w) toRemove.add(OWNER_WRITE);
206 if (x) toRemove.add(OWNER_EXECUTE);
209 if (r) toRemove.add(GROUP_READ);
210 if (w) toRemove.add(GROUP_WRITE);
211 if (x) toRemove.add(GROUP_EXECUTE);
214 if (r) toRemove.add(OTHERS_READ);
215 if (w) toRemove.add(OTHERS_WRITE);
216 if (x) toRemove
[all...]
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Filter/src/com/sun/hotspot/igv/filter/
H A DRemoveSelfLoopsFilter.java57 List<Connection> toRemove = new ArrayList<Connection>();
61 toRemove.add(c);
65 for (Connection c : toRemove) {
/openjdk7/jdk/src/share/classes/javax/swing/
H A DJSplitPane.java990 Component toRemove;
1011 toRemove = getLeftComponent();
1012 if (toRemove != null) {
1013 remove(toRemove);
1020 toRemove = getRightComponent();
1021 if (toRemove != null) {
1022 remove(toRemove);
H A DJTree.java3650 * <code>toRemove</code>
3653 * @param toRemove an enumeration of the paths to remove; a value of
3655 * @throws ClassCastException if {@code toRemove} contains an
3660 removeDescendantToggledPaths(Enumeration<TreePath> toRemove) argument
3662 if(toRemove != null) {
3663 while(toRemove.hasMoreElements()) {
3665 (toRemove.nextElement());
3707 TreePath[] toRemove = getDescendantSelectedPaths(path, includePath);
3709 if (toRemove != null) {
3710 getSelectionModel().removeSelectionPaths(toRemove);
[all...]
/openjdk7/jdk/src/share/classes/java/net/
H A DInMemoryCookieStore.java281 ArrayList<HttpCookie> toRemove = new ArrayList<HttpCookie>();
298 toRemove.add(c);
303 toRemove.add(c);
308 for (HttpCookie c : toRemove) {
313 toRemove.clear();
/openjdk7/jdk/src/share/demo/jfc/SampleTree/
H A DSampleTree.java488 ArrayList<TreePath> toRemove = new ArrayList<TreePath>();
494 toRemove.add(paths[counter]);
502 // toRemove
503 int rCount = toRemove.size();
508 if ((toRemove.get(rCounter)).isDescendant(
518 Collections.sort(toRemove, new PositionComparator());
523 removedNodes[counter] = (toRemove.get(counter)).
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/FilterWindow/src/com/sun/hotspot/igv/filterwindow/
H A DFilterTopComponent.java143 List<Filter> toRemove = new ArrayList<Filter>();
146 toRemove.add(f);
149 for (Filter f : toRemove) {
184 FilterSetting toRemove = null;
189 toRemove = s;
197 if (toRemove != null) {
198 filterSettings.remove(toRemove);
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java262 Set<Pair> toRemove = new HashSet<Pair>();
265 toRemove.add(p);
268 pairs.removeAll(toRemove);
/openjdk7/jdk/src/share/classes/java/lang/
H A DClass.java2587 void removeByNameAndSignature(Method toRemove) { argument
2591 m.getReturnType() == toRemove.getReturnType() &&
2592 m.getName() == toRemove.getName() &&
2594 toRemove.getParameterTypes())) {

Completed in 86 milliseconds