Datasets:

kardosdrur
/

bright-long-scandi-match

Dataset card Data Studio Files Files and versions Community

Split (1)

train · 5.65k rows

bright_id stringlengths 11 257	bright_doc stringlengths 25 9.18M	bright_split stringclasses 8 values	scandi_id stringlengths 3 7	scandi_url stringlengths 31 143	scandi_title stringlengths 1 79	scandi_text stringlengths 15 118k	scandi_language stringclasses 4 values	scandi_dist float64 0.2 1.75
Pony/builtin-FloatingPoint-.txt	FloatingPoint[A: FloatingPoint[A] val]¶ [Source] trait val FloatingPoint[A: FloatingPoint[A] val] is Real[A] val Implements¶ Real[A] val Constructors¶ min_normalised¶ [Source] new val min_normalised() : FloatingPoint[A] val^ Returns¶ FloatingPoint[A] val^ epsilon¶ [Source] new val epsilon() : FloatingPoint[A] val^ Returns¶ FloatingPoint[A] val^ create¶ [Source] new val create( value: A) : Real[A] val^ Parameters¶ value: A Returns¶ Real[A] val^ from[B: ((I8 val \| I16 val \| I32 val \| I64 val \| I128 val \| ILong val \| ISize val \| U8 val \| U16 val \| U32 val \| U64 val \| U128 val \| ULong val \| USize val \| F32 val \| F64 val) & Real[B] val)]¶ [Source] new val from[B: ((I8 val \| I16 val \| I32 val \| I64 val \| I128 val \| ILong val \| ISize val \| U8 val \| U16 val \| U32 val \| U64 val \| U128 val \| ULong val \| USize val \| F32 val \| F64 val) & Real[B] val)]( a: B) : Real[A] val^ Parameters¶ a: B Returns¶ Real[A] val^ min_value¶ [Source] new val min_value() : Real[A] val^ Returns¶ Real[A] val^ max_value¶ [Source] new val max_value() : Real[A] val^ Returns¶ Real[A] val^ Public Functions¶ radix¶ [Source] fun tag radix() : U8 val Returns¶ U8 val precision2¶ [Source] fun tag precision2() : U8 val Returns¶ U8 val precision10¶ [Source] fun tag precision10() : U8 val Returns¶ U8 val min_exp2¶ [Source] fun tag min_exp2() : I16 val Returns¶ I16 val min_exp10¶ [Source] fun tag min_exp10() : I16 val Returns¶ I16 val max_exp2¶ [Source] fun tag max_exp2() : I16 val Returns¶ I16 val max_exp10¶ [Source] fun tag max_exp10() : I16 val Returns¶ I16 val add_unsafe¶ [Source] Unsafe operation. If any input or output of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. fun box add_unsafe( y: A) : A Parameters¶ y: A Returns¶ A sub_unsafe¶ [Source] Unsafe operation. If any input or output of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. fun box sub_unsafe( y: A) : A Parameters¶ y: A Returns¶ A mul_unsafe¶ [Source] Unsafe operation. If any input or output of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. fun box mul_unsafe( y: A) : A Parameters¶ y: A Returns¶ A div_unsafe¶ [Source] Unsafe operation. If any input or output of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. fun box div_unsafe( y: A) : A Parameters¶ y: A Returns¶ A fld_unsafe¶ [Source] Unsafe operation. If any input or output of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. fun box fld_unsafe( y: A) : A Parameters¶ y: A Returns¶ A divrem_unsafe¶ [Source] Unsafe operation. If any input or output of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. fun box divrem_unsafe( y: A) : (A , A) Parameters¶ y: A Returns¶ (A , A) rem_unsafe¶ [Source] Unsafe operation. If any input or output of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. fun box rem_unsafe( y: A) : A Parameters¶ y: A Returns¶ A mod_unsafe¶ [Source] Unsafe operation. If any input or output of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. fun box mod_unsafe( y: A) : A Parameters¶ y: A Returns¶ A neg_unsafe¶ [Source] Unsafe operation. If any input or output of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. fun box neg_unsafe() : A Returns¶ A eq_unsafe¶ [Source] Unsafe operation. If any input of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. fun box eq_unsafe( y: box->A) : Bool val Parameters¶ y: box->A Returns¶ Bool val ne_unsafe¶ [Source] Unsafe operation. If any input of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. fun box ne_unsafe( y: box->A) : Bool val Parameters¶ y: box->A Returns¶ Bool val lt_unsafe¶ [Source] Unsafe operation. If any input of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. fun box lt_unsafe( y: box->A) : Bool val Parameters¶ y: box->A Returns¶ Bool val le_unsafe¶ [Source] Unsafe operation. If any input of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. fun box le_unsafe( y: box->A) : Bool val Parameters¶ y: box->A Returns¶ Bool val ge_unsafe¶ [Source] Unsafe operation. If any input of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. fun box ge_unsafe( y: box->A) : Bool val Parameters¶ y: box->A Returns¶ Bool val gt_unsafe¶ [Source] Unsafe operation. If any input of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. fun box gt_unsafe( y: box->A) : Bool val Parameters¶ y: box->A Returns¶ Bool val abs¶ [Source] fun box abs() : A Returns¶ A ceil¶ [Source] fun box ceil() : A Returns¶ A floor¶ [Source] fun box floor() : A Returns¶ A round¶ [Source] fun box round() : A Returns¶ A trunc¶ [Source] fun box trunc() : A Returns¶ A finite¶ [Source] fun box finite() : Bool val Returns¶ Bool val infinite¶ [Source] fun box infinite() : Bool val Returns¶ Bool val nan¶ [Source] fun box nan() : Bool val Returns¶ Bool val ldexp¶ [Source] fun box ldexp( x: A, exponent: I32 val) : A Parameters¶ x: A exponent: I32 val Returns¶ A frexp¶ [Source] fun box frexp() : (A , U32 val) Returns¶ (A , U32 val) log¶ [Source] fun box log() : A Returns¶ A log2¶ [Source] fun box log2() : A Returns¶ A log10¶ [Source] fun box log10() : A Returns¶ A logb¶ [Source] fun box logb() : A Returns¶ A pow¶ [Source] fun box pow( y: A) : A Parameters¶ y: A Returns¶ A powi¶ [Source] fun box powi( y: I32 val) : A Parameters¶ y: I32 val Returns¶ A sqrt¶ [Source] fun box sqrt() : A Returns¶ A sqrt_unsafe¶ [Source] Unsafe operation. If this is negative, the result is undefined. fun box sqrt_unsafe() : A Returns¶ A cbrt¶ [Source] fun box cbrt() : A Returns¶ A exp¶ [Source] fun box exp() : A Returns¶ A exp2¶ [Source] fun box exp2() : A Returns¶ A cos¶ [Source] fun box cos() : A Returns¶ A sin¶ [Source] fun box sin() : A Returns¶ A tan¶ [Source] fun box tan() : A Returns¶ A cosh¶ [Source] fun box cosh() : A Returns¶ A sinh¶ [Source] fun box sinh() : A Returns¶ A tanh¶ [Source] fun box tanh() : A Returns¶ A acos¶ [Source] fun box acos() : A Returns¶ A asin¶ [Source] fun box asin() : A Returns¶ A atan¶ [Source] fun box atan() : A Returns¶ A atan2¶ [Source] fun box atan2( y: A) : A Parameters¶ y: A Returns¶ A acosh¶ [Source] fun box acosh() : A Returns¶ A asinh¶ [Source] fun box asinh() : A Returns¶ A atanh¶ [Source] fun box atanh() : A Returns¶ A copysign¶ [Source] fun box copysign( sign: A) : A Parameters¶ sign: A Returns¶ A string¶ [Source] fun box string() : String iso^ Returns¶ String iso^ add¶ [Source] fun box add( y: A) : A Parameters¶ y: A Returns¶ A sub¶ [Source] fun box sub( y: A) : A Parameters¶ y: A Returns¶ A mul¶ [Source] fun box mul( y: A) : A Parameters¶ y: A Returns¶ A div¶ [Source] fun box div( y: A) : A Parameters¶ y: A Returns¶ A divrem¶ [Source] fun box divrem( y: A) : (A , A) Parameters¶ y: A Returns¶ (A , A) rem¶ [Source] fun box rem( y: A) : A Parameters¶ y: A Returns¶ A neg¶ [Source] fun box neg() : A Returns¶ A fld¶ [Source] fun box fld( y: A) : A Parameters¶ y: A Returns¶ A mod¶ [Source] fun box mod( y: A) : A Parameters¶ y: A Returns¶ A eq¶ [Source] fun box eq( y: box->A) : Bool val Parameters¶ y: box->A Returns¶ Bool val ne¶ [Source] fun box ne( y: box->A) : Bool val Parameters¶ y: box->A Returns¶ Bool val lt¶ [Source] fun box lt( y: box->A) : Bool val Parameters¶ y: box->A Returns¶ Bool val le¶ [Source] fun box le( y: box->A) : Bool val Parameters¶ y: box->A Returns¶ Bool val ge¶ [Source] fun box ge( y: box->A) : Bool val Parameters¶ y: box->A Returns¶ Bool val gt¶ [Source] fun box gt( y: box->A) : Bool val Parameters¶ y: box->A Returns¶ Bool val min¶ [Source] fun box min( y: A) : A Parameters¶ y: A Returns¶ A max¶ [Source] fun box max( y: A) : A Parameters¶ y: A Returns¶ A hash¶ [Source] fun box hash() : USize val Returns¶ USize val hash64¶ [Source] fun box hash64() : U64 val Returns¶ U64 val i8¶ [Source] fun box i8() : I8 val Returns¶ I8 val i16¶ [Source] fun box i16() : I16 val Returns¶ I16 val i32¶ [Source] fun box i32() : I32 val Returns¶ I32 val i64¶ [Source] fun box i64() : I64 val Returns¶ I64 val i128¶ [Source] fun box i128() : I128 val Returns¶ I128 val ilong¶ [Source] fun box ilong() : ILong val Returns¶ ILong val isize¶ [Source] fun box isize() : ISize val Returns¶ ISize val u8¶ [Source] fun box u8() : U8 val Returns¶ U8 val u16¶ [Source] fun box u16() : U16 val Returns¶ U16 val u32¶ [Source] fun box u32() : U32 val Returns¶ U32 val u64¶ [Source] fun box u64() : U64 val Returns¶ U64 val u128¶ [Source] fun box u128() : U128 val Returns¶ U128 val ulong¶ [Source] fun box ulong() : ULong val Returns¶ ULong val usize¶ [Source] fun box usize() : USize val Returns¶ USize val f32¶ [Source] fun box f32() : F32 val Returns¶ F32 val f64¶ [Source] fun box f64() : F64 val Returns¶ F64 val i8_unsafe¶ [Source] fun box i8_unsafe() : I8 val Returns¶ I8 val i16_unsafe¶ [Source] fun box i16_unsafe() : I16 val Returns¶ I16 val i32_unsafe¶ [Source] fun box i32_unsafe() : I32 val Returns¶ I32 val i64_unsafe¶ [Source] fun box i64_unsafe() : I64 val Returns¶ I64 val i128_unsafe¶ [Source] fun box i128_unsafe() : I128 val Returns¶ I128 val ilong_unsafe¶ [Source] fun box ilong_unsafe() : ILong val Returns¶ ILong val isize_unsafe¶ [Source] fun box isize_unsafe() : ISize val Returns¶ ISize val u8_unsafe¶ [Source] fun box u8_unsafe() : U8 val Returns¶ U8 val u16_unsafe¶ [Source] fun box u16_unsafe() : U16 val Returns¶ U16 val u32_unsafe¶ [Source] fun box u32_unsafe() : U32 val Returns¶ U32 val u64_unsafe¶ [Source] fun box u64_unsafe() : U64 val Returns¶ U64 val u128_unsafe¶ [Source] fun box u128_unsafe() : U128 val Returns¶ U128 val ulong_unsafe¶ [Source] fun box ulong_unsafe() : ULong val Returns¶ ULong val usize_unsafe¶ [Source] fun box usize_unsafe() : USize val Returns¶ USize val f32_unsafe¶ [Source] fun box f32_unsafe() : F32 val Returns¶ F32 val f64_unsafe¶ [Source] fun box f64_unsafe() : F64 val Returns¶ F64 val compare¶ [Source] fun box compare( that: box->A) : (Less val \| Equal val \| Greater val) Parameters¶ that: box->A Returns¶ (Less val \| Equal val \| Greater val)	pony	2820087	https://sv.wikipedia.org/wiki/Allotinus%20subviolaceus	Allotinus subviolaceus	Allotinus subviolaceus är en fjärilsart som beskrevs av Felder 1865. Allotinus subviolaceus ingår i släktet Allotinus och familjen juvelvingar. Inga underarter finns listade i Catalogue of Life. Bildgalleri Källor Externa länkar Juvelvingar subviolaceus	swedish	1.400492
Pony/ponytest.txt	# Testing with PonyTest PonyTest is Pony's unit testing framework. It is designed to be as simple as possible to use, both for the unit test writer and the user running the tests. Each unit test is a class, with a single test function. By default, all tests run concurrently. Each test run is provided with a helper object. This provides logging and assertion functions. By default log messages are only shown for tests that fail. When any assertion function fails the test is counted as a fail. However, tests can also indicate failure by raising an error in the test function. ## Example program To use PonyTest simply write a class for each test and a `TestList` type that tells the PonyTest object about the tests. Typically the `TestList` will be Main for the package. The following is a complete program with 2 trivial tests. ```pony use "pony_test" actor Main is TestList new create(env: Env) => PonyTest(env, this) new make() => None fun tag tests(test: PonyTest) => test(_TestAdd) test(_TestSub) class iso _TestAdd is UnitTest fun name(): String => "addition" fun apply(h: TestHelper) => h.assert_eq[U32](4, 2 + 2) class iso _TestSub is UnitTest fun name(): String => "subtraction" fun apply(h: TestHelper) => h.assert_eq[U32](2, 4 - 2) ``` The make() constructor is not needed for this example. However, it allows for easy aggregation of tests (see below) so it is recommended that all test Mains provide it. Main.create() is called only for program invocations on the current package. Main.make() is called during aggregation. If so desired extra code can be added to either of these constructors to perform additional tasks. ## Test names Tests are identified by names, which are used when printing test results and on the command line to select which tests to run. These names are independent of the names of the test classes in the Pony source code. Arbitrary strings can be used for these names, but for large projects, it is strongly recommended to use a hierarchical naming scheme to make it easier to select groups of tests. ## Aggregation Often it is desirable to run a collection of unit tests from multiple different source files. For example, if several packages within a bundle each have their own unit tests it may be useful to run all tests for the bundle together. This can be achieved by writing an aggregate test list class, which calls the list function for each package. The following is an example that aggregates the tests from packages `foo` and `bar`. ```pony use "pony_test" use foo = "foo" use bar = "bar" actor Main is TestList new create(env: Env) => PonyTest(env, this) new make() => None fun tag tests(test: PonyTest) => foo.Main.make().tests(test) bar.Main.make().tests(test) ``` Aggregate test classes may themselves be aggregated. Every test list class may contain any combination of its own tests and aggregated lists. ## Long tests Simple tests run within a single function. When that function exits, either returning or raising an error, the test is complete. This is not viable for tests that need to use actors. Long tests allow for delayed completion. Any test can call `long_test()` on its `TestHelper` to indicate that it needs to keep running. When the test is finally complete it calls `complete()` on its `TestHelper`. The `complete()` function takes a `Bool` parameter to specify whether the test was a success. If any asserts fail then the test will be considered a failure regardless of the value of this parameter. However, `complete()` must still be called. Since failing tests may hang, a timeout must be specified for each long test. When the test function exits a timer is started with the specified timeout. If this timer fires before `complete()` is called the test is marked as a failure and the timeout is reported. On a timeout, the `timed_out()` function is called on the unit test object. This should perform whatever test specific tidy up is required to allow the program to exit. There is no need to call `complete()` if a timeout occurs, although it is not an error to do so. Note that the timeout is only relevant when a test hangs and would otherwise prevent the test program from completing. Setting a very long timeout on tests that should not be able to hang is perfectly acceptable and will not make the test take any longer if successful. Timeouts should not be used as the standard method of detecting if a test has failed. ## Exclusion groups By default, all tests are run concurrently. This may be a problem for some tests, e.g. if they manipulate an external file or use a system resource. To fix this issue any number of tests may be put into an exclusion group. No tests that are in the same exclusion group will be run concurrently. Exclusion groups are identified by name, arbitrary strings may be used. Multiple exclusion groups may be used and tests in different groups may run concurrently. Tests that do not specify an exclusion group may be run concurrently with any other tests. The command line option `--sequential` prevents any tests from running concurrently, regardless of exclusion groups. This is intended for debugging rather than standard use. ## Tear down Each unit test object may define a `tear_down()` function. This is called after the test has finished allowing the tearing down of any complex environment that had to be set up for the test. The `tear_down()` function is called for each test regardless of whether it passed or failed. If a test times out tear_down() will be called after `timed_out()` returns. When a test is in an exclusion group, the `tear_down()` call is considered part of the tests run. The next test in the exclusion group will not start until after `tear_down()` returns on the current test. The test's `TestHelper` is handed to `tear_down()` and it is permitted to log messages and call assert functions during tear down. ## Additional resources You can learn more about PonyTest specifics by checking out the [API documentation](https://stdlib.ponylang.io/pony_test--index/). There's also a [testing section](http://patterns.ponylang.io/testing.html) in the [Pony Patterns](http://patterns.ponylang.io/) book.	pony	3483406	https://sv.wikipedia.org/wiki/Cylindromyrmex%20parallelus	Cylindromyrmex parallelus	Cylindromyrmex parallelus är en myrart som beskrevs av Santschi 1932. Cylindromyrmex parallelus ingår i släktet Cylindromyrmex och familjen myror. Inga underarter finns listade i Catalogue of Life. Källor Myror parallelus	swedish	1.660629
Pony/builtin-HasEq-.txt	HasEq[A: A]¶ [Source] interface ref HasEq[A: A] Public Functions¶ eq¶ [Source] fun box eq( that: box->A) : Bool val Parameters¶ that: box->A Returns¶ Bool val	pony	8036929	https://sv.wikipedia.org/wiki/Alkannasl%C3%A4ktet	Alkannasläktet	Alkanna är ett växtsläkte i familjen förgätmigejväxter (Boraginaceae). Arter (urval) A. amana Rech.f. A. angustifolia Sümbül A. areolata Boiss. A. attilae P.H.Davis A. aucheriana A.DC. A. auranitica Mouterde A. bracteosa Boiss. A. caliensis Heldr. ex Boiss. A. cappadocica Boiss. & Balansa A. confusa Sam. ex Rech.f. A. corcyrensis Hayek A. cordifolia K.Koch A. dumanii Sümbül A. frigida Boiss. A. froedinii Rech.f. A. galilaea Boiss. A. graeca Boiss. & Spruner A. haussknechtii Bornm. A. hirsutissima (Bertol.) A.DC. A. hispida Hub.-Mor. A. incana Boiss. A. jordanovii St.Kozhukharov A. kotschyana A.DC. A. leiocarpa Rech.f. A. leptophylla Rech.f. A. lutea A.DC. A. macrophylla Boiss. & Heldr. A. macrosiphon Boiss. & Heldr. A. maleolens Bornm. A. megacarpa A.DC. A. methanaea Hausskn. A. milliana Sümbül A. mughlae H.Duman, Güner& Cagban A. noneiformis Griseb. A. oreodaxo Hub.-Mor. A. orientalis (L.) Boiss. A. pamphylica Hub.-Mor. & Reese A. pelia (Halácsy) Rech.f. A. phrygia Bornm. A. pinardi Boiss. A. pindicola Hausskn. A. prasinophylla Rech.f. A. primuliflora Griseb. A. pseudotinctoria Hub.-Mor. A. pulmonaria Griseb. A. punctulata Hub.-Mor. A. sandwithii Rech.f. A. sartoriana Boiss. & Heldr. A. saxicola Hub.-Mor. A. scardica Griseb. A. shattuckia Post A. sieberi A.DC. A. sieheana Rech.f. A. stojanovii St.Kozhukharov A. stribrnyi Velen. A. strigosa Boiss. & Hohen. A. syriaca (Boiss. & Hohen.) Boiss. A. tinctoria (L.) Tausch A. trichophila Hub.-Mor. A. tubulosa Boiss. A. verecunda Hub.-Mor. A. viscidula Boiss.	swedish	1.017561
Pony/cli-Command-.txt	Command¶ [Source] Command contains all of the information describing a command with its spec and effective options and arguments, ready to use. class box Command Public Functions¶ string¶ [Source] Returns a representational string for this command. fun box string() : String iso^ Returns¶ String iso^ spec¶ [Source] Returns the spec for this command. fun box spec() : CommandSpec box Returns¶ CommandSpec box fullname¶ [Source] Returns the full name of this command, with its parents prefixed. fun box fullname() : String val Returns¶ String val option¶ [Source] Returns the Option by name, defaulting to a fake Option if unknown. fun box option( name: String val) : Option val Parameters¶ name: String val Returns¶ Option val arg¶ [Source] Returns the Arg by name, defaulting to a fake Arg if unknown. fun box arg( name: String val) : Arg val Parameters¶ name: String val Returns¶ Arg val	pony	3227875	https://sv.wikipedia.org/wiki/Rhagio%20validus	Rhagio validus	Rhagio validus är en tvåvingeart som först beskrevs av Meunier 1899. Rhagio validus ingår i släktet Rhagio och familjen snäppflugor. Inga underarter finns listade i Catalogue of Life. Källor Snäppflugor validus	swedish	1.323294
Pony/process-UnknownError-.txt	UnknownError¶ [Source] primitive val UnknownError Constructors¶ create¶ [Source] new val create() : UnknownError val^ Returns¶ UnknownError val^ Public Functions¶ string¶ [Source] fun box string() : String iso^ Returns¶ String iso^ eq¶ [Source] fun box eq( that: UnknownError val) : Bool val Parameters¶ that: UnknownError val Returns¶ Bool val ne¶ [Source] fun box ne( that: UnknownError val) : Bool val Parameters¶ that: UnknownError val Returns¶ Bool val	pony	2268349	https://sv.wikipedia.org/wiki/Eremaeus%20boreomontanus	Eremaeus boreomontanus	Eremaeus boreomontanus är en kvalsterart som beskrevs av Valerie M. Behan-Pelletier 1993. Eremaeus boreomontanus ingår i släktet Eremaeus och familjen Eremaeidae. Inga underarter finns listade i Catalogue of Life. Källor Spindeldjur boreomontanus	swedish	1.05031
Pony/pony_check-Property1UnitTest-.txt	Property1UnitTest[T: T]¶ [Source] Provides plumbing for integration of PonyCheck Properties into PonyTest. Wrap your properties into this class and use it in a TestList: use "pony_test" use "pony_check" class MyProperty is Property1[String] fun name(): String => "my_property" fun gen(): Generator[String] => Generators.ascii_printable() fun property(arg1: String, h: PropertyHelper) => h.assert_true(arg1.size() > 0) actor Main is TestList new create(env: Env) => PonyTest(env, this) fun tag tests(test: PonyTest) => test(Property1UnitTest[String](MyProperty)) class iso Property1UnitTest[T: T] is UnitTest ref Implements¶ UnitTest ref Constructors¶ create¶ [Source] Wrap a Property1 to make it mimic the PonyTest UnitTest. If name' is given, use this as the test name. If not, use the property's name(). new iso create( p1: Property1[T] iso, name': (String val \| None val) = reference) : Property1UnitTest[T] iso^ Parameters¶ p1: Property1[T] iso name': (String val \| None val) = reference Returns¶ Property1UnitTest[T] iso^ Public Functions¶ name¶ [Source] fun box name() : String val Returns¶ String val apply¶ [Source] fun ref apply( h: TestHelper val) : None val ? Parameters¶ h: TestHelper val Returns¶ None val ? exclusion_group¶ fun box exclusion_group() : String val Returns¶ String val timed_out¶ fun ref timed_out( h: TestHelper val) : None val Parameters¶ h: TestHelper val Returns¶ None val set_up¶ fun ref set_up( h: TestHelper val) : None val ? Parameters¶ h: TestHelper val Returns¶ None val ? tear_down¶ fun ref tear_down( h: TestHelper val) : None val Parameters¶ h: TestHelper val Returns¶ None val label¶ fun box label() : String val Returns¶ String val	pony	6943	https://nn.wikipedia.org/wiki/Ruby	Ruby	Ruby er eit objektorientert programmeringsspråk. Det kombinerer syntaks inspirert av Ada og Perl med Smalltalk sine objektorienterte eigenskapar. Det deler òg eigenskapar med Python, Lisp og CLU. Det vart opphavleg utforma som eit tolka programmeringsspråk, men i si JRuby-utgåve kan det bli kompilert. Historie Språket vart etablert av Yukihiro "Matz" Matsumoto som starta jobben med Ruby den 24. februar 1993 og lanserte det i 1995. Namnet Ruby vart valt for å peike på arven etter Perl. I følgje forfattaren vart Ruby utforma for å følgje eit prinsipp om den minste overraskinga. Med dette meiner han at språket skal vere fri for feller og inkonsistensar som pregar andre språk. I desember 2004 var siste stabile versjon 1.8.2 Filosofi Ruby er objektorientert: Alle bitar av data er eit objekt. Dette omfattar typar andre språk ofte definerer som primitive datatypar, slik som til dømes integer. Kvar funksjon er ein metode. Alle variablar er ein referanse til eit objekt, ikkje til objektet sjølv. Ruby støttar arv og import av modular som såkalla MixIn (å endre delar av funksjonaliteten i ein klasse). Prosedyre-syntaks er inkludert, men alle slike prosedyrar skrivne utanfor ein sjølvdefinert klasse blir gjort på klassen av type Object. Sidan denne klassen er forelder til alle andre klassar, blir slike prosedyrar synlege for alle klassar og objekt. Implementasjonar Ruby har to hovudimplementasjonar: Den offisielle Ruby-tolkaren, som er den mest utbreidde, og JRuby, som er ein Java-basert implementasjon. Ruby har òg vorte brukt til rammeverk for utvikling av tynne klienter for verdsveven, t.d. Ruby on rails. Lisensiering Ruby blir distribuert under GPL og Ruby License . Eigenskaper objektorientert Avvikshåndtering Iteratorar Å sende blokker av kode som parameter (closure) Overstyring av operatorar Automatisk fjerning av objekt som ikkje lenger er i bruk (garbage collection) Fleirtrådshandtering Lasting av DLL-bibliotek (under Microsoft Windows) Introspection og reflection. Stort standard bibliotek. Støttar innsetting av avhengigheiter. Per dags dato manglar Ruby støtte for Unicode, men har delvis støtte for UTF-8. Moglege overraskingar Sjølv om Ruby er utforma etter prinsippet om den minste overraskinga er det store skilnader frå andre språk som C og Perl. Lokale variablar må ha namn som startar med små bokstav, elles blir dei betrakta som konstantar. 0, "" og [] er sant (true): I C blir uttrykket 0 ? 1: 0 tolka som 0. I Ruby blir dette tolka som 1. Forsvar: I Ruby returnerer mange uttrykk anten ein numerisk verdi, ein streng eller “null”. Når ein slik verdi blir tolka i ein boolsk samanheng blir berre ”null” tolka som usann (false). Kvar numerisk, streng eller array-verdi inkludert null (0, tom streng, "", eller array []) blir tolka som sann (true). Difor, som i Java, vil det ikkje fungere med C- og Perl sin automatiske konvertering av numeriske verdiar, strengar og array til boolsk usann. For å indikere flyttal er det ikkje nok å legge til eit punktum (99.). Fordi nummer kan forvekslast med metodar må ein legge til ein ekstra null (99.0) eller gje opp konverteringa eksplisitt (99.to_f). Der er ingen karakter datatype. Dette kan føre til uventa resultat ved kutting av strengar: ”abc”[0] gir 97 som er den numeriske ASCII-koden for den første karakteren i strengen. Døme Eit grunnleggande døme: # Alt er objekt -199.abs # 199 "ruby is cool".length # 12 "Rick".index("c") # 2 "Nice Day Isn't It?".split(//).uniq.sort.join # " '?DINaceinsty" Lister Eit array: a =[1, 'hi', 3.14, 1, 2, [4, 5]] a[2] # 3.14 a.reverse # [[4, 5], 2, 1, 3.14, "hi", 1] a.flatten.uniq # [1, "hi", 3.14, 2, 4, 5] Ein hash-tabell: hash = {'water' => 'wet', 'fire' => 'hot'} puts hash['fire'] hash.each_pair do \|key, value\| puts "#{key} is #{value}" end # Skriv ut: water is wet # fire is hot hash.delete_if {\|key, value\| key == 'water'} # Slettar 'water' => 'wet' Blokker og iteratorar To måtar å opprette ei kodeblokk: {puts "Hello, World!"} do puts "Hello, World!" end Sende ei blokk som parameter (closure): def remember &p @block =p end # Sender med ei kodeblokk som parameter og gir den eit namn remember {\|name\| puts "Hello, " + name + "!"} # Når tida er inne -- kall closure! @block.call("Johnny") # Prints "Hello, Johnny!" Iterere over array og enumeratorar: a =[1, 'hi', 3.14] a.each {\|item\| puts item} # Skriv ut kvart element (3..6).each {\|num\| puts num} # Skriv ut 1 -6. Blokker fungerer med mange innebygde metodar: IO.readlines('file.txt') do \|line\| # gjer noko med linja her. end Kvadrere 1 til 10: (1..10).collect {\|x\| x*x} => [1, 4, 9, 16, 25, 36, 49, 64, 81, 100] Klassar Følgjande kode definerer klassen Person. I tillegg til ’initialize’, den vanlege konstruktøren, har klassen to metodar: Ein for å overstyre <=>-operatoren for å sortere etter alder. Den andre overstyre to_s for å få korrekt formatering. class Person def initialize(name, age) @name, @age = name, age end def <=>(person) @age <=> person.age end def to_s "#{@name} (#{@age})" end attr_reader :name, :age end group = [ Person.new("John", 20), Person.new("Markus", 63), Person.new("Ash", 16) ] puts group.sort.reverse Koden over skriv ut ei liste sortert med den eldste først: Markus (63) John (20) Ash (16) Hello World puts "Hello World!" Bakgrunnsstoff Ruby si heimeside Ruby Garden Programming Ruby —Full tekst av bok av David Thomas & Andrew Hunt, ISBN 0-201-71089-7 Why's Poignant Guide to Ruby Ruby Ofte stilte spørsmål , eller den gamle versjonen Ruby Application Archive (RAA) JRuby The Ruby Documentation project Ruby Forum RubyForge RedHanded —Daglege Ruby nyhende Programmeringsspråk	norwegian_nynorsk	0.929969
Pony/files-FileStream-.txt	FileStream¶ [Source] Asynchronous access to a File object. Wraps file operations print, write, printv and writev. The File will be disposed through File._final. actor tag FileStream is OutStream tag Implements¶ OutStream tag Constructors¶ create¶ [Source] new tag create( file: File iso) : FileStream tag^ Parameters¶ file: File iso Returns¶ FileStream tag^ Public Behaviours¶ print¶ [Source] Print some bytes and insert a newline afterwards. be print( data: (String val \| Array[U8 val] val)) Parameters¶ data: (String val \| Array[U8 val] val) write¶ [Source] Print some bytes without inserting a newline afterwards. be write( data: (String val \| Array[U8 val] val)) Parameters¶ data: (String val \| Array[U8 val] val) printv¶ [Source] Print an iterable collection of ByteSeqs. be printv( data: ByteSeqIter val) Parameters¶ data: ByteSeqIter val writev¶ [Source] Write an iterable collection of ByteSeqs. be writev( data: ByteSeqIter val) Parameters¶ data: ByteSeqIter val flush¶ [Source] Flush pending data to write. be flush()	pony	50692	https://sv.wikipedia.org/wiki/Python%20%28programspr%C3%A5k%29	Python (programspråk)	Python är ett programspråk som lanserades 1991 av Guido van Rossum. Det är vanligt som nybörjarspråk och inom undervisning, men också som generellt programspråk med tillämpning inom många olika domäner. Det har dynamisk typning, varför det ibland beskrivs som ett skriptspråk. Språket utmärks också av att indentering påverkar programflödet. Detta gör programkoden kompakt och anses ge den god läsbarhet. Språket utvecklas som öppen källkod. Till språket hör därför flera utvecklingsmiljöer, ett rikt standardbibliotek och många tredjepartsbibliotek. Dessa har tillämpningsområden inom textbehandling, datorgrafik, spelprogrammering, datavisualisering, vetenskapliga beräkningar, maskininlärning, datamining, grafiska användargränssnitt, webbserverscript, systemautomation/skalskript och programmering av mikrokontroller/inbyggda system. Version Python 3.0, som släpptes 2008, var en större översyn av språket som inte är bakåtkompatibel, men mycket kod för den sista tidigare versionen Python 2.7.18 och tidigare har levt kvar länge. Utmärkande drag Något som särskilt utmärker Python är dess "eleganta" och rena programkod. Rader behöver inte avslutas med semikolon, något som annars är vanligt i andra programspråk. Klamrar ('{', '}') eller BEGIN och END behövs inte heller för att dela in koden i block, eftersom indragningar avgör var ett kod-block börjar och slutar. Detta ökar läsbarheten av koden, enligt Pythons egen hemsida. Språket har stöd för flera olika programmeringsparadigm, bland annat strukturerad proceduriell programmering, objektorienterad programmering och funktionell programmering. Språket har en effektiv automatisk skräpsamling. Det stödjer textbehandling med regex. Objektorientering Objektorienteringen i Python går längre än den man finner i exempelvis C++, eftersom språkets alla datatyper är baserade på objekt och klasser. Man kan exempelvis skriva: print("en gul bil".replace("gul", "grön")) Replace är en inbyggd metod och utskriften blir "en grön bil". Själva strängen fungerar som ett objekt av klassen str, det vill säga en sträng. Vidare stöder Python multipelt arv. Enkla datatyper Python har ett antal enkla datatyper som numeriska (int, float, long, complex). Förutom de numeriska datatyperna finns boolean, sträng, lista, tuple och ordbok. Operatorer Beräkningar är centrala för all programmering. Med Python utförs beräkningar av infix operatorer (plus, minus, och så vidare). I Python finns det en mängd operatorer där de enklaste representeras i listan nedan. Numeriska datatyper Heltal Heltal beskrivs bäst som ett tal utan decimaler. Det innebär att resten i en division lämnas utan åtgärd. >>> i = 3 >>> j = 2 >>> i // j 1 >>> Icke numeriska datatyper Sträng En sträng är en datatyp uppbyggd av tecken, såsom bokstäver, siffror och interpunktioner. I Python definieras den med apostrofer 'sträng' eller citationstecken"sträng". Det går också att skriva strängar uppdelade på flera rader genom att använda """sträng""". En sträng är uppbyggd på samma sätt som en lista vilket innebär att man kan ta fram tecken nummer n i en lista . I exemplet nedan visas det tredje respektive det sista tecknet* i den konkatenerade strängen. Negativa värden för n avser index från slutet av strängen. >>> s = '' >>> s '' >>> s += 'concatenate string' >>> s 'concatenate string' >>> s[2] 'n' >>> s[-1] 'g' >>> ) Det tredje tecknet representeras av [2] eftersom listor börjar räkna från 0. Boolesk (boolean, bool) Datatypen boolean, sant eller falskt, kan testas på flera olika sätt och används framförallt i iterativa loopar. None, noll ( 0 ), en tom lista [] eller en tom tuple () representeras som falska. Numeriska värden som inte är noll ( 0 ), listor med innehåll och ordböcker med innehåll är sanna. >>> i = 3 >>> bool(i) True >>> bool(i-i) False >>> >>> a = [] >>> bool(a) False >>> a.append(3) >>> a [3] >>> bool(a) True >>> Programexempel Det enkla "Hello World"-programmet går enkelt att skriva på en rad. print("Hello World") Skriver talen 0-99 till en fil, ett tal per rad. numbers = [] for number in range(100): numbers.append(str(number) + "\n") open("filnamn", "w").writelines(numbers) Som exemplet ovan, fast utan att det behövs någon variabel för mellanlagring. open("filnamn", "w").writelines(str(x)+"\n" for x in range(100)) Caesars rotationskrypto Julius Caesar roterade enligt Suetonius alfabetet för att kryptera sina meddelanden, Caesarchiffer. Ett inte alltför avancerat krypto, men det går inte att läsa textens innehåll i klartext, utan man är tvungen att veta hur många steg alfabetet är roterat. Nedan ett Pythonprogram (ver 2.6) som krypterar en text-fil: #! /usr/bin/env python # -- coding: UTF-8 -- # print header print('-'77) print(" Use function code() to open file to encrypt and save it with a new name") print('-'77) import tkFileDialog def code(): #retreive filename openFileName = tkFileDialog.askopenfilename() while openFileName == '': print('Please choose a file') openFileName = tkFileDialog.askopenfilename() #open file with filename f = open( openFileName, 'r' ) fileData= f.read() #encode file encodedFile = '' for char in fileData: encodedFile += alphabet(char) #save file saveFileName = tkFileDialog.asksaveasfilename() if saveFileName: file = open( saveFileName, 'w' ) file.write(encodedFile) print("File encrypted and saved successfully") f.close() def alphabet(char): alphabet = "abcdefghijklmnopqrstuvwxyzåäö" alphabet += "ABCDEFGHIJKLMNOPQRSTUVWXYZÅÄÖ" alphabet += ".,;:-_?=()/&%\#!{[]}’^~<\|>" alphabet += "0123456789" alphabet += "\n" + "\r" + ' ' if char in alphabet: pos = alphabet.find( char ) encr = alphabet[ (pos + 3) % len( alphabet ) ] else: encr = char return encr Hitta länkar och e-postadresser i webbsidor Det här lilla programmet (Python 2.6) returnerar webbadresser och e-postadresser från en webbsidas kod. Kan vara användbart om det finns dolda element, eller länkar som inte alltid är synliga: #! /usr/bin/env python # -- coding: cp1252 -- # print header print '-'77 print ' Use function getAddresses( "url" ) to retreive links from current' print ' URL.' print '-'77 import urllib2 def getAddresses( url ): f = urllib2.urlopen( url ) source = f.read() source = source.split(' ') urls = [] for s in source: if 'http://' in s: s = s.split('"') for x in s: if 'http://' in x: urls.append( x ) emails = [] for s in source: if '@' in s: s = s.split('"') for x in s: if '@' in x and x != '@import' and 'mailto' not in s[i]: m = x.split('<') emails.append( m[0] ) return emails, urls Utvecklingsmiljöer En vanlig utvecklingsmiljö för nybörjare är Idle, med installationsverktyget Pip. Utvecklingsmiljön Anaconda, med installationsverktyget Conda, används ofta för beräkningar och maskininlärning. Det innehåller verktyget Jupyter notebook, som möjliggör att man interaktivt kan redigera flera olika program och visar resulterande utskrifter i ett och samma dokument, exempelvis en laborationsrapport. Anaconda innehåller kompatibla versioner av bibliotek som NumPy, SciPy och Matplotlib, vilka möjliggör effektiv användning av Python för vetenskapliga beräkningar och datavisualisering. Referensimplementering CPython är referensimplementeringen av Python. Det är skrivet i C, uppfyller C89-standarden med flera utvalda C99-funktioner (med senare C-versioner ute, det anses vara föråldrat; CPython innehåller sina egna C-tillägg, men tredjepartstillägg är inte begränsade till äldre C-versioner, kan t.ex. implementeras med C11 eller C++). Den sammanställer Python -program till en mellanliggande bytekod som sedan körs av sin virtuella maskin. CPython distribueras med ett stort standardbibliotek skrivet i en blandning av C och infödda Python. Den är tillgänglig för många plattformar, inklusive Windows (från och med Python 3.9, Python-installationsprogrammet misslyckas medvetet med att installera på Windows 7 och 8; Windows XP stöds till Python 3.5) och de flesta moderna Unix-liknande system, inklusive macOS (och Apple M1 Mac, sedan Python 3.9.1, med experimentell installerare) och inofficiellt stöd för t.ex. VMS. Plattformsportabilitet var en av de tidigaste prioriteringarna, under Python 1 och 2-tidsramen stöds även OS/2 och Solaris; stödet har sedan tappats för många plattformar. API -dokumentationsgeneratorer Verktyg som kan generera dokumentation för Python API inkluderar bland annat pydoc (finns som en del av standardbiblioteket), Sphinx, Pdoc och dess gafflar, Doxygen och Graphviz. Se även PyGame Django Referenser Externa länkar Pythons hemsida Python Tutorial wxPython, ett bibliotek med rutiner för GUI-programmering för Python. Zope, en applikationsserver för Python. Klassbaserade programspråk Objektorienterade programspråk Skriptspråk	swedish	0.726299
Pony/src-builtin-std_stream-.txt	std_stream.pony 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108use @pony_os_stdout[Pointer[U8]]() use @pony_os_stderr[Pointer[U8]]() use @pony_os_std_flush[None](file: Pointer[None] tag) use @pony_os_std_print[None](file: Pointer[None] tag, buffer: Pointer[U8] tag, size: USize) use @pony_os_std_write[None](file: Pointer[None] tag, buffer: Pointer[U8] tag, size: USize) type ByteSeq is (String \| Array[U8] val) interface val ByteSeqIter """ Accept an iterable collection of String or Array[U8] val. """ fun values(): Iterator[this->ByteSeq box] interface tag OutStream """ Asnychronous access to some output stream. """ be print(data: ByteSeq) """ Print some bytes and insert a newline afterwards. """ be write(data: ByteSeq) """ Print some bytes without inserting a newline afterwards. """ be printv(data: ByteSeqIter) """ Print an iterable collection of ByteSeqs. """ be writev(data: ByteSeqIter) """ Write an iterable collection of ByteSeqs. """ be flush() """ Flush the stream. """ actor StdStream """ Asynchronous access to stdout and stderr. The constructors are private to ensure that access is provided only via an environment. """ var _stream: Pointer[U8] new _out() => """ Create an async stream for stdout. """ _stream = @pony_os_stdout() new _err() => """ Create an async stream for stderr. """ _stream = @pony_os_stderr() be print(data: ByteSeq) => """ Print some bytes and insert a newline afterwards. """ _print(data) be write(data: ByteSeq) => """ Print some bytes without inserting a newline afterwards. """ _write(data) be printv(data: ByteSeqIter) => """ Print an iterable collection of ByteSeqs. """ for bytes in data.values() do _print(bytes) end be writev(data: ByteSeqIter) => """ Write an iterable collection of ByteSeqs. """ for bytes in data.values() do _write(bytes) end be flush() => """ Flush any data out to the os (ignoring failures). """ @pony_os_std_flush(_stream) fun ref _write(data: ByteSeq) => """ Write the bytes without explicitly flushing. """ @pony_os_std_write(_stream, data.cpointer(), data.size()) fun ref _print(data: ByteSeq) => """ Write the bytes and a newline without explicitly flushing. """ @pony_os_std_print(_stream, data.cpointer(), data.size())	pony	2087139	https://no.wikipedia.org/wiki/Litteratur%C3%A5ret%201824	Litteraturåret 1824	Litteraturåret 1824 er en oversikt over utgivelser, hendelser, fødte og avdøde personer med tilknytning til litteratur i 1824. Fødsler \|- \|Januar \|\| 8. \|\| Wilkie Collins \|\| \|\| forfatter \|\|align=center\|65 \|\|align=center\| \|\| \|} Referanser Eksterne lenker	norwegian_bokmål	1.452682
Pony/collections-persistent-VecValues-.txt	VecValues[A: Any #share]¶ [Source] class ref VecValues[A: Any #share] Constructors¶ create¶ [Source] new ref create( v: Vec[A] val) : VecValues[A] ref^ Parameters¶ v: Vec[A] val Returns¶ VecValues[A] ref^ Public Functions¶ has_next¶ [Source] fun box has_next() : Bool val Returns¶ Bool val next¶ [Source] fun ref next() : val->A ? Returns¶ val->A ?	pony	160606	https://no.wikipedia.org/wiki/Avl	Avl	Avl, som også kalles al, drett, oppdrett, kunstig utvalg og selektiv utvelgelse, er planmessig ledelse av dyrs formering. Den som driver med slik avl kalles en oppdretter. Ifølge Bokmålsordboka er avl «målbevisst arbeid for arvelig forbedring av husdyr ved å velge ut hvilke dyr som skal være foreldre til neste kull av avkom». Det eksisterer en rekke ulike avlsmetoder, som kan være mer eller mindre kontroversielle. Motsatsen til selektiv utvelgelse er naturlig seleksjon. Moderne avl benytter i stor grad kunstig befruktning gjennom inseminasjon (assistert overføring av sæd). Avlsmetoder Ekstremavl Innavl Kryssavl Linjeavl Matadoravl Raseavl Renavl Rene linjer Testkrysning Tilbakekrysning Utavl Se også Avkom Avlsdyr Fiskeoppdrett Forelder Genetikk Kjønnet formering Kyllingoppdrett Moderne hundeavl Naturlig seleksjon Paring Pelsdyroppdrett Stambokregister Referanser Oppdrett ar:استيلاد انتقائي fr:Élevage sélectif des animaux id:Penangkaran selektif it:Riproduzione selettiva nl:Fokken ja:品種改良	norwegian_bokmål	1.134675
Pony/src-builtin-runtime_options-.txt	runtime_options.pony 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121struct RuntimeOptions """ Pony struct for the Pony runtime options C struct that can be used to override the Pony runtime defaults via code compiled into the program. The way this is done is by adding the following function to your `Main` actor: ``` fun @runtime_override_defaults(rto: RuntimeOptions) => ``` and then overriding the fields of `rto` (the `RuntimeOptions` instance) as needed. NOTE: Command line arguments still any values set via `@runtime_override_defaults`. The following example overrides the `--ponyhelp` argument to default it to `true` instead of `false` causing the compiled program to always display the Pony runtime help: ``` actor Main new create(env: Env) => env.out.print("Hello, world.") fun @runtime_override_defaults(rto: RuntimeOptions) => rto.ponyhelp = true ``` """ /* NOTE: if you change any of the field docstrings, update `options.h` in * the runtime to keep them in sync. */ var ponymaxthreads: U32 = 0 """ Use N scheduler threads. Defaults to the number of cores (not hyperthreads) available. This can't be larger than the number of cores available. """ var ponyminthreads: U32 = 0 """ Minimum number of active scheduler threads allowed. Defaults to 0, meaning that all scheduler threads are allowed to be suspended when no work is available. This can't be larger than --ponymaxthreads if provided, or the physical cores available. """ var ponynoscale: Bool = false """ Don't scale down the scheduler threads. See --ponymaxthreads on how to specify the number of threads explicitly. Can't be used with --ponyminthreads. """ var ponysuspendthreshold: U32 = 0 """ Amount of idle time before a scheduler thread suspends itself to minimize resource consumption (max 1000 ms, min 1 ms). Defaults to 1 ms. """ var ponycdinterval: U32 = 100 """ Run cycle detection every N ms (max 1000 ms, min 10 ms). Defaults to 100 ms. """ var ponygcinitial: USize = 14 """ Defer garbage collection until an actor is using at least 2^N bytes. Defaults to 2^14. """ var ponygcfactor: F64 = 2.0 """ After GC, an actor will next be GC'd at a heap memory usage N times its current value. This is a floating point value. Defaults to 2.0. """ var ponynoyield: Bool = false """ Do not yield the CPU when no work is available. """ var ponynoblock: Bool = false """ Do not send block messages to the cycle detector. """ var ponypin: Bool = false """ Pin scheduler threads to CPU cores. The ASIO thread can also be pinned if `--ponypinasio` is set. """ var ponypinasio: Bool = false """ Pin the ASIO thread to a CPU the way scheduler threads are pinned to CPUs. Requires `--ponypin` to be set to have any effect. """ var ponyprintstatsinterval: U32 = -1 """ Print actor stats before an actor is destroyed and print scheduler stats every X seconds. Defaults to -1 (never). """ var ponyversion: Bool = false """ Print the version of the compiler and exit. """ var ponyhelp: Bool = false """ Print the runtime usage options and exit. """	pony	2127206	https://sv.wikipedia.org/wiki/Styloniscus%20sylvestris	Styloniscus sylvestris	Styloniscus sylvestris är en kräftdjursart som beskrevs av Green 1971. Styloniscus sylvestris ingår i släktet Styloniscus och familjen Styloniscidae. Inga underarter finns listade i Catalogue of Life. Källor Externa länkar Gråsuggor och tånglöss sylvestris	swedish	1.412079
Pony/src-collections-list_node-.txt	list_node.pony 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223class ListNode[A] """ A node in a doubly linked list. See Pony [collections.List](https://stdlib.ponylang.io/collections-List/) class for usage examples. Each node contains four fields: two link fields (references to the previous and to the next node in the sequence of nodes), one data field, and the reference to the List in which it resides. As you would expect functions are provided to create a ListNode, update a ListNode's contained item, and pop the item from the ListNode. Additional functions are provided to operate on a ListNode as part of a Linked List. These provide for prepending, appending, removal, and safe traversal in both directions. The Ponylang [collections.List](https://stdlib.ponylang.io/collections-List/) class is the correct way to create these. _Do not attempt to create a Linked List using only ListNodes._ ## Example program The functions which are illustrated below are only those which operate on an individual ListNode. It outputs: My node has the item value: My Node item My node has the updated item value: My updated Node item Popped the item from the ListNode The ListNode has no (None) item. ```pony use "collections" actor Main new create(env:Env) => // Create a new ListNode of type String let my_list_node = ListNode[String]("My Node item") try env.out.print("My node has the item value: " + my_list_node.apply()?) // My Node item end // Update the item contained in the ListNode try my_list_node.update("My updated Node item")? env.out.print("My node has the updated item value: " + my_list_node.apply()?) // My updated Node item end // Pop the item from the ListNode try my_list_node.pop()? env.out.print("Popped the item from the ListNode") my_list_node.apply()? // This will error as the item is now None else env.out.print("The ListNode has no (None) item.") end ``` """ var _item: (A \| None) var _list: (List[A] \| None) = None var _prev: (ListNode[A] \| None) = None var _next: (ListNode[A] \| None) = None new create(item: (A \| None) = None) => """ Create a node. Initially, it is not in any list. """ _item = consume item fun apply(): this->A ? => """ Return the item, if we have one, otherwise raise an error. """ _item as this->A fun ref update(value: (A \| None)): A^ ? => """ Replace the item and return the previous one. Raise an error if we have no previous value. """ (_item = consume value) as A^ fun ref pop(): A^ ? => """ Remove the item from the node, if we have one, otherwise raise an error. """ (_item = None) as A^ fun ref prepend(that: ListNode[A]): Bool => """ Prepend a node to this one. If `that` is already in a list, it is removed before it is prepended. Returns true if `that` was removed from another list. If the ListNode is not contained within a List the prepend will fail. """ if (_prev is that) or (this is that) then return false end var in_list = false match _list \| let list': List[A] => in_list = that._list isnt None that.remove() match _prev \| let prev': ListNode[A] => prev'._next = that else list'._set_head(that) end that._list = list' that._prev = _prev that._next = this _prev = that list'._increment() end in_list fun ref append(that: ListNode[A]): Bool => """ Append a node to this one. If `that` is already in a list, it is removed before it is appended. Returns true if `that` was removed from another list. If the ListNode is not contained within a List the append will fail. """ if (_next is that) or (this is that) then return false end var in_list = false match _list \| let list': List[A] => in_list = that._list isnt None that.remove() match _next \| let next': ListNode[A] => next'._prev = that else list'._set_tail(that) end that._list = list' that._prev = this that._next = _next _next = that list'._increment() end in_list fun ref remove() => """ Remove a node from a list. The ListNode must be contained within a List for this to succeed. """ match _list \| let list': List[A] => match (_prev, _next) \| (let prev': ListNode[A], let next': ListNode[A]) => // We're in the middle of the list. prev'._next = _next next'._prev = _prev _prev = None _next = None \| (let prev': ListNode[A], None) => // We're the tail. prev'._next = None list'._set_tail(prev') _prev = None \| (None, let next': ListNode[A]) => // We're the head. next'._prev = None list'._set_head(next') _next = None \| (None, None) => // We're the only member list'._set_head(None) list'._set_tail(None) end list'._decrement() _list = None end fun has_prev(): Bool => """ Return true if there is a previous node. """ _prev isnt None fun has_next(): Bool => """ Return true if there is a next node. """ _next isnt None fun prev(): (this->ListNode[A] \| None) => """ Return the previous node. """ _prev fun next(): (this->ListNode[A] \| None) => """ Return the next node. """ _next fun ref _set_list(list: List[A]): ListNode[A]^ => """ Make this node the only node on the given list. """ remove() _list = list this	pony	4825520	https://sv.wikipedia.org/wiki/Aconogonon%20bargusinense	Aconogonon bargusinense	Aconogonon bargusinense är en slideväxtart som först beskrevs av Galina A. Peschkova, och fick sitt nu gällande namn av Sojak. Aconogonon bargusinense ingår i släktet sliden, och familjen slideväxter. Inga underarter finns listade i Catalogue of Life. Källor Sliden bargusinense	swedish	1.375211
Pony/builtin-ISize-.txt	ISize¶ [Source] primitive val ISize is SignedInteger[ISize val, USize val] val Implements¶ SignedInteger[ISize val, USize val] val Constructors¶ create¶ [Source] new val create( value: ISize val) : ISize val^ Parameters¶ value: ISize val Returns¶ ISize val^ from[A: ((I8 val \| I16 val \| I32 val \| I64 val \| I128 val \| ILong val \| ISize val \| U8 val \| U16 val \| U32 val \| U64 val \| U128 val \| ULong val \| USize val \| F32 val \| F64 val) & Real[A] val)]¶ [Source] new val from[A: ((I8 val \| I16 val \| I32 val \| I64 val \| I128 val \| ILong val \| ISize val \| U8 val \| U16 val \| U32 val \| U64 val \| U128 val \| ULong val \| USize val \| F32 val \| F64 val) & Real[A] val)]( a: A) : ISize val^ Parameters¶ a: A Returns¶ ISize val^ min_value¶ [Source] new val min_value() : ISize val^ Returns¶ ISize val^ max_value¶ [Source] new val max_value() : ISize val^ Returns¶ ISize val^ Public Functions¶ abs¶ [Source] fun box abs() : USize val Returns¶ USize val bit_reverse¶ [Source] fun box bit_reverse() : ISize val Returns¶ ISize val bswap¶ [Source] fun box bswap() : ISize val Returns¶ ISize val popcount¶ [Source] fun box popcount() : USize val Returns¶ USize val clz¶ [Source] fun box clz() : USize val Returns¶ USize val ctz¶ [Source] fun box ctz() : USize val Returns¶ USize val clz_unsafe¶ [Source] fun box clz_unsafe() : USize val Returns¶ USize val ctz_unsafe¶ [Source] fun box ctz_unsafe() : USize val Returns¶ USize val bitwidth¶ [Source] fun box bitwidth() : USize val Returns¶ USize val bytewidth¶ [Source] fun box bytewidth() : USize val Returns¶ USize val min¶ [Source] fun box min( y: ISize val) : ISize val Parameters¶ y: ISize val Returns¶ ISize val max¶ [Source] fun box max( y: ISize val) : ISize val Parameters¶ y: ISize val Returns¶ ISize val fld¶ [Source] fun box fld( y: ISize val) : ISize val Parameters¶ y: ISize val Returns¶ ISize val fld_unsafe¶ [Source] fun box fld_unsafe( y: ISize val) : ISize val Parameters¶ y: ISize val Returns¶ ISize val mod¶ [Source] fun box mod( y: ISize val) : ISize val Parameters¶ y: ISize val Returns¶ ISize val mod_unsafe¶ [Source] fun box mod_unsafe( y: ISize val) : ISize val Parameters¶ y: ISize val Returns¶ ISize val addc¶ [Source] fun box addc( y: ISize val) : (ISize val , Bool val) Parameters¶ y: ISize val Returns¶ (ISize val , Bool val) subc¶ [Source] fun box subc( y: ISize val) : (ISize val , Bool val) Parameters¶ y: ISize val Returns¶ (ISize val , Bool val) mulc¶ [Source] fun box mulc( y: ISize val) : (ISize val , Bool val) Parameters¶ y: ISize val Returns¶ (ISize val , Bool val) divc¶ [Source] fun box divc( y: ISize val) : (ISize val , Bool val) Parameters¶ y: ISize val Returns¶ (ISize val , Bool val) remc¶ [Source] fun box remc( y: ISize val) : (ISize val , Bool val) Parameters¶ y: ISize val Returns¶ (ISize val , Bool val) fldc¶ [Source] fun box fldc( y: ISize val) : (ISize val , Bool val) Parameters¶ y: ISize val Returns¶ (ISize val , Bool val) modc¶ [Source] fun box modc( y: ISize val) : (ISize val , Bool val) Parameters¶ y: ISize val Returns¶ (ISize val , Bool val) add_partial¶ [Source] fun box add_partial( y: ISize val) : ISize val ? Parameters¶ y: ISize val Returns¶ ISize val ? sub_partial¶ [Source] fun box sub_partial( y: ISize val) : ISize val ? Parameters¶ y: ISize val Returns¶ ISize val ? mul_partial¶ [Source] fun box mul_partial( y: ISize val) : ISize val ? Parameters¶ y: ISize val Returns¶ ISize val ? div_partial¶ [Source] fun box div_partial( y: ISize val) : ISize val ? Parameters¶ y: ISize val Returns¶ ISize val ? rem_partial¶ [Source] fun box rem_partial( y: ISize val) : ISize val ? Parameters¶ y: ISize val Returns¶ ISize val ? divrem_partial¶ [Source] fun box divrem_partial( y: ISize val) : (ISize val , ISize val) ? Parameters¶ y: ISize val Returns¶ (ISize val , ISize val) ? fld_partial¶ [Source] fun box fld_partial( y: ISize val) : ISize val ? Parameters¶ y: ISize val Returns¶ ISize val ? mod_partial¶ [Source] fun box mod_partial( y: ISize val) : ISize val ? Parameters¶ y: ISize val Returns¶ ISize val ? shl¶ [Source] fun box shl( y: USize val) : ISize val Parameters¶ y: USize val Returns¶ ISize val shr¶ [Source] fun box shr( y: USize val) : ISize val Parameters¶ y: USize val Returns¶ ISize val shl_unsafe¶ [Source] fun box shl_unsafe( y: USize val) : ISize val Parameters¶ y: USize val Returns¶ ISize val shr_unsafe¶ [Source] fun box shr_unsafe( y: USize val) : ISize val Parameters¶ y: USize val Returns¶ ISize val string¶ [Source] fun box string() : String iso^ Returns¶ String iso^ add_unsafe¶ [Source] fun box add_unsafe( y: ISize val) : ISize val Parameters¶ y: ISize val Returns¶ ISize val sub_unsafe¶ [Source] fun box sub_unsafe( y: ISize val) : ISize val Parameters¶ y: ISize val Returns¶ ISize val mul_unsafe¶ [Source] fun box mul_unsafe( y: ISize val) : ISize val Parameters¶ y: ISize val Returns¶ ISize val div_unsafe¶ [Source] fun box div_unsafe( y: ISize val) : ISize val Parameters¶ y: ISize val Returns¶ ISize val divrem_unsafe¶ [Source] fun box divrem_unsafe( y: ISize val) : (ISize val , ISize val) Parameters¶ y: ISize val Returns¶ (ISize val , ISize val) rem_unsafe¶ [Source] fun box rem_unsafe( y: ISize val) : ISize val Parameters¶ y: ISize val Returns¶ ISize val neg_unsafe¶ [Source] fun box neg_unsafe() : ISize val Returns¶ ISize val op_and¶ [Source] fun box op_and( y: ISize val) : ISize val Parameters¶ y: ISize val Returns¶ ISize val op_or¶ [Source] fun box op_or( y: ISize val) : ISize val Parameters¶ y: ISize val Returns¶ ISize val op_xor¶ [Source] fun box op_xor( y: ISize val) : ISize val Parameters¶ y: ISize val Returns¶ ISize val op_not¶ [Source] fun box op_not() : ISize val Returns¶ ISize val add¶ [Source] fun box add( y: ISize val) : ISize val Parameters¶ y: ISize val Returns¶ ISize val sub¶ [Source] fun box sub( y: ISize val) : ISize val Parameters¶ y: ISize val Returns¶ ISize val mul¶ [Source] fun box mul( y: ISize val) : ISize val Parameters¶ y: ISize val Returns¶ ISize val div¶ [Source] fun box div( y: ISize val) : ISize val Parameters¶ y: ISize val Returns¶ ISize val divrem¶ [Source] fun box divrem( y: ISize val) : (ISize val , ISize val) Parameters¶ y: ISize val Returns¶ (ISize val , ISize val) rem¶ [Source] fun box rem( y: ISize val) : ISize val Parameters¶ y: ISize val Returns¶ ISize val neg¶ [Source] fun box neg() : ISize val Returns¶ ISize val eq¶ [Source] fun box eq( y: ISize val) : Bool val Parameters¶ y: ISize val Returns¶ Bool val ne¶ [Source] fun box ne( y: ISize val) : Bool val Parameters¶ y: ISize val Returns¶ Bool val lt¶ [Source] fun box lt( y: ISize val) : Bool val Parameters¶ y: ISize val Returns¶ Bool val le¶ [Source] fun box le( y: ISize val) : Bool val Parameters¶ y: ISize val Returns¶ Bool val ge¶ [Source] fun box ge( y: ISize val) : Bool val Parameters¶ y: ISize val Returns¶ Bool val gt¶ [Source] fun box gt( y: ISize val) : Bool val Parameters¶ y: ISize val Returns¶ Bool val hash¶ [Source] fun box hash() : USize val Returns¶ USize val hash64¶ [Source] fun box hash64() : U64 val Returns¶ U64 val i8¶ [Source] fun box i8() : I8 val Returns¶ I8 val i16¶ [Source] fun box i16() : I16 val Returns¶ I16 val i32¶ [Source] fun box i32() : I32 val Returns¶ I32 val i64¶ [Source] fun box i64() : I64 val Returns¶ I64 val i128¶ [Source] fun box i128() : I128 val Returns¶ I128 val ilong¶ [Source] fun box ilong() : ILong val Returns¶ ILong val isize¶ [Source] fun box isize() : ISize val Returns¶ ISize val u8¶ [Source] fun box u8() : U8 val Returns¶ U8 val u16¶ [Source] fun box u16() : U16 val Returns¶ U16 val u32¶ [Source] fun box u32() : U32 val Returns¶ U32 val u64¶ [Source] fun box u64() : U64 val Returns¶ U64 val u128¶ [Source] fun box u128() : U128 val Returns¶ U128 val ulong¶ [Source] fun box ulong() : ULong val Returns¶ ULong val usize¶ [Source] fun box usize() : USize val Returns¶ USize val f32¶ [Source] fun box f32() : F32 val Returns¶ F32 val f64¶ [Source] fun box f64() : F64 val Returns¶ F64 val i8_unsafe¶ [Source] fun box i8_unsafe() : I8 val Returns¶ I8 val i16_unsafe¶ [Source] fun box i16_unsafe() : I16 val Returns¶ I16 val i32_unsafe¶ [Source] fun box i32_unsafe() : I32 val Returns¶ I32 val i64_unsafe¶ [Source] fun box i64_unsafe() : I64 val Returns¶ I64 val i128_unsafe¶ [Source] fun box i128_unsafe() : I128 val Returns¶ I128 val ilong_unsafe¶ [Source] fun box ilong_unsafe() : ILong val Returns¶ ILong val isize_unsafe¶ [Source] fun box isize_unsafe() : ISize val Returns¶ ISize val u8_unsafe¶ [Source] fun box u8_unsafe() : U8 val Returns¶ U8 val u16_unsafe¶ [Source] fun box u16_unsafe() : U16 val Returns¶ U16 val u32_unsafe¶ [Source] fun box u32_unsafe() : U32 val Returns¶ U32 val u64_unsafe¶ [Source] fun box u64_unsafe() : U64 val Returns¶ U64 val u128_unsafe¶ [Source] fun box u128_unsafe() : U128 val Returns¶ U128 val ulong_unsafe¶ [Source] fun box ulong_unsafe() : ULong val Returns¶ ULong val usize_unsafe¶ [Source] fun box usize_unsafe() : USize val Returns¶ USize val f32_unsafe¶ [Source] fun box f32_unsafe() : F32 val Returns¶ F32 val f64_unsafe¶ [Source] fun box f64_unsafe() : F64 val Returns¶ F64 val compare¶ [Source] fun box compare( that: ISize val) : (Less val \| Equal val \| Greater val) Parameters¶ that: ISize val Returns¶ (Less val \| Equal val \| Greater val)	pony	337960	https://nn.wikipedia.org/wiki/SSC-7%20ISKANDER-K	SSC-7 ISKANDER-K	SSC-7 ISKANDER-K er eit russisk kryssarmissil som òg er kalla R-500 eller 9K728 for sjølve missilet. Det er ein versjon av 9K720 Iskander. NATO-kallenamn er ikkje kjend enno i 2017. Nokre bakke-til-bakke-missilbrigader i Russland som har Iskander-M som hovudvåpen, er òg tildelte SSC-7 ISKANDER-K som alternativt våpen. SSC-7 ISKANDER-K skal ha ei rekkevidde på 500 km, noko som er maksimal rekkevidde for eit våpen kalla eit kortdistansevåpen. Missilet kan fly i ei høgd på 6 km. Det navigerer sjølv med tråleiknavigasjon, GPS, GLONASS og TERCOM. Kjelder «Iskander can not fail». Red Star, 10/04/2015. Kryssarmissil Russisk militærutstyr	norwegian_nynorsk	1.125073
Pony/builtin-InputStream-.txt	InputStream¶ [Source] Asynchronous access to some input stream. interface tag InputStream Public Behaviours¶ apply¶ [Source] Set the notifier. Optionally, also sets the chunk size, dictating the maximum number of bytes of each chunk that will be passed to the notifier. be apply( notify: (InputNotify iso \| None val), chunk_size: USize val = 32) Parameters¶ notify: (InputNotify iso \| None val) chunk_size: USize val = 32 dispose¶ [Source] Clear the notifier in order to shut down input. be dispose()	pony	29749	https://no.wikipedia.org/wiki/MySQL	MySQL	MySQL (uttalt ) er et databaseadministrasjonssystem som er lisensiert som åpen kildekode (GPL-lisens) og som kjører på de fleste vanlige operativsystem. MySQL brukes et stort antall IT-system for å lagre, hente, sortere og filtrere data. Denne databasetjeneren er veldig mye brukt, og er en vesentlig del av LAMP-systemer, hvor M-en står for nettopp MySQL. Mange webpubliseringssystem som WordPress, Drupal, Joomla, phpBB, og MediaWiki lagrer innhold i MySQL-databaser. Nettsteder som blant annet Facebook, Flickr, MediaWiki, Twitter, og YouTube bruker MySQL for å lagre brukerkontoer. Selskapet som utviklet MySQL ble i 2008 kjøpt opp av Sun Microsystems, som igjen ble kjøpt opp av Oracle i 2010. MySQL vedlikeholdes i dag av Oracle og utvikles av ca 150 personer verden over hvor 35 sitter i Trondheim . Ved overdragelsen til Oracle ble kodegrunnlaget til MySQL tatt med videre til MariaDB fordi det ble stilt spørsmål om lisensiering av programvaren. Plattformer MySQL kjører på mange operativsystemer – inkludert AIX, BSDi, FreeBSD, HP-UX, Linux, Mac OS X, NetBSD, Netware, OpenBSD, OS/2 Warp, QNX, SGI IRIX, Solaris, SunOS, SCO OpenServer, SCO UnixWare, Tru64 og mange versjoner av Windows. Grensesnitt De fleste programmeringsspråk kan koble til MySQL-databaser, bl.a. C, C++, Eiffel, Smalltalk, Java, Lisp, Perl, PHP, Python, Ruby, og Tcl; hver av dem bruker et spesifikt API. Et ODBC-grensesnitt (MyODBC) gjør det mulig for alle programmeringsspråk som støtter ODBC-grensesnittet å kommunisere med en MySQL-database. MySQL bruker ANSI C som sitt hovedspråk. Man kan også kommunisere med en MySQL base via kommandolinje, eller MySQL Workbench som er en GUI applikasjon. Det fins også andre grafiske grensesnitt som LibreOffice / OpenOffice, eller phpMyAdmin som tilbyr administrasjon av databasen uten å måtte kunne programmere. Bruksområder MySQL er populært for webapplikasjoner som Wikipedia, PHP-Nuke, Wordpress m.fl. Populariteten skyldes først og fremst at MySQL er lett å bruke, gratis, og holder en høy ytelse i forhold til både pris og krav til maskinvare. Kritikk av MySQL Tidlige versjoner av MySQL manglet viktige funksjoner som de aller fleste RDBMS-systemene har hatt lenge, og selv den nyeste versjonen mangler fremdeles en del av disse. Dette har fått noen kjente databaseeksperter, som Chris Date og Fabian Pascal til å kritisere MySQL for å ikke være noen RDBMS. Tidligere fikk også MySQL masse kritikk for mangel på transaksjoner og ACID-kompatibilitet, som er viktig for å sikre integriteten til dataene. I samme kategori får MySQL masse kritikk for hvordan den behandler NULL-verdier, standardverdier og verdier som ikke passer med kolonnetypen den settes inn i. Eksempel Lage tabell: CREATE TABLE tabel navn ( Navn på kolone data_type, Navn på kolone2 data_type, Navn på kolone3 data_type, .... ); Legge til Infomasjon: INSERT INTO tabel_navn (kolone1, kolone2, kolone3,...) VALUES (info1, info2, info3,...) Hente infomasjon: SELECT * FROM tabel_navn (WHERE kolone1(ORDER BY kolone2 DESC(LIMIT 0, 10))) Oppdatere infomasjon: UPDATE tabel_navn SET kolone1=info, kolone2=info2,... WHERE en_kolone=en_info Slette kolone: DELETE FROM table_navn WHERE en_kolone = en_info Utfylling: Lage tabel: CREATE TABLE brukere ( id int(9) NOT NULL AUTO_INCREMENT, brukernavn varchar(255) NOT NULL, passord varchar(255) NOT NULL, .... ); Legge til Infomasjon: INSERT INTO brukere (brukernavn, passord, email,...) VALUES (Testern, ********, [email protected],...) Hente infomasjon: SELECT FROM brukere (WHERE id(ORDER BY id DESC(LIMIT 0, 10))) Oppdatere infomasjon: UPDATE brukere SET brukernavn=Tewstern, passord=*****,... WHERE id=2 Slette kolone: DELETE FROM brukere WHERE id = 2 (Resultatet vil bli at bruker id 2 vil bli slettet) Der det står Hente infomasjon og i koden stod det ...e (WHERE id(ORDER BY id DESC(LIMIT 0, 10))). Dette betyr at det som står inne parentes kan brukes. Lisensiering Både MySQL-serverprogramvare og klientbibliotek er distribuert under en dobbellisens. Brukere kan velge mellom GNU General Public License og en kommersiell lisens. Andre SQL-baserte databasetjenere Apache Derby Firebird IBM DB2 Oracle PostgreSQL SQLite Referanser Eksterne lenker MySQL Gotchas—Beskrivelse av mange egenskaper som kan fungere på uventede måter PHP MySQL Tutorial En innføring om MySQL mot PHP. Eksempler på gjestebøker, kontaktskjema, filopplasting til database, osv. Databasehåndteringssystem Fri programvare Linux-programmer	norwegian_bokmål	1.026613
Pony/files-CreateFile-.txt	CreateFile¶ [Source] Open a File for read/write, creating if it doesn't exist, preserving the contents if it does exist. primitive val CreateFile Constructors¶ create¶ [Source] new val create() : CreateFile val^ Returns¶ CreateFile val^ Public Functions¶ apply¶ [Source] fun box apply( from: FilePath val) : (File ref \| FileOK val \| FileError val \| FileEOF val \| FileBadFileNumber val \| FileExists val \| FilePermissionDenied val) Parameters¶ from: FilePath val Returns¶ (File ref \| FileOK val \| FileError val \| FileEOF val \| FileBadFileNumber val \| FileExists val \| FilePermissionDenied val) eq¶ [Source] fun box eq( that: CreateFile val) : Bool val Parameters¶ that: CreateFile val Returns¶ Bool val ne¶ [Source] fun box ne( that: CreateFile val) : Bool val Parameters¶ that: CreateFile val Returns¶ Bool val	pony	4007073	https://sv.wikipedia.org/wiki/Foeniculum%20subinodorum	Foeniculum subinodorum	Foeniculum subinodorum är en flockblommig växtart som beskrevs av Maire Weiller och Ernst Wilczek. Foeniculum subinodorum ingår i släktet fänkålsläktet, och familjen flockblommiga växter. Inga underarter finns listade i Catalogue of Life. Källor Fänkålsläktet subinodorum	swedish	1.218423
Pony/0_what-you-need.txt	# What You Need To get started, you'll need a text editor and the [ponyc](https://github.com/ponylang/ponyc) compiler. Or if you are on a not supported platform or don't want to install the compiler you can use the [Pony's Playground](https://playground.ponylang.io/). ## The Pony compiler Before you get started, please check out the [installation instructions](https://github.com/ponylang/ponyc/blob/main/INSTALL.md) for the Pony compiler. ## A text editor While you can write code using any editor, it's nice to use one with some support for the language. We maintain a list of [editors supporting Pony](https://github.com/ponylang/ponyc/blob/main/EDITORS.md). ## The compiler Pony is a _compiled_ language, rather than an _interpreted_ one. In fact, it goes even further: Pony is an _ahead-of-time_ (AOT) compiled language, rather than a _just-in-time_ (JIT) compiled language. What this means is that once you build your program, you can run it over and over again without needing a compiler or a virtual machine or anything else. It's a complete program, all on its own. But it also means you need to build your program before you can run it. In an interpreted language or a JIT compiled language, you tend to do things like this to run your program: ```bash python helloworld.py ``` Or maybe you put a __shebang__ in your program (like `#!/usr/bin/env python`), then `chmod` to set the executable bit, and then do: ```bash ./helloworld.py ``` When you use Pony, you don't do any of that! ## Compiling your program If you are in the same directory as your program, you can just do: ```bash ponyc ``` That tells the Pony compiler that your current working directory contains your source code, and to please compile it. If your source code is in some other directory, you can tell ponyc where it is: ```bash ponyc path/to/my/code ``` There are other options as well, but we'll cover those later.	pony	3774713	https://sv.wikipedia.org/wiki/Compsibidion%20psydrum	Compsibidion psydrum	Compsibidion psydrum är en skalbaggsart som beskrevs av Martins 1969. Compsibidion psydrum ingår i släktet Compsibidion och familjen långhorningar. Inga underarter finns listade i Catalogue of Life. Källor Långhorningar psydrum	swedish	1.568537
Pony/net-OSSockOpt-.txt	OSSockOpt¶ [Source] Convenience functions to fetch the option level and option name constants (arguments #2 and #3) for the getsockopt(2) and setsockopt(2) operating system calls. The values of the option level and option name constants are typically C preprocessor macros, e.g., #define SOMETHING 42. These macro names are upper case and may contain multiple consecutive underscore characters (though this is rare, for example, IP_NAT__XXX). The function names in this primitive are derived by the C macro name and then: converted to lower case any double underscore (__) is converted to a single underscore (_). These constants are not stable between Pony releases. Values returned by this function may be held by long-lived variables by the calling process: values cannot change while the process runs. Programmers must not cache any of these values for purposes of sharing them for use by any other Pony program (for example, sharing via serialization & deserialization or via direct shared memory). Many functions may return -1, which means that the constant's value could not be determined at the Pony runtime library compile time. One cause may be that the option truly isn't available, for example, the option level constant IPPROTO_3PC is available on MacOS 10.x but not on Linux 4.4. Another cause may be the Pony runtime library's compilation did not include the correct header file(s) for the target OS platform. A third cause of error is due to the regular expression-based approach used to harvest desirable constants. It is not fool-proof. The regexp used is too broad and finds some macros that are not supposed to be used with getsockopt(2) and setsockopt(2). Please consult your platform's documentation to verify the names of the option level and option name macros. The following code fragments are equivalent: set the socket receive buffer size for the file descriptor fd to 4455. /* In C / int option_value = 4455; setsockopt(fd, SOL_SOCKET, SO_RCVBUF, &option_value, 4); / In Pony */ var option: I32 = 4455; @setsockopt[I32](fd, OSSockOpt.sol_socket(), OSSockOpt.so_rcvbuf(), addressof option, I32(4)) primitive val OSSockOpt Constructors¶ create¶ [Source] new val create() : OSSockOpt val^ Returns¶ OSSockOpt val^ Public Functions¶ ipproto_3pc¶ [Source] fun box ipproto_3pc() : I32 val Returns¶ I32 val ipproto_adfs¶ [Source] fun box ipproto_adfs() : I32 val Returns¶ I32 val ipproto_ah¶ [Source] fun box ipproto_ah() : I32 val Returns¶ I32 val ipproto_ahip¶ [Source] fun box ipproto_ahip() : I32 val Returns¶ I32 val ipproto_apes¶ [Source] fun box ipproto_apes() : I32 val Returns¶ I32 val ipproto_argus¶ [Source] fun box ipproto_argus() : I32 val Returns¶ I32 val ipproto_ax25¶ [Source] fun box ipproto_ax25() : I32 val Returns¶ I32 val ipproto_beetph¶ [Source] fun box ipproto_beetph() : I32 val Returns¶ I32 val ipproto_bha¶ [Source] fun box ipproto_bha() : I32 val Returns¶ I32 val ipproto_blt¶ [Source] fun box ipproto_blt() : I32 val Returns¶ I32 val ipproto_brsatmon¶ [Source] fun box ipproto_brsatmon() : I32 val Returns¶ I32 val ipproto_carp¶ [Source] fun box ipproto_carp() : I32 val Returns¶ I32 val ipproto_cftp¶ [Source] fun box ipproto_cftp() : I32 val Returns¶ I32 val ipproto_chaos¶ [Source] fun box ipproto_chaos() : I32 val Returns¶ I32 val ipproto_cmtp¶ [Source] fun box ipproto_cmtp() : I32 val Returns¶ I32 val ipproto_comp¶ [Source] fun box ipproto_comp() : I32 val Returns¶ I32 val ipproto_cphb¶ [Source] fun box ipproto_cphb() : I32 val Returns¶ I32 val ipproto_cpnx¶ [Source] fun box ipproto_cpnx() : I32 val Returns¶ I32 val ipproto_dccp¶ [Source] fun box ipproto_dccp() : I32 val Returns¶ I32 val ipproto_ddp¶ [Source] fun box ipproto_ddp() : I32 val Returns¶ I32 val ipproto_dgp¶ [Source] fun box ipproto_dgp() : I32 val Returns¶ I32 val ipproto_divert¶ [Source] fun box ipproto_divert() : I32 val Returns¶ I32 val ipproto_done¶ [Source] fun box ipproto_done() : I32 val Returns¶ I32 val ipproto_dstopts¶ [Source] fun box ipproto_dstopts() : I32 val Returns¶ I32 val ipproto_egp¶ [Source] fun box ipproto_egp() : I32 val Returns¶ I32 val ipproto_emcon¶ [Source] fun box ipproto_emcon() : I32 val Returns¶ I32 val ipproto_encap¶ [Source] fun box ipproto_encap() : I32 val Returns¶ I32 val ipproto_eon¶ [Source] fun box ipproto_eon() : I32 val Returns¶ I32 val ipproto_esp¶ [Source] fun box ipproto_esp() : I32 val Returns¶ I32 val ipproto_etherip¶ [Source] fun box ipproto_etherip() : I32 val Returns¶ I32 val ipproto_fragment¶ [Source] fun box ipproto_fragment() : I32 val Returns¶ I32 val ipproto_ggp¶ [Source] fun box ipproto_ggp() : I32 val Returns¶ I32 val ipproto_gmtp¶ [Source] fun box ipproto_gmtp() : I32 val Returns¶ I32 val ipproto_gre¶ [Source] fun box ipproto_gre() : I32 val Returns¶ I32 val ipproto_hello¶ [Source] fun box ipproto_hello() : I32 val Returns¶ I32 val ipproto_hip¶ [Source] fun box ipproto_hip() : I32 val Returns¶ I32 val ipproto_hmp¶ [Source] fun box ipproto_hmp() : I32 val Returns¶ I32 val ipproto_hopopts¶ [Source] fun box ipproto_hopopts() : I32 val Returns¶ I32 val ipproto_icmp¶ [Source] fun box ipproto_icmp() : I32 val Returns¶ I32 val ipproto_icmpv6¶ [Source] fun box ipproto_icmpv6() : I32 val Returns¶ I32 val ipproto_idp¶ [Source] fun box ipproto_idp() : I32 val Returns¶ I32 val ipproto_idpr¶ [Source] fun box ipproto_idpr() : I32 val Returns¶ I32 val ipproto_idrp¶ [Source] fun box ipproto_idrp() : I32 val Returns¶ I32 val ipproto_igmp¶ [Source] fun box ipproto_igmp() : I32 val Returns¶ I32 val ipproto_igp¶ [Source] fun box ipproto_igp() : I32 val Returns¶ I32 val ipproto_igrp¶ [Source] fun box ipproto_igrp() : I32 val Returns¶ I32 val ipproto_il¶ [Source] fun box ipproto_il() : I32 val Returns¶ I32 val ipproto_inlsp¶ [Source] fun box ipproto_inlsp() : I32 val Returns¶ I32 val ipproto_inp¶ [Source] fun box ipproto_inp() : I32 val Returns¶ I32 val ipproto_ip¶ [Source] fun box ipproto_ip() : I32 val Returns¶ I32 val ipproto_ipcomp¶ [Source] fun box ipproto_ipcomp() : I32 val Returns¶ I32 val ipproto_ipcv¶ [Source] fun box ipproto_ipcv() : I32 val Returns¶ I32 val ipproto_ipeip¶ [Source] fun box ipproto_ipeip() : I32 val Returns¶ I32 val ipproto_ipip¶ [Source] fun box ipproto_ipip() : I32 val Returns¶ I32 val ipproto_ippc¶ [Source] fun box ipproto_ippc() : I32 val Returns¶ I32 val ipproto_ipv4¶ [Source] fun box ipproto_ipv4() : I32 val Returns¶ I32 val ipproto_ipv6¶ [Source] fun box ipproto_ipv6() : I32 val Returns¶ I32 val ipproto_irtp¶ [Source] fun box ipproto_irtp() : I32 val Returns¶ I32 val ipproto_kryptolan¶ [Source] fun box ipproto_kryptolan() : I32 val Returns¶ I32 val ipproto_larp¶ [Source] fun box ipproto_larp() : I32 val Returns¶ I32 val ipproto_leaf1¶ [Source] fun box ipproto_leaf1() : I32 val Returns¶ I32 val ipproto_leaf2¶ [Source] fun box ipproto_leaf2() : I32 val Returns¶ I32 val ipproto_max¶ [Source] fun box ipproto_max() : I32 val Returns¶ I32 val ipproto_maxid¶ [Source] fun box ipproto_maxid() : I32 val Returns¶ I32 val ipproto_meas¶ [Source] fun box ipproto_meas() : I32 val Returns¶ I32 val ipproto_mh¶ [Source] fun box ipproto_mh() : I32 val Returns¶ I32 val ipproto_mhrp¶ [Source] fun box ipproto_mhrp() : I32 val Returns¶ I32 val ipproto_micp¶ [Source] fun box ipproto_micp() : I32 val Returns¶ I32 val ipproto_mobile¶ [Source] fun box ipproto_mobile() : I32 val Returns¶ I32 val ipproto_mpls¶ [Source] fun box ipproto_mpls() : I32 val Returns¶ I32 val ipproto_mtp¶ [Source] fun box ipproto_mtp() : I32 val Returns¶ I32 val ipproto_mux¶ [Source] fun box ipproto_mux() : I32 val Returns¶ I32 val ipproto_nd¶ [Source] fun box ipproto_nd() : I32 val Returns¶ I32 val ipproto_nhrp¶ [Source] fun box ipproto_nhrp() : I32 val Returns¶ I32 val ipproto_none¶ [Source] fun box ipproto_none() : I32 val Returns¶ I32 val ipproto_nsp¶ [Source] fun box ipproto_nsp() : I32 val Returns¶ I32 val ipproto_nvpii¶ [Source] fun box ipproto_nvpii() : I32 val Returns¶ I32 val ipproto_old_divert¶ [Source] fun box ipproto_old_divert() : I32 val Returns¶ I32 val ipproto_ospfigp¶ [Source] fun box ipproto_ospfigp() : I32 val Returns¶ I32 val ipproto_pfsync¶ [Source] fun box ipproto_pfsync() : I32 val Returns¶ I32 val ipproto_pgm¶ [Source] fun box ipproto_pgm() : I32 val Returns¶ I32 val ipproto_pigp¶ [Source] fun box ipproto_pigp() : I32 val Returns¶ I32 val ipproto_pim¶ [Source] fun box ipproto_pim() : I32 val Returns¶ I32 val ipproto_prm¶ [Source] fun box ipproto_prm() : I32 val Returns¶ I32 val ipproto_pup¶ [Source] fun box ipproto_pup() : I32 val Returns¶ I32 val ipproto_pvp¶ [Source] fun box ipproto_pvp() : I32 val Returns¶ I32 val ipproto_raw¶ [Source] fun box ipproto_raw() : I32 val Returns¶ I32 val ipproto_rccmon¶ [Source] fun box ipproto_rccmon() : I32 val Returns¶ I32 val ipproto_rdp¶ [Source] fun box ipproto_rdp() : I32 val Returns¶ I32 val ipproto_reserved_253¶ [Source] fun box ipproto_reserved_253() : I32 val Returns¶ I32 val ipproto_reserved_254¶ [Source] fun box ipproto_reserved_254() : I32 val Returns¶ I32 val ipproto_routing¶ [Source] fun box ipproto_routing() : I32 val Returns¶ I32 val ipproto_rsvp¶ [Source] fun box ipproto_rsvp() : I32 val Returns¶ I32 val ipproto_rvd¶ [Source] fun box ipproto_rvd() : I32 val Returns¶ I32 val ipproto_satexpak¶ [Source] fun box ipproto_satexpak() : I32 val Returns¶ I32 val ipproto_satmon¶ [Source] fun box ipproto_satmon() : I32 val Returns¶ I32 val ipproto_sccsp¶ [Source] fun box ipproto_sccsp() : I32 val Returns¶ I32 val ipproto_sctp¶ [Source] fun box ipproto_sctp() : I32 val Returns¶ I32 val ipproto_sdrp¶ [Source] fun box ipproto_sdrp() : I32 val Returns¶ I32 val ipproto_send¶ [Source] fun box ipproto_send() : I32 val Returns¶ I32 val ipproto_sep¶ [Source] fun box ipproto_sep() : I32 val Returns¶ I32 val ipproto_shim6¶ [Source] fun box ipproto_shim6() : I32 val Returns¶ I32 val ipproto_skip¶ [Source] fun box ipproto_skip() : I32 val Returns¶ I32 val ipproto_spacer¶ [Source] fun box ipproto_spacer() : I32 val Returns¶ I32 val ipproto_srpc¶ [Source] fun box ipproto_srpc() : I32 val Returns¶ I32 val ipproto_st¶ [Source] fun box ipproto_st() : I32 val Returns¶ I32 val ipproto_svmtp¶ [Source] fun box ipproto_svmtp() : I32 val Returns¶ I32 val ipproto_swipe¶ [Source] fun box ipproto_swipe() : I32 val Returns¶ I32 val ipproto_tcf¶ [Source] fun box ipproto_tcf() : I32 val Returns¶ I32 val ipproto_tcp¶ [Source] fun box ipproto_tcp() : I32 val Returns¶ I32 val ipproto_tlsp¶ [Source] fun box ipproto_tlsp() : I32 val Returns¶ I32 val ipproto_tp¶ [Source] fun box ipproto_tp() : I32 val Returns¶ I32 val ipproto_tpxx¶ [Source] fun box ipproto_tpxx() : I32 val Returns¶ I32 val ipproto_trunk1¶ [Source] fun box ipproto_trunk1() : I32 val Returns¶ I32 val ipproto_trunk2¶ [Source] fun box ipproto_trunk2() : I32 val Returns¶ I32 val ipproto_ttp¶ [Source] fun box ipproto_ttp() : I32 val Returns¶ I32 val ipproto_udp¶ [Source] fun box ipproto_udp() : I32 val Returns¶ I32 val ipproto_udplite¶ [Source] fun box ipproto_udplite() : I32 val Returns¶ I32 val ipproto_vines¶ [Source] fun box ipproto_vines() : I32 val Returns¶ I32 val ipproto_visa¶ [Source] fun box ipproto_visa() : I32 val Returns¶ I32 val ipproto_vmtp¶ [Source] fun box ipproto_vmtp() : I32 val Returns¶ I32 val ipproto_wbexpak¶ [Source] fun box ipproto_wbexpak() : I32 val Returns¶ I32 val ipproto_wbmon¶ [Source] fun box ipproto_wbmon() : I32 val Returns¶ I32 val ipproto_wsn¶ [Source] fun box ipproto_wsn() : I32 val Returns¶ I32 val ipproto_xnet¶ [Source] fun box ipproto_xnet() : I32 val Returns¶ I32 val ipproto_xtp¶ [Source] fun box ipproto_xtp() : I32 val Returns¶ I32 val sol_atalk¶ [Source] fun box sol_atalk() : I32 val Returns¶ I32 val sol_ax25¶ [Source] fun box sol_ax25() : I32 val Returns¶ I32 val sol_hci_raw¶ [Source] fun box sol_hci_raw() : I32 val Returns¶ I32 val sol_ipx¶ [Source] fun box sol_ipx() : I32 val Returns¶ I32 val sol_l2cap¶ [Source] fun box sol_l2cap() : I32 val Returns¶ I32 val sol_local¶ [Source] fun box sol_local() : I32 val Returns¶ I32 val sol_ndrvproto¶ [Source] fun box sol_ndrvproto() : I32 val Returns¶ I32 val sol_netrom¶ [Source] fun box sol_netrom() : I32 val Returns¶ I32 val sol_rds¶ [Source] fun box sol_rds() : I32 val Returns¶ I32 val sol_rfcomm¶ [Source] fun box sol_rfcomm() : I32 val Returns¶ I32 val sol_rose¶ [Source] fun box sol_rose() : I32 val Returns¶ I32 val sol_sco¶ [Source] fun box sol_sco() : I32 val Returns¶ I32 val sol_socket¶ [Source] fun box sol_socket() : I32 val Returns¶ I32 val sol_tipc¶ [Source] fun box sol_tipc() : I32 val Returns¶ I32 val sol_udp¶ [Source] fun box sol_udp() : I32 val Returns¶ I32 val af_coip¶ [Source] fun box af_coip() : I32 val Returns¶ I32 val af_inet¶ [Source] fun box af_inet() : I32 val Returns¶ I32 val af_inet6¶ [Source] fun box af_inet6() : I32 val Returns¶ I32 val bluetooth_proto_sco¶ [Source] fun box bluetooth_proto_sco() : I32 val Returns¶ I32 val dccp_nr_pkt_types¶ [Source] fun box dccp_nr_pkt_types() : I32 val Returns¶ I32 val dccp_service_list_max_len¶ [Source] fun box dccp_service_list_max_len() : I32 val Returns¶ I32 val dccp_single_opt_maxlen¶ [Source] fun box dccp_single_opt_maxlen() : I32 val Returns¶ I32 val dccp_sockopt_available_ccids¶ [Source] fun box dccp_sockopt_available_ccids() : I32 val Returns¶ I32 val dccp_sockopt_ccid¶ [Source] fun box dccp_sockopt_ccid() : I32 val Returns¶ I32 val dccp_sockopt_ccid_rx_info¶ [Source] fun box dccp_sockopt_ccid_rx_info() : I32 val Returns¶ I32 val dccp_sockopt_ccid_tx_info¶ [Source] fun box dccp_sockopt_ccid_tx_info() : I32 val Returns¶ I32 val dccp_sockopt_change_l¶ [Source] fun box dccp_sockopt_change_l() : I32 val Returns¶ I32 val dccp_sockopt_change_r¶ [Source] fun box dccp_sockopt_change_r() : I32 val Returns¶ I32 val dccp_sockopt_get_cur_mps¶ [Source] fun box dccp_sockopt_get_cur_mps() : I32 val Returns¶ I32 val dccp_sockopt_packet_size¶ [Source] fun box dccp_sockopt_packet_size() : I32 val Returns¶ I32 val dccp_sockopt_qpolicy_id¶ [Source] fun box dccp_sockopt_qpolicy_id() : I32 val Returns¶ I32 val dccp_sockopt_qpolicy_txqlen¶ [Source] fun box dccp_sockopt_qpolicy_txqlen() : I32 val Returns¶ I32 val dccp_sockopt_recv_cscov¶ [Source] fun box dccp_sockopt_recv_cscov() : I32 val Returns¶ I32 val dccp_sockopt_rx_ccid¶ [Source] fun box dccp_sockopt_rx_ccid() : I32 val Returns¶ I32 val dccp_sockopt_send_cscov¶ [Source] fun box dccp_sockopt_send_cscov() : I32 val Returns¶ I32 val dccp_sockopt_server_timewait¶ [Source] fun box dccp_sockopt_server_timewait() : I32 val Returns¶ I32 val dccp_sockopt_service¶ [Source] fun box dccp_sockopt_service() : I32 val Returns¶ I32 val dccp_sockopt_tx_ccid¶ [Source] fun box dccp_sockopt_tx_ccid() : I32 val Returns¶ I32 val dso_acceptmode¶ [Source] fun box dso_acceptmode() : I32 val Returns¶ I32 val dso_conaccept¶ [Source] fun box dso_conaccept() : I32 val Returns¶ I32 val dso_conaccess¶ [Source] fun box dso_conaccess() : I32 val Returns¶ I32 val dso_condata¶ [Source] fun box dso_condata() : I32 val Returns¶ I32 val dso_conreject¶ [Source] fun box dso_conreject() : I32 val Returns¶ I32 val dso_cork¶ [Source] fun box dso_cork() : I32 val Returns¶ I32 val dso_disdata¶ [Source] fun box dso_disdata() : I32 val Returns¶ I32 val dso_info¶ [Source] fun box dso_info() : I32 val Returns¶ I32 val dso_linkinfo¶ [Source] fun box dso_linkinfo() : I32 val Returns¶ I32 val dso_max¶ [Source] fun box dso_max() : I32 val Returns¶ I32 val dso_maxwindow¶ [Source] fun box dso_maxwindow() : I32 val Returns¶ I32 val dso_nodelay¶ [Source] fun box dso_nodelay() : I32 val Returns¶ I32 val dso_seqpacket¶ [Source] fun box dso_seqpacket() : I32 val Returns¶ I32 val dso_services¶ [Source] fun box dso_services() : I32 val Returns¶ I32 val dso_stream¶ [Source] fun box dso_stream() : I32 val Returns¶ I32 val icmp_address¶ [Source] fun box icmp_address() : I32 val Returns¶ I32 val icmp_addressreply¶ [Source] fun box icmp_addressreply() : I32 val Returns¶ I32 val icmp_dest_unreach¶ [Source] fun box icmp_dest_unreach() : I32 val Returns¶ I32 val icmp_echo¶ [Source] fun box icmp_echo() : I32 val Returns¶ I32 val icmp_echoreply¶ [Source] fun box icmp_echoreply() : I32 val Returns¶ I32 val icmp_exc_fragtime¶ [Source] fun box icmp_exc_fragtime() : I32 val Returns¶ I32 val icmp_exc_ttl¶ [Source] fun box icmp_exc_ttl() : I32 val Returns¶ I32 val icmp_filter¶ [Source] fun box icmp_filter() : I32 val Returns¶ I32 val icmp_frag_needed¶ [Source] fun box icmp_frag_needed() : I32 val Returns¶ I32 val icmp_host_ano¶ [Source] fun box icmp_host_ano() : I32 val Returns¶ I32 val icmp_host_isolated¶ [Source] fun box icmp_host_isolated() : I32 val Returns¶ I32 val icmp_host_unknown¶ [Source] fun box icmp_host_unknown() : I32 val Returns¶ I32 val icmp_host_unreach¶ [Source] fun box icmp_host_unreach() : I32 val Returns¶ I32 val icmp_host_unr_tos¶ [Source] fun box icmp_host_unr_tos() : I32 val Returns¶ I32 val icmp_info_reply¶ [Source] fun box icmp_info_reply() : I32 val Returns¶ I32 val icmp_info_request¶ [Source] fun box icmp_info_request() : I32 val Returns¶ I32 val icmp_net_ano¶ [Source] fun box icmp_net_ano() : I32 val Returns¶ I32 val icmp_net_unknown¶ [Source] fun box icmp_net_unknown() : I32 val Returns¶ I32 val icmp_net_unreach¶ [Source] fun box icmp_net_unreach() : I32 val Returns¶ I32 val icmp_net_unr_tos¶ [Source] fun box icmp_net_unr_tos() : I32 val Returns¶ I32 val icmp_parameterprob¶ [Source] fun box icmp_parameterprob() : I32 val Returns¶ I32 val icmp_pkt_filtered¶ [Source] fun box icmp_pkt_filtered() : I32 val Returns¶ I32 val icmp_port_unreach¶ [Source] fun box icmp_port_unreach() : I32 val Returns¶ I32 val icmp_prec_cutoff¶ [Source] fun box icmp_prec_cutoff() : I32 val Returns¶ I32 val icmp_prec_violation¶ [Source] fun box icmp_prec_violation() : I32 val Returns¶ I32 val icmp_prot_unreach¶ [Source] fun box icmp_prot_unreach() : I32 val Returns¶ I32 val icmp_redirect¶ [Source] fun box icmp_redirect() : I32 val Returns¶ I32 val icmp_redir_host¶ [Source] fun box icmp_redir_host() : I32 val Returns¶ I32 val icmp_redir_hosttos¶ [Source] fun box icmp_redir_hosttos() : I32 val Returns¶ I32 val icmp_redir_net¶ [Source] fun box icmp_redir_net() : I32 val Returns¶ I32 val icmp_redir_nettos¶ [Source] fun box icmp_redir_nettos() : I32 val Returns¶ I32 val icmp_source_quench¶ [Source] fun box icmp_source_quench() : I32 val Returns¶ I32 val icmp_sr_failed¶ [Source] fun box icmp_sr_failed() : I32 val Returns¶ I32 val icmp_timestamp¶ [Source] fun box icmp_timestamp() : I32 val Returns¶ I32 val icmp_timestampreply¶ [Source] fun box icmp_timestampreply() : I32 val Returns¶ I32 val icmp_time_exceeded¶ [Source] fun box icmp_time_exceeded() : I32 val Returns¶ I32 val ipctl_acceptsourceroute¶ [Source] fun box ipctl_acceptsourceroute() : I32 val Returns¶ I32 val ipctl_defmtu¶ [Source] fun box ipctl_defmtu() : I32 val Returns¶ I32 val ipctl_defttl¶ [Source] fun box ipctl_defttl() : I32 val Returns¶ I32 val ipctl_directedbroadcast¶ [Source] fun box ipctl_directedbroadcast() : I32 val Returns¶ I32 val ipctl_fastforwarding¶ [Source] fun box ipctl_fastforwarding() : I32 val Returns¶ I32 val ipctl_forwarding¶ [Source] fun box ipctl_forwarding() : I32 val Returns¶ I32 val ipctl_gif_ttl¶ [Source] fun box ipctl_gif_ttl() : I32 val Returns¶ I32 val ipctl_intrdqdrops¶ [Source] fun box ipctl_intrdqdrops() : I32 val Returns¶ I32 val ipctl_intrdqmaxlen¶ [Source] fun box ipctl_intrdqmaxlen() : I32 val Returns¶ I32 val ipctl_intrqdrops¶ [Source] fun box ipctl_intrqdrops() : I32 val Returns¶ I32 val ipctl_intrqmaxlen¶ [Source] fun box ipctl_intrqmaxlen() : I32 val Returns¶ I32 val ipctl_keepfaith¶ [Source] fun box ipctl_keepfaith() : I32 val Returns¶ I32 val ipctl_maxid¶ [Source] fun box ipctl_maxid() : I32 val Returns¶ I32 val ipctl_rtexpire¶ [Source] fun box ipctl_rtexpire() : I32 val Returns¶ I32 val ipctl_rtmaxcache¶ [Source] fun box ipctl_rtmaxcache() : I32 val Returns¶ I32 val ipctl_rtminexpire¶ [Source] fun box ipctl_rtminexpire() : I32 val Returns¶ I32 val ipctl_sendredirects¶ [Source] fun box ipctl_sendredirects() : I32 val Returns¶ I32 val ipctl_sourceroute¶ [Source] fun box ipctl_sourceroute() : I32 val Returns¶ I32 val ipctl_stats¶ [Source] fun box ipctl_stats() : I32 val Returns¶ I32 val ipport_ephemeralfirst¶ [Source] fun box ipport_ephemeralfirst() : I32 val Returns¶ I32 val ipport_ephemerallast¶ [Source] fun box ipport_ephemerallast() : I32 val Returns¶ I32 val ipport_hifirstauto¶ [Source] fun box ipport_hifirstauto() : I32 val Returns¶ I32 val ipport_hilastauto¶ [Source] fun box ipport_hilastauto() : I32 val Returns¶ I32 val ipport_max¶ [Source] fun box ipport_max() : I32 val Returns¶ I32 val ipport_reserved¶ [Source] fun box ipport_reserved() : I32 val Returns¶ I32 val ipport_reservedstart¶ [Source] fun box ipport_reservedstart() : I32 val Returns¶ I32 val ipport_userreserved¶ [Source] fun box ipport_userreserved() : I32 val Returns¶ I32 val ipv6_2292dstopts¶ [Source] fun box ipv6_2292dstopts() : I32 val Returns¶ I32 val ipv6_2292hoplimit¶ [Source] fun box ipv6_2292hoplimit() : I32 val Returns¶ I32 val ipv6_2292hopopts¶ [Source] fun box ipv6_2292hopopts() : I32 val Returns¶ I32 val ipv6_2292pktinfo¶ [Source] fun box ipv6_2292pktinfo() : I32 val Returns¶ I32 val ipv6_2292pktoptions¶ [Source] fun box ipv6_2292pktoptions() : I32 val Returns¶ I32 val ipv6_2292rthdr¶ [Source] fun box ipv6_2292rthdr() : I32 val Returns¶ I32 val ipv6_addrform¶ [Source] fun box ipv6_addrform() : I32 val Returns¶ I32 val ipv6_addr_preferences¶ [Source] fun box ipv6_addr_preferences() : I32 val Returns¶ I32 val ipv6_add_membership¶ [Source] fun box ipv6_add_membership() : I32 val Returns¶ I32 val ipv6_authhdr¶ [Source] fun box ipv6_authhdr() : I32 val Returns¶ I32 val ipv6_autoflowlabel¶ [Source] fun box ipv6_autoflowlabel() : I32 val Returns¶ I32 val ipv6_checksum¶ [Source] fun box ipv6_checksum() : I32 val Returns¶ I32 val ipv6_dontfrag¶ [Source] fun box ipv6_dontfrag() : I32 val Returns¶ I32 val ipv6_drop_membership¶ [Source] fun box ipv6_drop_membership() : I32 val Returns¶ I32 val ipv6_dstopts¶ [Source] fun box ipv6_dstopts() : I32 val Returns¶ I32 val ipv6_flowinfo¶ [Source] fun box ipv6_flowinfo() : I32 val Returns¶ I32 val ipv6_flowinfo_flowlabel¶ [Source] fun box ipv6_flowinfo_flowlabel() : I32 val Returns¶ I32 val ipv6_flowinfo_priority¶ [Source] fun box ipv6_flowinfo_priority() : I32 val Returns¶ I32 val ipv6_flowinfo_send¶ [Source] fun box ipv6_flowinfo_send() : I32 val Returns¶ I32 val ipv6_flowlabel_mgr¶ [Source] fun box ipv6_flowlabel_mgr() : I32 val Returns¶ I32 val ipv6_fl_a_get¶ [Source] fun box ipv6_fl_a_get() : I32 val Returns¶ I32 val ipv6_fl_a_put¶ [Source] fun box ipv6_fl_a_put() : I32 val Returns¶ I32 val ipv6_fl_a_renew¶ [Source] fun box ipv6_fl_a_renew() : I32 val Returns¶ I32 val ipv6_fl_f_create¶ [Source] fun box ipv6_fl_f_create() : I32 val Returns¶ I32 val ipv6_fl_f_excl¶ [Source] fun box ipv6_fl_f_excl() : I32 val Returns¶ I32 val ipv6_fl_f_reflect¶ [Source] fun box ipv6_fl_f_reflect() : I32 val Returns¶ I32 val ipv6_fl_f_remote¶ [Source] fun box ipv6_fl_f_remote() : I32 val Returns¶ I32 val ipv6_fl_s_any¶ [Source] fun box ipv6_fl_s_any() : I32 val Returns¶ I32 val ipv6_fl_s_excl¶ [Source] fun box ipv6_fl_s_excl() : I32 val Returns¶ I32 val ipv6_fl_s_none¶ [Source] fun box ipv6_fl_s_none() : I32 val Returns¶ I32 val ipv6_fl_s_process¶ [Source] fun box ipv6_fl_s_process() : I32 val Returns¶ I32 val ipv6_fl_s_user¶ [Source] fun box ipv6_fl_s_user() : I32 val Returns¶ I32 val ipv6_hoplimit¶ [Source] fun box ipv6_hoplimit() : I32 val Returns¶ I32 val ipv6_hopopts¶ [Source] fun box ipv6_hopopts() : I32 val Returns¶ I32 val ipv6_ipsec_policy¶ [Source] fun box ipv6_ipsec_policy() : I32 val Returns¶ I32 val ipv6_join_anycast¶ [Source] fun box ipv6_join_anycast() : I32 val Returns¶ I32 val ipv6_leave_anycast¶ [Source] fun box ipv6_leave_anycast() : I32 val Returns¶ I32 val ipv6_minhopcount¶ [Source] fun box ipv6_minhopcount() : I32 val Returns¶ I32 val ipv6_mtu¶ [Source] fun box ipv6_mtu() : I32 val Returns¶ I32 val ipv6_mtu_discover¶ [Source] fun box ipv6_mtu_discover() : I32 val Returns¶ I32 val ipv6_multicast_hops¶ [Source] fun box ipv6_multicast_hops() : I32 val Returns¶ I32 val ipv6_multicast_if¶ [Source] fun box ipv6_multicast_if() : I32 val Returns¶ I32 val ipv6_multicast_loop¶ [Source] fun box ipv6_multicast_loop() : I32 val Returns¶ I32 val ipv6_nexthop¶ [Source] fun box ipv6_nexthop() : I32 val Returns¶ I32 val ipv6_origdstaddr¶ [Source] fun box ipv6_origdstaddr() : I32 val Returns¶ I32 val ipv6_pathmtu¶ [Source] fun box ipv6_pathmtu() : I32 val Returns¶ I32 val ipv6_pktinfo¶ [Source] fun box ipv6_pktinfo() : I32 val Returns¶ I32 val ipv6_pmtudisc_do¶ [Source] fun box ipv6_pmtudisc_do() : I32 val Returns¶ I32 val ipv6_pmtudisc_dont¶ [Source] fun box ipv6_pmtudisc_dont() : I32 val Returns¶ I32 val ipv6_pmtudisc_interface¶ [Source] fun box ipv6_pmtudisc_interface() : I32 val Returns¶ I32 val ipv6_pmtudisc_omit¶ [Source] fun box ipv6_pmtudisc_omit() : I32 val Returns¶ I32 val ipv6_pmtudisc_probe¶ [Source] fun box ipv6_pmtudisc_probe() : I32 val Returns¶ I32 val ipv6_pmtudisc_want¶ [Source] fun box ipv6_pmtudisc_want() : I32 val Returns¶ I32 val ipv6_prefer_src_cga¶ [Source] fun box ipv6_prefer_src_cga() : I32 val Returns¶ I32 val ipv6_prefer_src_coa¶ [Source] fun box ipv6_prefer_src_coa() : I32 val Returns¶ I32 val ipv6_prefer_src_home¶ [Source] fun box ipv6_prefer_src_home() : I32 val Returns¶ I32 val ipv6_prefer_src_noncga¶ [Source] fun box ipv6_prefer_src_noncga() : I32 val Returns¶ I32 val ipv6_prefer_src_public¶ [Source] fun box ipv6_prefer_src_public() : I32 val Returns¶ I32 val ipv6_prefer_src_pubtmp_default¶ [Source] fun box ipv6_prefer_src_pubtmp_default() : I32 val Returns¶ I32 val ipv6_prefer_src_tmp¶ [Source] fun box ipv6_prefer_src_tmp() : I32 val Returns¶ I32 val ipv6_priority_10¶ [Source] fun box ipv6_priority_10() : I32 val Returns¶ I32 val ipv6_priority_11¶ [Source] fun box ipv6_priority_11() : I32 val Returns¶ I32 val ipv6_priority_12¶ [Source] fun box ipv6_priority_12() : I32 val Returns¶ I32 val ipv6_priority_13¶ [Source] fun box ipv6_priority_13() : I32 val Returns¶ I32 val ipv6_priority_14¶ [Source] fun box ipv6_priority_14() : I32 val Returns¶ I32 val ipv6_priority_15¶ [Source] fun box ipv6_priority_15() : I32 val Returns¶ I32 val ipv6_priority_8¶ [Source] fun box ipv6_priority_8() : I32 val Returns¶ I32 val ipv6_priority_9¶ [Source] fun box ipv6_priority_9() : I32 val Returns¶ I32 val ipv6_priority_bulk¶ [Source] fun box ipv6_priority_bulk() : I32 val Returns¶ I32 val ipv6_priority_control¶ [Source] fun box ipv6_priority_control() : I32 val Returns¶ I32 val ipv6_priority_filler¶ [Source] fun box ipv6_priority_filler() : I32 val Returns¶ I32 val ipv6_priority_interactive¶ [Source] fun box ipv6_priority_interactive() : I32 val Returns¶ I32 val ipv6_priority_reserved1¶ [Source] fun box ipv6_priority_reserved1() : I32 val Returns¶ I32 val ipv6_priority_reserved2¶ [Source] fun box ipv6_priority_reserved2() : I32 val Returns¶ I32 val ipv6_priority_unattended¶ [Source] fun box ipv6_priority_unattended() : I32 val Returns¶ I32 val ipv6_priority_uncharacterized¶ [Source] fun box ipv6_priority_uncharacterized() : I32 val Returns¶ I32 val ipv6_recvdstopts¶ [Source] fun box ipv6_recvdstopts() : I32 val Returns¶ I32 val ipv6_recverr¶ [Source] fun box ipv6_recverr() : I32 val Returns¶ I32 val ipv6_recvhoplimit¶ [Source] fun box ipv6_recvhoplimit() : I32 val Returns¶ I32 val ipv6_recvhopopts¶ [Source] fun box ipv6_recvhopopts() : I32 val Returns¶ I32 val ipv6_recvorigdstaddr¶ [Source] fun box ipv6_recvorigdstaddr() : I32 val Returns¶ I32 val ipv6_recvpathmtu¶ [Source] fun box ipv6_recvpathmtu() : I32 val Returns¶ I32 val ipv6_recvpktinfo¶ [Source] fun box ipv6_recvpktinfo() : I32 val Returns¶ I32 val ipv6_recvrthdr¶ [Source] fun box ipv6_recvrthdr() : I32 val Returns¶ I32 val ipv6_recvtclass¶ [Source] fun box ipv6_recvtclass() : I32 val Returns¶ I32 val ipv6_router_alert¶ [Source] fun box ipv6_router_alert() : I32 val Returns¶ I32 val ipv6_rthdr¶ [Source] fun box ipv6_rthdr() : I32 val Returns¶ I32 val ipv6_rthdrdstopts¶ [Source] fun box ipv6_rthdrdstopts() : I32 val Returns¶ I32 val ipv6_tclass¶ [Source] fun box ipv6_tclass() : I32 val Returns¶ I32 val ipv6_tlv_hao¶ [Source] fun box ipv6_tlv_hao() : I32 val Returns¶ I32 val ipv6_tlv_jumbo¶ [Source] fun box ipv6_tlv_jumbo() : I32 val Returns¶ I32 val ipv6_tlv_pad1¶ [Source] fun box ipv6_tlv_pad1() : I32 val Returns¶ I32 val ipv6_tlv_padn¶ [Source] fun box ipv6_tlv_padn() : I32 val Returns¶ I32 val ipv6_tlv_routeralert¶ [Source] fun box ipv6_tlv_routeralert() : I32 val Returns¶ I32 val ipv6_transparent¶ [Source] fun box ipv6_transparent() : I32 val Returns¶ I32 val ipv6_unicast_hops¶ [Source] fun box ipv6_unicast_hops() : I32 val Returns¶ I32 val ipv6_unicast_if¶ [Source] fun box ipv6_unicast_if() : I32 val Returns¶ I32 val ipv6_use_min_mtu¶ [Source] fun box ipv6_use_min_mtu() : I32 val Returns¶ I32 val ipv6_v6only¶ [Source] fun box ipv6_v6only() : I32 val Returns¶ I32 val ipv6_xfrm_policy¶ [Source] fun box ipv6_xfrm_policy() : I32 val Returns¶ I32 val ipx_address¶ [Source] fun box ipx_address() : I32 val Returns¶ I32 val ipx_address_notify¶ [Source] fun box ipx_address_notify() : I32 val Returns¶ I32 val ipx_crtitf¶ [Source] fun box ipx_crtitf() : I32 val Returns¶ I32 val ipx_dltitf¶ [Source] fun box ipx_dltitf() : I32 val Returns¶ I32 val ipx_dstype¶ [Source] fun box ipx_dstype() : I32 val Returns¶ I32 val ipx_extended_address¶ [Source] fun box ipx_extended_address() : I32 val Returns¶ I32 val ipx_filterptype¶ [Source] fun box ipx_filterptype() : I32 val Returns¶ I32 val ipx_frame_8022¶ [Source] fun box ipx_frame_8022() : I32 val Returns¶ I32 val ipx_frame_8023¶ [Source] fun box ipx_frame_8023() : I32 val Returns¶ I32 val ipx_frame_etherii¶ [Source] fun box ipx_frame_etherii() : I32 val Returns¶ I32 val ipx_frame_none¶ [Source] fun box ipx_frame_none() : I32 val Returns¶ I32 val ipx_frame_snap¶ [Source] fun box ipx_frame_snap() : I32 val Returns¶ I32 val ipx_frame_tr_8022¶ [Source] fun box ipx_frame_tr_8022() : I32 val Returns¶ I32 val ipx_getnetinfo¶ [Source] fun box ipx_getnetinfo() : I32 val Returns¶ I32 val ipx_getnetinfo_norip¶ [Source] fun box ipx_getnetinfo_norip() : I32 val Returns¶ I32 val ipx_immediatespxack¶ [Source] fun box ipx_immediatespxack() : I32 val Returns¶ I32 val ipx_internal¶ [Source] fun box ipx_internal() : I32 val Returns¶ I32 val ipx_maxsize¶ [Source] fun box ipx_maxsize() : I32 val Returns¶ I32 val ipx_max_adapter_num¶ [Source] fun box ipx_max_adapter_num() : I32 val Returns¶ I32 val ipx_mtu¶ [Source] fun box ipx_mtu() : I32 val Returns¶ I32 val ipx_node_len¶ [Source] fun box ipx_node_len() : I32 val Returns¶ I32 val ipx_primary¶ [Source] fun box ipx_primary() : I32 val Returns¶ I32 val ipx_ptype¶ [Source] fun box ipx_ptype() : I32 val Returns¶ I32 val ipx_receive_broadcast¶ [Source] fun box ipx_receive_broadcast() : I32 val Returns¶ I32 val ipx_recvhdr¶ [Source] fun box ipx_recvhdr() : I32 val Returns¶ I32 val ipx_reripnetnumber¶ [Source] fun box ipx_reripnetnumber() : I32 val Returns¶ I32 val ipx_route_no_router¶ [Source] fun box ipx_route_no_router() : I32 val Returns¶ I32 val ipx_rt_8022¶ [Source] fun box ipx_rt_8022() : I32 val Returns¶ I32 val ipx_rt_bluebook¶ [Source] fun box ipx_rt_bluebook() : I32 val Returns¶ I32 val ipx_rt_routed¶ [Source] fun box ipx_rt_routed() : I32 val Returns¶ I32 val ipx_rt_snap¶ [Source] fun box ipx_rt_snap() : I32 val Returns¶ I32 val ipx_special_none¶ [Source] fun box ipx_special_none() : I32 val Returns¶ I32 val ipx_spxgetconnectionstatus¶ [Source] fun box ipx_spxgetconnectionstatus() : I32 val Returns¶ I32 val ipx_stopfilterptype¶ [Source] fun box ipx_stopfilterptype() : I32 val Returns¶ I32 val ipx_type¶ [Source] fun box ipx_type() : I32 val Returns¶ I32 val ip_add_membership¶ [Source] fun box ip_add_membership() : I32 val Returns¶ I32 val ip_add_source_membership¶ [Source] fun box ip_add_source_membership() : I32 val Returns¶ I32 val ip_bindany¶ [Source] fun box ip_bindany() : I32 val Returns¶ I32 val ip_bindmulti¶ [Source] fun box ip_bindmulti() : I32 val Returns¶ I32 val ip_bind_address_no_port¶ [Source] fun box ip_bind_address_no_port() : I32 val Returns¶ I32 val ip_block_source¶ [Source] fun box ip_block_source() : I32 val Returns¶ I32 val ip_bound_if¶ [Source] fun box ip_bound_if() : I32 val Returns¶ I32 val ip_checksum¶ [Source] fun box ip_checksum() : I32 val Returns¶ I32 val ip_default_multicast_loop¶ [Source] fun box ip_default_multicast_loop() : I32 val Returns¶ I32 val ip_default_multicast_ttl¶ [Source] fun box ip_default_multicast_ttl() : I32 val Returns¶ I32 val ip_dontfrag¶ [Source] fun box ip_dontfrag() : I32 val Returns¶ I32 val ip_drop_membership¶ [Source] fun box ip_drop_membership() : I32 val Returns¶ I32 val ip_drop_source_membership¶ [Source] fun box ip_drop_source_membership() : I32 val Returns¶ I32 val ip_dummynet3¶ [Source] fun box ip_dummynet3() : I32 val Returns¶ I32 val ip_dummynet_configure¶ [Source] fun box ip_dummynet_configure() : I32 val Returns¶ I32 val ip_dummynet_del¶ [Source] fun box ip_dummynet_del() : I32 val Returns¶ I32 val ip_dummynet_flush¶ [Source] fun box ip_dummynet_flush() : I32 val Returns¶ I32 val ip_dummynet_get¶ [Source] fun box ip_dummynet_get() : I32 val Returns¶ I32 val ip_faith¶ [Source] fun box ip_faith() : I32 val Returns¶ I32 val ip_flowid¶ [Source] fun box ip_flowid() : I32 val Returns¶ I32 val ip_flowtype¶ [Source] fun box ip_flowtype() : I32 val Returns¶ I32 val ip_freebind¶ [Source] fun box ip_freebind() : I32 val Returns¶ I32 val ip_fw3¶ [Source] fun box ip_fw3() : I32 val Returns¶ I32 val ip_fw_add¶ [Source] fun box ip_fw_add() : I32 val Returns¶ I32 val ip_fw_del¶ [Source] fun box ip_fw_del() : I32 val Returns¶ I32 val ip_fw_flush¶ [Source] fun box ip_fw_flush() : I32 val Returns¶ I32 val ip_fw_get¶ [Source] fun box ip_fw_get() : I32 val Returns¶ I32 val ip_fw_nat_cfg¶ [Source] fun box ip_fw_nat_cfg() : I32 val Returns¶ I32 val ip_fw_nat_del¶ [Source] fun box ip_fw_nat_del() : I32 val Returns¶ I32 val ip_fw_nat_get_config¶ [Source] fun box ip_fw_nat_get_config() : I32 val Returns¶ I32 val ip_fw_nat_get_log¶ [Source] fun box ip_fw_nat_get_log() : I32 val Returns¶ I32 val ip_fw_resetlog¶ [Source] fun box ip_fw_resetlog() : I32 val Returns¶ I32 val ip_fw_table_add¶ [Source] fun box ip_fw_table_add() : I32 val Returns¶ I32 val ip_fw_table_del¶ [Source] fun box ip_fw_table_del() : I32 val Returns¶ I32 val ip_fw_table_flush¶ [Source] fun box ip_fw_table_flush() : I32 val Returns¶ I32 val ip_fw_table_getsize¶ [Source] fun box ip_fw_table_getsize() : I32 val Returns¶ I32 val ip_fw_table_list¶ [Source] fun box ip_fw_table_list() : I32 val Returns¶ I32 val ip_fw_zero¶ [Source] fun box ip_fw_zero() : I32 val Returns¶ I32 val ip_hdrincl¶ [Source] fun box ip_hdrincl() : I32 val Returns¶ I32 val ip_ipsec_policy¶ [Source] fun box ip_ipsec_policy() : I32 val Returns¶ I32 val ip_max_group_src_filter¶ [Source] fun box ip_max_group_src_filter() : I32 val Returns¶ I32 val ip_max_memberships¶ [Source] fun box ip_max_memberships() : I32 val Returns¶ I32 val ip_max_sock_mute_filter¶ [Source] fun box ip_max_sock_mute_filter() : I32 val Returns¶ I32 val ip_max_sock_src_filter¶ [Source] fun box ip_max_sock_src_filter() : I32 val Returns¶ I32 val ip_max_source_filter¶ [Source] fun box ip_max_source_filter() : I32 val Returns¶ I32 val ip_minttl¶ [Source] fun box ip_minttl() : I32 val Returns¶ I32 val ip_min_memberships¶ [Source] fun box ip_min_memberships() : I32 val Returns¶ I32 val ip_msfilter¶ [Source] fun box ip_msfilter() : I32 val Returns¶ I32 val ip_mtu¶ [Source] fun box ip_mtu() : I32 val Returns¶ I32 val ip_mtu_discover¶ [Source] fun box ip_mtu_discover() : I32 val Returns¶ I32 val ip_multicast_all¶ [Source] fun box ip_multicast_all() : I32 val Returns¶ I32 val ip_multicast_if¶ [Source] fun box ip_multicast_if() : I32 val Returns¶ I32 val ip_multicast_ifindex¶ [Source] fun box ip_multicast_ifindex() : I32 val Returns¶ I32 val ip_multicast_loop¶ [Source] fun box ip_multicast_loop() : I32 val Returns¶ I32 val ip_multicast_ttl¶ [Source] fun box ip_multicast_ttl() : I32 val Returns¶ I32 val ip_multicast_vif¶ [Source] fun box ip_multicast_vif() : I32 val Returns¶ I32 val ip_nat_xxx¶ [Source] fun box ip_nat_xxx() : I32 val Returns¶ I32 val ip_nodefrag¶ [Source] fun box ip_nodefrag() : I32 val Returns¶ I32 val ip_old_fw_add¶ [Source] fun box ip_old_fw_add() : I32 val Returns¶ I32 val ip_old_fw_del¶ [Source] fun box ip_old_fw_del() : I32 val Returns¶ I32 val ip_old_fw_flush¶ [Source] fun box ip_old_fw_flush() : I32 val Returns¶ I32 val ip_old_fw_get¶ [Source] fun box ip_old_fw_get() : I32 val Returns¶ I32 val ip_old_fw_resetlog¶ [Source] fun box ip_old_fw_resetlog() : I32 val Returns¶ I32 val ip_old_fw_zero¶ [Source] fun box ip_old_fw_zero() : I32 val Returns¶ I32 val ip_onesbcast¶ [Source] fun box ip_onesbcast() : I32 val Returns¶ I32 val ip_options¶ [Source] fun box ip_options() : I32 val Returns¶ I32 val ip_origdstaddr¶ [Source] fun box ip_origdstaddr() : I32 val Returns¶ I32 val ip_passsec¶ [Source] fun box ip_passsec() : I32 val Returns¶ I32 val ip_pktinfo¶ [Source] fun box ip_pktinfo() : I32 val Returns¶ I32 val ip_pktoptions¶ [Source] fun box ip_pktoptions() : I32 val Returns¶ I32 val ip_pmtudisc_do¶ [Source] fun box ip_pmtudisc_do() : I32 val Returns¶ I32 val ip_pmtudisc_dont¶ [Source] fun box ip_pmtudisc_dont() : I32 val Returns¶ I32 val ip_pmtudisc_interface¶ [Source] fun box ip_pmtudisc_interface() : I32 val Returns¶ I32 val ip_pmtudisc_omit¶ [Source] fun box ip_pmtudisc_omit() : I32 val Returns¶ I32 val ip_pmtudisc_probe¶ [Source] fun box ip_pmtudisc_probe() : I32 val Returns¶ I32 val ip_pmtudisc_want¶ [Source] fun box ip_pmtudisc_want() : I32 val Returns¶ I32 val ip_portrange¶ [Source] fun box ip_portrange() : I32 val Returns¶ I32 val ip_portrange_default¶ [Source] fun box ip_portrange_default() : I32 val Returns¶ I32 val ip_portrange_high¶ [Source] fun box ip_portrange_high() : I32 val Returns¶ I32 val ip_portrange_low¶ [Source] fun box ip_portrange_low() : I32 val Returns¶ I32 val ip_recvdstaddr¶ [Source] fun box ip_recvdstaddr() : I32 val Returns¶ I32 val ip_recverr¶ [Source] fun box ip_recverr() : I32 val Returns¶ I32 val ip_recvflowid¶ [Source] fun box ip_recvflowid() : I32 val Returns¶ I32 val ip_recvif¶ [Source] fun box ip_recvif() : I32 val Returns¶ I32 val ip_recvopts¶ [Source] fun box ip_recvopts() : I32 val Returns¶ I32 val ip_recvorigdstaddr¶ [Source] fun box ip_recvorigdstaddr() : I32 val Returns¶ I32 val ip_recvpktinfo¶ [Source] fun box ip_recvpktinfo() : I32 val Returns¶ I32 val ip_recvretopts¶ [Source] fun box ip_recvretopts() : I32 val Returns¶ I32 val ip_recvrssbucketid¶ [Source] fun box ip_recvrssbucketid() : I32 val Returns¶ I32 val ip_recvtos¶ [Source] fun box ip_recvtos() : I32 val Returns¶ I32 val ip_recvttl¶ [Source] fun box ip_recvttl() : I32 val Returns¶ I32 val ip_retopts¶ [Source] fun box ip_retopts() : I32 val Returns¶ I32 val ip_router_alert¶ [Source] fun box ip_router_alert() : I32 val Returns¶ I32 val ip_rssbucketid¶ [Source] fun box ip_rssbucketid() : I32 val Returns¶ I32 val ip_rss_listen_bucket¶ [Source] fun box ip_rss_listen_bucket() : I32 val Returns¶ I32 val ip_rsvp_off¶ [Source] fun box ip_rsvp_off() : I32 val Returns¶ I32 val ip_rsvp_on¶ [Source] fun box ip_rsvp_on() : I32 val Returns¶ I32 val ip_rsvp_vif_off¶ [Source] fun box ip_rsvp_vif_off() : I32 val Returns¶ I32 val ip_rsvp_vif_on¶ [Source] fun box ip_rsvp_vif_on() : I32 val Returns¶ I32 val ip_sendsrcaddr¶ [Source] fun box ip_sendsrcaddr() : I32 val Returns¶ I32 val ip_striphdr¶ [Source] fun box ip_striphdr() : I32 val Returns¶ I32 val ip_tos¶ [Source] fun box ip_tos() : I32 val Returns¶ I32 val ip_traffic_mgt_background¶ [Source] fun box ip_traffic_mgt_background() : I32 val Returns¶ I32 val ip_transparent¶ [Source] fun box ip_transparent() : I32 val Returns¶ I32 val ip_ttl¶ [Source] fun box ip_ttl() : I32 val Returns¶ I32 val ip_unblock_source¶ [Source] fun box ip_unblock_source() : I32 val Returns¶ I32 val ip_unicast_if¶ [Source] fun box ip_unicast_if() : I32 val Returns¶ I32 val ip_xfrm_policy¶ [Source] fun box ip_xfrm_policy() : I32 val Returns¶ I32 val local_connwait¶ [Source] fun box local_connwait() : I32 val Returns¶ I32 val local_creds¶ [Source] fun box local_creds() : I32 val Returns¶ I32 val local_peercred¶ [Source] fun box local_peercred() : I32 val Returns¶ I32 val local_peerepid¶ [Source] fun box local_peerepid() : I32 val Returns¶ I32 val local_peereuuid¶ [Source] fun box local_peereuuid() : I32 val Returns¶ I32 val local_peerpid¶ [Source] fun box local_peerpid() : I32 val Returns¶ I32 val local_peeruuid¶ [Source] fun box local_peeruuid() : I32 val Returns¶ I32 val local_vendor¶ [Source] fun box local_vendor() : I32 val Returns¶ I32 val max_tcpoptlen¶ [Source] fun box max_tcpoptlen() : I32 val Returns¶ I32 val mcast_block_source¶ [Source] fun box mcast_block_source() : I32 val Returns¶ I32 val mcast_exclude¶ [Source] fun box mcast_exclude() : I32 val Returns¶ I32 val mcast_include¶ [Source] fun box mcast_include() : I32 val Returns¶ I32 val mcast_join_group¶ [Source] fun box mcast_join_group() : I32 val Returns¶ I32 val mcast_join_source_group¶ [Source] fun box mcast_join_source_group() : I32 val Returns¶ I32 val mcast_leave_group¶ [Source] fun box mcast_leave_group() : I32 val Returns¶ I32 val mcast_leave_source_group¶ [Source] fun box mcast_leave_source_group() : I32 val Returns¶ I32 val mcast_msfilter¶ [Source] fun box mcast_msfilter() : I32 val Returns¶ I32 val mcast_unblock_source¶ [Source] fun box mcast_unblock_source() : I32 val Returns¶ I32 val mcast_undefined¶ [Source] fun box mcast_undefined() : I32 val Returns¶ I32 val mrt_add_bw_upcall¶ [Source] fun box mrt_add_bw_upcall() : I32 val Returns¶ I32 val mrt_add_mfc¶ [Source] fun box mrt_add_mfc() : I32 val Returns¶ I32 val mrt_add_vif¶ [Source] fun box mrt_add_vif() : I32 val Returns¶ I32 val mrt_api_config¶ [Source] fun box mrt_api_config() : I32 val Returns¶ I32 val mrt_api_flags_all¶ [Source] fun box mrt_api_flags_all() : I32 val Returns¶ I32 val mrt_api_support¶ [Source] fun box mrt_api_support() : I32 val Returns¶ I32 val mrt_assert¶ [Source] fun box mrt_assert() : I32 val Returns¶ I32 val mrt_del_bw_upcall¶ [Source] fun box mrt_del_bw_upcall() : I32 val Returns¶ I32 val mrt_del_mfc¶ [Source] fun box mrt_del_mfc() : I32 val Returns¶ I32 val mrt_del_vif¶ [Source] fun box mrt_del_vif() : I32 val Returns¶ I32 val mrt_done¶ [Source] fun box mrt_done() : I32 val Returns¶ I32 val mrt_init¶ [Source] fun box mrt_init() : I32 val Returns¶ I32 val mrt_mfc_bw_upcall¶ [Source] fun box mrt_mfc_bw_upcall() : I32 val Returns¶ I32 val mrt_mfc_flags_all¶ [Source] fun box mrt_mfc_flags_all() : I32 val Returns¶ I32 val mrt_mfc_flags_border_vif¶ [Source] fun box mrt_mfc_flags_border_vif() : I32 val Returns¶ I32 val mrt_mfc_flags_disable_wrongvif¶ [Source] fun box mrt_mfc_flags_disable_wrongvif() : I32 val Returns¶ I32 val mrt_mfc_rp¶ [Source] fun box mrt_mfc_rp() : I32 val Returns¶ I32 val mrt_pim¶ [Source] fun box mrt_pim() : I32 val Returns¶ I32 val mrt_version¶ [Source] fun box mrt_version() : I32 val Returns¶ I32 val msg_notification¶ [Source] fun box msg_notification() : I32 val Returns¶ I32 val msg_socallbck¶ [Source] fun box msg_socallbck() : I32 val Returns¶ I32 val ndrvproto_ndrv¶ [Source] fun box ndrvproto_ndrv() : I32 val Returns¶ I32 val ndrv_addmulticast¶ [Source] fun box ndrv_addmulticast() : I32 val Returns¶ I32 val ndrv_deldmxspec¶ [Source] fun box ndrv_deldmxspec() : I32 val Returns¶ I32 val ndrv_delmulticast¶ [Source] fun box ndrv_delmulticast() : I32 val Returns¶ I32 val ndrv_demuxtype_ethertype¶ [Source] fun box ndrv_demuxtype_ethertype() : I32 val Returns¶ I32 val ndrv_demuxtype_sap¶ [Source] fun box ndrv_demuxtype_sap() : I32 val Returns¶ I32 val ndrv_demuxtype_snap¶ [Source] fun box ndrv_demuxtype_snap() : I32 val Returns¶ I32 val ndrv_dmux_max_descr¶ [Source] fun box ndrv_dmux_max_descr() : I32 val Returns¶ I32 val ndrv_protocol_desc_vers¶ [Source] fun box ndrv_protocol_desc_vers() : I32 val Returns¶ I32 val ndrv_setdmxspec¶ [Source] fun box ndrv_setdmxspec() : I32 val Returns¶ I32 val netlink_add_membership¶ [Source] fun box netlink_add_membership() : I32 val Returns¶ I32 val netlink_audit¶ [Source] fun box netlink_audit() : I32 val Returns¶ I32 val netlink_broadcast_error¶ [Source] fun box netlink_broadcast_error() : I32 val Returns¶ I32 val netlink_cap_ack¶ [Source] fun box netlink_cap_ack() : I32 val Returns¶ I32 val netlink_connector¶ [Source] fun box netlink_connector() : I32 val Returns¶ I32 val netlink_crypto¶ [Source] fun box netlink_crypto() : I32 val Returns¶ I32 val netlink_dnrtmsg¶ [Source] fun box netlink_dnrtmsg() : I32 val Returns¶ I32 val netlink_drop_membership¶ [Source] fun box netlink_drop_membership() : I32 val Returns¶ I32 val netlink_ecryptfs¶ [Source] fun box netlink_ecryptfs() : I32 val Returns¶ I32 val netlink_fib_lookup¶ [Source] fun box netlink_fib_lookup() : I32 val Returns¶ I32 val netlink_firewall¶ [Source] fun box netlink_firewall() : I32 val Returns¶ I32 val netlink_generic¶ [Source] fun box netlink_generic() : I32 val Returns¶ I32 val netlink_inet_diag¶ [Source] fun box netlink_inet_diag() : I32 val Returns¶ I32 val netlink_ip6_fw¶ [Source] fun box netlink_ip6_fw() : I32 val Returns¶ I32 val netlink_iscsi¶ [Source] fun box netlink_iscsi() : I32 val Returns¶ I32 val netlink_kobject_uevent¶ [Source] fun box netlink_kobject_uevent() : I32 val Returns¶ I32 val netlink_listen_all_nsid¶ [Source] fun box netlink_listen_all_nsid() : I32 val Returns¶ I32 val netlink_list_memberships¶ [Source] fun box netlink_list_memberships() : I32 val Returns¶ I32 val netlink_netfilter¶ [Source] fun box netlink_netfilter() : I32 val Returns¶ I32 val netlink_nflog¶ [Source] fun box netlink_nflog() : I32 val Returns¶ I32 val netlink_no_enobufs¶ [Source] fun box netlink_no_enobufs() : I32 val Returns¶ I32 val netlink_pktinfo¶ [Source] fun box netlink_pktinfo() : I32 val Returns¶ I32 val netlink_rdma¶ [Source] fun box netlink_rdma() : I32 val Returns¶ I32 val netlink_route¶ [Source] fun box netlink_route() : I32 val Returns¶ I32 val netlink_rx_ring¶ [Source] fun box netlink_rx_ring() : I32 val Returns¶ I32 val netlink_scsitransport¶ [Source] fun box netlink_scsitransport() : I32 val Returns¶ I32 val netlink_selinux¶ [Source] fun box netlink_selinux() : I32 val Returns¶ I32 val netlink_sock_diag¶ [Source] fun box netlink_sock_diag() : I32 val Returns¶ I32 val netlink_tx_ring¶ [Source] fun box netlink_tx_ring() : I32 val Returns¶ I32 val netlink_unused¶ [Source] fun box netlink_unused() : I32 val Returns¶ I32 val netlink_usersock¶ [Source] fun box netlink_usersock() : I32 val Returns¶ I32 val netlink_xfrm¶ [Source] fun box netlink_xfrm() : I32 val Returns¶ I32 val netrom_idle¶ [Source] fun box netrom_idle() : I32 val Returns¶ I32 val netrom_kill¶ [Source] fun box netrom_kill() : I32 val Returns¶ I32 val netrom_n2¶ [Source] fun box netrom_n2() : I32 val Returns¶ I32 val netrom_neigh¶ [Source] fun box netrom_neigh() : I32 val Returns¶ I32 val netrom_node¶ [Source] fun box netrom_node() : I32 val Returns¶ I32 val netrom_paclen¶ [Source] fun box netrom_paclen() : I32 val Returns¶ I32 val netrom_t1¶ [Source] fun box netrom_t1() : I32 val Returns¶ I32 val netrom_t2¶ [Source] fun box netrom_t2() : I32 val Returns¶ I32 val netrom_t4¶ [Source] fun box netrom_t4() : I32 val Returns¶ I32 val nrdv_multicast_addrs_per_sock¶ [Source] fun box nrdv_multicast_addrs_per_sock() : I32 val Returns¶ I32 val pvd_config¶ [Source] fun box pvd_config() : I32 val Returns¶ I32 val rds_cancel_sent_to¶ [Source] fun box rds_cancel_sent_to() : I32 val Returns¶ I32 val rds_cmsg_atomic_cswp¶ [Source] fun box rds_cmsg_atomic_cswp() : I32 val Returns¶ I32 val rds_cmsg_atomic_fadd¶ [Source] fun box rds_cmsg_atomic_fadd() : I32 val Returns¶ I32 val rds_cmsg_cong_update¶ [Source] fun box rds_cmsg_cong_update() : I32 val Returns¶ I32 val rds_cmsg_masked_atomic_cswp¶ [Source] fun box rds_cmsg_masked_atomic_cswp() : I32 val Returns¶ I32 val rds_cmsg_masked_atomic_fadd¶ [Source] fun box rds_cmsg_masked_atomic_fadd() : I32 val Returns¶ I32 val rds_cmsg_rdma_args¶ [Source] fun box rds_cmsg_rdma_args() : I32 val Returns¶ I32 val rds_cmsg_rdma_dest¶ [Source] fun box rds_cmsg_rdma_dest() : I32 val Returns¶ I32 val rds_cmsg_rdma_map¶ [Source] fun box rds_cmsg_rdma_map() : I32 val Returns¶ I32 val rds_cmsg_rdma_status¶ [Source] fun box rds_cmsg_rdma_status() : I32 val Returns¶ I32 val rds_cong_monitor¶ [Source] fun box rds_cong_monitor() : I32 val Returns¶ I32 val rds_cong_monitor_size¶ [Source] fun box rds_cong_monitor_size() : I32 val Returns¶ I32 val rds_free_mr¶ [Source] fun box rds_free_mr() : I32 val Returns¶ I32 val rds_get_mr¶ [Source] fun box rds_get_mr() : I32 val Returns¶ I32 val rds_get_mr_for_dest¶ [Source] fun box rds_get_mr_for_dest() : I32 val Returns¶ I32 val rds_ib_abi_version¶ [Source] fun box rds_ib_abi_version() : I32 val Returns¶ I32 val rds_ib_gid_len¶ [Source] fun box rds_ib_gid_len() : I32 val Returns¶ I32 val rds_info_connections¶ [Source] fun box rds_info_connections() : I32 val Returns¶ I32 val rds_info_connection_flag_connected¶ [Source] fun box rds_info_connection_flag_connected() : I32 val Returns¶ I32 val rds_info_connection_flag_connecting¶ [Source] fun box rds_info_connection_flag_connecting() : I32 val Returns¶ I32 val rds_info_connection_flag_sending¶ [Source] fun box rds_info_connection_flag_sending() : I32 val Returns¶ I32 val rds_info_connection_stats¶ [Source] fun box rds_info_connection_stats() : I32 val Returns¶ I32 val rds_info_counters¶ [Source] fun box rds_info_counters() : I32 val Returns¶ I32 val rds_info_first¶ [Source] fun box rds_info_first() : I32 val Returns¶ I32 val rds_info_ib_connections¶ [Source] fun box rds_info_ib_connections() : I32 val Returns¶ I32 val rds_info_iwarp_connections¶ [Source] fun box rds_info_iwarp_connections() : I32 val Returns¶ I32 val rds_info_last¶ [Source] fun box rds_info_last() : I32 val Returns¶ I32 val rds_info_message_flag_ack¶ [Source] fun box rds_info_message_flag_ack() : I32 val Returns¶ I32 val rds_info_message_flag_fast_ack¶ [Source] fun box rds_info_message_flag_fast_ack() : I32 val Returns¶ I32 val rds_info_recv_messages¶ [Source] fun box rds_info_recv_messages() : I32 val Returns¶ I32 val rds_info_retrans_messages¶ [Source] fun box rds_info_retrans_messages() : I32 val Returns¶ I32 val rds_info_send_messages¶ [Source] fun box rds_info_send_messages() : I32 val Returns¶ I32 val rds_info_sockets¶ [Source] fun box rds_info_sockets() : I32 val Returns¶ I32 val rds_info_tcp_sockets¶ [Source] fun box rds_info_tcp_sockets() : I32 val Returns¶ I32 val rds_rdma_canceled¶ [Source] fun box rds_rdma_canceled() : I32 val Returns¶ I32 val rds_rdma_dontwait¶ [Source] fun box rds_rdma_dontwait() : I32 val Returns¶ I32 val rds_rdma_dropped¶ [Source] fun box rds_rdma_dropped() : I32 val Returns¶ I32 val rds_rdma_fence¶ [Source] fun box rds_rdma_fence() : I32 val Returns¶ I32 val rds_rdma_invalidate¶ [Source] fun box rds_rdma_invalidate() : I32 val Returns¶ I32 val rds_rdma_notify_me¶ [Source] fun box rds_rdma_notify_me() : I32 val Returns¶ I32 val rds_rdma_other_error¶ [Source] fun box rds_rdma_other_error() : I32 val Returns¶ I32 val rds_rdma_readwrite¶ [Source] fun box rds_rdma_readwrite() : I32 val Returns¶ I32 val rds_rdma_remote_error¶ [Source] fun box rds_rdma_remote_error() : I32 val Returns¶ I32 val rds_rdma_silent¶ [Source] fun box rds_rdma_silent() : I32 val Returns¶ I32 val rds_rdma_success¶ [Source] fun box rds_rdma_success() : I32 val Returns¶ I32 val rds_rdma_use_once¶ [Source] fun box rds_rdma_use_once() : I32 val Returns¶ I32 val rds_recverr¶ [Source] fun box rds_recverr() : I32 val Returns¶ I32 val rds_trans_count¶ [Source] fun box rds_trans_count() : I32 val Returns¶ I32 val rds_trans_ib¶ [Source] fun box rds_trans_ib() : I32 val Returns¶ I32 val rds_trans_iwarp¶ [Source] fun box rds_trans_iwarp() : I32 val Returns¶ I32 val rds_trans_none¶ [Source] fun box rds_trans_none() : I32 val Returns¶ I32 val rds_trans_tcp¶ [Source] fun box rds_trans_tcp() : I32 val Returns¶ I32 val rose_access_barred¶ [Source] fun box rose_access_barred() : I32 val Returns¶ I32 val rose_defer¶ [Source] fun box rose_defer() : I32 val Returns¶ I32 val rose_dte_originated¶ [Source] fun box rose_dte_originated() : I32 val Returns¶ I32 val rose_holdback¶ [Source] fun box rose_holdback() : I32 val Returns¶ I32 val rose_idle¶ [Source] fun box rose_idle() : I32 val Returns¶ I32 val rose_invalid_facility¶ [Source] fun box rose_invalid_facility() : I32 val Returns¶ I32 val rose_local_procedure¶ [Source] fun box rose_local_procedure() : I32 val Returns¶ I32 val rose_max_digis¶ [Source] fun box rose_max_digis() : I32 val Returns¶ I32 val rose_mtu¶ [Source] fun box rose_mtu() : I32 val Returns¶ I32 val rose_network_congestion¶ [Source] fun box rose_network_congestion() : I32 val Returns¶ I32 val rose_not_obtainable¶ [Source] fun box rose_not_obtainable() : I32 val Returns¶ I32 val rose_number_busy¶ [Source] fun box rose_number_busy() : I32 val Returns¶ I32 val rose_out_of_order¶ [Source] fun box rose_out_of_order() : I32 val Returns¶ I32 val rose_qbitincl¶ [Source] fun box rose_qbitincl() : I32 val Returns¶ I32 val rose_remote_procedure¶ [Source] fun box rose_remote_procedure() : I32 val Returns¶ I32 val rose_ship_absent¶ [Source] fun box rose_ship_absent() : I32 val Returns¶ I32 val rose_t1¶ [Source] fun box rose_t1() : I32 val Returns¶ I32 val rose_t2¶ [Source] fun box rose_t2() : I32 val Returns¶ I32 val rose_t3¶ [Source] fun box rose_t3() : I32 val Returns¶ I32 val scm_hci_raw_direction¶ [Source] fun box scm_hci_raw_direction() : I32 val Returns¶ I32 val scm_timestamp¶ [Source] fun box scm_timestamp() : I32 val Returns¶ I32 val scm_timestamping¶ [Source] fun box scm_timestamping() : I32 val Returns¶ I32 val scm_timestampns¶ [Source] fun box scm_timestampns() : I32 val Returns¶ I32 val scm_wifi_status¶ [Source] fun box scm_wifi_status() : I32 val Returns¶ I32 val sctp_abort_association¶ [Source] fun box sctp_abort_association() : I32 val Returns¶ I32 val sctp_adaptation_layer¶ [Source] fun box sctp_adaptation_layer() : I32 val Returns¶ I32 val sctp_adaption_layer¶ [Source] fun box sctp_adaption_layer() : I32 val Returns¶ I32 val sctp_add_streams¶ [Source] fun box sctp_add_streams() : I32 val Returns¶ I32 val sctp_add_vrf_id¶ [Source] fun box sctp_add_vrf_id() : I32 val Returns¶ I32 val sctp_asconf¶ [Source] fun box sctp_asconf() : I32 val Returns¶ I32 val sctp_asconf_ack¶ [Source] fun box sctp_asconf_ack() : I32 val Returns¶ I32 val sctp_asconf_supported¶ [Source] fun box sctp_asconf_supported() : I32 val Returns¶ I32 val sctp_associnfo¶ [Source] fun box sctp_associnfo() : I32 val Returns¶ I32 val sctp_authentication¶ [Source] fun box sctp_authentication() : I32 val Returns¶ I32 val sctp_auth_active_key¶ [Source] fun box sctp_auth_active_key() : I32 val Returns¶ I32 val sctp_auth_chunk¶ [Source] fun box sctp_auth_chunk() : I32 val Returns¶ I32 val sctp_auth_deactivate_key¶ [Source] fun box sctp_auth_deactivate_key() : I32 val Returns¶ I32 val sctp_auth_delete_key¶ [Source] fun box sctp_auth_delete_key() : I32 val Returns¶ I32 val sctp_auth_key¶ [Source] fun box sctp_auth_key() : I32 val Returns¶ I32 val sctp_auth_supported¶ [Source] fun box sctp_auth_supported() : I32 val Returns¶ I32 val sctp_autoclose¶ [Source] fun box sctp_autoclose() : I32 val Returns¶ I32 val sctp_auto_asconf¶ [Source] fun box sctp_auto_asconf() : I32 val Returns¶ I32 val sctp_badcrc¶ [Source] fun box sctp_badcrc() : I32 val Returns¶ I32 val sctp_bindx_add_addr¶ [Source] fun box sctp_bindx_add_addr() : I32 val Returns¶ I32 val sctp_bindx_rem_addr¶ [Source] fun box sctp_bindx_rem_addr() : I32 val Returns¶ I32 val sctp_blk_logging_enable¶ [Source] fun box sctp_blk_logging_enable() : I32 val Returns¶ I32 val sctp_bound¶ [Source] fun box sctp_bound() : I32 val Returns¶ I32 val sctp_cause_cookie_in_shutdown¶ [Source] fun box sctp_cause_cookie_in_shutdown() : I32 val Returns¶ I32 val sctp_cause_deleting_last_addr¶ [Source] fun box sctp_cause_deleting_last_addr() : I32 val Returns¶ I32 val sctp_cause_deleting_src_addr¶ [Source] fun box sctp_cause_deleting_src_addr() : I32 val Returns¶ I32 val sctp_cause_illegal_asconf_ack¶ [Source] fun box sctp_cause_illegal_asconf_ack() : I32 val Returns¶ I32 val sctp_cause_invalid_param¶ [Source] fun box sctp_cause_invalid_param() : I32 val Returns¶ I32 val sctp_cause_invalid_stream¶ [Source] fun box sctp_cause_invalid_stream() : I32 val Returns¶ I32 val sctp_cause_missing_param¶ [Source] fun box sctp_cause_missing_param() : I32 val Returns¶ I32 val sctp_cause_nat_colliding_state¶ [Source] fun box sctp_cause_nat_colliding_state() : I32 val Returns¶ I32 val sctp_cause_nat_missing_state¶ [Source] fun box sctp_cause_nat_missing_state() : I32 val Returns¶ I32 val sctp_cause_no_error¶ [Source] fun box sctp_cause_no_error() : I32 val Returns¶ I32 val sctp_cause_no_user_data¶ [Source] fun box sctp_cause_no_user_data() : I32 val Returns¶ I32 val sctp_cause_out_of_resc¶ [Source] fun box sctp_cause_out_of_resc() : I32 val Returns¶ I32 val sctp_cause_protocol_violation¶ [Source] fun box sctp_cause_protocol_violation() : I32 val Returns¶ I32 val sctp_cause_request_refused¶ [Source] fun box sctp_cause_request_refused() : I32 val Returns¶ I32 val sctp_cause_resource_shortage¶ [Source] fun box sctp_cause_resource_shortage() : I32 val Returns¶ I32 val sctp_cause_restart_w_newaddr¶ [Source] fun box sctp_cause_restart_w_newaddr() : I32 val Returns¶ I32 val sctp_cause_stale_cookie¶ [Source] fun box sctp_cause_stale_cookie() : I32 val Returns¶ I32 val sctp_cause_unrecog_chunk¶ [Source] fun box sctp_cause_unrecog_chunk() : I32 val Returns¶ I32 val sctp_cause_unrecog_param¶ [Source] fun box sctp_cause_unrecog_param() : I32 val Returns¶ I32 val sctp_cause_unresolvable_addr¶ [Source] fun box sctp_cause_unresolvable_addr() : I32 val Returns¶ I32 val sctp_cause_unsupported_hmacid¶ [Source] fun box sctp_cause_unsupported_hmacid() : I32 val Returns¶ I32 val sctp_cause_user_initiated_abt¶ [Source] fun box sctp_cause_user_initiated_abt() : I32 val Returns¶ I32 val sctp_cc_hstcp¶ [Source] fun box sctp_cc_hstcp() : I32 val Returns¶ I32 val sctp_cc_htcp¶ [Source] fun box sctp_cc_htcp() : I32 val Returns¶ I32 val sctp_cc_option¶ [Source] fun box sctp_cc_option() : I32 val Returns¶ I32 val sctp_cc_opt_rtcc_setmode¶ [Source] fun box sctp_cc_opt_rtcc_setmode() : I32 val Returns¶ I32 val sctp_cc_opt_steady_step¶ [Source] fun box sctp_cc_opt_steady_step() : I32 val Returns¶ I32 val sctp_cc_opt_use_dccc_ecn¶ [Source] fun box sctp_cc_opt_use_dccc_ecn() : I32 val Returns¶ I32 val sctp_cc_rfc2581¶ [Source] fun box sctp_cc_rfc2581() : I32 val Returns¶ I32 val sctp_cc_rtcc¶ [Source] fun box sctp_cc_rtcc() : I32 val Returns¶ I32 val sctp_closed¶ [Source] fun box sctp_closed() : I32 val Returns¶ I32 val sctp_clr_stat_log¶ [Source] fun box sctp_clr_stat_log() : I32 val Returns¶ I32 val sctp_cmt_base¶ [Source] fun box sctp_cmt_base() : I32 val Returns¶ I32 val sctp_cmt_max¶ [Source] fun box sctp_cmt_max() : I32 val Returns¶ I32 val sctp_cmt_mptcp¶ [Source] fun box sctp_cmt_mptcp() : I32 val Returns¶ I32 val sctp_cmt_off¶ [Source] fun box sctp_cmt_off() : I32 val Returns¶ I32 val sctp_cmt_on_off¶ [Source] fun box sctp_cmt_on_off() : I32 val Returns¶ I32 val sctp_cmt_rpv1¶ [Source] fun box sctp_cmt_rpv1() : I32 val Returns¶ I32 val sctp_cmt_rpv2¶ [Source] fun box sctp_cmt_rpv2() : I32 val Returns¶ I32 val sctp_cmt_use_dac¶ [Source] fun box sctp_cmt_use_dac() : I32 val Returns¶ I32 val sctp_connect_x¶ [Source] fun box sctp_connect_x() : I32 val Returns¶ I32 val sctp_connect_x_complete¶ [Source] fun box sctp_connect_x_complete() : I32 val Returns¶ I32 val sctp_connect_x_delayed¶ [Source] fun box sctp_connect_x_delayed() : I32 val Returns¶ I32 val sctp_context¶ [Source] fun box sctp_context() : I32 val Returns¶ I32 val sctp_cookie_ack¶ [Source] fun box sctp_cookie_ack() : I32 val Returns¶ I32 val sctp_cookie_echo¶ [Source] fun box sctp_cookie_echo() : I32 val Returns¶ I32 val sctp_cookie_echoed¶ [Source] fun box sctp_cookie_echoed() : I32 val Returns¶ I32 val sctp_cookie_wait¶ [Source] fun box sctp_cookie_wait() : I32 val Returns¶ I32 val sctp_cwnd_logging_enable¶ [Source] fun box sctp_cwnd_logging_enable() : I32 val Returns¶ I32 val sctp_cwnd_monitor_enable¶ [Source] fun box sctp_cwnd_monitor_enable() : I32 val Returns¶ I32 val sctp_cwr_in_same_window¶ [Source] fun box sctp_cwr_in_same_window() : I32 val Returns¶ I32 val sctp_cwr_reduce_override¶ [Source] fun box sctp_cwr_reduce_override() : I32 val Returns¶ I32 val sctp_data¶ [Source] fun box sctp_data() : I32 val Returns¶ I32 val sctp_data_first_frag¶ [Source] fun box sctp_data_first_frag() : I32 val Returns¶ I32 val sctp_data_frag_mask¶ [Source] fun box sctp_data_frag_mask() : I32 val Returns¶ I32 val sctp_data_last_frag¶ [Source] fun box sctp_data_last_frag() : I32 val Returns¶ I32 val sctp_data_middle_frag¶ [Source] fun box sctp_data_middle_frag() : I32 val Returns¶ I32 val sctp_data_not_frag¶ [Source] fun box sctp_data_not_frag() : I32 val Returns¶ I32 val sctp_data_sack_immediately¶ [Source] fun box sctp_data_sack_immediately() : I32 val Returns¶ I32 val sctp_data_unordered¶ [Source] fun box sctp_data_unordered() : I32 val Returns¶ I32 val sctp_default_prinfo¶ [Source] fun box sctp_default_prinfo() : I32 val Returns¶ I32 val sctp_default_send_param¶ [Source] fun box sctp_default_send_param() : I32 val Returns¶ I32 val sctp_default_sndinfo¶ [Source] fun box sctp_default_sndinfo() : I32 val Returns¶ I32 val sctp_delayed_sack¶ [Source] fun box sctp_delayed_sack() : I32 val Returns¶ I32 val sctp_del_vrf_id¶ [Source] fun box sctp_del_vrf_id() : I32 val Returns¶ I32 val sctp_disable_fragments¶ [Source] fun box sctp_disable_fragments() : I32 val Returns¶ I32 val sctp_ecn_cwr¶ [Source] fun box sctp_ecn_cwr() : I32 val Returns¶ I32 val sctp_ecn_echo¶ [Source] fun box sctp_ecn_echo() : I32 val Returns¶ I32 val sctp_ecn_supported¶ [Source] fun box sctp_ecn_supported() : I32 val Returns¶ I32 val sctp_enable_change_assoc_req¶ [Source] fun box sctp_enable_change_assoc_req() : I32 val Returns¶ I32 val sctp_enable_reset_assoc_req¶ [Source] fun box sctp_enable_reset_assoc_req() : I32 val Returns¶ I32 val sctp_enable_reset_stream_req¶ [Source] fun box sctp_enable_reset_stream_req() : I32 val Returns¶ I32 val sctp_enable_stream_reset¶ [Source] fun box sctp_enable_stream_reset() : I32 val Returns¶ I32 val sctp_enable_value_mask¶ [Source] fun box sctp_enable_value_mask() : I32 val Returns¶ I32 val sctp_established¶ [Source] fun box sctp_established() : I32 val Returns¶ I32 val sctp_event¶ [Source] fun box sctp_event() : I32 val Returns¶ I32 val sctp_events¶ [Source] fun box sctp_events() : I32 val Returns¶ I32 val sctp_explicit_eor¶ [Source] fun box sctp_explicit_eor() : I32 val Returns¶ I32 val sctp_flight_logging_enable¶ [Source] fun box sctp_flight_logging_enable() : I32 val Returns¶ I32 val sctp_forward_cum_tsn¶ [Source] fun box sctp_forward_cum_tsn() : I32 val Returns¶ I32 val sctp_fragment_interleave¶ [Source] fun box sctp_fragment_interleave() : I32 val Returns¶ I32 val sctp_frag_level_0¶ [Source] fun box sctp_frag_level_0() : I32 val Returns¶ I32 val sctp_frag_level_1¶ [Source] fun box sctp_frag_level_1() : I32 val Returns¶ I32 val sctp_frag_level_2¶ [Source] fun box sctp_frag_level_2() : I32 val Returns¶ I32 val sctp_from_middle_box¶ [Source] fun box sctp_from_middle_box() : I32 val Returns¶ I32 val sctp_fr_logging_enable¶ [Source] fun box sctp_fr_logging_enable() : I32 val Returns¶ I32 val sctp_get_addr_len¶ [Source] fun box sctp_get_addr_len() : I32 val Returns¶ I32 val sctp_get_asoc_vrf¶ [Source] fun box sctp_get_asoc_vrf() : I32 val Returns¶ I32 val sctp_get_assoc_id_list¶ [Source] fun box sctp_get_assoc_id_list() : I32 val Returns¶ I32 val sctp_get_assoc_number¶ [Source] fun box sctp_get_assoc_number() : I32 val Returns¶ I32 val sctp_get_local_addresses¶ [Source] fun box sctp_get_local_addresses() : I32 val Returns¶ I32 val sctp_get_local_addr_size¶ [Source] fun box sctp_get_local_addr_size() : I32 val Returns¶ I32 val sctp_get_nonce_values¶ [Source] fun box sctp_get_nonce_values() : I32 val Returns¶ I32 val sctp_get_packet_log¶ [Source] fun box sctp_get_packet_log() : I32 val Returns¶ I32 val sctp_get_peer_addresses¶ [Source] fun box sctp_get_peer_addresses() : I32 val Returns¶ I32 val sctp_get_peer_addr_info¶ [Source] fun box sctp_get_peer_addr_info() : I32 val Returns¶ I32 val sctp_get_remote_addr_size¶ [Source] fun box sctp_get_remote_addr_size() : I32 val Returns¶ I32 val sctp_get_sndbuf_use¶ [Source] fun box sctp_get_sndbuf_use() : I32 val Returns¶ I32 val sctp_get_stat_log¶ [Source] fun box sctp_get_stat_log() : I32 val Returns¶ I32 val sctp_get_vrf_ids¶ [Source] fun box sctp_get_vrf_ids() : I32 val Returns¶ I32 val sctp_had_no_tcb¶ [Source] fun box sctp_had_no_tcb() : I32 val Returns¶ I32 val sctp_heartbeat_ack¶ [Source] fun box sctp_heartbeat_ack() : I32 val Returns¶ I32 val sctp_heartbeat_request¶ [Source] fun box sctp_heartbeat_request() : I32 val Returns¶ I32 val sctp_hmac_ident¶ [Source] fun box sctp_hmac_ident() : I32 val Returns¶ I32 val sctp_idata¶ [Source] fun box sctp_idata() : I32 val Returns¶ I32 val sctp_iforward_cum_tsn¶ [Source] fun box sctp_iforward_cum_tsn() : I32 val Returns¶ I32 val sctp_initiation¶ [Source] fun box sctp_initiation() : I32 val Returns¶ I32 val sctp_initiation_ack¶ [Source] fun box sctp_initiation_ack() : I32 val Returns¶ I32 val sctp_initmsg¶ [Source] fun box sctp_initmsg() : I32 val Returns¶ I32 val sctp_interleaving_supported¶ [Source] fun box sctp_interleaving_supported() : I32 val Returns¶ I32 val sctp_i_want_mapped_v4_addr¶ [Source] fun box sctp_i_want_mapped_v4_addr() : I32 val Returns¶ I32 val sctp_last_packet_tracing¶ [Source] fun box sctp_last_packet_tracing() : I32 val Returns¶ I32 val sctp_listen¶ [Source] fun box sctp_listen() : I32 val Returns¶ I32 val sctp_local_auth_chunks¶ [Source] fun box sctp_local_auth_chunks() : I32 val Returns¶ I32 val sctp_lock_logging_enable¶ [Source] fun box sctp_lock_logging_enable() : I32 val Returns¶ I32 val sctp_log_at_send_2_outq¶ [Source] fun box sctp_log_at_send_2_outq() : I32 val Returns¶ I32 val sctp_log_at_send_2_sctp¶ [Source] fun box sctp_log_at_send_2_sctp() : I32 val Returns¶ I32 val sctp_log_maxburst_enable¶ [Source] fun box sctp_log_maxburst_enable() : I32 val Returns¶ I32 val sctp_log_rwnd_enable¶ [Source] fun box sctp_log_rwnd_enable() : I32 val Returns¶ I32 val sctp_log_sack_arrivals_enable¶ [Source] fun box sctp_log_sack_arrivals_enable() : I32 val Returns¶ I32 val sctp_log_try_advance¶ [Source] fun box sctp_log_try_advance() : I32 val Returns¶ I32 val sctp_ltrace_chunk_enable¶ [Source] fun box sctp_ltrace_chunk_enable() : I32 val Returns¶ I32 val sctp_ltrace_error_enable¶ [Source] fun box sctp_ltrace_error_enable() : I32 val Returns¶ I32 val sctp_map_logging_enable¶ [Source] fun box sctp_map_logging_enable() : I32 val Returns¶ I32 val sctp_maxburst¶ [Source] fun box sctp_maxburst() : I32 val Returns¶ I32 val sctp_maxseg¶ [Source] fun box sctp_maxseg() : I32 val Returns¶ I32 val sctp_max_burst¶ [Source] fun box sctp_max_burst() : I32 val Returns¶ I32 val sctp_max_cookie_life¶ [Source] fun box sctp_max_cookie_life() : I32 val Returns¶ I32 val sctp_max_cwnd¶ [Source] fun box sctp_max_cwnd() : I32 val Returns¶ I32 val sctp_max_hb_interval¶ [Source] fun box sctp_max_hb_interval() : I32 val Returns¶ I32 val sctp_max_sack_delay¶ [Source] fun box sctp_max_sack_delay() : I32 val Returns¶ I32 val sctp_mbcnt_logging_enable¶ [Source] fun box sctp_mbcnt_logging_enable() : I32 val Returns¶ I32 val sctp_mbuf_logging_enable¶ [Source] fun box sctp_mbuf_logging_enable() : I32 val Returns¶ I32 val sctp_mobility_base¶ [Source] fun box sctp_mobility_base() : I32 val Returns¶ I32 val sctp_mobility_fasthandoff¶ [Source] fun box sctp_mobility_fasthandoff() : I32 val Returns¶ I32 val sctp_mobility_prim_deleted¶ [Source] fun box sctp_mobility_prim_deleted() : I32 val Returns¶ I32 val sctp_nagle_logging_enable¶ [Source] fun box sctp_nagle_logging_enable() : I32 val Returns¶ I32 val sctp_nodelay¶ [Source] fun box sctp_nodelay() : I32 val Returns¶ I32 val sctp_nrsack_supported¶ [Source] fun box sctp_nrsack_supported() : I32 val Returns¶ I32 val sctp_nr_selective_ack¶ [Source] fun box sctp_nr_selective_ack() : I32 val Returns¶ I32 val sctp_operation_error¶ [Source] fun box sctp_operation_error() : I32 val Returns¶ I32 val sctp_packed¶ [Source] fun box sctp_packed() : I32 val Returns¶ I32 val sctp_packet_dropped¶ [Source] fun box sctp_packet_dropped() : I32 val Returns¶ I32 val sctp_packet_log_size¶ [Source] fun box sctp_packet_log_size() : I32 val Returns¶ I32 val sctp_packet_truncated¶ [Source] fun box sctp_packet_truncated() : I32 val Returns¶ I32 val sctp_pad_chunk¶ [Source] fun box sctp_pad_chunk() : I32 val Returns¶ I32 val sctp_partial_delivery_point¶ [Source] fun box sctp_partial_delivery_point() : I32 val Returns¶ I32 val sctp_pcb_copy_flags¶ [Source] fun box sctp_pcb_copy_flags() : I32 val Returns¶ I32 val sctp_pcb_flags_accepting¶ [Source] fun box sctp_pcb_flags_accepting() : I32 val Returns¶ I32 val sctp_pcb_flags_adaptationevnt¶ [Source] fun box sctp_pcb_flags_adaptationevnt() : I32 val Returns¶ I32 val sctp_pcb_flags_assoc_resetevnt¶ [Source] fun box sctp_pcb_flags_assoc_resetevnt() : I32 val Returns¶ I32 val sctp_pcb_flags_authevnt¶ [Source] fun box sctp_pcb_flags_authevnt() : I32 val Returns¶ I32 val sctp_pcb_flags_autoclose¶ [Source] fun box sctp_pcb_flags_autoclose() : I32 val Returns¶ I32 val sctp_pcb_flags_auto_asconf¶ [Source] fun box sctp_pcb_flags_auto_asconf() : I32 val Returns¶ I32 val sctp_pcb_flags_blocking_io¶ [Source] fun box sctp_pcb_flags_blocking_io() : I32 val Returns¶ I32 val sctp_pcb_flags_boundall¶ [Source] fun box sctp_pcb_flags_boundall() : I32 val Returns¶ I32 val sctp_pcb_flags_bound_v6¶ [Source] fun box sctp_pcb_flags_bound_v6() : I32 val Returns¶ I32 val sctp_pcb_flags_close_ip¶ [Source] fun box sctp_pcb_flags_close_ip() : I32 val Returns¶ I32 val sctp_pcb_flags_connected¶ [Source] fun box sctp_pcb_flags_connected() : I32 val Returns¶ I32 val sctp_pcb_flags_donot_heartbeat¶ [Source] fun box sctp_pcb_flags_donot_heartbeat() : I32 val Returns¶ I32 val sctp_pcb_flags_dont_wake¶ [Source] fun box sctp_pcb_flags_dont_wake() : I32 val Returns¶ I32 val sctp_pcb_flags_do_asconf¶ [Source] fun box sctp_pcb_flags_do_asconf() : I32 val Returns¶ I32 val sctp_pcb_flags_do_not_pmtud¶ [Source] fun box sctp_pcb_flags_do_not_pmtud() : I32 val Returns¶ I32 val sctp_pcb_flags_dryevnt¶ [Source] fun box sctp_pcb_flags_dryevnt() : I32 val Returns¶ I32 val sctp_pcb_flags_explicit_eor¶ [Source] fun box sctp_pcb_flags_explicit_eor() : I32 val Returns¶ I32 val sctp_pcb_flags_ext_rcvinfo¶ [Source] fun box sctp_pcb_flags_ext_rcvinfo() : I32 val Returns¶ I32 val sctp_pcb_flags_frag_interleave¶ [Source] fun box sctp_pcb_flags_frag_interleave() : I32 val Returns¶ I32 val sctp_pcb_flags_interleave_strms¶ [Source] fun box sctp_pcb_flags_interleave_strms() : I32 val Returns¶ I32 val sctp_pcb_flags_in_tcppool¶ [Source] fun box sctp_pcb_flags_in_tcppool() : I32 val Returns¶ I32 val sctp_pcb_flags_multiple_asconfs¶ [Source] fun box sctp_pcb_flags_multiple_asconfs() : I32 val Returns¶ I32 val sctp_pcb_flags_needs_mapped_v4¶ [Source] fun box sctp_pcb_flags_needs_mapped_v4() : I32 val Returns¶ I32 val sctp_pcb_flags_nodelay¶ [Source] fun box sctp_pcb_flags_nodelay() : I32 val Returns¶ I32 val sctp_pcb_flags_no_fragment¶ [Source] fun box sctp_pcb_flags_no_fragment() : I32 val Returns¶ I32 val sctp_pcb_flags_pdapievnt¶ [Source] fun box sctp_pcb_flags_pdapievnt() : I32 val Returns¶ I32 val sctp_pcb_flags_portreuse¶ [Source] fun box sctp_pcb_flags_portreuse() : I32 val Returns¶ I32 val sctp_pcb_flags_recvassocevnt¶ [Source] fun box sctp_pcb_flags_recvassocevnt() : I32 val Returns¶ I32 val sctp_pcb_flags_recvdataioevnt¶ [Source] fun box sctp_pcb_flags_recvdataioevnt() : I32 val Returns¶ I32 val sctp_pcb_flags_recvnsendfailevnt¶ [Source] fun box sctp_pcb_flags_recvnsendfailevnt() : I32 val Returns¶ I32 val sctp_pcb_flags_recvnxtinfo¶ [Source] fun box sctp_pcb_flags_recvnxtinfo() : I32 val Returns¶ I32 val sctp_pcb_flags_recvpaddrevnt¶ [Source] fun box sctp_pcb_flags_recvpaddrevnt() : I32 val Returns¶ I32 val sctp_pcb_flags_recvpeererr¶ [Source] fun box sctp_pcb_flags_recvpeererr() : I32 val Returns¶ I32 val sctp_pcb_flags_recvrcvinfo¶ [Source] fun box sctp_pcb_flags_recvrcvinfo() : I32 val Returns¶ I32 val sctp_pcb_flags_recvsendfailevnt¶ [Source] fun box sctp_pcb_flags_recvsendfailevnt() : I32 val Returns¶ I32 val sctp_pcb_flags_recvshutdownevnt¶ [Source] fun box sctp_pcb_flags_recvshutdownevnt() : I32 val Returns¶ I32 val sctp_pcb_flags_socket_allgone¶ [Source] fun box sctp_pcb_flags_socket_allgone() : I32 val Returns¶ I32 val sctp_pcb_flags_socket_cant_read¶ [Source] fun box sctp_pcb_flags_socket_cant_read() : I32 val Returns¶ I32 val sctp_pcb_flags_socket_gone¶ [Source] fun box sctp_pcb_flags_socket_gone() : I32 val Returns¶ I32 val sctp_pcb_flags_stream_changeevnt¶ [Source] fun box sctp_pcb_flags_stream_changeevnt() : I32 val Returns¶ I32 val sctp_pcb_flags_stream_resetevnt¶ [Source] fun box sctp_pcb_flags_stream_resetevnt() : I32 val Returns¶ I32 val sctp_pcb_flags_tcptype¶ [Source] fun box sctp_pcb_flags_tcptype() : I32 val Returns¶ I32 val sctp_pcb_flags_udptype¶ [Source] fun box sctp_pcb_flags_udptype() : I32 val Returns¶ I32 val sctp_pcb_flags_unbound¶ [Source] fun box sctp_pcb_flags_unbound() : I32 val Returns¶ I32 val sctp_pcb_flags_wakeinput¶ [Source] fun box sctp_pcb_flags_wakeinput() : I32 val Returns¶ I32 val sctp_pcb_flags_wakeoutput¶ [Source] fun box sctp_pcb_flags_wakeoutput() : I32 val Returns¶ I32 val sctp_pcb_flags_was_aborted¶ [Source] fun box sctp_pcb_flags_was_aborted() : I32 val Returns¶ I32 val sctp_pcb_flags_was_connected¶ [Source] fun box sctp_pcb_flags_was_connected() : I32 val Returns¶ I32 val sctp_pcb_flags_zero_copy_active¶ [Source] fun box sctp_pcb_flags_zero_copy_active() : I32 val Returns¶ I32 val sctp_pcb_status¶ [Source] fun box sctp_pcb_status() : I32 val Returns¶ I32 val sctp_peeloff¶ [Source] fun box sctp_peeloff() : I32 val Returns¶ I32 val sctp_peer_addr_params¶ [Source] fun box sctp_peer_addr_params() : I32 val Returns¶ I32 val sctp_peer_addr_thlds¶ [Source] fun box sctp_peer_addr_thlds() : I32 val Returns¶ I32 val sctp_peer_auth_chunks¶ [Source] fun box sctp_peer_auth_chunks() : I32 val Returns¶ I32 val sctp_pktdrop_supported¶ [Source] fun box sctp_pktdrop_supported() : I32 val Returns¶ I32 val sctp_pluggable_cc¶ [Source] fun box sctp_pluggable_cc() : I32 val Returns¶ I32 val sctp_pluggable_ss¶ [Source] fun box sctp_pluggable_ss() : I32 val Returns¶ I32 val sctp_primary_addr¶ [Source] fun box sctp_primary_addr() : I32 val Returns¶ I32 val sctp_pr_assoc_status¶ [Source] fun box sctp_pr_assoc_status() : I32 val Returns¶ I32 val sctp_pr_stream_status¶ [Source] fun box sctp_pr_stream_status() : I32 val Returns¶ I32 val sctp_pr_supported¶ [Source] fun box sctp_pr_supported() : I32 val Returns¶ I32 val sctp_reconfig_supported¶ [Source] fun box sctp_reconfig_supported() : I32 val Returns¶ I32 val sctp_recvnxtinfo¶ [Source] fun box sctp_recvnxtinfo() : I32 val Returns¶ I32 val sctp_recvrcvinfo¶ [Source] fun box sctp_recvrcvinfo() : I32 val Returns¶ I32 val sctp_recv_rwnd_logging_enable¶ [Source] fun box sctp_recv_rwnd_logging_enable() : I32 val Returns¶ I32 val sctp_remote_udp_encaps_port¶ [Source] fun box sctp_remote_udp_encaps_port() : I32 val Returns¶ I32 val sctp_reset_assoc¶ [Source] fun box sctp_reset_assoc() : I32 val Returns¶ I32 val sctp_reset_streams¶ [Source] fun box sctp_reset_streams() : I32 val Returns¶ I32 val sctp_reuse_port¶ [Source] fun box sctp_reuse_port() : I32 val Returns¶ I32 val sctp_rtoinfo¶ [Source] fun box sctp_rtoinfo() : I32 val Returns¶ I32 val sctp_rttvar_logging_enable¶ [Source] fun box sctp_rttvar_logging_enable() : I32 val Returns¶ I32 val sctp_sack_cmt_dac¶ [Source] fun box sctp_sack_cmt_dac() : I32 val Returns¶ I32 val sctp_sack_logging_enable¶ [Source] fun box sctp_sack_logging_enable() : I32 val Returns¶ I32 val sctp_sack_nonce_sum¶ [Source] fun box sctp_sack_nonce_sum() : I32 val Returns¶ I32 val sctp_sack_rwnd_logging_enable¶ [Source] fun box sctp_sack_rwnd_logging_enable() : I32 val Returns¶ I32 val sctp_sat_network_burst_incr¶ [Source] fun box sctp_sat_network_burst_incr() : I32 val Returns¶ I32 val sctp_sat_network_min¶ [Source] fun box sctp_sat_network_min() : I32 val Returns¶ I32 val sctp_sb_logging_enable¶ [Source] fun box sctp_sb_logging_enable() : I32 val Returns¶ I32 val sctp_selective_ack¶ [Source] fun box sctp_selective_ack() : I32 val Returns¶ I32 val sctp_set_debug_level¶ [Source] fun box sctp_set_debug_level() : I32 val Returns¶ I32 val sctp_set_dynamic_primary¶ [Source] fun box sctp_set_dynamic_primary() : I32 val Returns¶ I32 val sctp_set_initial_dbg_seq¶ [Source] fun box sctp_set_initial_dbg_seq() : I32 val Returns¶ I32 val sctp_set_peer_primary_addr¶ [Source] fun box sctp_set_peer_primary_addr() : I32 val Returns¶ I32 val sctp_shutdown¶ [Source] fun box sctp_shutdown() : I32 val Returns¶ I32 val sctp_shutdown_ack¶ [Source] fun box sctp_shutdown_ack() : I32 val Returns¶ I32 val sctp_shutdown_ack_sent¶ [Source] fun box sctp_shutdown_ack_sent() : I32 val Returns¶ I32 val sctp_shutdown_complete¶ [Source] fun box sctp_shutdown_complete() : I32 val Returns¶ I32 val sctp_shutdown_pending¶ [Source] fun box sctp_shutdown_pending() : I32 val Returns¶ I32 val sctp_shutdown_received¶ [Source] fun box sctp_shutdown_received() : I32 val Returns¶ I32 val sctp_shutdown_sent¶ [Source] fun box sctp_shutdown_sent() : I32 val Returns¶ I32 val sctp_smallest_pmtu¶ [Source] fun box sctp_smallest_pmtu() : I32 val Returns¶ I32 val sctp_ss_default¶ [Source] fun box sctp_ss_default() : I32 val Returns¶ I32 val sctp_ss_fair_bandwith¶ [Source] fun box sctp_ss_fair_bandwith() : I32 val Returns¶ I32 val sctp_ss_first_come¶ [Source] fun box sctp_ss_first_come() : I32 val Returns¶ I32 val sctp_ss_priority¶ [Source] fun box sctp_ss_priority() : I32 val Returns¶ I32 val sctp_ss_round_robin¶ [Source] fun box sctp_ss_round_robin() : I32 val Returns¶ I32 val sctp_ss_round_robin_packet¶ [Source] fun box sctp_ss_round_robin_packet() : I32 val Returns¶ I32 val sctp_ss_value¶ [Source] fun box sctp_ss_value() : I32 val Returns¶ I32 val sctp_status¶ [Source] fun box sctp_status() : I32 val Returns¶ I32 val sctp_stream_reset¶ [Source] fun box sctp_stream_reset() : I32 val Returns¶ I32 val sctp_stream_reset_incoming¶ [Source] fun box sctp_stream_reset_incoming() : I32 val Returns¶ I32 val sctp_stream_reset_outgoing¶ [Source] fun box sctp_stream_reset_outgoing() : I32 val Returns¶ I32 val sctp_str_logging_enable¶ [Source] fun box sctp_str_logging_enable() : I32 val Returns¶ I32 val sctp_threshold_logging¶ [Source] fun box sctp_threshold_logging() : I32 val Returns¶ I32 val sctp_timeouts¶ [Source] fun box sctp_timeouts() : I32 val Returns¶ I32 val sctp_use_ext_rcvinfo¶ [Source] fun box sctp_use_ext_rcvinfo() : I32 val Returns¶ I32 val sctp_vrf_id¶ [Source] fun box sctp_vrf_id() : I32 val Returns¶ I32 val sctp_wake_logging_enable¶ [Source] fun box sctp_wake_logging_enable() : I32 val Returns¶ I32 val sock_cloexec¶ [Source] fun box sock_cloexec() : I32 val Returns¶ I32 val sock_dgram¶ [Source] fun box sock_dgram() : I32 val Returns¶ I32 val sock_maxaddrlen¶ [Source] fun box sock_maxaddrlen() : I32 val Returns¶ I32 val sock_nonblock¶ [Source] fun box sock_nonblock() : I32 val Returns¶ I32 val sock_raw¶ [Source] fun box sock_raw() : I32 val Returns¶ I32 val sock_rdm¶ [Source] fun box sock_rdm() : I32 val Returns¶ I32 val sock_seqpacket¶ [Source] fun box sock_seqpacket() : I32 val Returns¶ I32 val sock_stream¶ [Source] fun box sock_stream() : I32 val Returns¶ I32 val somaxconn¶ [Source] fun box somaxconn() : I32 val Returns¶ I32 val sonpx_setoptshut¶ [Source] fun box sonpx_setoptshut() : I32 val Returns¶ I32 val so_acceptconn¶ [Source] fun box so_acceptconn() : I32 val Returns¶ I32 val so_acceptfilter¶ [Source] fun box so_acceptfilter() : I32 val Returns¶ I32 val so_atmpvc¶ [Source] fun box so_atmpvc() : I32 val Returns¶ I32 val so_atmqos¶ [Source] fun box so_atmqos() : I32 val Returns¶ I32 val so_atmsap¶ [Source] fun box so_atmsap() : I32 val Returns¶ I32 val so_attach_bpf¶ [Source] fun box so_attach_bpf() : I32 val Returns¶ I32 val so_attach_filter¶ [Source] fun box so_attach_filter() : I32 val Returns¶ I32 val so_bindtodevice¶ [Source] fun box so_bindtodevice() : I32 val Returns¶ I32 val so_bintime¶ [Source] fun box so_bintime() : I32 val Returns¶ I32 val so_bpf_extensions¶ [Source] fun box so_bpf_extensions() : I32 val Returns¶ I32 val so_broadcast¶ [Source] fun box so_broadcast() : I32 val Returns¶ I32 val so_bsdcompat¶ [Source] fun box so_bsdcompat() : I32 val Returns¶ I32 val so_bsp_state¶ [Source] fun box so_bsp_state() : I32 val Returns¶ I32 val so_busy_poll¶ [Source] fun box so_busy_poll() : I32 val Returns¶ I32 val so_conaccess¶ [Source] fun box so_conaccess() : I32 val Returns¶ I32 val so_condata¶ [Source] fun box so_condata() : I32 val Returns¶ I32 val so_conditional_accept¶ [Source] fun box so_conditional_accept() : I32 val Returns¶ I32 val so_connect_time¶ [Source] fun box so_connect_time() : I32 val Returns¶ I32 val so_debug¶ [Source] fun box so_debug() : I32 val Returns¶ I32 val so_detach_bpf¶ [Source] fun box so_detach_bpf() : I32 val Returns¶ I32 val so_detach_filter¶ [Source] fun box so_detach_filter() : I32 val Returns¶ I32 val so_domain¶ [Source] fun box so_domain() : I32 val Returns¶ I32 val so_dontlinger¶ [Source] fun box so_dontlinger() : I32 val Returns¶ I32 val so_dontroute¶ [Source] fun box so_dontroute() : I32 val Returns¶ I32 val so_donttrunc¶ [Source] fun box so_donttrunc() : I32 val Returns¶ I32 val so_error¶ [Source] fun box so_error() : I32 val Returns¶ I32 val so_exclusiveaddruse¶ [Source] fun box so_exclusiveaddruse() : I32 val Returns¶ I32 val so_get_filter¶ [Source] fun box so_get_filter() : I32 val Returns¶ I32 val so_group_id¶ [Source] fun box so_group_id() : I32 val Returns¶ I32 val so_group_priority¶ [Source] fun box so_group_priority() : I32 val Returns¶ I32 val so_hci_raw_direction¶ [Source] fun box so_hci_raw_direction() : I32 val Returns¶ I32 val so_hci_raw_filter¶ [Source] fun box so_hci_raw_filter() : I32 val Returns¶ I32 val so_incoming_cpu¶ [Source] fun box so_incoming_cpu() : I32 val Returns¶ I32 val so_keepalive¶ [Source] fun box so_keepalive() : I32 val Returns¶ I32 val so_l2cap_encrypted¶ [Source] fun box so_l2cap_encrypted() : I32 val Returns¶ I32 val so_l2cap_flush¶ [Source] fun box so_l2cap_flush() : I32 val Returns¶ I32 val so_l2cap_iflow¶ [Source] fun box so_l2cap_iflow() : I32 val Returns¶ I32 val so_l2cap_imtu¶ [Source] fun box so_l2cap_imtu() : I32 val Returns¶ I32 val so_l2cap_oflow¶ [Source] fun box so_l2cap_oflow() : I32 val Returns¶ I32 val so_l2cap_omtu¶ [Source] fun box so_l2cap_omtu() : I32 val Returns¶ I32 val so_label¶ [Source] fun box so_label() : I32 val Returns¶ I32 val so_linger¶ [Source] fun box so_linger() : I32 val Returns¶ I32 val so_linger_sec¶ [Source] fun box so_linger_sec() : I32 val Returns¶ I32 val so_linkinfo¶ [Source] fun box so_linkinfo() : I32 val Returns¶ I32 val so_listenincqlen¶ [Source] fun box so_listenincqlen() : I32 val Returns¶ I32 val so_listenqlen¶ [Source] fun box so_listenqlen() : I32 val Returns¶ I32 val so_listenqlimit¶ [Source] fun box so_listenqlimit() : I32 val Returns¶ I32 val so_lock_filter¶ [Source] fun box so_lock_filter() : I32 val Returns¶ I32 val so_mark¶ [Source] fun box so_mark() : I32 val Returns¶ I32 val so_max_msg_size¶ [Source] fun box so_max_msg_size() : I32 val Returns¶ I32 val so_max_pacing_rate¶ [Source] fun box so_max_pacing_rate() : I32 val Returns¶ I32 val so_multipoint¶ [Source] fun box so_multipoint() : I32 val Returns¶ I32 val so_netsvc_marking_level¶ [Source] fun box so_netsvc_marking_level() : I32 val Returns¶ I32 val so_net_service_type¶ [Source] fun box so_net_service_type() : I32 val Returns¶ I32 val so_nke¶ [Source] fun box so_nke() : I32 val Returns¶ I32 val so_noaddrerr¶ [Source] fun box so_noaddrerr() : I32 val Returns¶ I32 val so_nofcs¶ [Source] fun box so_nofcs() : I32 val Returns¶ I32 val so_nosigpipe¶ [Source] fun box so_nosigpipe() : I32 val Returns¶ I32 val so_notifyconflict¶ [Source] fun box so_notifyconflict() : I32 val Returns¶ I32 val so_no_check¶ [Source] fun box so_no_check() : I32 val Returns¶ I32 val so_no_ddp¶ [Source] fun box so_no_ddp() : I32 val Returns¶ I32 val so_no_offload¶ [Source] fun box so_no_offload() : I32 val Returns¶ I32 val so_np_extensions¶ [Source] fun box so_np_extensions() : I32 val Returns¶ I32 val so_nread¶ [Source] fun box so_nread() : I32 val Returns¶ I32 val so_numrcvpkt¶ [Source] fun box so_numrcvpkt() : I32 val Returns¶ I32 val so_nwrite¶ [Source] fun box so_nwrite() : I32 val Returns¶ I32 val so_oobinline¶ [Source] fun box so_oobinline() : I32 val Returns¶ I32 val so_original_dst¶ [Source] fun box so_original_dst() : I32 val Returns¶ I32 val so_passcred¶ [Source] fun box so_passcred() : I32 val Returns¶ I32 val so_passsec¶ [Source] fun box so_passsec() : I32 val Returns¶ I32 val so_peek_off¶ [Source] fun box so_peek_off() : I32 val Returns¶ I32 val so_peercred¶ [Source] fun box so_peercred() : I32 val Returns¶ I32 val so_peerlabel¶ [Source] fun box so_peerlabel() : I32 val Returns¶ I32 val so_peername¶ [Source] fun box so_peername() : I32 val Returns¶ I32 val so_peersec¶ [Source] fun box so_peersec() : I32 val Returns¶ I32 val so_port_scalability¶ [Source] fun box so_port_scalability() : I32 val Returns¶ I32 val so_priority¶ [Source] fun box so_priority() : I32 val Returns¶ I32 val so_protocol¶ [Source] fun box so_protocol() : I32 val Returns¶ I32 val so_protocol_info¶ [Source] fun box so_protocol_info() : I32 val Returns¶ I32 val so_prototype¶ [Source] fun box so_prototype() : I32 val Returns¶ I32 val so_proxyusr¶ [Source] fun box so_proxyusr() : I32 val Returns¶ I32 val so_randomport¶ [Source] fun box so_randomport() : I32 val Returns¶ I32 val so_rcvbuf¶ [Source] fun box so_rcvbuf() : I32 val Returns¶ I32 val so_rcvbufforce¶ [Source] fun box so_rcvbufforce() : I32 val Returns¶ I32 val so_rcvlowat¶ [Source] fun box so_rcvlowat() : I32 val Returns¶ I32 val so_rcvtimeo¶ [Source] fun box so_rcvtimeo() : I32 val Returns¶ I32 val so_rds_transport¶ [Source] fun box so_rds_transport() : I32 val Returns¶ I32 val so_reuseaddr¶ [Source] fun box so_reuseaddr() : I32 val Returns¶ I32 val so_reuseport¶ [Source] fun box so_reuseport() : I32 val Returns¶ I32 val so_reuseshareuid¶ [Source] fun box so_reuseshareuid() : I32 val Returns¶ I32 val so_rfcomm_fc_info¶ [Source] fun box so_rfcomm_fc_info() : I32 val Returns¶ I32 val so_rfcomm_mtu¶ [Source] fun box so_rfcomm_mtu() : I32 val Returns¶ I32 val so_rxq_ovfl¶ [Source] fun box so_rxq_ovfl() : I32 val Returns¶ I32 val so_sco_conninfo¶ [Source] fun box so_sco_conninfo() : I32 val Returns¶ I32 val so_sco_mtu¶ [Source] fun box so_sco_mtu() : I32 val Returns¶ I32 val so_security_authentication¶ [Source] fun box so_security_authentication() : I32 val Returns¶ I32 val so_security_encryption_network¶ [Source] fun box so_security_encryption_network() : I32 val Returns¶ I32 val so_security_encryption_transport¶ [Source] fun box so_security_encryption_transport() : I32 val Returns¶ I32 val so_select_err_queue¶ [Source] fun box so_select_err_queue() : I32 val Returns¶ I32 val so_setclp¶ [Source] fun box so_setclp() : I32 val Returns¶ I32 val so_setfib¶ [Source] fun box so_setfib() : I32 val Returns¶ I32 val so_sndbuf¶ [Source] fun box so_sndbuf() : I32 val Returns¶ I32 val so_sndbufforce¶ [Source] fun box so_sndbufforce() : I32 val Returns¶ I32 val so_sndlowat¶ [Source] fun box so_sndlowat() : I32 val Returns¶ I32 val so_sndtimeo¶ [Source] fun box so_sndtimeo() : I32 val Returns¶ I32 val so_timestamp¶ [Source] fun box so_timestamp() : I32 val Returns¶ I32 val so_timestamping¶ [Source] fun box so_timestamping() : I32 val Returns¶ I32 val so_timestampns¶ [Source] fun box so_timestampns() : I32 val Returns¶ I32 val so_timestamp_monotonic¶ [Source] fun box so_timestamp_monotonic() : I32 val Returns¶ I32 val so_type¶ [Source] fun box so_type() : I32 val Returns¶ I32 val so_upcallclosewait¶ [Source] fun box so_upcallclosewait() : I32 val Returns¶ I32 val so_update_accept_context¶ [Source] fun box so_update_accept_context() : I32 val Returns¶ I32 val so_useloopback¶ [Source] fun box so_useloopback() : I32 val Returns¶ I32 val so_user_cookie¶ [Source] fun box so_user_cookie() : I32 val Returns¶ I32 val so_vendor¶ [Source] fun box so_vendor() : I32 val Returns¶ I32 val so_vm_sockets_buffer_max_size¶ [Source] fun box so_vm_sockets_buffer_max_size() : I32 val Returns¶ I32 val so_vm_sockets_buffer_min_size¶ [Source] fun box so_vm_sockets_buffer_min_size() : I32 val Returns¶ I32 val so_vm_sockets_buffer_size¶ [Source] fun box so_vm_sockets_buffer_size() : I32 val Returns¶ I32 val so_vm_sockets_connect_timeout¶ [Source] fun box so_vm_sockets_connect_timeout() : I32 val Returns¶ I32 val so_vm_sockets_nonblock_txrx¶ [Source] fun box so_vm_sockets_nonblock_txrx() : I32 val Returns¶ I32 val so_vm_sockets_peer_host_vm_id¶ [Source] fun box so_vm_sockets_peer_host_vm_id() : I32 val Returns¶ I32 val so_vm_sockets_trusted¶ [Source] fun box so_vm_sockets_trusted() : I32 val Returns¶ I32 val so_wantmore¶ [Source] fun box so_wantmore() : I32 val Returns¶ I32 val so_wantoobflag¶ [Source] fun box so_wantoobflag() : I32 val Returns¶ I32 val so_wifi_status¶ [Source] fun box so_wifi_status() : I32 val Returns¶ I32 val tcp6_mss¶ [Source] fun box tcp6_mss() : I32 val Returns¶ I32 val tcpci_flag_lossrecovery¶ [Source] fun box tcpci_flag_lossrecovery() : I32 val Returns¶ I32 val tcpci_flag_reordering_detected¶ [Source] fun box tcpci_flag_reordering_detected() : I32 val Returns¶ I32 val tcpci_opt_ecn¶ [Source] fun box tcpci_opt_ecn() : I32 val Returns¶ I32 val tcpci_opt_sack¶ [Source] fun box tcpci_opt_sack() : I32 val Returns¶ I32 val tcpci_opt_timestamps¶ [Source] fun box tcpci_opt_timestamps() : I32 val Returns¶ I32 val tcpci_opt_wscale¶ [Source] fun box tcpci_opt_wscale() : I32 val Returns¶ I32 val tcpf_ca_cwr¶ [Source] fun box tcpf_ca_cwr() : I32 val Returns¶ I32 val tcpf_ca_disorder¶ [Source] fun box tcpf_ca_disorder() : I32 val Returns¶ I32 val tcpf_ca_loss¶ [Source] fun box tcpf_ca_loss() : I32 val Returns¶ I32 val tcpf_ca_open¶ [Source] fun box tcpf_ca_open() : I32 val Returns¶ I32 val tcpf_ca_recovery¶ [Source] fun box tcpf_ca_recovery() : I32 val Returns¶ I32 val tcpi_opt_ecn¶ [Source] fun box tcpi_opt_ecn() : I32 val Returns¶ I32 val tcpi_opt_ecn_seen¶ [Source] fun box tcpi_opt_ecn_seen() : I32 val Returns¶ I32 val tcpi_opt_sack¶ [Source] fun box tcpi_opt_sack() : I32 val Returns¶ I32 val tcpi_opt_syn_data¶ [Source] fun box tcpi_opt_syn_data() : I32 val Returns¶ I32 val tcpi_opt_timestamps¶ [Source] fun box tcpi_opt_timestamps() : I32 val Returns¶ I32 val tcpi_opt_toe¶ [Source] fun box tcpi_opt_toe() : I32 val Returns¶ I32 val tcpi_opt_wscale¶ [Source] fun box tcpi_opt_wscale() : I32 val Returns¶ I32 val tcpolen_cc¶ [Source] fun box tcpolen_cc() : I32 val Returns¶ I32 val tcpolen_cc_appa¶ [Source] fun box tcpolen_cc_appa() : I32 val Returns¶ I32 val tcpolen_eol¶ [Source] fun box tcpolen_eol() : I32 val Returns¶ I32 val tcpolen_fastopen_req¶ [Source] fun box tcpolen_fastopen_req() : I32 val Returns¶ I32 val tcpolen_fast_open_empty¶ [Source] fun box tcpolen_fast_open_empty() : I32 val Returns¶ I32 val tcpolen_fast_open_max¶ [Source] fun box tcpolen_fast_open_max() : I32 val Returns¶ I32 val tcpolen_fast_open_min¶ [Source] fun box tcpolen_fast_open_min() : I32 val Returns¶ I32 val tcpolen_maxseg¶ [Source] fun box tcpolen_maxseg() : I32 val Returns¶ I32 val tcpolen_nop¶ [Source] fun box tcpolen_nop() : I32 val Returns¶ I32 val tcpolen_pad¶ [Source] fun box tcpolen_pad() : I32 val Returns¶ I32 val tcpolen_sack¶ [Source] fun box tcpolen_sack() : I32 val Returns¶ I32 val tcpolen_sackhdr¶ [Source] fun box tcpolen_sackhdr() : I32 val Returns¶ I32 val tcpolen_sack_permitted¶ [Source] fun box tcpolen_sack_permitted() : I32 val Returns¶ I32 val tcpolen_signature¶ [Source] fun box tcpolen_signature() : I32 val Returns¶ I32 val tcpolen_timestamp¶ [Source] fun box tcpolen_timestamp() : I32 val Returns¶ I32 val tcpolen_tstamp_appa¶ [Source] fun box tcpolen_tstamp_appa() : I32 val Returns¶ I32 val tcpolen_window¶ [Source] fun box tcpolen_window() : I32 val Returns¶ I32 val tcpopt_cc¶ [Source] fun box tcpopt_cc() : I32 val Returns¶ I32 val tcpopt_ccecho¶ [Source] fun box tcpopt_ccecho() : I32 val Returns¶ I32 val tcpopt_ccnew¶ [Source] fun box tcpopt_ccnew() : I32 val Returns¶ I32 val tcpopt_eol¶ [Source] fun box tcpopt_eol() : I32 val Returns¶ I32 val tcpopt_fastopen¶ [Source] fun box tcpopt_fastopen() : I32 val Returns¶ I32 val tcpopt_fast_open¶ [Source] fun box tcpopt_fast_open() : I32 val Returns¶ I32 val tcpopt_maxseg¶ [Source] fun box tcpopt_maxseg() : I32 val Returns¶ I32 val tcpopt_multipath¶ [Source] fun box tcpopt_multipath() : I32 val Returns¶ I32 val tcpopt_nop¶ [Source] fun box tcpopt_nop() : I32 val Returns¶ I32 val tcpopt_pad¶ [Source] fun box tcpopt_pad() : I32 val Returns¶ I32 val tcpopt_sack¶ [Source] fun box tcpopt_sack() : I32 val Returns¶ I32 val tcpopt_sack_hdr¶ [Source] fun box tcpopt_sack_hdr() : I32 val Returns¶ I32 val tcpopt_sack_permitted¶ [Source] fun box tcpopt_sack_permitted() : I32 val Returns¶ I32 val tcpopt_sack_permit_hdr¶ [Source] fun box tcpopt_sack_permit_hdr() : I32 val Returns¶ I32 val tcpopt_signature¶ [Source] fun box tcpopt_signature() : I32 val Returns¶ I32 val tcpopt_timestamp¶ [Source] fun box tcpopt_timestamp() : I32 val Returns¶ I32 val tcpopt_tstamp_hdr¶ [Source] fun box tcpopt_tstamp_hdr() : I32 val Returns¶ I32 val tcpopt_window¶ [Source] fun box tcpopt_window() : I32 val Returns¶ I32 val tcp_ca_name_max¶ [Source] fun box tcp_ca_name_max() : I32 val Returns¶ I32 val tcp_ccalgoopt¶ [Source] fun box tcp_ccalgoopt() : I32 val Returns¶ I32 val tcp_cc_info¶ [Source] fun box tcp_cc_info() : I32 val Returns¶ I32 val tcp_congestion¶ [Source] fun box tcp_congestion() : I32 val Returns¶ I32 val tcp_connectiontimeout¶ [Source] fun box tcp_connectiontimeout() : I32 val Returns¶ I32 val tcp_connection_info¶ [Source] fun box tcp_connection_info() : I32 val Returns¶ I32 val tcp_cookie_in_always¶ [Source] fun box tcp_cookie_in_always() : I32 val Returns¶ I32 val tcp_cookie_max¶ [Source] fun box tcp_cookie_max() : I32 val Returns¶ I32 val tcp_cookie_min¶ [Source] fun box tcp_cookie_min() : I32 val Returns¶ I32 val tcp_cookie_out_never¶ [Source] fun box tcp_cookie_out_never() : I32 val Returns¶ I32 val tcp_cookie_pair_size¶ [Source] fun box tcp_cookie_pair_size() : I32 val Returns¶ I32 val tcp_cookie_transactions¶ [Source] fun box tcp_cookie_transactions() : I32 val Returns¶ I32 val tcp_cork¶ [Source] fun box tcp_cork() : I32 val Returns¶ I32 val tcp_defer_accept¶ [Source] fun box tcp_defer_accept() : I32 val Returns¶ I32 val tcp_enable_ecn¶ [Source] fun box tcp_enable_ecn() : I32 val Returns¶ I32 val tcp_fastopen¶ [Source] fun box tcp_fastopen() : I32 val Returns¶ I32 val tcp_function_blk¶ [Source] fun box tcp_function_blk() : I32 val Returns¶ I32 val tcp_function_name_len_max¶ [Source] fun box tcp_function_name_len_max() : I32 val Returns¶ I32 val tcp_info¶ [Source] fun box tcp_info() : I32 val Returns¶ I32 val tcp_keepalive¶ [Source] fun box tcp_keepalive() : I32 val Returns¶ I32 val tcp_keepcnt¶ [Source] fun box tcp_keepcnt() : I32 val Returns¶ I32 val tcp_keepidle¶ [Source] fun box tcp_keepidle() : I32 val Returns¶ I32 val tcp_keepinit¶ [Source] fun box tcp_keepinit() : I32 val Returns¶ I32 val tcp_keepintvl¶ [Source] fun box tcp_keepintvl() : I32 val Returns¶ I32 val tcp_linger2¶ [Source] fun box tcp_linger2() : I32 val Returns¶ I32 val tcp_maxburst¶ [Source] fun box tcp_maxburst() : I32 val Returns¶ I32 val tcp_maxhlen¶ [Source] fun box tcp_maxhlen() : I32 val Returns¶ I32 val tcp_maxolen¶ [Source] fun box tcp_maxolen() : I32 val Returns¶ I32 val tcp_maxseg¶ [Source] fun box tcp_maxseg() : I32 val Returns¶ I32 val tcp_maxwin¶ [Source] fun box tcp_maxwin() : I32 val Returns¶ I32 val tcp_max_sack¶ [Source] fun box tcp_max_sack() : I32 val Returns¶ I32 val tcp_max_winshift¶ [Source] fun box tcp_max_winshift() : I32 val Returns¶ I32 val tcp_md5sig¶ [Source] fun box tcp_md5sig() : I32 val Returns¶ I32 val tcp_md5sig_maxkeylen¶ [Source] fun box tcp_md5sig_maxkeylen() : I32 val Returns¶ I32 val tcp_minmss¶ [Source] fun box tcp_minmss() : I32 val Returns¶ I32 val tcp_mss¶ [Source] fun box tcp_mss() : I32 val Returns¶ I32 val tcp_mss_default¶ [Source] fun box tcp_mss_default() : I32 val Returns¶ I32 val tcp_mss_desired¶ [Source] fun box tcp_mss_desired() : I32 val Returns¶ I32 val tcp_nodelay¶ [Source] fun box tcp_nodelay() : I32 val Returns¶ I32 val tcp_noopt¶ [Source] fun box tcp_noopt() : I32 val Returns¶ I32 val tcp_nopush¶ [Source] fun box tcp_nopush() : I32 val Returns¶ I32 val tcp_notsent_lowat¶ [Source] fun box tcp_notsent_lowat() : I32 val Returns¶ I32 val tcp_pcap_in¶ [Source] fun box tcp_pcap_in() : I32 val Returns¶ I32 val tcp_pcap_out¶ [Source] fun box tcp_pcap_out() : I32 val Returns¶ I32 val tcp_queue_seq¶ [Source] fun box tcp_queue_seq() : I32 val Returns¶ I32 val tcp_quickack¶ [Source] fun box tcp_quickack() : I32 val Returns¶ I32 val tcp_repair¶ [Source] fun box tcp_repair() : I32 val Returns¶ I32 val tcp_repair_options¶ [Source] fun box tcp_repair_options() : I32 val Returns¶ I32 val tcp_repair_queue¶ [Source] fun box tcp_repair_queue() : I32 val Returns¶ I32 val tcp_rxt_conndroptime¶ [Source] fun box tcp_rxt_conndroptime() : I32 val Returns¶ I32 val tcp_rxt_findrop¶ [Source] fun box tcp_rxt_findrop() : I32 val Returns¶ I32 val tcp_saved_syn¶ [Source] fun box tcp_saved_syn() : I32 val Returns¶ I32 val tcp_save_syn¶ [Source] fun box tcp_save_syn() : I32 val Returns¶ I32 val tcp_sendmoreacks¶ [Source] fun box tcp_sendmoreacks() : I32 val Returns¶ I32 val tcp_syncnt¶ [Source] fun box tcp_syncnt() : I32 val Returns¶ I32 val tcp_s_data_in¶ [Source] fun box tcp_s_data_in() : I32 val Returns¶ I32 val tcp_s_data_out¶ [Source] fun box tcp_s_data_out() : I32 val Returns¶ I32 val tcp_thin_dupack¶ [Source] fun box tcp_thin_dupack() : I32 val Returns¶ I32 val tcp_thin_linear_timeouts¶ [Source] fun box tcp_thin_linear_timeouts() : I32 val Returns¶ I32 val tcp_timestamp¶ [Source] fun box tcp_timestamp() : I32 val Returns¶ I32 val tcp_user_timeout¶ [Source] fun box tcp_user_timeout() : I32 val Returns¶ I32 val tcp_vendor¶ [Source] fun box tcp_vendor() : I32 val Returns¶ I32 val tcp_window_clamp¶ [Source] fun box tcp_window_clamp() : I32 val Returns¶ I32 val tipc_addr_id¶ [Source] fun box tipc_addr_id() : I32 val Returns¶ I32 val tipc_addr_mcast¶ [Source] fun box tipc_addr_mcast() : I32 val Returns¶ I32 val tipc_addr_name¶ [Source] fun box tipc_addr_name() : I32 val Returns¶ I32 val tipc_addr_nameseq¶ [Source] fun box tipc_addr_nameseq() : I32 val Returns¶ I32 val tipc_cfg_srv¶ [Source] fun box tipc_cfg_srv() : I32 val Returns¶ I32 val tipc_cluster_scope¶ [Source] fun box tipc_cluster_scope() : I32 val Returns¶ I32 val tipc_conn_shutdown¶ [Source] fun box tipc_conn_shutdown() : I32 val Returns¶ I32 val tipc_conn_timeout¶ [Source] fun box tipc_conn_timeout() : I32 val Returns¶ I32 val tipc_critical_importance¶ [Source] fun box tipc_critical_importance() : I32 val Returns¶ I32 val tipc_destname¶ [Source] fun box tipc_destname() : I32 val Returns¶ I32 val tipc_dest_droppable¶ [Source] fun box tipc_dest_droppable() : I32 val Returns¶ I32 val tipc_errinfo¶ [Source] fun box tipc_errinfo() : I32 val Returns¶ I32 val tipc_err_no_name¶ [Source] fun box tipc_err_no_name() : I32 val Returns¶ I32 val tipc_err_no_node¶ [Source] fun box tipc_err_no_node() : I32 val Returns¶ I32 val tipc_err_no_port¶ [Source] fun box tipc_err_no_port() : I32 val Returns¶ I32 val tipc_err_overload¶ [Source] fun box tipc_err_overload() : I32 val Returns¶ I32 val tipc_high_importance¶ [Source] fun box tipc_high_importance() : I32 val Returns¶ I32 val tipc_importance¶ [Source] fun box tipc_importance() : I32 val Returns¶ I32 val tipc_link_state¶ [Source] fun box tipc_link_state() : I32 val Returns¶ I32 val tipc_low_importance¶ [Source] fun box tipc_low_importance() : I32 val Returns¶ I32 val tipc_max_bearer_name¶ [Source] fun box tipc_max_bearer_name() : I32 val Returns¶ I32 val tipc_max_if_name¶ [Source] fun box tipc_max_if_name() : I32 val Returns¶ I32 val tipc_max_link_name¶ [Source] fun box tipc_max_link_name() : I32 val Returns¶ I32 val tipc_max_media_name¶ [Source] fun box tipc_max_media_name() : I32 val Returns¶ I32 val tipc_max_user_msg_size¶ [Source] fun box tipc_max_user_msg_size() : I32 val Returns¶ I32 val tipc_medium_importance¶ [Source] fun box tipc_medium_importance() : I32 val Returns¶ I32 val tipc_node_recvq_depth¶ [Source] fun box tipc_node_recvq_depth() : I32 val Returns¶ I32 val tipc_node_scope¶ [Source] fun box tipc_node_scope() : I32 val Returns¶ I32 val tipc_ok¶ [Source] fun box tipc_ok() : I32 val Returns¶ I32 val tipc_published¶ [Source] fun box tipc_published() : I32 val Returns¶ I32 val tipc_reserved_types¶ [Source] fun box tipc_reserved_types() : I32 val Returns¶ I32 val tipc_retdata¶ [Source] fun box tipc_retdata() : I32 val Returns¶ I32 val tipc_sock_recvq_depth¶ [Source] fun box tipc_sock_recvq_depth() : I32 val Returns¶ I32 val tipc_src_droppable¶ [Source] fun box tipc_src_droppable() : I32 val Returns¶ I32 val tipc_subscr_timeout¶ [Source] fun box tipc_subscr_timeout() : I32 val Returns¶ I32 val tipc_sub_cancel¶ [Source] fun box tipc_sub_cancel() : I32 val Returns¶ I32 val tipc_sub_ports¶ [Source] fun box tipc_sub_ports() : I32 val Returns¶ I32 val tipc_sub_service¶ [Source] fun box tipc_sub_service() : I32 val Returns¶ I32 val tipc_top_srv¶ [Source] fun box tipc_top_srv() : I32 val Returns¶ I32 val tipc_wait_forever¶ [Source] fun box tipc_wait_forever() : I32 val Returns¶ I32 val tipc_withdrawn¶ [Source] fun box tipc_withdrawn() : I32 val Returns¶ I32 val tipc_zone_scope¶ [Source] fun box tipc_zone_scope() : I32 val Returns¶ I32 val ttcp_client_snd_wnd¶ [Source] fun box ttcp_client_snd_wnd() : I32 val Returns¶ I32 val udp_cork¶ [Source] fun box udp_cork() : I32 val Returns¶ I32 val udp_encap¶ [Source] fun box udp_encap() : I32 val Returns¶ I32 val udp_encap_espinudp¶ [Source] fun box udp_encap_espinudp() : I32 val Returns¶ I32 val udp_encap_espinudp_maxfraglen¶ [Source] fun box udp_encap_espinudp_maxfraglen() : I32 val Returns¶ I32 val udp_encap_espinudp_non_ike¶ [Source] fun box udp_encap_espinudp_non_ike() : I32 val Returns¶ I32 val udp_encap_espinudp_port¶ [Source] fun box udp_encap_espinudp_port() : I32 val Returns¶ I32 val udp_encap_l2tpinudp¶ [Source] fun box udp_encap_l2tpinudp() : I32 val Returns¶ I32 val udp_nocksum¶ [Source] fun box udp_nocksum() : I32 val Returns¶ I32 val udp_no_check6_rx¶ [Source] fun box udp_no_check6_rx() : I32 val Returns¶ I32 val udp_no_check6_tx¶ [Source] fun box udp_no_check6_tx() : I32 val Returns¶ I32 val udp_vendor¶ [Source] fun box udp_vendor() : I32 val Returns¶ I32 val so_rcvtimeo_old¶ [Source] fun box so_rcvtimeo_old() : I32 val Returns¶ I32 val so_rcvtimeo_new¶ [Source] fun box so_rcvtimeo_new() : I32 val Returns¶ I32 val so_sndtimeo_old¶ [Source] fun box so_sndtimeo_old() : I32 val Returns¶ I32 val so_sndtimeo_new¶ [Source] fun box so_sndtimeo_new() : I32 val Returns¶ I32 val eq¶ [Source] fun box eq( that: OSSockOpt val) : Bool val Parameters¶ that: OSSockOpt val Returns¶ Bool val ne¶ [Source] fun box ne( that: OSSockOpt val) : Bool val Parameters¶ that: OSSockOpt val Returns¶ Bool val	pony	40208	https://da.wikipedia.org/wiki/Internet%20control%20message%20protocol	Internet control message protocol	Internet Control Message Protocol (ICMP) er en del af TCP/IP-protokolsuiten og er defineret i RFC 792. ICMP-beskeder bliver typisk genereret som svar på fejl i IP-datagrammer, for at diagnostikere et lokalnet og til "routing"-formål. Flere jævnligt brugte netværkshjælpeværktøjer fungerer ved hjælp af ICMP-beskeder. Mest kendt er nok hjælpeværktøjet "ping", med hvilket man kan "pinge" en anden TCP/IP-node. Ping benytter ICMP's "echo"- og "echo reply"-beskeder. En relateret kommando er "traceroute" (på Microsoft Windows-platforme "tracert") der fungerer ved at sende UDP-datagrammer med et manipuleret IP-time-to-live (TTL)-felt og derpå forventer ICMP's "time to live exceeded in transit"- og "destination unreachable"-beskeder som svar. ICMP-beskeder er kapslet ind i et IP-datagram og modtagelse er derfor ikke garanteret. Ekstern henvisning RFC792 (på engelsk) Internetteknologi	danish	0.866577
Pony/format-FormatFloat-.txt	FormatFloat¶ [Source] type FormatFloat is (FormatDefault val \| FormatExp val \| FormatExpLarge val \| FormatFix val \| FormatFixLarge val \| FormatGeneral val \| FormatGeneralLarge val) Type Alias For¶ (FormatDefault val \| FormatExp val \| FormatExpLarge val \| FormatFix val \| FormatFixLarge val \| FormatGeneral val \| FormatGeneralLarge val)	pony	8345842	https://sv.wikipedia.org/wiki/Vox-ATypI	Vox-ATypI	Vox-ATypI är ett klassificeringssystem inom typografi, utvecklat av Maximilien Vox 1954. Systemet har godkänts av Association Typographique Internationale som antog systemet 1962 (förkortat ATypI). Systemet antogs i Tyskland som DIN 16518 (1964) och i Storbritannien som British Standard 2961 (1967). Klasser och underklasser Klassiska Humanistiska Garald Transantikva Moderna typsnitt Didon Mekanistiska Linjära Groteska Neo-groteska Geometriska typsnitt Linjär-humanistiska Kalligrafiska stilar Glyfiska Skriftstil Grafiska Gotiska Gaeliska Icke-Latinska Källor Typografi Typsnitt	swedish	1.207359
Pony/src-signals-signal_handler-.txt	signal_handler.pony 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62use @pony_asio_event_create[AsioEventID]( owner: AsioEventNotify, fd: U32, flags: U32, nsec: U64, noisy: Bool) use @pony_asio_event_unsubscribe[None](event: AsioEventID) use @pony_asio_event_destroy[None](event: AsioEventID) actor SignalHandler is AsioEventNotify """ Listen for a specific signal. If the wait parameter is true, the program will not terminate until the SignalHandler's dispose method is called, or if the SignalNotify returns false, after handling the signal as this also disposes the SignalHandler and unsubscribes it. """ let _notify: SignalNotify let _sig: U32 var _event: AsioEventID new create(notify: SignalNotify iso, sig: U32, wait: Bool = false) => """ Create a signal handler. """ _notify = consume notify _sig = sig _event = @pony_asio_event_create(this, 0, AsioEvent.signal(), sig.u64(), wait) be raise() => """ Raise the signal. """ SignalRaise(_sig) be dispose() => """ Dispose of the signal handler. """ _dispose() be _event_notify(event: AsioEventID, flags: U32, arg: U32) => """ Called when the signal is received, or when the AsioEventID can be destroyed. """ if AsioEvent.disposable(flags) then @pony_asio_event_destroy(event) elseif event is _event then if not _notify(arg) then _dispose() end end fun ref _dispose() => """ Dispose of the AsioEventID. """ if not _event.is_null() then @pony_asio_event_unsubscribe(_event) _event = AsioEvent.none() _notify.dispose() end	pony	1842420	https://no.wikipedia.org/wiki/Avis%C3%A5ret%201831	Avisåret 1831	Avisåret 1831 er en oversikt over etableringer, nedleggelser, hendelser, prisvinnere og personer med tilknytning til aviser i 1831. Hendelser Etableringer Fødsler Referanser	norwegian_bokmål	1.219817
Pony/files-FileMkdir-.txt	FileMkdir¶ [Source] primitive val FileMkdir Constructors¶ create¶ [Source] new val create() : FileMkdir val^ Returns¶ FileMkdir val^ Public Functions¶ value¶ [Source] fun box value() : U32 val Returns¶ U32 val eq¶ [Source] fun box eq( that: FileMkdir val) : Bool val Parameters¶ that: FileMkdir val Returns¶ Bool val ne¶ [Source] fun box ne( that: FileMkdir val) : Bool val Parameters¶ that: FileMkdir val Returns¶ Bool val	pony	117735	https://da.wikipedia.org/wiki/NDoc	NDoc	NDoc er et dokumentationsværktøj rettet mod .NET-udviklingsplatformen. NDoc fungerer i høj grad som JavaDoc gør for Java. NDoc muliggør dokumentation for udviklere imellem, og benyttes derfor primært til at give en stringent specifikation af en mængde kodes funktionalitet og grænseflade. NDoc benytter eksterne XML filer som input og sammenholder disse med oversatte assemblies for at give et fuldstændigt billede af den udviklede kode. Opdelingen af kode og dokumentation gør det muligt at skrive (eller flot gennemlæse) dokumentation uden mulighed for at indføre fejl i selve kildekoden. Endvidere er det muligt at skrive, redigere og klargøre dokumentation i forskellige formater uden at skulle oversætte kildekoden på ny. Brug af værktøjet NDoc scanner en eller flere .NET assemblies via reflection for at finde informationer som klasser, namespaces etc. Disse informationer sammenholdes med selve dokumentationen som bliver gemt i et specielt XML format. NDoc giver brugeren mulighed for at skjule informationer i dokumentationen selvom de er blevet dokumenterede af en programmør. Derved er det muligt for f.eks. et firma at vedligeholde en fuldstændig dokumentation til intern brug og dele en mere begrænset version til eventuelle kunder og samarbejdspartnere. XML format Dette er ikke en fuldstændig gennemgang af de dokumentationsmuligheder NDoc giver, men blot en kort introduktion til tankegangen bag. Følgende er et eksempel på dokumentation i C#, det er dog også muligt at benytte NDoc i andre .NET sprog. /// <summary>Min klasse.. Printer Hello Wiki</summary> /// <remarks>Jeg har ingen bemærkninger</remarks> class MinKlasse { /// <param name="args">Argument til main. Bliver dog ikke brugt til noget</param> /// <returns>Et tal der altid er 1</returns> public static int Main(string[] args) { System.Console.WriteLine("Hello Wiki"); return 1; } } Som det fremgår af eksemplet benyttes /// til at markere at linje skal læses af NDoc. Det er også muligt at holde selve dokumentationen ude af kildekoden ved at lave eksterne referencer: /// <include file='mydoc.xml' path='Dokumentation/Klasser[@name="MinKlasse"]/*' /> class MinKlasse { public static int Main(string[] args) { System.Console.WriteLine("Hello Wiki"); return 1; } } Med en dertilhørerende dokumentations xml fil: Min klasse.. Printer Hello Wiki Jeg har ingen bemærkninger Generering af XML filer Idet kommentarer i koden bliver fjernet under oversættelse til assemblies er det nødvendigt at hente alle NDoc linjerne fra kildekoden ud i en ekstern xml fil ved eller før kildekoden bliver oversat. Dette kan gøres ved out'' parameteren på Microsoft C# oversætter eller ved brug af VBCommenter for VB.NET. Rettelser til dokumentation bør ikke foretages i den genererede XML fil da disse vil blive overskrevet ved næste oversættelse af kildekoden. Generering af dokumentation Det er muligt både at benytte NDoc på kommandolinjen og som en grafisk klient. For større projekter vil det ofte være praktisk at automatisere dokumentationen ved brug af NDoc via kommandolinjen. Visse output formater (se næste afsnit) kræver specielle andre programmer som skal hentes og installeres. Output formater NDoc kan generere dokumentationen i flere forskellige formater: JavaDoc: JavaDoc er Suns dokumentationsmetode og består af et frameset i HTML. LaTeX: Generering af Latex, der derefter kan oversættes til DVI, postscript eller PDF. LinearHTML: Simpel HTML struktur. MSDN: MSDN 2003: VS.NET 2003: XML''': Eksterne links NDoc Code Documentation Generator for .NET Udviklingsværktøjer Windows-software	danish	0.913861
Pony/src-builtin-signed-.txt	signed.pony 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940use @"llvm.sadd.with.overflow.i8"[(I8, Bool)](a: I8, b: I8) use @"llvm.sadd.with.overflow.i16"[(I16, Bool)](a: I16, b: I16) use @"llvm.sadd.with.overflow.i32"[(I32, Bool)](a: I32, b: I32) use @"llvm.sadd.with.overflow.i64"[(I64, Bool)](a: I64, b: I64) use @"llvm.sadd.with.overflow.i128"[(I128, Bool)](a: I128, b: I128) use @"llvm.ssub.with.overflow.i8"[(I8, Bool)](a: I8, b: I8) use @"llvm.ssub.with.overflow.i16"[(I16, Bool)](a: I16, b: I16) use @"llvm.ssub.with.overflow.i32"[(I32, Bool)](a: I32, b: I32) use @"llvm.ssub.with.overflow.i64"[(I64, Bool)](a: I64, b: I64) use @"llvm.ssub.with.overflow.i128"[(I128, Bool)](a: I128, b: I128) use @"llvm.smul.with.overflow.i8"[(I8, Bool)](a: I8, b: I8) use @"llvm.smul.with.overflow.i16"[(I16, Bool)](a: I16, b: I16) use @"llvm.smul.with.overflow.i32"[(I32, Bool)](a: I32, b: I32) use @"llvm.smul.with.overflow.i64"[(I64, Bool)](a: I64, b: I64) primitive I8 is SignedInteger[I8, U8] new create(value: I8) => value new from[A: (Number & Real[A] val)](a: A) => a.i8() new min_value() => -0x80 new max_value() => 0x7F fun abs(): U8 => if this < 0 then (-this).u8() else this.u8() end fun bit_reverse(): I8 => @"llvm.bitreverse.i8"(this.u8()).i8() fun bswap(): I8 => this fun popcount(): U8 => @"llvm.ctpop.i8"(this.u8()) fun clz(): U8 => @"llvm.ctlz.i8"(this.u8(), false) fun ctz(): U8 => @"llvm.cttz.i8"(this.u8(), false) fun clz_unsafe(): U8 => """ Unsafe operation. If this is 0, the result is undefined. """ @"llvm.ctlz.i8"(this.u8(), true) fun ctz_unsafe(): U8 => """ Unsafe operation. If this is 0, the result is undefined. """ @"llvm.cttz.i8"(this.u8(), true) fun bitwidth(): U8 => 8 fun bytewidth(): USize => bitwidth().usize() / 8 fun min(y: I8): I8 => if this < y then this else y end fun max(y: I8): I8 => if this > y then this else y end fun fld(y: I8): I8 => _SignedArithmetic.fld[I8, U8](this, y) fun fld_unsafe(y: I8): I8 => _SignedUnsafeArithmetic.fld_unsafe[I8, U8](this, y) fun mod(y: I8): I8 => _SignedArithmetic.mod[I8, U8](this, y) fun mod_unsafe(y: I8): I8 => _SignedUnsafeArithmetic.mod_unsafe[I8, U8](this, y) fun addc(y: I8): (I8, Bool) => @"llvm.sadd.with.overflow.i8"(this, y) fun subc(y: I8): (I8, Bool) => @"llvm.ssub.with.overflow.i8"(this, y) fun mulc(y: I8): (I8, Bool) => @"llvm.smul.with.overflow.i8"(this, y) fun divc(y: I8): (I8, Bool) => _SignedCheckedArithmetic.div_checked[I8, U8](this, y) fun remc(y: I8): (I8, Bool) => _SignedCheckedArithmetic.rem_checked[I8, U8](this, y) fun fldc(y: I8): (I8, Bool) => _SignedCheckedArithmetic.fld_checked[I8, U8](this, y) fun modc(y: I8): (I8, Bool) => _SignedCheckedArithmetic.mod_checked[I8, U8](this, y) fun add_partial(y: I8): I8 ? => _SignedPartialArithmetic.add_partial[I8](this, y)? fun sub_partial(y: I8): I8 ? => _SignedPartialArithmetic.sub_partial[I8](this, y)? fun mul_partial(y: I8): I8 ? => _SignedPartialArithmetic.mul_partial[I8](this, y)? fun div_partial(y: I8): I8 ? => _SignedPartialArithmetic.div_partial[I8, U8](this, y)? fun rem_partial(y: I8): I8 ? => _SignedPartialArithmetic.rem_partial[I8, U8](this, y)? fun divrem_partial(y: I8): (I8, I8) ? => _SignedPartialArithmetic.divrem_partial[I8, U8](this, y)? fun fld_partial(y: I8): I8 ? => _SignedPartialArithmetic.fld_partial[I8, U8](this, y)? fun mod_partial(y: I8): I8 ? => _SignedPartialArithmetic.mod_partial[I8, U8](this, y)? primitive I16 is SignedInteger[I16, U16] new create(value: I16) => value new from[A: (Number & Real[A] val)](a: A) => a.i16() new min_value() => -0x8000 new max_value() => 0x7FFF fun abs(): U16 => if this < 0 then (-this).u16() else this.u16() end fun bit_reverse(): I16 => @"llvm.bitreverse.i16"(this.u16()).i16() fun bswap(): I16 => @"llvm.bswap.i16"(this.u16()).i16() fun popcount(): U16 => @"llvm.ctpop.i16"(this.u16()) fun clz(): U16 => @"llvm.ctlz.i16"(this.u16(), false) fun ctz(): U16 => @"llvm.cttz.i16"(this.u16(), false) fun clz_unsafe(): U16 => """ Unsafe operation. If this is 0, the result is undefined. """ @"llvm.ctlz.i16"(this.u16(), true) fun ctz_unsafe(): U16 => """ Unsafe operation. If this is 0, the result is undefined. """ @"llvm.cttz.i16"(this.u16(), true) fun bitwidth(): U16 => 16 fun bytewidth(): USize => bitwidth().usize() / 8 fun min(y: I16): I16 => if this < y then this else y end fun max(y: I16): I16 => if this > y then this else y end fun fld(y: I16): I16 => _SignedArithmetic.fld[I16, U16](this, y) fun fld_unsafe(y: I16): I16 => _SignedUnsafeArithmetic.fld_unsafe[I16, U16](this, y) fun mod(y: I16): I16 => _SignedArithmetic.mod[I16, U16](this, y) fun mod_unsafe(y: I16): I16 => _SignedUnsafeArithmetic.mod_unsafe[I16, U16](this, y) fun addc(y: I16): (I16, Bool) => @"llvm.sadd.with.overflow.i16"(this, y) fun subc(y: I16): (I16, Bool) => @"llvm.ssub.with.overflow.i16"(this, y) fun mulc(y: I16): (I16, Bool) => @"llvm.smul.with.overflow.i16"(this, y) fun divc(y: I16): (I16, Bool) => _SignedCheckedArithmetic.div_checked[I16, U16](this, y) fun remc(y: I16): (I16, Bool) => _SignedCheckedArithmetic.rem_checked[I16, U16](this, y) fun fldc(y: I16): (I16, Bool) => _SignedCheckedArithmetic.fld_checked[I16, U16](this, y) fun modc(y: I16): (I16, Bool) => _SignedCheckedArithmetic.mod_checked[I16, U16](this, y) fun add_partial(y: I16): I16 ? => _SignedPartialArithmetic.add_partial[I16](this, y)? fun sub_partial(y: I16): I16 ? => _SignedPartialArithmetic.sub_partial[I16](this, y)? fun mul_partial(y: I16): I16 ? => _SignedPartialArithmetic.mul_partial[I16](this, y)? fun div_partial(y: I16): I16 ? => _SignedPartialArithmetic.div_partial[I16, U16](this, y)? fun rem_partial(y: I16): I16 ? => _SignedPartialArithmetic.rem_partial[I16, U16](this, y)? fun divrem_partial(y: I16): (I16, I16) ? => _SignedPartialArithmetic.divrem_partial[I16, U16](this, y)? fun fld_partial(y: I16): I16 ? => _SignedPartialArithmetic.fld_partial[I16, U16](this, y)? fun mod_partial(y: I16): I16 ? => _SignedPartialArithmetic.mod_partial[I16, U16](this, y)? primitive I32 is SignedInteger[I32, U32] new create(value: I32) => value new from[A: (Number & Real[A] val)](a: A) => a.i32() new min_value() => -0x8000_0000 new max_value() => 0x7FFF_FFFF fun abs(): U32 => if this < 0 then (-this).u32() else this.u32() end fun bit_reverse(): I32 => @"llvm.bitreverse.i32"(this.u32()).i32() fun bswap(): I32 => @"llvm.bswap.i32"(this.u32()).i32() fun popcount(): U32 => @"llvm.ctpop.i32"(this.u32()) fun clz(): U32 => @"llvm.ctlz.i32"(this.u32(), false) fun ctz(): U32 => @"llvm.cttz.i32"(this.u32(), false) fun clz_unsafe(): U32 => """ Unsafe operation. If this is 0, the result is undefined. """ @"llvm.ctlz.i32"(this.u32(), true) fun ctz_unsafe(): U32 => """ Unsafe operation. If this is 0, the result is undefined. """ @"llvm.cttz.i32"(this.u32(), true) fun bitwidth(): U32 => 32 fun bytewidth(): USize => bitwidth().usize() / 8 fun min(y: I32): I32 => if this < y then this else y end fun max(y: I32): I32 => if this > y then this else y end fun fld(y: I32): I32 => _SignedArithmetic.fld[I32, U32](this, y) fun fld_unsafe(y: I32): I32 => _SignedUnsafeArithmetic.fld_unsafe[I32, U32](this, y) fun mod(y: I32): I32 => _SignedArithmetic.mod[I32, U32](this, y) fun mod_unsafe(y: I32): I32 => _SignedUnsafeArithmetic.mod_unsafe[I32, U32](this, y) fun addc(y: I32): (I32, Bool) => @"llvm.sadd.with.overflow.i32"(this, y) fun subc(y: I32): (I32, Bool) => @"llvm.ssub.with.overflow.i32"(this, y) fun mulc(y: I32): (I32, Bool) => @"llvm.smul.with.overflow.i32"(this, y) fun divc(y: I32): (I32, Bool) => _SignedCheckedArithmetic.div_checked[I32, U32](this, y) fun remc(y: I32): (I32, Bool) => _SignedCheckedArithmetic.rem_checked[I32, U32](this, y) fun fldc(y: I32): (I32, Bool) => _SignedCheckedArithmetic.fld_checked[I32, U32](this, y) fun modc(y: I32): (I32, Bool) => _SignedCheckedArithmetic.mod_checked[I32, U32](this, y) fun add_partial(y: I32): I32 ? => _SignedPartialArithmetic.add_partial[I32](this, y)? fun sub_partial(y: I32): I32 ? => _SignedPartialArithmetic.sub_partial[I32](this, y)? fun mul_partial(y: I32): I32 ? => _SignedPartialArithmetic.mul_partial[I32](this, y)? fun div_partial(y: I32): I32 ? => _SignedPartialArithmetic.div_partial[I32, U32](this, y)? fun rem_partial(y: I32): I32 ? => _SignedPartialArithmetic.rem_partial[I32, U32](this, y)? fun divrem_partial(y: I32): (I32, I32) ? => _SignedPartialArithmetic.divrem_partial[I32, U32](this, y)? fun fld_partial(y: I32): I32 ? => _SignedPartialArithmetic.fld_partial[I32, U32](this, y)? fun mod_partial(y: I32): I32 ? => _SignedPartialArithmetic.mod_partial[I32, U32](this, y)? primitive I64 is SignedInteger[I64, U64] new create(value: I64) => value new from[A: (Number & Real[A] val)](a: A) => a.i64() new min_value() => -0x8000_0000_0000_0000 new max_value() => 0x7FFF_FFFF_FFFF_FFFF fun abs(): U64 => if this < 0 then (-this).u64() else this.u64() end fun bit_reverse(): I64 => @"llvm.bitreverse.i64"(this.u64()).i64() fun bswap(): I64 => @"llvm.bswap.i64"(this.u64()).i64() fun popcount(): U64 => @"llvm.ctpop.i64"(this.u64()) fun clz(): U64 => @"llvm.ctlz.i64"(this.u64(), false) fun ctz(): U64 => @"llvm.cttz.i64"(this.u64(), false) fun clz_unsafe(): U64 => """ Unsafe operation. If this is 0, the result is undefined. """ @"llvm.ctlz.i64"(this.u64(), true) fun ctz_unsafe(): U64 => """ Unsafe operation. If this is 0, the result is undefined. """ @"llvm.cttz.i64"(this.u64(), true) fun bitwidth(): U64 => 64 fun bytewidth(): USize => bitwidth().usize() / 8 fun min(y: I64): I64 => if this < y then this else y end fun max(y: I64): I64 => if this > y then this else y end fun fld(y: I64): I64 => _SignedArithmetic.fld[I64, U64](this, y) fun fld_unsafe(y: I64): I64 => _SignedUnsafeArithmetic.fld_unsafe[I64, U64](this, y) fun mod(y: I64): I64 => _SignedArithmetic.mod[I64, U64](this, y) fun mod_unsafe(y: I64): I64 => _SignedUnsafeArithmetic.mod_unsafe[I64, U64](this, y) fun hash(): USize => u64().hash() fun addc(y: I64): (I64, Bool) => @"llvm.sadd.with.overflow.i64"(this, y) fun subc(y: I64): (I64, Bool) => @"llvm.ssub.with.overflow.i64"(this, y) fun mulc(y: I64): (I64, Bool) => _SignedCheckedArithmetic._mul_checked[U64, I64](this, y) fun divc(y: I64): (I64, Bool) => _SignedCheckedArithmetic.div_checked[I64, U64](this, y) fun remc(y: I64): (I64, Bool) => _SignedCheckedArithmetic.rem_checked[I64, U64](this, y) fun fldc(y: I64): (I64, Bool) => _SignedCheckedArithmetic.fld_checked[I64, U64](this, y) fun modc(y: I64): (I64, Bool) => _SignedCheckedArithmetic.mod_checked[I64, U64](this, y) fun add_partial(y: I64): I64 ? => _SignedPartialArithmetic.add_partial[I64](this, y)? fun sub_partial(y: I64): I64 ? => _SignedPartialArithmetic.sub_partial[I64](this, y)? fun mul_partial(y: I64): I64 ? => _SignedPartialArithmetic.mul_partial[I64](this, y)? fun div_partial(y: I64): I64 ? => _SignedPartialArithmetic.div_partial[I64, U64](this, y)? fun rem_partial(y: I64): I64 ? => _SignedPartialArithmetic.rem_partial[I64, U64](this, y)? fun divrem_partial(y: I64): (I64, I64) ? => _SignedPartialArithmetic.divrem_partial[I64, U64](this, y)? fun fld_partial(y: I64): I64 ? => _SignedPartialArithmetic.fld_partial[I64, U64](this, y)? fun mod_partial(y: I64): I64 ? => _SignedPartialArithmetic.mod_partial[I64, U64](this, y)? primitive ILong is SignedInteger[ILong, ULong] new create(value: ILong) => value new from[A: (Number & Real[A] val)](a: A) => a.ilong() new min_value() => ifdef ilp32 or llp64 then -0x8000_0000 else -0x8000_0000_0000_0000 end new max_value() => ifdef ilp32 or llp64 then 0x7FFF_FFFF else 0x7FFF_FFFF_FFFF_FFFF end fun abs(): ULong => if this < 0 then (-this).ulong() else this.ulong() end fun bit_reverse(): ILong => ifdef ilp32 or llp64 then @"llvm.bitreverse.i32"(this.u32()).ilong() else @"llvm.bitreverse.i64"(this.u64()).ilong() end fun bswap(): ILong => ifdef ilp32 or llp64 then @"llvm.bswap.i32"(this.u32()).ilong() else @"llvm.bswap.i64"(this.u64()).ilong() end fun popcount(): ULong => ifdef ilp32 or llp64 then @"llvm.ctpop.i32"(this.u32()).ulong() else @"llvm.ctpop.i64"(this.u64()).ulong() end fun clz(): ULong => ifdef ilp32 or llp64 then @"llvm.ctlz.i32"(this.u32(), false).ulong() else @"llvm.ctlz.i64"(this.u64(), false).ulong() end fun ctz(): ULong => ifdef ilp32 or llp64 then @"llvm.cttz.i32"(this.u32(), false).ulong() else @"llvm.cttz.i64"(this.u64(), false).ulong() end fun clz_unsafe(): ULong => ifdef ilp32 or llp64 then @"llvm.ctlz.i32"(this.u32(), true).ulong() else @"llvm.ctlz.i64"(this.u64(), true).ulong() end fun ctz_unsafe(): ULong => ifdef ilp32 or llp64 then @"llvm.cttz.i32"(this.u32(), false).ulong() else @"llvm.cttz.i64"(this.u64(), true).ulong() end fun bitwidth(): ULong => ifdef ilp32 or llp64 then 32 else 64 end fun bytewidth(): USize => bitwidth().usize() / 8 fun min(y: ILong): ILong => if this < y then this else y end fun max(y: ILong): ILong => if this > y then this else y end fun fld(y: ILong): ILong => _SignedArithmetic.fld[ILong, ULong](this, y) fun fld_unsafe(y: ILong): ILong => _SignedUnsafeArithmetic.fld_unsafe[ILong, ULong](this, y) fun mod(y: ILong): ILong => _SignedArithmetic.mod[ILong, ULong](this, y) fun mod_unsafe(y: ILong): ILong => _SignedUnsafeArithmetic.mod_unsafe[ILong, ULong](this, y) fun hash(): USize => ulong().hash() fun addc(y: ILong): (ILong, Bool) => ifdef ilp32 or llp64 then (let r, let o) = @"llvm.sadd.with.overflow.i32"(this.i32(), y.i32()) (r.ilong(), o) else (let r, let o) = @"llvm.sadd.with.overflow.i64"(this.i64(), y.i64()) (r.ilong(), o) end fun subc(y: ILong): (ILong, Bool) => ifdef ilp32 or llp64 then (let r, let o) = @"llvm.ssub.with.overflow.i32"(this.i32(), y.i32()) (r.ilong(), o) else (let r, let o) = @"llvm.ssub.with.overflow.i64"(this.i64(), y.i64()) (r.ilong(), o) end fun mulc(y: ILong): (ILong, Bool) => ifdef ilp32 or llp64 then (let r, let o) = @"llvm.smul.with.overflow.i32"(this.i32(), y.i32()) (r.ilong(), o) else _SignedCheckedArithmetic._mul_checked[ULong, ILong](this, y) end fun divc(y: ILong): (ILong, Bool) => _SignedCheckedArithmetic.div_checked[ILong, ULong](this, y) fun remc(y: ILong): (ILong, Bool) => _SignedCheckedArithmetic.rem_checked[ILong, ULong](this, y) fun fldc(y: ILong): (ILong, Bool) => _SignedCheckedArithmetic.fld_checked[ILong, ULong](this, y) fun modc(y: ILong): (ILong, Bool) => _SignedCheckedArithmetic.mod_checked[ILong, ULong](this, y) fun add_partial(y: ILong): ILong ? => _SignedPartialArithmetic.add_partial[ILong](this, y)? fun sub_partial(y: ILong): ILong ? => _SignedPartialArithmetic.sub_partial[ILong](this, y)? fun mul_partial(y: ILong): ILong ? => _SignedPartialArithmetic.mul_partial[ILong](this, y)? fun div_partial(y: ILong): ILong ? => _SignedPartialArithmetic.div_partial[ILong, ULong](this, y)? fun rem_partial(y: ILong): ILong ? => _SignedPartialArithmetic.rem_partial[ILong, ULong](this, y)? fun divrem_partial(y: ILong): (ILong, ILong) ? => _SignedPartialArithmetic.divrem_partial[ILong, ULong](this, y)? fun fld_partial(y: ILong): ILong ? => _SignedPartialArithmetic.fld_partial[ILong, ULong](this, y)? fun mod_partial(y: ILong): ILong ? => _SignedPartialArithmetic.mod_partial[ILong, ULong](this, y)? primitive ISize is SignedInteger[ISize, USize] new create(value: ISize) => value new from[A: (Number & Real[A] val)](a: A) => a.isize() new min_value() => ifdef ilp32 then -0x8000_0000 else -0x8000_0000_0000_0000 end new max_value() => ifdef ilp32 then 0x7FFF_FFFF else 0x7FFF_FFFF_FFFF_FFFF end fun abs(): USize => if this < 0 then (-this).usize() else this.usize() end fun bit_reverse(): ISize => ifdef ilp32 then @"llvm.bitreverse.i32"(this.u32()).isize() else @"llvm.bitreverse.i64"(this.u64()).isize() end fun bswap(): ISize => ifdef ilp32 then @"llvm.bswap.i32"(this.u32()).isize() else @"llvm.bswap.i64"(this.u64()).isize() end fun popcount(): USize => ifdef ilp32 then @"llvm.ctpop.i32"(this.u32()).usize() else @"llvm.ctpop.i64"(this.u64()).usize() end fun clz(): USize => ifdef ilp32 then @"llvm.ctlz.i32"(this.u32(), false).usize() else @"llvm.ctlz.i64"(this.u64(), false).usize() end fun ctz(): USize => ifdef ilp32 then @"llvm.cttz.i32"(this.u32(), false).usize() else @"llvm.cttz.i64"(this.u64(), false).usize() end fun clz_unsafe(): USize => ifdef ilp32 then @"llvm.ctlz.i32"(this.u32(), true).usize() else @"llvm.ctlz.i64"(this.u64(), true).usize() end fun ctz_unsafe(): USize => ifdef ilp32 then @"llvm.cttz.i32"(this.u32(), true).usize() else @"llvm.cttz.i64"(this.u64(), true).usize() end fun bitwidth(): USize => ifdef ilp32 then 32 else 64 end fun bytewidth(): USize => bitwidth().usize() / 8 fun min(y: ISize): ISize => if this < y then this else y end fun max(y: ISize): ISize => if this > y then this else y end fun fld(y: ISize): ISize => _SignedArithmetic.fld[ISize, USize](this, y) fun fld_unsafe(y: ISize): ISize => _SignedUnsafeArithmetic.fld_unsafe[ISize, USize](this, y) fun mod(y: ISize): ISize => _SignedArithmetic.mod[ISize, USize](this, y) fun mod_unsafe(y: ISize): ISize => _SignedUnsafeArithmetic.mod_unsafe[ISize, USize](this, y) fun addc(y: ISize): (ISize, Bool) => ifdef ilp32 then (let r, let o) = @"llvm.sadd.with.overflow.i32"(this.i32(), y.i32()) (r.isize(), o) else (let r, let o) = @"llvm.sadd.with.overflow.i64"(this.i64(), y.i64()) (r.isize(), o) end fun subc(y: ISize): (ISize, Bool) => ifdef ilp32 then (let r, let o) = @"llvm.ssub.with.overflow.i32"(this.i32(), y.i32()) (r.isize(), o) else (let r, let o) = @"llvm.ssub.with.overflow.i64"(this.i64(), y.i64()) (r.isize(), o) end fun mulc(y: ISize): (ISize, Bool) => ifdef ilp32 then (let r, let o) = @"llvm.smul.with.overflow.i32"(this.i32(), y.i32()) (r.isize(), o) else _SignedCheckedArithmetic._mul_checked[USize, ISize](this, y) end fun divc(y: ISize): (ISize, Bool) => _SignedCheckedArithmetic.div_checked[ISize, USize](this, y) fun remc(y: ISize): (ISize, Bool) => _SignedCheckedArithmetic.rem_checked[ISize, USize](this, y) fun fldc(y: ISize): (ISize, Bool) => _SignedCheckedArithmetic.fld_checked[ISize, USize](this, y) fun modc(y: ISize): (ISize, Bool) => _SignedCheckedArithmetic.mod_checked[ISize, USize](this, y) fun add_partial(y: ISize): ISize ? => _SignedPartialArithmetic.add_partial[ISize](this, y)? fun sub_partial(y: ISize): ISize ? => _SignedPartialArithmetic.sub_partial[ISize](this, y)? fun mul_partial(y: ISize): ISize ? => _SignedPartialArithmetic.mul_partial[ISize](this, y)? fun div_partial(y: ISize): ISize ? => _SignedPartialArithmetic.div_partial[ISize, USize](this, y)? fun rem_partial(y: ISize): ISize ? => _SignedPartialArithmetic.rem_partial[ISize, USize](this, y)? fun divrem_partial(y: ISize): (ISize, ISize) ? => _SignedPartialArithmetic.divrem_partial[ISize, USize](this, y)? fun fld_partial(y: ISize): ISize ? => _SignedPartialArithmetic.fld_partial[ISize, USize](this, y)? fun mod_partial(y: ISize): ISize ? => _SignedPartialArithmetic.mod_partial[ISize, USize](this, y)? primitive I128 is SignedInteger[I128, U128] new create(value: I128) => value new from[A: (Number & Real[A] val)](a: A) => a.i128() new min_value() => -0x8000_0000_0000_0000_0000_0000_0000_0000 new max_value() => 0x7FFF_FFFF_FFFF_FFFF_FFFF_FFFF_FFFF_FFFF fun abs(): U128 => if this < 0 then (-this).u128() else this.u128() end fun bit_reverse(): I128 => @"llvm.bitreverse.i128"(this.u128()).i128() fun bswap(): I128 => @"llvm.bswap.i128"(this.u128()).i128() fun popcount(): U128 => @"llvm.ctpop.i128"(this.u128()) fun clz(): U128 => @"llvm.ctlz.i128"(this.u128(), false) fun ctz(): U128 => @"llvm.cttz.i128"(this.u128(), false) fun clz_unsafe(): U128 => """ Unsafe operation. If this is 0, the result is undefined. """ @"llvm.ctlz.i128"(this.u128(), true) fun ctz_unsafe(): U128 => """ Unsafe operation. If this is 0, the result is undefined. """ @"llvm.cttz.i128"(this.u128(), true) fun bitwidth(): U128 => 128 fun bytewidth(): USize => bitwidth().usize() / 8 fun min(y: I128): I128 => if this < y then this else y end fun max(y: I128): I128 => if this > y then this else y end fun fld(y: I128): I128 => _SignedArithmetic.fld[I128, U128](this, y) fun fld_unsafe(y: I128): I128 => _SignedUnsafeArithmetic.fld_unsafe[I128, U128](this, y) fun mod(y: I128): I128 => _SignedArithmetic.mod[I128, U128](this, y) fun mod_unsafe(y: I128): I128 => _SignedUnsafeArithmetic.mod_unsafe[I128, U128](this, y) fun hash(): USize => u128().hash() fun hash64(): U64 => u128().hash64() fun string(): String iso^ => _ToString._u128(abs().u128(), this < 0) fun mul(y: I128): I128 => (u128() * y.u128()).i128() fun divrem(y: I128): (I128, I128) => ifdef native128 then (this / y, this % y) else if y == 0 then return (0, 0) end var num: I128 = if this >= 0 then this else -this end var den: I128 = if y >= 0 then y else -y end (let q, let r) = num.u128().divrem(den.u128()) (var q', var r') = (q.i128(), r.i128()) if this < 0 then r' = -r' if y > 0 then q' = -q' end elseif y < 0 then q' = -q' end (q', r') end fun div(y: I128): I128 => ifdef native128 then this / y else (let q, let r) = divrem(y) q end fun rem(y: I128): I128 => ifdef native128 then this % y else (let q, let r) = divrem(y) r end fun mul_unsafe(y: I128): I128 => """ Unsafe operation. If the operation overflows, the result is undefined. """ ifdef native128 then this ~ y else this y end fun divrem_unsafe(y: I128): (I128, I128) => """ Unsafe operation. If y is 0, the result is undefined. If the operation overflows, the result is undefined. """ ifdef native128 then (this *~ y, this /~ y) else divrem(y) end fun div_unsafe(y: I128): I128 => """ Unsafe operation. If y is 0, the result is undefined. If the operation overflows, the result is undefined. """ ifdef native128 then this /~ y else this / y end fun rem_unsafe(y: I128): I128 => """ Unsafe operation. If y is 0, the result is undefined. If the operation overflows, the result is undefined. """ ifdef native128 then this %~ y else this % y end fun f32(): F32 => f64().f32() fun f64(): F64 => if this < 0 then -(-u128()).f64() else u128().f64() end fun f32_unsafe(): F32 => """ Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. """ f64_unsafe().f32_unsafe() fun f64_unsafe(): F64 => """ Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. """ f64() fun addc(y: I128): (I128, Bool) => ifdef native128 then @"llvm.sadd.with.overflow.i128"(this, y) else let overflow = if y > 0 then (this > (max_value() - y)) else (this < (min_value() - y)) end (this + y, overflow) end fun subc(y: I128): (I128, Bool) => ifdef native128 then @"llvm.ssub.with.overflow.i128"(this, y) else let overflow = if y > 0 then (this < (min_value() + y)) else (this > (max_value() + y)) end (this - y, overflow) end fun mulc(y: I128): (I128, Bool) => // using llvm.smul.with.overflow.i128 would require to link // llvm compiler-rt where the function implementing it lives: https://github.com/llvm-mirror/compiler-rt/blob/master/lib/builtins/muloti4.c // See this bug for reference: // the following implementation is more or less exactly was __muloti4 is // doing _SignedCheckedArithmetic._mul_checked[U128, I128](this, y) fun divc(y: I128): (I128, Bool) => _SignedCheckedArithmetic.div_checked[I128, U128](this, y) fun remc(y: I128): (I128, Bool) => _SignedCheckedArithmetic.rem_checked[I128, U128](this, y) fun fldc(y: I128): (I128, Bool) => _SignedCheckedArithmetic.fld_checked[I128, U128](this, y) fun modc(y: I128): (I128, Bool) => _SignedCheckedArithmetic.mod_checked[I128, U128](this, y) fun add_partial(y: I128): I128 ? => _SignedPartialArithmetic.add_partial[I128](this, y)? fun sub_partial(y: I128): I128 ? => _SignedPartialArithmetic.sub_partial[I128](this, y)? fun mul_partial(y: I128): I128 ? => _SignedPartialArithmetic.mul_partial[I128](this, y)? fun div_partial(y: I128): I128 ? => _SignedPartialArithmetic.div_partial[I128, U128](this, y)? fun rem_partial(y: I128): I128 ? => _SignedPartialArithmetic.rem_partial[I128, U128](this, y)? fun divrem_partial(y: I128): (I128, I128) ? => _SignedPartialArithmetic.divrem_partial[I128, U128](this, y)? fun fld_partial(y: I128): I128 ? => _SignedPartialArithmetic.fld_partial[I128, U128](this, y)? fun mod_partial(y: I128): I128 ? => _SignedPartialArithmetic.mod_partial[I128, U128](this, y)? type Signed is (I8 \| I16 \| I32 \| I64 \| I128 \| ILong \| ISize)	pony	137581	https://nn.wikipedia.org/wiki/Fibonaccif%C3%B8lgja	Fibonaccifølgja	Fibonaccifølgja er ei følgje av tal der kvart tal unntatt dei to første er summen av dei to føregåande. I sin vidaste definisjon kan dei to første tala vere kva som helst, men mest vanleg er å starte på anten 1 og 1 eller 0 og 1: eller . Historie Fibonaccifølgja har namn etter Leonardo Fibonacci sitt forsøk på å beskrive populasjonsvekst hjå ei tenkt gruppe kaninar. Ho blei likevel omtalt mykje tidlegare. Innan gammal indisk matematikk blei ho brukt til å studera prosodi i sanskrit. Innan verselæra på sanskrit ønska ein å finna alle mønster av lange (L) stavingar som er 2 einingar lange, og korte (K) stavingar som er 1 eining lang. Tel ein dei ulike mønstera av L og K med ei viss lengd får ein fibonaccifølgja: Talet på mønster som er m korte statvingar lang er fibonaccitalet Fm + 1. Å finne fibonaccifølgja Følgjande program i programmeringsspråket C genererer følgja av fibonaccital som ikkje overstig den maksimale verdien av den største heiltalsdatatypen i standardbiblioteket til C99. Dei to første tala er frivillige argument på kommandolinja. #include <stdio.h> #include <stdint.h> int main(int argc, char *argv[]){ uintmax_t i=1, j=1; if(argc == 3){ i = strtoll(argv[1], NULL, 0); j = strtoll(argv[2], NULL, 0); } printf("%llu", i); do{ printf("\n%llu", j); i = i + j; if(i < j) break; printf("\n%llu", i); j = j + i; }while(j > i); putchar('\n'); return 0; } Med to eitt-tal som start og 64 bit øvre talgrense, kjem desse 93 tala ut. Dette tek omkring 2 - 10 millisekund på ein moderne PC. 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765 10946 17711 28657 46368 75025 121393 196418 317811 514229 832040 1346269 2178309 3524578 5702887 9227465 14930352 24157817 39088169 63245986 102334155 165580141 267914296 433494437 701408733 1134903170 1836311903 2971215073 4807526976 7778742049 12586269025 20365011074 32951280099 53316291173 86267571272 139583862445 225851433717 365435296162 591286729879 956722026041 1548008755920 2504730781961 4052739537881 6557470319842 10610209857723 17167680177565 27777890035288 44945570212853 72723460248141 117669030460994 190392490709135 308061521170129 498454011879264 806515533049393 1304969544928657 2111485077978050 3416454622906707 5527939700884757 8944394323791464 14472334024676221 23416728348467685 37889062373143906 61305790721611591 99194853094755497 160500643816367088 259695496911122585 420196140727489673 679891637638612258 1100087778366101931 1779979416004714189 2880067194370816120 4660046610375530309 7540113804746346429 12200160415121876738 Kjelder . . . . Heiltalsfølgjer Matematiske relasjonar Rekursjon	norwegian_nynorsk	0.590057
Pony/process-ChdirError-.txt	ChdirError¶ [Source] primitive val ChdirError Constructors¶ create¶ [Source] new val create() : ChdirError val^ Returns¶ ChdirError val^ Public Functions¶ string¶ [Source] fun box string() : String iso^ Returns¶ String iso^ eq¶ [Source] fun box eq( that: ChdirError val) : Bool val Parameters¶ that: ChdirError val Returns¶ Bool val ne¶ [Source] fun box ne( that: ChdirError val) : Bool val Parameters¶ that: ChdirError val Returns¶ Bool val	pony	2140886	https://sv.wikipedia.org/wiki/Eobrolgus	Eobrolgus	Eobrolgus är ett släkte av kräftdjur. Eobrolgus ingår i familjen Phoxocephalidae. Kladogram enligt Catalogue of Life: Källor Externa länkar Märlkräftor Eobrolgus	swedish	1.040858
Pony/src-collections-persistent-map-.txt	map.pony 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175use mut = "collections" type Map[K: (mut.Hashable val & Equatable[K]), V: Any #share] is HashMap[K, V, mut.HashEq[K]] """ A map that uses structural equality on the key. """ type MapIs[K: Any #share, V: Any #share] is HashMap[K, V, mut.HashIs[K]] """ A map that uses identity comparison on the key. """ class val HashMap[K: Any #share, V: Any #share, H: mut.HashFunction[K] val] """ A persistent map based on the Compressed Hash Array Mapped Prefix-tree from 'Optimizing Hash-Array Mapped Tries for Fast and Lean Immutable JVM Collections' by Michael J. Steindorfer and Jurgen J. Vinju ## Usage ```pony use "collections/persistent" actor Main new create(env: Env) => try let m1 = Map[String, U32] // {} // Update returns a new map with the provided key set // to the provided value. The old map is unchanged. let m2 = m1("a") = 5 // {a: 5} let m3 = m2("b") = 10 // {a: 5, b: 10} let m4 = m3.remove("a")? // {b: 10} // You can create a new map from key value pairs. let m5 = Map[String, U32].concat([("a", 2); ("b", 3)].values()) // {a: 2, b: 3} end ``` """ let _root: _MapSubNodes[K, V, H] let _size: USize new val create() => _root = _MapSubNodes[K, V, H] _size = 0 new val _create(r: _MapSubNodes[K, V, H], s: USize) => _root = r _size = s fun val apply(k: K): val->V ? => """ Attempt to get the value corresponding to k. """ _root(0, H.hash(k).u32(), k)? as V fun val size(): USize => """ Return the amount of key-value pairs in the Map. """ _size fun val update(key: K, value: val->V): HashMap[K, V, H] => """ Update the value associated with the provided key. """ (let r, let insertion) = try _root.update(0, H.hash(key).u32(), key, value)? else (_root, false) // should not occur end let s = if insertion then _size + 1 else _size end _create(r, s) fun val remove(k: K): HashMap[K, V, H] ? => """ Try to remove the provided key from the Map. """ _create(_root.remove(0, H.hash(k).u32(), k)?, _size - 1) fun val get_or_else(k: K, alt: val->V): val->V => """ Get the value associated with provided key if present. Otherwise, return the provided alternate value. """ try match _root(0, H.hash(k).u32(), k)? \| let v: V => v else alt end else alt // should not occur end fun val contains(k: K): Bool => """ Check whether the node contains the provided key. """ try _root(0, H.hash(k).u32(), k)? isnt None else false // should not occur end fun val concat(iter: Iterator[(val->K, val->V)]): HashMap[K, V, H] => """ Add the K, V pairs from the given iterator to the map. """ var m = this for (k, v) in iter do m = m.update(k, v) end m fun val add(key: K, value: val->V): HashMap[K, V, H] => """ Return this Map with the given (key, value) mapping. """ update(key, value) fun val sub(key: K): HashMap[K, V, H] => """ Return this Map without the given key. """ try remove(key)? else this end fun val keys(): MapKeys[K, V, H] => MapKeys[K, V, H](this) fun val values(): MapValues[K, V, H] => MapValues[K, V, H](this) fun val pairs(): MapPairs[K, V, H] => MapPairs[K, V, H](this) fun _root_node(): _MapSubNodes[K, V, H] => _root class MapKeys[K: Any #share, V: Any #share, H: mut.HashFunction[K] val] embed _pairs: MapPairs[K, V, H] new create(m: HashMap[K, V, H]) => _pairs = MapPairs[K, V, H](m) fun has_next(): Bool => _pairs.has_next() fun ref next(): K ? => _pairs.next()?._1 class MapValues[K: Any #share, V: Any #share, H: mut.HashFunction[K] val] embed _pairs: MapPairs[K, V, H] new create(m: HashMap[K, V, H]) => _pairs = MapPairs[K, V, H](m) fun has_next(): Bool => _pairs.has_next() fun ref next(): val->V ? => _pairs.next()?._2 interface _MapIter[K: Any #share, V: Any #share, H: mut.HashFunction[K] val] is Iterator[(_MapEntry[K, V, H] \| _MapIter[K, V, H])] class MapPairs[K: Any #share, V: Any #share, H: mut.HashFunction[K] val] embed _stack: Array[_MapIter[K, V, H]] = [] new create(m: HashMap[K, V, H]) => _stack.push(m._root_node().iter()) fun has_next(): Bool => _stack.size() > 0 fun ref next(): (K, V) ? => let iter = _stack(_stack.size() - 1)? let x = iter.next()? if not iter.has_next() then _stack.pop()? end match x \| let e: _MapEntry[K, V, H] => (e.key, e.value) \| let i: _MapIter[K, V, H] => _stack.push(i) next()? end	pony	3824610	https://sv.wikipedia.org/wiki/Hister%20paykullii	Hister paykullii	Hister paykullii är en skalbaggsart som beskrevs av Kirby 1837. Hister paykullii ingår i släktet Hister och familjen stumpbaggar. Inga underarter finns listade i Catalogue of Life. Källor Stumpbaggar paykullii	swedish	1.239612
Pony/pony_check-Randomness-.txt	Randomness¶ [Source] Source of randomness, providing methods for generatic uniformly distributed values from a given closed interval: [min, max] in order for the user to be able to generate every possible value for a given primitive numeric type. All primitive number method create numbers in range [min, max) class ref Randomness Constructors¶ create¶ [Source] new ref create( seed1: U64 val = 42, seed2: U64 val = 0) : Randomness ref^ Parameters¶ seed1: U64 val = 42 seed2: U64 val = 0 Returns¶ Randomness ref^ Public Functions¶ u8¶ [Source] Generate a U8 in closed interval [min, max] (default: [min_value, max_value]). Behavior is undefined if min > max. fun ref u8( min: U8 val = call, max: U8 val = call) : U8 val Parameters¶ min: U8 val = call max: U8 val = call Returns¶ U8 val u16¶ [Source] Generate a U16 in closed interval [min, max] (default: [min_value, max_value]). Behavior is undefined if min > max. fun ref u16( min: U16 val = call, max: U16 val = call) : U16 val Parameters¶ min: U16 val = call max: U16 val = call Returns¶ U16 val u32¶ [Source] Generate a U32 in closed interval [min, max] (default: [min_value, max_value]). Behavior is undefined if min > max. fun ref u32( min: U32 val = call, max: U32 val = call) : U32 val Parameters¶ min: U32 val = call max: U32 val = call Returns¶ U32 val u64¶ [Source] Generate a U64 in closed interval [min, max] (default: [min_value, max_value]). Behavior is undefined if min > max. fun ref u64( min: U64 val = call, max: U64 val = call) : U64 val Parameters¶ min: U64 val = call max: U64 val = call Returns¶ U64 val u128¶ [Source] Generate a U128 in closed interval [min, max] (default: [min_value, max_value]). Behavior is undefined if min > max. fun ref u128( min: U128 val = call, max: U128 val = call) : U128 val Parameters¶ min: U128 val = call max: U128 val = call Returns¶ U128 val ulong¶ [Source] Generate a ULong in closed interval [min, max] (default: [min_value, max_value]). Behavior is undefined if min > max. fun ref ulong( min: ULong val = call, max: ULong val = call) : ULong val Parameters¶ min: ULong val = call max: ULong val = call Returns¶ ULong val usize¶ [Source] Generate a USize in closed interval [min, max] (default: [min_value, max_value]). Behavior is undefined if min > max. fun ref usize( min: USize val = call, max: USize val = call) : USize val Parameters¶ min: USize val = call max: USize val = call Returns¶ USize val i8¶ [Source] Generate a I8 in closed interval [min, max] (default: [min_value, max_value]). Behavior is undefined if min > max. fun ref i8( min: I8 val = call, max: I8 val = call) : I8 val Parameters¶ min: I8 val = call max: I8 val = call Returns¶ I8 val i16¶ [Source] Generate a I16 in closed interval [min, max] (default: [min_value, max_value]). Behavior is undefined if min > max. fun ref i16( min: I16 val = call, max: I16 val = call) : I16 val Parameters¶ min: I16 val = call max: I16 val = call Returns¶ I16 val i32¶ [Source] Generate a I32 in closed interval [min, max] (default: [min_value, max_value]). Behavior is undefined if min > max. fun ref i32( min: I32 val = call, max: I32 val = call) : I32 val Parameters¶ min: I32 val = call max: I32 val = call Returns¶ I32 val i64¶ [Source] Generate a I64 in closed interval [min, max] (default: [min_value, max_value]). Behavior is undefined if min > max. fun ref i64( min: I64 val = call, max: I64 val = call) : I64 val Parameters¶ min: I64 val = call max: I64 val = call Returns¶ I64 val i128¶ [Source] Generate a I128 in closed interval [min, max] (default: [min_value, max_value]). Behavior is undefined if min > max. fun ref i128( min: I128 val = call, max: I128 val = call) : I128 val Parameters¶ min: I128 val = call max: I128 val = call Returns¶ I128 val ilong¶ [Source] Generate a ILong in closed interval [min, max] (default: [min_value, max_value]). Behavior is undefined if min > max. fun ref ilong( min: ILong val = call, max: ILong val = call) : ILong val Parameters¶ min: ILong val = call max: ILong val = call Returns¶ ILong val isize¶ [Source] Generate a ISize in closed interval [min, max] (default: [min_value, max_value]). Behavior is undefined if min > max. fun ref isize( min: ISize val = call, max: ISize val = call) : ISize val Parameters¶ min: ISize val = call max: ISize val = call Returns¶ ISize val f32¶ [Source] Generate a F32 in closed interval [min, max] (default: [0.0, 1.0]). fun ref f32( min: F32 val = 0.0, max: F32 val = 1.0) : F32 val Parameters¶ min: F32 val = 0.0 max: F32 val = 1.0 Returns¶ F32 val f64¶ [Source] Generate a F64 in closed interval [min, max] (default: [0.0, 1.0]). fun ref f64( min: F64 val = 0.0, max: F64 val = 1.0) : F64 val Parameters¶ min: F64 val = 0.0 max: F64 val = 1.0 Returns¶ F64 val bool¶ [Source] Generate a random Bool value. fun ref bool() : Bool val Returns¶ Bool val shuffle[T: T]¶ [Source] fun ref shuffle[T: T]( array: Array[T] ref) : None val Parameters¶ array: Array[T] ref Returns¶ None val	pony	3915036	https://sv.wikipedia.org/wiki/Cykliskt%20tal	Cykliskt tal	Cykliskt tal är ett heltal i vilket cykliska permutationer av siffrorna är successiva multiplar av talet. Det mest kända är 142 857: 142857 × 1 = 142857 142857 × 2 = 285714 142857 × 3 = 428571 142857 × 4 = 571428 142857 × 5 = 714285 142857 × 6 = 857142 Detaljer För att ett tal ska kunna klassificeras som cykliskt tal krävs det att successiva multiplar är cykliska permutationer. Därmed skulle talet 076923 inte betraktas som ett cyklisk tal, även om alla cykliska permutationer är multiplar: 076923 × 1 = 076923 076923 × 3 = 230769 076923 × 4 = 307692 076923 × 9 = 692307 076923 × 10 = 769230 076923 × 12 = 923076 Följande triviala fall är oftast uteslutna: Ensiffriga tal (till exempel: 5) Upprepande siffror (till exempel: 555) Upprepande cykliska tal (till exempel: 142857142857) Om inledande nollor inte är tillåtna i tal så är 142857 det enda cykliska talet i decimala talsystemet, på grund av strukturen (se nästa avsnitt). Om inledande nollor är tillåtna så är de första talen i talföljden över cykliska tal: (106−1) / 7 = 142857 (6 siffror) (1016−1) / 17 = 0588235294117647 (16 siffror) (1018−1) / 19 = 052631578947368421 (18 siffror) (1022−1) / 23 = 0434782608695652173913 (22 siffror) (1028−1) / 29 = 0344827586206896551724137931 (28 siffror) (1046−1) / 47 = 0212765957446808510638297872340425531914893617 (46 siffror) (1058−1) / 59 = 0169491525423728813559322033898305084745762711864406779661 (58 siffror) (1060−1) / 61 = 016393442622950819672131147540983606557377049180327868852459 (60 siffror) Relation till upprepande decimaler Cykliska tal är relaterade till de upprepande decimalerna i enhetsbråk. Ett cyklisk tal med längden L är den digitala representationen av 1/(L + 1). Omvänt, om den digitala perioden av 1 /p (där p är ett primtal) är p − 1, så representerar siffrorna ett cykliskt tal Till exempel: 1/7 = 0,142857 142857…. Flera av följande bråk uppvisar cyklisk permutation 1/7 = 0,142857 142857… 2/7 = 0,285714 285714… 3/7 = 0,428571 428571… 4/7 = 0,571428 571428… 5/7 = 0,714285 714285… 6/7 = 0,857142 857142…. Form av cykliska tal Ur relation till enhetsbråk kan det visas att cykliska tal är på formen där b är talbasen (10 för decimala talsystemet) och p är ett primtal som inte delar b. (Primtal p som ger cykliska tal kallas för fullreptenda primtal eller långa primtal). Till exempel så ger fallet b = 10, p = 7 det cykliska talet 142857. Inte alla värden på p kommer att ge ett cykliskt tal med denna formel, till exempel så ger p = 13 talet 076923076923. Dessa misslyckade fall kommer alltid att innehålla en upprepning av siffror (eventuellt flera). De första värdena för p, för vilka denna formel ger cykliska tal i decimala talsystemet är: 7, 17, 19, 23, 29, 47, 59, 61, 97, 109, 113, 131, 149, 167, 179, 181, 193, 223, 229, 233, 257, 263, 269, 313, 337, 367, 379, 383, 389, 419, 433, 461, 487, 491, 499, 503, 509, 541, 571, 577, 593, 619, 647, 659, 701, 709, 727, 743, 811, 821, 823, 857, 863, 887, 937, 941, 953, 971, 977, 983, … Det kända mönstret till denna talföljd kommer från algebraisk talteori. Specifikt är denna talföljd är en mängd primtal p sådana att 10 är en primitiv rot modulo p. En hypotes av Emil Artin är att denna talföljd innehåller 37,395… % av primtalen. Konstruktion av cykliska tal Cykliska tal kan konstrueras med följande algoritm: Låt b vara talbasen (10 för decimala talsystemet) Låt p vara ett primtal som inte delar b. Låt t = 0. Låt r = 1. Låt n = 0. Loop: Låt t = t + 1 Låt x = r · b Låt d = int(x / p) Låt r = x mod p Låt n = n · b + d Om r ≠ 1, upprepa loopen. Om t = p − 1 så är n ett cykliskt tal. Denna algoritm fungerar genom beräkning av siffrorna i 1 /p i basen B, av lång division. r är resten vid varje steg, och d är den siffra som ges. Steget n = n · b + d tjänar helt enkelt att samla in siffrorna. För datorer som inte kan uttrycka mycket stora heltal, kan siffrorna matas ut eller samlas in på annat sätt. Observera att om t någonsin överstiger p/2 så måste talet vara cykliskt utan behov av att beräkna de återstående siffrorna. Andra talbaser Med användning av ovanstående teknik kan cykliska tal hittas i andra talbaser. Observera att inte alla av dessa följer den andra regeln (alla efterföljande multiplar är cykliska permutationer) som anges i specialfall-avsnittet ovan. I binära talsystemet (bas 2) inleds följden av cykliska tal med: 11 (3) → 01 101 (5) → 0011 1011 (11) → 0001011101 1101 (13) → 000100111011 10011 (19) → 000011010111100101 I ternära talsystemet (bas 3): 12 (5) → 0121 21 (7) → 010212 122 (17) → 0011202122110201 201 (19) → 001102100221120122 1002 (29) → 0002210102011122200121202111 I kvarternära talsystemet (bas 4): Inget I kvinära talsystemet (bas 5): 3 (3) → 13 12 (7) → 032412 32 (17) → 0121340243231042 122 (37) → 003142122040113342441302322404331102 133 (43) → 002423141223434043111442021303221010401333 I senära talsystemet (bas 6): 15 (11) → 0313452421 21 (13) → 024340531215 25 (17) → 0204122453514331 31 (19) → 015211325015211325 105 (41) → 0051335412440330234455042201431152253211 I septenära talsystemet (bas 7): 5 (5) → 1254 14 (11) → 0431162355 16 (13) → 035245631421 23 (17) → 0261143464055232 32 (23) → 0206251134364604155323 I oktala talsystemet (bas 8): 3 (3) → 25 5 (5) → 1463 13 (11) → 0564272135 35 (29) → 0215173454106475626043236713 65 (53) → 0115220717545336140465103476625570602324416373126743 I nonära talsystemet (bas 9): Inget I undecimala talsystemet (bas 11): 3 (3) → 37 12 (13) → 093425A17685 16 (17) → 07132651A3978459 21 (23) → 05296243390A581486771A 27 (29) → 04199534608387A69115764A2723 I duodecimala talsystemet (bas 12): 5 (5) → 2497 7 (7) → 186A35 15 (17) → 08579214B36429A7 27 (31) → 0478AA093598166B74311B28623A55 35 (41) → 036190A653277397A9B4B85A2B15689448241207 I tridecimala talsystemet (bas 13): 5 (5) → 27A5 B (11) → 12495BA837 16 (19) → 08B82976AC414A3562 25 (31) → 055B42692C21347C7718A63A0AB985 I tetradecimala talsystemet (bas 14): 3 (3) → 49 13 (17) → 0B75A9C4D2683419 15 (19) → 0A45C7522D398168BB I pentadecimala talsystemet (bas 15): D (13) → 124936DCA5B8 14 (19) → 0BC9718A3E3257D64B 18 (23) → 09BB1487291E533DA67C5D I hexadecimala talsystemet (bas 16): Inget I bas 17: 3 (3) → 5B 5 (5) → 36DA 7 (7) → 274E9C B (11) → 194ADF7C63 I oktodecimala talsystemet (bas 18): B (11) → 1B834H69ED 1B (29) → 0B31F95A9GDAE4H6EG28C781463D 21 (37) → 08DB37565F184FA3G0H946EACBC2G9D27E1H I bas 19: 7 (7) → 2DAG58 B (11) → 1DFA6H538C D (13) → 18EBD2HA475G I vigesimala talsystemet (bas 20): 3 (3) → 6D D (13) → 1AF7DGI94C63 H (17) → 13ABF5HCIG984E27 I bas 21: J (19) → 1248HE7F9JIGC36D5B 12 (23) → 0J3DECG92FAK1H7684BI5A 18 (29) → 0F475198EA2IH7K5GDFJBC6AI23D I bas 22: 5 (5) → 48HD H (17) → 16A7GI2CKFBE53J9 J (17) → 13A95H826KIBCG4DJF I bas 23: 3 (3) → 7F 5 (5) → 4DI9 H (17) → 182G59AILEK6HDC4 I tetravigesimala talsystemet (bas 24): 7 (7) → 3A6KDH B (11) → 248HALJF6D D (13) → 1L795CM3GEIB H (17) → 19L45FCGME2JI8B7 Notera att i ternära talsystemet (b = 3) så ger fallet p = 2 talet 1 som cykliskt tal. Även om enstaka siffror kan anses triviala fall kan det vara användbart för fullständigheten i teorin att betrakta dem bara när de ges på detta sätt. Man kan bevisa att inga cykliska tal (utom triviala ensiffriga tal) finns i varje talbas som är en perfekt kvadrat, och därför finns det inga cykliska tal i hexadecimala talsystemet (bas 16), kvarternära talsystemet (bas 4) och nonära talsystemet (bas 9). Se även 142857 (tal) Upprepande decimal Fermats lilla sats Cyklisk permutation av heltal Parasitiskt tal Källor Vidare läsning Gardner, Martin. Mathematical Circus: More Puzzles, Games, Paradoxes and Other Mathematical Entertainments From Scientific American. New York: The Mathematical Association of America, 1979. pp. 111-122. Kalman, Dan; 'Fractions with Cycling Digit Patterns' The College Mathematics Journal, Vol. 27, No. 2. (Mar., 1996), pp. 109-115. Leslie, John. "The Philosophy of Arithmetic: Exhibiting a Progressive View of the Theory and Practice of ....", Longman, Hurst, Rees, Orme, and Brown, 1820, Wells, David; "The Penguin Dictionary of Curious and Interesting Numbers", Penguin Press. Externa länkar Youtube: "Cyclic Numbers - Numberphile" Talteori Permutationer	swedish	0.922898
Pony/src-term-readline-.txt	readline.pony 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402use "collections" use "files" use "promises" use strings = "strings" class Readline is ANSINotify """ Line editing, history, and tab completion. """ let _notify: ReadlineNotify let _out: OutStream let _path: (FilePath \| None) embed _history: Array[String] embed _queue: Array[String] = Array[String] let _maxlen: USize var _edit: String iso = recover String end var _cur_prompt: String = "" var _cur_line: USize = 0 var _cur_pos: ISize = 0 var _blocked: Bool = true new iso create( notify: ReadlineNotify iso, out: OutStream, path: (FilePath \| None) = None, maxlen: USize = 0) => """ Create a readline handler to be passed to stdin. It begins blocked. Set an initial prompt on the ANSITerm to begin processing. """ _notify = consume notify _out = out _path = path _history = Array[String](maxlen) _maxlen = maxlen _load_history() fun ref apply(term: ANSITerm ref, input: U8) => """ Receives input. """ match input \| 0x01 => home() // ctrl-a \| 0x02 => left() // ctrl-b \| 0x04 => // ctrl-d if _edit.size() == 0 then _out.write("\n") term.dispose() else delete() end \| 0x05 => end_key() // ctrl-e \| 0x06 => right() // ctrl-f \| 0x08 => _backspace() // ctrl-h \| 0x09 => _tab() \| 0x0A => _dispatch(term) // LF \| 0x0B => // ctrl-k, delete to the end of the line. _edit.truncate(_cur_pos.usize()) \| 0x0C => _clear() // ctrl-l \| 0x0D => _dispatch(term) // CR \| 0x0E => down() // ctrl-n \| 0x10 => up() // ctrl-p \| 0x14 => _swap() // ctrl-t \| 0x15 => // ctrl-u, delete the whole line. _edit.clear() home() \| 0x17 => _delete_prev_word() // ctrl-w \| 0x7F => _backspace() // backspace \| if input < 0x20 => None // unknown control character else // Insert. _edit.insert_byte(_cur_pos, input) _cur_pos = _cur_pos + 1 _refresh_line() end fun ref prompt(term: ANSITerm ref, value: String) => """ Set a new prompt, unblock, and handle the pending queue. """ _cur_prompt = value _blocked = false try let line = _queue.shift()? _add_history(line) _out.print(_cur_prompt + line) _handle_line(term, line) else _refresh_line() end fun ref closed() => """ No more input is available. """ _save_history() fun ref up(ctrl: Bool = false, alt: Bool = false, shift: Bool = false) => """ Previous line. """ try if _cur_line > 0 then _cur_line = _cur_line - 1 _edit = _history(_cur_line)?.clone() end_key() end end fun ref down(ctrl: Bool = false, alt: Bool = false, shift: Bool = false) => """ Next line. """ try if _cur_line < (_history.size() - 1) then _cur_line = _cur_line + 1 _edit = _history(_cur_line)?.clone() else _cur_line = _history.size() _edit.clear() end end_key() end fun ref left(ctrl: Bool = false, alt: Bool = false, shift: Bool = false) => """ Move left. """ if _cur_pos == 0 then return end try repeat _cur_pos = _cur_pos - 1 until (_cur_pos == 0) or ((_edit.at_offset(_cur_pos)? and 0xC0) != 0x80) end _refresh_line() end fun ref right(ctrl: Bool = false, alt: Bool = false, shift: Bool = false) => """ Move right. """ try if _cur_pos < _edit.size().isize() then _cur_pos = _cur_pos + 1 end while (_cur_pos < _edit.size().isize()) and ((_edit.at_offset(_cur_pos)? and 0xC0) == 0x80) do _cur_pos = _cur_pos + 1 end _refresh_line() end fun ref home(ctrl: Bool = false, alt: Bool = false, shift: Bool = false) => """ Beginning of the line. """ _cur_pos = 0 _refresh_line() fun ref end_key( ctrl: Bool = false, alt: Bool = false, shift: Bool = false) => """ End of the line. """ _cur_pos = _edit.size().isize() _refresh_line() fun ref _backspace() => """ Backward delete. """ if _cur_pos == 0 then return end try var c = U8(0) repeat _cur_pos = _cur_pos - 1 c = _edit.at_offset(_cur_pos)? _edit.delete(_cur_pos, 1) until (_cur_pos == 0) or ((c and 0xC0) != 0x80) end _refresh_line() end fun ref delete(ctrl: Bool = false, alt: Bool = false, shift: Bool = false) => """ Forward delete. """ try if _cur_pos < _edit.size().isize() then _edit.delete(_cur_pos, 1) end while (_cur_pos < _edit.size().isize()) and ((_edit.at_offset(_cur_pos)? and 0xC0) == 0x80) do _edit.delete(_cur_pos, 1) end _refresh_line() end fun ref _clear() => """ Clear the screen. """ _out.write(ANSI.clear()) _refresh_line() fun ref _swap() => """ Swap the previous character with the current one. """ try if (_cur_pos > 0) and (_cur_pos < _edit.size().isize()) then _edit(_cur_pos.usize())? = _edit((_cur_pos - 1).usize())? = _edit(_cur_pos.usize())? end _refresh_line() end fun ref _delete_prev_word() => """ Delete the previous word. """ try let old = _cur_pos while (_cur_pos > 0) and (_edit((_cur_pos - 1).usize())? == ' ') do _cur_pos = _cur_pos - 1 end while (_cur_pos > 0) and (_edit((_cur_pos - 1).usize())? != ' ') do _cur_pos = _cur_pos - 1 end _edit.delete(_cur_pos, (old - _cur_pos).usize()) _refresh_line() end fun ref _tab() => """ Tab completion. TODO: Improve this. """ let r = _notify.tab(_edit.clone()) match r.size() \| 0 => None \| 1 => try _edit = r(0)?.clone() end_key() end else _out.write("\n") for completion in r.values() do _out.print(completion) end _edit = strings.CommonPrefix(r) end_key() end fun ref _dispatch(term: ANSITerm) => """ Send a finished line to the notifier. """ if _edit.size() > 0 then let line: String = _edit = recover String end if _blocked then _queue.push(line) else _add_history(line) _out.write("\n") _handle_line(term, line) end end fun ref _handle_line(term: ANSITerm, line: String) => """ Dispatch a single line. """ let promise = Promise[String] promise.next[Any tag]( recover term~prompt() end, recover term~dispose() end) _notify(line, promise) _cur_pos = 0 _blocked = true fun ref _refresh_line() => """ Refresh the line on screen. """ if not _blocked then let len = 40 + _cur_prompt.size() + _edit.size() let out = recover String(len) end // Move to the left edge. out.append("\r") // Print the prompt. out.append(_cur_prompt) // Print the current line. out.append(_edit.clone()) // Erase to the right edge. out.append(ANSI.erase()) // Set the cursor position. var pos = _cur_prompt.codepoints() if _cur_pos > 0 then pos = pos + _edit.codepoints(0, _cur_pos) end out.append("\r") out.append(ANSI.right(pos.u32())) _out.write(consume out) end fun ref _add_history(line: String) => """ Add a line to the history, trimming an earlier line if necessary. """ try if (_history.size() > 0) and (_history(_history.size() - 1)? == line) then _cur_line = _history.size() return end end if (_maxlen > 0) and (_history.size() >= _maxlen) then try _history.shift()? end end _history.push(line) _cur_line = _history.size() fun ref _load_history() => """ Load the history from a file. """ _history.clear() try with file = File.open(_path as FilePath) do for line in file.lines() do _add_history(consume line) end end end fun _save_history() => """ Write the history back to a file. """ try with file = File(_path as FilePath) do for line in _history.values() do file.print(line) end end end	pony	825958	https://da.wikipedia.org/wiki/Ikke%20truet	Ikke truet	Ikke truet (LC) () er en term som anvendes indenfor rødlistning af arter. Den danske rødliste bruger betegnelsen Livskraftig En art tilhører kategorien "ikke truet", hvis det ved vurderingen viser sig, at den ikke opfylder kriterierne for hverken kritisk truet (CR), truet (EN) eller sårbar (VU) eller vurderes at være næsten truet (NT). For eksempel, se :Kategori:IUCN Rødliste - ikke truede arter Kilder IUCN:s rødliste: kategorier og kriterier 2001 (version 3.1) Naturbeskyttelse IUCN's Rødliste	danish	1.281748
Pony/pony_test-TestHelper-.txt	TestHelper¶ [Source] Per unit test class that provides control, logging and assertion functions. Each unit test is given a TestHelper when it is run. This is val and so can be passed between methods and actors within the test without restriction. The assertion functions check the relevant condition and mark the test as a failure if appropriate. The success or failure of the condition is reported back as a Bool which can be checked if a different code path is needed when that condition fails. All assert functions take an optional message argument. This is simply a string that is printed as part of the error message when the condition fails. It is intended to aid identifying what failed. class val TestHelper Public fields¶ let env: Env val¶ [Source] The process environment. This is useful for getting the root authority in order to access the filesystem (See files) or the network (See net) in your tests. Public Functions¶ log¶ [Source] Log the given message. The verbose parameter allows messages to be printed only when the --verbose command line option is used. For example, by default assert failures are logged, but passes are not. With --verbose both passes and fails are reported. Logs are printed one test at a time to avoid interleaving log lines from concurrent tests. fun box log( msg: String val, verbose: Bool val = false) : None val Parameters¶ msg: String val verbose: Bool val = false Returns¶ None val fail¶ [Source] Flag the test as having failed. fun box fail( msg: String val = "Test failed") : None val Parameters¶ msg: String val = "Test failed" Returns¶ None val assert_true¶ [Source] Assert that the given expression is true. fun box assert_true( actual: Bool val, msg: String val = "", loc: SourceLoc val = __loc) : Bool val Parameters¶ actual: Bool val msg: String val = "" loc: SourceLoc val = __loc Returns¶ Bool val assert_false¶ [Source] Assert that the given expression is false. fun box assert_false( actual: Bool val, msg: String val = "", loc: SourceLoc val = __loc) : Bool val Parameters¶ actual: Bool val msg: String val = "" loc: SourceLoc val = __loc Returns¶ Bool val assert_error¶ [Source] Assert that the given test function throws an error when run. fun box assert_error( test: ITest box, msg: String val = "", loc: SourceLoc val = __loc) : Bool val Parameters¶ test: ITest box msg: String val = "" loc: SourceLoc val = __loc Returns¶ Bool val assert_no_error¶ [Source] Assert that the gived test function does not throw an error when run. fun box assert_no_error( test: ITest box, msg: String val = "", loc: SourceLoc val = __loc) : Bool val Parameters¶ test: ITest box msg: String val = "" loc: SourceLoc val = __loc Returns¶ Bool val assert_is[A: A]¶ [Source] Assert that the 2 given expressions resolve to the same instance fun box assert_is[A: A]( expect: A, actual: A, msg: String val = "", loc: SourceLoc val = __loc) : Bool val Parameters¶ expect: A actual: A msg: String val = "" loc: SourceLoc val = __loc Returns¶ Bool val assert_eq[A: (Equatable[A] #read & Stringable #read)]¶ [Source] Assert that the 2 given expressions are equal. fun box assert_eq[A: (Equatable[A] #read & Stringable #read)]( expect: A, actual: A, msg: String val = "", loc: SourceLoc val = __loc) : Bool val Parameters¶ expect: A actual: A msg: String val = "" loc: SourceLoc val = __loc Returns¶ Bool val assert_isnt[A: A]¶ [Source] Assert that the 2 given expressions resolve to different instances. fun box assert_isnt[A: A]( not_expect: A, actual: A, msg: String val = "", loc: SourceLoc val = __loc) : Bool val Parameters¶ not_expect: A actual: A msg: String val = "" loc: SourceLoc val = __loc Returns¶ Bool val assert_ne[A: (Equatable[A] #read & Stringable #read)]¶ [Source] Assert that the 2 given expressions are not equal. fun box assert_ne[A: (Equatable[A] #read & Stringable #read)]( not_expect: A, actual: A, msg: String val = "", loc: SourceLoc val = __loc) : Bool val Parameters¶ not_expect: A actual: A msg: String val = "" loc: SourceLoc val = __loc Returns¶ Bool val assert_array_eq[A: (Equatable[A] #read & Stringable #read)]¶ [Source] Assert that the contents of the 2 given ReadSeqs are equal. The type parameter of this function is the type parameter of the elements in both ReadSeqs. For instance, when comparing two Array[U8], you should call this method as follows: fun apply(h: TestHelper) => let a: Array[U8] = [1; 2; 3] let b: Array[U8] = [1; 2; 3] h.assert_array_eq[U8](a, b) fun box assert_array_eq[A: (Equatable[A] #read & Stringable #read)]( expect: ReadSeq[A] box, actual: ReadSeq[A] box, msg: String val = "", loc: SourceLoc val = __loc) : Bool val Parameters¶ expect: ReadSeq[A] box actual: ReadSeq[A] box msg: String val = "" loc: SourceLoc val = __loc Returns¶ Bool val assert_array_eq_unordered[A: (Equatable[A] #read & Stringable #read)]¶ [Source] Assert that the contents of the 2 given ReadSeqs are equal ignoring order. The type parameter of this function is the type parameter of the elements in both ReadSeqs. For instance, when comparing two Array[U8], you should call this method as follows: fun apply(h: TestHelper) => let a: Array[U8] = [1; 2; 3] let b: Array[U8] = [1; 3; 2] h.assert_array_eq_unordered[U8](a, b) fun box assert_array_eq_unordered[A: (Equatable[A] #read & Stringable #read)]( expect: ReadSeq[A] box, actual: ReadSeq[A] box, msg: String val = "", loc: SourceLoc val = __loc) : Bool val Parameters¶ expect: ReadSeq[A] box actual: ReadSeq[A] box msg: String val = "" loc: SourceLoc val = __loc Returns¶ Bool val long_test¶ [Source] Indicate that this is a long running test that may continue after the test function exits. Once this function is called, complete() must be called to finish the test, unless a timeout occurs. The timeout is specified in nanseconds. fun box long_test( timeout: U64 val) : None val Parameters¶ timeout: U64 val Returns¶ None val complete¶ [Source] MUST be called by each long test to indicate the test has finished, unless a timeout occurs. If you are using expect_action() then complete(true) will be called once the last expected action has been completed via complete_action(). The "success" parameter specifies whether the test succeeded. However if any asserts fail the test will be considered a failure, regardless of the value of this parameter. Once this is called tear_down() may be called at any time. fun box complete( success: Bool val) : None val Parameters¶ success: Bool val Returns¶ None val expect_action¶ [Source] Can be called in a long test to set up expectations for one or more actions that, when all completed, will complete the test. This pattern is useful for cases where you have multiple things that need to happen to complete your test, but don't want to have to collect them all yourself into a single actor that calls the complete method. The order of calls to expect_action don't matter - the actions may be completed in any other order to complete the test. fun box expect_action( name: String val) : None val Parameters¶ name: String val Returns¶ None val complete_action¶ [Source] MUST be called for each action expectation that was set up in a long test to fulfill the expectations. Any expectations that are still outstanding when the long test timeout runs out will be printed by name when it fails. Completing all outstanding actions is enough to finish the test. There's no need to also call the complete method when the actions are finished. Calling the complete method will finish the test immediately, without waiting for any outstanding actions to be completed. fun box complete_action( name: String val) : None val Parameters¶ name: String val Returns¶ None val fail_action¶ [Source] Call to fail an action, which will also cause the entire test to fail immediately, without waiting the rest of the outstanding actions. The name of the failed action will be included in the failure output. Usually the action name should be an expected action set up by a call to expect_action, but failing unexpected actions will also fail the test. fun box fail_action( name: String val) : None val Parameters¶ name: String val Returns¶ None val dispose_when_done¶ [Source] Pass a disposable actor to be disposed of when the test is complete. The actor will be disposed no matter whether the test succeeds or fails. If the test is already tearing down, the actor will be disposed immediately. fun box dispose_when_done( disposable: DisposableActor tag) : None val Parameters¶ disposable: DisposableActor tag Returns¶ None val	pony	6672676	https://sv.wikipedia.org/wiki/Busy-waiting	Busy-waiting	Busy-waiting, busy-looping eller spinning är en teknik där en process upprepade gånger kontrollerar om ett tillstånd gäller, exempelvis om en tangentbordsinmatning eller ett datorlås finns tillgängligt. Spinning kan även användas för att generera en godtycklig fördröjning, en teknik som var nödvändig på system som saknade en metod för att vänta en specifik tidslängd. Processorhastigheter varierar kraftigt mellan datorer, speciellt då en del processorer är utformade för att dynamiskt justera hastigheten baserat på externa faktorer, som exempelvis belastningen på operativsystemet. Därför kan spinning som en tidsfördröjningsteknik ofta producera oförutsägbara eller t.o.m. inkonsistenta resultat såvida koden är implementerad för att bestämma hur snabbt processorn kan köra en tom loop, eller om loopkoden kollar en realtidsklocka. Spinning kan vara en bra strategi i vissa förhållanden, i synnerhet för implementationen av spinlock inom operativsystem som är byggda att köras på SMP-system. I allmänhet ses spinning som ett antimönster och bör undvikas då processortiden skulle kunna användas för att utföra en annan uppgift istället för att slösa på den på en meningslös aktivitet. Exempel i C Följande kod skriven i C illustrerar två trådar som delar ett globalt heltal i. Den första tråden använder busy-waiting för att kolla efter en ändring i värdet för i: #include <stdio.h> #include <pthread.h> #include <unistd.h> #include <stdlib.h> volatile int i = 0; /* i är global, så den är synlig för alla funktioner. Den är även volatile, eftersom den kanske ändras på ett sätt som kompilatorn inte kan förutspå, här ifrån en annan tråd. / / f1 använder ett spinlock för att vänta på i att ska ändras från 0. / static void f1(void p) { while (i==0) { / gör ingenting - fortsätt vänta om och om igen / } printf("i's value has changed to %d.\n", i); return NULL; } static void f2(void p) { sleep(60); / vila i 60 sekunder */ i = 99; printf("t2 has changed the value of i to %d.\n", i); return NULL; } int main() { int rc; pthread_t t1, t2; rc = pthread_create(&t1, NULL, f1, NULL); if (rc != 0) { fprintf(stderr,"pthread f1 failed\n"); return EXIT_FAILURE; } rc = pthread_create(&t2, NULL, f2, NULL); if (rc != 0) { fprintf(stderr,"pthread f2 failed\n"); return EXIT_FAILURE; } pthread_join(t1, NULL); pthread_join(t2, NULL); puts("All pthreads finished."); return 0; } I ett fall som detta kan C11:s condition variable användas istället. Källor Se även Polla (mikroprocessor) Externa länkar Beskrivning från The Open Group Base Specifications Issue 6, IEEE Std 1003.1, 2004 Edition Artikeln "User-Level Spin Locks - Threads, Processes & IPC" av Gert Boddaert Austria SpinLock Class Reference Antimönster	swedish	0.765717
Pony/src-collections-range-.txt	range.pony 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122class Range[A: (Real[A] val & Number) = USize] is Iterator[A] """ Produces `[min, max)` with a step of `inc` for any `Number` type. ```pony // iterating with for-loop for i in Range(0, 10) do env.out.print(i.string()) end // iterating over Range of U8 with while-loop let range = Range[U8](5, 100, 5) while range.has_next() do try handle_u8(range.next()?) end end ``` Supports `min` being smaller than `max` with negative `inc` but only for signed integer types and floats: ```pony var previous = 11 for left in Range[I64](10, -5, -1) do if not (left < previous) then error end previous = left end ``` If `inc` is nonzero, but cannot produce progress towards `max` because of its sign, the `Range` is considered empty and will not produce any iterations. The `Range` is also empty if either `min` equals `max`, independent of the value of `inc`, or if `inc` is zero. ```pony let empty_range1 = Range(0, 10, -1) let empty_range2 = Range(0, 10, 0) let empty_range3 = Range(10, 10) empty_range1.is_empty() == true empty_range2.is_empty() == true empty_range3.is_empty() == true ``` Note that when using unsigned integers, a negative literal wraps around so while `Range[ISize](0, 10, -1)` is empty as above, `Range[USize](0, 10, -1)` produces a single value of `min` or `[0]` here. When using `Range` with floating point types (`F32` and `F64`) `inc` steps < 1.0 are possible. If any arguments contains NaN, the `Range` is considered empty. It is also empty if the lower bound `min` or the step `inc` are +Inf or -Inf. However, if only the upper bound `max` is +Inf or -Inf and the step parameter `inc` has the same sign, then the `Range` is considered infinite and will iterate indefinitely. ```pony let p_inf: F64 = F64.max_value() + F64.max_value() let n_inf: F64 = -p_inf let nan: F64 = F64(0) / F64(0) let infinite_range1 = Range[F64](0, p_inf, 1) let infinite_range2 = Range[F64](0, n_inf, -1_000_000) infinite_range1.is_infinite() == true infinite_range2.is_infinite() == true for i in Range[F64](0.5, 100, nan) do // will not be executed as `inc` is nan end for i in Range[F64](0.5, 100, p_inf) do // will not be executed as `inc` is +Inf end ``` """ let _min: A let _max: A let _inc: A let _forward: Bool let _infinite: Bool let _empty: Bool var _idx: A new create(min: A, max: A, inc: A = 1) => _min = min _max = max _inc = inc _forward = (_min < _max) and (_inc > 0) (let min_finite, let max_finite, let inc_finite) = iftype A <: FloatingPoint[A] then (_min.finite(), _max.finite(), _inc.finite()) else (true, true, true) end let progress = ((_min < _max) and (_inc > 0)) or ((_min > _max) and (_inc < 0)) // false if any is NaN! if progress and min_finite and inc_finite then _empty = false _infinite = not max_finite // ok to use not max_finite for max_infinite // since progress excludes _max == nan _idx = _min else _empty = true _infinite = false _idx = _max // has_next() will return false without code modification end fun has_next(): Bool => if _infinite then return true end if _forward then _idx < _max else _idx > _max end fun ref next(): A ? => if has_next() then _idx = _idx + _inc else error end fun ref rewind() => _idx = _min fun is_infinite(): Bool => _infinite fun is_empty(): Bool => _empty	pony	311602	https://da.wikipedia.org/wiki/Forbrugerprisindeks	Forbrugerprisindeks	Et forbrugerprisindeks (FPI) er et mål for den gennemsnitlige pris af forbrugsvarer og tjenesteydelser, som købes af husholdningerne. Det er et af flere prisindeks, som udregnes af nationale statistiske kontorer. Den procentvise ændring af FPI er et mål for inflationen. FPI kan bruges til at indeksere (dvs. justere for følgerne af inflation) løn, pensioner, eller regulerede eller faldende priser. FPI er, sammen med folketællinger og opgørelser af nationalindkomst og nationalprodukt, et af de mest fulgte statistikker for den nationale økonomi. Sådan udregnes stigningstakten For eksempel, i februar 2008 var det danske forbrugerprisindeks 117,1 og i februar 2009 var det 119,3. Formlen for at finde 12-måneders forandringen – stigningstakten – er: Det ses at stigningstaten for FPI på disse 12 måneder er 1,87 %, hvilket betyder at det generelle niveau for de priser, som typiske danske forbrugere skulle betale steg omkring to procent på disse 12 måneder. Udviklingen af det danske forbrugerprisindeks siden 1980 \|- \| \| {\| border="1" cellpadding="1" cellspacing="0" style="margin: 10px 0 10px 25px; background: e7dcc3; border: 1px #AAA solid; border-collapse: collapse; font-size: 110%; float: center;" \|- style="background: e7dcc3;" \|colspan ="13" style="background: #e7dcc3; font-size: 110%" align="center" \|FPI i Danmark (2000=100) <small>og Inflationstakt (12-mdrs. forandring) i Danmark og Sverige (i pct.)</small> \|- \|width="65"\|År \|Jan \|Feb \|Mar \|Apr \|Maj \|Jun \|Jul \|Aug \|Sep \|Okt \|Nov \|Dec \|- \| rowspan="1" style="background: #e7dcc3; font-size: 110%" align="center"\| 1996 \|style="background: #e7dcc3; font-size: 80%" align="center"\|89,7 \|style="background: #e7dcc3; font-size: 80%" align="center"\|90,2 \|style="background: #e7dcc3; font-size: 80%" align="center"\|90,7 \|style="background: #e7dcc3; font-size: 80%" align="center"\|90,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\|91,2 \|style="background: #e7dcc3; font-size: 80%" align="center"\|91,1 \|style="background: #e7dcc3; font-size: 80%" align="center"\|91 \|style="background: #e7dcc3; font-size: 80%" align="center"\|91,1 \|style="background: #e7dcc3; font-size: 80%" align="center"\|91,6 \|style="background: #e7dcc3; font-size: 80%" align="center"\|91,8 \|style="background: #e7dcc3; font-size: 80%" align="center"\|91,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\|91,8 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|style="background: #ffffff; font-size: 80%" align="center"\|1,8 \|style="background: #ffffff; font-size: 80%" align="center"\|2,0 \|style="background: #ffffff; font-size: 80%" align="center"\|2,0 \|style="background: #ffffff; font-size: 80%" align="center"\|1,9 \|style="background: #ffffff; font-size: 80%" align="center"\|2,0 \|style="background: #ffffff; font-size: 80%" align="center"\|2,4 \|style="background: #ffffff; font-size: 80%" align="center"\|2,2 \|style="background: #ffffff; font-size: 80%" align="center"\|2,2 \|style="background: #ffffff; font-size: 80%" align="center"\|2,5 \|style="background: #ffffff; font-size: 80%" align="center"\|2,3 \|style="background: #ffffff; font-size: 80%" align="center"\|2,2 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|1,6 \|style="background: #ffffff; font-size: 80%" align="center"\|1,3 \|style="background: #ffffff; font-size: 80%" align="center"\|1,4 \|style="background: #ffffff; font-size: 80%" align="center"\|1,0 \|style="background: #ffffff; font-size: 80%" align="center"\|0,8 \|style="background: #ffffff; font-size: 80%" align="center"\|0,6 \|style="background: #ffffff; font-size: 80%" align="center"\|0,4 \|style="background: #ffffff; font-size: 80%" align="center"\|0,1 \|style="background: #ffffff; font-size: 80%" align="center"\|0,0 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|0,2 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|0,3 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|0,2 \|- \| rowspan="1" style="background: #e7dcc3; font-size: 110%" align="center"\| 1997 \|style="background: #e7dcc3; font-size: 80%" align="center"\|92,1 \|style="background: #e7dcc3; font-size: 80%" align="center"\|92,1 \|style="background: #e7dcc3; font-size: 80%" align="center"\|92,2 \|style="background: #e7dcc3; font-size: 80%" align="center"\|92,5 \|style="background: #e7dcc3; font-size: 80%" align="center"\|93,1 \|style="background: #e7dcc3; font-size: 80%" align="center"\|93,3 \|style="background: #e7dcc3; font-size: 80%" align="center"\|93,1 \|style="background: #e7dcc3; font-size: 80%" align="center"\|93,5 \|style="background: #e7dcc3; font-size: 80%" align="center"\|93,7 \|style="background: #e7dcc3; font-size: 80%" align="center"\|93,7 \|style="background: #e7dcc3; font-size: 80%" align="center"\|93,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\|93,8 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|2,7 \|style="background: #ffffff; font-size: 80%" align="center"\|2,1 \|style="background: #ffffff; font-size: 80%" align="center"\|1,6 \|style="background: #ffffff; font-size: 80%" align="center"\|1,8 \|style="background: #ffffff; font-size: 80%" align="center"\|2,1 \|style="background: #ffffff; font-size: 80%" align="center"\|2,4 \|style="background: #ffffff; font-size: 80%" align="center"\|2,3 \|style="background: #ffffff; font-size: 80%" align="center"\|2,6 \|style="background: #ffffff; font-size: 80%" align="center"\|2,3 \|style="background: #ffffff; font-size: 80%" align="center"\|2,1 \|style="background: #ffffff; font-size: 80%" align="center"\|2,2 \|style="background: #ffffff; font-size: 80%" align="center"\|2,2 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|0,1 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|0,2 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|0,3 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|0,1 \|style="background: #ffffff; font-size: 80%" align="center"\|0,1 \|style="background: #ffffff; font-size: 80%" align="center"\|0,6 \|style="background: #ffffff; font-size: 80%" align="center"\|0,6 \|style="background: #ffffff; font-size: 80%" align="center"\|1,1 \|style="background: #ffffff; font-size: 80%" align="center"\|1,5 \|style="background: #ffffff; font-size: 80%" align="center"\|1,5 \|style="background: #ffffff; font-size: 80%" align="center"\|1,5 \|style="background: #ffffff; font-size: 80%" align="center"\|1,6 \|- \| rowspan="1" style="background: #e7dcc3; font-size: 110%" align="center"\| 1998 \|style="background: #e7dcc3; font-size: 80%" align="center"\|93,7 \|style="background: #e7dcc3; font-size: 80%" align="center"\|94,1 \|style="background: #e7dcc3; font-size: 80%" align="center"\|94,3 \|style="background: #e7dcc3; font-size: 80%" align="center"\|94,5 \|style="background: #e7dcc3; font-size: 80%" align="center"\|95 \|style="background: #e7dcc3; font-size: 80%" align="center"\|94,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\|94,8 \|style="background: #e7dcc3; font-size: 80%" align="center"\|94,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\|95,3 \|style="background: #e7dcc3; font-size: 80%" align="center"\|95,3 \|style="background: #e7dcc3; font-size: 80%" align="center"\|95,5 \|style="background: #e7dcc3; font-size: 80%" align="center"\|95,4 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|style="background: #ffffff; font-size: 80%" align="center"\|2,2 \|style="background: #ffffff; font-size: 80%" align="center"\|2,3 \|style="background: #ffffff; font-size: 80%" align="center"\|2,2 \|style="background: #ffffff; font-size: 80%" align="center"\|2,0 \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|style="background: #ffffff; font-size: 80%" align="center"\|1,8 \|style="background: #ffffff; font-size: 80%" align="center"\|1,5 \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|0,7 \|style="background: #ffffff; font-size: 80%" align="center"\|0,6 \|style="background: #ffffff; font-size: 80%" align="center"\|0,3 \|style="background: #ffffff; font-size: 80%" align="center"\|0,1 \|style="background: #ffffff; font-size: 80%" align="center"\|0,3 \|style="background: #ffffff; font-size: 80%" align="center"\|0,0 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|0,1 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|0,6 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|1,2 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|1,0 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|1,1 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|1,2 \|- \| rowspan="1" style="background: #e7dcc3; font-size: 110%" align="center" \| 1999 \|style="background: #e7dcc3; font-size: 80%" align="center"\|95,3 \|style="background: #e7dcc3; font-size: 80%" align="center"\|96 \|style="background: #e7dcc3; font-size: 80%" align="center"\|96,5 \|style="background: #e7dcc3; font-size: 80%" align="center"\|96,7 \|style="background: #e7dcc3; font-size: 80%" align="center"\|96,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\|97,2 \|style="background: #e7dcc3; font-size: 80%" align="center"\|97 \|style="background: #e7dcc3; font-size: 80%" align="center"\|97,5 \|style="background: #e7dcc3; font-size: 80%" align="center"\|98 \|style="background: #e7dcc3; font-size: 80%" align="center"\|98,1 \|style="background: #e7dcc3; font-size: 80%" align="center"\|98,3 \|style="background: #e7dcc3; font-size: 80%" align="center"\|98,4 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|style="background: #ffffff; font-size: 80%" align="center"\|2,0 \|style="background: #ffffff; font-size: 80%" align="center"\|2,3 \|style="background: #ffffff; font-size: 80%" align="center"\|2,3 \|style="background: #ffffff; font-size: 80%" align="center"\|2,0 \|style="background: #ffffff; font-size: 80%" align="center"\|2,4 \|style="background: #ffffff; font-size: 80%" align="center"\|2,3 \|style="background: #ffffff; font-size: 80%" align="center"\|2,7 \|style="background: #ffffff; font-size: 80%" align="center"\|2,8 \|style="background: #ffffff; font-size: 80%" align="center"\|2,94 \|style="background: #ffffff; font-size: 80%" align="center"\|2,9 \|style="background: #ffffff; font-size: 80%" align="center"\|3,1 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|0,2 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|0,1 \|style="background: #ffffff; font-size: 80%" align="center"\|0,1 \|style="background: #ffffff; font-size: 80%" align="center"\|0,1 \|style="background: #ffffff; font-size: 80%" align="center"\|0,1 \|style="background: #ffffff; font-size: 80%" align="center"\|0,4 \|style="background: #ffffff; font-size: 80%" align="center"\|0,2 \|style="background: #ffffff; font-size: 80%" align="center"\|0,7 \|style="background: #ffffff; font-size: 80%" align="center"\|1,0 \|style="background: #ffffff; font-size: 80%" align="center"\|0,9 \|style="background: #ffffff; font-size: 80%" align="center"\|0,9 \|style="background: #ffffff; font-size: 80%" align="center"\|1,3 \|- \| rowspan="1" style="background: #e7dcc3; font-size: 110%" align="center"\| 2000 \|style="background: #e7dcc3; font-size: 80%" align="center"\|98,3 \|style="background: #e7dcc3; font-size: 80%" align="center"\|98,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\|99,6 \|style="background: #e7dcc3; font-size: 80%" align="center"\|99,7 \|style="background: #e7dcc3; font-size: 80%" align="center"\|100,1 \|style="background: #e7dcc3; font-size: 80%" align="center"\|100,4 \|style="background: #e7dcc3; font-size: 80%" align="center"\|100 \|style="background: #e7dcc3; font-size: 80%" align="center"\|99,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\|100,6 \|style="background: #e7dcc3; font-size: 80%" align="center"\|100,8 \|style="background: #e7dcc3; font-size: 80%" align="center"\|100,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\|100,8 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|3,1 \|style="background: #ffffff; font-size: 80%" align="center"\|3,0 \|style="background: #ffffff; font-size: 80%" align="center"\|3,2 \|style="background: #ffffff; font-size: 80%" align="center"\|3,1 \|style="background: #ffffff; font-size: 80%" align="center"\|3,3 \|style="background: #ffffff; font-size: 80%" align="center"\|3,3 \|style="background: #ffffff; font-size: 80%" align="center"\|3,1 \|style="background: #ffffff; font-size: 80%" align="center"\|2,5 \|style="background: #ffffff; font-size: 80%" align="center"\|2,6 \|style="background: #ffffff; font-size: 80%" align="center"\|2,7 \|style="background: #ffffff; font-size: 80%" align="center"\|2,6 \|style="background: #ffffff; font-size: 80%" align="center"\|2,4 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|0,5 \|style="background: #ffffff; font-size: 80%" align="center"\|0,9 \|style="background: #ffffff; font-size: 80%" align="center"\|1,0 \|style="background: #ffffff; font-size: 80%" align="center"\|0,7 \|style="background: #ffffff; font-size: 80%" align="center"\|1,0 \|style="background: #ffffff; font-size: 80%" align="center"\|0,8 \|style="background: #ffffff; font-size: 80%" align="center"\|0,8 \|style="background: #ffffff; font-size: 80%" align="center"\|0,9 \|style="background: #ffffff; font-size: 80%" align="center"\|0,9 \|style="background: #ffffff; font-size: 80%" align="center"\|1,0 \|style="background: #ffffff; font-size: 80%" align="center"\|1,3 \|style="background: #ffffff; font-size: 80%" align="center"\|1,0 \|- \| rowspan="1" style="background: #e7dcc3; font-size: 110%" align="center"\| 2001 \|style="background: #e7dcc3; font-size: 80%" align="center"\|100,6 \|style="background: #e7dcc3; font-size: 80%" align="center"\|101,3 \|style="background: #e7dcc3; font-size: 80%" align="center"\|101,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\|102,4 \|style="background: #e7dcc3; font-size: 80%" align="center"\|102,8 \|style="background: #e7dcc3; font-size: 80%" align="center"\|102,7 \|style="background: #e7dcc3; font-size: 80%" align="center"\|102,4 \|style="background: #e7dcc3; font-size: 80%" align="center"\|102,4 \|style="background: #e7dcc3; font-size: 80%" align="center"\|102,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\|103 \|style="background: #e7dcc3; font-size: 80%" align="center"\|102,8 \|style="background: #e7dcc3; font-size: 80%" align="center"\|103 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|2,3 \|style="background: #ffffff; font-size: 80%" align="center"\|2,4 \|style="background: #ffffff; font-size: 80%" align="center"\|2,3 \|style="background: #ffffff; font-size: 80%" align="center"\|2,7 \|style="background: #ffffff; font-size: 80%" align="center"\|2,7 \|style="background: #ffffff; font-size: 80%" align="center"\|2,3 \|style="background: #ffffff; font-size: 80%" align="center"\|2,4 \|style="background: #ffffff; font-size: 80%" align="center"\|2,5 \|style="background: #ffffff; font-size: 80%" align="center"\|2,3 \|style="background: #ffffff; font-size: 80%" align="center"\|2,2 \|style="background: #ffffff; font-size: 80%" align="center"\|1,9 \|style="background: #ffffff; font-size: 80%" align="center"\|2,2 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|1,5 \|style="background: #ffffff; font-size: 80%" align="center"\|1,4 \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|style="background: #ffffff; font-size: 80%" align="center"\|2,6 \|style="background: #ffffff; font-size: 80%" align="center"\|2,8 \|style="background: #ffffff; font-size: 80%" align="center"\|2,7 \|style="background: #ffffff; font-size: 80%" align="center"\|2,7 \|style="background: #ffffff; font-size: 80%" align="center"\|2,9 \|style="background: #ffffff; font-size: 80%" align="center"\|3,0 \|style="background: #ffffff; font-size: 80%" align="center"\|2,5 \|style="background: #ffffff; font-size: 80%" align="center"\|2,5 \|style="background: #ffffff; font-size: 80%" align="center"\|2,7 \|- \| rowspan="1" style="background: #e7dcc3; font-size: 110%" align="center"\| 2002 \|style="background: #e7dcc3; font-size: 80%" align="center"\|103,1 \|style="background: #e7dcc3; font-size: 80%" align="center"\|103,8 \|style="background: #e7dcc3; font-size: 80%" align="center"\|104,5 \|style="background: #e7dcc3; font-size: 80%" align="center"\|104,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\|105 \|style="background: #e7dcc3; font-size: 80%" align="center"\|105 \|style="background: #e7dcc3; font-size: 80%" align="center"\|104,7 \|style="background: #e7dcc3; font-size: 80%" align="center"\|104,8 \|style="background: #e7dcc3; font-size: 80%" align="center"\|105,4 \|style="background: #e7dcc3; font-size: 80%" align="center"\|105,6 \|style="background: #e7dcc3; font-size: 80%" align="center"\|105,6 \|style="background: #e7dcc3; font-size: 80%" align="center"\|105,6 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|2,5 \|style="background: #ffffff; font-size: 80%" align="center"\|2,5 \|style="background: #ffffff; font-size: 80%" align="center"\|2,5 \|style="background: #ffffff; font-size: 80%" align="center"\|2,4 \|style="background: #ffffff; font-size: 80%" align="center"\|2,1 \|style="background: #ffffff; font-size: 80%" align="center"\|2,2 \|style="background: #ffffff; font-size: 80%" align="center"\|2,2 \|style="background: #ffffff; font-size: 80%" align="center"\|2,3 \|style="background: #ffffff; font-size: 80%" align="center"\|2,4 \|style="background: #ffffff; font-size: 80%" align="center"\|2,5 \|style="background: #ffffff; font-size: 80%" align="center"\|2,7 \|style="background: #ffffff; font-size: 80%" align="center"\|2,5 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|2,7 \|style="background: #ffffff; font-size: 80%" align="center"\|2,6 \|style="background: #ffffff; font-size: 80%" align="center"\|2,7 \|style="background: #ffffff; font-size: 80%" align="center"\|2,3 \|style="background: #ffffff; font-size: 80%" align="center"\|1,8 \|style="background: #ffffff; font-size: 80%" align="center"\|1,8 \|style="background: #ffffff; font-size: 80%" align="center"\|2,0 \|style="background: #ffffff; font-size: 80%" align="center"\|1,8 \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|style="background: #ffffff; font-size: 80%" align="center"\|2,3 \|style="background: #ffffff; font-size: 80%" align="center"\|2,0 \|style="background: #ffffff; font-size: 80%" align="center"\|2,1 \|- \| rowspan="1" style="background: #e7dcc3; font-size: 110%" align="center" \| 2003 \|style="background: #e7dcc3; font-size: 80%" align="center"\|105,8 \|style="background: #e7dcc3; font-size: 80%" align="center"\|106,8 \|style="background: #e7dcc3; font-size: 80%" align="center"\|107,5 \|style="background: #e7dcc3; font-size: 80%" align="center"\|107,5 \|style="background: #e7dcc3; font-size: 80%" align="center"\|107,3 \|style="background: #e7dcc3; font-size: 80%" align="center"\|107,3 \|style="background: #e7dcc3; font-size: 80%" align="center"\|106,7 \|style="background: #e7dcc3; font-size: 80%" align="center"\|106,6 \|style="background: #e7dcc3; font-size: 80%" align="center"\|107,4 \|style="background: #e7dcc3; font-size: 80%" align="center"\|107,1 \|style="background: #e7dcc3; font-size: 80%" align="center"\|107,2 \|style="background: #e7dcc3; font-size: 80%" align="center"\|107,1 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|2,6 \|style="background: #ffffff; font-size: 80%" align="center"\|2,9 \|style="background: #ffffff; font-size: 80%" align="center"\|2,9 \|style="background: #ffffff; font-size: 80%" align="center"\|2,5 \|style="background: #ffffff; font-size: 80%" align="center"\|2,2 \|style="background: #ffffff; font-size: 80%" align="center"\|2,2 \|style="background: #ffffff; font-size: 80%" align="center"\|1,9 \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|style="background: #ffffff; font-size: 80%" align="center"\|1,9 \|style="background: #ffffff; font-size: 80%" align="center"\|1,4 \|style="background: #ffffff; font-size: 80%" align="center"\|1,5 \|style="background: #ffffff; font-size: 80%" align="center"\|1,4 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|2,7 \|style="background: #ffffff; font-size: 80%" align="center"\|3,3 \|style="background: #ffffff; font-size: 80%" align="center"\|3,0 \|style="background: #ffffff; font-size: 80%" align="center"\|2,2 \|style="background: #ffffff; font-size: 80%" align="center"\|1,8 \|style="background: #ffffff; font-size: 80%" align="center"\|1,6 \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|style="background: #ffffff; font-size: 80%" align="center"\|1,6 \|style="background: #ffffff; font-size: 80%" align="center"\|1,5 \|style="background: #ffffff; font-size: 80%" align="center"\|1,3 \|style="background: #ffffff; font-size: 80%" align="center"\|1,3 \|style="background: #ffffff; font-size: 80%" align="center"\|1,3 \|- \| rowspan="1" style="background: #e7dcc3; font-size: 110%" align="center" \| 2004 \|style="background: #e7dcc3; font-size: 80%" align="center"\|107 \|style="background: #e7dcc3; font-size: 80%" align="center"\|107,8 \|style="background: #e7dcc3; font-size: 80%" align="center"\|108,3 \|style="background: #e7dcc3; font-size: 80%" align="center"\|108,4 \|style="background: #e7dcc3; font-size: 80%" align="center"\|108,7 \|style="background: #e7dcc3; font-size: 80%" align="center"\|108,5 \|style="background: #e7dcc3; font-size: 80%" align="center"\|108,1 \|style="background: #e7dcc3; font-size: 80%" align="center"\|107,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\|108,6 \|style="background: #e7dcc3; font-size: 80%" align="center"\|108,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\|108,6 \|style="background: #e7dcc3; font-size: 80%" align="center"\|108,4 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|1,1 \|style="background: #ffffff; font-size: 80%" align="center"\|0,9 \|style="background: #ffffff; font-size: 80%" align="center"\|0,7 \|style="background: #ffffff; font-size: 80%" align="center"\|0,8 \|style="background: #ffffff; font-size: 80%" align="center"\|1,3 \|style="background: #ffffff; font-size: 80%" align="center"\|1,1 \|style="background: #ffffff; font-size: 80%" align="center"\|1,3 \|style="background: #ffffff; font-size: 80%" align="center"\|1,2 \|style="background: #ffffff; font-size: 80%" align="center"\|1,1 \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|style="background: #ffffff; font-size: 80%" align="center"\|1,3 \|style="background: #ffffff; font-size: 80%" align="center"\|1,2 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|0,7 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|0,4 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|0,2 \|style="background: #ffffff; font-size: 80%" align="center"\|0,2 \|style="background: #ffffff; font-size: 80%" align="center"\|0,6 \|style="background: #ffffff; font-size: 80%" align="center"\|0,4 \|style="background: #ffffff; font-size: 80%" align="center"\|0,6 \|style="background: #ffffff; font-size: 80%" align="center"\|0,5 \|style="background: #ffffff; font-size: 80%" align="center"\|0,5 \|style="background: #ffffff; font-size: 80%" align="center"\|0,8 \|style="background: #ffffff; font-size: 80%" align="center"\|0,4 \|style="background: #ffffff; font-size: 80%" align="center"\|0,3 \|- \| rowspan="1" style="background: #e7dcc3; font-size: 110%" align="center"\| 2005 \|style="background: #e7dcc3; font-size: 80%" align="center"\|108,1 \|style="background: #e7dcc3; font-size: 80%" align="center"\|109,2 \|style="background: #e7dcc3; font-size: 80%" align="center"\|109,8 \|style="background: #e7dcc3; font-size: 80%" align="center"\|110,4 \|style="background: #e7dcc3; font-size: 80%" align="center"\|110,3 \|style="background: #e7dcc3; font-size: 80%" align="center"\|110,4 \|style="background: #e7dcc3; font-size: 80%" align="center"\|110,3 \|style="background: #e7dcc3; font-size: 80%" align="center"\|110,3 \|style="background: #e7dcc3; font-size: 80%" align="center"\|111,2 \|style="background: #e7dcc3; font-size: 80%" align="center"\|111,1 \|style="background: #e7dcc3; font-size: 80%" align="center"\|110,8 \|style="background: #e7dcc3; font-size: 80%" align="center"\|110,8 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|1,0 \|style="background: #ffffff; font-size: 80%" align="center"\|1,3 \|style="background: #ffffff; font-size: 80%" align="center"\|1,4 \|style="background: #ffffff; font-size: 80%" align="center"\|1,8 \|style="background: #ffffff; font-size: 80%" align="center"\|1,5 \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|style="background: #ffffff; font-size: 80%" align="center"\|2,0 \|style="background: #ffffff; font-size: 80%" align="center"\|2,2 \|style="background: #ffffff; font-size: 80%" align="center"\|2,4 \|style="background: #ffffff; font-size: 80%" align="center"\|2,0 \|style="background: #ffffff; font-size: 80%" align="center"\|2,0 \|style="background: #ffffff; font-size: 80%" align="center"\|2,2 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|0,0 \|style="background: #ffffff; font-size: 80%" align="center"\|0,7 \|style="background: #ffffff; font-size: 80%" align="center"\|0,1 \|style="background: #ffffff; font-size: 80%" align="center"\|0,3 \|style="background: #ffffff; font-size: 80%" align="center"\|0,1 \|style="background: #ffffff; font-size: 80%" align="center"\|0,6 \|style="background: #ffffff; font-size: 80%" align="center"\|0,3 \|style="background: #ffffff; font-size: 80%" align="center"\|0,6 \|style="background: #ffffff; font-size: 80%" align="center"\|0,6 \|style="background: #ffffff; font-size: 80%" align="center"\|0,5 \|style="background: #ffffff; font-size: 80%" align="center"\|0,8 \|style="background: #ffffff; font-size: 80%" align="center"\|0,9 \|- \| rowspan="1" style="background: #e7dcc3; font-size: 110%" align="center"\| 2006 \|style="background: #e7dcc3; font-size: 80%" align="center"\|110,4 \|style="background: #e7dcc3; font-size: 80%" align="center"\|111,5 \|style="background: #e7dcc3; font-size: 80%" align="center"\|111,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\|112,4 \|style="background: #e7dcc3; font-size: 80%" align="center"\|112,5 \|style="background: #e7dcc3; font-size: 80%" align="center"\|112,8 \|style="background: #e7dcc3; font-size: 80%" align="center"\|112,5 \|style="background: #e7dcc3; font-size: 80%" align="center"\|112,5 \|style="background: #e7dcc3; font-size: 80%" align="center"\|112,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\|112,8 \|style="background: #e7dcc3; font-size: 80%" align="center"\|112,7 \|style="background: #e7dcc3; font-size: 80%" align="center"\|112,8 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|2,1 \|style="background: #ffffff; font-size: 80%" align="center"\|2,1 \|style="background: #ffffff; font-size: 80%" align="center"\|1,9 \|style="background: #ffffff; font-size: 80%" align="center"\|1,8 \|style="background: #ffffff; font-size: 80%" align="center"\|1,2 \|style="background: #ffffff; font-size: 80%" align="center"\|2,2 \|style="background: #ffffff; font-size: 80%" align="center"\|2,0 \|style="background: #ffffff; font-size: 80%" align="center"\|2,0 \|style="background: #ffffff; font-size: 80%" align="center"\|1,5 \|style="background: #ffffff; font-size: 80%" align="center"\|1,5 \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|style="background: #ffffff; font-size: 80%" align="center"\|1,8 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|0,6 \|style="background: #ffffff; font-size: 80%" align="center"\|0,6 \|style="background: #ffffff; font-size: 80%" align="center"\|1,1 \|style="background: #ffffff; font-size: 80%" align="center"\|1,5 \|style="background: #ffffff; font-size: 80%" align="center"\|1,6 \|style="background: #ffffff; font-size: 80%" align="center"\|1,5 \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|style="background: #ffffff; font-size: 80%" align="center"\|1,6 \|style="background: #ffffff; font-size: 80%" align="center"\|1,5 \|style="background: #ffffff; font-size: 80%" align="center"\|1,3 \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|style="background: #ffffff; font-size: 80%" align="center"\|1,6 \|- \| rowspan="1" style="background: #e7dcc3; font-size: 110%" align="center"\| 2007 \|style="background: #e7dcc3; font-size: 80%" align="center"\|112,4 \|style="background: #e7dcc3; font-size: 80%" align="center"\|113,6 \|style="background: #e7dcc3; font-size: 80%" align="center"\|114,1 \|style="background: #e7dcc3; font-size: 80%" align="center"\|114,3 \|style="background: #e7dcc3; font-size: 80%" align="center"\|114,5 \|style="background: #e7dcc3; font-size: 80%" align="center"\|114,4 \|style="background: #e7dcc3; font-size: 80%" align="center"\|113,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\|113,7 \|style="background: #e7dcc3; font-size: 80%" align="center"\|114,3 \|style="background: #e7dcc3; font-size: 80%" align="center"\|114,7 \|style="background: #e7dcc3; font-size: 80%" align="center"\|115,5 \|style="background: #e7dcc3; font-size: 80%" align="center"\|115,4 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|1,8 \|style="background: #ffffff; font-size: 80%" align="center"\|1,9 \|style="background: #ffffff; font-size: 80%" align="center"\|2,0 \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|style="background: #ffffff; font-size: 80%" align="center"\|1,8 \|style="background: #ffffff; font-size: 80%" align="center"\|1,4 \|style="background: #ffffff; font-size: 80%" align="center"\|1,2 \|style="background: #ffffff; font-size: 80%" align="center"\|1,1 \|style="background: #ffffff; font-size: 80%" align="center"\|1,2 \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|style="background: #ffffff; font-size: 80%" align="center"\|2,5 \|style="background: #ffffff; font-size: 80%" align="center"\|2,3 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|1,9 \|style="background: #ffffff; font-size: 80%" align="center"\|2,0 \|style="background: #ffffff; font-size: 80%" align="center"\|1,9 \|style="background: #ffffff; font-size: 80%" align="center"\|1,9 \|style="background: #ffffff; font-size: 80%" align="center"\|1,7 \|style="background: #ffffff; font-size: 80%" align="center"\|1,9 \|style="background: #ffffff; font-size: 80%" align="center"\|1,9 \|style="background: #ffffff; font-size: 80%" align="center"\|1,8 \|style="background: #ffffff; font-size: 80%" align="center"\|2,2 \|style="background: #ffffff; font-size: 80%" align="center"\|2,7 \|style="background: #ffffff; font-size: 80%" align="center"\|3,3 \|style="background: #ffffff; font-size: 80%" align="center"\|3,5 \|- \| rowspan="1" style="background: #e7dcc3; font-size: 110%" align="center"\| 2008 \|style="background: #e7dcc3; font-size: 80%" align="center"\|115,7 \|style="background: #e7dcc3; font-size: 80%" align="center"\|117,1 \|style="background: #e7dcc3; font-size: 80%" align="center"\|117,6 \|style="background: #e7dcc3; font-size: 80%" align="center"\|118 \|style="background: #e7dcc3; font-size: 80%" align="center"\|118,4 \|style="background: #e7dcc3; font-size: 80%" align="center"\|118,8 \|style="background: #e7dcc3; font-size: 80%" align="center"\|118,4 \|style="background: #e7dcc3; font-size: 80%" align="center"\|118,6 \|style="background: #e7dcc3; font-size: 80%" align="center"\|119,1 \|style="background: #e7dcc3; font-size: 80%" align="center"\|118,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\|118,6 \|style="background: #e7dcc3; font-size: 80%" align="center"\|118,2 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|2,9 \|style="background: #ffffff; font-size: 80%" align="center"\|3,1 \|style="background: #ffffff; font-size: 80%" align="center"\|3,1 \|style="background: #ffffff; font-size: 80%" align="center"\|3,2 \|style="background: #ffffff; font-size: 80%" align="center"\|3,4 \|style="background: #ffffff; font-size: 80%" align="center"\|3,8 \|style="background: #ffffff; font-size: 80%" align="center"\|3,9 \|style="background: #ffffff; font-size: 80%" align="center"\|4,3 \|style="background: #ffffff; font-size: 80%" align="center"\|4,2 \|style="background: #ffffff; font-size: 80%" align="center"\|3,7 \|style="background: #ffffff; font-size: 80%" align="center"\|2,7 \|style="background: #ffffff; font-size: 80%" align="center"\|2,4 \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|3,2 \|style="background: #ffffff; font-size: 80%" align="center"\|3,1 \|style="background: #ffffff; font-size: 80%" align="center"\|3,4 \|style="background: #ffffff; font-size: 80%" align="center"\|3,3 \|style="background: #ffffff; font-size: 80%" align="center"\|3,9 \|style="background: #ffffff; font-size: 80%" align="center"\|4,2 \|style="background: #ffffff; font-size: 80%" align="center"\|4,1 \|style="background: #ffffff; font-size: 80%" align="center"\|4,3 \|style="background: #ffffff; font-size: 80%" align="center"\|4,4 \|style="background: #ffffff; font-size: 80%" align="center"\|4,0 \|style="background: #ffffff; font-size: 80%" align="center"\|2,5 \|style="background: #ffffff; font-size: 80%" align="center"\|0,9 \|- \| rowspan="1" style="background: #e7dcc3; font-size: 110%" align="center"\| 2009 \|style="background: #e7dcc3; font-size: 80%" align="center"\|117,8 \|style="background: #e7dcc3; font-size: 80%" align="center"\|119,3 \|style="background: #e7dcc3; font-size: 80%" align="center"\|119,7 \|style="background: #e7dcc3; font-size: 80%" align="center"\|119,6 \|style="background: #e7dcc3; font-size: 80%" align="center"\|119,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\|120,2 \|style="background: #e7dcc3; font-size: 80%" align="center"\|119,6 \|style="background: #e7dcc3; font-size: 80%" align="center"\|119,9 \|style="background: #e7dcc3; font-size: 80%" align="center"\| \|style="background: #e7dcc3; font-size: 80%" align="center"\| \|style="background: #e7dcc3; font-size: 80%" align="center"\| \|style="background: #e7dcc3; font-size: 80%" align="center"\| \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|1,8 \|style="background: #ffffff; font-size: 80%" align="center"\|1,9 \|style="background: #ffffff; font-size: 80%" align="center"\|1,8 \|style="background: #ffffff; font-size: 80%" align="center"\|1,4 \|style="background: #ffffff; font-size: 80%" align="center"\|1,3 \|style="background: #ffffff; font-size: 80%" align="center"\|1,2 \|style="background: #ffffff; font-size: 80%" align="center"\|1,0 \|style="background: #ffffff; font-size: 80%" align="center"\|1,1 \|style="background: #ffffff; font-size: 80%" align="center"\| \|style="background: #ffffff; font-size: 80%" align="center"\| \|style="background: #ffffff; font-size: 80%" align="center"\| \|style="background: #ffffff; font-size: 80%" align="center"\| \|- \| rowspan="1" \| \|style="background: #ffffff; font-size: 80%" align="center"\|1,3 \|style="background: #ffffff; font-size: 80%" align="center"\|0,9 \|style="background: #ffffff; font-size: 80%" align="center"\|0,2 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|0,1 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|0,4 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|0,6 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|0,9 \|style="background: #ffffff; font-size: 80%; color:#FF0033" align="center"\|0,8 \|style="background: #ffffff; font-size: 80%" align="center"\| \|style="background: #ffffff; font-size: 80%" align="center"\| \|style="background: #ffffff; font-size: 80%" align="center"\| \|style="background: #ffffff; font-size: 80%" align="center"\| \|- \|colspan ="13" style="background: #e7dcc3; font-size: 90%" \| Data fra Danmarks Statistik<ref>Forbrugerprisindeks, hovedtal – Danmarks Statistik</ref> og Statistiska centralbyrånRøde tal er lig med negativ inflation (deflation). \|} \|} Se også Fiat currency Kerneinflation Bruttonationalprodukt Hedonisk regression Household final consumption expenditure (HFCE) GDP deflator Inflation-justering Varekurv Personal Consumption Expenditures Price Index (PCEPI) Producentprisindeks (PPI) Substitution (økonomi) Noter Eksterne links ILO CPI manual This large manual produced co-operatively by a number of international organizations is the standard work on the methods of compiling consumer price indexes and on the underlying economic and statistical theory. OECD CPI page Pithy summaries of the characteristics of the consumer price indexes in OECD member countries. myCPI.info Project for establishing alternative CPI data based on users inputting and tracking their personal CPI. "The Consumer Price Index and index number purpose": A technical article by economist W.E. Diewert Eksterne links (specifikke lande) Forbrugerprisindeks for Sverige 1290-2006 Consumer Price Index Home Page , U.S. Department of Labor, Bureau of Labor Statistics. Shadow Government Statistics , Aktuelle US-tal kalkuleret ved hjælp af gamle officielle udregningsmetoder, som tillader en mere nøjagtig sammenligning af aktuelle versus historiske tal. En detaljeret redegørelse af det amerikanske index . National Statistics Online: Consumer Prices , UK Office for National Statistics. En detaljeret redegørelse af de UK indekset . Consumer Price Index , INSEE. En beskrivelse af det franske forbrugerprisindeks (på fransk). Verbraucherpreise , Tysklands Føderale Statistiske Kontor. Consumer Price Index , Instituto Nacional de Estadística'' (Spanien). En detaljeret redegørelse på engelsk om det svenske forbrugerprisindeks . US Inflation Calculator & CPI Information US Inflations Kalkulator og FPI data (1913-nu). Hong Kong Forbrugerprisindeks – Census and Statistics Department Indekstal Økonomiske indikatorer Makroøkonomi	danish	1.053814
Pony/builtin-Comparable-.txt	Comparable[A: Comparable[A] #read]¶ [Source] interface ref Comparable[A: Comparable[A] #read] is Equatable[A] ref Implements¶ Equatable[A] ref Public Functions¶ lt¶ [Source] fun box lt( that: box->A) : Bool val Parameters¶ that: box->A Returns¶ Bool val le¶ [Source] fun box le( that: box->A) : Bool val Parameters¶ that: box->A Returns¶ Bool val ge¶ [Source] fun box ge( that: box->A) : Bool val Parameters¶ that: box->A Returns¶ Bool val gt¶ [Source] fun box gt( that: box->A) : Bool val Parameters¶ that: box->A Returns¶ Bool val compare¶ [Source] fun box compare( that: box->A) : (Less val \| Equal val \| Greater val) Parameters¶ that: box->A Returns¶ (Less val \| Equal val \| Greater val) eq¶ [Source] fun box eq( that: box->A) : Bool val Parameters¶ that: box->A Returns¶ Bool val ne¶ [Source] fun box ne( that: box->A) : Bool val Parameters¶ that: box->A Returns¶ Bool val	pony	2475542	https://sv.wikipedia.org/wiki/Babcock%20%28auktor%29	Babcock (auktor)	Babcock kan som auktorsförkortning betyda: Carolyn E. Babcock Ernest Brown Babcock Laurel C. Babcock Robotskapade auktorsförkortningar	swedish	1.266029
Pony/cli--index-.txt	CLI Package¶ The CLI package provides enhanced Posix+GNU command line parsing with the feature of commands that can be specified in a hierarchy. See RFC-0038 for more background. The general EBNF of a command line is: command_line ::= root_command (option \| command)* (option \| arg)* command ::= alphanum_word alphanum_word ::= alphachar(alphachar \| numchar \| '_' \| '-')* option ::= longoption \| shortoptionset longoption ::= '--'alphanum_word['='arg \| ' 'arg] shortoptionset := '-'alphachar[alphachar]...['='arg \| ' 'arg] arg := boolarg \| intarg \| floatarg \| stringarg boolarg := 'true' \| 'false' intarg> := ['-'] numchar... floatarg ::= ['-'] numchar... ['.' numchar...] stringarg ::= anychar Some examples: usage: ls [<options>] [<args> ...] usage: make [<options>] <command> [<options>] [<args> ...] usage: chat [<options>] <command> <subcommand> [<options>] [<args> ...] Usage¶ The types in the cli package are broken down into three groups: Specs¶ Pony programs use constructors to create the spec objects to specify their command line syntax. Many aspects of the spec are checked for correctness at compile time, and the result represents everything the parser needs to know when parsing a command line or forming syntax help messages. Option and Arg value types¶ Options and Args parse values from the command line as one of four Pony types: Bool, String, I64 and F64. Values of each of these types can then be retrieved using the corresponding accessor funtions. In addition, there is a string_seq type that accepts string values from the command line and collects them into a sequence which can then be retrieved as a ReadSeq[String] using the string_seq() accessor function. Some specific details: bool Options: have a default value of 'true' if no value is given. That is, -f is equivalent to -f=true. string_seq Options: the option prefix has to be used each time, like: --file=f1 --file=f2 --file=f3 with the results being collected into a single sequence. string_seq Args: there is no way to indicate termination, so a string_seq Arg should be the last arg for a command, and will consume all remaining command line arguments. Parser¶ Programs then use the CommandSpec they've built to instantiate a parser to parse any given command line. This is often env.args(), but could also be commands from files or other input sources. The result of a parse is either a parsed command, a command help, or a syntax error object. Commands¶ Programs then match the object returned by the parser to determine what kind it is. Errors and help requests typically print messages and exit. For commands, the fullname can be matched and the effective values for the command's options and arguments can be retrieved. Example program¶ This program echos its command line arguments with the option of uppercasing them. use "cli" actor Main new create(env: Env) => let cs = try CommandSpec.leaf("echo", "A sample echo program", [ OptionSpec.bool("upper", "Uppercase words" where short' = 'U', default' = false) ], [ ArgSpec.string_seq("words", "The words to echo") ])? .> add_help()? else env.exitcode(-1) // some kind of coding error return end let cmd = match CommandParser(cs).parse(env.args, env.vars) \| let c: Command => c \| let ch: CommandHelp => ch.print_help(env.out) env.exitcode(0) return \| let se: SyntaxError => env.out.print(se.string()) env.exitcode(1) return end let upper = cmd.option("upper").bool() let words = cmd.arg("words").string_seq() for word in words.values() do env.out.write(if upper then word.upper() else word end + " ") end env.out.print("") Public Types¶ class Arg class ArgSpec class Command class CommandHelp class CommandParser class CommandSpec primitive EnvVars primitive Help class Option class OptionSpec class SyntaxError	pony	174651	https://da.wikipedia.org/wiki/VBScript	VBScript	VBScript (kort for Visual Basic Scripting Edition) er et "script"-sprog, der fortolkes via Microsoft's Windows Script Host. Sprogets syntax viser dets oprindelse som en variation af Microsoft's Visual Basic programmeringssprog. Det blev i begyndelsen især brugt af Windows-administratorer der ønskede at automatisere visse operationer mere end batch-sproget fra 1970'erne var i stand til. Typisk kunne dette være sig et script der kørte ved "log on" på en server. Sproget kan håndtere mange ting, da det understøtter API-kald. Eksempel på kode: strComputer = "." Set objWMIService = GetObject("winmgmts:{impersonationLevel=impersonate}!\\" & strComputer & "\root\cimv2") Set colStartupCommands = objWMIService.ExecQuery("Select * from Win32_StartupCommand") For Each objStartupCommand in colStartupCommands Wscript.Echo "Kommando: " & objStartupCommand.Command Wscript.Echo "Beskrivelse: " & objStartupCommand.Description Wscript.Echo "Placering: " & objStartupCommand.Location Wscript.Echo "Navn: " & objStartupCommand.Name Wscript.Echo "InstillingsID: " & objStartupCommand.SettingID Wscript.Echo "Bruger: " & objStartupCommand.User Next Kode-eksemplet her viser information om hvilke programmer der starter op sammen med computeren. VBScript har filtypenavnet (filens efternavn, extension) .vbs og bliver eksekveret af filen wscript eller cscript, :Wscript er en "windows-baseret" metode (W for windows) hvor alle meddelelser 'popper' op på skærmen :Cscript er en "command-baseret" metode (C for command) hvor man har mulighed for at modtage meddelelser i kommando-vinduet. Eksterne henvisninger VBScript User's Guide, en vejledning The Script Center – Script Repository, en samling af scripts VBScript Compiler for Microsoft .NET , en compiler til oversættelse - link virker ikke mere. Om "batch"-sproget fra 1970'erne, som VBScript kunne afløse. (engelsk Wiki) Programmeringssprog Microsoft Windows	danish	0.87749
Pony/pony_check-ASCIIPrintable-.txt	ASCIIPrintable¶ [Source] primitive val ASCIIPrintable Constructors¶ create¶ [Source] new val create() : ASCIIPrintable val^ Returns¶ ASCIIPrintable val^ Public Functions¶ apply¶ [Source] fun box apply() : String val Returns¶ String val eq¶ [Source] fun box eq( that: ASCIIPrintable val) : Bool val Parameters¶ that: ASCIIPrintable val Returns¶ Bool val ne¶ [Source] fun box ne( that: ASCIIPrintable val) : Bool val Parameters¶ that: ASCIIPrintable val Returns¶ Bool val	pony	2151239	https://sv.wikipedia.org/wiki/Pseudopallene%20brevicollis	Pseudopallene brevicollis	Pseudopallene brevicollis är en havsspindelart som först beskrevs av Sars, G.O. 1891. Pseudopallene brevicollis ingår i släktet Pseudopallene och familjen Callipallenidae. Inga underarter finns listade i Catalogue of Life. Källor Havsspindlar brevicollis	swedish	1.163956
Pony/examples.txt	# Examples Small _how do I_ examples for Pony. These will eventually find another home. Until then, they live here. ## Enumeration with values ```pony primitive Black fun apply(): U32 => 0xFF000000 primitive Red fun apply(): U32 => 0xFFFF0000 ``` ## Enumeration with values with namespace ```pony primitive Colours fun black(): U32 => 0xFF000000 fun red(): U32 => 0xFFFF0000 ``` ## Enumeration which can be iterated ```pony primitive Black primitive Blue primitive Red primitive Yellow type Colour is (Black \| Blue \| Red \| Yellow) primitive ColourList fun tag apply(): Array[Colour] => [Black; Blue; Red; Yellow] for colour in ColourList().values() do end ``` ## Pass an Array of values to FFI ```pony use @eglChooseConfig[U32](disp: Pointer[_EGLDisplayHandle], attrs: Pointer[U16] tag, config: Pointer[_EGLConfigHandle], config_size: U32, num_config: Pointer[U32]) primitive _EGLConfigHandle let a = Array[U16](8) a.push(0x3040) a.push(0x4) a.push(0x3033) a.push(0x4) a.push(0x3022) a.push(0x8) a.push(0x3023) a.push(0x8) a.push(0x3024) let config = Pointer[_EGLConfigHandle] if @eglChooseConfig(e_dpy, a.cpointer(), config, U32(1), Pointer[U32]) == 0 then env.out.print("eglChooseConfig failed") end ``` ## How to access command line arguments ```pony actor Main new create(env: Env) => // The no of arguments env.out.print(env.args.size().string()) for value in env.args.values() do env.out.print(value) end // Access the arguments the first one will always be the application name try env.out.print(env.args(0)?) end ``` ## How to use the `cli` package to parse command line arguments ```pony use "cli" actor Main new create(env: Env) => let command_spec = try CommandSpec.leaf( "pony-embed", "sample program", [ OptionSpec.string("output", "output filename", 'o') ], [ ArgSpec.string("input", "source of input" where default' = "-") ] )? .> add_help()? else env.exitcode(1) return end let command = match CommandParser(command_spec).parse(env.args, env.vars) \| let c: Command => c \| let ch: CommandHelp => ch.print_help(env.out) env.exitcode(0) return \| let se: SyntaxError => env.err.print(se.string()) env.exitcode(1) return end let input_source = command.arg("input").string() let output_filename = command.option("output").string() env.out.print("Loading data from " + input_source + ". Writing output to " + output_filename) // ... ``` ## How to write tests Create a test.pony file ```pony use "pony_test" actor Main is TestList new create(env: Env) => PonyTest(env, this) new make() => None fun tag tests(test: PonyTest) => test(_TestAddition) class iso _TestAddition is UnitTest """ Adding 2 numbers """ fun name(): String => "u32/add" fun apply(h: TestHelper) => h.assert_eq[U32](2 + 2, 4) ``` Some assertions you can make with `TestHelper` are ```pony fun tag log(msg: String, verbose: Bool = false) be fail() => be assert_failed(msg: String) => fun tag assert_true(actual: Bool, msg: String = "") ? fun tag expect_true(actual: Bool, msg: String = ""): Bool fun tag assert_false(actual: Bool, msg: String = "") ? fun tag expect_false(actual: Bool, msg: String = ""): Bool fun tag assert_error(test: ITest, msg: String = "") ? fun tag expect_error(test: ITest box, msg: String = ""): Bool fun tag assert_is (expect: Any, actual: Any, msg: String = "") ? fun tag expect_is (expect: Any, actual: Any, msg: String = ""): Bool fun tag assert_eq[A: (Equatable[A] #read & Stringable)] (expect: A, actual: A, msg: String = "") ? fun tag expect_eq[A: (Equatable[A] #read & Stringable)] (expect: A, actual: A, msg: String = ""): Bool ``` ## Operator overloading (easy for copy and paste) ```pony fun add(other: A): A fun sub(other: A): A fun mul(other: A): A fun div(other: A): A fun rem(other: A): A fun mod(other: A): A fun eq(other: A): Bool fun ne(other: A): Bool fun lt(other: A): Bool fun le(other: A): Bool fun ge(other: A): Bool fun gt(other: A): Bool fun shl(other: A): A fun shr(other: A): A fun op_and(other:A): A fun op_or(other: A): A fun op_xor(othr: A): A ``` ## Create empty functions in a class ```pony class Test fun alpha() => """ """ fun beta() => """ """ ``` ## How to create Arrays with values Single values can be separated by semicolon or newline. ```pony let dice: Array[U32] = [1; 2; 3 4 5 6 ] ``` ## How to modify a lexically captured variable in a closure ```pony actor Main fun foo(n:U32): {ref(U32): U32} => var s: Array[U32] = Array[U32].init(n, 1) {ref(i:U32)(s): U32 => try s(0)? = s(0)? + i s(0)? else 0 end } new create(env:Env) => var f = foo(5) env.out.print(f(10).string()) env.out.print(f(20).string()) ```	pony	1547419	https://sv.wikipedia.org/wiki/Clojure	Clojure	Clojure är en dialekt inom Lisp-familjen av programmeringsspråk. Clojure skapades av Rich Hickey och släpptes i sin första version i slutet av 2009. Det är ett programmeringsspråk för allmän användning, som stödjer interaktiv utveckling och uppmuntrar en funktionell programmeringsstil. Clojure (liksom vissa andra programmeringsspråk) körs på Java Virtual Machine, Common Language Runtime och kan kompileras till Javascript. Bakgrund Enligt skaparen, Rich Hickey, är språket framtaget för att vara lättanvänt och ha god prestanda, snarare än att vara ett akademiskt projekt. Vidare ger Clojures API ett jämförelsevis enkelt förfarande för att inter-operera med existerande Java-bibliotek. Kännetecken Clojure är ett språk med fokus på funktionell programmering och samverkande ("concurrent" på engelska) programmering. På grund av denna inriktning stödjer Clojure följande funktioner: STM (Software Transactional Memory) med inbyggda makron för att genomföra atomiska transaktioner på gemensamma data Persistenta datastrukturer Funktioner av första klass (funktioner är värden) Syntax Clojures syntax byggs på S-uttryck, något som är typiskt för ett Lisp-språk. Clojure är en Lisp-1, vilket innebär att funktioner och andra värden delar på en namnrymd. Språket kan inte kodas om till andra Lisp-dialekter eftersom det inte är kompatibelt. Det som i huvudsak gör Clojure inkompatibelt med andra dialekter är att Clojure använder specifika teckenpar för att ange olika sorters datastrukturer. I Clojure används [] för att ange vektorer, {} för att ange associativa vektorer och #{} för att ange associativa vektorer med unika värden. Exempel Hello world: (println "Hello, world!") Nedan definieras en funktion som tar en parameter (x) som anges som en vektor med ett element. Funktionen anropar multiplikationsfunktionen * med argumenten x, x. I Clojure, som med andra Lisp-dialekter, returneras det värde som den sist anropade funktionen returnerar automatiskt: (defn square [x] (* x x)) Genom att använda Javas Swing bibliotek är det möjligt att rita grafiska gränssnitt (ytterligare ett Hello World-exempel): (javax.swing.JOptionPane/showMessageDialog nil "Hello World" ) Nedan ges exempel på en trådsäker generator av unika serienummer: (let [i (atom 0)] (defn generate-unique-id "Returns a distinct numeric ID for each call." [] (swap! i inc))) En anonym underklass av java.io.Writer som inte skriver till någonting, och ett makro som använder detta för att tysta alla 'prints' inuti det: (def bit-bucket-writer (proxy [java.io.Writer] [] (write [buf] nil) (close [] nil) (flush [] nil))) (defmacro noprint "Evaluates the given expressions with all printing to out silenced." [& forms] `(binding [out bit-bucket-writer] ~@forms)) (noprint (println "Hello, nobody!")) Tio trådar manipulerar en gemensam datastruktur, vilken består av 100 vektorer, där varje vektor använder 10 (initialt sekventiella) unika tal. Varje tråd väljer repetitivt två slumpvisa positioner i två slumpvisa vektorer och byter plats på dem. Alla ändringar till vektorerna händer i transaktioner genom att använda clojures software transactional memory system. Tack vare denna transaktionskontroll tappas inget data bort trots att man manipulerar vektorerna från flera trådar parallellt 100 000 gånger i exemplet. (defn run [nvecs nitems nthreads niters] (let [vec-refs (vec (map (comp ref vec) (partition nitems (range (* nvecs nitems))))) swap #(let [v1 (rand-int nvecs) v2 (rand-int nvecs) i1 (rand-int nitems) i2 (rand-int nitems)] (dosync (let [temp (nth @(vec-refs v1) i1)] (alter (vec-refs v1) assoc i1 (nth @(vec-refs v2) i2)) (alter (vec-refs v2) assoc i2 temp)))) report #(do (prn (map deref vec-refs)) (println "Distinct:" (count (distinct (apply concat (map deref vec-refs))))))] (report) (dorun (apply pcalls (repeat nthreads #(dotimes [_ niters] (swap))))) (report))) (run 100 10 10 100000) Utfall av föregående exempel: ([0 1 2 3 4 5 6 7 8 9] [10 11 12 13 14 15 16 17 18 19] ... [990 991 992 993 994 995 996 997 998 999]) Distinct: 1000 ([382 318 466 963 619 22 21 273 45 596] [808 639 804 471 394 904 952 75 289 778] ... [484 216 622 139 651 592 379 228 242 355]) Distinct: 1000 Lisp Programspråk	swedish	0.721636
Pony/generic-constraints.txt	# Constraints ## Capability Constraints The type parameter constraint for a generic class or method can constrain to a particular capability as seen previously: ```pony class Foo[A: Any val] ``` Without the constraint, the generic must work for all possible capabilities. Sometimes you don't want to be limited to a specific capability and you can't support all capabilities. The solution for this is generic constraint qualifiers. These represent classes of capabilities that are accepted in the generic. The valid qualifiers are: \| ▷ \| Capabilities allowed \| Description \| \| -------- \| ---------------------------- \| --------------------------------------------------------------- \| \| `#read` \| `ref`, `val`, `box` \| Anything you can read from \| \| `#send` \| `iso`, `val`, `tag` \| Anything you can send to an actor \| \| `#share` \| `val`, `tag` \| Anything you can send to more than one actor \| \| `#any` \| `iso`, `trn`, `ref`, `val`, `box`, `tag` \| Default of a constraint \| \| `#alias` \| `ref`, `val`, `box`, `tag` \| Set of capabilities that alias as themselves (used by compiler) \| In the previous section, we went through extra work to support `iso`. If there's no requirement for `iso` support we can use `#read` and support `ref`, `val`, and `box`: ```pony class Foo[A: Any #read] var _c: A new create(c: A) => _c = c fun get(): this->A => _c fun ref set(c: A) => _c = c actor Main new create(env:Env) => let a = Foo[String ref](recover ref "hello".clone() end) env.out.print(a.get().string()) let b = Foo[String val]("World") env.out.print(b.get().string()) ```	pony	3806157	https://sv.wikipedia.org/wiki/Acanthinus%20clavicornis	Acanthinus clavicornis	Acanthinus clavicornis är en skalbaggsart som först beskrevs av Champion 1890. Acanthinus clavicornis ingår i släktet Acanthinus och familjen kvickbaggar. Inga underarter finns listade i Catalogue of Life. Källor Kvickbaggar clavicornis	swedish	1.591577
Pony/src-collections-ring_buffer-.txt	ring_buffer.pony 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78class RingBuffer[A] """ A ring buffer. """ embed _array: Array[A] let _mod: USize var _write: USize = 0 new create(len: USize) => """ Create a ring buffer with a fixed size. The size will be rounded up to the next power of 2. """ let n = len.max(2).next_pow2() _mod = n - 1 _array = Array[A](n) fun head(): USize ? => """ The first read that will succeed. If nothing has been written to the ring, this will raise an error. """ if _write > 0 then if _write > space() then _write - space() else 0 end else error end fun size(): USize => """ The number of elements that have been added to the ring. """ _write fun space(): USize => """ The available space in the ring. """ _mod + 1 fun apply(i: USize): this->A ? => """ Get the i-th element from the ring. If the i-th element has not yet been added or is no longer available, this will raise an error. """ if (i >= _write) or ((_write - i) > space()) then error end _array(i and _mod)? fun ref push(value: A): Bool => """ Add an element to the ring. If the ring is full, this will drop the oldest element in the ring. Returns true if an element was dropped. """ var full = false if _write < space() then _array.push(consume value) else try _array(_write and _mod)? = consume value end full = true end _write = _write + 1 full fun ref clear() => """ Clear the queue. """ _array.clear() _write = 0	pony	17937	https://sv.wikipedia.org/wiki/Brainfuck	Brainfuck	Brainfuck är ett turingkomplett esoteriskt programspråk skapat 1993 av den schweiziske fysikstudenten Urban Müller, med syfte att skapa ett språk med så liten kompilator som möjligt. Maskinkoden till Müllers ursprungliga kompilator till AmigaOS 2.0 upptog 240 bytes. Att programmera i brainfuck är svårt och att läsa koden ännu svårare. Namnet Brainfuck syftar på just detta. Paradigm Centralt i språket står en pekare och en sekvens av bytes. Initialt pekar pekaren längst till vänster i sekvensen och alla bytes har värdet noll. Det finns även en indata- och en utdata-ström. Brainfuck påminner i många avseenden om turingmaskinen och kan användas som introduktion till programmering av turingmaskiner. Minnesareans storlek varierar mellan olika implementationer men brukar i allmänhet sägas vara minst 30000 bytes. Det finns totalt åtta instruktioner. Dessa flyttar pekaren, manipulerar det minne pekaren pekar på, hanterar I/O samt styr programflödet. För att tydligare illustrera hur brainfuck-kod fungerar går den att översätta till motsvarande C-kod. Implementationsproblem Många variationer av språket har dykt upp under årens lopp, vilket har resulterat i ett antal portabilitetsproblem av varierande magnitud. Till exempel anser somliga att hash-tecknet ('#') skall betraktas som en särskild avlusningsinstruktion och vissa hävdar bestämt att varje cell i minnessekvensen skall vara två bytes stor. Ett annat problem är vad som skall hända om ','-instruktionen exekveras då det inte finns någon data att hämta från indata-strömmen. Vissa implementationer väljer att skriva 0x00 till minnet, andra väljer att skriva 0xff (-1) till minnet och ett fåtal väljer att inte skriva något alls. Exempelkod Hello World! ++++++++++[>+++++++>++++++++++>+++>+<<<<-] >++.>+.+++++++..+++.>++.<<+++++++++++++++. >.+++.------.--------.>+.>. Ett alternativ med förklaringar [ Det här programmet skriver ut "Hello World!" och en ny rad, längden är 106 aktiva tecken. [Det är inte det kortaste.] Den här loopen är en "kommentarsloop", ett enkelt sätt att lägga till en kommentar till ett BF-program så att man inte behöver oroa sig för några kommandotecken. Alla ".", ",", "+", "-", "<" och ">" ignoreras, loopkaraktärerna "[" and "]", måste dock balanseras. Den här loopen och kommandona den innehåller ignoreras eftersom den nuvarande cellen (#0) är 0 från början; värdet 0 gör att den här loopen hoppas över. ] ++++++++ Sätt cell #0 till 8 [ >++++ Addera 4 till cell #1; det här kommer alltid att sätta cell #1 till 4 [ eftersom cellen nollställs av loopen >++ Addera 2 till cell #2 >+++ Addera 3 till cell #3 >+++ Addera 3 till cell #4 >+ Addera 1 till cell #5 <<<<- Minska loopräknaren i cell #1 med 1 ] Loopa tills cell #1 är 0; antalet iterationer är 4 >+ Addera 1 till cell #2 >+ Addera 1 till cell #3 >- Subtrahera 1 från cell #4 >>+ Addera 1 till Cell #6 [<] Flytta tillbaka till den första nollan; det kommer att vara cell #1 som sattes till 0 i den förra loopen <- Minska loopräknaren i cell #0 med 1 ] Loopa tills cell #0 är 0; antalet iterationer är 8 Resultatet av det här är: Cell nr.: 0 1 2 3 4 5 6 Innehåll: 0 0 72 104 88 32 8 Pekare : ^ >>. Cell #2 har värdet 72 vilket är 'H' >---. Subtrahera 3 från cell #3 för att få 101 vilket är 'e' +++++++..+++. På samma sätt får man 'llo' från cell #3 >>. Cell #5 är 32 för blanksteg <-. Subtrahera 1 från cell #4 för att få 87 vilket är 'W' <. Cell #3 var 'o' från slutet av 'Hello' +++.------.--------. Cell #3 för att få 'rld' >>+. Addera 1 till cell #5 för att få ett utropstecken >++. Till sist får vi en ny rad från cell #6 Divisionsrutin 1 >>[-]>[-]>[-]>[-]>[-]>[-]<<<<<<<[->>+>+<<<]>>>[-<<<+>>>]<<[->>+>+<<<]>>>[-< <<+>>>]<<[>[>>>>[-]<<<<<[->>+>>>+<<<<<]>>[-<<+>>]<[-<->>+<<[>>-<<[->>>+<<<] ]>>>[-<<<+>>>]<[-<[-]>]<]<[<[->>+>+<<<]>>>[-<<<+>>>]>>+<<<<[->>+<<]]>>[-<<+ >>]<]<<[->+>+<<]>[-<+>]>>>>>[-<<+<+>>>]<<<[-<->]+<[>-<[-]]>[>[-]>+<<-]<<][- ]>[-]>>[-<<+>>]>[-<<<<+>>>>]>[-]<[-]<[-]<[-]<<<< Låt cellen pekaren pekar på innehålla täljare och låt cellen närmast till höger innehålla nämnare. Ytterligare sex (6) celler används då koden exekveras. Följande tabell illustrerar hur minnet ser ut före och efter exekvering: Alfabetet +++++[>+++++++++++++<-]>.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+. Se även Ook! en variant av brainfuck Turingmaskin är en abstrakt mekanism för att utföra beräkningar. Källor Esoteriska programspråk	swedish	0.843804
Pony/src-builtin-stringable-.txt	stringable.pony 1 2 3 4 5 6 7 8interface box Stringable """ Things that can be turned into a String. """ fun string(): String iso^ """ Generate a string representation of this object. """	pony	8191527	https://sv.wikipedia.org/wiki/The%20Studio%20Albums%201989-2007	The Studio Albums 1989-2007	The Studio Albums 1989-2007 är ett boxset av det kanadensiska rockbandet Rush som innehåller alla studioalbum från 1989 till 2007 på 7 CD skivor. Boxsetet gavs ut 30 september 2013. Albumen är Presto (1989), Roll the Bones (1991), Counterparts (1993), Test for Echo (1996), Vapor Trails (2002), Feedback (2004) och Snakes & Arrows (2007). Boxsetet innehåller även en bok med all text till låtarna. Versionen av albumet Vapor Trails här är en remix då originalet hade fått kritik av att den lät för högt. Låtlista All musik är skriven av Geddy Lee och Alex Lifeson med texter av Neil Peart om det inte står något annat. Skiva ett (Presto) "Show Don't Tell" - 5:01 "Chain Lightning" - 4:33 "The Pass" - 4:51 "War Paint" - 5:24 "Scars" - 4:07 "Presto" - 5:45 "Superconductor" - 4:47 "Anagram (For Mongo)" - 4:00 "Red Tide" - 4:29 "Hand over Fist" - 4:11 "Available Light" - 5:03 Skiva två (Roll the Bones) "Dreamline" - 4:38 "Bravado" - 4:35 "Roll the Bones" - 5:30 "Face Up" - 3:54 "Where's My Thing?" - 3:49 "The Big Wheel" - 5:13 "Heresy" - 5:26 "Ghost of a Chance" - 5:19 "Neurotica" - 4:40 "You Bet Your Life" - 5:00 Skiva tre (Counterparts) "Animate" - 6:05 "Stick It Out" - 4:30 "Cut to the Chase" - 4:49 "Nobody's Hero" - 4:54 "Between Sun & Moon" - 4:37 "Alien Shore" - 5:45 "The Speed of Love" - 5:03 "Double Agent" - 4:51 "Leave That Thing Alone" - 4:06 "Cold Fire" - 4:27 "Everyday Glory" - 5:10 Skiva fyra (Test for Echo) "Test for Echo" – 5:55 "Driven" – 4:27 "Half the World" – 3:42 "The Color of Right" – 4:48 "Time and Motion" – 5:01 "Totem" – 4:58 "Dog Years" – 4:55 "Virtuality" – 5:43 "Resist" – 4:23 "Limbo" – 5:28 "Carve Away the Stone" – 4:05 Skiva fem (Vapor Trails) "One Little Victory" - 5:09 "Ceiling Unlimited" - 5:28 "Ghost Rider" - 5:41 "Peaceable Kingdom" - 5:23 "The Stars Look Down" - 4:28 "How It Is" - 4:05 "Vapor Trail" - 4:58 "Secret Touch" - 6:35 "Earthshine" - 5:38 "Sweet Miracle" - 3:41 "Nocturne " - 4:49 "Freeze" (Del IV av Fear) - 6:21 "Out of the Cradle" - 5:03 Skiva sex (Feedback) "Summertime Blues" (Jerry Capehart/Eddie Cochran, arr. av Blue Cheer) - 3:53 "Heart Full of Soul" (Graham Gouldman, arr. av The Yardbirds) - 2:53 "For What It's Worth" (Stephen Stills, arr. av Buffalo Springfield) - 3:31 "The Seeker" (Pete Townshend, arr. av The Who) - 3:27 "Mr. Soul" (Neil Young, arr. av Buffalo Springfield) - 3:51 "Seven and Seven Is" (Arthur Lee, arr. av Love) - 2:53 "Shapes of Things" (Jim McCarty/Keith Relf/Paul Samwell-Smith, arr. av The Yardbirds) - 3:16 "Crossroads" (Robert Johnson, arr. av Cream) - 3:26 Skiva sju (Snakes & Arrows) "Far Cry" - 5:19 "Armor and Sword" - 6:36 "Workin' Them Angels" - 4:47 "The Larger Bowl" - 4:07 "Spindrift" - 5:24 "The Main Monkey Business" - 6:01 "The Way the Wind blows" - 6:28 "Hope" - 2:02 "Faithless" - 5:31 "Bravest Face" - 5:12 "Good News First" - 4:52 "Malignant Narcissism" - 2:17 "We Hold On" - 4:13 Musikalbum 2013	swedish	1.151315
Pony/src-format-format-.txt	format.pony 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145""" # Format package The Format package provides support for formatting strings. It can be used to set things like width, padding and alignment, as well as controlling the way numbers are displayed (decimal, octal, hexadecimal). # Example program ```pony use "format" actor Main fun disp(desc: String, v: I32, fmt: FormatInt = FormatDefault): String => Format(desc where width = 10) + ":" + Format.int[I32](v where width = 10, align = AlignRight, fmt = fmt) new create(env: Env) => try (let x, let y) = (env.args(1)?.i32()?, env.args(2)?.i32()?) env.out.print(disp("x", x)) env.out.print(disp("y", y)) env.out.print(disp("hex(x)", x, FormatHex)) env.out.print(disp("hex(y)", y, FormatHex)) env.out.print(disp("x * y", x * y)) else let exe = try env.args(0)? else "fmt_example" end env.err.print("Usage: " + exe + " NUMBER1 NUMBER2") end ``` """ use "collections" primitive Format """ Provides functions for generating formatted strings. * fmt. Format to use. * prefix. Prefix to use. * prec. Precision to use. The exact meaning of this depends on the type, but is generally the number of characters used for all, or part, of the string. A value of -1 indicates that the default for the type should be used. * width. The minimum number of characters that will be in the produced string. If necessary the string will be padded with the fill character to make it long enough. * align. Specify whether fill characters should be added at the beginning or end of the generated string, or both. * fill. The character to pad a string with if is is shorter than width. """ fun apply( str: String, fmt: FormatDefault = FormatDefault, prefix: PrefixDefault = PrefixDefault, prec: USize = -1, width: USize = 0, align: Align = AlignLeft, fill: U32 = ' ') : String iso^ => let copy_len = str.size().min(prec.usize()) let len = copy_len.max(width.usize()) recover let s = String(len) match align \| AlignLeft => s.append(str) for i in Range(s.size(), s.space()) do s.push_utf32(fill) end \| AlignRight => for i in Range(0, len - copy_len) do s.push_utf32(fill) end s.append(str) \| AlignCenter => let half = (len - copy_len) / 2 for i in Range(0, half) do s.push_utf32(fill) end s.append(str) for i in Range(s.size(), s.space()) do s.push_utf32(fill) end end s .> recalc() end fun int[A: (Int & Integer[A])]( x: A, fmt: FormatInt = FormatDefault, prefix: PrefixNumber = PrefixDefault, prec: USize = -1, width: USize = 0, align: Align = AlignRight, fill: U32 = ' ') : String iso^ => let zero = x.from[USize](0) (let abs, let neg) = if x < zero then (-x, true) else (x, false) end iftype A <: U128 then _FormatInt.u128(x.u128(), false, fmt, prefix, prec, width, align, fill) elseif A <: I128 then _FormatInt.u128(abs.u128(), neg, fmt, prefix, prec, width, align, fill) elseif A <: (U64 \| I64) then _FormatInt.u64(abs.u64(), neg, fmt, prefix, prec, width, align, fill) elseif A <: (U32 \| I32) then _FormatInt.u32(abs.u32(), neg, fmt, prefix, prec, width, align, fill) elseif A <: (U16 \| I16) then _FormatInt.u16(abs.u16(), neg, fmt, prefix, prec, width, align, fill) elseif A <: (U8 \| I8) then _FormatInt.u8(abs.u8(), neg, fmt, prefix, prec, width, align, fill) elseif A <: (USize \| ISize) then ifdef ilp32 then _FormatInt.u32(abs.u32(), neg, fmt, prefix, prec, width, align, fill) else _FormatInt.u64(abs.u64(), neg, fmt, prefix, prec, width, align, fill) end elseif A <: (ULong \| ILong) then ifdef ilp32 or llp64 then _FormatInt.u32(abs.u32(), neg, fmt, prefix, prec, width, align, fill) else _FormatInt.u64(abs.u64(), neg, fmt, prefix, prec, width, align, fill) end else _FormatInt.u128(x.u128(), false, fmt, prefix, prec, width, align, fill) end fun float[A: (Float & FloatingPoint[A])]( x: A, fmt: FormatFloat = FormatDefault, prefix: PrefixNumber = PrefixDefault, prec: USize = 6, width: USize = 0, align: Align = AlignRight, fill: U32 = ' ') : String iso^ => _FormatFloat.f64(x.f64(), fmt, prefix, prec, width, align, fill)	pony	29278	https://sv.wikipedia.org/wiki/Lista%20%C3%B6ver%20tal	Lista över tal	Detta är en lista över artiklar som handlar om olika tal. Naturliga tal I nummerordning Särskilda tal Nedan följer några noterbara heltal med särskilda matematiska egenskaper och/eller särskild kulturell betydelse. Klicka på ett tal för att läsa mer om det: −40 −1 23 42 222 239 255 256 273 284 360 420 496 555 666 720 786 911 999 1000 1001 1089 1729 3600 4711 6174 7744 8128 65535 69105 100000 142857 1000000 6000000 10000000 100000000 1000000000 2147483647 9814072356 9223372036854775807 Primtal Ett primtal är ett heltal p som är större än 1 och som bara är delbart med ±1 och ±p. Nedan listas de 100 första primtalen: Sammansatta tal Ett sammansatt tal är ett naturligt tal som inte är primtal, det vill säga som har minst tre positiva delare, eller med andra ord minst en äkta delare. De första sammansatta talen är: 4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 25, 26, 27, 28, 30, 32, 33, 34, 35, 36, 38, 39, 40, 42, 44, 45, 46, 48, 49, 50, 51, 52, 54, 55, 56, 57, 58, 60, 62, 63, 64, 65, 66, 68, 69, 70, 72, 74, 75, 76, 77, 78, 80, 81, 82, 84, 85, 86, 87, 88, 90, 91, 92, 93, 94, 95, 96, 98, 99, 100, 102, 104, 105, 106, 108, 110, 111, 112, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 128, 129, 130, 132, 133, 134, 135, 136, 138, 140, … Perfekta tal Ett perfekt tal (även kallat fullkomligt tal) är ett naturligt tal n för vilket summan av alla sina delare, inklusive n självt, är lika med 2n. Detta är även detsamma som att ett tal n är lika med summan av alla sina delare förutom sig självt. Om ett tal p är ett perfekt tal gäller följande: De tio första perfekta talen är : 6 28 496 8 128 Defekta tal Ett defekt tal (även kallat omättat tal eller fattigt tal) är ett naturligt tal n, för vilket summan av alla positiva delare, inklusive n självt, betecknat σ(n), är mindre än 2n. Värdet 2n - σ(n) kallas ibland n:s defekthet. Ett oändligt antal jämna och udda defekta tal existerar. Till exempel är alla primtal, primtalspotenser och alla äkta delare till defekta tal eller perfekta tal defekta. De första defekta talen är: 1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 21, 22, 23, 25, 26, 27, 29, 31, 32, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 55, 57, 58, 59, 61, 62, 63, 64, 65, 67, 68, 69, 71, 73, 74, 75, 76, 77, 79, 81, 82, 83, 85, 86, … Ymniga tal Ett ymnigt tal (även kallat mättat tal, överflödande tal eller rikt tal) är ett naturligt tal n för vilket summan av alla dess positiva delare, inklusive n självt, är större än 2n. Värdet σ(n) - 2n, där σ(n), sigmafunktionen, är denna summa, kallas n:s ymnighet. Ymniga tal introducerades först av Nicomachus i dennes Introductio Arithmetica (cirka år 100). De första ymniga talen är: 12, 18, 20, 24, 30, 36, 40, 42, 48, 54, 56, 60, 66, 70, 72, 78, 80, 84, 88, 90, 96, 100, 102, 104, 108, 112, 114, 120, 126, 132, 138, 140, 144, 150, 156, 160, 162, 168, 174, 176, 180, 186, 192, 196, 198, 200, 204, 208, 210, 216, 220, 222, 224, 228, 234, 240, 246, 252, 258, 260, 264, 270, … Det första udda ymniga talet är 945. Särskilda namngivna tal Googol (10100) Googolplex (1010100) Googolplexian (101010100) Skewes tal Steinhaus-Mosers notation (mega, megiston och Mosers tal) Grahams tal (det största ändliga tal som någonsin har använts seriöst i ett matematiskt bevis) Andra stora tal Från och med deciljon finns ett algoritmiskt system för bildandet av större latinska prefix utarbetat av John Horton Conway and Allan Wechsler, och publicerat i The Book of Numbers av Conway och Richard Guy. Prefixen kan användas både i den långa och den korta skalan, men ger upphov till olika tiopotenser enligt ovan. Namnen byggs ihop av bitar från tabellen nedan, som representerar potenser av 106, 1060 och 10600. Stavningen av de latinska prefixen har standardmässigt försvenskats något, till exempel genom att Q blir K. Tillvägagångssättet vid ordbildningen för en valfri tiopotens (upp till 105999) är: Heltalsdividera exponenten med 6. Om resten är 0, 1 eller 2, sätt en, tio eller hundra (respektive) före själva namnet. Om resten är 3, 4 eller 5, byt ut suffixet -iljon mot -iljard i slutet, och sätt en, tio eller hundra (respektive) före själva namnet. Om kvoten är mindre än 10, använd standardnamnen från miljon till noniljard från den föregående tabellen. Om kvoten ≥ 10, fortsätt. Bryt upp kvoten i ental tiotal och hundratal, och leta upp de rätta segmenten i tabellen. Sätt ihop segmenten. Foga in en extra bokstav om någon av bokstäverna inom parentes efter ett led matchar en bokstav inom parentes före nästa. Ex: se(sx) + (mx)oktoginta = sexoktoginta, eftersom x:en matchar. Se(sx) + (ms)viginti = Sesviginti. För specialfallet tre- ska ett 's' fogas in om det matchar mot antingen ett 's' eller ett 'x'. Ta bort den avslutande vokalen. Lägg på -iljon (eller -iljard, enligt punkt 1.2). Klart. Övriga reella tal Negativa tal −1 −2 −3 −4 −5 −6 −7 −8 −9 −10 Rationella tal Halv Irrationella tal Pi e Eulers konstant Gyllene snittet Kvadratroten ur 2 Kvadratroten ur 3 Ordinaltal Alef-noll c Se även Talteori Talföljd Matematik Lista över årtal före Kristus Lista över årtal efter Kristus Primtal Lista över matematiska symboler Lista över matematiska konstanter Referenser Noter Listor med anknytning till matematik Lista över tal	swedish	0.653732
Pony/builtin-Stdin-.txt	Stdin¶ [Source] Asynchronous access to stdin. The constructor is private to ensure that access is provided only via an environment. Reading from stdin is done by registering an InputNotify: actor Main new create(env: Env) => // do not forget to call `env.input.dispose` at some point env.input( object iso is InputNotify fun ref apply(data: Array[U8] iso) => env.out.write(String.from_iso_array(consume data)) fun ref dispose() => env.out.print("Done.") end, 512) Note: For reading user input from a terminal, use the term package. actor tag Stdin is AsioEventNotify tag Implements¶ AsioEventNotify tag Public Behaviours¶ apply¶ [Source] Set the notifier. Optionally, also sets the chunk size, dictating the maximum number of bytes of each chunk that will be passed to the notifier. be apply( notify: (InputNotify iso \| None val), chunk_size: USize val = 32) Parameters¶ notify: (InputNotify iso \| None val) chunk_size: USize val = 32 dispose¶ [Source] Clear the notifier in order to shut down input. be dispose()	pony	41033	https://sv.wikipedia.org/wiki/Assembler	Assembler	Assembler eller assemblyspråk är ett sätt att uttrycka maskinkoden för en dators processor på ett sätt som lämpar sig för människor att läsa och skriva. Programmet som översätter assembler till numerisk maskinkod kallas en assemblator. I maskinkod representeras såväl instruktioner som adresser och övriga konstanta data som mönster av siffror (bitar eller i annan talbas), utan vare sig semantiskt eller strukturellt stöd för minnet. Det är bland annat därför besvärligt att skriva, redigera och felsöka. Assembler möjliggör därför användandet av namngivna data samt att den aktuella maskinens instruktioner skrivs med bokstäver, så kallade mnemotekniska symboler. Detta underlättar högst väsentligt för programmeraren, inte minst för att adresser ofta är relativa (varandra) och därför måste beräknas på nytt vid varje programändring; med en assemblator beräknas symboliska namn snabbt och automatisk, inklusive alla relativa adresser och index för ingående rutiner och datastrukturer. Assemblatorer har ofta vanliga infixa operatorer för evaluering av (relativa) konstanta uttryck i olika talbaser, inklusive operationer på bitnivå, utförda av assemblatorn (ej processorn man skriver för). Många möjliggör också användandet av makron, något som syntaktisk liknar en funktion i ett ordinärt högnivåspråk men innebär att ett stycke parametriserad assemblerkod (modifierad av aktuell parameter) infogas på varje plats den refereras. Assembler är alltså ett samlingsnamn för en mängd maskinspecifika språk. Olika processorfamiljer erbjuder olika instruktioner, och olika assemblatorer erbjuder olika syntax för till exempel adressering och makron. Detta gör att det i allmänhet inte går att använda ett assemblerprogram skrivet för en processor på en annan typ av processor. För att göra det möjligt att flytta program mellan olika processortyper används högnivåspråk. Översättning till maskinkod – och tvärt om Det program som översätter assemblerkod till maskinkod kallas assemblator och själva översättningsprocessen för assemblering. I denna process försvinner all information om vad instruktioner, data och funktioner kallats i programmet, till stöd för läsbarheten. De ersätts med dels numeriska maskininstruktioner, dels konstanta adresser för platser i minnet där data och instruktioner lagras, samt konstanta data. Maskinkoden kan via ett disassemblerande program, en disassemblator, återöversättas till assemblerkod. Läsbarheten för ett disassemblerat program blir dock mycket sämre än för assemblerkod, då alla hopp- och minnesadresser endast kan översättas till ett löpnummer, eftersom ursprungskoden inte finns tillgänglig. Det medför att om man vill veta programmets funktion måste man följa koden instruktion för instruktion. För att underlätta, kan en avlusare i stället användas. Dessa har normalt en disassemblator inbyggd samt en trace-funktion som utför en instruktion i taget och mellan dessa visar innehållet i register, stack och arbetsareor. Sedan inväntas användarens respons innan nästa instruktion utförs. Typiska responser är "nästa instruktion", "hoppa till annat ställe", "sätt in 'x' i register/minnesarea", "avbryt", "kör till nästa brytpunkt" samt "kör till slutet". Exempel Några exempel på assemblerkod för olika processortyper. IBM OS/360 assembler (och senare) Exempel på assemblerkod från IBM:s stordatorer (eng: mainframe). Den ursprungliga OS/360-assemblern kom till kring 1960 på IBM:s laboratorium på Lidingö, och torde ha stått modell för de flesta av alla förekommande assemblerspråk därefter. Inom IBM-världen kallas språket för ASM (eller BAL Basic Assembly Language; det är ofta en generationsfråga). ASM torde vara det vanligaste, kompletterad med beteckning för version, miljö mm, t ex S/390 ASM, ASM-H eller High Level Assembler (HLASM). Från början skrevs alltid typ "OS/360", där OS står för Operating System, för att skilja från "DOS/360" (Disk Operating System) som innebar att miljön var minidator inte stordator. När minidatorerna fasade ut, började beteckningar typ "S/390" bli allmänna. Egentligen är det så att när man pratar om hårdvaran, säger man till exempel "S/370"; och pratar man om motsvarande operativsystem, säger man "OS/370". AMODE ANY Accept both 24 and 31 bit addresses RMODE 24 May also be called by 24 bit address programs IEFBR14 CSECT , Control section start, module name and entry point USING IEFBR14,15 Establish addressability; reg 15 contains address of entry point B SAVE+72 Skip over PgmId & SaveArea DC AL1(L'PGMID) Length of name PGMID DC C'IEFBR14' The name itself SAVE DC 18F'0' Own save area; contains registers of calling program STM 14,12,12(13) Save regs of calling program ST 13,SAVE+4 Caller's save area addr LR 14,13 Retain caller's save area addr LA 13,SAVE Local save area addr USING SAVE,13 Switch addressability so we may use reg 15 ST 13,8(14) Report own save area addr to calling pgm * In case you actually want something done, put it here L 13,SAVE+4 Restore save area reg of calling pgm from own save area LM 14,12,12(13) Restore regs of calling pgm SR 15,15 Zero register 15 = return code "ok" ==> RC or CC * If something went wrong, put another return code in register 15 BR 14 Return addr in R14 -- go back to calling pgm END IEFBR14 End assembly and specify default entry point for Linkage Editor / Loader Det lilla programmet ovan heter IEFBR14 som IBMs klassiska dummy-program (den utför alltså "ingenting"), men är skriven fritt efter hur det troligen ser ut i senaste 31-bitsadress-version, och kan därför knappast bryta IBMs eventuella copyright. Det är alltså inte kopierat från något ställe. I den allra första versionen innehöll programmet endast raden " BR 14 " (hoppa tillbaka till anropande program), därav namnet, men flera ändringar krävdes för att den skulle anpassas till IBM:s konventioner för hur program ska se ut för att fungera i alla sammanhang och med nyare versioner av hård- och mjukvara. Det kan tyckas att detta är rätt mycket kod för att faktiskt inte utföra någonting, men mainframe-världen är mer komplex än den är i andra miljöer. Rätt tidigt utvecklades conditional assembly ("villkorlig assembler"), vanligen kallad macroassembler även i andra miljöer. Med detta kunde snarlika grupper av återkommande programrader ges ett namn och med vissa anropsparametrar kan ovanstående kod i ett typiskt program t.ex. reduceras till: AMODE ANY Accept both 24 and 31 bit addresses RMODE 24 May also be called by 24 bit address programs IEFBR14 SAVE ... RETURN RC=8 ..(at any point of error condition) ... RETURN END IEFBR14 End of assembly Här måste makrona SAVE och RETURN vara utförligt fördefinierade antingen i ett särskilt bibliotek eller lokalt i programkoden. IBM har fördefinierat flera hundra standardmacron; varje enskilt företag kan ha minst lika många egna och vissa program har sin grupp som då är särskilt programtypiska. x86/MS-DOS assembler Följande kod kan köras på ett x86/MS-DOS-system och skriver ut texten "Hello, World!" på skärmen samt avslutar programmet. Programmet använder sig av instruktionen "int" för att anropa operativsystemet för att skriva ut texten på skärmen. Programmet utnyttjar möjligheten att använda symboliska namn; namnet "hello" är ett symboliskt namn för den minnesadress texten "Hello, World!" befinner sig på. mov ah,9 mov dx,offset hello int 21h mov ah,4Ch int 21h hello db 'Hello, World!',0dh,0ah,'$' MIPS-assembler Följande är ett utdrag ur programkoden för en enkel processhanterare för multitasking på en MIPS-processor. Koden i exemplet är del av den kod som sparar undan register, pekare och stack (sw-instruktionerna) för den aktiva processen och byter till en annan (lw-instruktionerna). lbu t5 0(t2) nop addiu t5 t5 1 nop sb t5 0(t2) sw t2 4(s1) ; store gp sw t3 8(s1) ; store sp sw t4 0(s1) ; write back pcb1 sw s2 0(s0) ; change curpcb <= pcb2 lw k1 0(s2) ; change CP+4 lw gp 4(s2) ; change gp <= glob2 lw sp 8(s2) ; change sp nop b restore nop Motorola M68k Adress: MOVE.L A0, $FF8240 ADDI.B #$D0, D1 LEA ($0400,A0), A0 ROL.W (A0) CMP.W D1, (A0) BNE.S Adress Se även Kompilator Interpretator Emulator Programspråk pl:Asembler#Język asemblera	swedish	0.682061
Pony/pony_check-CountdownIter-.txt	CountdownIter[optional T: ((I8 val \| I16 val \| I32 val \| I64 val \| I128 val \| ILong val \| ISize val \| U8 val \| U16 val \| U32 val \| U64 val \| U128 val \| ULong val \| USize val) & Integer[T] val)]¶ [Source] class ref CountdownIter[optional T: ((I8 val \| I16 val \| I32 val \| I64 val \| I128 val \| ILong val \| ISize val \| U8 val \| U16 val \| U32 val \| U64 val \| U128 val \| ULong val \| USize val) & Integer[T] val)] is Iterator[T] ref Implements¶ Iterator[T] ref Constructors¶ create¶ [Source] Create am Iterator that counts down according to the specified arguments. from is exclusive, to is inclusive. new ref create( from: T, to: T = call) : CountdownIter[T] ref^ Parameters¶ from: T to: T = call Returns¶ CountdownIter[T] ref^ Public Functions¶ has_next¶ [Source] fun ref has_next() : Bool val Returns¶ Bool val next¶ [Source] fun ref next() : T Returns¶ T	pony	1758955	https://no.wikipedia.org/wiki/Indianapolis%20Colts%20i%20NFL-sesongen%202020	Indianapolis Colts i NFL-sesongen 2020	Indianapolis Colts spilte i sin 68. sesong i National Football League og 37. i Indianapolis. Det er også deres tredje sesong under hovedtrener Frank Reich og fjerde under general manager Chris Ballard. Etter å ha signert en 1-årig kontrakt verdt $25 millioner er Philip Rivers laget startende quarterback for første gang. Colts forbedret på fjorårets sesongresultat på 7–9 med en seier over Houston Texans i uke 13, og nådde sluttspillet som et wildcard med 7. seed i AFC. Colts avsluttet sesongen med samme sesongresultat som Tennessee Titans, 11–5, men tapte tiebreakeren basert på resultat mot felles motstandere (5–1 mot 4–2). I wildcardrunden tapte Colts 27–24 mot Buffalo Bills, den første gangen i Rivers' karriere hvor han tapte i wildcardrunden av sluttspillet. Etter sesongen annonserte Rivers at han skulle pensjonere seg. Draft Personale Spillerstall ved sesongslutt Sesongoppkjøring Colts' terminliste for sesongoppkjøringen ble annonsert 7. mai, men ble senere kansellert av sikkerhetshensyn på grunn av koronaviruspandemien. Seriespill Terminliste {\| class="wikitable" style="text-align:center" \|- !style=""\| Uke !style=""\| Dato !style=""\| Motstander !style=""\| Resultat !style=""\| Stilling !style=""\| Stadion !style=""\| OppsummeringNFL.com \|-style="background:#fcc" ! 1 \| 13. september \| at Jacksonville Jaguars \| T 20–27 \| 0–1 \| TIAA Bank Field \| Oppsummering \|-style="background:#cfc" ! 2 \| 20. september \| Minnesota Vikings \| S 28–11 \| 1–1 \| Lucas Oil Stadium \| Oppsummering \|-style="background:#cfc" ! 3 \| 27. september \| New York Jets \| S 36–7 \| 2–1 \| Lucas Oil Stadium \| Oppsummering \|-style="background:#cfc" ! 4 \| 4. oktober \| at Chicago Bears \| S 19–11 \| 3–1 \| Soldier Field \| Oppsummering \|-style="background:#fcc" ! 5 \| 11. oktober \| at Cleveland Browns \| T 23–32 \| 3–2 \| FirstEnergy Stadium \| Oppsummering \|-style="background:#cfc" ! 6 \| 18. oktober \| Cincinnati Bengals \| S 31–27 \| 4–2 \| Lucas Oil Stadium \| Oppsummering \|- ! 7 \| colspan="6" \| Bye \|-style="background:#cfc" ! 8 \| 1. november \| at Detroit Lions \| S 41–21 \| 5–2 \| Ford Field \| Oppsummering \|-style="background:#fcc" ! 9 \| 8. november \| Baltimore Ravens \| T 10–24 \| 5–3 \| Lucas Oil Stadium \| Oppsummering \|-style="background:#cfc" ! 10 \| \| at Tennessee Titans \| S 34–17 \| 6–3 \| Nissan Stadium \| Oppsummering \|-style="background:#cfc" ! 11 \| 22. november \| Green Bay Packers \| S 34–31 \| 7–3 \| Lucas Oil Stadium \| Oppsummering \|-style="background:#fcc" ! 12 \| 29. november \| Tennessee Titans \| T 26–45 \| 7–4 \| Lucas Oil Stadium \| Oppsummering \|-style="background:#cfc" ! 13 \| 6. desember \| at Houston Texans \| S 26–20 \| 8–4 \| NRG Stadium \| Oppsummering \|-style="background:#cfc" ! 14 \| 13. desember \| at Las Vegas Raiders\| S 44–27 \| 9–4 \| Allegiant Stadium \| Oppsummering \|-style="background:#cfc" ! 15 \| 20. desember \| Houston Texans\| S 27–20 \| 10–5 \| Lucas Oil Stadium \| Oppsummering \|-style="background:#fcc" ! 16 \| 27. desember \| at Pittsburgh Steelers \| T 24–28 \| 10–6 \| Heinz Field \| Oppsummering \|-style="background:#cfc" ! 17 \| 3. januar \| Jacksonville Jaguars\| S 28–14 \| 11–5 \| Lucas Oil Stadium \| Oppsummering \|}Merknader Divisjonsmotstandere er i fet''' tekst. Kampreferater Uke 1: at Jacksonville Jaguars Uke 2: mot Minnesota Vikings Uke 3: mot New York Jets Uke 4: at Chicago Bears Uke 5: at Cleveland Browns Uke 6: mot Cincinnati Bengals Uke 8: at Detroit Lions Uke 9: mot Baltimore Ravens Uke 10: at Tennessee Titans Uke 11: mot Green Bay Packers Uke 12: mot Tennessee Titans Uke 13: at Houston Texans Uke 14: at Las Vegas Raiders Uke 15: mot Houston Texans Uke 16: at Pittsburgh Steelers Uke 17: mot Jacksonville Jaguars Tabeller Divisjon Conference Sluttspill Terminliste Kampreferater AFC Wildcardrunden: at (2) Buffalo Bills Referanser Eksterne lenker Indianapolis Colts 2020 Sport i USA i 2020	norwegian_bokmål	1.103376
Pony/src-builtin-compare-.txt	compare.pony 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35primitive Less is Equatable[Compare] fun string(): String iso^ => "Less".string() primitive Equal is Equatable[Compare] fun string(): String iso^ => "Equal".string() primitive Greater is Equatable[Compare] fun string(): String iso^ => "Greater".string() type Compare is (Less \| Equal \| Greater) interface HasEq[A] fun eq(that: box->A): Bool interface Equatable[A: Equatable[A] #read] fun eq(that: box->A): Bool => this is that fun ne(that: box->A): Bool => not eq(that) interface Comparable[A: Comparable[A] #read] is Equatable[A] fun lt(that: box->A): Bool fun le(that: box->A): Bool => lt(that) or eq(that) fun ge(that: box->A): Bool => not lt(that) fun gt(that: box->A): Bool => not le(that) fun compare(that: box->A): Compare => if eq(that) then Equal elseif lt(that) then Less else Greater end	pony	122584	https://no.wikipedia.org/wiki/EQ	EQ	EQ, Eq, eQ og eq kan bety: EQ Equalizer Everquest, et videospill Emosjonell intelligens TAME, flyselskap, IATA-kode EQ Eq eQ eq	norwegian_bokmål	0.917021
Pony/capability-subtyping.txt	# Capability Subtyping ## Simple subtypes Subtyping is about _substitutability_. That is, if we need to supply a certain type, what other types can we substitute instead? Reference capabilities are one important component. We can start by going through a few simpler cases, and then we will talk about the full chart. First, let's focus on the four capabilities `ref`, `val`, `box`, and `tag`. These have a very useful property: they alias to themselves (and unalias to themselves, as well). This will make the subtyping a lot simpler to work with. Afterwards we can talk about `iso` and `trn`, whose subtyping is more intricate. To keep things brief, let's add a small shorthand. We will use the `<:` symbol to mean "is a subtype of", or you can read it as "can be used as". * `ref <: box`. A `ref` can be written to and read from, while `box` only needs the ability to read. * `val <: box`. A `val` can be read from and is globally immutable, while `box` only requires the ability to read. * `box <: tag`. A `box` can be read from, while a `tag` doesn't have any permissions at all. In fact, anything can be used as `tag`. That's all there is to those four. A `ref` could have other mutable aliases, so it can't become `val`, which requires global uniqueness. Likewise, `val` can't become `ref` since it can't be used to write (and there could be other `val` aliases requiring immutability). Also keep in mind, subtyping is _transitive_. That means that since `val <: box` and `box <: tag`, we also get `val <: tag`. The basic cases will be explained below, and transitivity can be used to derive all other subtyping relationships for capabilities. ## Subtypes of unique capabilities When it comes to talking about unique capabilities, the situation is a bit more complex. With variables, we only had the six basic capabilities, but we're talking about expressions here. We will have to work with aliased and unaliased forms of the capabilities. From here, let's talk about ephemeral capabilities. Remember that the way to get an ephemeral capability is by _unaliasing_, that is, moving a value out of a named location with `consume` or destructive read. Subtyping here is surprisingly simple: `iso^` is a sub-capability of absolutely everything, and `trn^` is a sub-capability of `ref` and `val`. Let's go through the interesting cases again with these two: * `iso^ <: trn^`. An `iso^` guarantees there's no readable or writable aliases, whereas `trn^` just needs no writable aliases. * `trn^ <: ref`. A `trn^` reference can be used to read and write, which is enough for `ref`. * `trn^ <: val`. A `trn^` reference has no writable aliases. A `val` requires global immutability, so we can forget our writable access in order to get `val`, since we know no other aliases can write. ## Temporary unique access We talked about aliasing and consuming, but what about when we just use a variable without making a new alias? If `x` is `iso`, what type do we give to the expression `x`? It would be pretty useless if we could only use our `iso` variables as `tag`. We couldn't modify fields or call any methods. What we get is the bare `iso` capability. Like `ref`, this allows us to read and write, but we will have to keep the destination isolated. We will get into what kind of things we can do with it later, but for now, we will talk about subtyping. * `iso^` <: `iso`. As mentioned earlier, `iso^` can become anything. This isn't enormously useful, all told, but an `iso^` expression with no other names is stronger than a expression pointing to an existing `iso` name. * `trn^` <: `trn`. Similarly, we may use an expression that has no writable aliases, as an expression which has one unique writeable alias. * `iso` <: `tag`. We can't coerce `iso` to anything else since the original name is still around, but we can always drop down to `tag` (which is just `iso!`). * `trn` <: `box`. This is quite similar, we can forget our ability to write and just get a new `box` alias to store.	pony	1058243	https://da.wikipedia.org/wiki/Rust%20%28programmeringssprog%29	Rust (programmeringssprog)	Rust er et multi-paradigme programmeringssprog skabt af Graydon Hoare, der er omhyggeligt designet til at levere høj ydeevne og it-sikkerhed. Sproget er særligt kendt for sin evne til at håndtere samtidighed på en sikker måde, hvilket minimerer risikoen for kørselsfejl. Rust svarer syntaktisk til C og C++, men kan garantere hukommelsessikkerhed ved at bruge en lånekontrol til at validere referencer. Man kan dog komme uden om dette ved f.eks. at bruge et såkaldt 'unsafe' keyword, hvilket giver mere fleksibilitet, men også øger programmørens ansvar for korrekt hukommelsesstyring, da det tillader kode, der potentielt kan bryde hukommelsessikkerheden . Historie I 2006 besluttede Graydon Hoare, en 29-årig computerprogrammør, der arbejdede for Mozilla, at designe et nyt programmeringssprog. Han blev inspireret af en frustrerende oplevelse med en elevator, der konstant gik i stykker på grund af softwarefejl. Hoare vidste, at mange af disse fejl skyldtes problemer med, hvordan et program bruger hukommelse. Han besluttede sig derfor at skabe et sprog, der kunne skrive hurtig kode uden hukommelsesbugs. Rust har fået sit navn efter en gruppe af bemærkelsesværdigt hårdføre svampe, Rustsvampe, som ifølge Hoare er "over-engineered for survival" . Over et halvandet årti senere er Rust blevet et af de mest populære programmeringssprog. Rust blev officielt sponsoreret af Mozilla i 2009. Sproget ville være open source, og kun de mennesker, der bidrog til dets udvikling, ville have ansvar for det. Mozilla var dog parat til at kickstarte det ved at finansiere projektet . I løbet af de følgende 10 år hyrede Mozilla mere end et dusin ingeniører til at arbejde fuldtid på Rust . I 2015 blev den første stabile version af Rust udgivet, og det blev hurtigt populært blandt store virksomheder. I 2020 afslørede Dropbox en ny version af deres "sync engine", altså dét som synkroniserer filer i skyen, der var omskrevet til Rust . I samme år omskrev Discord deres "Read States" service, en kritisk service der holder styr på, hvilke kanaler og beskeder brugere har læst, til Rust, hvilket resulterede i en markant forbedring og derved gjorde systemet 10 gange hurtigere . Amazon Web Services, som leverer cloud computing-platforme og API'er efter behov, har også fundet, at Rust kan hjælpe dem med at skrive sikrere, hurtigere kode . I Stack Overflows udviklerundersøgelse fra 2023, som de afholder hvert år, er Rust blevet kåret som det mest beundrede programmeringssprog, hvor over 80% af de udviklere, der har anvendt sproget, har udtrykt et ønske om at fortsætte med det i det kommende år . Dette står i skarp kontrast til det mindst attraktive sprog, MATLAB, hvor under 20% af de udviklere, der har brugt det, ønsker at fortsætte med det i det følgende år . Faktisk har Rust de sidste 7 år blevet kåret til at være det mest beundrede programmeringssprog ifølge samme undersøgelse . Sikkerhedsforanstaltninger I Rust beregner compileren, hvornår en variabel ikke længere er tilgængelig, og når det sker, indsætter compileren kode til frigivelse af variablens hukommelse. Variabler er som udgangspunkt uforanderlige (immutable), hvilket betyder, at deres værdi ikke kan ændres, når de først er blevet tildelt. Hvis en variabel skal kunne ændres, kan den defineres som foranderlig (mutable) ved at bruge 'mut' nøgleordet foran variabelnavnet. Når en funktion modtager en variabel som parameter, overtager den som udgangspunkt ejerskabet, medmindre parameteren er en reference. Ved at definere parameteren som en reference, 'låner' funktionen variablen uden at overtage ejerskabet. En reference giver som udgangspunkt kun læseadgang, men det er muligt at definere foranderlige (mutable) referencer, der tillader opdatering. Rust tillader kun én foranderlig reference til en bestemt data i en bestemt rækkevidde, hvilket hjælper med at forhindre 'data race' betingelser. En 'data race' opstår, når to eller flere tråde i en multithreaded applikation samtidigt forsøger at læse fra og skrive til den samme hukommelsesplads uden passende synkronisering. Desuden tillader Rust flere uforanderlige (immutable) referencer, men ikke en mutable reference samtidig med nogen immutable referencer. Dette er også en del af Rusts regler for "aliasing" og "mutability", som sikrer mod fejl, hvor data ændres eller slettes under læsning. Programstruktur Rust-programmer er typisk struktureret i mange funktioner, der kalder hinanden. Dette hjælper med at holde kode organiseret og genanvendelig. Rust understøtter også moduler, som er en måde at gruppere relaterede definitioner, såsom funktioner, strukturer (datastrukturer, der kan indeholde forskellige typer data) og træk (en måde at definere fælles adfærd på), sammen. Som standard er alle definitioner i et modul private, hvilket betyder, at de kun kan tilgås inden for det modul, de er defineret i. Hvis en definition skal være tilgængelig uden for det modul, det er defineret i, kan det gøres offentligt ved hjælp af nøgleordet 'pub'. I større Rust-programmer kan moduler være indlejret i hinanden for at skabe en hierarkisk struktur. Dette kan hjælpe med at organisere kode i logiske grupper. Desuden kan moduler flyttes ud i deres egne filer for at gøre koden mere overskuelig og nemmere at vedligeholde. Her er et eksempel på, hvordan moduler kan bruges i Rust: // Definerer et modul med navnet 'greetings' mod greetings { // Gør 'hello' funktionen offentlig med 'pub' nøgleordet pub fn hello() { println!("Hello, world!"); } // 'goodbye' funktionen er privat og kan kun tilgås inden for 'greetings' modulet fn goodbye() { println!("Goodbye, world!"); } } // Hovedfunktionen fn main() { // Kalder den offentlige 'hello' funktion fra 'greetings' modulet greetings::hello(); } I dette eksempel er 'hello'-funktionen defineret i 'greetings'-modulet og gjort offentlig, så den kan kaldes fra 'main'-funktionen. Derimod er 'goodbye'-funktionen privat og kan kun kaldes inden for 'greetings'-modulet. Eksempel Her er et simpelt eksempel på et CLI script skrevet i Rust, hvor der genereres et tilfældigt tal ved hjælp af rand-programbiblioteket. // Her importeres 'rand' biblioteket, som muliggør generering af tilfældige tal. use rand::Rng; // Hovedfunktionen, hvor programmet starter. fn main() { // Kalder 'generate_random_number' funktionen og gemmer resultatet i et uforanderligt variabel. let random_number = generate_random_number(); // Her skrives en linje til konsollen. println!("Det tilfældige tal er: {}", random_number); } // Funktion der genererer et tilfældigt tal mellem 1 og 10. fn generate_random_number() -> i32 { // Opretter en ny tilfældig nummergenerator. let mut rng = rand::thread_rng(); // Genererer et tilfældigt tal mellem 1 og 10 // Der skrives ikke '1..10', men i stedet '1..11', fordi den øvre grænse, 11, ikke er inkluderet let random_number = rng.gen_range(1..11); // Returnerer det tilfældige tal. return random_number; } Se også Redox (styresystem) - skrevet i Rust Referencer Links https://rust-lang.org - Rusts officielle hjemmeside https://doc.rust-lang.org/stable/book/ - En guide til Rust Programmeringssprog	danish	0.684868
Pony/format-AlignCenter-.txt	AlignCenter¶ [Source] primitive val AlignCenter Constructors¶ create¶ [Source] new val create() : AlignCenter val^ Returns¶ AlignCenter val^ Public Functions¶ eq¶ [Source] fun box eq( that: AlignCenter val) : Bool val Parameters¶ that: AlignCenter val Returns¶ Bool val ne¶ [Source] fun box ne( that: AlignCenter val) : Bool val Parameters¶ that: AlignCenter val Returns¶ Bool val	pony	1031881	https://sv.wikipedia.org/wiki/ATC-kod%20A12%3A%20Mineral%C3%A4mnen	ATC-kod A12: Mineralämnen	A12A Kalcium A12AA Kalcium A12AA01 Kalciumfosfat A12AA02 Kalciumglubionat A12AA03 Kalciumglukonat A12AA04 Kalciumkarbonat A12AA05 Kalciumlaktat A12AA06 Kalciumlaktoglukonat A12AA07 Kalciumklorid A12AA08 Kalciumglycerolfosfat A12AA09 Kalciumcitratlysinkomplex A12AA10 Kalciumglukoheptonat A12AA11 Kalciumpangamat A12AA12 Kalciumacetat A12AA20 Kalcium (olika salter i kombination) A12AA30 Kalciumlevulat A12AX Kalcium, kombinationer Inga undergrupper. A12B Kalium A12BA Kalium A12BA01 Kaliumklorid A12BA02 Kaliumcitrat A12BA03 Kaliumvätetartrat A12BA04 Kaliumvätekarbonat A12BA05 Kaliumglukonat A12BA30 Kombinationer A12BA51 Kaliumklorid, kombinationer A12C Övriga mineralämnen A12CA Natrium A12CA01 Natriumklorid A12CA02 Natriumsulfat A12CB Zink A12CB01 Zinksulfat A12CB02 Zinkglukonat A12CB03 Zinkproteincomplex A12CC Magnesium A12CC01 Magnesiumklorid A12CC02 Magnesiumsulfat A12CC03 Magnesiumglukonat A12CC04 Magnesiumcitrat A12CC05 Magnesiumaspartat A12CC06 Magnesiumlaktat A12CC07 Magnesiumlevulinat A12CC08 Magnesiumpidolat A12CC09 Magnesiumorotat A12CC10 Magnesiumoxid A12CC30 Magnesium (olika salter i kombination) A12CD Fluor A12CD01 Natriumfluorid A12CD02 Natriummonofluorfosfat A12CD51 Fluor, kombinationer A12CE Selen A12CE01 Selen A12CE02 Natriumselenit A12CX Övriga mineralämnen Inga undergrupper. A	swedish	1.053982
Pony/net-UDPSocket-.txt	UDPSocket¶ [Source] Creates a UDP socket that can be used for sending and receiving UDP messages. The following examples create: an echo server that listens for connections and returns whatever message it receives a client that connects to the server, sends a message, and prints the message it receives in response The server is implemented like this: use "net" class MyUDPNotify is UDPNotify fun ref received( sock: UDPSocket ref, data: Array[U8] iso, from: NetAddress) => sock.write(consume data, from) fun ref not_listening(sock: UDPSocket ref) => None actor Main new create(env: Env) => UDPSocket(UDPAuth(env.root), MyUDPNotify, "", "8989") The client is implemented like this: use "net" class MyUDPNotify is UDPNotify let _out: OutStream let _destination: NetAddress new create( out: OutStream, destination: NetAddress) => _out = out _destination = destination fun ref listening(sock: UDPSocket ref) => sock.write("hello world", _destination) fun ref received( sock: UDPSocket ref, data: Array[U8] iso, from: NetAddress) => _out.print("GOT:" + String.from_array(consume data)) sock.dispose() fun ref not_listening(sock: UDPSocket ref) => None actor Main new create(env: Env) => try let destination = DNS.ip4(DNSAuth(env.root), "localhost", "8989")(0)? UDPSocket(UDPAuth(env.root), recover MyUDPNotify(env.out, consume destination) end) end actor tag UDPSocket is AsioEventNotify tag Implements¶ AsioEventNotify tag Constructors¶ create¶ [Source] Listens for both IPv4 and IPv6 datagrams. new tag create( auth: UDPAuth val, notify: UDPNotify iso, host: String val = "", service: String val = "0", size: USize val = 1024) : UDPSocket tag^ Parameters¶ auth: UDPAuth val notify: UDPNotify iso host: String val = "" service: String val = "0" size: USize val = 1024 Returns¶ UDPSocket tag^ ip4¶ [Source] Listens for IPv4 datagrams. new tag ip4( auth: UDPAuth val, notify: UDPNotify iso, host: String val = "", service: String val = "0", size: USize val = 1024) : UDPSocket tag^ Parameters¶ auth: UDPAuth val notify: UDPNotify iso host: String val = "" service: String val = "0" size: USize val = 1024 Returns¶ UDPSocket tag^ ip6¶ [Source] Listens for IPv6 datagrams. new tag ip6( auth: UDPAuth val, notify: UDPNotify iso, host: String val = "", service: String val = "0", size: USize val = 1024) : UDPSocket tag^ Parameters¶ auth: UDPAuth val notify: UDPNotify iso host: String val = "" service: String val = "0" size: USize val = 1024 Returns¶ UDPSocket tag^ Public Behaviours¶ write¶ [Source] Write a single sequence of bytes. be write( data: (String val \| Array[U8 val] val), to: NetAddress val) Parameters¶ data: (String val \| Array[U8 val] val) to: NetAddress val writev¶ [Source] Write a sequence of sequences of bytes. be writev( data: ByteSeqIter val, to: NetAddress val) Parameters¶ data: ByteSeqIter val to: NetAddress val set_notify¶ [Source] Change the notifier. be set_notify( notify: UDPNotify iso) Parameters¶ notify: UDPNotify iso set_broadcast¶ [Source] Enable or disable broadcasting from this socket. be set_broadcast( state: Bool val) Parameters¶ state: Bool val set_multicast_interface¶ [Source] By default, the OS will choose which address is used to send packets bound for multicast addresses. This can be used to force a specific interface. To revert to allowing the OS to choose, call with an empty string. be set_multicast_interface( from: String val = "") Parameters¶ from: String val = "" set_multicast_loopback¶ [Source] By default, packets sent to a multicast address will be received by the sending system if it has subscribed to that address. Disabling loopback prevents this. be set_multicast_loopback( loopback: Bool val) Parameters¶ loopback: Bool val set_multicast_ttl¶ [Source] Set the TTL for multicast sends. Defaults to 1. be set_multicast_ttl( ttl: U8 val) Parameters¶ ttl: U8 val multicast_join¶ [Source] Add a multicast group. This can be limited to packets arriving on a specific interface. be multicast_join( group: String val, to: String val = "") Parameters¶ group: String val to: String val = "" multicast_leave¶ [Source] Drop a multicast group. This can be limited to packets arriving on a specific interface. No attempt is made to check that this socket has previously added this group. be multicast_leave( group: String val, to: String val = "") Parameters¶ group: String val to: String val = "" dispose¶ [Source] Stop listening. be dispose() Public Functions¶ local_address¶ [Source] Return the bound IP address. fun box local_address() : NetAddress val Returns¶ NetAddress val getsockopt¶ [Source] General wrapper for UDP sockets to the getsockopt(2) system call. The caller must provide an array that is pre-allocated to be at least as large as the largest data structure that the kernel may return for the requested option. In case of system call success, this function returns the 2-tuple: 1. The integer 0. 2. An Array[U8] of data returned by the system call's void * 4th argument. Its size is specified by the kernel via the system call's sockopt_len_t * 5th argument. In case of system call failure, this function returns the 2-tuple: 1. The value of errno. 2. An undefined value that must be ignored. Usage example: // listening() is a callback function for class UDPNotify fun ref listening(sock: UDPSocket ref) => match sock.getsockopt(OSSockOpt.sol_socket(), OSSockOpt.so_rcvbuf(), 4) \| (0, let gbytes: Array[U8] iso) => try let br = Reader.create().>append(consume gbytes) ifdef littleendian then let buffer_size = br.u32_le()? else let buffer_size = br.u32_be()? end end \| (let errno: U32, _) => // System call failed end fun ref getsockopt( level: I32 val, option_name: I32 val, option_max_size: USize val = 4) : (U32 val , Array[U8 val] iso^) Parameters¶ level: I32 val option_name: I32 val option_max_size: USize val = 4 Returns¶ (U32 val , Array[U8 val] iso^) getsockopt_u32¶ [Source] Wrapper for UDP sockets to the getsockopt(2) system call where the kernel's returned option value is a C uint32_t type / Pony type U32. In case of system call success, this function returns the 2-tuple: 1. The integer 0. 2. The *option_value returned by the kernel converted to a Pony U32. In case of system call failure, this function returns the 2-tuple: 1. The value of errno. 2. An undefined value that must be ignored. fun ref getsockopt_u32( level: I32 val, option_name: I32 val) : (U32 val , U32 val) Parameters¶ level: I32 val option_name: I32 val Returns¶ (U32 val , U32 val) setsockopt¶ [Source] General wrapper for UDP sockets to the setsockopt(2) system call. The caller is responsible for the correct size and byte contents of the option array for the requested level and option_name, including using the appropriate CPU endian byte order. This function returns 0 on success, else the value of errno on failure. Usage example: // listening() is a callback function for class UDPNotify fun ref listening(sock: UDPSocket ref) => let sb = Writer sb.u32_le(7744) // Our desired socket buffer size let sbytes = Array[U8] for bs in sb.done().values() do sbytes.append(bs) end match sock.setsockopt(OSSockOpt.sol_socket(), OSSockOpt.so_rcvbuf(), sbytes) \| 0 => // System call was successful \| let errno: U32 => // System call failed end fun ref setsockopt( level: I32 val, option_name: I32 val, option: Array[U8 val] ref) : U32 val Parameters¶ level: I32 val option_name: I32 val option: Array[U8 val] ref Returns¶ U32 val setsockopt_u32¶ [Source] Wrapper for UDP sockets to the setsockopt(2) system call where the kernel expects an option value of a C uint32_t type / Pony type U32. This function returns 0 on success, else the value of errno on failure. fun ref setsockopt_u32( level: I32 val, option_name: I32 val, option: U32 val) : U32 val Parameters¶ level: I32 val option_name: I32 val option: U32 val Returns¶ U32 val get_so_error¶ [Source] Wrapper for the FFI call getsockopt(fd, SOL_SOCKET, SO_ERROR, ...) fun ref get_so_error() : (U32 val , U32 val) Returns¶ (U32 val , U32 val) get_so_rcvbuf¶ [Source] Wrapper for the FFI call getsockopt(fd, SOL_SOCKET, SO_RCVBUF, ...) fun ref get_so_rcvbuf() : (U32 val , U32 val) Returns¶ (U32 val , U32 val) get_so_sndbuf¶ [Source] Wrapper for the FFI call getsockopt(fd, SOL_SOCKET, SO_SNDBUF, ...) fun ref get_so_sndbuf() : (U32 val , U32 val) Returns¶ (U32 val , U32 val) set_ip_multicast_loop¶ [Source] Wrapper for the FFI call setsockopt(fd, SOL_SOCKET, IP_MULTICAST_LOOP, ...) fun ref set_ip_multicast_loop( loopback: Bool val) : U32 val Parameters¶ loopback: Bool val Returns¶ U32 val set_ip_multicast_ttl¶ [Source] Wrapper for the FFI call setsockopt(fd, SOL_SOCKET, IP_MULTICAST_TTL, ...) fun ref set_ip_multicast_ttl( ttl: U8 val) : U32 val Parameters¶ ttl: U8 val Returns¶ U32 val set_so_broadcast¶ [Source] Wrapper for the FFI call setsockopt(fd, SOL_SOCKET, SO_BROADCAST, ...) fun ref set_so_broadcast( state: Bool val) : U32 val Parameters¶ state: Bool val Returns¶ U32 val set_so_rcvbuf¶ [Source] Wrapper for the FFI call setsockopt(fd, SOL_SOCKET, SO_RCVBUF, ...) fun ref set_so_rcvbuf( bufsize: U32 val) : U32 val Parameters¶ bufsize: U32 val Returns¶ U32 val set_so_sndbuf¶ [Source] Wrapper for the FFI call setsockopt(fd, SOL_SOCKET, SO_SNDBUF, ...) fun ref set_so_sndbuf( bufsize: U32 val) : U32 val Parameters¶ bufsize: U32 val Returns¶ U32 val	pony	2012304	https://no.wikipedia.org/wiki/Miami%20Dolphins%20i%20NFL-sesongen%202022	Miami Dolphins i NFL-sesongen 2022	Miami Dolphins spilte i lagets 53. sesong i National Football League (NFL), 57. totalt, første under hovedtrener Mike McDaniel og syvende under general manager Chris Grier. Dolphins nådde sluttspillet for første gang siden 2016 og sikret en tredje vinnende sesong på rad for første gang siden 2001–2003. Dolphins hadde sin beste sesongstart, på 8–3, siden 2001, men tapte deretter fem strake kamper. I sesongfinalen mot New York Jets vant Dolphins, og sikret en tangering av fjorårets sesongresultat samt en plass i sluttspillet. De endte seriespillet med samme sesongresultat som Pittsburgh Steelers, men vant tiebreakeren etter en seier over Steelers i uke 7. Dolphins møtte divisjonsrivalene Buffalo Bill i wildcardrunden, hvor de tapte 34–31. Draft Bytter Personale ved sesongslutt Spillerstall ved sesongslutt Sesongoppkjøring Seriespill Terminliste Note: Divisjonslag vises i fet tekst. Kampreferater Uke 1: mot New England Patriots Uke 2: at Baltimore Ravens Uke 3: mot Buffalo Bills Uke 4: at Cincinnati Bengals Uke 5: at New York Jets Uke 6: mot Minnesota Vikings Uke 7: mot Pittsburgh Steelers Uke 8: at Detroit Lions Uke 9: at Chicago Bears Uke 10: mot Cleveland Browns Uke 12: mot Houston Texans {{Americanfootballbox \|titlestyle=;text-align:center; \|state=autocollapse \|title=Uke 12: Houston Texans at Miami Dolphins – Kampreferat \|date=27. november \|time=13:00 EST \|road=Texans \|R1=0\|R2=0\|R3=6\|R4=9 \|home=Dolphins \|H1=10\|H2=20\|H3=0\|H4=0 \|stadium=Hard Rock Stadium, Miami Gardens, Florida \|attendance=66 205 \|weather= og delvis skyet \|referee=Jerome Boger \|TV=CBS \|TVAnnouncers=Spero Dedes, Jay Feely og Aditi Kinkhabwala \|reference=Oppsummering, Game Book \|scoring= Første kvarter MIA – Jason Sanders 45-yard field goal, 10:21. Dolphins 3–0. Drive: 9 plays, 39 yards, 3:01. MIA – Durham Smythe 4-yard pasning fra Tua Tagovailoa (Jason Sanders spark), 2:57. Dolphins 10–0. Drive: 8 plays, 59 yards, 4:44. Andre kvarter MIA – Jeff Wilson 3-yard løp (Jason Sanders spark), 12:22. Dolphins 17–0. Drive: 1 play, 3 yards, 0:05. MIA – Jason Sanders 23-yard field goal, 6:22. Dolphins 20–0. Drive: 10 plays, 72 yards, 4:32. MIA – Xavien Howard 16-yard fumble return (Jason Sanders spark), 4:59. Dolphins 27–0.MIA – Jason Sanders 35-yard field goal, 0:00. Dolphins 30–0. Drive: 11 plays, 71 yards, 1:52.Tredje kvarterHOU – Dare Ogunbowale 3-yard løp (mislykket løp), 10:21. Dolphins 30–6. Drive: 6 plays, 64 yards, 3:10.Fjerde kvarterHOU – Jordan Akins 25-yard pasning fra Kyle Allen (mislykket pasning), 12:46. Dolphins 30–12. Drive: 6 plays, 50 yards, 2:25. HOU – Ka'imi Fairbairn 28-yard field goal, 9:00. Dolphins 30–15. Drive: 8 plays, 57 yards, 2:47. \|stats=Beste passereHOU – Kyle Allen – 26/39, 215 yards, TD, 2 INT MIA – Tua Tagovailoa – 22/36, 299 yards, TDBeste på løpHOU – Dare Ogunbowale – 4 løp, 14 yards, TD MIA – Jeff Wilson – 13 løp, 39 yards, TDBeste mottakereHOU – Jordan Akins – 5 mottakelser, 61 yards, TD MIA – Tyreek Hill – 6 mottakelser, 85 yards }} Uke 13: at San Francisco 49ers Uke 14: at Los Angeles Chargers Uke 15: at Buffalo Bills Uke 16: mot Green Bay PackersJulekamp''' Uke 17: at New England Patriots Uke 18: mot New York Jets Tabeller Divisjon Conference Sluttspill Terminliste Kampreferater AFC Wildcardrunden: at (2) Buffalo Bills Priser og utmerkelser Referanser Eksterne lenker National Football League-sesongen 2022 etter lag 2022 Sport i USA i 2022	norwegian_bokmål	1.095974
Pony/files-FileAuth-.txt	FileAuth¶ [Source] primitive val FileAuth Constructors¶ create¶ [Source] new val create( from: AmbientAuth val) : FileAuth val^ Parameters¶ from: AmbientAuth val Returns¶ FileAuth val^ Public Functions¶ eq¶ [Source] fun box eq( that: FileAuth val) : Bool val Parameters¶ that: FileAuth val Returns¶ Bool val ne¶ [Source] fun box ne( that: FileAuth val) : Bool val Parameters¶ that: FileAuth val Returns¶ Bool val	pony	3354355	https://sv.wikipedia.org/wiki/Atylotus%20fulvus	Atylotus fulvus	Atylotus fulvus är en tvåvingeart som först beskrevs av Johann Wilhelm Meigen 1804. Atylotus fulvus ingår i släktet Atylotus och familjen bromsar. Arten är reproducerande i Sverige. Inga underarter finns listade i Catalogue of Life. Bildgalleri Källor Externa länkar Bromsar fulvus	swedish	1.093199
Pony/builtin-Iterator-.txt	Iterator[A: A]¶ [Source] Iterators generate a series of values, one value at a time on each call to next(). An Iterator is considered exhausted, once its has_next() method returns false. Thus every call to next() should be preceeded with a call to has_next() to check for exhaustiveness. Usage¶ Given the rules for using Iterators mentioned above, basic usage of an iterator looks like this: while iterator.has_next() do let elem = iterator.next()? // do something with elem end The For-loop provides a more concise way of iteration: for elem in iterator do // do something with elem end Iteration using While is more flexible as it allows to continue iterating if a call to next() errors. The For-loop does not allow this. Implementing Iterators¶ Iterator implementations need to adhere to the following rules to be considered well-behaved: If the Iterator is exhausted, has_next() needs to return false. Once has_next() returned false it is not allowed to switch back to true (Unless the Iterator supports rewinding) has_next() does not change its returned value if next() has not been called. That means, that between two calls to next() any number of calls to has_next() need to return the same value. (Unless the Iterator supports rewinding) A call to next() erroring does not necessarily denote exhaustiveness. Example¶ // Generates values from `from` to 0 class ref Countdown is Iterator[USize] var _cur: USize var _has_next: Bool = true new ref create(from: USize) => _cur = from fun ref has_next(): Bool => _has_next fun ref next(): USize => let elem = _cur = _cur - 1 if elem == 0 then _has_next = false end elem interface ref Iterator[A: A] Public Functions¶ has_next¶ [Source] Returns true if this Iterator is not yet exhausted. That means that a value returned from a subsequent call to next() is a valid part of this iterator. Returns false if this Iterator is exhausted. The behavior of next() after this function returned false is undefined, it might throw an error or return values which are not part of this Iterator. fun ref has_next() : Bool val Returns¶ Bool val next¶ [Source] Generate the next value. This might error, which does not necessarily mean that the Iterator is exhausted. fun ref next() : A ? Returns¶ A ?	pony	948214	https://da.wikipedia.org/wiki/Shellsortering	Shellsortering	shellsortering () er en sorteringsalgoritme som blev opdaget af Donald Shell i 1959. Algoritmen kan ses som en forbedring af andre, enklere, sorteringsalgoritmer, typisk indsættelsessortering. Det der gør shellsortering mere effektiv end normal indsættelsessortering er at algoritmen tillader sammenligning mellem to elementer, som ligger langt fra hinanden. Algoritmens afviklingstid er voldsomt afhængig af den anvendte gapsekvens. For mange praktiske varianter er deres tidskompleksitet et uløst problem. Eksempelkode Med brug af Marcin Ciuras gapsekvens, med en indre indsættelsessortering. # Sort an array a[0...n-1]. gaps = [701, 301, 132, 57, 23, 10, 4, 1] # Start with the largest gap and work down to a gap of 1 foreach (gap in gaps) { # Do a gapped insertion sort for this gap size. # The first gap elements a[0..gap-1] are already in gapped order # keep adding one more element until the entire array is gap sorted for (i = gap; i < n; i += 1) { # add a[i] to the elements that have been gap sorted # save a[i] in temp and make a hole at position i temp = a[i] # shift earlier gap-sorted elements up until the correct location for a[i] is found for (j = i; j >= gap and a[j - gap] > temp; j -= gap) { a[j] = a[j - gap] } # put temp (the original a[i]) in its correct location a[j] = temp } } Referencer Eksterne henvisninger Open Problem Garden Samling af uløste problemer inden for matematik Sorteringsalgoritmer	danish	0.840156
Pony/net-DNS-.txt	DNS¶ [Source] Helper functions for resolving DNS queries. primitive val DNS Constructors¶ create¶ [Source] new val create() : DNS val^ Returns¶ DNS val^ Public Functions¶ apply¶ [Source] Gets all IPv4 and IPv6 addresses for a host and service. fun box apply( auth: DNSAuth val, host: String val, service: String val) : Array[NetAddress val] iso^ Parameters¶ auth: DNSAuth val host: String val service: String val Returns¶ Array[NetAddress val] iso^ ip4¶ [Source] Gets all IPv4 addresses for a host and service. fun box ip4( auth: DNSAuth val, host: String val, service: String val) : Array[NetAddress val] iso^ Parameters¶ auth: DNSAuth val host: String val service: String val Returns¶ Array[NetAddress val] iso^ ip6¶ [Source] Gets all IPv6 addresses for a host and service. fun box ip6( auth: DNSAuth val, host: String val, service: String val) : Array[NetAddress val] iso^ Parameters¶ auth: DNSAuth val host: String val service: String val Returns¶ Array[NetAddress val] iso^ broadcast_ip4¶ [Source] Link-local IP4 broadcast address. fun box broadcast_ip4( auth: DNSAuth val, service: String val) : Array[NetAddress val] iso^ Parameters¶ auth: DNSAuth val service: String val Returns¶ Array[NetAddress val] iso^ broadcast_ip6¶ [Source] Link-local IP6 broadcast address. fun box broadcast_ip6( auth: DNSAuth val, service: String val) : Array[NetAddress val] iso^ Parameters¶ auth: DNSAuth val service: String val Returns¶ Array[NetAddress val] iso^ is_ip4¶ [Source] Returns true if the host is a literal IPv4 address. fun box is_ip4( host: String val) : Bool val Parameters¶ host: String val Returns¶ Bool val is_ip6¶ [Source] Returns true if the host is a literal IPv6 address. fun box is_ip6( host: String val) : Bool val Parameters¶ host: String val Returns¶ Bool val eq¶ [Source] fun box eq( that: DNS val) : Bool val Parameters¶ that: DNS val Returns¶ Bool val ne¶ [Source] fun box ne( that: DNS val) : Bool val Parameters¶ that: DNS val Returns¶ Bool val	pony	67307	https://sv.wikipedia.org/wiki/Lightweight%20Directory%20Access%20Protocol	Lightweight Directory Access Protocol	Lightweight Directory Access Protocol (LDAP) definierar ett protokoll och en datamodell för kommunikation med en katalogtjänst. LDAP skapades av Tim Howes, Steve Kille och Wengyik Yeong. Översikt LDAP används för att utföra snabba och effektiva sökningar på katalogservrar. Standarden, som LDAP baseras på (X.500), använder OSI-modellen som protokoll-modell medan LDAP använder TCP/IP. Innan LDAP-servrar började komma, använde LDAP-klienter en LDAP-gateway, som gjorde om LDAP-trafiken till X.500-trafik. Protokollet X.500 har dock förändrats och kan nu användas direkt över TCP/IP. X.500 använder Directory Access Protocol (DAP) för att komma åt X.500-katalogtjänster. LDAP var till en början ett lättviktigt alternativ för att ge åtkomst till X.500-katalogtjänster, men har på senare tid expanderat och blivit lika komplex som X.500. En klient kopplar upp mot en LDAP-server via TCP-porten 389 (standard). Ett alternativ för att få säker anslutning är att koppla upp via en SSL-tunnel (port 636). Detta sätt utfasades i.o.m. att LDAPv2 officiellt gick i pension (2003). Det nya sättet är att använda LDAPv3 Transport Layer Security (TLS) (operationen Start TLS). Klienten skickar förfrågningarna till servern asynkront medan servern skickar sina svar i turordning. Dessa operationer kan en klient göra förfrågningar om: Start TLS - använder LDAPv3 Transport Layer Security (TLS) för en säker anslutning Bind - autentisera och specificera LDAP-protokollversion Search - söka och/eller hämta katalogposter Compare - testa om en angiven post innehåller ett visst värde Add - lägg till en ny post Delete - ta bort en post Modify - ändra i en post Modify Distinguished Name (DN) - flytta eller byt namn på en post Abandon - avbryt en tidigare förfrågan Extended Operation - generiska operationer används för att definiera andra operationer Unbind - stäng ner anslutningen (har inget med 'Bind' att göra) Servern skickar svar på dessa förfrågningar men kan också skicka ett "Unsolicited Notifications". Meddelandet är inte ett svar på en förfrågan utan skickas till exempel innan anslutningen gör timeout. Katalogstruktur Protokollet ger åtkomst till LDAP-kataloger (även X.500-kataloger): En katalog är en DIT (Directory Information Tree), uppbyggt av katalogobjekt Ett katalogobjekt består av ett antal attribut (en mängd) Varje attribut har ett namn och ett eller flera värden Om ett attribut saknar värde så finns inte attributet överhuvudtaget för objektet Varje katalogobjekt har en unik identifierare (Distinguished Name - DN) (Kataloguppgifter kan byta katalog. För att tillförlitligt kunna identifiera uppgifterna, kan en UUID användas) Exempel från LDAP (på engelska), som representeras i LDAP Data Interchange Format (LDIF): dn: cn=John Doe,dc=example,dc=com cn: John Doe givenName: John sn: Doe telephoneNumber: +1 888 555 6789 telephoneNumber: +1 888 555 1232 mail: [email protected] manager: cn=Barbara Doe,dc=example,dc=com objectClass: inetOrgPerson objectClass: organizationalPerson objectClass: person objectClass: top dn avser namnet på kataloguppgiften och är inte ett attribut. cn=John Doe är uppgiftens RDN dc=example, dc=com är föräldrarnas DN Attributen består av namn som är lätta att förstå. Till exempel dn står för Distinguished Name (unikt namn), mail står för e-mail och sn står för surname (efternamn). Operationer När klienten skickar en förfrågan, skickas ett meddelandeid med som servern skickar med tillbaka. Servern skickar även med en resultatkod som indikerar om det gått bra, blivit något fel eller något annat specialfall inträffat. StartTLS Operationen StartTLS upprättar en säker anslutning via TLS-protokollet. Detta erbjuder datasekretess och/eller dataintegritet. Bind (autentisera) Servern autentiserar klienten med operationen Bind. Anslutningen bör vara skyddad med TLS, då det finns enkla autentiseringar som skickar DN och lösenord i klartext. Förutom autentisering sätts LDAP-protokollversionen. Operationen Bind måste vara först i sessionen om LDAPv2 används. Detta behövs inte i LDAPv3. Search and Compare Operationerna sök och jämför används för att söka och läsa poster. baseObject: Den DN (Distinguished Name) där sökningen ska starta. scope: BaseObject (sök bara efter namngivna posten), singleLevel (poster direkt under roten DN), eller wholeSubtree (hela subträdet med början vid roten DN). filter: Hur varje post ska undersökas. derefAliases: Om och hur aliasposter ska följas (poster som hänvisar till andra poster). attributes: Vilka attribut som ska skickas tillbaka i resultatposterna. sizeLimit, timeLimit: Maximala antalet poster och maximala söktiden. typesOnly: Skicka tillbaka attributtyperna, inte deras värden Update Data Till denna parameter hör Lägg till (add), Ta bort (delete) och Ändra (modify). För att kunna utföra dessa operationer så måste DN vara specificerat. Extended operations Denna operation används för definiera nya operationer. Hit hör Cancel, Password, Modify och StartTLS. Abandon Operationen skickas tillsammans med ett meddelande-id. Servern avbryter operationen (som har meddelande-id), om den vill. Abandon skickar inget svar tillbaka. Operationen Cancel har definierats att göra samma sak som Abandon och även skicka tillbaka ett svar. Unbind Används för att stänga ner en anslutning. Inget svar skickas tillbaka. Användning LDAP används inom bl.a. tre områden av program: För slutanvändare: E-postklienter (till exempel Outlook, Thunderbird) För specialister/administratörer: Försäljarspecifika verktyg/program (till exempel JXplorer) Serverprodukter: Mail-servrar, webbservrar (till exempel Apache James, Apache HTTP Server) Referenser Externa länkar RFC2251 - Protokollspecifikation för LDAP. LDAP Wiki Internetprotokoll	swedish	0.718031
Pony/src-files-file-.txt	file.pony 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671use @_open[I32](path: Pointer[U8] tag, flags: I32, ...) if windows use @open[I32](path: Pointer[U8] tag, flags: I32, ...) if not windows use @_read[I32](fd: I32, buffer: Pointer[None], bytes_to_read: I32) if windows use @read[ISize](fd: I32, buffer: Pointer[None], bytes_to_read: USize) if not windows use @_write[I32](fd: I32, buffer: Pointer[None], bytes_to_send: I32) if windows use @writev[ISize](fd: I32, buffer: Pointer[None], num_to_send: I32) if not windows use @_lseeki64[I64](fd: I32, offset: I64, base: I32) if windows use @lseek64[I64](fd: I32, offset: I64, base: I32) if linux use @lseek[I64](fd: I32, offset: I64, base: I32) if not windows and not linux use @FlushFileBuffers[Bool](file_handle: Pointer[None]) if windows use @_get_osfhandle[Pointer[None]](fd: I32) if windows use @fsync[I32](fd: I32) if not windows use @fdatasync[I32](fd: I32) if not windows use @_chsize_s[I32](fd: I32, len: I64) if windows use @ftruncate64[I32](fd: I32, len: I64) if linux use @ftruncate[I32](fd: I32, len: I64) if not windows and not linux use @_close[I32](fd: I32) if windows use @close[I32](fd: I32) if not windows use @pony_os_writev_max[I32]() use @pony_os_errno[I32]() use "collections" primitive FileOK primitive FileError primitive FileEOF primitive FileBadFileNumber primitive FileExists primitive FilePermissionDenied primitive _EBADF fun apply(): I32 => 9 primitive _EEXIST fun apply(): I32 => 17 primitive _EACCES fun apply(): I32 => 13 type FileErrNo is ( FileOK \| FileError \| FileEOF \| FileBadFileNumber \| FileExists \| FilePermissionDenied ) primitive CreateFile """ Open a File for read/write, creating if it doesn't exist, preserving the contents if it does exist. """ fun apply(from: FilePath): (File \| FileErrNo) => let file = File(from) let err = file.errno() match err \| FileOK => file else err end primitive OpenFile """ Open a File for read only. """ fun apply(from: FilePath): (File \| FileErrNo) => let file = File.open(from) let err = file.errno() match err \| FileOK => file else err end class File """ Operations on a file. """ let path: FilePath """ This is the filesystem path locating this file on the file system and an object capability granting access to operate on this file. """ let writeable: Bool """ `true` if the underlying file descriptor has been opened as writeable. """ let _newline: String = "\n" var _unsynced_data: Bool = false var _unsynced_metadata: Bool = false var _fd: I32 var _errno: FileErrNo = FileOK embed _pending_writev: Array[(Pointer[U8] tag, USize)] = _pending_writev.create() var _pending_writev_total: USize = 0 new create(from: FilePath) => """ Attempt to open for read/write, creating if it doesn't exist, preserving the contents if it does exist. Set errno according to result. """ path = from writeable = true _fd = -1 if not from.caps(FileRead) or not from.caps(FileWrite) then _errno = FileError else var flags: I32 = @ponyint_o_rdwr() let mode = FileMode.u32() // default file permissions if not path.exists() then if not path.caps(FileCreate) then _errno = FileError else flags = flags or @ponyint_o_creat() or @ponyint_o_trunc() end end _fd = ifdef windows then @_open(path.path.cstring(), flags, mode.i32()) else @open(path.path.cstring(), flags, mode) end if _fd == -1 then _errno = _get_error() else try _FileDes.set_rights(_fd, path, writeable)? else _errno = FileError end end end new open(from: FilePath) => """ Open for read only. Set _errno according to result. """ path = from writeable = false _fd = -1 if not path.caps(FileRead) or try let info' = FileInfo(path)? info'.directory or info'.pipe else true end then _errno = FileError else _fd = ifdef windows then @_open(path.path.cstring(), @ponyint_o_rdonly()) else @open(path.path.cstring(), @ponyint_o_rdonly()) end if _fd == -1 then _errno = _get_error() else try _FileDes.set_rights(_fd, path, writeable)? else _errno = FileError end end end new _descriptor(fd: I32, from: FilePath) ? => """ Internal constructor from a file descriptor and a path. """ if not from.caps(FileRead) or (fd == -1) then error end path = from writeable = from.caps(FileWrite) _fd = fd _FileDes.set_rights(_fd, path, writeable)? fun errno(): FileErrNo => """ Returns the last error code set for this File """ _errno fun ref clear_errno() => """ Clears the last error code set for this File. Clears the error indicator for the stream. """ _errno = FileOK fun _get_error(): FileErrNo => """ Fetch errno from the OS. """ let os_errno = @pony_os_errno() match os_errno \| _EBADF() => return FileBadFileNumber \| _EEXIST() => return FileExists \| _EACCES() => return FilePermissionDenied else return FileError end fun valid(): Bool => """ Returns true if the file is currently open. """ not (_fd == -1) fun ref read(len: USize): Array[U8] iso^ => """ Returns up to len bytes. """ if _fd != -1 then let result = recover Array[U8] .> undefined(len) end let r = (ifdef windows then @_read(_fd, result.cpointer(), len.i32()) else @read(_fd, result.cpointer(), len) end) .isize() match r \| 0 => _errno = FileEOF \| -1 => _errno = _get_error() end result.truncate(r.usize()) result else recover Array[U8] end end fun ref read_string(len: USize): String iso^ => """ Returns up to len bytes. The resulting string may have internal null characters. """ if _fd != -1 then let result = recover String(len) end let r = (ifdef windows then @_read(_fd, result.cpointer(), result.space().i32()) else @read(_fd, result.cpointer(), result.space()) end).isize() match r \| 0 => _errno = FileEOF \| -1 => _errno = _get_error() end result.truncate(r.usize()) result else recover String end end fun ref print(data: ByteSeq box): Bool => """ Same as write, buts adds a newline. """ queue(data) queue(_newline) _pending_writes() fun ref printv(data: ByteSeqIter box): Bool => """ Print an iterable collection of ByteSeqs. """ for bytes in data.values() do queue(bytes) queue(_newline) end _pending_writes() fun ref write(data: ByteSeq box): Bool => """ Returns false if the file wasn't opened with write permission. Returns false and closes the file if not all the bytes were written. """ queue(data) _pending_writes() fun ref writev(data: ByteSeqIter box): Bool => """ Write an iterable collection of ByteSeqs. """ for bytes in data.values() do queue(bytes) end _pending_writes() fun ref queue(data: ByteSeq box) => """ Queue data to be written NOTE: Queue'd data will always be written before normal print/write requested data """ _pending_writev .> push((data.cpointer(), data.size())) _pending_writev_total = _pending_writev_total + data.size() fun ref queuev(data: ByteSeqIter box) => """ Queue an iterable collection of ByteSeqs to be written NOTE: Queue'd data will always be written before normal print/write requested data """ for bytes in data.values() do queue(bytes) end fun ref flush(): Bool => """ Flush any queued data """ _pending_writes() fun ref _pending_writes(): Bool => """ Write pending data. Returns false if the file wasn't opened with write permission. Returns false and closes the file and discards all pending data if not all the bytes were written. Returns true if it sent all pending data. """ try (let result, let num_written, let new_pending_total) = _write_to_disk()? _pending_writev_total = new_pending_total if _pending_writev_total == 0 then _pending_writev.clear() _unsynced_data = true _unsynced_metadata = true else if num_written > 0 then _unsynced_data = true _unsynced_metadata = true end for d in Range[USize](0, num_written, 1) do _pending_writev.shift()? end end return result else // TODO: error recovery? EINTR? // check error _errno = _get_error() dispose() return false end fun _write_to_disk(): (Bool, USize, USize) ? => """ Write pending data. Returns false if the file wasn't opened with write permission. Raises an error if not all the bytes were written. Returns true if it sent all pending data. Returns num_processed and new pending_total also. """ var num_to_send: I32 = 0 var num_sent: USize = 0 var bytes_to_send: USize = 0 var pending_total = _pending_writev_total if (not writeable) or (_fd == -1) then return (false, num_sent, pending_total) end // TODO: Make writev_batch_size user configurable let writev_batch_size = @pony_os_writev_max() while pending_total > 0 do // Determine the number of bytes and buffers to send. num_to_send = _pending_writev.size().i32() - num_sent.i32() if num_to_send <= writev_batch_size then bytes_to_send = pending_total else // We have more buffers than a single writev can handle. // We must iterate over the buffers being sent to add up to the total. num_to_send = writev_batch_size bytes_to_send = 0 var counter: I32 = num_sent.i32() repeat bytes_to_send = bytes_to_send + _pending_writev(counter.usize())?._2 counter = counter + 1 until counter >= num_to_send end end // Write as much data as possible (vectored i/o). // On Windows only write 1 buffer at a time. var len = ifdef windows then @_write(_fd, _pending_writev(num_sent)?._1, bytes_to_send.i32()).isize() else @writev(_fd, _pending_writev.cpointer(num_sent), num_to_send).isize() end if len < bytes_to_send.isize() then error end // We've sent all the data we requested in this batch. pending_total = pending_total - bytes_to_send num_sent = num_sent + num_to_send.usize() end (true, num_sent, pending_total) fun ref position(): USize => """ Return the current cursor position in the file. """ if _fd != -1 then let o: I64 = 0 let b: I32 = 1 let r = ifdef windows then @_lseeki64(_fd, o, b) else ifdef linux then @lseek64(_fd, o, b) else @lseek(_fd, o, b) end end if r < 0 then _errno = _get_error() end r.usize() else 0 end fun ref size(): USize => """ Return the total length of the file. """ let pos = position() _seek(0, 2) let len = position() _seek(pos.i64(), 0) len fun ref seek_start(offset: USize) => """ Set the cursor position relative to the start of the file. """ if path.caps(FileSeek) then _seek(offset.i64(), 0) end fun ref seek_end(offset: USize) => """ Set the cursor position relative to the end of the file. """ if path.caps(FileSeek) then _seek(-offset.i64(), 2) end fun ref seek(offset: ISize) => """ Move the cursor position. """ if path.caps(FileSeek) then _seek(offset.i64(), 1) end fun ref sync() => """ Sync the file contents to physical storage. """ if path.caps(FileSync) and (_fd != -1) then ifdef windows then let r = @FlushFileBuffers(@_get_osfhandle(_fd)) if r == true then _errno = FileError end else let r = @fsync(_fd) if r < 0 then _errno = _get_error() end end end _unsynced_data = false _unsynced_metadata = false fun ref datasync() => """ Sync the file contents to physical storage. """ if path.caps(FileSync) and (_fd != -1) then ifdef windows then let r = @FlushFileBuffers(@_get_osfhandle(_fd)) if r == true then _errno = FileError end else let r = @fdatasync(_fd) if r < 0 then _errno = _get_error() end end end _unsynced_data = false fun ref set_length(len: USize): Bool => """ Change the file size. If it is made larger, the new contents are undefined. """ if path.caps(FileTruncate) and writeable and (_fd != -1) then let pos = position() let result = ifdef windows then @_chsize_s(_fd, len.i64()) else ifdef linux then @ftruncate64(_fd, len.i64()) else @ftruncate(_fd, len.i64()) end end if pos >= len then _seek(0, 2) end if result == 0 then true else _errno = _get_error() false end else false end fun info(): FileInfo ? => """ Return a FileInfo for this directory. Raise an error if the fd is invalid or if we don't have FileStat permission. """ FileInfo._descriptor(_fd, path)? fun chmod(mode: FileMode box): Bool => """ Set the FileMode for this directory. """ _FileDes.chmod(_fd, path, mode) fun chown(uid: U32, gid: U32): Bool => """ Set the owner and group for this directory. Does nothing on Windows. """ _FileDes.chown(_fd, path, uid, gid) fun touch(): Bool => """ Set the last access and modification times of the directory to now. """ _FileDes.touch(_fd, path) fun set_time(atime: (I64, I64), mtime: (I64, I64)): Bool => """ Set the last access and modification times of the directory to the given values. """ _FileDes.set_time(_fd, path, atime, mtime) fun ref lines(): FileLines => """ Returns an iterator for reading lines from the file. """ FileLines(this) fun ref dispose() => """ Close the file. Future operations will do nothing. """ if _fd != -1 then if (_pending_writev_total > 0) and (_errno is FileOK) then flush() end if _unsynced_data or _unsynced_metadata then sync() end let r = ifdef windows then @_close(_fd) else @close(_fd) end if r < 0 then _errno = _get_error() end _fd = -1 _pending_writev_total = 0 _pending_writev.clear() end fun ref _seek(offset: I64, base: I32) => """ Move the cursor position. """ if _fd != -1 then let r = ifdef windows then @_lseeki64(_fd, offset, base) else ifdef linux then @lseek64(_fd, offset, base) else @lseek(_fd, offset, base) end end if r < 0 then _errno = _get_error() end end fun _final() => """ Close the file. """ if _fd != -1 then if (_pending_writev_total > 0) and (_errno is FileOK) then // attempt to write any buffered data try _write_to_disk()? end end if _unsynced_data or _unsynced_metadata then // attempt to sync any un-synced data if (path.caps.value() and FileSync.value()) > 0 then ifdef windows then @FlushFileBuffers(@_get_osfhandle(_fd)) else @fsync(_fd) end end end // close file ifdef windows then @_close(_fd) else @close(_fd) end end	pony	137581	https://nn.wikipedia.org/wiki/Fibonaccif%C3%B8lgja	Fibonaccifølgja	Fibonaccifølgja er ei følgje av tal der kvart tal unntatt dei to første er summen av dei to føregåande. I sin vidaste definisjon kan dei to første tala vere kva som helst, men mest vanleg er å starte på anten 1 og 1 eller 0 og 1: eller . Historie Fibonaccifølgja har namn etter Leonardo Fibonacci sitt forsøk på å beskrive populasjonsvekst hjå ei tenkt gruppe kaninar. Ho blei likevel omtalt mykje tidlegare. Innan gammal indisk matematikk blei ho brukt til å studera prosodi i sanskrit. Innan verselæra på sanskrit ønska ein å finna alle mønster av lange (L) stavingar som er 2 einingar lange, og korte (K) stavingar som er 1 eining lang. Tel ein dei ulike mønstera av L og K med ei viss lengd får ein fibonaccifølgja: Talet på mønster som er m korte statvingar lang er fibonaccitalet Fm + 1. Å finne fibonaccifølgja Følgjande program i programmeringsspråket C genererer følgja av fibonaccital som ikkje overstig den maksimale verdien av den største heiltalsdatatypen i standardbiblioteket til C99. Dei to første tala er frivillige argument på kommandolinja. #include <stdio.h> #include <stdint.h> int main(int argc, char *argv[]){ uintmax_t i=1, j=1; if(argc == 3){ i = strtoll(argv[1], NULL, 0); j = strtoll(argv[2], NULL, 0); } printf("%llu", i); do{ printf("\n%llu", j); i = i + j; if(i < j) break; printf("\n%llu", i); j = j + i; }while(j > i); putchar('\n'); return 0; } Med to eitt-tal som start og 64 bit øvre talgrense, kjem desse 93 tala ut. Dette tek omkring 2 - 10 millisekund på ein moderne PC. 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765 10946 17711 28657 46368 75025 121393 196418 317811 514229 832040 1346269 2178309 3524578 5702887 9227465 14930352 24157817 39088169 63245986 102334155 165580141 267914296 433494437 701408733 1134903170 1836311903 2971215073 4807526976 7778742049 12586269025 20365011074 32951280099 53316291173 86267571272 139583862445 225851433717 365435296162 591286729879 956722026041 1548008755920 2504730781961 4052739537881 6557470319842 10610209857723 17167680177565 27777890035288 44945570212853 72723460248141 117669030460994 190392490709135 308061521170129 498454011879264 806515533049393 1304969544928657 2111485077978050 3416454622906707 5527939700884757 8944394323791464 14472334024676221 23416728348467685 37889062373143906 61305790721611591 99194853094755497 160500643816367088 259695496911122585 420196140727489673 679891637638612258 1100087778366101931 1779979416004714189 2880067194370816120 4660046610375530309 7540113804746346429 12200160415121876738 Kjelder . . . . Heiltalsfølgjer Matematiske relasjonar Rekursjon	norwegian_nynorsk	0.590057
Pony/builtin-F32-.txt	F32¶ [Source] primitive val F32 is FloatingPoint[F32 val] val Implements¶ FloatingPoint[F32 val] val Constructors¶ create¶ [Source] new val create( value: F32 val = 0) : F32 val^ Parameters¶ value: F32 val = 0 Returns¶ F32 val^ pi¶ [Source] new val pi() : F32 val^ Returns¶ F32 val^ e¶ [Source] new val e() : F32 val^ Returns¶ F32 val^ from_bits¶ [Source] new val from_bits( i: U32 val) : F32 val^ Parameters¶ i: U32 val Returns¶ F32 val^ from[B: ((I8 val \| I16 val \| I32 val \| I64 val \| I128 val \| ILong val \| ISize val \| U8 val \| U16 val \| U32 val \| U64 val \| U128 val \| ULong val \| USize val \| F32 val \| F64 val) & Real[B] val)]¶ [Source] new val from[B: ((I8 val \| I16 val \| I32 val \| I64 val \| I128 val \| ILong val \| ISize val \| U8 val \| U16 val \| U32 val \| U64 val \| U128 val \| ULong val \| USize val \| F32 val \| F64 val) & Real[B] val)]( a: B) : F32 val^ Parameters¶ a: B Returns¶ F32 val^ min_value¶ [Source] Minimum negative value representable. new val min_value() : F32 val^ Returns¶ F32 val^ max_value¶ [Source] Maximum positive value representable. new val max_value() : F32 val^ Returns¶ F32 val^ min_normalised¶ [Source] Minimum positive value representable at full precision (ie a normalised number). new val min_normalised() : F32 val^ Returns¶ F32 val^ epsilon¶ [Source] Minimum positive value such that (1 + epsilon) != 1. new val epsilon() : F32 val^ Returns¶ F32 val^ Public Functions¶ bits¶ [Source] fun box bits() : U32 val Returns¶ U32 val radix¶ [Source] Exponent radix. fun tag radix() : U8 val Returns¶ U8 val precision2¶ [Source] Mantissa precision in bits. fun tag precision2() : U8 val Returns¶ U8 val precision10¶ [Source] Mantissa precision in decimal digits. fun tag precision10() : U8 val Returns¶ U8 val min_exp2¶ [Source] Minimum exponent value such that (2^exponent) - 1 is representable at full precision (ie a normalised number). fun tag min_exp2() : I16 val Returns¶ I16 val min_exp10¶ [Source] Minimum exponent value such that (10^exponent) - 1 is representable at full precision (ie a normalised number). fun tag min_exp10() : I16 val Returns¶ I16 val max_exp2¶ [Source] Maximum exponent value such that (2^exponent) - 1 is representable. fun tag max_exp2() : I16 val Returns¶ I16 val max_exp10¶ [Source] Maximum exponent value such that (10^exponent) - 1 is representable. fun tag max_exp10() : I16 val Returns¶ I16 val abs¶ [Source] fun box abs() : F32 val Returns¶ F32 val ceil¶ [Source] fun box ceil() : F32 val Returns¶ F32 val floor¶ [Source] fun box floor() : F32 val Returns¶ F32 val round¶ [Source] fun box round() : F32 val Returns¶ F32 val trunc¶ [Source] fun box trunc() : F32 val Returns¶ F32 val min¶ [Source] fun box min( y: F32 val) : F32 val Parameters¶ y: F32 val Returns¶ F32 val max¶ [Source] fun box max( y: F32 val) : F32 val Parameters¶ y: F32 val Returns¶ F32 val fld¶ [Source] fun box fld( y: F32 val) : F32 val Parameters¶ y: F32 val Returns¶ F32 val fld_unsafe¶ [Source] fun box fld_unsafe( y: F32 val) : F32 val Parameters¶ y: F32 val Returns¶ F32 val mod¶ [Source] fun box mod( y: F32 val) : F32 val Parameters¶ y: F32 val Returns¶ F32 val mod_unsafe¶ [Source] fun box mod_unsafe( y: F32 val) : F32 val Parameters¶ y: F32 val Returns¶ F32 val finite¶ [Source] Check whether this number is finite, ie not +/-infinity and not NaN. fun box finite() : Bool val Returns¶ Bool val infinite¶ [Source] Check whether this number is +/-infinity fun box infinite() : Bool val Returns¶ Bool val nan¶ [Source] Check whether this number is NaN. fun box nan() : Bool val Returns¶ Bool val ldexp¶ [Source] fun box ldexp( x: F32 val, exponent: I32 val) : F32 val Parameters¶ x: F32 val exponent: I32 val Returns¶ F32 val frexp¶ [Source] fun box frexp() : (F32 val , U32 val) Returns¶ (F32 val , U32 val) log¶ [Source] fun box log() : F32 val Returns¶ F32 val log2¶ [Source] fun box log2() : F32 val Returns¶ F32 val log10¶ [Source] fun box log10() : F32 val Returns¶ F32 val logb¶ [Source] fun box logb() : F32 val Returns¶ F32 val pow¶ [Source] fun box pow( y: F32 val) : F32 val Parameters¶ y: F32 val Returns¶ F32 val powi¶ [Source] fun box powi( y: I32 val) : F32 val Parameters¶ y: I32 val Returns¶ F32 val sqrt¶ [Source] fun box sqrt() : F32 val Returns¶ F32 val sqrt_unsafe¶ [Source] Unsafe operation. If this is negative, the result is undefined. fun box sqrt_unsafe() : F32 val Returns¶ F32 val cbrt¶ [Source] fun box cbrt() : F32 val Returns¶ F32 val exp¶ [Source] fun box exp() : F32 val Returns¶ F32 val exp2¶ [Source] fun box exp2() : F32 val Returns¶ F32 val cos¶ [Source] fun box cos() : F32 val Returns¶ F32 val sin¶ [Source] fun box sin() : F32 val Returns¶ F32 val tan¶ [Source] fun box tan() : F32 val Returns¶ F32 val cosh¶ [Source] fun box cosh() : F32 val Returns¶ F32 val sinh¶ [Source] fun box sinh() : F32 val Returns¶ F32 val tanh¶ [Source] fun box tanh() : F32 val Returns¶ F32 val acos¶ [Source] fun box acos() : F32 val Returns¶ F32 val asin¶ [Source] fun box asin() : F32 val Returns¶ F32 val atan¶ [Source] fun box atan() : F32 val Returns¶ F32 val atan2¶ [Source] fun box atan2( y: F32 val) : F32 val Parameters¶ y: F32 val Returns¶ F32 val acosh¶ [Source] fun box acosh() : F32 val Returns¶ F32 val asinh¶ [Source] fun box asinh() : F32 val Returns¶ F32 val atanh¶ [Source] fun box atanh() : F32 val Returns¶ F32 val copysign¶ [Source] fun box copysign( sign: F32 val) : F32 val Parameters¶ sign: F32 val Returns¶ F32 val hash¶ [Source] fun box hash() : USize val Returns¶ USize val hash64¶ [Source] fun box hash64() : U64 val Returns¶ U64 val i128¶ [Source] fun box i128() : I128 val Returns¶ I128 val u128¶ [Source] fun box u128() : U128 val Returns¶ U128 val i128_unsafe¶ [Source] Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. fun box i128_unsafe() : I128 val Returns¶ I128 val u128_unsafe¶ [Source] Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. fun box u128_unsafe() : U128 val Returns¶ U128 val add_unsafe¶ fun box add_unsafe( y: F32 val) : F32 val Parameters¶ y: F32 val Returns¶ F32 val sub_unsafe¶ fun box sub_unsafe( y: F32 val) : F32 val Parameters¶ y: F32 val Returns¶ F32 val mul_unsafe¶ fun box mul_unsafe( y: F32 val) : F32 val Parameters¶ y: F32 val Returns¶ F32 val div_unsafe¶ fun box div_unsafe( y: F32 val) : F32 val Parameters¶ y: F32 val Returns¶ F32 val divrem_unsafe¶ fun box divrem_unsafe( y: F32 val) : (F32 val , F32 val) Parameters¶ y: F32 val Returns¶ (F32 val , F32 val) rem_unsafe¶ fun box rem_unsafe( y: F32 val) : F32 val Parameters¶ y: F32 val Returns¶ F32 val neg_unsafe¶ fun box neg_unsafe() : F32 val Returns¶ F32 val eq_unsafe¶ fun box eq_unsafe( y: F32 val) : Bool val Parameters¶ y: F32 val Returns¶ Bool val ne_unsafe¶ fun box ne_unsafe( y: F32 val) : Bool val Parameters¶ y: F32 val Returns¶ Bool val lt_unsafe¶ fun box lt_unsafe( y: F32 val) : Bool val Parameters¶ y: F32 val Returns¶ Bool val le_unsafe¶ fun box le_unsafe( y: F32 val) : Bool val Parameters¶ y: F32 val Returns¶ Bool val ge_unsafe¶ fun box ge_unsafe( y: F32 val) : Bool val Parameters¶ y: F32 val Returns¶ Bool val gt_unsafe¶ fun box gt_unsafe( y: F32 val) : Bool val Parameters¶ y: F32 val Returns¶ Bool val string¶ fun box string() : String iso^ Returns¶ String iso^ add¶ fun box add( y: F32 val) : F32 val Parameters¶ y: F32 val Returns¶ F32 val sub¶ fun box sub( y: F32 val) : F32 val Parameters¶ y: F32 val Returns¶ F32 val mul¶ fun box mul( y: F32 val) : F32 val Parameters¶ y: F32 val Returns¶ F32 val div¶ fun box div( y: F32 val) : F32 val Parameters¶ y: F32 val Returns¶ F32 val divrem¶ fun box divrem( y: F32 val) : (F32 val , F32 val) Parameters¶ y: F32 val Returns¶ (F32 val , F32 val) rem¶ fun box rem( y: F32 val) : F32 val Parameters¶ y: F32 val Returns¶ F32 val neg¶ fun box neg() : F32 val Returns¶ F32 val eq¶ fun box eq( y: F32 val) : Bool val Parameters¶ y: F32 val Returns¶ Bool val ne¶ fun box ne( y: F32 val) : Bool val Parameters¶ y: F32 val Returns¶ Bool val lt¶ fun box lt( y: F32 val) : Bool val Parameters¶ y: F32 val Returns¶ Bool val le¶ fun box le( y: F32 val) : Bool val Parameters¶ y: F32 val Returns¶ Bool val ge¶ fun box ge( y: F32 val) : Bool val Parameters¶ y: F32 val Returns¶ Bool val gt¶ fun box gt( y: F32 val) : Bool val Parameters¶ y: F32 val Returns¶ Bool val i8¶ fun box i8() : I8 val Returns¶ I8 val i16¶ fun box i16() : I16 val Returns¶ I16 val i32¶ fun box i32() : I32 val Returns¶ I32 val i64¶ fun box i64() : I64 val Returns¶ I64 val ilong¶ fun box ilong() : ILong val Returns¶ ILong val isize¶ fun box isize() : ISize val Returns¶ ISize val u8¶ fun box u8() : U8 val Returns¶ U8 val u16¶ fun box u16() : U16 val Returns¶ U16 val u32¶ fun box u32() : U32 val Returns¶ U32 val u64¶ fun box u64() : U64 val Returns¶ U64 val ulong¶ fun box ulong() : ULong val Returns¶ ULong val usize¶ fun box usize() : USize val Returns¶ USize val f32¶ fun box f32() : F32 val Returns¶ F32 val f64¶ fun box f64() : F64 val Returns¶ F64 val i8_unsafe¶ fun box i8_unsafe() : I8 val Returns¶ I8 val i16_unsafe¶ fun box i16_unsafe() : I16 val Returns¶ I16 val i32_unsafe¶ fun box i32_unsafe() : I32 val Returns¶ I32 val i64_unsafe¶ fun box i64_unsafe() : I64 val Returns¶ I64 val ilong_unsafe¶ fun box ilong_unsafe() : ILong val Returns¶ ILong val isize_unsafe¶ fun box isize_unsafe() : ISize val Returns¶ ISize val u8_unsafe¶ fun box u8_unsafe() : U8 val Returns¶ U8 val u16_unsafe¶ fun box u16_unsafe() : U16 val Returns¶ U16 val u32_unsafe¶ fun box u32_unsafe() : U32 val Returns¶ U32 val u64_unsafe¶ fun box u64_unsafe() : U64 val Returns¶ U64 val ulong_unsafe¶ fun box ulong_unsafe() : ULong val Returns¶ ULong val usize_unsafe¶ fun box usize_unsafe() : USize val Returns¶ USize val f32_unsafe¶ fun box f32_unsafe() : F32 val Returns¶ F32 val f64_unsafe¶ fun box f64_unsafe() : F64 val Returns¶ F64 val compare¶ [Source] fun box compare( that: F32 val) : (Less val \| Equal val \| Greater val) Parameters¶ that: F32 val Returns¶ (Less val \| Equal val \| Greater val)	pony	12958	https://no.wikipedia.org/wiki/32%20f.Kr.	32 f.Kr.	Fødsler 032	norwegian_bokmål	0.867041
Pony/src-random-dice-.txt	dice.pony 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26class Dice """ A simple dice roller. """ var r: Random new create(from: Random) => """ Initialise with a random number generator. """ r = from fun ref apply(count: U64, sides: U64): U64 => """ Return the sum of `count` rolls of a die with the given number of `sides`. The die is numbered from 1 to `sides`. For example, count = 2 and sides = 6 will return a value between 2 and 12. """ var sum = count var i: U64 = 0 while i < count do sum = sum + r.int(sides) i = i + 1 end sum	pony	3916999	https://sv.wikipedia.org/wiki/Radikal%20av%20ett%20heltal	Radikal av ett heltal	Inom talteorin är radikalen av ett heltal n produkten av primtalen som delar n: Exempel Radikalerna av de första heltalen är: 1, 2, 3, 2, 5, 6, 7, 2, 3, 10, 11, 6, 13, 14, 15, 2, 17, 6, 19, 10, 21, 22, 23, 6, 5, 26, 3, 14, 29, 30, 31, 2, 33, 34, 35, 6, 37, 38, 39, 10, 41, 42, 43, 22, 15, 46, 47, 6, 7, 10, 51, 26, 53, 6, 55, 14, 57, 58, 59, 30, 61, 62, 21, 2, 65, 66, 67, 34, 69, 70, 71, 6, 73, 74, 15, 38, 77, 78, … Exempelvis är och därmed Egenskaper Funktionen är multiplikativ. Radikalen av heltalet n är de största kvadratfria delaren av n. Radikalen förekommer i abc-förmodan, som säger att för vilket som helst ε > 0 finns det ett ändligt tal Kε så att för alla relativt prima positiva heltal a, b och c som satisfierar a + b = c är Källor Multiplikativa funktioner de:Zahlentheoretische Funktion#Multiplikative Funktionen	swedish	0.783264
Pony/src-builtin-real-.txt	real.pony 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716trait val _ArithmeticConvertible fun i8(): I8 => compile_intrinsic fun i16(): I16 => compile_intrinsic fun i32(): I32 => compile_intrinsic fun i64(): I64 => compile_intrinsic fun i128(): I128 => compile_intrinsic fun ilong(): ILong => compile_intrinsic fun isize(): ISize => compile_intrinsic fun u8(): U8 => compile_intrinsic fun u16(): U16 => compile_intrinsic fun u32(): U32 => compile_intrinsic fun u64(): U64 => compile_intrinsic fun u128(): U128 => compile_intrinsic fun ulong(): ULong => compile_intrinsic fun usize(): USize => compile_intrinsic fun f32(): F32 => compile_intrinsic fun f64(): F64 => compile_intrinsic fun i8_unsafe(): I8 => """ Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. """ compile_intrinsic fun i16_unsafe(): I16 => """ Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. """ compile_intrinsic fun i32_unsafe(): I32 => """ Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. """ compile_intrinsic fun i64_unsafe(): I64 => """ Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. """ compile_intrinsic fun i128_unsafe(): I128 => """ Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. """ compile_intrinsic fun ilong_unsafe(): ILong => """ Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. """ compile_intrinsic fun isize_unsafe(): ISize => """ Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. """ compile_intrinsic fun u8_unsafe(): U8 => """ Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. """ compile_intrinsic fun u16_unsafe(): U16 => """ Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. """ compile_intrinsic fun u32_unsafe(): U32 => """ Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. """ compile_intrinsic fun u64_unsafe(): U64 => """ Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. """ compile_intrinsic fun u128_unsafe(): U128 => """ Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. """ compile_intrinsic fun ulong_unsafe(): ULong => """ Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. """ compile_intrinsic fun usize_unsafe(): USize => """ Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. """ compile_intrinsic fun f32_unsafe(): F32 => """ Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. """ compile_intrinsic fun f64_unsafe(): F64 => """ Unsafe operation. If the value doesn't fit in the destination type, the result is undefined. """ compile_intrinsic trait val Real[A: Real[A] val] is (Stringable & _ArithmeticConvertible & Comparable[A]) new val create(value: A) new val from[B: (Number & Real[B] val)](a: B) new val min_value() new val max_value() fun add(y: A): A => this + y fun sub(y: A): A => this - y fun mul(y: A): A => this * y fun div(y: A): A => """ Integer division, rounded towards zero. """ this / y fun divrem(y: A): (A, A) => (this / y, this % y) fun rem(y: A): A => """ Calculate the remainder after integer division, rounded towards zero (`div`). The result has the sign of the dividend. """ this % y fun neg(): A => -this fun fld(y: A): A """ Floored integer division, rounded towards negative infinity. """ fun mod(y: A): A """ Calculate the modulo after floored integer division, rounded towards negative infinity (`fld`). The result has the sign of the divisor. """ fun eq(y: box->A): Bool => this == y fun ne(y: box->A): Bool => this != y fun lt(y: box->A): Bool => this < y fun le(y: box->A): Bool => this <= y fun ge(y: box->A): Bool => this >= y fun gt(y: box->A): Bool => this > y fun min(y: A): A fun max(y: A): A fun hash(): USize => var x = usize() ifdef ilp32 then x = (not x) + (x << 15) x = x xor (x >> 12) x = x + (x << 2) x = x xor (x >> 4) x = (x + (x << 3)) + (x << 11) x = x xor (x >> 16) x else hash64().usize() end fun hash64(): U64 => var x = u64() x = (not x) + (x << 21) x = x xor (x >> 24) x = (x + (x << 3)) + (x << 8) x = x xor (x >> 14) x = (x + (x << 2)) + (x << 4) x = x xor (x >> 28) x = x + (x << 31) x fun _value(): A => compile_intrinsic trait val Integer[A: Integer[A] val] is Real[A] fun add_unsafe(y: A): A => """ Unsafe operation. If the operation overflows, the result is undefined. """ this +~ y fun sub_unsafe(y: A): A => """ Unsafe operation. If the operation overflows, the result is undefined. """ this -~ y fun mul_unsafe(y: A): A => """ Unsafe operation. If the operation overflows, the result is undefined. """ this ~ y fun div_unsafe(y: A): A => """ Integer division, rounded towards zero. Unsafe operation. If y is 0, the result is undefined. If the operation overflows, the result is undefined. """ this /~ y fun divrem_unsafe(y: A): (A, A) => """ Calculates the quotient of this number and `y` and the remainder. Unsafe operation. If y is 0, the result is undefined. If the operation overflows, the result is undefined. """ (this /~ y, this %~ y) fun rem_unsafe(y: A): A => """ Calculates the remainder of this number divided by `y`. Unsafe operation. If y is 0, the result is undefined. If the operation overflows, the result is undefined. """ this %~ y fun fld_unsafe(y: A): A """ Floored division, rounded towards negative infinity, as opposed to `div` which rounds towards zero. Unsafe Operation* If y is 0, the result is undefined. If the operation overflows, the result is undefined. """ fun mod_unsafe(y: A): A """ Calculates the modulo of this number after floored division by `y`. Unsafe Operation. If y is 0, the result is undefined. If the operation overflows, the result is undefined. """ fun add_partial(y: A): A ? """ Add y to this number. If the operation overflows this function errors. """ fun sub_partial(y: A): A ? """ Subtract y from this number. If the operation overflows/underflows this function errors. """ fun mul_partial(y: A): A ? """ Multiply y with this number. If the operation overflows this function errors. """ fun div_partial(y: A): A ? """ Divides this number by `y`, rounds the result towards zero. If y is `0` or the operation overflows, this function errors. """ fun rem_partial(y: A): A ? """ Calculates the remainder of this number divided by y. The result has the sign of the dividend. If y is `0` or the operation overflows, this function errors. """ fun divrem_partial(y: A): (A, A) ? """ Divides this number by y and calculates the remainder of the operation. If y is `0` or the operation overflows, this function errors. """ fun fld_partial(y: A): A ? """ Floored integer division, rounded towards negative infinity. If y is `0` or the operation overflows, this function errors """ fun mod_partial(y: A): A ? """ Calculates the modulo of this number and `y` after floored division (`fld`). The result has the sign of the divisor. If y is `0` or the operation overflows, this function errors. """ fun neg_unsafe(): A => """ Unsafe operation. If the operation overflows, the result is undefined. """ -~this fun addc(y: A): (A, Bool) """ Add `y` to this integer and return the result and a flag indicating overflow. """ fun subc(y: A): (A, Bool) """ Subtract `y` from this integer and return the result and a flag indicating overflow. """ fun mulc(y: A): (A, Bool) """ Multiply `y` with this integer and return the result and a flag indicating overflow. """ fun divc(y: A): (A, Bool) """ Divide this integer by `y` and return the result and a flag indicating overflow or division by zero. """ fun remc(y: A): (A, Bool) """ Calculate the remainder of this number divided by `y` and return the result and a flag indicating division by zero or overflow. The result will have the sign of the dividend. """ fun fldc(y: A): (A, Bool) """ Divide this integer by `y` and return the result, rounded towards negative infinity and a flag indicating overflow or division by zero. """ fun modc(y: A): (A, Bool) """ Calculate the modulo of this number after floored division by `y` and return the result and a flag indicating division by zero or overflow. The result will have the sign of the divisor. """ fun op_and(y: A): A => this and y fun op_or(y: A): A => this or y fun op_xor(y: A): A => this xor y fun op_not(): A => not this fun bit_reverse(): A """ Reverse the order of the bits within the integer. For example, 0b11101101 (237) would return 0b10110111 (183). """ fun bswap(): A trait val SignedInteger[A: SignedInteger[A, B] val, B: UnsignedInteger[B] val] is Integer[A] fun abs(): B fun shl(y: B): A => this << y fun shr(y: B): A => this >> y fun shl_unsafe(y: B): A => """ Unsafe operation. If bits differing from the final sign bit are shifted-out, the result is undefined. """ this <<~ y fun shr_unsafe(y: B): A => """ Unsafe operation. If non-zero bits are shifted-out, the result is undefined. """ this >>~ y fun popcount(): B fun clz(): B fun ctz(): B fun clz_unsafe(): B """ Unsafe operation. If this is 0, the result is undefined. """ fun ctz_unsafe(): B """ Unsafe operation. If this is 0, the result is undefined. """ fun bitwidth(): B fun bytewidth(): USize fun string(): String iso^ => _ToString._u64(abs().u64(), i64() < 0) trait val UnsignedInteger[A: UnsignedInteger[A] val] is Integer[A] fun abs(): A fun shl(y: A): A => this << y fun shr(y: A): A => this >> y // both fld and mod behave the same as div and rem for unsigned integers fun fld(y: A): A => this / y fun fldc(y: A): (A, Bool) => this.divc(y) fun fld_partial(y: A): A ? => this.div_partial(y)? fun fld_unsafe(y: A): A => this.div_unsafe(y) fun mod(y: A): A => this % y fun modc(y: A): (A, Bool) => this.remc(y) fun mod_partial(y: A): A ? => this.rem_partial(y)? fun mod_unsafe(y: A): A => this.rem_unsafe(y) fun shl_unsafe(y: A): A => """ Unsafe operation. If non-zero bits are shifted-out, the result is undefined. """ this <<~ y fun shr_unsafe(y: A): A => """ Unsafe operation. If non-zero bits are shifted-out, the result is undefined. """ this >>~ y fun rotl(y: A): A => let y' = y % bitwidth() if y' == y'.min_value() then this._value() else (this << y') or (this >> (bitwidth() - y')) end fun rotr(y: A): A => let y' = y % bitwidth() if y' == y'.min_value() then this._value() else (this >> y') or (this << (bitwidth() - y')) end fun popcount(): A fun clz(): A fun ctz(): A fun clz_unsafe(): A """ Count leading zeroes. Unsafe operation. If this is 0, the result is undefined. """ fun ctz_unsafe(): A """ Count trailing zeroes. Unsafe operation. If this is 0, the result is undefined. """ fun bitwidth(): A fun bytewidth(): USize fun string(): String iso^ => _ToString._u64(u64(), false) trait val FloatingPoint[A: FloatingPoint[A] val] is Real[A] new val min_normalised() new val epsilon() fun tag radix(): U8 fun tag precision2(): U8 fun tag precision10(): U8 fun tag min_exp2(): I16 fun tag min_exp10(): I16 fun tag max_exp2(): I16 fun tag max_exp10(): I16 fun add_unsafe(y: A): A => """ Unsafe operation. If any input or output of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. """ this +~ y fun sub_unsafe(y: A): A => """ Unsafe operation. If any input or output of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. """ this -~ y fun mul_unsafe(y: A): A => """ Unsafe operation. If any input or output of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. """ this *~ y fun div_unsafe(y: A): A => """ Unsafe operation. If any input or output of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. """ this /~ y fun fld_unsafe(y: A): A """ Unsafe operation. If any input or output of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. """ fun divrem_unsafe(y: A): (A, A) => """ Unsafe operation. If any input or output of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. """ (this /~ y, this %~ y) fun rem_unsafe(y: A): A => """ Unsafe operation. If any input or output of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. """ this %~ y fun mod_unsafe(y: A): A """ Unsafe operation. If any input or output of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. """ fun neg_unsafe(): A => """ Unsafe operation. If any input or output of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. """ -~this fun eq_unsafe(y: box->A): Bool => """ Unsafe operation. If any input of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. """ this ==~ y fun ne_unsafe(y: box->A): Bool => """ Unsafe operation. If any input of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. """ this !=~ y fun lt_unsafe(y: box->A): Bool => """ Unsafe operation. If any input of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. """ this <~ y fun le_unsafe(y: box->A): Bool => """ Unsafe operation. If any input of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. """ this <=~ y fun ge_unsafe(y: box->A): Bool => """ Unsafe operation. If any input of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. """ this >=~ y fun gt_unsafe(y: box->A): Bool => """ Unsafe operation. If any input of the operation is +/- infinity or NaN, the result is undefined. The operation isn't required to fully comply to IEEE 754 semantics. """ this >~ y fun abs(): A fun ceil(): A fun floor(): A fun round(): A fun trunc(): A fun finite(): Bool fun infinite(): Bool fun nan(): Bool fun ldexp(x: A, exponent: I32): A fun frexp(): (A, U32) fun log(): A fun log2(): A fun log10(): A fun logb(): A fun pow(y: A): A fun powi(y: I32): A fun sqrt(): A fun sqrt_unsafe(): A """ Unsafe operation. If this is negative, the result is undefined. """ fun cbrt(): A fun exp(): A fun exp2(): A fun cos(): A fun sin(): A fun tan(): A fun cosh(): A fun sinh(): A fun tanh(): A fun acos(): A fun asin(): A fun atan(): A fun atan2(y: A): A fun acosh(): A fun asinh(): A fun atanh(): A fun copysign(sign: A): A fun string(): String iso^ => _ToString._f64(f64()) type Number is (Int \| Float) type Int is (Signed \| Unsigned)	pony	1477316	https://no.wikipedia.org/wiki/UNIVAC%209000	UNIVAC 9000	UNIVAC 9000 var en familie av stormaskiner som ble utviklet og produsert av UNIVAC. Familien omfattet modellene 9200, 9300, 9400, 9700 og ble utviklet og produsert av Sperry Rand I 1967 for å konkurrere med IBM System/360. Modellene 9200 og 9300 implementerte det samme 16-biter instruksjonssett som ble funnet i IBM System/360 modell 20. UNIVAC 9400 implementerte deler av 32-biter instruksjonssettet i System/360. I ytelse var modellen 9400 omtrentlig ekvivalent med IBM System/360 modell 30. Referanser UNIVAC stormaskiner IT-relaterte introduksjoner i 1967 1967 i USA	norwegian_bokmål	1.28479
Pony/format-FormatGeneral-.txt	FormatGeneral¶ [Source] primitive val FormatGeneral is FormatSpec val Implements¶ FormatSpec val Constructors¶ create¶ [Source] new val create() : FormatGeneral val^ Returns¶ FormatGeneral val^ Public Functions¶ eq¶ [Source] fun box eq( that: FormatGeneral val) : Bool val Parameters¶ that: FormatGeneral val Returns¶ Bool val ne¶ [Source] fun box ne( that: FormatGeneral val) : Bool val Parameters¶ that: FormatGeneral val Returns¶ Bool val	pony	973391	https://sv.wikipedia.org/wiki/Oluf%20Nicolai%20Olsen	Oluf Nicolai Olsen	Oluf Nicolai Olsen, född 4 mars 1794 i Køge, död 19 december 1848 i Köpenhamn, var en dansk officer och kartograf. Olsen blev officer 1812 och hade 1830 avancerat till sekondkapten och kommendör för minör- och sappörkompaniet; samma år blev han lärare i topografi och teckning vid kungliga Militärhögskolan, efter att han 1815 hade avlagt lantmätarexamen; 1817-19 genomgick han Kunstakademiet, och från 1825 ledde han Videnskabernes Selskabs topografiska arbeten. År 1836 anställdes han som divisionskvartermästare i Generalstaben, befordrades 1839 till major och 1842 till chef för den nya topografiska avdelningen, under vilken förutom Generalstabens egna mätningar Videnskabernes Selskabs och Heinrich Christian Schumachers uppmätningar förlades. År 1848 blev Olsen överste i Generalstaben. Olsen bedrev en omfattande verksamhet som topograf och kartograf. Hans kartor är inte bara konstnärligt och noggrant utförda; de är delvis banbrytande genom att i till exempel Esquisse de l'Europe, prisbelönt av det geografiska sällskapet i Paris, är de orografiska förhållandena framställda med ekvidistanta horisontalkurvor. Även Topografisk tegnekunst fick stor betydelse genom att det blev grundval för utförandet av Generalstabens samtliga kartor, medan hans skolatlas är synnerligen noggrann, överskådlig och smakfull. Slutligen inledde han med stor energi Danmarks topografiska uppmätning. Åren 1837-40 var han medutgivare av "Militært Repertorium". Verk i urval Plantegeografisk atlas (till Joakim Frederik Schouws '"Grundtræk til en almindelig plantegeographie", 1824) Esquisse orographique de l'Europe (tillsammans med Jacob Hornemann Bredsdorff, 1824, ny upplaga 1830) Ledetraad ved forelæsningerne i topografi og geodesi (1830-32) Topografisk tegnekunst (1831-36) Atlas til Joakim Frederik Schouw's naturskildringer (1832-35) Generalkort over Sønderjylland (1836) Atlas pour le tableau du climat de l'Italie (1839) Generalkort over kongeriget Danmark med hertugdømmet Slesvig (1841-42) Atlas især med hensyn til ungdommens undervisning (1842-44) Generalkort over hertugdømmet Lauenburg (1844) Kort over Island (1844-49, efter Björn Gunnlaugssons mätningar) Generalkort over Island (1849) Källor Noter Externa länkar Danska kartografer Danska lantmätare Danska militärer under 1800-talet Födda 1794 Avlidna 1848 Män Salmonsens	swedish	1.284485
Pony/builtin-Env-.txt	Env¶ [Source] An environment holds the command line and other values injected into the program by default by the runtime. class val Env Constructors¶ create¶ [Source] Build an artificial environment. A root capability must be supplied. new val create( root': AmbientAuth val, input': InputStream tag, out': OutStream tag, err': OutStream tag, args': Array[String val] val, vars': Array[String val] val, exitcode': {(I32)} val) : Env val^ Parameters¶ root': AmbientAuth val input': InputStream tag out': OutStream tag err': OutStream tag args': Array[String val] val vars': Array[String val] val exitcode': {(I32)} val Returns¶ Env val^ Public fields¶ let root: AmbientAuth val¶ [Source] The root capability. let input: InputStream tag¶ [Source] Stdin represented as an actor. let out: OutStream tag¶ [Source] Stdout let err: OutStream tag¶ [Source] Stderr let args: Array[String val] val¶ [Source] The command line used to start the program. let vars: Array[String val] val¶ [Source] The program's environment variables. let exitcode: {(I32)} val¶ [Source] Sets the environment's exit code. The exit code of the root environment will be the exit code of the application, which defaults to 0.	pony	174651	https://da.wikipedia.org/wiki/VBScript	VBScript	VBScript (kort for Visual Basic Scripting Edition) er et "script"-sprog, der fortolkes via Microsoft's Windows Script Host. Sprogets syntax viser dets oprindelse som en variation af Microsoft's Visual Basic programmeringssprog. Det blev i begyndelsen især brugt af Windows-administratorer der ønskede at automatisere visse operationer mere end batch-sproget fra 1970'erne var i stand til. Typisk kunne dette være sig et script der kørte ved "log on" på en server. Sproget kan håndtere mange ting, da det understøtter API-kald. Eksempel på kode: strComputer = "." Set objWMIService = GetObject("winmgmts:{impersonationLevel=impersonate}!\\" & strComputer & "\root\cimv2") Set colStartupCommands = objWMIService.ExecQuery("Select * from Win32_StartupCommand") For Each objStartupCommand in colStartupCommands Wscript.Echo "Kommando: " & objStartupCommand.Command Wscript.Echo "Beskrivelse: " & objStartupCommand.Description Wscript.Echo "Placering: " & objStartupCommand.Location Wscript.Echo "Navn: " & objStartupCommand.Name Wscript.Echo "InstillingsID: " & objStartupCommand.SettingID Wscript.Echo "Bruger: " & objStartupCommand.User Next Kode-eksemplet her viser information om hvilke programmer der starter op sammen med computeren. VBScript har filtypenavnet (filens efternavn, extension) .vbs og bliver eksekveret af filen wscript eller cscript, :Wscript er en "windows-baseret" metode (W for windows) hvor alle meddelelser 'popper' op på skærmen :Cscript er en "command-baseret" metode (C for command) hvor man har mulighed for at modtage meddelelser i kommando-vinduet. Eksterne henvisninger VBScript User's Guide, en vejledning The Script Center – Script Repository, en samling af scripts VBScript Compiler for Microsoft .NET , en compiler til oversættelse - link virker ikke mere. Om "batch"-sproget fra 1970'erne, som VBScript kunne afløse. (engelsk Wiki) Programmeringssprog Microsoft Windows	danish	0.87749
Pony/builtin-Stringable-.txt	Stringable¶ [Source] Things that can be turned into a String. interface box Stringable Public Functions¶ string¶ [Source] Generate a string representation of this object. fun box string() : String iso^ Returns¶ String iso^	pony	3069836	https://sv.wikipedia.org/wiki/Strepsigonia%20affinis	Strepsigonia affinis	Strepsigonia affinis är en fjärilsart som beskrevs av W. Warren 1897. Strepsigonia affinis ingår i släktet Strepsigonia och familjen sikelvingar. Inga underarter finns listade i Catalogue of Life. Källor Sikelvingar affinis	swedish	1.350736

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.