by Angel Leon. March 17, 2015;
Last update on December 14, 2023
Updated on February 27, 2023
Updated August 29, 2019.
lencioni
/ AsyncComponent.jsx
Created
January 8, 2017 17:09
<AsyncComponent> at Airbnb used for Webpack code splitting
This file contains hidden or 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
| // Usage: | |
| // | |
| // function loader() { | |
| // return new Promise((resolve) => { | |
| // if (process.env.LAZY_LOAD) { | |
| // require.ensure([], (require) => { | |
| // resolve(require('./SomeComponent').default); | |
| // }); | |
| // } | |
| // }); |
gubatron
/ compiling_building_c_cpp_notes.md
Last active
April 15, 2025 16:19
Things to remember when compiling and linking C/C++ programs
This file contains hidden or 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
| // NOTICE 2020-04-18 | |
| // Please see the comments below about why this is not a great PRNG. | |
| // Read summary by @bryc here: | |
| // https://github.com/bryc/code/blob/master/jshash/PRNGs.md | |
| // Have a look at js-arbit which uses Alea: | |
| // https://github.com/blixt/js-arbit | |
| /** |
zhangsen
/ 0-1-knapsack.py
Created
June 17, 2012 02:37
0-1 knapsack with exact total weight and minimal total value
This file contains hidden or 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
| # http://programmers.stackexchange.com/questions/117136/converting-a-bounded-knapsack-problem-to-0-1-knapsack-problem | |
| # weight: cable length | |
| # total weight: target span | |
| # value: 1 for each cable | |
| # want minimum number of cables, i.e. minimum total value | |
| def knapsack_01_exact_min(weights, values, W): | |
| # 0-1 knapsack, exact total weight W, minimizing total value | |
| n = len(weights) |