meghprkh

#!/bin/bash

xyz='file-roller '
IFS=$'\n'
for i in `echo "$NAUTILUS_SCRIPT_SELECTED_FILE_PATHS"`
do
xyz="$xyz -d \"$i\""
done
eval "$xyz"

jonico

#!groovy
import groovy.json.JsonOutput
import groovy.json.JsonSlurper

def label = "mypod-${UUID.randomUUID().toString()}"
podTemplate(label: label, yaml: """
spec:
      containers:
      - name: mvn
        image: maven:3.3.9-jdk-8

amaksoft

#!/usr/bin/groovy

/*
 * Copyright (c) 2016, Andrey Makeev <[email protected]>
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright

dimitardanailov

server {
  listen 80 default deferred;
  
  server_name laravel-application.com;
	
  # http://nginx.org/en/docs/http/ngx_http_log_module.html#access_log
  access_log /var/www/laravel-app/access.log;
  error_log /var/www/laravel-app/error.log;

  root /var/www/laravel-app/public/;

lategoodbye

/*
 * Allows to set arbitrary speed for the serial device on Linux.
 * stty allows to set only predefined values: 9600, 19200, 38400, 57600, 115200, 230400, 460800.
 */
#include <stdio.h>
#include <fcntl.h>
#include <errno.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>

janeczku

#!/bin/bash
# Cloud-config for CoreOS IPXE deployment on Vultr
##################################################
# This cloud-config bootstraps CoreOS on /dev/vda and provisions:
# - private ip-address on eth1
# - etcd on private network
# - fleet on private network
# - basic firewall (docker compatible)
# - SSHd security hardening
##################################################

twotwotwo

github.com/twotwotwo/sorts is a Go package with parallel radix- and quicksorts. It can run up to 5x faster than stdlib sort on the right kind of large sort task, so it could be useful for analysis and indexing/database-y work in which you have to sort millions of items. (To be clear, I don't recommend most folks drop stdlib sort, which is great, and which sorts depends on.)

While the process of writing it's fresh on my mind, here are some technical details, some things that didn't make the cut, and some thoughts about the process:

Concretely, what this looks like inside:

• Both number and string versions are in-place MSD radix sorts that look at a byte at a time and, once the range being sorted gets down to 128 items, call (essentially) the stdlib's quicksort.

• The [parallelization code

avasilkov

def xtick_formatter(x, fmt, td, p):
    res = None
    if x < p[-1][0]:
        res = (p[-1][1] + (x - p[-1][0]) * td).strftime(fmt)
    else:
        #it's reversed
        for i in p:
            if i[0] <= x:
                res = (i[1] + (x - i[0]) * td).strftime(fmt)
                break

kylemcdonald

// make sure to link against /usr/lib/libpcap.dylib
#include "ofMain.h"
#include <pcap/pcap.h>

class ofApp : public ofBaseApp {
public:
    pcap_t *pcap;
    struct pcap_pkthdr header;
    const unsigned char* packet = NULL;
    list<string> packetHex;

AGWA

#!/bin/sh

# Enable and disable HDMI output on the Raspberry Pi

is_off ()
{
	tvservice -s | grep "TV is off" >/dev/null
}

case $1 in