atduskgreg

typedef map<ofIndexType, vector<ofIndexType> > VertexGraph;

// build a DAG representing the connectivity
// between vertices in a mesh
// assumes vertices are inserted as triangles
// i.e. each triplet of vertices is treated as the corners
// of a single triangle
VertexGraph testApp::buildGraph(ofMesh &m){
    typedef VertexGraph::iterator I;

roxlu

#include <shared/VideoSurface.h>

GLuint VideoSurface::prog = 0;
GLint VideoSurface::u_pm = 0;
GLint VideoSurface::u_mm = 0;
GLint VideoSurface::u_tex = 0;
GLfloat VideoSurface::pm[16] = {0};

VideoSurface::VideoSurface() 
  :width(0)

zarya

diff --git a/user/at_ipCmd.c b/user/at_ipCmd.c
index 7c3be3c..4ae7fd3 100644
--- a/user/at_ipCmd.c
+++ b/user/at_ipCmd.c
@@ -24,9 +24,11 @@ uint16_t at_tranLen; //now is 256
 os_timer_t at_delayChack;
 BOOL IPMODE;
 
-static BOOL at_ipMux = FALSE;
+static BOOL at_ipMux = TRUE;

montanaflynn

package main

import (
	"fmt"
	"net/http"
	"sort"
	"time"
)

// a struct to hold the result from each request including an index

duhaime

import numpy as np
import umap

# generate some points in 4D
points = np.random.random((2000, 4))

# project the points to 2D to get points proximate to one another
points = umap.UMAP().fit_transform(points)

from lloyd.lloyd import Field

kylemcdonald

from numba import jit
import numpy as np

index_dtype = np.int32
cost_dtype = np.int32    

@jit(nopython=True)
def auction(a, eps=1):
    n = len(a)
    p = np.zeros(n, dtype=cost_dtype)

rom1504

https://wandb.ai/rom1504/dalle2_train_decoder/runs/mic5buox/files/decoder_config.json

get dalle2

get the config file

get these 2 .sh

run sbatch start_big.sh