Method insert_and_think

pygorithm/data_structures/quadtree.py:279–299

Insert the entity into this or the appropriate child. This also acts as thinking (recursively). Using :py:meth:`.insert_and_think` iteratively is slightly less efficient but has more predictable performance than initializing with a large number of entities t

(self, entity)

        
    
    def insert_and_think(self, entity):
        """
        Insert the entity into this or the appropriate child.
        
        This also acts as thinking (recursively). Using :py:meth:`.insert_and_think`
        iteratively is slightly less efficient but has more predictable performance
        than initializing with a large number of entities then thinking is slightly
        faster but may hang. Both may exceed recursion depth if :py:attr:`.max_depth`
        is too large.
        
        :param entity: the entity to insert
        :type entity: :class:`.QuadTreeEntity`
        """
        if not self.children and len(self.entities) == self.bucket_size and self.depth < self.max_depth:
            self.split()
        
        quad = self.get_quadrant(entity) if self.children else -1
        if quad < 0:
            self.entities.append(entity)
        else:
            self.children[quad].insert_and_think(entity)
        
    def retrieve_collidables(self, entity, predicate = None):
        """