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
| Verify Github on Galxe. gid:NG99RRCM7v5VebUY7kco7o |
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
| Building wheel for scrypt (setup.py) ... error | |
| ERROR: Command errored out with exit status 1: | |
| command: /Users/ilshat/workspace/upwork/coinwallet/env/bin/python3.7 -u -c 'import sys, setuptools, tokenize; sys.argv[0] = '"'"'/private/var/folders/65/06pf25b13yl3w6qvvgjhjnd40000gn/T/pip-install-fiucx38_/scrypt/setup.py'"'"'; __file__='"'"'/private/var/folders/65/06pf25b13yl3w6qvvgjhjnd40000gn/T/pip-install-fiucx38_/scrypt/setup.py'"'"';f=getattr(tokenize, '"'"'open'"'"', open)(__file__);code=f.read().replace('"'"'\r\n'"'"', '"'"'\n'"'"');f.close();exec(compile(code, __file__, '"'"'exec'"'"'))' bdist_wheel -d /private/var/folders/65/06pf25b13yl3w6qvvgjhjnd40000gn/T/pip-wheel-irr0skkt | |
| cwd: /private/var/folders/65/06pf25b13yl3w6qvvgjhjnd40000gn/T/pip-install-fiucx38_/scrypt/ | |
| Complete output (36 lines): | |
| running bdist_wheel | |
| running build | |
| running build_py | |
| creating build | |
| creating build/lib.macosx-10.15-x86_64-3.7 |
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
| {"rbit_btc":[{"type":"ask","price":0.00000006,"amount":8388.54912892,"tid":200000082,"timestamp":1516155997},{"type":"ask","price":0.00000006,"amount":16252.49617821,"tid":200000081,"timestamp":1516155969},{"type":"ask","price":0.00000006,"amount":16252.49617821,"tid":200000080,"timestamp":1516155958},{"type":"bid","price":0.00000008,"amount":1892.20309381,"tid":200000079,"timestamp":1516136141},{"type":"ask","price":0.00000006,"amount":10000,"tid":200000078,"timestamp":1516129952},{"type":"ask","price":0.00000006,"amount":14814.24315746,"tid":200000077,"timestamp":1516129952},{"type":"ask","price":0.00000006,"amount":2118.27409605,"tid":200000076,"timestamp":1516129186},{"type":"bid","price":0.00000007,"amount":1571.42857142,"tid":200000075,"timestamp":1516129181},{"type":"ask","price":0.00000007,"amount":10000,"tid":200000074,"timestamp":1516125594},{"type":"ask","price":0.00000007,"amount":68265.87918453,"tid":200000073,"timestamp":1516125594},{"type":"ask","price":0.00000007,"amount":3047.73577884,"tid":2 |
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
| {"rbit_btc":{"asks":[[0.00000008,9698.01944305],[0.00000009,324333.2408136],[0.0000001,22603.29033612],[0.00000011,134273.4255856],[0.00000012,64893.39112706],[0.00000013,34682.44112567],[0.00000014,15330.98761918],[0.00000015,148654.97269191],[0.00000016,31329.42346901],[0.00000017,21568.79321135],[0.00000018,16020.31180013],[0.00000019,7696.62933675],[0.0000002,421952.03428708],[0.00000021,13107.71739189],[0.00000022,30255.13408308],[0.00000023,15746.07986777],[0.00000024,22803.26575631],[0.00000025,92612.2763953],[0.00000026,117695.95145873],[0.00000027,7246.74269755],[0.00000028,7003.68475041],[0.00000029,51223.66976387],[0.0000003,22003.96806387],[0.00000031,13906.4783138],[0.00000032,64134],[0.00000033,87549.49240855],[0.00000034,17845.12354626],[0.00000035,34537.32145318],[0.00000036,10741.02633343],[0.00000037,22304.82495677],[0.00000038,27455.98751915],[0.00000039,10538.94854233],[0.0000004,113363.51019909],[0.00000041,7531.19282072],[0.00000042,26303.40494379],[0.00000043,49428.52570145],[0.00000044 |
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
| require 'open-uri' | |
| require 'Nokogiri' | |
| require 'json' | |
| url = 'https://vk.com/away.php?to=https%3A%2F%2Fwww.avito.ru%2Fsankt-peterburg%2Fkvartiry%2Fsdam%2Fna_dlitelnyy_srok%2F1-komnatnye%3Fuser%3D1%26view%3Dlist%26metro%3D168-186-204' | |
| html = open(url) | |
| doc = Nokogiri::HTML(html) | |
| showings = [] | |
| doc.css('.item item_list js-catalog-item-enum clearfix c-b-0 cat_24').each do |item| | |
| item_id = item['id'].split('_').last.to_i |
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
| # Put unvisited nodes on a queue | |
| # Solves the shortest path problem: Find path from "source" to "target" | |
| # that uses the fewest number of edges | |
| # It's not recursive (like depth first search) | |
| # | |
| # The steps are quite simple: | |
| # * Put s into a FIFO queue and mark it as visited | |
| # * Repeat until the queue is empty: | |
| # - Remove the least recently added node n | |
| # - add each of n's unvisited adjacents to the queue and |
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
| # Put unvisited nodes on a queue | |
| # Solves the shortest path problem: Find path from "source" to "target" | |
| # that uses the fewest number of edges | |
| # It's not recursive (like depth first search) | |
| # | |
| # The steps are quite simple: | |
| # * Put s into a FIFO queue and mark it as visited | |
| # * Repeat until the queue is empty: | |
| # - Remove the least recently added node n | |
| # - add each of n's unvisited adjacents to the queue and |
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
| exports.post = function(request, response) { | |
| // Use "request.service" to access features of your mobile service, e.g.: | |
| // var tables = request.service.tables; | |
| // var push = request.service.push; | |
| var access_token = request.query.access_token; | |
| getUserInfo(request, response, access_token); | |
| }; | |
| function getUserInfo(request, response, access_token) { | |
| var req = require('request'); |
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
| package greenbox.mafia; | |
| class Keys { | |
| public static final String AppUrl = "https://greenbox-mafia.azure-mobile.net/";// from dashboard in azure | |
| public static final String AppKey = "blalblaldlldldcllcdsldlscl";// from dashboard in azure | |
| public final static String Scopes = | |
| "audience:server:client_id:" + | |
| "461695099470-a51st5m3g4a9tn9blfir3o7o6lacig01.apps.googleusercontent.com"; // IMPORTANT: from Client ID for web application!!! |
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
| package greenbox.mafia.model.game.server; | |
| import android.support.annotation.NonNull; | |
| import android.util.Log; | |
| import android.util.Pair; | |
| import com.google.common.util.concurrent.FutureCallback; | |
| import com.google.common.util.concurrent.Futures; | |
| import com.google.common.util.concurrent.ListenableFuture; | |
| import com.google.gson.JsonArray; |
NewerOlder