This file is indexed.

/usr/include/libGIFTAcInvertedFile/include/CADIHash.h is in libgnuift0-dev 0.1.14-12.1ubuntu1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
/* -*- mode: c++ -*- 
*/
/* 

    GIFT, a flexible content based image retrieval system.
    Copyright (C) 1998, 1999, 2000, 2001, 2002, CUI University of Geneva

     Copyright (C) 2003, 2004 Bayreuth University
      2005 Bamberg University
    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program; if not, write to the Free Software
    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

*/
#ifndef _CADIHash
#define _CADIHash
#include "libGIFTAcInvertedFile/include/uses-declarations.h"
#include <map>
#include "libMRML/include/TID.h"

#include "libGIFTAcInvertedFile/include/CAdditionalDocumentInformation.h"
#include <fstream>

/**
*
* CADIHash
*
*
*
* modification history:
*
*@Author: Wolfgang Müller
*
* Changes:
* HM 090399 created the documentation
*
* compiler defines used:
*
* A hash for additional document information (hashed by document ID) 
* 
*
*/
class CADIHash:public map<TID,
		CAdditionalDocumentInformation,
		less<TID> >{
public:
  
/**
 *
 * Writing ADI for each document to its own
 *
 */
  inline bool output()const{
    bool lRetVal=true;

    for(const_iterator i=begin();
	i!=end();
	i++){
      lRetVal= lRetVal && (*i).second.output();
    }

    return lRetVal;
  }
};
#endif