Proxy to services based on Accept header.
docker-compose up -d
| merchant_id = 'XXXXXXXXXXXXXXXXXXX' | |
| merchant_hash_key = 'XXXXXXXXXXXXXXXXXXX' | |
| # implemetation for generating form | |
| payment_service_for @order.id, merchant_id, \ | |
| merchant_hash_key: merchant_hash_key, | |
| service: :veritrans, | |
| amount: @order.total_amount, | |
| currency: 'IDR', | |
| html: {:id => 'payment-form' , :authenticity_token => false } do |service| |
| # Floyd-Warshall Algorithm | |
| ## Introduction: | |
| Finds Shortest Path (or longest path) among all pairs of nodes in a graph. | |
| Complexity: O(|n|³) | |
| ## How does it work? | |
| - There can be more than one route between two nodes. | |
| - The number of nodes in the route isn’t important (Path 4 has 4 nodes but is shorter than Path 2, which has 3 nodes) | |
| - There can be more than one path of minimal length |
| export default 'bar'; |
| var gulp = require('gulp'); | |
| var sourcemaps = require('gulp-sourcemaps'); | |
| var source = require('vinyl-source-stream'); | |
| var buffer = require('vinyl-buffer'); | |
| var browserify = require('browserify'); | |
| var watchify = require('watchify'); | |
| var babel = require('babelify'); | |
| function compile(watch) { | |
| var bundler = watchify(browserify('./src/index.js', { debug: true }).transform(babel)); |
| PASSWORD1 # Replace literal string 'PASSWORD1' with '***REMOVED***' (default) | |
| PASSWORD2==>examplePass # replace with 'examplePass' instead | |
| PASSWORD3==> # replace with the empty string | |
| regex:password=\w+==>password= # Replace, using a regex | |
| regex:\r(\n)==>$1 # Replace Windows newlines with Unix newlines |