< prev index next >

src/java.base/share/classes/java/util/stream/DistinctOps.java

Print this page
rev 51700 : [mq]: 8210347-Combine-subsequent-calls-to-Set-contains-and-Set-add
   1 /*
   2  * Copyright (c) 2012, 2013, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.  Oracle designates this
   8  * particular file as subject to the "Classpath" exception as provided
   9  * by Oracle in the LICENSE file that accompanied this code.
  10  *
  11  * This code is distributed in the hope that it will be useful, but WITHOUT
  12  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  13  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  14  * version 2 for more details (a copy is included in the LICENSE file that
  15  * accompanied this code).
  16  *
  17  * You should have received a copy of the GNU General Public License version
  18  * 2 along with this work; if not, write to the Free Software Foundation,
  19  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  20  *
  21  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  22  * or visit www.oracle.com if you need additional information or have any


 153                         }
 154                     };
 155                 } else {
 156                     return new Sink.ChainedReference<T, T>(sink) {
 157                         Set<T> seen;
 158 
 159                         @Override
 160                         public void begin(long size) {
 161                             seen = new HashSet<>();
 162                             downstream.begin(-1);
 163                         }
 164 
 165                         @Override
 166                         public void end() {
 167                             seen = null;
 168                             downstream.end();
 169                         }
 170 
 171                         @Override
 172                         public void accept(T t) {
 173                             if (!seen.contains(t)) {
 174                                 seen.add(t);
 175                                 downstream.accept(t);
 176                             }
 177                         }
 178                     };
 179                 }
 180             }
 181         };
 182     }
 183 }
   1 /*
   2  * Copyright (c) 2012, 2018, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.  Oracle designates this
   8  * particular file as subject to the "Classpath" exception as provided
   9  * by Oracle in the LICENSE file that accompanied this code.
  10  *
  11  * This code is distributed in the hope that it will be useful, but WITHOUT
  12  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  13  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  14  * version 2 for more details (a copy is included in the LICENSE file that
  15  * accompanied this code).
  16  *
  17  * You should have received a copy of the GNU General Public License version
  18  * 2 along with this work; if not, write to the Free Software Foundation,
  19  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  20  *
  21  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  22  * or visit www.oracle.com if you need additional information or have any


 153                         }
 154                     };
 155                 } else {
 156                     return new Sink.ChainedReference<T, T>(sink) {
 157                         Set<T> seen;
 158 
 159                         @Override
 160                         public void begin(long size) {
 161                             seen = new HashSet<>();
 162                             downstream.begin(-1);
 163                         }
 164 
 165                         @Override
 166                         public void end() {
 167                             seen = null;
 168                             downstream.end();
 169                         }
 170 
 171                         @Override
 172                         public void accept(T t) {
 173                             if (seen.add(t)) {

 174                                 downstream.accept(t);
 175                             }
 176                         }
 177                     };
 178                 }
 179             }
 180         };
 181     }
 182 }
< prev index next >