This is a step-by-step guide for porting an application from MFC to wxWidgets based on my experience in porting Hippy.
- wxWidgets documentation for detailed class references.
- wxWidgets wiki for general wxWidgets programming guides
- Compiling using MS VC++
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
:: adapted from http://stackoverflow.com/a/10945887/1810071 | |
@echo off | |
for /f "skip=1" %%x in ('wmic os get localdatetime') do if not defined MyDate set MyDate=%%x | |
for /f %%x in ('wmic path win32_localtime get /format:list ^| findstr "="') do set %%x | |
set fmonth=00%Month% | |
set fday=00%Day% | |
set today=%Year%-%fmonth:~-2%-%fday:~-2% | |
echo %today% |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include "wx/wx.h" | |
#include "wx/dataview.h" | |
///////// | |
// Implement a simple model with 2 columns | |
// FileName FileSize | |
///////// | |
class DataModelNode; | |
WX_DEFINE_ARRAY_PTR(DataModelNode *, DataModelNodePtrArray); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include "wx/wx.h" | |
#include "wx/dataview.h" | |
///////// | |
// Implement a simple model with 2 columns | |
// FileName FileSize | |
///////// | |
class DataModelNode; | |
WX_DEFINE_ARRAY_PTR(DataModelNode *, DataModelNodePtrArray); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* fix_fft.c - Fixed-point in-place Fast Fourier Transform */ | |
/* | |
All data are fixed-point short integers, in which -32768 | |
to +32768 represent -1.0 to +1.0 respectively. Integer | |
arithmetic is used for speed, instead of the more natural | |
floating-point. | |
For the forward FFT (time -> freq), fixed scaling is | |
performed to prevent arithmetic overflow, and to map a 0dB | |
sine/cosine wave (i.e. amplitude = 32767) to two -6dB freq |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
[mergetool] | |
prompt = false | |
keepBackup = false | |
keepTemporaries = false | |
[merge] | |
tool = winmerge | |
[mergetool "winmerge"] | |
name = WinMerge |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Youtube Link: https://www.youtube.com/watch?v=PgLjwl6Br0k | |
import tkinter as tk | |
from tkinter import filedialog, messagebox, ttk | |
import pandas as pd | |
# initalise the tkinter GUI | |
root = tk.Tk() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// A simple Lexer meant to demonstrate a few theoretical concepts. It can | |
// support several parser concepts and is very fast (though speed is not its | |
// design goal). | |
// | |
// J. Arrieta, Nabla Zero Labs | |
// | |
// This code is released under the MIT License. | |
// | |
// Copyright 2018 Nabla Zero Labs | |
// |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* = Recursive descent parser = | |
* | |
* MIT Style License | |
* By Dmitry Soshnikov <dmitry.soshnikov@gmail.com> | |
* | |
* In this short lecture we'll cover the basic (non-predictive, backtracking) | |
* recursive descent parsing algorithm. | |
* | |
* Recursive descent is an LL parser: scan from left to right, doing |
NewerOlder