## modules/up/src/rpsl/gnu/PrefixRange.defs.h

/* [<][>][^][v][top][bottom][index][help] */

## FUNCTIONS

This source file includes following functions.

1. PrefixRangeEQ
2. PrefixRangeLE
3. PrefixRangeCMP
4. HASHTABLE_TOO_CROWDED

       1 // This may look like C code, but it is really -*- C++ -*-
       2 /*
       3 Copyright (C) 1988 Free Software Foundation
       4     written by Doug Lea (dl@rocky.oswego.edu)
       5
       6 This file is part of the GNU C++ Library.  This library is free
       7 software; you can redistribute it and/or modify it under the terms of
       8 the GNU Library General Public License as published by the Free
       9 Software Foundation; either version 2 of the License, or (at your
      10 option) any later version.  This library is distributed in the hope
      11 that it will be useful, but WITHOUT ANY WARRANTY; without even the
      12 implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
      13 PURPOSE.  See the GNU Library General Public License for more details.
      14 You should have received a copy of the GNU Library General Public
      15 License along with this library; if not, write to the Free Software
      16 Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
      17 */
      18
      19
      20 #ifndef _PrefixRangedefs_h
      21 #define _PrefixRangedefs_h 1
      22
      23 #include "config.h"
      24 #include "rpsl/prefix.hh"
      25
      26 // equality operator
      27 #ifndef PrefixRangeEQ
      28 #define PrefixRangeEQ(a, b)  ((a) == (b))
         /* [<][>][^][v][top][bottom][index][help] */
      29 #endif
      30
      31 // less-than-or-equal
      32 #ifndef PrefixRangeLE
      33 #define PrefixRangeLE(a, b)  ((a) <= (b))
         /* [<][>][^][v][top][bottom][index][help] */
      34 #endif
      35
      36 // comparison : less-than -> < 0; equal -> 0; greater-than -> > 0
      37 #ifndef PrefixRangeCMP
      38 #define PrefixRangeCMP(a, b) ( ((a) <= (b))? (((a) == (b))? 0 : -1) : 1 )
         /* [<][>][^][v][top][bottom][index][help] */
      39 #endif
      40
      41 // initial capacity for structures requiring one
      42
      43 #ifndef DEFAULT_INITIAL_CAPACITY
      44 #define DEFAULT_INITIAL_CAPACITY 100
      45 #endif
      46
      47 // HASHTABLE_TOO_CROWDED(COUNT, SIZE) is true iff a hash table with COUNT
      48 // elements and SIZE slots is too full, and should be resized.
      49 // This is so if available space is less than 1/8.
      50
      51 #define HASHTABLE_TOO_CROWDED(COUNT, SIZE) ((SIZE) - ((SIZE) >> 3) <= (COUNT))
         /* [<][>][^][v][top][bottom][index][help] */
      52
      53 #endif

/* [<][>][^][v][top][bottom][index][help] */