| /* | |
| File: main.c | |
| Date: November 28th, 2012 | |
| Description: This file implements the Japanese Taiko Drum Sensei. | |
| ----------- | |
| See Bruce Land's "CORNELL ECE 4760" Website for description of project: | |
| < http://people.ece.cornell.edu/land/courses/ece4760/FinalProjects/ > | |
| Authors: |
No need to click on an a tag to see the equation, just hover on any <a> tag created using \eqref{label} and that's it!
| /* | |
| * Favor manter este cabeçalho e citar meu nome e meu site (carlosdelfino.eti.br) quando referir-se a este código. | |
| * Autor Carlos Delfino {professor@carlosdelfino.eti.br} | |
| */ | |
| void setup() { | |
| Serial.begin(9600); | |
| pinMode(A0,OUTPUT); | |
| pinMode(A2,OUTPUT); | |
| pinMode(A3,OUTPUT); |
| /** | |
| * Shield indicado: https://www.autocorerobotica.com.br/display-lcd-shield-com-teclado | |
| */ | |
| byte readButton() { | |
| int botao = analogRead (BUTTON_PORT); | |
| if (botao < BUTTON_LIMIAR_DIREITA) { | |
| return BUTTON_RIGHT; | |
| } else if (botao < BUTTON_LIMIAR_CIMA) { | |
| return BUTTON_UP; | |
| } else if (botao < BUTTON_LIMIAR_BAIXO) { |
| *.DS_Store | |
| .vscode | |
| .idea/ | |
| .awcache | |
| .circleci | |
| .github | |
| .storybook | |
| .git | |
| build | |
| dist |
| *.DS_Store | |
| .vscode | |
| .idea/ | |
| .awcache | |
| .circleci | |
| .github | |
| .storybook | |
| .git | |
| build | |
| dist |
| # frozen_string_literal: true | |
| source 'https://rubygems.org' | |
| git_source(:github) { |repo| "https://github.com/#{repo}.git" } | |
| ruby '2.6.5' | |
| # Bundle edge Rails instead: gem 'rails', github: 'rails/rails' | |
| gem 'rails', '~> 6.0.0.beta1' |
Huffman coding is a compression method which generates variable-length codes for data – the more frequent the data item, the shorter the code generated. This allows more efficient compression than fixed-length codes. This is an implementation of the algorithm in C. The function huffman() takes arrays of letters and their frequencies, the length of the arrays, and a callback which is called for each code generated. The algorithm requires a priority queue, and I used a min-heap for the purpose.
A dynamic array is one that grows to accommodate new items, overcoming the limitations of fixed-size arrays. New items can be added at the head or tail, or inserted in the middle. Existing elements are moved to accommodate new ones as necessary.
| # CMakeLists.txt | |
| cmake_minimum_required(VERSION 3.0) | |
| project("Hello World OpenCV com VCPkg e CMake") | |
| find_package(OpenCV CONFIG REQUIRED) | |
| add_executable(main main.cpp) | |
| target_link_libraries(main PRIVATE opencv_core opencv_imgproc opencv_videoio opencv_highgui) |
Launch the node TCP server for FastAGI:
~$ node path/to/fastagi.js
Add a context for FastAGI testing:
[fastagi-test]