var client = new Ax.redis.Redis("REDIS1");
   console.log(client.isReady());

var client = new Ax.redis.Redis("192.168.105.173", 6379);
   console.log(client.isReady());

var client = new Ax.redis.Redis("master1", ["192.168.105.174:8001", "192.168.105.174:8002", "192.168.105.174:8003"], 60, null);
 	 console.log('client is ready? ' + client.isReady())
 	 client.ping();
 	 client.sadd("key_4", ["val_44"]);

id=49  addr=127.0.0.1:59590 laddr=127.0.0.1:6379 fd=8 name= age=4010 idle=218 flags=N db=0 sub=0 psub=0 multi=-1 qbuf=0 qbuf-free=0 argv-mem=0 obl=0 oll=0 omem=0 tot-mem=17440 events=r cmd=client user=default redir=-1
  id=124 addr=127.0.0.1:60003 laddr=127.0.0.1:6379 fd=9 name= age=0 idle=0 flags=N db=0 sub=0 psub=0 multi=-1 qbuf=26 qbuf-free=65504 argv-mem=10 obl=0 oll=0 omem=0 tot-mem=82970 events=r cmd=client user=default redir=-1

let code = 'myRedis1';
   if (Ax.redis.Redis.exists(code)) {
      console.log('exists Redis with code ' + code);
   }

FT.ADD {index} {docId} {score}
	  [NOSAVE]
	  [REPLACE]
	  [LANGUAGE {language}]
	  [PAYLOAD {payload}]
	  FIELDS {field} {value} [{field} {value}...]

SearchResult object.

 
 
 Ax.redis.get().ftSearch("indxname", "q..", options => {
   	options.limit();
   	options.setNoContent();
   	options.setVerbatim();
   	options.setNoStopwords();
   	options.setWithScores();
   	options.setWithPayload();
   	options.setSortBy();
 })

Ax.ext.db.getRedisClient().sugget("sug_test", "pilota");

Ax.ext.db.getRedisClient().sugget("sug_test", "pilota", 10);

Ax.ext.db.getRedisClient().sugget("sug_test", "pilota", true);

Ax.ext.db.getRedisClient().sugget("sug_test", "pilota", true, 10);

Ax.ext.db.getRedisClient().sugget("sug_test", "pilota", true, false, true, 10);

FT.INFO demo_pos_v2_prod_sp_B
	1) index_name
	2) demo_pos_v2_prod_sp_B
	3) index_options
	4)
	5) index_definition
	6)      1) key_type
	        2) HASH
	        3) prefixes
	        4)              1) demo_pos_v2_prod_sp_B:

	        5) default_score
	        6) 1
	        7) payload_field
	        8) __payload

	7) attributes
	 8) 1) 1) identifier
	       2) title
	       3) attribute
	       4) title
	       5) type
	       6) TEXT
	       7) WEIGHT
	       8) "1"
	    2) 1) identifier
	       2) release_year
	       3) attribute
	       4) release_year
	       5) type
	       6) NUMERIC
	       7) SORTABLE


	9) num_docs
	10) 196
	11) max_doc_id
	12) 394
	13) num_terms
	14) 3899
	15) num_records
	16) 12311
	17) inverted_sz_mb
	18) 0.068743705749511719
	19) total_inverted_index_blocks
	20) 15455349
	21) offset_vectors_sz_mb
	22) 0.0176239013671875
	23) doc_table_size_mb
	24) 0.25942230224609375
	25) sortable_values_size_mb
	26) 0.042790412902832031
	27) key_table_size_mb
	28) 0.0050230026245117188
	29) records_per_doc_avg
	30) 62.811225891113281
	31) bytes_per_record_avg
	32) 5.8551702499389648
	33) offsets_per_term_avg
	34) 1.5010966062545776
	35) offset_bits_per_record_avg
	36) 8
	37) hash_indexing_failures
	38) 0
	39) indexing
	40) 0
	41) percent_indexed
 	42) 1
 	43) gc_stats
 	44)     1) bytes_collected
 	        2) 31626
 	        3) total_ms_run
 	        4) 229
 	        5) total_cycles
 	        6) 1
 	        7) average_cycle_time_ms
 	        8) 229
 	        9) last_run_time_ms
 	        10) 229
 	        11) gc_numeric_trees_missed
 	        12) 0
 	        13) gc_blocks_denied
 	        14) 0

 	45) cursor_stats
 	46)     1) global_idle
 	        2) 0
 	        3) global_total
 	        4) 0
 	        5) index_capacity
 	        6) 128
 	        7) index_total
 	        8) 0

 	47) stopwords_list

