pao

Now being developed at https://github.com/pao/QuickCheck.jl and available via Pkg as "QuickCheck".

Package documentation is at https://quickcheckjl.rtfd.org/.

# A Julia implementation of QuickCheck, a randomized specification-based tester
#
# QuickCheck was originally written for Haskell by Koen Claessen and John Hughes
# http://www.cse.chalmers.se/~rjmh/QuickCheck/

pao

macro ccallWrap(lib, fnSym, retType, argTypes)
    args = [gensym() for i in 1:length(argTypes.args)]
    fnArgs = [:($(args[i])::$(argTypes[i]))
                 for i in 1:length(argTypes)]

    :(($fnSym)($fnArgs...) = ccall(dlsym($lib, $fnSym), $retType, $argTypes, $args...))
end 

pao

Contributing

We welcome contributions to Julia and appreciate your interest. There are capabilities to grow, interfaces to write, and bugs to squish. Area experts may contribute by writing software that supports work in their own field. To keep things percolating as smoothly as possible, we ask that you follow the advice and guidelines given here.

ready, get set

Before contributing to Julia, you should join the dev list, read the user manual and library guide, and create a free GitHub account. Follow these steps to get Julia copied to your machine in a way that lets you to work locally, rewind your edits, keep a remote backup, and safely contribute to Julia.

• Join the dev list

pao

Now being developed at https://github.com/pao/Monads.jl and available from Pkg as "Monads".

Full documentation is available at https://monadsjl.rtfd.org/.

module Monads

# types
export Monad, Identity, MList, Maybe, State
# combinators

pao

Note

strpack.jl is deprecated. Use the StrPack package or Julia's native C struct interop instead, depending on your needs.

Using strpack.jl as an FFI

This gist demonstrates calling C code which expects a structure pointer by writing and reading a buffer using the functions provided by strpack.jl. This takes advantage of the new align_native alignment strategy, which queries libLLVM for the platform-preferred alignment of the standard bits types.

Build the shared library

pao

load("interface.jl")

type Blah; end
type Bluh; end

@interface FooBar{T} [
                     (:foo, :(T, Integer,))
                     (:bar, :(T, String, Integer))
                     ]

pao

LLRU
  UnboundedLLRU(), 50 items
    Assignment:
        elapsed time: 0.09373784065246582 seconds
    Lookup, random access:
        elapsed time: 0.018180131912231445 seconds
    Random mixed workload:
        elapsed time: 0.0008568763732910156 seconds
  UnboundedLLRU(), 500 items
    Assignment:

pao

VLRU w/MRU at vector end (same timings as 240590 but with this explanatory note)
  UnboundedVLRU(), 50 items
    Assignment:
        elapsed time: 0.09535598754882812 seconds
    Lookup, random access:
        elapsed time: 0.015466928482055664 seconds
    Random mixed workload:
        elapsed time: 0.0009279251098632812 seconds
  UnboundedVLRU(), 500 items
    Assignment:

pao

# Sample of struct.jl: Reading a .png header

load("struct.jl")
fpng = open(ARGS[1])

# check the signature
signature = unpack(s"BcccBBBB", fpng)
@assert isequal(signature, struct(s"BcccBBBB", 0x89, 'P', 'N', 'G', 0x0D, 0x0A, 0x1A, 0x0A))

# read the header

pao

==============================================
=         MLP MUSIC ARCHIVE UPDATER          =
==============================================
= v007ab: "Sneak Attack! Huge Album Update!" =
==============================================

This program will delete any unnecessary, duplicated, or buggy files from the
previous update.

Be sure this file is at the ROOT of the Archive folder (With the README.TXT,