Extensions for Haxe to make it more accessible to C# developers.
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Type Name Latest commit message Commit time
Failed to load latest commit information.



Build Status

HaxeSharp brings functionality to Haxe that is inspried by some of the best of what .NET has to offer. If you're a .NET developer, you will find these methods similar to what the .NET APIs provide.

To see the full list of available classes and functions, please consult the API.

Design Philosophy

While HaxeSharp copies the .NET API in many cases, at the same time, they're written following the Haxe style and conventions.

In some cases, language functions make it difficult to achieve .NET's design (eg. Haxe doesn't support multiple constructors). We try to work around these cases, or in the worst case, provide some other alternative.

HaxeSharp also tries to follow the principle of least surprise in cases where .NET doesn't; for example, we may throw exceptions for invalid cases (eg. [1, 2, 3].take(17)) even though .NET doesn't.


Installation is available through Git and haxelib only:

haxelib git https://github.com/nightblade9/haxesharp.git

API Highlights

To see the full list of APIs available, check the API docs. Some of the most important functionality includes the following.


HaxeSharp ships with a haxesharp.exceptions.Exception class you can use and throw like any other .NET exception (eg. throw new Exception("HP should never be zero or less");). You get a consistent stack-trace across all Haxe targets.

You can also subclass Exception to create your own; the only requirement is a constructor that accepts a single string message parameter.

HaxeSharp includes several exceptions familiar to .NET developers, such as InvalidOperationException.

LINQ and Lambdas

With our LINQ helpers, you can write LINQ-like queries on arrays:

using haxesharp.collections.Linq;

var numbers = [1, 2, 3, 4, 5, 6, 7];
var even = numbers.where((n) => n % 2 == 0);
trace(even); // [2, 4, 6]

These are implemented as static extensions; you need to write using haxesharp.collections.Linq, not import haxesharp.collections.Linq.

C#-style short-lambdas are available via the excellent hxslam library, which HaxeSharp consumes.


You can use the Random class to generate random numbers, optionally passing in a seed if you want deterministic random. APIs:

  • new Random() creates a random generator; new Random(seed) creates a seeded random generator.
  • Random.next() returns an integer
  • Random.next(n) returns an integer in the range [0..n) (excludes n)
  • Random.next(a, b) returns a number n that satisfies a <= n < b


Haxe ships with an EReg class which lacks in terms of usability. HaxeSharp provides a regular Regex class with a few useful methods:

  • Regex.matches(pattern, text) returns an array of all matches (groups) of pattern inside text.
  • new Regex(...).match(...) returns a Match instance, which includes a groups field (array of matches as strings).


Like .NET, you can write x.contains(...) on both strings and arrays.

Unit Testing

In line with some of the NUnit fluent APIs, HaxeSharp includes an Assert class with several methods. Some of the most-commonly-used ones include:

  • Assert.that(actual, Is.equalTo(expected))
  • Assert.that(x, Is.not(13))

These depend on munit, which is an excellent unit-testing tool for Haxe.


We welcome contributions from the community. If you would like to make a large change, please open an issue first to discuss it and receive feedback on it.

  • Any changes must include sufficient unit tests
  • To test your changes, run haxelib run munit test from the root of the repository
  • Please add dox markup to your classes so they are reasonably well explained in the API documentation

We use Travis-CI for continuous integration. If you check in something that breaks the build, please take responsibility to investigate and resolve the build failure. (You can find the Travis link at the top of this README.)