| use std::str; | |
| fn main() { | |
| // -- FROM: vec of chars -- | |
| let src1: Vec<char> = vec!['j','{','"','i','m','m','y','"','}']; | |
| // to String | |
| let string1: String = src1.iter().collect::<String>(); | |
| // to str | |
| let str1: &str = &src1.iter().collect::<String>(); | |
| // to vec of byte |
| def move_to_dir(old, new): | |
| """Converts using e.g. old position (1,1) and new position (2, 1) to a direction (RIGHT)""" | |
| if old[0] < new[0]: | |
| return "RIGHT" | |
| if old[1] < new[1]: | |
| return "DOWN" | |
| if old[0] > new[0]: | |
| return "LEFT" | |
| return "UP" |
| #include <ESP8266WiFi.h> | |
| #include <PubSubClient.h> | |
| #include "/usr/local/src/ap_setting.h" | |
| extern "C" { | |
| #include "user_interface.h" | |
| } | |
| #define FPM_SLEEP_MAX_TIME 0xFFFFFFF |
#README:
This script for mpv intends to offer the fastest and simplest way to convert parts of a video—while you’re watching it and not really more work intensive than making a screenshot. A short demonstration: https://d.maxfile.ro/omdwzyhkoa.webm
##Installation:
You need:
| // gecko and webkit | |
| // details here https://developer.mozilla.org/en-US/docs/DOM/event.initKeyEvent | |
| var keyboardEvent = document.createEvent("KeyboardEvent"); | |
| var initMethod = typeof keyboardEvent.initKeyboardEvent !== 'undefined' ? "initKeyboardEvent" : "initKeyEvent"; | |
| keyboardEvent[initMethod]( | |
| "keydown", // event type : keydown, keyup, keypress | |
| true, // bubbles |
| /* This WAS a two-line function until an awesome reddit user pointed out my logical flaw. Now It's a 5-line function :( */ | |
| var Class = function(d){ | |
| d.constructor.extend = function(def){ | |
| for (var k in d) if (!def.hasOwnProperty(k)) def[k] = d[k]; | |
| return Class(def); | |
| }; | |
| return (d.constructor.prototype = d).constructor; | |
| }; |
| Some possible implementations of the Bresenham Algorithms in C. | |
| The Bresenham line algorithm is an algorithm which determines which points in an | |
| n-dimensional raster should be plotted in order to form a close approximation | |
| to a straight line between two given points. | |
| It is commonly used to draw lines on a computer screen, as it uses only integer | |
| addition, subtraction and bit shifting, all of which are very cheap operations | |
| in standard computer architectures. | |
| It is one of the earliest algorithms developed in the field of computer graphics. | |
| A minor extension to the original algorithm also deals with drawing circles. |
| /* | |
| * object.watch polyfill | |
| * | |
| * 2012-04-03 | |
| * | |
| * By Eli Grey, http://eligrey.com | |
| * Public Domain. | |
| * NO WARRANTY EXPRESSED OR IMPLIED. USE AT YOUR OWN RISK. | |
| */ |
