intersect

Documentation

Index

• func Hash(a interface{}, b interface{}) []interface{}
• func Simple(a interface{}, b interface{}) []interface{}
• func Sorted(a interface{}, b interface{}) []interface{}

Functions

func Hash

func Hash(a interface{}, b interface{}) []interface{}

Hash has complexity: O(n * x) where x is a factor of hash function efficiency (between 1 and 2)

func Simple

func Simple(a interface{}, b interface{}) []interface{}

Simple has complexity: O(n^2)

func Sorted

func Sorted(a interface{}, b interface{}) []interface{}

Sorted has complexity: O(n * log(n)), a needs to be sorted