aria-label="<la:message key="labels.chat_input_placeholder" />"></textarea>
								<button type="button" id="sendBtn" class="btn btn-primary" aria-label="<la:message key="labels.chat_send" />">
									<i class="fa fa-paper-plane" aria-hidden="true"></i>
								</button>
							</div>
							<div class="input-footer">
								<span class="input-hint"><la:message key="labels.chat_input_hint" /></span>

									aria-label="<la:message key="labels.chat_input_placeholder" />"></textarea>
								<button type="button" id="sendBtn" class="btn btn-primary" aria-label="<la:message key="labels.chat_send" />">
									<i class="fa fa-paper-plane" aria-hidden="true"></i>
								</button>
							</div>
							<div class="input-footer">
								<span class="input-hint"><la:message key="labels.chat_input_hint" /></span>

 * @author Kurt Alfred Kluever
 */
enum BloomFilterStrategies implements BloomFilter.Strategy {
  /**
   * See "Less Hashing, Same Performance: Building a Better Bloom Filter" by Adam Kirsch and Michael
   * Mitzenmacher. The paper argues that this trick doesn't significantly deteriorate the
   * performance of a Bloom filter (yet only needs two 32bit hash functions).
   */
  MURMUR128_MITZ_32() {
    @Override

     * and then to XOR them together.  The strideTable enables us to hash an int followed by 12
     * zero bytes (3 ints), while the byteTable is for advancing one byte at a time.
     * This algorithm is due to the paper "Everything we know about CRC but [are] afraid to forget"
     * by Kadatch and Jenkins, 2010.
     */

    Crc32cHasher() {
      super(16);
    }

    private boolean finished = false;

    /*

    License along with this library; if not, write to the Free Software
    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301
    USA

Also add information on how to contact you by electronic and paper mail.

You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the library, if
necessary.  Here is a sample; alter the names:

can only have outcomes explained by some sequentially consistent interleaving
of the goroutine executions.
(The proof is the same as Section 7 of Boehm and Adve's paper cited above.)
This property is called DRF-SC.
</p>

<p>
The intent of the formal definition is to match
the DRF-SC guarantee provided to race-free programs

    You should have received a copy of the GNU Affero General Public License
    along with this program.  If not, see <https://www.gnu.org/licenses/>.

Also add information on how to contact you by electronic and paper mail.

  If your software can interact with users remotely through a computer
network, you should also make sure that it provides a way for users to
get its source.  For example, if your program is a web application, its

    along with this program; if not, write to the Free Software
    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1335 USA

Also add information on how to contact you by electronic and paper mail.

If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:

    Gnomovision version 69, Copyright (C) year name of author

                                                    arg2="${f:h(pager.allRecordCount)}"/>
                                    </div>
                                    <div class="col-sm-10">
                                        <ul class="pagination pagination-sm m-0 float-right">
                                            <c:if test="${pager.existPrePage}">

        final UserPager pager = new UserPager();
        assertEquals(0, pager.getAllRecordCount());

        pager.setAllRecordCount(100);
        assertEquals(100, pager.getAllRecordCount());
    }

    @Test
    public void test_userPager_allPageCount() {
        final UserPager pager = new UserPager();
        assertEquals(0, pager.getAllPageCount());

        pager.setAllPageCount(10);