# Modules
	module:name=search,ver=999999,api=1,filters=0,usedby=[],using=[],options=[]

Time complexity:

Time complexity:

If the field is not found or the key does not exist, a special 'nil' value is returned.
 
 Time complexity:

Time complexity:

The range of values supported by HINCRBY is limited to 64 bit signed integers.
 
 Time complexity:

The range of values supported by HINCRBYFLOAT is limited to double precision floating point values.
 
 Time complexity:

Time complexity:

Time complexity:

If some of the specified fields do not exist, nil values are returned. Non existing keys are considered like empty
 hashes.
 
 Time complexity:

If key does not exist, a new key holding a hash is created.
 
 Time complexity:

Time complexity:

Time complexity:

Time complexity:

If key does not exist, a new key holding a hash is created.
 
 Time complexity:

Time complexity:

Time complexity:

For example LRANGE foobar 0 2 will return the first three elements of the list.
 
 start and end can also be negative numbers indicating offsets from the end of the list. For example -1 is the last
 element of the list, -2 the penultimate element and so on.
 
 Consistency with range functions in various programming languages

Note that if you have a list of numbers from 0 to 100, LRANGE 0 10 will return 11 elements, that is, rightmost item is
 included. This may or may not be consistent with behavior of range-related functions in your programming language of
 choice (think Ruby's Range.new, Array#slice or Python's range() function).
 
 LRANGE behavior is consistent with one of Tcl.
 
 Out-of-range indexes

Out of range indexes will generate an error.
 
 Similarly to other list commands accepting indexes, the index can be negative to access elements starting from the end of
 the list. So -1 is the last element, -2 is the penultimate, and so forth.
 
 Time complexity:

Example:

key1 = [x, a, b, c]
 key2 = [c]
 key3 = [a, d]
 SDIFF key1,key2,key3 = [x, b]

Time complexity:

SWAPDB 0 1

As the terms imply, the ZINTERSTORE command requires an element to be present
 in each of the given inputs to be inserted in the result. The ZUNIONSTORE
 command inserts all elements across all inputs.
 
 Using the WEIGHTS option, it is possible to add weight to each input sorted set. This means that the score of each
 element in the sorted set is first multiplied by this weight before being passed to the aggregation. When this option is
 not given, all weights default to 1.
 
 With the AGGREGATE option, it is possible to specify how the results of the union or intersection are aggregated. This
 option defaults to SUM, where the score of an element is summed across the inputs where it exists. When this option is
 set to be either MIN or MAX, the resulting set will contain the minimum or maximum score of an element across the inputs
 where it exists.
 
 Time complexity:

As the terms imply, the ZINTERSTORE command requires an element to be present
 in each of the given inputs to be inserted in the result. The ZUNIONSTORE
 command inserts all elements across all inputs.
 
 Using the WEIGHTS option, it is possible to add weight to each input sorted set. This means that the score of each
 element in the sorted set is first multiplied by this weight before being passed to the aggregation. When this option is
 not given, all weights default to 1.
 
 With the AGGREGATE option, it is possible to specify how the results of the union or intersection are aggregated. This
 option defaults to SUM, where the score of an element is summed across the inputs where it exists. When this option is
 set to be either MIN or MAX, the resulting set will contain the minimum or maximum score of an element across the inputs
 where it exists.
 
 Time complexity:

The elements having the same score are returned sorted lexicographically as ASCII strings (this follows from a property
 of Redis sorted sets and does not involve further computation).
 
 Using the optional LIMIT it is possible to get only a range
 of the matching elements in an SQL-alike way. Note that if the offset is large the commands needs to traverse the list
 for offset elements and this adds up to the O(M) figure.
 
 The ZCOUNT command is similar to
 ZRANGEBYSCORE but instead of returning the actual elements in the
 specified interval, it just returns the number of matching elements.
 
 Exclusive intervals and infinity

