# RhinoList class

Namespace: [Rhino.Collections](https://developer.rhino3d.com/api/rhinocommon/namespace/rhino.collections.md) · Assembly: [RhinoCommon](https://developer.rhino3d.com/api/rhinocommon/assembly/rhinocommon.md)

```cs
public static class RhinoList
```

Provides helper methods to work with [RhinoList<T>](https://developer.rhino3d.com/api/rhinocommon/type/rhino.collections.rhinolist-1.md) and other collections.

## Methods

- [Point2dKNeighbors](https://developer.rhino3d.com/api/rhinocommon/type/rhino.collections.rhinolist/point2dkneighbors.md): (static) Finds a certain amour of points in a list of single-precision 2D points that are the k-closest to a test point. This method searches needlePoints by computing all distances from each point cloud point and keeping a "short list".
- [Point2fKNeighbors](https://developer.rhino3d.com/api/rhinocommon/type/rhino.collections.rhinolist/point2fkneighbors.md): (static) Finds a certain amour of points in a list of single-precision 2D points that are the k-closest to a test point. This method searches needlePoints by computing all distances from each point cloud point and keeping a "short list".
- [Point3dKNeighbors](https://developer.rhino3d.com/api/rhinocommon/type/rhino.collections.rhinolist/point3dkneighbors.md): (static) Finds a certain amour of points in a list of 3D points that are the k-closest to a test point. This method searches needlePoints by computing all distances from each point cloud point and keeping a "short list". See RTree KNeighbors for alternatives.
- [Point3fKNeighbors](https://developer.rhino3d.com/api/rhinocommon/type/rhino.collections.rhinolist/point3fkneighbors.md): (static) Finds a certain amour of points in a list of single-precision 3D points that are the k-closest to a test point. This method searches needlePoints by computing all distances from each point cloud point and keeping a "short list".
- [PointCloudKNeighbors](https://developer.rhino3d.com/api/rhinocommon/type/rhino.collections.rhinolist/pointcloudkneighbors.md): (static) Finds a certain amount of points in a list of 3D points that are the k-closest to a test point. This method searches needlePoints by computing all distances from each point cloud point and keeping a short list.