giulioz

#include <errno.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>

typedef uint8_t u8;
typedef uint16_t u16;
typedef uint32_t u32;

leonardfischer

<svg>
  <defs>
    <pattern id="inner-grid" width="10" height="10" patternUnits="userSpaceOnUse">
      <rect width="100%" height="100%" fill="none" stroke="#ccc" stroke-width="0.5" />
    </pattern>
    <pattern id="grid" width="100" height="100" patternUnits="userSpaceOnUse">
      <rect width="100%" height="100%" fill="url(#inner-grid)" stroke="#ccc" stroke-width="1.5" />
    </pattern>
  </defs>
  <rect x="0" y="0" width="100%" height="100%" fill="url(#grid)"></rect>

mochja

#include <GLFW/glfw3.h>
#include <yoga/Yoga.h>
#include <stdlib.h>

int main(void)
{
    GLFWwindow* window;
    
    /* Initialize the library */
    if (!glfwInit())

cmdr2

[RequireComponent(typeof(MeshFilter))]
public class GenerateMesh02 : MonoBehaviour {
    /* scratchpad */
    private MeshFilter mf;


    void Start () {
        mf = GetComponent<MeshFilter> ();

        GenerateMesh ();

DmitrySoshnikov

/**
 * Depth-first and Breadth-first graph traversals.
 *
 * In this diff we implement non-recursive algorithms for DFS,
 * and BFS maintaining an explicit stack and a queue.
 *
 * by Dmitry Soshnikov <[email protected]>
 * MIT Style license
 */

acidleaf

/*
Copyright (c) 2020 Chan Jer Shyan

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions: