Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- 1 2 3
- 4 5 6
- 7 8 9
- [i-1][j]
- [i][j-1]
- [i-1][j-1]
- [i+1][j]
- [i][j+1]
- [i+1][j+1]
- [i+1][j-1]
- [i-1][j+1]
- # Size of "board"
- X = 10
- Y = 10
- neighbors = lambda x, y : [(x2, y2) for x2 in range(x-1, x+2)
- for y2 in range(y-1, y+2)
- if (-1 < x <= X and
- -1 < y <= Y and
- (x != x2 or y != y2) and
- (0 <= x2 <= X) and
- (0 <= y2 <= Y))]
- >>> print(neighbors(5, 5))
- [(4, 4), (4, 5), (4, 6), (5, 4), (5, 6), (6, 4), (6, 5), (6, 6)]
- from itertools import product, starmap
- x, y = (8, 13)
- cells = starmap(lambda a,b: (x+a, y+b), product((0,-1,+1), (0,-1,+1)))
- // [(8, 12), (8, 14), (7, 13), (7, 12), (7, 14), (9, 13), (9, 12), (9, 14)]
- print(list(cells)[1:])
- from itertools import product
- size = 3
- def neighbours(cell):
- for c in product(*(range(n-1, n+2) for n in cell)):
- if c != cell and all(0 <= n < size for n in c):
- yield c
- >>> list(neighbours((2,2)))
- [(1, 1), (1, 2), (2, 1)]
- for x_ in range(max(0,x-1),min(width,x+2)):
- for y_ in range(max(0,y-1),min(height,y+2)):
- if (x,y)==(x_,y_): continue
- # do stuff with the neighbours
- >>> a=[[1, 2, 3], [4, 5, 6], [7, 8, 9]]
- >>> width=height=3
- >>> x,y=0,2
- >>> for x_ in range(max(0,x-1),min(width,x+2)):
- ... for y_ in range(max(0,y-1),min(height,y+2)):
- ... if (x,y)==(x_,y_): continue
- ... print a[x_][y_]
- ...
- 2
- 5
- 6
- def top(matrix, x, y):
- try:
- return matrix[x][y - 1];
- except IndexError:
- return None
- (x - 1, y - 1) (x, y - 1) (x + 1, y - 1)
- (x - 1, y) (x, y) (x + 1, y)
- (x - 1, y + 1) (x, y + 1) (x + 1, y + 1)
- >>> import itertools
- >>> def sl(lst, i, j):
- il, iu = max(0, i-1), min(len(lst)-1, i+1)
- jl, ju = max(0, j-1), min(len(lst[0])-1, j+1)
- return (il, iu), (jl, ju)
- >>> lst = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
- >>> tup = 0, 2
- >>> [lst[i][j] for i, j in itertools.product(*sl(lst, *tup)) if (i, j) != tup]
- [2, 5, 6]
- def neighboring( array ):
- nn,mm = len(array), len(array[0])
- offset = (0,-1,1) # 0 first so the current cell is the first in the gen
- indices = ( (i,j) for i in range(nn) for j in range(mm) )
- for i,j in indices:
- all_neigh = ( (i+x,j+y) for x in offset for y in offset )
- valid = ( (i,j) for i,j in all_neigh if (0<=i<nn) and (0<=j<mm) ) # -1 is a valid index in normal lists, but not here so throw it out
- yield valid.next(), valid ## first is the current cell, next are the neightbors
- for (x,y), neigh in neighboring( l ):
- print l[x][y], [l[x][y] for x,y in neigh]
- startingRow = x / n * n;
- startingCol = y/ n * n
- neighbors = [(x+a[0], y+a[1]) for a in
- [(-1,0), (1,0), (0,-1), (0,1)]
- if ( (0 <= x+a[0] < w) and (0 <= y+a[1] < h))]
Add Comment
Please, Sign In to add comment