bci_framework.default_extensions.Visuospatial_working_memory_Change_detection_task.points.add_point(points: ~typing.List[~bci_framework.default_extensions.Visuospatial_working_memory_Change_detection_task.points.(p1, p2) point], d: ~typing.Union[float, int], margin: ~typing.Union[float, int]) None[source]

Add a point that comply with the rule of minimum distance.

bci_framework.default_extensions.Visuospatial_working_memory_Change_detection_task.points.distance(p1: ~bci_framework.default_extensions.Visuospatial_working_memory_Change_detection_task.points.(p1, p2) point, p2: ~bci_framework.default_extensions.Visuospatial_working_memory_Change_detection_task.points.(p1, p2) point) float[source]

Euclidean distance.

bci_framework.default_extensions.Visuospatial_working_memory_Change_detection_task.points.get_points(N: int, d: Union[float, int], margin: Union[float, int]) (p1, p2) point][source]

Generate N points that comply with the rule of minimum distance.

bci_framework.default_extensions.Visuospatial_working_memory_Change_detection_task.points.point(margin: Union[float, int]) (p1, p2) point[source]

Generate a random point, inside a fixed area.