Reorder check_descend pathfinding functions
This commit is contained in:
@@ -188,47 +188,47 @@ class Pathfinder(AStar):
|
||||
return True
|
||||
|
||||
def check_ascend(self, node, offset):
|
||||
if not self.check_traverse(node, offset):
|
||||
return False
|
||||
|
||||
dest = utils.padd(node, offset)
|
||||
|
||||
if not self.bair(utils.padd(node, BLOCK_ABOVE2)):
|
||||
return False
|
||||
|
||||
return True
|
||||
|
||||
def check_descend(self, node, offset):
|
||||
if not self.check_traverse(node, offset):
|
||||
return False
|
||||
|
||||
return True
|
||||
|
||||
def check_descend(self, node, offset):
|
||||
dest = utils.padd(node, offset)
|
||||
|
||||
if not self.bair(utils.padd(dest, BLOCK_ABOVE2)):
|
||||
return False
|
||||
|
||||
if not self.check_traverse(node, offset):
|
||||
return False
|
||||
|
||||
return True
|
||||
|
||||
def check_descend2(self, node, offset):
|
||||
if not self.check_descend(node, offset):
|
||||
return False
|
||||
|
||||
dest = utils.padd(node, offset)
|
||||
|
||||
if not self.bair(utils.padd(dest, BLOCK_ABOVE3)):
|
||||
return False
|
||||
|
||||
if not self.check_descend(node, offset):
|
||||
return False
|
||||
|
||||
return True
|
||||
|
||||
def check_descend3(self, node, offset):
|
||||
if not self.check_descend2(node, offset):
|
||||
return False
|
||||
|
||||
dest = utils.padd(node, offset)
|
||||
|
||||
if not self.bair(utils.padd(dest, BLOCK_ABOVE4)):
|
||||
return False
|
||||
|
||||
if not self.check_descend2(node, offset):
|
||||
return False
|
||||
|
||||
return True
|
||||
|
||||
def check_parkour(self, node, offset):
|
||||
|
||||
Reference in New Issue
Block a user