private class ClockWiseSort

geometry :: ClockWiseSort

Sort the vertices of a polygon in clockwise order

Introduced properties

Redefined properties

redef type SELF: ClockWiseSort

geometry $ ClockWiseSort :: SELF

Type of this instance, automatically specialized in every class
redef fun compare(a: COMPARED, b: COMPARED): Int

geometry $ ClockWiseSort :: compare

Compare a and b.

All properties

fun !=(other: nullable Object): Bool

core :: Object :: !=

Have self and other different values?
fun ==(other: nullable Object): Bool

core :: Object :: ==

Have self and other the same value?
type CLASS: Class[SELF]

core :: Object :: CLASS

The type of the class of self.
type COMPARED: nullable Object

core :: Comparator :: COMPARED

What to compare to
type SELF: Object

core :: Object :: SELF

Type of this instance, automatically specialized in every class
private var _center: COMPARED

geometry :: PolygonSorter :: _center

Center of the polygon's points
fun bubble_sort(array: Array[COMPARED], from: Int, to: Int)

core :: Comparator :: bubble_sort

Bubble-sort array between from and to indices
private fun build_heap(array: Array[COMPARED]): Int

core :: Comparator :: build_heap

private fun calc_center(pts: Array[Array[Float]]): COMPARED

geometry :: PolygonSorter :: calc_center

Calculate the center
private fun center: COMPARED

geometry :: PolygonSorter :: center

Center of the polygon's points
private fun center=(center: COMPARED)

geometry :: PolygonSorter :: center=

Center of the polygon's points
protected fun class_factory(name: String): CLASS

core :: Object :: class_factory

Implementation used by get_class to create the specific class.
fun class_name: String

core :: Object :: class_name

The class name of the object.
abstract fun compare(a: COMPARED, b: COMPARED): Int

core :: Comparator :: compare

Compare a and b.
fun get_class: CLASS

core :: Object :: get_class

The meta-object representing the dynamic type of self.
fun hash: Int

core :: Object :: hash

The hash code of the object.
fun heap_sort(array: Array[COMPARED], from: Int, to: Int)

core :: Comparator :: heap_sort

Heap-sort array between from and to indices
private fun heapify(array: Array[COMPARED], from: Int, to: Int)

core :: Comparator :: heapify

init init

core :: Object :: init

fun insertion_sort(array: Array[COMPARED], from: Int, to: Int)

core :: Comparator :: insertion_sort

Insertion-sort array between from and to indices
fun inspect: String

core :: Object :: inspect

Developer readable representation of self.
protected fun inspect_head: String

core :: Object :: inspect_head

Return "CLASSNAME:#OBJECTID".
intern fun is_same_instance(other: nullable Object): Bool

core :: Object :: is_same_instance

Return true if self and other are the same instance (i.e. same identity).
fun is_same_serialized(other: nullable Object): Bool

core :: Object :: is_same_serialized

Is self the same as other in a serialization context?
intern fun is_same_type(other: Object): Bool

core :: Object :: is_same_type

Return true if self and other have the same dynamic type.
fun is_sorted(seq: SequenceRead[COMPARED]): Bool

core :: Comparator :: is_sorted

Is seq sorted?
fun max(a: COMPARED, b: COMPARED): COMPARED

core :: Comparator :: max

Returns the maximum between a and b.
private fun merge(array: Array[COMPARED], from: Int, mid: Int, to: Int)

core :: Comparator :: merge

fun merge_sort(array: Array[COMPARED], from: Int, to: Int)

core :: Comparator :: merge_sort

Merge-sort array between from and to indices
fun min(a: COMPARED, b: COMPARED): COMPARED

core :: Comparator :: min

Returns the minimum between a and b.
private intern fun native_class_name: CString

core :: Object :: native_class_name

The class name of the object in CString format.
intern fun object_id: Int

core :: Object :: object_id

An internal hash code for the object based on its identity.
fun output

core :: Object :: output

Display self on stdout (debug only).
intern fun output_class_name

core :: Object :: output_class_name

Display class name on stdout (debug only).
fun quick_sort(array: Array[COMPARED], from: Int, to: Int)

core :: Comparator :: quick_sort

Quick-sort array between from and to indices
fun serialization_hash: Int

core :: Object :: serialization_hash

Hash value use for serialization
fun sort(array: Array[COMPARED])

core :: Comparator :: sort

Sort array using the compare function.
private fun sub_sort(array: Array[COMPARED], from: Int, to: Int)

core :: Comparator :: sub_sort

Sort array between from and to indices
intern fun sys: Sys

core :: Object :: sys

Return the global sys object, the only instance of the Sys class.
abstract fun to_jvalue(env: JniEnv): JValue

core :: Object :: to_jvalue

fun to_s: String

core :: Object :: to_s

User readable representation of self.
private init with_center(pts: Array[Array[Float]])

geometry :: PolygonSorter :: with_center

init calculating the center
package_diagram geometry::polygon::ClockWiseSort ClockWiseSort geometry::polygon::PolygonSorter PolygonSorter geometry::polygon::ClockWiseSort->geometry::polygon::PolygonSorter core::Comparator Comparator geometry::polygon::PolygonSorter->core::Comparator ...core::Comparator ... ...core::Comparator->core::Comparator

Ancestors

interface Comparator

core :: Comparator

This abstract class generalizes ways to sort an array
interface Object

core :: Object

The root of the class hierarchy.

Parents

private abstract class PolygonSorter

geometry :: PolygonSorter

Sorter for polygon vertices

Class definitions

geometry $ ClockWiseSort 
# Sort the vertices of a polygon in clockwise order
private class ClockWiseSort
	super PolygonSorter

	redef fun compare(a,b) do
		if a.x == b.x and a.y == b.y then return 0
		if a.x - center.x >= 0.0 and b.x - center.x < 0.0 then return 1
		if a.x - center.x < 0.0 and b.x - center.x >= 0.0 then return -1
		if a.x - center.x == 0.0 and b.x - center.x == 0 then
			if a.y - center.y >= 0.0 or b.y - center.y >= 0.0 then
				if a.y > b.y then return 1
				return -1
			end
			if b.y > a.y then return 1
			return -1
		end

		var det = (a.x - center.x) * (b.y - center.y) - (b.x - center.x) * (a.y - center.y)
		if det > 0.0 then return -1
		if det < 0.0 then return 1

		var d1 = (a.x - center.x) * (a.x - center.x) + (a.y - center.y) * (a.y - center.y)
		var d2 = (b.x - center.x) * (b.x - center.x) + (b.y - center.y) * (b.y - center.y)
		if d1 > d2 then return 1
		return -1
	end
end
lib/geometry/polygon.nit:364,1--390,3
Nit tools. Version v0.8-3595-g3f58b4f.