parser/html/jArray.h

   1 /* ***** BEGIN LICENSE BLOCK *****
   2  * Version: MPL 1.1/GPL 2.0/LGPL 2.1
   3  *
   4  * The contents of this file are subject to the Mozilla Public License Version
   5  * 1.1 (the "License"); you may not use this file except in compliance with
   6  * the License. You may obtain a copy of the License at
   7  * http://www.mozilla.org/MPL/
   8  *
   9  * Software distributed under the License is distributed on an "AS IS" basis,
  10  * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
  11  * for the specific language governing rights and limitations under the
  12  * License.
  13  *
  14  * The Original Code is HTML Parser C++ Translator code.
  15  *
  16  * The Initial Developer of the Original Code is
  17  * Mozilla Foundation.
  18  * Portions created by the Initial Developer are Copyright (C) 2008
  19  * the Initial Developer. All Rights Reserved.
  20  *
  21  * Contributor(s):
  22  *   Henri Sivonen <hsivonen@iki.fi>
  23  *
  24  * Alternatively, the contents of this file may be used under the terms of
  25  * either the GNU General Public License Version 2 or later (the "GPL"), or
  26  * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
  27  * in which case the provisions of the GPL or the LGPL are applicable instead
  28  * of those above. If you wish to allow use of your version of this file only
  29  * under the terms of either the GPL or the LGPL, and not to allow others to
  30  * use your version of this file under the terms of the MPL, indicate your
  31  * decision by deleting the provisions above and replace them with the notice
  32  * and other provisions required by the GPL or the LGPL. If you do not delete
  33  * the provisions above, a recipient may use your version of this file under
  34  * the terms of any one of the MPL, the GPL or the LGPL.
  35  *
  36  * ***** END LICENSE BLOCK ***** */
  37
  38 #ifndef jArray_h__
  39 #define jArray_h__
  40
  41 #define J_ARRAY_STATIC(T, L, arr) \
  42   jArray<T,L>( ((T*)arr), (sizeof(arr)/sizeof(arr[0])) )
  43
  44 template<class T, class L>
  45 class jArray {
  46   private:
  47     T* arr;
  48   public:
  49     L length;
  50     jArray(T* const a, L const len);
  51     jArray(L const len);
  52     jArray(const jArray<T,L>& other);
  53     jArray();
  54     operator T*() { return arr; }
  55     T& operator[] (L const index) { return arr[index]; }
  56     void release() { delete[] arr; arr = 0; length = 0; }
  57     L binarySearch(T const elem);
  58 };
  59
  60 template<class T, class L>
  61 jArray<T,L>::jArray(T* const a, L const len)
  62        : arr(a), length(len)
  63 {
  64 }
  65
  66 template<class T, class L>
  67 jArray<T,L>::jArray(L const len)
  68        : arr(len ? new T[len] : 0), length(len)
  69 {
  70 }
  71
  72 template<class T, class L>
  73 jArray<T,L>::jArray(const jArray<T,L>& other)
  74        : arr(other.arr), length(other.length)
  75 {
  76 }
  77
  78 template<class T, class L>
  79 jArray<T,L>::jArray()
  80        : arr(0), length(0)
  81 {
  82 }
  83
  84 template<class T, class L>
  85 L
  86 jArray<T,L>::binarySearch(T const elem)
  87 {
  88   L lo = 0;
  89   L hi = length - 1;
  90   while (lo <= hi) {
  91     L mid = (lo + hi) / 2;
  92     if (arr[mid] > elem) {
  93       hi = mid - 1;
  94     } else if (arr[mid] < elem) {
  95       lo = mid + 1;
  96     } else {
  97       return mid;
  98     }
  99   }
 100   return -1;
 101 }
 102
 103 #endif // jArray_h__