This file is indexed.

/usr/include/soprano/nodepattern.h is in libsoprano-dev 2.9.4+dfsg-5.

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
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
/*
 * This file is part of Soprano Project.
 *
 * Copyright (C) 2007 Sebastian Trueg <trueg@kde.org>
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Library General Public
 * License as published by the Free Software Foundation; either
 * version 2 of the License, or (at your option) any later version.
 *
 * This library 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
 * Library General Public License for more details.
 *
 * You should have received a copy of the GNU Library General Public License
 * along with this library; see the file COPYING.LIB.  If not, write to
 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
 * Boston, MA 02110-1301, USA.
 */

#ifndef _SOPRANO_NODE_PATTERN_H_
#define _SOPRANO_NODE_PATTERN_H_

#include <QtCore/QSharedDataPointer>
#include <QtCore/QString>

#include "soprano_export.h"
#include "node.h"

namespace Soprano {

    class BindingSet;

    namespace Inference {
        /**
         * \class NodePattern nodepattern.h Soprano/Inference/NodePattern
         *
         * \brief Smallest building block of an inference Rule.
         *
         * There are two types of NodePattern:
         * \li Simple nodes that wrap around an instance or Node
         *     and only match against that particular node.
         * \li Variable nodes that match against every Node and
         *     have a name.
         *
         * \author Sebastian Trueg <trueg@kde.org>
         */
        class SOPRANO_EXPORT NodePattern
        {
        public:
            NodePattern();
            NodePattern( const Node& );
            NodePattern( const QString& varname );
            NodePattern( const NodePattern& );
            ~NodePattern();

            NodePattern& operator=( const NodePattern& );

            bool isVariable() const;

            /**
             * \returns the associated resource of an invalid Node
             * if this is a variable.
             */
            Node resource() const;

            /**
             * \returns The name of the variable or an empty string
             * if this is not a variable.
             */
            QString variableName() const;

            /**
             * Match a Node against this pattern.
             * Variables will match any Node while
             * specific %node patterns will only match
             * that one particular Node.
             * \return true if node mathes this pattern.
             */
            bool match( const Node& node ) const;

            QString createSparqlNodePattern( const BindingSet& bindings ) const;

            /**
             * \return \p true if the pattern is valid.
             *
             * \since 2.3
             */
            bool isValid() const;

        private:
            class Private;
            QSharedDataPointer<Private> d;
        };
    }
}

SOPRANO_EXPORT QDebug operator<<( QDebug s, const Soprano::Inference::NodePattern& );

#endif