axefrog

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;

namespace SuffixTreeAlgorithm
{
	public class SuffixTree
	{

pabigot

/* See http://blog.regehr.org/archives/1063
 */
#include <type_traits>
#include <cstdint>
#include <limits>
#include <typeinfo>

#ifndef ARGTYPE
#define ARGTYPE uint32_t
#endif /* ARGTYPE */

fginter

import multiprocessing
import numpy

#Demonstrates shared memory numpy arrays with no synchronization between processes

def increment(s_arr):
    #A function for a single process
    #increment every element in s_arr by 1.0
    #s_arr is a shared array from multiprocessing

tanb

TL;DR

• Create 5GB FreeBSD image.
• Install FreeBSD on xhyve.
• Mount host directory.

Requisites

• OSX
• Homebrew
• xhyve

davidfowl

namespace Analogy
{
    /// <summary>
    /// This example shows that a library that needs access to target .NET Standard 1.3
    /// can only access APIs available in that .NET Standard. Even though similar the APIs exist on .NET 
    /// Framework 4.5, it implements a version of .NET Standard that isn't compatible with the library.
    /// </summary>INetCoreApp10
    class Example1
    {
        public void Net45Application(INetFramework45 platform)

crusaderky

import sys
from ctypes import POINTER, py_object, Structure, c_ssize_t, c_void_p, sizeof
from typing import Any, Iterator, Optional, Sequence, Union


__all__ = ("OpStack", )


class Frame(Structure):
    _fields_ = (

pervognsen

A traditional table-based DFA implementation looks like this:

uint8_t table[NUM_STATES][256]

uint8_t run(const uint8_t *start, const uint8_t *end, uint8_t state) {
    for (const uint8_t *s = start; s != end; s++)
        state = table[state][*s];
    return state;
}