This file is indexed.

/usr/include/polybori/groebner/PolyMonomialPairComparerLexLess.h is in libbrial-groebner-dev 1.2.0-2.

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
// -*- c++ -*-
//*****************************************************************************
/** @file PolyMonomialPairComparerLexLess.h 
 *
 * @author Michael Brickenstein 
 * @date 2011-06-30 
 *
 * This file includes the definition of the class @c PolyMonomialPairComparerLexLess.
 *
 * @par Copyright:
 *   (c) 2006-2010 by The PolyBoRi Team
 *
**/
//*****************************************************************************

#ifndef polybori_groebner_PolyMonomialPairComparerLexLess_h_
#define polybori_groebner_PolyMonomialPairComparerLexLess_h_

// include basic definitions
#include "groebner_defs.h"
#include <utility> 

BEGIN_NAMESPACE_PBORIGB

/** @class PolyMonomialPairComparerLexLess
 * @brief This class defines PolyMonomialPairComparerLexLess.
 *
 **/
class PolyMonomialPairComparerLexLess{
public:
    LexOrder o;
    bool operator() (const std::pair<Polynomial,Monomial>& a,
                     const std::pair<Polynomial, Monomial>& b){
        return o.compare(a.second,b.second)==BoolePolyRing::less_than;
        
    }
};

END_NAMESPACE_PBORIGB

#endif /* polybori_PolyMonomialPairComparerLexLess_h_ */