min and max can be -inf and +inf, so that you are not required to know what's the greatest or smallest element in order
 to take, for instance, elements "up to a given value".
 
 Also while the interval is for default closed (inclusive) it is possible to specify open intervals prefixing the score
 with a "(" character, so for instance:
 
 ZRANGEBYSCORE zset (1.3 5
 
 Will return all the values with score  1.3 and = 5, while for instance:
 
 ZRANGEBYSCORE zset (5 (10
 
 Will return all the values with score  5 and  10 (5 and 10 excluded).
 
 Time complexity:

The elements having the same score are returned sorted lexicographically as ASCII strings (this follows from a property
 of Redis sorted sets and does not involve further computation).
 
 Using the optional LIMIT it is possible to get only a range
 of the matching elements in an SQL-alike way. Note that if offset is large the commands needs to traverse the list for
 offset elements and this adds up to the O(M) figure.
 
 The ZCOUNT command is similar to
 ZRANGEBYSCORE but instead of returning the actual elements in the
 specified interval, it just returns the number of matching elements.
 
 Exclusive intervals and infinity

min and max can be -inf and +inf, so that you are not required to know what's the greatest or smallest element in order
 to take, for instance, elements "up to a given value".
 
 Also while the interval is for default closed (inclusive) it is possible to specify open intervals prefixing the score
 with a "(" character, so for instance:
 
 ZRANGEBYSCORE zset (1.3 5
 
 Will return all the values with score  1.3 and = 5, while for instance:
 
 ZRANGEBYSCORE zset (5 (10
 
 Will return all the values with score  5 and  10 (5 and 10 excluded).
 
 Time complexity:

The elements having the same score are returned sorted lexicographically as ASCII strings (this follows from a property
 of Redis sorted sets and does not involve further computation).
 
 Using the optional LIMIT it is possible to get only a range
 of the matching elements in an SQL-alike way. Note that if offset is large the commands needs to traverse the list for
 offset elements and this adds up to the O(M) figure.
 
 The ZCOUNT command is similar to
 ZRANGEBYSCORE but instead of returning the actual elements in the
 specified interval, it just returns the number of matching elements.
 
 Exclusive intervals and infinity

min and max can be -inf and +inf, so that you are not required to know what's the greatest or smallest element in order
 to take, for instance, elements "up to a given value".
 
 Also while the interval is for default closed (inclusive) it is possible to specify open intervals prefixing the score
 with a "(" character, so for instance:
 
 ZRANGEBYSCORE zset (1.3 5
 
 Will return all the values with score  1.3 and = 5, while for instance:
 
 ZRANGEBYSCORE zset (5 (10
 
 Will return all the values with score  5 and  10 (5 and 10 excluded).
 
 Time complexity:

The elements having the same score are returned sorted lexicographically as ASCII strings (this follows from a property
 of Redis sorted sets and does not involve further computation).
 
 Using the optional LIMIT it is possible to get only a range
 of the matching elements in an SQL-alike way. Note that if offset is large the commands needs to traverse the list for
 offset elements and this adds up to the O(M) figure.
 
 The ZCOUNT command is similar to
 ZRANGEBYSCORE but instead of returning the actual elements in the
 specified interval, it just returns the number of matching elements.
 
 Exclusive intervals and infinity

min and max can be -inf and +inf, so that you are not required to know what's the greatest or smallest element in order
 to take, for instance, elements "up to a given value".
 
 Also while the interval is for default closed (inclusive) it is possible to specify open intervals prefixing the score
 with a "(" character, so for instance:
 
 ZRANGEBYSCORE zset (1.3 5
 
 Will return all the values with score  1.3 and = 5, while for instance:
 
 ZRANGEBYSCORE zset (5 (10
 
 Will return all the values with score  5 and  10 (5 and 10 excluded).
 
 Time complexity:

Time complexity:

Time complexity:

As the terms imply, the  ZINTERSTORE} command requires an element to be
 present in each of the given inputs to be inserted in the result. The  command
 inserts all elements across all inputs.
 
 Using the WEIGHTS option, it is possible to add weight to each input sorted set. This means that the score of each
 element in the sorted set is first multiplied by this weight before being passed to the aggregation. When this option is
 not given, all weights default to 1.
 
 With the AGGREGATE option, it is possible to specify how the results of the union or intersection are aggregated. This
 option defaults to SUM, where the score of an element is summed across the inputs where it exists. When this option is
 set to be either MIN or MAX, the resulting set will contain the minimum or maximum score of an element across the inputs
 where it exists.
 
 Time complexity:

As the terms imply, the ZINTERSTORE command requires an element to be present
 in each of the given inputs to be inserted in the result. The ZUNIONSTORE
 command inserts all elements across all inputs.
 
 Using the WEIGHTS option, it is possible to add weight to each input sorted set. This means that the score of each
 element in the sorted set is first multiplied by this weight before being passed to the aggregation. When this option is
 not given, all weights default to 1.
 
 With the AGGREGATE option, it is possible to specify how the results of the union or intersection are aggregated. This
 option defaults to SUM, where the score of an element is summed across the inputs where it exists. When this option is
 set to be either MIN or MAX, the resulting set will contain the minimum or maximum score of an element across the inputs
 where it exists.
 
 Time complexity: