It was the Bitcointalk forum that inspired us to create Bitcointalksearch.org - Bitcointalk is an excellent site that should be the default page for anybody dealing in cryptocurrency, since it is a virtual gold-mine of data. However, our experience and user feedback led us create our site; Bitcointalk's search is slow, and difficult to get the results you need, because you need to log in first to find anything useful - furthermore, there are rate limiters for their search functionality.
The aim of our project is to create a faster website that yields more results and faster without having to create an account and eliminate the need to log in - your personal data, therefore, will never be in jeopardy since we are not asking for any of your data and you don't need to provide them to use our site with all of its capabilities.
We created this website with the sole purpose of users being able to search quickly and efficiently in the field of cryptocurrency so they will have access to the latest and most accurate information and thereby assisting the crypto-community at large.
"blocks" : 15691,
"cards" : "Ace of Diamonds, Queen of Spades, 8 of Diamonds, 10 of Hearts, 4 of Hearts, ",
# ./pokercoind getblockhash 0
5b08cbe328392be8151f5deec2dc92e7609dcbd20e0dac335904ccf538df68e8
# ./pokercoind getcards 5b08cbe328392be8151f5deec2dc92e7609dcbd20e0dac335904ccf538df68e8
5 of Hearts, Queen of Hearts, 2 of Hearts, 3 of Hearts, 2 of Hearts,
//
// Get a Playing Card - version 0.0.1
//
std::string getcard( char c )
{
switch( std::tolower(c) ) {
case '1': return "Ace";
case '2': return "2";
case '3': return "3";
case '4': return "4";
case '5': return "5";
case '6': return "6";
case '7': return "7";
case '8': return "8";
case '9': return "9";
case 'a': return "10";
case 'b': return "Jack";
case 'c': return "Queen";
case 'd': return "King";
default: case 'e': case 'f': case '0': return "Joker";
}
}
//
// Get the Suit of a Playing Card - version 0.0.1
//
std::string getsuit( char c )
{
switch( std::tolower(c) ) {
default: return "ERROR";
case '0': case '1': case '2': case '3': return "Clubs";
case '4': case '5': case '6': case '7': return "Diamonds";
case '8': case '9': case 'a': case 'b': return "Hearts";
case 'c': case 'd': case 'e': case 'f': return "Spades";
}
}
//
// Get a Hand of Playing Cards - version 0.0.1
//
std::string GetCards( std::string hash, int limit = 5 )
{
if( hash.length() != 64 ) { return "ERROR: hash is not 64 chars long"; }
std::string deck, check;
int count = 0;
for (int i = 0; i < hash.length(); i+=2) {
check = hash.substr(i,2);
if( check[0] == '0' || check[0] == 'e' || check[0] == 'f' )
continue;
deck.append( getcard(check[0]) ).append( " of " ).append( getsuit(check[1]) ).append( ", " );
count++;
if( count == limit )
break;
}
if( count != limit )
deck.append( "ERROR: not enough valid cards in the deck" );
return deck;
}
//
// Get a Hand of Playing Cards - RPC call - version 0.0.1
//
Value getcards(const Array& params, bool fHelp)
{
if (fHelp || params.size() != 1)
throw runtime_error(
"getcards\n"
"Returns a hand of playing cards.");
std::string strHash = params[0].get_str();
return GetCards(strHash);
}
if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
return false;