I hereby claim:
- I am louisebc on github.
- I am louisebc (https://keybase.io/louisebc) on keybase.
- I have a public key ASAVUM5Nrj91iBZwvALRz4Mkh_x9dvHENZhDAwQgFgj9swo
To claim this, I am signing this object:
| // case 1 | |
| new Promise((resolve, reject) => { throw new Error('fail'); }) | |
| .catch(err => { return Promise.reject(err); }) | |
| .then(val => console.log('[1] value: '+ val), err => console.log('[1] caught: ' + err.message)); | |
| // case 2 | |
| new Promise((resolve, reject) => { throw new Error('fail'); }) | |
| .catch(err => { throw err; }) | |
| .then(val => console.log('[2] value: '+ val), err => console.log('[2] caught: ' + err.message)); |
| diff --git a/playground/src/screens/ModalScreen.js b/playground/src/screens/ModalScreen.js | |
| index fb11315c..66bfe4cf 100644 | |
| --- a/playground/src/screens/ModalScreen.js | |
| +++ b/playground/src/screens/ModalScreen.js | |
| @@ -23,11 +23,11 @@ class ModalScreen extends React.Component { | |
| static options() { | |
| return { | |
| topBar: { | |
| - testID: MODAL_SCREEN_HEADER, | |
| - title: { |
I hereby claim:
To claim this, I am signing this object:
| (define (make-point x y)(cons x y)) | |
| (define (x-point point)(car point)) | |
| (define (y-point point)(cdr point)) | |
| (define (make-segment pointa pointb)(cons pointa pointb)) | |
| (define (start-segment segment)(car segment)) | |
| (define (end-segment segment)(cdr segment)) | |
| (define (midpoint-segment segment) | |
| (make-point (/ (+ (x-point (start-segment segment)) | |
| (x-point (end-segment segment))) 2) |
| -- Circular, doubly linked list -- | |
| ---------------------------------- | |
| local linkedList = {} | |
| -- Creates a list from table or variable n. of values -- | |
| function linkedList.construct(...) | |
| local args = {...} | |
| local tail = linkedList.newNode(args[1]) | |
| for i = 2, #args do |
| local mergeSort = {} | |
| local function mergeHalves(array, first, last) | |
| local left = first | |
| local leftTail = math.floor((first + last) / 2) | |
| local right = leftTail + 1 | |
| local temp = {unpack(array)} | |
| -- Compare left and right halves of array, sort into temp -- | |
| for i = first, last do |
| #include <iostream> | |
| int giveMeFive(const int& a, const int& b) | |
| { | |
| int containsFive = 0; | |
| for (int i = a; i <= b; ++i) { | |
| std::string number = std::to_string(i); | |