application2000

These commands are based on a askubuntu answer http://askubuntu.com/a/581497
To install gcc-6 (gcc-6.1.1), I had to do more stuff as shown below.
USE THOSE COMMANDS AT YOUR OWN RISK. I SHALL NOT BE RESPONSIBLE FOR ANYTHING.
ABSOLUTELY NO WARRANTY.

If you are still reading let's carry on with the code.

sudo apt-get update && \
sudo apt-get install build-essential software-properties-common -y && \
sudo add-apt-repository ppa:ubuntu-toolchain-r/test -y && \

kastnerkyle

# Example from J.F. Sebastien on SO
# http://stackoverflow.com/questions/7894791/use-numpy-array-in-shared-memory-for-multiprocessing/7908612#7908612
import ctypes
import logging
import multiprocessing as mp

from contextlib import closing

import numpy as np

hakril

import struct
import ctypes
from ctypes import byref
import codecs
import functools

import windows
import windows.native_exec.simple_x86 as x86
import windows.native_exec.simple_x64 as x64
from .generated_def.winstructs import *

Lee-R

#include <cstdint>

namespace detail
{
    // FNV-1a 32bit hashing algorithm.
    constexpr std::uint32_t fnv1a_32(char const* s, std::size_t count)
    {
        return ((count ? fnv1a_32(s, count - 1) : 2166136261u) ^ s[count]) * 16777619u;
    }
}    // namespace detail

graphitemaster

Working around offsetof limitations in C++:

There is sometimes a situation in which one needs to get the relative offset of a structure field, common examples of this include serialization frameworks which aid to serialize objects, vertex attributes for rendering (D3D, GL.), etc.

The most common technique for getting this information is through the offsetof macro defined in stddef.h. Unfortunately using the macro in C++ comes with a new set of restrictions that prevent some (subjectively valid) uses of it.

klovadis

-- sets all fields for a hash from a dictionary 
local hmset = function (key, dict)
  if next(dict) == nil then return nil end
	local bulk = {}
	for k, v in pairs(dict) do
		table.insert(bulk, k)
		table.insert(bulk, v)
	end
	return redis.call('HMSET', key, unpack(bulk))
end

ruby0x1

#pragma once
#include <stdint.h>

//fnv1a 32 and 64 bit hash functions
// key is the data to hash, len is the size of the data (or how much of it to hash against)
// code license: public domain or equivalent
// post: https://notes.underscorediscovery.com/constexpr-fnv1a/

inline const uint32_t hash_32_fnv1a(const void* key, const uint32_t len) {

clemensg

#include <stdio.h>
#include <stdlib.h>
#include <uv.h>
#include <curl/curl.h>

uv_loop_t *loop;
CURLM *curl_handle;
uv_timer_t timeout;

typedef struct curl_context_s {

sj26

#!/usr/bin/python -u

"""
Python port of PHP serialize() and unserialize()
by Samuel Cochran <sj26@sj26.com>

I couldn't find a nice, fairly efficient implementation of serialize/unserialize for Python... so I wrote one. I didn't use str().partition because I wanted Python <2.5 compatibility.

TODO: Performance review. There's an awful lot of string copying. >.>

clemensg

/* curl_multi_test.c

   Clemens Gruber, 2013
   <clemens.gruber@pqgruber.com>

   Code description:
    Requests 4 Web pages via the CURL multi interface
    and checks if the HTTP status code is 200.

   Update: Fixed! The check for !numfds was the problem.