Basic predicates need point interfaces

[thomcom]

Is this a new feature, an improvement, or a change to existing functionality?

New Feature

How would you describe the priority of this feature request

Critical (currently preventing usage)

Please provide a clear description of problem you would like to solve.

Point-in-polygon is a point interface. It's basic API is to take in a list of geometries and a list of points, and returns a list of booleans w.r.t the condition is satisfied.

Equals and intersection need the same API, so that results can be merged back into their original geometry shapes based on their point predicates.

I need to build wrappers around the basic predicates such that they return a list of booleans.

linestring.intersects(linestrings) returns a list of offsets, geometries, and original indices for each intersection found in the relationship. I need to wrap is such that it provides a basic interface linestrings.intersects(points) that returns True or False for each point in the rhs.

pairwise_multipoint_equals_count returns a list of counts for the number of times that a multipoint point in the rhs appears in the lhs. This needs to be wrapped such that I can call multipoints.equals(points) which returns a True/False for each point in the rhs that is contained in the lhs.

This feature is required because the discrete math rules for building features are point-wise rules. Consider for contains, given a point that is not contained in a polygon, that point is not inside the polygon unless it also intersects the polygon boundary.

[thomcom]

I have written these wrappers as a part of (#1062)