idx
int64
0
63k
question
stringlengths
53
5.28k
target
stringlengths
5
805
19,900
def put_document ( document_path : str , content_type : str , presigned_url : str ) -> str : body = pathlib . Path ( document_path ) . read_bytes ( ) headers = { 'Content-Type' : content_type } put_document_response = requests . put ( presigned_url , data = body , headers = headers ) put_document_response . raise_for_s...
Convenience method for putting a document to presigned url .
19,901
def get_expiration ( self ) : exp = self . _get_int ( 'expiration' ) if exp is not None : return datetime . datetime . fromtimestamp ( exp ) return None
Returns the expiration date .
19,902
def login ( self , user_id , password ) : self . _session = requests . session ( ) self . _session . verify = self . _verify_certs self . _session . auth = ( user_id , password ) try : self . _update_capabilities ( ) url_components = parse . urlparse ( self . url ) if self . _dav_endpoint_version == 1 : self . _davpath...
Authenticate to ownCloud . This will create a session on the server .
19,903
def file_info ( self , path ) : res = self . _make_dav_request ( 'PROPFIND' , path , headers = { 'Depth' : '0' } ) if res : return res [ 0 ] return None
Returns the file info for the given remote file
19,904
def get_file_contents ( self , path ) : path = self . _normalize_path ( path ) res = self . _session . get ( self . _webdav_url + parse . quote ( self . _encode_string ( path ) ) ) if res . status_code == 200 : return res . content elif res . status_code >= 400 : raise HTTPResponseError ( res ) return False
Returns the contents of a remote file
19,905
def get_directory_as_zip ( self , remote_path , local_file ) : remote_path = self . _normalize_path ( remote_path ) url = self . url + 'index.php/apps/files/ajax/download.php?dir=' + parse . quote ( remote_path ) res = self . _session . get ( url , stream = True ) if res . status_code == 200 : if local_file is None : l...
Downloads a remote directory as zip
19,906
def put_directory ( self , target_path , local_directory , ** kwargs ) : target_path = self . _normalize_path ( target_path ) if not target_path . endswith ( '/' ) : target_path += '/' gathered_files = [ ] if not local_directory . endswith ( '/' ) : local_directory += '/' basedir = os . path . basename ( local_director...
Upload a directory with all its contents
19,907
def _put_file_chunked ( self , remote_path , local_source_file , ** kwargs ) : chunk_size = kwargs . get ( 'chunk_size' , 10 * 1024 * 1024 ) result = True transfer_id = int ( time . time ( ) ) remote_path = self . _normalize_path ( remote_path ) if remote_path . endswith ( '/' ) : remote_path += os . path . basename ( ...
Uploads a file using chunks . If the file is smaller than chunk_size it will be uploaded directly .
19,908
def list_open_remote_share ( self ) : res = self . _make_ocs_request ( 'GET' , self . OCS_SERVICE_SHARE , 'remote_shares/pending' ) if res . status_code == 200 : tree = ET . fromstring ( res . content ) self . _check_ocs_status ( tree ) shares = [ ] for element in tree . find ( 'data' ) . iter ( 'element' ) : share_att...
List all pending remote shares
19,909
def accept_remote_share ( self , share_id ) : if not isinstance ( share_id , int ) : return False res = self . _make_ocs_request ( 'POST' , self . OCS_SERVICE_SHARE , 'remote_shares/pending/' + str ( share_id ) ) if res . status_code == 200 : return res raise HTTPResponseError ( res )
Accepts a remote share
19,910
def update_share ( self , share_id , ** kwargs ) : perms = kwargs . get ( 'perms' , None ) password = kwargs . get ( 'password' , None ) public_upload = kwargs . get ( 'public_upload' , None ) if ( isinstance ( perms , int ) ) and ( perms > self . OCS_PERMISSION_ALL ) : perms = None if not ( perms or password or ( publ...
Updates a given share
19,911
def share_file_with_link ( self , path , ** kwargs ) : perms = kwargs . get ( 'perms' , None ) public_upload = kwargs . get ( 'public_upload' , 'false' ) password = kwargs . get ( 'password' , None ) path = self . _normalize_path ( path ) post_data = { 'shareType' : self . OCS_SHARE_TYPE_LINK , 'path' : self . _encode_...
Shares a remote file with link
19,912
def is_shared ( self , path ) : self . file_info ( path ) try : result = self . get_shares ( path ) if result : return len ( result ) > 0 except OCSResponseError as e : if e . status_code != 404 : raise e return False return False
Checks whether a path is already shared
19,913
def get_share ( self , share_id ) : if ( share_id is None ) or not ( isinstance ( share_id , int ) ) : return None res = self . _make_ocs_request ( 'GET' , self . OCS_SERVICE_SHARE , 'shares/' + str ( share_id ) ) if res . status_code == 200 : tree = ET . fromstring ( res . content ) self . _check_ocs_status ( tree ) r...
Returns share information about known share
19,914
def get_shares ( self , path = '' , ** kwargs ) : if not ( isinstance ( path , six . string_types ) ) : return None data = 'shares' if path != '' : data += '?' path = self . _encode_string ( self . _normalize_path ( path ) ) args = { 'path' : path } reshares = kwargs . get ( 'reshares' , False ) if isinstance ( reshare...
Returns array of shares
19,915
def create_user ( self , user_name , initial_password ) : res = self . _make_ocs_request ( 'POST' , self . OCS_SERVICE_CLOUD , 'users' , data = { 'password' : initial_password , 'userid' : user_name } ) if res . status_code == 200 : tree = ET . fromstring ( res . content ) self . _check_ocs_status ( tree , [ 100 ] ) re...
Create a new user with an initial password via provisioning API . It is not an error if the user already existed before . If you get back an error 999 then the provisioning API is not enabled .
19,916
def delete_user ( self , user_name ) : res = self . _make_ocs_request ( 'DELETE' , self . OCS_SERVICE_CLOUD , 'users/' + user_name ) if res . status_code == 200 : return True raise HTTPResponseError ( res )
Deletes a user via provisioning API . If you get back an error 999 then the provisioning API is not enabled .
19,917
def search_users ( self , user_name ) : action_path = 'users' if user_name : action_path += '?search={}' . format ( user_name ) res = self . _make_ocs_request ( 'GET' , self . OCS_SERVICE_CLOUD , action_path ) if res . status_code == 200 : tree = ET . fromstring ( res . content ) users = [ x . text for x in tree . find...
Searches for users via provisioning API . If you get back an error 999 then the provisioning API is not enabled .
19,918
def set_user_attribute ( self , user_name , key , value ) : res = self . _make_ocs_request ( 'PUT' , self . OCS_SERVICE_CLOUD , 'users/' + parse . quote ( user_name ) , data = { 'key' : self . _encode_string ( key ) , 'value' : self . _encode_string ( value ) } ) if res . status_code == 200 : tree = ET . fromstring ( r...
Sets a user attribute
19,919
def add_user_to_group ( self , user_name , group_name ) : res = self . _make_ocs_request ( 'POST' , self . OCS_SERVICE_CLOUD , 'users/' + user_name + '/groups' , data = { 'groupid' : group_name } ) if res . status_code == 200 : tree = ET . fromstring ( res . content ) self . _check_ocs_status ( tree , [ 100 ] ) return ...
Adds a user to a group .
19,920
def get_user_groups ( self , user_name ) : res = self . _make_ocs_request ( 'GET' , self . OCS_SERVICE_CLOUD , 'users/' + user_name + '/groups' , ) if res . status_code == 200 : tree = ET . fromstring ( res . content ) self . _check_ocs_status ( tree , [ 100 ] ) return [ group . text for group in tree . find ( 'data/gr...
Get a list of groups associated to a user .
19,921
def get_user ( self , user_name ) : res = self . _make_ocs_request ( 'GET' , self . OCS_SERVICE_CLOUD , 'users/' + parse . quote ( user_name ) , data = { } ) tree = ET . fromstring ( res . content ) self . _check_ocs_status ( tree ) data_element = tree . find ( 'data' ) return self . _xml_to_dict ( data_element )
Retrieves information about a user
19,922
def get_user_subadmin_groups ( self , user_name ) : res = self . _make_ocs_request ( 'GET' , self . OCS_SERVICE_CLOUD , 'users/' + user_name + '/subadmins' , ) if res . status_code == 200 : tree = ET . fromstring ( res . content ) self . _check_ocs_status ( tree , [ 100 ] ) groups = tree . find ( 'data' ) return groups...
Get a list of subadmin groups associated to a user .
19,923
def share_file_with_user ( self , path , user , ** kwargs ) : remote_user = kwargs . get ( 'remote_user' , False ) perms = kwargs . get ( 'perms' , self . OCS_PERMISSION_READ ) if ( ( ( not isinstance ( perms , int ) ) or ( perms > self . OCS_PERMISSION_ALL ) ) or ( ( not isinstance ( user , six . string_types ) ) or (...
Shares a remote file with specified user
19,924
def delete_group ( self , group_name ) : res = self . _make_ocs_request ( 'DELETE' , self . OCS_SERVICE_CLOUD , 'groups/' + group_name ) if res . status_code == 200 : return True raise HTTPResponseError ( res )
Delete a group via provisioning API . If you get back an error 999 then the provisioning API is not enabled .
19,925
def get_groups ( self ) : res = self . _make_ocs_request ( 'GET' , self . OCS_SERVICE_CLOUD , 'groups' ) if res . status_code == 200 : tree = ET . fromstring ( res . content ) groups = [ x . text for x in tree . findall ( 'data/groups/element' ) ] return groups raise HTTPResponseError ( res )
Get groups via provisioning API . If you get back an error 999 then the provisioning API is not enabled .
19,926
def get_group_members ( self , group_name ) : res = self . _make_ocs_request ( 'GET' , self . OCS_SERVICE_CLOUD , 'groups/' + group_name ) if res . status_code == 200 : tree = ET . fromstring ( res . content ) self . _check_ocs_status ( tree , [ 100 ] ) return [ group . text for group in tree . find ( 'data/users' ) ] ...
Get group members via provisioning API . If you get back an error 999 then the provisioning API is not enabled .
19,927
def group_exists ( self , group_name ) : res = self . _make_ocs_request ( 'GET' , self . OCS_SERVICE_CLOUD , 'groups?search=' + group_name ) if res . status_code == 200 : tree = ET . fromstring ( res . content ) for code_el in tree . findall ( 'data/groups/element' ) : if code_el is not None and code_el . text == group...
Checks a group via provisioning API . If you get back an error 999 then the provisioning API is not enabled .
19,928
def share_file_with_group ( self , path , group , ** kwargs ) : perms = kwargs . get ( 'perms' , self . OCS_PERMISSION_READ ) if ( ( ( not isinstance ( perms , int ) ) or ( perms > self . OCS_PERMISSION_ALL ) ) or ( ( not isinstance ( group , six . string_types ) ) or ( group == '' ) ) ) : return False path = self . _n...
Shares a remote file with specified group
19,929
def get_attribute ( self , app = None , key = None ) : path = 'getattribute' if app is not None : path += '/' + parse . quote ( app , '' ) if key is not None : path += '/' + parse . quote ( self . _encode_string ( key ) , '' ) res = self . _make_ocs_request ( 'GET' , self . OCS_SERVICE_PRIVATEDATA , path ) if res . sta...
Returns an application attribute
19,930
def set_attribute ( self , app , key , value ) : path = 'setattribute/' + parse . quote ( app , '' ) + '/' + parse . quote ( self . _encode_string ( key ) , '' ) res = self . _make_ocs_request ( 'POST' , self . OCS_SERVICE_PRIVATEDATA , path , data = { 'value' : self . _encode_string ( value ) } ) if res . status_code ...
Sets an application attribute
19,931
def get_apps ( self ) : ena_apps = { } res = self . _make_ocs_request ( 'GET' , self . OCS_SERVICE_CLOUD , 'apps' ) if res . status_code != 200 : raise HTTPResponseError ( res ) tree = ET . fromstring ( res . content ) self . _check_ocs_status ( tree ) for el in tree . findall ( 'data/apps/element' ) : ena_apps [ el . ...
List all enabled apps through the provisioning api .
19,932
def enable_app ( self , appname ) : res = self . _make_ocs_request ( 'POST' , self . OCS_SERVICE_CLOUD , 'apps/' + appname ) if res . status_code == 200 : return True raise HTTPResponseError ( res )
Enable an app through provisioning_api
19,933
def _encode_string ( s ) : if six . PY2 and isinstance ( s , unicode ) : return s . encode ( 'utf-8' ) return s
Encodes a unicode instance to utf - 8 . If a str is passed it will simply be returned
19,934
def _check_ocs_status ( tree , accepted_codes = [ 100 ] ) : code_el = tree . find ( 'meta/statuscode' ) if code_el is not None and int ( code_el . text ) not in accepted_codes : r = requests . Response ( ) msg_el = tree . find ( 'meta/message' ) if msg_el is None : msg_el = tree r . _content = ET . tostring ( msg_el ) ...
Checks the status code of an OCS request
19,935
def make_ocs_request ( self , method , service , action , ** kwargs ) : accepted_codes = kwargs . pop ( 'accepted_codes' , [ 100 ] ) res = self . _make_ocs_request ( method , service , action , ** kwargs ) if res . status_code == 200 : tree = ET . fromstring ( res . content ) self . _check_ocs_status ( tree , accepted_...
Makes a OCS API request and analyses the response
19,936
def _make_ocs_request ( self , method , service , action , ** kwargs ) : slash = '' if service : slash = '/' path = self . OCS_BASEPATH + service + slash + action attributes = kwargs . copy ( ) if 'headers' not in attributes : attributes [ 'headers' ] = { } attributes [ 'headers' ] [ 'OCS-APIREQUEST' ] = 'true' if self...
Makes a OCS API request
19,937
def _make_dav_request ( self , method , path , ** kwargs ) : if self . _debug : print ( 'DAV request: %s %s' % ( method , path ) ) if kwargs . get ( 'headers' ) : print ( 'Headers: ' , kwargs . get ( 'headers' ) ) path = self . _normalize_path ( path ) res = self . _session . request ( method , self . _webdav_url + par...
Makes a WebDAV request
19,938
def _parse_dav_response ( self , res ) : if res . status_code == 207 : tree = ET . fromstring ( res . content ) items = [ ] for child in tree : items . append ( self . _parse_dav_element ( child ) ) return items return False
Parses the DAV responses from a multi - status response
19,939
def _parse_dav_element ( self , dav_response ) : href = parse . unquote ( self . _strip_dav_path ( dav_response . find ( '{DAV:}href' ) . text ) ) if six . PY2 : href = href . decode ( 'utf-8' ) file_type = 'file' if href [ - 1 ] == '/' : file_type = 'dir' file_attrs = { } attrs = dav_response . find ( '{DAV:}propstat'...
Parses a single DAV element
19,940
def _webdav_move_copy ( self , remote_path_source , remote_path_target , operation ) : if operation != "MOVE" and operation != "COPY" : return False if remote_path_target [ - 1 ] == '/' : remote_path_target += os . path . basename ( remote_path_source ) if not ( remote_path_target [ 0 ] == '/' ) : remote_path_target = ...
Copies or moves a remote file or directory
19,941
def _xml_to_dict ( self , element ) : return_dict = { } for el in element : return_dict [ el . tag ] = None children = el . getchildren ( ) if children : return_dict [ el . tag ] = self . _xml_to_dict ( children ) else : return_dict [ el . tag ] = el . text return return_dict
Take an XML element iterate over it and build a dict
19,942
def _get_shareinfo ( self , data_el ) : if ( data_el is None ) or not ( isinstance ( data_el , ET . Element ) ) : return None return ShareInfo ( self . _xml_to_dict ( data_el ) )
Simple helper which returns instance of ShareInfo class
19,943
def emit ( self , * args , ** kwargs ) : if self . _block : return for slot in self . _slots : if not slot : continue elif isinstance ( slot , partial ) : slot ( ) elif isinstance ( slot , weakref . WeakKeyDictionary ) : for obj , method in slot . items ( ) : method ( obj , * args , ** kwargs ) elif isinstance ( slot ,...
Calls all the connected slots with the provided args and kwargs unless block is activated
19,944
def connect ( self , slot ) : if not callable ( slot ) : raise ValueError ( "Connection to non-callable '%s' object failed" % slot . __class__ . __name__ ) if ( isinstance ( slot , partial ) or '<' in slot . __name__ ) : if slot not in self . _slots : self . _slots . append ( slot ) elif inspect . ismethod ( slot ) : s...
Connects the signal to any callable object
19,945
def disconnect ( self , slot ) : if not callable ( slot ) : return if inspect . ismethod ( slot ) : slotSelf = slot . __self__ for s in self . _slots : if isinstance ( s , weakref . WeakKeyDictionary ) and ( slotSelf in s ) and ( s [ slotSelf ] is slot . __func__ ) : self . _slots . remove ( s ) break elif isinstance (...
Disconnects the slot from the signal
19,946
def block ( self , signals = None , isBlocked = True ) : if signals : try : if isinstance ( signals , basestring ) : signals = [ signals ] except NameError : if isinstance ( signals , str ) : signals = [ signals ] signals = signals or self . keys ( ) for signal in signals : if signal not in self : raise RuntimeError ( ...
Sets the block on any provided signals or to all signals
19,947
def _open ( file_or_str , ** kwargs ) : if hasattr ( file_or_str , 'read' ) : yield file_or_str elif isinstance ( file_or_str , six . string_types ) : with open ( file_or_str , ** kwargs ) as file_desc : yield file_desc else : raise IOError ( 'Invalid file-or-str object: {}' . format ( file_or_str ) )
Either open a file handle or use an existing file - like object .
19,948
def load_delimited ( filename , converters , delimiter = r'\s+' ) : r n_columns = len ( converters ) columns = tuple ( list ( ) for _ in range ( n_columns ) ) splitter = re . compile ( delimiter ) with _open ( filename , mode = 'r' ) as input_file : for row , line in enumerate ( input_file , 1 ) : data = splitter . spl...
r Utility function for loading in data from an annotation file where columns are delimited . The number of columns is inferred from the length of the provided converters list .
19,949
def load_events ( filename , delimiter = r'\s+' ) : r events = load_delimited ( filename , [ float ] , delimiter ) events = np . array ( events ) try : util . validate_events ( events ) except ValueError as error : warnings . warn ( error . args [ 0 ] ) return events
r Import time - stamp events from an annotation file . The file should consist of a single column of numeric values corresponding to the event times . This is primarily useful for processing events which lack duration such as beats or onsets .
19,950
def load_labeled_events ( filename , delimiter = r'\s+' ) : r events , labels = load_delimited ( filename , [ float , str ] , delimiter ) events = np . array ( events ) try : util . validate_events ( events ) except ValueError as error : warnings . warn ( error . args [ 0 ] ) return events , labels
r Import labeled time - stamp events from an annotation file . The file should consist of two columns ; the first having numeric values corresponding to the event times and the second having string labels for each event . This is primarily useful for processing labeled events which lack duration such as beats with metr...
19,951
def load_time_series ( filename , delimiter = r'\s+' ) : r times , values = load_delimited ( filename , [ float , float ] , delimiter ) times = np . array ( times ) values = np . array ( values ) return times , values
r Import a time series from an annotation file . The file should consist of two columns of numeric values corresponding to the time and value of each sample of the time series .
19,952
def load_wav ( path , mono = True ) : fs , audio_data = scipy . io . wavfile . read ( path ) if audio_data . dtype == 'int8' : audio_data = audio_data / float ( 2 ** 8 ) elif audio_data . dtype == 'int16' : audio_data = audio_data / float ( 2 ** 16 ) elif audio_data . dtype == 'int32' : audio_data = audio_data / float ...
Loads a . wav file as a numpy array using scipy . io . wavfile .
19,953
def load_ragged_time_series ( filename , dtype = float , delimiter = r'\s+' , header = False ) : r times = [ ] values = [ ] splitter = re . compile ( delimiter ) if header : start_row = 1 else : start_row = 0 with _open ( filename , mode = 'r' ) as input_file : for row , line in enumerate ( input_file , start_row ) : d...
r Utility function for loading in data from a delimited time series annotation file with a variable number of columns . Assumes that column 0 contains time stamps and columns 1 through n contain values . n may be variable from time stamp to time stamp .
19,954
def pitch_class_to_semitone ( pitch_class ) : r semitone = 0 for idx , char in enumerate ( pitch_class ) : if char == '#' and idx > 0 : semitone += 1 elif char == 'b' and idx > 0 : semitone -= 1 elif idx == 0 : semitone = PITCH_CLASSES . get ( char ) else : raise InvalidChordException ( "Pitch class improperly formed: ...
r Convert a pitch class to semitone .
19,955
def scale_degree_to_semitone ( scale_degree ) : r semitone = 0 offset = 0 if scale_degree . startswith ( "#" ) : offset = scale_degree . count ( "#" ) scale_degree = scale_degree . strip ( "#" ) elif scale_degree . startswith ( 'b' ) : offset = - 1 * scale_degree . count ( "b" ) scale_degree = scale_degree . strip ( "b...
r Convert a scale degree to semitone .
19,956
def scale_degree_to_bitmap ( scale_degree , modulo = False , length = BITMAP_LENGTH ) : sign = 1 if scale_degree . startswith ( "*" ) : sign = - 1 scale_degree = scale_degree . strip ( "*" ) edit_map = [ 0 ] * length sd_idx = scale_degree_to_semitone ( scale_degree ) if sd_idx < length or modulo : edit_map [ sd_idx % l...
Create a bitmap representation of a scale degree .
19,957
def quality_to_bitmap ( quality ) : if quality not in QUALITIES : raise InvalidChordException ( "Unsupported chord quality shorthand: '%s' " "Did you mean to reduce extended chords?" % quality ) return np . array ( QUALITIES [ quality ] )
Return the bitmap for a given quality .
19,958
def validate_chord_label ( chord_label ) : pattern = re . compile ( r ) if not pattern . match ( chord_label ) : raise InvalidChordException ( 'Invalid chord label: ' '{}' . format ( chord_label ) ) pass
Test for well - formedness of a chord label .
19,959
def join ( chord_root , quality = '' , extensions = None , bass = '' ) : r chord_label = chord_root if quality or extensions : chord_label += ":%s" % quality if extensions : chord_label += "(%s)" % "," . join ( extensions ) if bass and bass != '1' : chord_label += "/%s" % bass validate_chord_label ( chord_label ) retur...
r Join the parts of a chord into a complete chord label .
19,960
def encode ( chord_label , reduce_extended_chords = False , strict_bass_intervals = False ) : if chord_label == NO_CHORD : return NO_CHORD_ENCODED if chord_label == X_CHORD : return X_CHORD_ENCODED chord_root , quality , scale_degrees , bass = split ( chord_label , reduce_extended_chords = reduce_extended_chords ) root...
Translate a chord label to numerical representations for evaluation .
19,961
def encode_many ( chord_labels , reduce_extended_chords = False ) : num_items = len ( chord_labels ) roots , basses = np . zeros ( [ 2 , num_items ] , dtype = np . int ) semitones = np . zeros ( [ num_items , 12 ] , dtype = np . int ) local_cache = dict ( ) for i , label in enumerate ( chord_labels ) : result = local_c...
Translate a set of chord labels to numerical representations for sane evaluation .
19,962
def rotate_bitmap_to_root ( bitmap , chord_root ) : bitmap = np . asarray ( bitmap ) assert bitmap . ndim == 1 , "Currently only 1D bitmaps are supported." idxs = list ( np . nonzero ( bitmap ) ) idxs [ - 1 ] = ( idxs [ - 1 ] + chord_root ) % 12 abs_bitmap = np . zeros_like ( bitmap ) abs_bitmap [ tuple ( idxs ) ] = 1 ...
Circularly shift a relative bitmap to its asbolute pitch classes .
19,963
def rotate_bitmaps_to_roots ( bitmaps , roots ) : abs_bitmaps = [ ] for bitmap , chord_root in zip ( bitmaps , roots ) : abs_bitmaps . append ( rotate_bitmap_to_root ( bitmap , chord_root ) ) return np . asarray ( abs_bitmaps )
Circularly shift a relative bitmaps to asbolute pitch classes .
19,964
def validate ( reference_labels , estimated_labels ) : N = len ( reference_labels ) M = len ( estimated_labels ) if N != M : raise ValueError ( "Chord comparison received different length lists: " "len(reference)=%d\tlen(estimates)=%d" % ( N , M ) ) for labels in [ reference_labels , estimated_labels ] : for chord_labe...
Checks that the input annotations to a comparison function look like valid chord labels .
19,965
def weighted_accuracy ( comparisons , weights ) : N = len ( comparisons ) if weights . shape [ 0 ] != N : raise ValueError ( 'weights and comparisons should be of the same' ' length. len(weights) = {} but len(comparisons)' ' = {}' . format ( weights . shape [ 0 ] , N ) ) if ( weights < 0 ) . any ( ) : raise ValueError ...
Compute the weighted accuracy of a list of chord comparisons .
19,966
def thirds ( reference_labels , estimated_labels ) : validate ( reference_labels , estimated_labels ) ref_roots , ref_semitones = encode_many ( reference_labels , False ) [ : 2 ] est_roots , est_semitones = encode_many ( estimated_labels , False ) [ : 2 ] eq_roots = ref_roots == est_roots eq_thirds = ref_semitones [ : ...
Compare chords along root & third relationships .
19,967
def thirds_inv ( reference_labels , estimated_labels ) : validate ( reference_labels , estimated_labels ) ref_roots , ref_semitones , ref_bass = encode_many ( reference_labels , False ) est_roots , est_semitones , est_bass = encode_many ( estimated_labels , False ) eq_root = ref_roots == est_roots eq_bass = ref_bass ==...
Score chords along root third & bass relationships .
19,968
def root ( reference_labels , estimated_labels ) : validate ( reference_labels , estimated_labels ) ref_roots , ref_semitones = encode_many ( reference_labels , False ) [ : 2 ] est_roots = encode_many ( estimated_labels , False ) [ 0 ] comparison_scores = ( ref_roots == est_roots ) . astype ( np . float ) comparison_sc...
Compare chords according to roots .
19,969
def mirex ( reference_labels , estimated_labels ) : validate ( reference_labels , estimated_labels ) min_intersection = 3 ref_data = encode_many ( reference_labels , False ) ref_chroma = rotate_bitmaps_to_roots ( ref_data [ 1 ] , ref_data [ 0 ] ) est_data = encode_many ( estimated_labels , False ) est_chroma = rotate_b...
Compare chords along MIREX rules .
19,970
def seg ( reference_intervals , estimated_intervals ) : return min ( underseg ( reference_intervals , estimated_intervals ) , overseg ( reference_intervals , estimated_intervals ) )
Compute the MIREX MeanSeg score .
19,971
def merge_chord_intervals ( intervals , labels ) : roots , semitones , basses = encode_many ( labels , True ) merged_ivs = [ ] prev_rt = None prev_st = None prev_ba = None for s , e , rt , st , ba in zip ( intervals [ : , 0 ] , intervals [ : , 1 ] , roots , semitones , basses ) : if rt != prev_rt or ( st != prev_st ) ....
Merge consecutive chord intervals if they represent the same chord .
19,972
def evaluate ( ref_intervals , ref_labels , est_intervals , est_labels , ** kwargs ) : est_intervals , est_labels = util . adjust_intervals ( est_intervals , est_labels , ref_intervals . min ( ) , ref_intervals . max ( ) , NO_CHORD , NO_CHORD ) merged_ref_intervals = merge_chord_intervals ( ref_intervals , ref_labels )...
Computes weighted accuracy for all comparison functions for the given reference and estimated annotations .
19,973
def _n_onset_midi ( patterns ) : return len ( [ o_m for pat in patterns for occ in pat for o_m in occ ] )
Computes the number of onset_midi objects in a pattern
19,974
def validate ( reference_patterns , estimated_patterns ) : if _n_onset_midi ( reference_patterns ) == 0 : warnings . warn ( 'Reference patterns are empty.' ) if _n_onset_midi ( estimated_patterns ) == 0 : warnings . warn ( 'Estimated patterns are empty.' ) for patterns in [ reference_patterns , estimated_patterns ] : f...
Checks that the input annotations to a metric look like valid pattern lists and throws helpful errors if not .
19,975
def _occurrence_intersection ( occ_P , occ_Q ) : set_P = set ( [ tuple ( onset_midi ) for onset_midi in occ_P ] ) set_Q = set ( [ tuple ( onset_midi ) for onset_midi in occ_Q ] ) return set_P & set_Q
Computes the intersection between two occurrences .
19,976
def _compute_score_matrix ( P , Q , similarity_metric = "cardinality_score" ) : sm = np . zeros ( ( len ( P ) , len ( Q ) ) ) for iP , occ_P in enumerate ( P ) : for iQ , occ_Q in enumerate ( Q ) : if similarity_metric == "cardinality_score" : denom = float ( np . max ( [ len ( occ_P ) , len ( occ_Q ) ] ) ) sm [ iP , i...
Computes the score matrix between the patterns P and Q .
19,977
def standard_FPR ( reference_patterns , estimated_patterns , tol = 1e-5 ) : validate ( reference_patterns , estimated_patterns ) nP = len ( reference_patterns ) nQ = len ( estimated_patterns ) k = 0 if _n_onset_midi ( reference_patterns ) == 0 or _n_onset_midi ( estimated_patterns ) == 0 : return 0. , 0. , 0. for ref_p...
Standard F1 Score Precision and Recall .
19,978
def three_layer_FPR ( reference_patterns , estimated_patterns ) : validate ( reference_patterns , estimated_patterns ) def compute_first_layer_PR ( ref_occs , est_occs ) : s = len ( _occurrence_intersection ( ref_occs , est_occs ) ) precision = s / float ( len ( ref_occs ) ) recall = s / float ( len ( est_occs ) ) retu...
Three Layer F1 Score Precision and Recall . As described by Meridith .
19,979
def first_n_three_layer_P ( reference_patterns , estimated_patterns , n = 5 ) : validate ( reference_patterns , estimated_patterns ) if _n_onset_midi ( reference_patterns ) == 0 or _n_onset_midi ( estimated_patterns ) == 0 : return 0. , 0. , 0. fn_est_patterns = estimated_patterns [ : min ( len ( estimated_patterns ) ,...
First n three - layer precision .
19,980
def first_n_target_proportion_R ( reference_patterns , estimated_patterns , n = 5 ) : validate ( reference_patterns , estimated_patterns ) if _n_onset_midi ( reference_patterns ) == 0 or _n_onset_midi ( estimated_patterns ) == 0 : return 0. , 0. , 0. fn_est_patterns = estimated_patterns [ : min ( len ( estimated_patter...
First n target proportion establishment recall metric .
19,981
def evaluate ( ref_patterns , est_patterns , ** kwargs ) : scores = collections . OrderedDict ( ) scores [ 'F' ] , scores [ 'P' ] , scores [ 'R' ] = util . filter_kwargs ( standard_FPR , ref_patterns , est_patterns , ** kwargs ) scores [ 'F_est' ] , scores [ 'P_est' ] , scores [ 'R_est' ] = util . filter_kwargs ( estab...
Load data and perform the evaluation .
19,982
def validate ( ref_intervals , ref_pitches , ref_velocities , est_intervals , est_pitches , est_velocities ) : transcription . validate ( ref_intervals , ref_pitches , est_intervals , est_pitches ) if not ref_velocities . shape [ 0 ] == ref_pitches . shape [ 0 ] : raise ValueError ( 'Reference velocities must have the ...
Checks that the input annotations have valid time intervals pitches and velocities and throws helpful errors if not .
19,983
def match_notes ( ref_intervals , ref_pitches , ref_velocities , est_intervals , est_pitches , est_velocities , onset_tolerance = 0.05 , pitch_tolerance = 50.0 , offset_ratio = 0.2 , offset_min_tolerance = 0.05 , strict = False , velocity_tolerance = 0.1 ) : matching = transcription . match_notes ( ref_intervals , ref_...
Match notes taking note velocity into consideration .
19,984
def validate ( reference_beats , estimated_beats ) : if reference_beats . size == 0 : warnings . warn ( "Reference beats are empty." ) if estimated_beats . size == 0 : warnings . warn ( "Estimated beats are empty." ) for beats in [ reference_beats , estimated_beats ] : util . validate_events ( beats , MAX_TIME )
Checks that the input annotations to a metric look like valid beat time arrays and throws helpful errors if not .
19,985
def _get_reference_beat_variations ( reference_beats ) : interpolated_indices = np . arange ( 0 , reference_beats . shape [ 0 ] - .5 , .5 ) original_indices = np . arange ( 0 , reference_beats . shape [ 0 ] ) double_reference_beats = np . interp ( interpolated_indices , original_indices , reference_beats ) return ( ref...
Return metric variations of the reference beats
19,986
def f_measure ( reference_beats , estimated_beats , f_measure_threshold = 0.07 ) : validate ( reference_beats , estimated_beats ) if estimated_beats . size == 0 or reference_beats . size == 0 : return 0. matching = util . match_events ( reference_beats , estimated_beats , f_measure_threshold ) precision = float ( len (...
Compute the F - measure of correct vs incorrectly predicted beats . Correctness is determined over a small window .
19,987
def cemgil ( reference_beats , estimated_beats , cemgil_sigma = 0.04 ) : validate ( reference_beats , estimated_beats ) if estimated_beats . size == 0 or reference_beats . size == 0 : return 0. , 0. accuracies = [ ] for reference_beats in _get_reference_beat_variations ( reference_beats ) : accuracy = 0 for beat in ref...
Cemgil s score computes a gaussian error of each estimated beat . Compares against the original beat times and all metrical variations .
19,988
def goto ( reference_beats , estimated_beats , goto_threshold = 0.35 , goto_mu = 0.2 , goto_sigma = 0.2 ) : validate ( reference_beats , estimated_beats ) if estimated_beats . size == 0 or reference_beats . size == 0 : return 0. beat_error = np . ones ( reference_beats . shape [ 0 ] ) paired = np . zeros ( reference_be...
Calculate Goto s score a binary 1 or 0 depending on some specific heuristic criteria
19,989
def p_score ( reference_beats , estimated_beats , p_score_threshold = 0.2 ) : validate ( reference_beats , estimated_beats ) if reference_beats . size == 1 : warnings . warn ( "Only one reference beat was provided, so beat intervals" " cannot be computed." ) if estimated_beats . size == 1 : warnings . warn ( "Only one ...
Get McKinney s P - score . Based on the autocorrelation of the reference and estimated beats
19,990
def information_gain ( reference_beats , estimated_beats , bins = 41 ) : validate ( reference_beats , estimated_beats ) if not bins % 2 : warnings . warn ( "bins parameter is even, " "so there will not be a bin centered at zero." ) if reference_beats . size == 1 : warnings . warn ( "Only one reference beat was provided...
Get the information gain - K - L divergence of the beat error histogram to a uniform histogram
19,991
def index_labels ( labels , case_sensitive = False ) : label_to_index = { } index_to_label = { } if not case_sensitive : labels = [ str ( s ) . lower ( ) for s in labels ] for index , s in enumerate ( sorted ( set ( labels ) ) ) : label_to_index [ s ] = index index_to_label [ index ] = s indices = [ label_to_index [ s ...
Convert a list of string identifiers into numerical indices .
19,992
def intervals_to_samples ( intervals , labels , offset = 0 , sample_size = 0.1 , fill_value = None ) : num_samples = int ( np . floor ( intervals . max ( ) / sample_size ) ) sample_indices = np . arange ( num_samples , dtype = np . float32 ) sample_times = ( sample_indices * sample_size + offset ) . tolist ( ) sampled_...
Convert an array of labeled time intervals to annotated samples .
19,993
def interpolate_intervals ( intervals , labels , time_points , fill_value = None ) : time_points = np . asarray ( time_points ) if np . any ( time_points [ 1 : ] < time_points [ : - 1 ] ) : raise ValueError ( 'time_points must be in non-decreasing order' ) aligned_labels = [ fill_value ] * len ( time_points ) starts = ...
Assign labels to a set of points in time given a set of intervals .
19,994
def sort_labeled_intervals ( intervals , labels = None ) : idx = np . argsort ( intervals [ : , 0 ] ) intervals_sorted = intervals [ idx ] if labels is None : return intervals_sorted else : return intervals_sorted , [ labels [ _ ] for _ in idx ]
Sort intervals and optionally their corresponding labels according to start time .
19,995
def f_measure ( precision , recall , beta = 1.0 ) : if precision == 0 and recall == 0 : return 0.0 return ( 1 + beta ** 2 ) * precision * recall / ( ( beta ** 2 ) * precision + recall )
Compute the f - measure from precision and recall scores .
19,996
def intervals_to_boundaries ( intervals , q = 5 ) : return np . unique ( np . ravel ( np . round ( intervals , decimals = q ) ) )
Convert interval times into boundaries .
19,997
def boundaries_to_intervals ( boundaries ) : if not np . allclose ( boundaries , np . unique ( boundaries ) ) : raise ValueError ( 'Boundary times are not unique or not ascending.' ) intervals = np . asarray ( list ( zip ( boundaries [ : - 1 ] , boundaries [ 1 : ] ) ) ) return intervals
Convert an array of event times into intervals
19,998
def merge_labeled_intervals ( x_intervals , x_labels , y_intervals , y_labels ) : r align_check = [ x_intervals [ 0 , 0 ] == y_intervals [ 0 , 0 ] , x_intervals [ - 1 , 1 ] == y_intervals [ - 1 , 1 ] ] if False in align_check : raise ValueError ( "Time intervals do not align; did you mean to call " "'adjust_intervals()...
r Merge the time intervals of two sequences .
19,999
def match_events ( ref , est , window , distance = None ) : if distance is not None : hits = np . where ( distance ( ref , est ) <= window ) else : hits = _fast_hit_windows ( ref , est , window ) G = { } for ref_i , est_i in zip ( * hits ) : if est_i not in G : G [ est_i ] = [ ] G [ est_i ] . append ( ref_i ) matching ...
Compute a maximum matching between reference and estimated event times subject to a window constraint .