I hereby claim:
- I am nikhilsaraf on github.
- I am nikhilsaraf (https://keybase.io/nikhilsaraf) on keybase.
- I have a public key ASB9RKvRGN6jb24ZpoDQHj00bpyW2mMErQyE4xNmdsDqgQo
To claim this, I am signing this object:
I hereby claim:
To claim this, I am signing this object:
/* | |
Copyright 2018 Lightyear.io | |
Licensed under the Apache License, Version 2.0 (the "License"); | |
you may not use this file except in compliance with the License. | |
You may obtain a copy of the License at | |
http://www.apache.org/licenses/LICENSE-2.0 | |
Unless required by applicable law or agreed to in writing, software |
This proposal allows you to coordinate signatures from multisig enabled accounts using SEP-0007 style payment requests, iff the accounts opt-in to use this protocol. This would need support from wallet developers.
multisig_uses_SEP-*
to indicate that multisig is enabled for this account using this proposal (the *
will be filled in once this is formalized into a SEP).multisig_coordinator
that specifies a domain (example: mymultisigservice.com
). The domain (mymultisigservice.com) will have a stellar.toml
file that contains a field MULTISIG_ENDPOINT
that lists an endpoint like so: https://mymultisigservice.com/multisig
. This follows from [SEP-0001](https://github.com/stellar/stellar-protocol/blob/master/epackage main | |
import ( | |
"io/ioutil" | |
"log" | |
"net/http" | |
"github.com/go-chi/chi" | |
) |
/** | |
sample code that gets an address book represented by a map | |
usage: | |
map = getAddressBookComplex(); | |
phoneNumber = map.get("Ava"); // (415)-730-xxxx | |
*/ | |
Map<String, String> getAddressBookComplex() { | |
Map<String, String> map = new HashMap<>(); | |
map.put("Ava", "(415)-730-xxxx"); | |
map.put("Bob", "(512)-349-xxxx"); |
/** | |
AddressBook is a model for how to store the address or phone number for individuals. | |
*/ | |
class AddressBook { | |
private Map<String, String> map; | |
public AddressBook(Map<String, String> map) { | |
this.map = map; | |
} |
Let’s develop a deeper understanding for a text based problem and solve it for all instances of the problem | |
Problem: | |
We have 4 tokens that we want to reduce to their simplest form. | |
Tokens: | |
A# | |
#A | |
B# | |
#B |