1056N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 1056N/A * This code is free software; you can redistribute it and/or modify it 1056N/A * under the terms of the GNU General Public License version 2 only, as 1056N/A * published by the Free Software Foundation. Oracle designates this 1056N/A * particular file as subject to the "Classpath" exception as provided 1056N/A * by Oracle in the LICENSE file that accompanied this code. 1056N/A * This code is distributed in the hope that it will be useful, but WITHOUT 1056N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 1056N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 1056N/A * version 2 for more details (a copy is included in the LICENSE file that 1056N/A * You should have received a copy of the GNU General Public License version 1056N/A * 2 along with this work; if not, write to the Free Software Foundation, 1056N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 1056N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 1056N/A * (C) Copyright IBM Corp. 1998-2004 - All Rights Reserved 1056N/A These are the rolled-up versions of the uniform binary search. 1056N/A Someday, if we need more performance, we can un-roll them. 1056N/A Note: I put these in the base class, so they only have to 1056N/A be written once. Since the base class doesn't define the 1056N/A segment table, these routines assume that it's right after 1056N/A Another way to do this is to put each of these routines in one 1056N/A of the derived classes, and implement it in the others by casting 1056N/A the "this" pointer to the type that has the implementation.