#NEWLINE# def lrem( self , key , value , count = 0 ) : #NEWLINE# #INDENT# '\n        @param key Redis key\n        @param value value to match\n        @param count number of occurrences of value\n        Remove the first count occurrences of the value element from the\n        list. If count is zero all the elements are removed. If count is\n        negative elements are removed from tail to head, instead to go from\n        head to tail that is the normal behavior. So for example LREM with\n        count -2 and hello as value to remove against the list\n        (a,b,c,hello,x,hello,hello) will lave the list (a,b,c,hello,x). The\n        number of removed elements is returned as an integer, see below for\n        more information about the returned value. Note that non existing\n        keys are considered like empty lists by LREM, so LREM against non\n        existing keys will always return 0.\n\n        @retval deferred that returns the number of removed elements\n        (int) if the operation succeeded\n\n        @note Time complexity: O(N) (with N being the length of the list)\n        ' #NEWLINE# self . _send ( 'LREM' , key , count , key ) #NEWLINE# return self . getResponse ( )