René Mujica Moreau rmujica

Nuevo: SCLTransit

Ignacio Hermosilla implementó un servicio web de acceso público usando los feeds GTFS de Transantiago y los puntos de acceso oficiales que normalmente requieren acuerdos con el DTPM, para que tú no tengas que hacerlo.

Está toda la información de Transantiago que puedas necesitar, con formatos de alta calidad y sin trámites. Estas APIs son las que ahora alimentan a Cromi.

Revisa los endpoints y la documentación en scltrans.it

APIs internas de Transantiago (no recomendadas)

Transantiago implementó estas APIs para uso interno, por lo que no hay ninguna garantía sobre su funcionalidad, mantenimiento o futura existencia. Úsalas bajo tu propio riesgo. (Probablemente no es aconsejable que las uses para nada crítico.)

How to get on Rinkeby Testnet in less than 10 minutes

Following instructions from the excellent https://www.rinkeby.io/

Synchronizing a Full Node

A full node lets you access all state. There is a light node (state-on-demand) and wallet-only (no state) instructions as well,

	"use strict";

	/******************************************************
	************ Simple ES6 Vector2 Class ************
	******************************************************
	* Author: Starbeamrainbowlabs
	* Twitter: @SBRLabs
	* Email: feedback at starbeamrainbowlabs dot com
	*
	* From https://gist.github.com/sbrl/69a8fa588865cacef9c0

	# Requires pydub (with ffmpeg) and Pillow
	#
	# Usage: python waveform.py <audio_file>

	import sys

	from pydub import AudioSegment
	from PIL import Image, ImageDraw

	/*
	* Copyright (C) 2015 J.T. Gilkeson
	*
	* Licensed under the Apache License, Version 2.0 (the "License");
	* you may not use this file except in compliance with the License.
	* You may obtain a copy of the License at
	*
	* http://www.apache.org/licenses/LICENSE-2.0
	*
	* Unless required by applicable law or agreed to in writing, software

	I use the first


	—– BEGIN LICENSE —–
	Michael Barnes
	Single User License
	EA7E-821385
	8A353C41 872A0D5C DF9B2950 AFF6F667
	C458EA6D 8EA3C286 98D1D650 131A97AB
	AA919AEC EF20E143 B361B1E7 4C8B7F04

	'use strict';

	/*
	* Binary search tree with in-order iteration.
	* http://greim.github.io/gen/dist/00-intro.html
	*/

	class Tree {
	add(value) {
	if (this.root) this.root.add(value);

	db.test.drop();
	db.test.insertOne({
	name: 'Denver',
	location: {
	"type": "FeatureCollection",
	"features": [
	{
	"type": "Feature",
	"properties": {},
	"geometry": {

	/*
	This query will return a frequency analysis, e.g. number of active days in time window.
	If you ask for 28 days, it will give you the # of users who did your event 1 unique day, 2 unique days, etc
	in the time window.
	*/

	function main() {
	return Events({
	from_date: '2018-07-01',
	to_date: '2018-07-28',

	#include <stdio.h>

	/*
	* Calculates what Ada Lovelace labeled "B7", which today we would call the 8th
	* Bernoulli number.
	*/
	int main(int argc, char* argv[])
	{
	// ------------------------------------------------------------------------
	// Data