Python sieve.sieve函数代码示例

def test3():
    s = sieve.sieve()
    i = iter(s)
    for x in sieve.sieve():
        if x > 151:
            break
    assert x == 157
    print x

def test2():
    s = sieve.sieve()
    i = iter(s)
    for x in sieve.sieve():
        if x > 10:
            break
    assert x == 11
    print x

def test3():
    sieveInstance = sieve.sieve()
    i = iter(sieveInstance)
    i.next()
    i.next()
    assert i.next() == 7
    print "Test 3 Passes"

def test(r):
    print 'Running test for', r, 'items'
    
    for n, i in zip(range(r), sieve.sieve()):
        print i
    
    print '\n'

def test1():
    s = sieve.sieve() #create an object of type sieve
    i = iter(s)       #create an interator for the object sieve

    #Check if next value is equal to 3
    #Error would occur if the value is not equal to 3
    assert i.next() == 3

def test1():
    s = sieve.sieve() #make a sieve object from file sieve
    i = iter(s) #make iterator
    val=i.next() #run iterator once, put value in val 
    assert val == 3 #check if value is 3. if not 3, fail.
    print "Value should be 3, actual value is:"
    print val

def factorize(p):
    """Returns a list of the prime factors of p.

    If a number is a factor multiple times (such as with squares or cubes), 
    it will be included in the factor list once for each multiplication.

    If p is itself prime, returns a list consisting of one element, p.

    Args:
        p: integer, the number for which to find prime factors.

    Returns:
        A list of the prime factors for p, or an empty list if p < 2.

    Raises:
        ValueError: p is < 2.
    """
    primes = sieve(p)
    # If p is prime, it should be at the end of the list and will have
    # no other factors
    if primes[-1] == p:
        return [p]
    factors = []
    for prime in primes:
        if p == 1:
            break
        # Use while instead of if for squares, cubes, etc
        while p % prime == 0:
            factors.append(prime)
            p /= prime
    return factors

    def createAlgsList(self):
        # First we populate the list of algorithms with those created
        # extending GeoAlgorithm directly (those that execute GDAL
        # using the console)
        self.preloadedAlgs = [nearblack(), information(), warp(), translate(),
                              rgb2pct(), pct2rgb(), merge(), buildvrt(), polygonize(), gdaladdo(),
                              ClipByExtent(), ClipByMask(), contour(), rasterize(), proximity(),
                              sieve(), fillnodata(), ExtractProjection(), gdal2xyz(),
                              hillshade(), slope(), aspect(), tri(), tpi(), roughness(),
                              ColorRelief(), GridInvDist(), GridAverage(), GridNearest(),
                              GridDataMetrics(), gdaltindex(), gdalcalc(), rasterize_over(),
                              # ----- OGR tools -----
                              OgrInfo(), Ogr2Ogr(), Ogr2OgrClip(), Ogr2OgrClipExtent(),
                              Ogr2OgrToPostGis(), Ogr2OgrToPostGisList(), Ogr2OgrPointsOnLines(),
                              Ogr2OgrBuffer(), Ogr2OgrDissolve(), Ogr2OgrOneSideBuffer(),
                              Ogr2OgrTableToPostGisList(), OgrSql(),
                              ]

        # And then we add those that are created as python scripts
        folder = self.scriptsFolder()
        if os.path.exists(folder):
            for descriptionFile in os.listdir(folder):
                if descriptionFile.endswith('py'):
                    try:
                        fullpath = os.path.join(self.scriptsFolder(),
                                                descriptionFile)
                        alg = GdalScriptAlgorithm(fullpath)
                        self.preloadedAlgs.append(alg)
                    except WrongScriptException as e:
                        ProcessingLog.addToLog(ProcessingLog.LOG_ERROR, e.msg)

def test2():    
    s = sieve.sieve()    
    i = iter(s)    

    for x in range(4):        
	i.next()    
    assert i.next() == 13

def test1():
    s = sieve.sieve()
    i = iter(s)
    n = i.next()
    print n
    assert n == 3
    print "***Test 1 passed!***"

def test3():
    "3 is a bigger number than 2 or 1, and thats a fact"
    s = sieve.sieve()
    i = iter(s)
    i.next()
    i.next()
    assert i.next() == 7

def test2():
    s = sieve.sieve()
    i = iter(s)
    print i.next()
    print i.next()
    assert i.next() == 7
    print "***Test 2 passed!***"

def test3():
    s = sieve.sieve()
    i = iter(s)

    for x in range(8):
        i.next()
    assert i.next() == 29

def test2():
    s = sieve.sieve()  # create an object of type sieve

    s.next()  # move to the next prime number (3)

    # Check if next value is equal to 5
    # Error would occur if the value is not equal to 5
    assert s.next() == 5

def test3():
    primes_list = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]
    ctr = 1
    for n, i in zip(sieve.sieve(), primes_list):
        if ctr == 11:
            break
        assert n == i
        ctr += 1