Inherits from
- HasStrictTraits: enthought.traits.has_traits.HasStrictTraits
Attributes
- extents
A read-only property that describes the origin and size of the data set in data space as a 4-tuple (min_x, min_y, width, height)
extents = Property()
- sort_order
How to sort the output list of intersected points that the get_points_near_*() function returns. The points are always sorted by their domain (first/X-value) coordinate.
sort_order = ArraySortTrait
Inherited from base classes
Method summary
- __init__(self, data = None, data_sorting = 'none', **kw)
- clear(self)
- get_data(self)
- get_last_region(self)
- get_points_in_poly(self, poly)
- get_points_in_rect(self, rect)
- get_points_near(self, pointlist, radius = 0.0)
- get_points_near_polyline(self, line)
- set_data(self, new_data, new_data_sorting = 'none')
Inherited from base classes
- __deepcopy__(self, memo)
- __getstate__(self)
- __prefix_trait__(self, name, is_set)
- __reduce_ex__(self, protocol)
- __setstate__(self, state, trait_change_notify = True)
- add_class_trait(cls, name, *trait)
- add_trait(self, name, *trait)
- add_trait_category(cls, category)
- add_trait_listener(self, object, prefix = '')
- all_trait_names(self)
- base_trait(self, name)
- class_default_traits_view(cls)
- class_editable_traits(cls)
- class_trait_names(cls, **metadata)
- class_trait_view(cls, name = None, view_element = None)
- class_trait_view_elements(cls)
- class_traits(cls, **metadata)
- clone_traits(self, traits = None, memo = None, copy = None, **metadata)
- configure_traits(self, filename = None, view = None, kind = None, edit = True, context = None, handler = None, id = '', scrollable = None, **args)
- copy_traits(self, other, traits = None, memo = None, copy = None, **metadata)
- copyable_trait_names(self, **metadata)
- default_traits_view(self)
- edit_traits(self, view = None, parent = None, kind = None, context = None, handler = None, id = '', scrollable = None, **args)
- editable_traits(self)
- has_traits_interface(self, *interfaces)
- on_trait_change(self, handler, name = None, remove = False, dispatch = 'same', priority = False, deferred = False)
- print_traits(self, show_help = False, **metadata)
- remove_trait(self, name)
- remove_trait_listener(self, object, prefix = '')
- reset_traits(self, traits = None, **metadata)
- set_trait_dispatch_handler(cls, name, klass, override = False)
- sync_trait(self, trait_name, object, alias = None, mutual = True, remove = False)
- trait(self, name, force = False, copy = False)
- trait_context(self)
- trait_get(self, *names, **metadata)
- trait_monitor(cls, handler, remove = False)
- trait_names(self, **metadata)
- trait_set(self, trait_change_notify = True, **traits)
- trait_setq(self, **traits)
- trait_subclasses(cls, all = False)
- trait_view(self, name = None, view_element = None)
- trait_view_elements(self)
- trait_views(self, klass = None)
- traits(self, **metadata)
- validate_trait(self, name, value)
Methods
- __init__(self, data = None, data_sorting = 'none', **kw)
See set_data() for description.
- clear(self)
clear()
Resets internal state and any cached data to reflect an empty data set/data space.
- get_data(self)
Returns the actual data used by the DataMapper.
- get_last_region(self)
Returns a region of screen space that contains all of the points/lines/rect/polys in the last get_points_in_*() call. The region returned by this method is guaranteed to only contain the points that were returned by the previous call.
The region is returned as a list of (possibly disjoint) rectangles, where each rectangle is a 4-tuple (x,y,w,h).
- get_points_in_poly(self, poly)
get_points_in_poly([v1, ... vN]) -> [ [points], [points], ... ]
This method is like get_points_near(), except that it takes a polygon as input. The polygon has infinitely thin width and can be self-intersecting and concave.
The input array can have shape 2xN or Nx2.
- get_points_in_rect(self, rect)
get_points_in_rect( (x,y,w,h) ) -> [ [points], [points], ... ]
This method is like get_points_near(), except that it takes a rectangle as input. The rectangle has infinitely thin width.
- get_points_near(self, pointlist, radius = 0.0)
get_points_near([points], radius=0.0) -> Nx2 array of candidate points
Returns a list of points near the input points (Nx2 array).
For each point in the input set, radius is used to create a conceptual circle; if any points in the DataMapper's values lie inside this circle, they are returned.
The returned list is not guaranteed to be a minimum or exact set, but it is guaranteed to contain all points that intersect the pointlist. The caller still must do fine-grained testing to see if the points in the returned point list are a match.
- get_points_near_polyline(self, line)
get_points_near_polyline([v1, ... vN]) -> [ [points], [points], ... ]
This method is like get_points_near(), except that it takes a polyline as input. A polyline is a list of vertices, each connected to the next by a straight line. The polyline has infinitely thin width.
The input array can have shape 2xN or Nx2.
- set_data(self, new_data, new_data_sorting = 'none')
set_data(new_data, new_data_sorting='none')
Sets the data used by this DataMapper. The new_data_sorting parameter indicates how the new data is sorted: 'none', 'ascending', or 'descending'. The default is 'none', which causes the data mapper to perform a full sort of the input data.
The input data can be shaped 2xN or Nx2.