简体   繁体   English

Haxe中的原始数组构造和访问

[英]Raw array construction and access in Haxe

The std.Array in Haxe is not a raw array, but rather a managed one - it implements automatic grow and shrink mechanisms, etc. This is great for general use cases, but I need something closer to the metal, because I need greater control over it. Haxe中的std.Array不是原始数组,而是托管数组-它实现了自动增长和收缩机制等。这对于一般用例来说非常有用,但是我需要更接近金属的东西,因为我需要更好的控制超过它。

Something like Foo[] myFoos; Foo[] myFoos;类的东西Foo[] myFoos; instead of ArrayList<Foo> myFoos; 而不是ArrayList<Foo> myFoos; in Java. 在Java中。

How do I do this in Haxe? 如何在Haxe中执行此操作?


Details: 细节:

I tried looking in the implementation of std.Array to find this, to no avail - it is interface only. 我试图在std.Array的实现中std.Array来找到它,但无济于事-它仅是接口。 Would it be correct to assume that the actual implementation is in the OCaml compiler implementation? 假设实际的实现在OCaml编译器实现中是否正确?

取决于您的平台,本机数组以cpp.NativeArrayjava.NativeArraycs.NativeArrayjava.NativeArray cs.NativeArray 。如果要编译到多个目标,则应很容易地构建一个抽象来平滑这些类型之间的差异。

声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM