src/share/vm/gc_implementation/shenandoah/shenandoahStrDedupTable.hpp

rev 10715 : [backport] Cleanup up superfluous newlines
rev 10772 : [backport] Update copyrights

@@ -1,7 +1,7 @@
 /*
- * Copyright (c) 2017, 2018, Red Hat, Inc. and/or its affiliates.
+ * Copyright (c) 2017, 2018, Red Hat, Inc. All rights reserved.
  *
  * This code is free software; you can redistribute it and/or modify it
  * under the terms of the GNU General Public License version 2 only, as
  * published by the Free Software Foundation.
  *

@@ -68,11 +68,10 @@
 
   void set_obj(typeArrayOop obj) {
     _obj = obj;
   }
 
-
   bool equals(typeArrayOop value, unsigned int hash) const {
     return (hash == this->hash() &&
             equals(value, obj()));
   }
 

@@ -136,11 +135,10 @@
   size_t size()    const    { return _size; }
   bool need_rehash() const  { return _rehash_needed; }
   bool need_expand() const  { return _entries >= _grow_threshold && size() < max_size(); }
   bool need_shrink() const  { return _entries <= _shrink_threshold && size() > min_size(); }
 
-
   // parallel scanning the table
   void clear_claimed();
   size_t claim();
   void parallel_oops_do(OopClosure* cl);
 

@@ -156,12 +154,12 @@
   void print_statistics(outputStream* out) const;
 
   static size_t min_size() { return _min_size; }
   static size_t max_size() { return _max_size; }
 
-
   void verify() PRODUCT_RETURN;
+
 private:
   inline bool use_java_hash() {
     return _hash_seed == 0;
   }
 

@@ -234,11 +232,10 @@
 protected:
   ShenandoahStrDedupTable* const src_table()  const { return _src_table; }
   ShenandoahStrDedupTable* const dest_table() const { return _dest_table; }
 };
 
-
 // The task rehashes live entries from source table to destination table.
 // Source and destination tables are not necessary the same size.
 class ShenandoahStrDedupTableRehashTask : public ShenandoahStrDedupTableRemapTask {
 public:
   ShenandoahStrDedupTableRehashTask(ShenandoahStrDedupTable* const src,