def insertPatterns(self, lst):
        """
        Insert a list of tuples to the start of the local
        patterns. Possible type literals are converted to real
        literals on the fly.  Each tuple should be contain either
        three elements (for an RDF Triplet pattern) or four, where the
        fourth element is a per-pattern constraint. (The general
        constraint of SPARQL can be optimized by assigning a
        constraint to a specific pattern; because it stops the graph
        expansion, its usage might be much more optimal than the the
        'global' constraint).

        Semantically, the behaviour induced by a graphPattern does not
        depend on the order of the patterns. However, due to the
        behaviour of the expansion algorithm, users may control the
        speed somewhat by adding patterns that would 'cut' the
        expansion tree soon (ie, patterns that reduce the available
        triplets significantly). API users may be able to do that,
        hence this additional method.

        :param lst: list consisting of either a three- or four-element tuples

        """

        for i in xrange(1 -len(lst), -1, -1):
            self.insertPattern(lst[i])
dataset/ETHPy150Open RDFLib/rdfextras/rdfextras/sparql/graph.py/GraphPattern.insertPatterns/swapped operands of `-`