XRootD
Loading...
Searching...
No Matches
XrdCmsNash.hh
Go to the documentation of this file.
1
#ifndef __XRDCMSNASH_HH__
2
#define __XRDCMSNASH_HH__
3
/******************************************************************************/
4
/* */
5
/* X r d C m s N a s h . h h */
6
/* */
7
/* (c) 2007 by the Board of Trustees of the Leland Stanford, Jr., University */
8
/* All Rights Reserved */
9
/* Produced by Andrew Hanushevsky for Stanford University under contract */
10
/* DE-AC02-76-SFO0515 with the Department of Energy */
11
/* */
12
/* This file is part of the XRootD software suite. */
13
/* */
14
/* XRootD is free software: you can redistribute it and/or modify it under */
15
/* the terms of the GNU Lesser General Public License as published by the */
16
/* Free Software Foundation, either version 3 of the License, or (at your */
17
/* option) any later version. */
18
/* */
19
/* XRootD is distributed in the hope that it will be useful, but WITHOUT */
20
/* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or */
21
/* FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public */
22
/* License for more details. */
23
/* */
24
/* You should have received a copy of the GNU Lesser General Public License */
25
/* along with XRootD in a file called COPYING.LESSER (LGPL license) and file */
26
/* COPYING (GPL license). If not, see <http://www.gnu.org/licenses/>. */
27
/* */
28
/* The copyright holder's institutional names and contributor's names may not */
29
/* be used to endorse or promote products derived from this software without */
30
/* specific prior written permission of the institution or contributor. */
31
/******************************************************************************/
32
33
#include "
XrdCms/XrdCmsKey.hh
"
34
35
class
XrdCmsNash
36
{
37
public
:
38
XrdCmsKeyItem
*
Add
(
XrdCmsKey
&Key);
39
40
XrdCmsKeyItem
*
Find
(
XrdCmsKey
&Key);
41
42
int
Recycle
(
XrdCmsKeyItem
*rip);
43
44
// When allocateing a new nash, specify the required starting size. Make
45
// sure that the previous number is the correct Fibonocci antecedent. The
46
// series is simply n[j] = n[j-1] + n[j-2].
47
//
48
XrdCmsNash
(
int
psize = 17711,
int
size = 28657);
49
~XrdCmsNash
() {}
// Never gets deleted
50
51
private
:
52
53
static
const
int
LoadMax = 80;
54
55
void
Expand();
56
57
XrdCmsKeyItem
**nashtable;
58
int
prevtablesize;
59
int
nashtablesize;
60
int
nashnum;
61
int
Threshold;
62
};
63
#endif
XrdCmsKey.hh
XrdCmsKeyItem
Definition
XrdCmsKey.hh:126
XrdCmsKey
Definition
XrdCmsKey.hh:48
XrdCmsNash
Definition
XrdCmsNash.hh:36
XrdCmsNash::~XrdCmsNash
~XrdCmsNash()
Definition
XrdCmsNash.hh:49
XrdCmsNash::Add
XrdCmsKeyItem * Add(XrdCmsKey &Key)
Definition
XrdCmsNash.cc:54
XrdCmsNash::Find
XrdCmsKeyItem * Find(XrdCmsKey &Key)
Definition
XrdCmsNash.cc:129
XrdCmsNash::Recycle
int Recycle(XrdCmsKeyItem *rip)
Definition
XrdCmsNash.cc:156
XrdCms
XrdCmsNash.hh
Generated by
1.9.7