ElementW

#!/usr/bin/env python3

import sys, os, errno

def mkdir_p(path):
    try:
        os.makedirs(path)
    except OSError as exc:
        if exc.errno == errno.EEXIST and os.path.isdir(path):
            pass

ElementW

{ "type": "RadixMapFile",
  "materials": [
    "dev/wall00",
    "boxes/dev00",
    "dev/wall_1x1_00",
    "dev/floor00",
    "dev/colors/white",
    "dev/water00"
  ],
  "entities": [

ElementW

local t = 0
function love.update(dt)
  t = t + dt
end

function love.draw()
  local w, h = love.graphics.getWidth(), love.graphics.getHeight()
  love.graphics.clear(0, 0, 0)
  love.graphics.translate(w/2, h/2)
  love.graphics.push()

ElementW

/**
 * Black theme for reveal.js. This is the opposite of the 'white' theme.
 *
 * By Hakim El Hattab, http://hakim.se
 */
section.has-light-background, section.has-light-background h1, section.has-light-background h2, section.has-light-background h3, section.has-light-background h4, section.has-light-background h5, section.has-light-background h6 {
  color: #222; }

/*********************************************
 * GLOBAL STYLES

ElementW

# Maintainer: Frederic Bezies <fredbezies at gmail dot com>
# Maintainer: Geert Custers <geert.aj.custers@gmail.com>
# Contributor: Jakob Gahde <j5lx@fmail.co.uk>

_pkgname=glportal
pkgname=${_pkgname}-git
pkgver=0.4.0.188.g857969c
pkgrel=1
epoch=1
pkgdesc="OpenGL puzzle game inspired by portal."

ElementW

Disk identifier (GUID): 98101B32-BBE2-4BF2-A06E-2BB33D000C20
Partition table holds up to 68 entries
First usable sector is 34, last usable sector is 30523391
Partitions will be aligned on 2-sector boundaries
Total free space is 0 sectors (0 bytes)

Number  Start (sector)    End (sector)  Size       Code  Name
   1              34              65   16.0 KiB    FFFF  board_info
   2              66            8257   4.0 MiB     FFFF  pg1fs
   3            8258           10305   1024.0 KiB  FFFF  sbl1

ElementW

void anagrammes(char *s) {
  /* Pask' trouver des algorithmes écrits en français c'est inefficace, 
   * voici la traduction en C du pseudocode donné par
   * https://en.wikipedia.org/wiki/Permutation#Generation_in_lexicographic_order */
  const int n = longueur(s);
  puts(s);
  while (1) {
    int i, k = -1, l;
    char c;
    /* Find the largest index k such that a[k] < a[k + 1].