69 for (
auto i=
r.header.begin (); i !=
r.header.end (); i++) {
70 string key =
locase_all (
string (i->first.c_str ()));
71 string value=
string (i->second.c_str ());
85 string key =
it->next ();
string locase_all(string s)
Converts all uppercase characters in a string to lowercase.
A simple hashmap class implementation.
The list class represents a linked list.
list(T item)
Construct a new list object with a single item.
iterator< T > iterate(hashmap< T, U > h)
Generates an iterator for a container of type hashmap<T, U>.
http_tree download(url from, url to, http_headers headers)
static http_tree response_to_tree(cpr::Response r, string url)
lolly_tree< blackbox > http_tree
void http_response_set(http_tree r, http_label op, http_tree t)
static cpr::Header as_cpr_header(http_headers hmap)
hashmap< string, string > http_headers
http_tree blackbox_tree(int label, T data)
const char * HTTP_USER_AGENT
http_tree http_response_init()
http_tree http_head(url u, http_headers headers)
http_tree http_get(url u, http_headers headers)
string as_string(int16_t i)