diff --git a/.gitignore b/.gitignore index 2b9e607..ca4134b 100644 --- a/.gitignore +++ b/.gitignore @@ -5,3 +5,6 @@ build/ dist/ libfmp.egg-info/ + +# do not ignore build of docs +!docs/build/ diff --git a/docs/Makefile b/docs/Makefile new file mode 100644 index 0000000..d0c3cbf --- /dev/null +++ b/docs/Makefile @@ -0,0 +1,20 @@ +# Minimal makefile for Sphinx documentation +# + +# You can set these variables from the command line, and also +# from the environment for the first two. +SPHINXOPTS ?= +SPHINXBUILD ?= sphinx-build +SOURCEDIR = source +BUILDDIR = build + +# Put it first so that "make" without argument is like "make help". +help: + @$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O) + +.PHONY: help Makefile + +# Catch-all target: route all unknown targets to Sphinx using the new +# "make mode" option. $(O) is meant as a shortcut for $(SPHINXOPTS). +%: Makefile + @$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O) diff --git a/docs/build/.gitkeep b/docs/build/.gitkeep new file mode 100644 index 0000000..e69de29 diff --git a/docs/build/doctrees/environment.pickle b/docs/build/doctrees/environment.pickle new file mode 100644 index 0000000..ce2c207 Binary files /dev/null and b/docs/build/doctrees/environment.pickle differ diff --git a/docs/build/doctrees/genindex.doctree b/docs/build/doctrees/genindex.doctree new file mode 100644 index 0000000..669b358 Binary files /dev/null and b/docs/build/doctrees/genindex.doctree differ diff --git a/docs/build/doctrees/getting_started.doctree b/docs/build/doctrees/getting_started.doctree new file mode 100644 index 0000000..afb24d3 Binary files /dev/null and b/docs/build/doctrees/getting_started.doctree differ diff --git a/docs/build/doctrees/index.doctree b/docs/build/doctrees/index.doctree new file mode 100644 index 0000000..5efcd36 Binary files /dev/null and b/docs/build/doctrees/index.doctree differ diff --git a/docs/build/doctrees/index_b.doctree b/docs/build/doctrees/index_b.doctree new file mode 100644 index 0000000..080df02 Binary files /dev/null and b/docs/build/doctrees/index_b.doctree differ diff --git a/docs/build/doctrees/index_c1.doctree b/docs/build/doctrees/index_c1.doctree new file mode 100644 index 0000000..f8a61a3 Binary files /dev/null and b/docs/build/doctrees/index_c1.doctree differ diff --git a/docs/build/doctrees/index_c2.doctree b/docs/build/doctrees/index_c2.doctree new file mode 100644 index 0000000..0609885 Binary files /dev/null and b/docs/build/doctrees/index_c2.doctree differ diff --git a/docs/build/doctrees/index_c3.doctree b/docs/build/doctrees/index_c3.doctree new file mode 100644 index 0000000..e353c5a Binary files /dev/null and b/docs/build/doctrees/index_c3.doctree differ diff --git a/docs/build/doctrees/index_c4.doctree b/docs/build/doctrees/index_c4.doctree new file mode 100644 index 0000000..81dda99 Binary files /dev/null and b/docs/build/doctrees/index_c4.doctree differ diff --git a/docs/build/doctrees/index_c5.doctree b/docs/build/doctrees/index_c5.doctree new file mode 100644 index 0000000..d037981 Binary files /dev/null and b/docs/build/doctrees/index_c5.doctree differ diff --git a/docs/build/doctrees/index_c6.doctree b/docs/build/doctrees/index_c6.doctree new file mode 100644 index 0000000..d572171 Binary files /dev/null and b/docs/build/doctrees/index_c6.doctree differ diff --git a/docs/build/doctrees/index_c7.doctree b/docs/build/doctrees/index_c7.doctree new file mode 100644 index 0000000..c9a4a84 Binary files /dev/null and b/docs/build/doctrees/index_c7.doctree differ diff --git a/docs/build/doctrees/index_c8.doctree b/docs/build/doctrees/index_c8.doctree new file mode 100644 index 0000000..21d283a Binary files /dev/null and b/docs/build/doctrees/index_c8.doctree differ diff --git a/docs/build/doctrees/py-modindex.doctree b/docs/build/doctrees/py-modindex.doctree new file mode 100644 index 0000000..e94829f Binary files /dev/null and b/docs/build/doctrees/py-modindex.doctree differ diff --git a/docs/build/html/.buildinfo b/docs/build/html/.buildinfo new file mode 100644 index 0000000..e712a41 --- /dev/null +++ b/docs/build/html/.buildinfo @@ -0,0 +1,4 @@ +# Sphinx build info version 1 +# This file hashes the configuration used when building these files. When it is not found, a full rebuild will be done. +config: ae132c943bae29b527a4e49860516f8c +tags: 645f666f9bcd5a90fca523b33c5a78b7 diff --git a/docs/build/html/_modules/index.html b/docs/build/html/_modules/index.html new file mode 100644 index 0000000..0fb59d5 --- /dev/null +++ b/docs/build/html/_modules/index.html @@ -0,0 +1,266 @@ + + + + + + + + + + Overview: module code — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + + + +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/b/b_annotation.html b/docs/build/html/_modules/libfmp/b/b_annotation.html new file mode 100644 index 0000000..c0a0ced --- /dev/null +++ b/docs/build/html/_modules/libfmp/b/b_annotation.html @@ -0,0 +1,316 @@ + + + + + + + + + + libfmp.b.b_annotation — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.b.b_annotation
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.b.b_annotation

+"""
+Module: libfmp.b.b_annotation
+Author: Frank Zalkow, Meinard Mueller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+
+import numpy as np
+import pandas as pd
+import librosa
+
+import libfmp.b
+
+
+
[docs]def read_csv(fn, header=True, add_label=False): + """Reads a CSV file + + Args: + fn (str): Filename + header (bool): Boolean (Default value = True) + add_label (bool): Add column with constant value of `add_label` (Default value = False) + + Returns: + df (pd.DataFrame): Pandas DataFrame + """ + df = pd.read_csv(fn, sep=';', keep_default_na=False, header=0 if header else None) + if add_label: + assert 'label' not in df.columns, 'Label column must not exist if `add_label` is True' + df = df.assign(label=[add_label] * len(df.index)) + return df
+ + +
[docs]def write_csv(df, fn, header=True): + """Writes a CSV file + + Args: + df (pd.DataFrame): Pandas DataFrame + fn (str): Filename + header (bool): Boolean (Default value = True) + """ + df.to_csv(fn, sep=';', index=False, quoting=2, header=header)
+ + +
[docs]def cut_audio(fn_in, fn_out, start_sec, end_sec, normalize=True, write=True, Fs=22050): + """Cuts an audio file + + Args: + fn_in (str): Filename and path for input audio file + fn_out (str): Filename and path for input audio file + start_sec (float): Start time position (in seconds) of cut + end_sec (float): End time position (in seconds) of cut + normalize (bool): If True, then normalize audio (with max norm) (Default value = True) + write (bool): If True, then write audio (Default value = True) + Fs (scalar): Sampling rate of audio (Default value = 22050) + + Returns: + x_cut (np.ndarray): Cut audio + """ + x_cut, Fs = librosa.load(fn_in, sr=Fs, offset=start_sec, duration=end_sec-start_sec) + if normalize is True: + x_cut = x_cut / np.max(np.abs(x_cut)) + if write is True: + libfmp.b.write_audio(fn_out, x_cut, Fs) + return x_cut
+ + +
[docs]def cut_csv_file(fn_in, fn_out, start_sec, end_sec, write=True): + """Cuts csv annotation file + + Args: + fn_in (str): Filename and path for input audio file + fn_out (str): Filename and path for input audio file + start_sec (float): Start time position (in seconds) of cut + end_sec (float): End time position (in seconds) of cut + write (bool): If True, then write audio (Default value = True) + + Returns: + ann_cut (list): Cut annotation file + """ + df = pd.read_csv(fn_in, sep=',', keep_default_na=False, header=None) + ann_cut = [] + for i, (start, end, pitch, label) in df.iterrows(): + if (start > start_sec) and (start < end_sec): + ann_cut.append([start-start_sec, min(end, end_sec)-start, int(pitch), 100, str(int(label))]) + columns = ['Start', 'Duration', 'Pitch', 'Velocity', 'Instrument'] + df_out = pd.DataFrame(ann_cut, columns=columns) + df_out['Start'] = df_out['Start'].map('{:,.3f}'.format) + df_out['Duration'] = df_out['Duration'].map('{:,.3f}'.format) + df_out.to_csv(fn_out, sep=';', index=False) + return ann_cut
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/b/b_audio.html b/docs/build/html/_modules/libfmp/b/b_audio.html new file mode 100644 index 0000000..47f3eb1 --- /dev/null +++ b/docs/build/html/_modules/libfmp/b/b_audio.html @@ -0,0 +1,296 @@ + + + + + + + + + + libfmp.b.b_audio — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.b.b_audio
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.b.b_audio

+"""
+Module: libfmp.b.b_audio
+Author: Frank Zalkow, Meinard Mueller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+
+import librosa
+import soundfile as sf
+import IPython.display as ipd
+import pandas as pd
+
+
+
[docs]def read_audio(path, Fs=None, mono=False): + """Reads an audio file + + Args: + path (str): Path to audio file + Fs (scalar): Resample audio to given sampling rate. Use native sampling rate if None. (Default value = None) + mono (bool): Convert multi-channel file to mono. (Default value = False) + + Returns: + x (np.ndarray): Waveform signal + Fs (scalar): Sampling rate + """ + return librosa.load(path, sr=Fs, mono=mono)
+ + +
[docs]def write_audio(path, x, Fs): + """Writes an audio file + + Args: + path (str): Path to audio file + x (np.ndarray): Waveform signal + Fs (scalar): Sampling rate + """ + sf.write(path, x, Fs)
+ + +
[docs]def audio_player_list(signals, rates, width=270, height=40, columns=None, column_align='center'): + """Generates list of audio players + + Notebook: B/B_PythonAudio.ipynb + + Args: + signals (list): List of audio signals + rates (list): List of sample rates + width (int): Width of player (either number or list) (Default value = 270) + height (int): Height of player (either number or list) (Default value = 40) + columns (list): Column headings (Default value = None) + column_align (str): Left, center, right (Default value = 'center') + """ + pd.set_option('display.max_colwidth', None) + + if isinstance(width, int): + width = [width] * len(signals) + if isinstance(height, int): + height = [height] * len(signals) + + audio_list = [] + for cur_x, cur_Fs, cur_width, cur_height in zip(signals, rates, width, height): + audio_html = ipd.Audio(data=cur_x, rate=cur_Fs)._repr_html_() + audio_html = audio_html.replace('\n', '').strip() + audio_html = audio_html.replace('<audio ', f'<audio style="width: {cur_width}px; height: {cur_height}px" ') + audio_list.append([audio_html]) + + df = pd.DataFrame(audio_list, index=columns).T + table_html = df.to_html(escape=False, index=False, header=bool(columns)) + table_html = table_html.replace('<th>', f'<th style="text-align: {column_align}">') + ipd.display(ipd.HTML(table_html))
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/b/b_layout.html b/docs/build/html/_modules/libfmp/b/b_layout.html new file mode 100644 index 0000000..d048903 --- /dev/null +++ b/docs/build/html/_modules/libfmp/b/b_layout.html @@ -0,0 +1,298 @@ + + + + + + + + + + libfmp.b.b_layout — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.b.b_layout
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.b.b_layout

+"""
+Module: libfmp.b.b_layout
+Author: Frank Zalkow
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import io
+import uuid
+import base64
+from matplotlib import pyplot as plt
+from IPython.display import HTML, display
+
+
+
[docs]class FloatingBox(object): + """Inspired by https://stackoverflow.com/a/49566213/2812618 + + Floating box for matplotlib plots. The added figures are part of a floating box. + + Attributes: + html: The HTML string + """ + def __init__(self, align='middle'): + """Initializes a FloatingBox object + + Args: + align: Vertical align of elements inside floating box, usually 'top', 'middle', or 'bottom'. + Also see https://www.w3schools.com/cssref/pr_pos_vertical-align.asp + """ + self.class_name = f'floating-box-fmp-{uuid.uuid4()}' + self.html = f""" + <style> + .{self.class_name} {{ + display: inline-block; + margin: 10px; + vertical-align: {align}; + }} + </style> + """ + +
[docs] def add_fig(self, fig): + """Saves a PNG representation of a matplotlib figure + + Args: + fig: A matplotlib figure + """ + Bio = io.BytesIO() # bytes buffer for the plot + fig.canvas.print_png(Bio) # make a png of the plot in the buffer + + # encode the bytes as string using base 64 + img = base64.b64encode(Bio.getvalue()).decode() + self.html += ( + f'<div class="{self.class_name}">' + + f'<img src="data:image/png;base64,{img}\n">' + + '</div>') + + plt.close(fig)
+ +
[docs] def add_html(self, html): + """Add HTML to floating box + + Args: + html: HTML string + """ + + self.html += ( + f'<div class="{self.class_name}">' + + f'{html}' + + '</div>')
+ +
[docs] def show(self): + """Display the accumulated HTML""" + display(HTML(self.html))
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/b/b_plot.html b/docs/build/html/_modules/libfmp/b/b_plot.html new file mode 100644 index 0000000..cb7d771 --- /dev/null +++ b/docs/build/html/_modules/libfmp/b/b_plot.html @@ -0,0 +1,905 @@ + + + + + + + + + + libfmp.b.b_plot — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.b.b_plot
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.b.b_plot

+"""
+Module: libfmp.b.plot
+Author: Frank Zalkow, Meinard Mueller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+
+import numpy as np
+from matplotlib import pyplot as plt
+from matplotlib.colors import LinearSegmentedColormap
+import matplotlib.gridspec as gridspec
+import matplotlib.patches as mpatch
+
+
+FMP_COLORMAPS = {
+    'FMP_1': np.array([[1.0, 0.5, 0.0], [0.33, 0.75, 0.96], [0.0, 1.0, 0.0], [1.0, 1.0, 0.0], [0.0, 1.0, 1.0],
+                       [1.0, 0.0, 1.0],  [0.99, 0.51, 0.71], [0.53, 0.0, 0.46], [0.56, 0.93, 0.72], [0, 0, 0.9]])
+}
+
+
+
[docs]def plot_signal(x, Fs=1, T_coef=None, ax=None, figsize=(6, 2), xlabel='Time (seconds)', ylabel='', title='', dpi=72, + ylim=True, **kwargs): + """Plot a signal, e.g. a waveform or a novelty function + + Args: + x: Input signal + Fs: Sample rate (Default value = 1) + T_coef: Time coeffients. If None, will be computed, based on Fs. (Default value = None) + ax: The Axes instance to plot on. If None, will create a figure and axes. (Default value = None) + figsize: Width, height in inches (Default value = (6, 2)) + xlabel: Label for x axis (Default value = 'Time (seconds)') + ylabel: Label for y axis (Default value = '') + title: Title for plot (Default value = '') + dpi: Dots per inch (Default value = 72) + ylim: True or False (auto adjust ylim or nnot) or tuple with actual ylim (Default value = True) + **kwargs: Keyword arguments for matplotlib.pyplot.plot + + Returns: + fig: The created matplotlib figure or None if ax was given. + ax: The used axes. + line: The line plot + """ + fig = None + if ax is None: + fig = plt.figure(figsize=figsize, dpi=dpi) + ax = plt.subplot(1, 1, 1) + if T_coef is None: + T_coef = np.arange(x.shape[0]) / Fs + + if 'color' not in kwargs: + kwargs['color'] = 'gray' + + line = ax.plot(T_coef, x, **kwargs) + + ax.set_xlim([T_coef[0], T_coef[-1]]) + if ylim is True: + ylim_x = x[np.isfinite(x)] + x_min, x_max = ylim_x.min(), ylim_x.max() + if x_max == x_min: + x_max = x_max + 1 + ax.set_ylim([min(1.1 * x_min, 0.9 * x_min), max(1.1 * x_max, 0.9 * x_max)]) + elif ylim not in [True, False, None]: + ax.set_ylim(ylim) + ax.set_xlabel(xlabel) + ax.set_ylabel(ylabel) + ax.set_title(title) + if fig is not None: + plt.tight_layout() + + return fig, ax, line
+ + +
[docs]def plot_matrix(X, Fs=1, Fs_F=1, T_coef=None, F_coef=None, xlabel='Time (seconds)', ylabel='Frequency (Hz)', + xlim=None, ylim=None, clim=None, title='', dpi=72, + colorbar=True, colorbar_aspect=20.0, cbar_label='', ax=None, figsize=(6, 3), **kwargs): + """Plot a matrix, e.g. a spectrogram or a tempogram + + Args: + X: The matrix + Fs: Sample rate for axis 1 (Default value = 1) + Fs_F: Sample rate for axis 0 (Default value = 1) + T_coef: Time coeffients. If None, will be computed, based on Fs. (Default value = None) + F_coef: Frequency coeffients. If None, will be computed, based on Fs_F. (Default value = None) + xlabel: Label for x-axis (Default value = 'Time (seconds)') + ylabel: Label for y-axis (Default value = 'Frequency (Hz)') + xlim: Limits for x-axis (Default value = None) + ylim: Limits for y-axis (Default value = None) + clim: Color limits (Default value = None) + title: Title for plot (Default value = '') + dpi: Dots per inch (Default value = 72) + colorbar: Create a colorbar. (Default value = True) + colorbar_aspect: Aspect used for colorbar, in case only a single axes is used. (Default value = 20.0) + cbar_label: Label for colorbar (Default value = '') + ax: Either (1.) a list of two axes (first used for matrix, second for colorbar), or (2.) a list with a single + axes (used for matrix), or (3.) None (an axes will be created). (Default value = None) + figsize: Width, height in inches (Default value = (6, 3)) + **kwargs: Keyword arguments for matplotlib.pyplot.imshow + + Returns: + fig: The created matplotlib figure or None if ax was given. + ax: The used axes. + im: The image plot + """ + fig = None + if ax is None: + fig, ax = plt.subplots(1, 1, figsize=figsize, dpi=dpi) + ax = [ax] + if T_coef is None: + T_coef = np.arange(X.shape[1]) / Fs + if F_coef is None: + F_coef = np.arange(X.shape[0]) / Fs_F + + if 'extent' not in kwargs: + x_ext1 = (T_coef[1] - T_coef[0]) / 2 + x_ext2 = (T_coef[-1] - T_coef[-2]) / 2 + y_ext1 = (F_coef[1] - F_coef[0]) / 2 + y_ext2 = (F_coef[-1] - F_coef[-2]) / 2 + kwargs['extent'] = [T_coef[0] - x_ext1, T_coef[-1] + x_ext2, F_coef[0] - y_ext1, F_coef[-1] + y_ext2] + if 'cmap' not in kwargs: + kwargs['cmap'] = 'gray_r' + if 'aspect' not in kwargs: + kwargs['aspect'] = 'auto' + if 'origin' not in kwargs: + kwargs['origin'] = 'lower' + + im = ax[0].imshow(X, **kwargs) + + if len(ax) == 2 and colorbar: + cbar = plt.colorbar(im, cax=ax[1]) + cbar.set_label(cbar_label) + elif len(ax) == 2 and not colorbar: + ax[1].set_axis_off() + elif len(ax) == 1 and colorbar: + plt.sca(ax[0]) + cbar = plt.colorbar(im, aspect=colorbar_aspect) + cbar.set_label(cbar_label) + + ax[0].set_xlabel(xlabel) + ax[0].set_ylabel(ylabel) + ax[0].set_title(title) + if xlim is not None: + ax[0].set_xlim(xlim) + if ylim is not None: + ax[0].set_ylim(ylim) + if clim is not None: + im.set_clim(clim) + + if fig is not None: + plt.tight_layout() + + return fig, ax, im
+ + +
[docs]def plot_chromagram(*args, chroma_yticks=np.arange(12), **kwargs): + """Calls libfmp.b.plot_matrix and sets chroma labels + + See :func:`libfmp.b.b_plot.plot_matrix` for parameters and return values. + """ + if 'ylabel' not in kwargs: + kwargs['ylabel'] = 'Chroma' + fig, ax, im = plot_matrix(*args, **kwargs) + + chroma_names = 'C C# D D# E F F# G G# A A# B'.split() + ax[0].set_yticks(np.array(chroma_yticks)) + ax[0].set_yticklabels([chroma_names[i] for i in chroma_yticks]) + + return fig, ax, im
+ + +
[docs]def compressed_gray_cmap(alpha=5, N=256, reverse=False): + """Creates a logarithmically or exponentially compressed grayscale colormap + + Args: + alpha (float): The compression factor. If alpha > 0, it performs log compression (enhancing black colors). + If alpha < 0, it performs exp compression (enhancing white colors). + Raises an error if alpha = 0. (Default value = 5) + N (int): The number of rgb quantization levels (usually 256 in matplotlib) (Default value = 256) + reverse (bool): If False then "white to black", if True then "black to white" (Default value = False) + + Returns: + color_wb (mpl.colors.LinearSegmentedColormap): The colormap + """ + assert alpha != 0 + + gray_values = np.log(1 + abs(alpha) * np.linspace(0, 1, N)) + gray_values /= gray_values.max() + + if alpha > 0: + gray_values = 1 - gray_values + else: + gray_values = gray_values[::-1] + + if reverse: + gray_values = gray_values[::-1] + + gray_values_rgb = np.repeat(gray_values.reshape(N, 1), 3, axis=1) + color_wb = LinearSegmentedColormap.from_list('color_wb', gray_values_rgb, N=N) + return color_wb
+ + +
[docs]class MultiplePlotsWithColorbar(): + """Two-column layout plot, where the first column is for user-given plots and the second column + is for colorbars if the corresponding row needs a colorbar. + + Attributes: + axes: A list of axes for the first column. + cbar_axes: A list of axes for the second column. + num_plots: Number of rows, as given to init method. + """ + + def __init__(self, num_plots, figsize=(8, 4), dpi=72, cbar_ratio=0.1, height_ratios=None): + """Creates an instance of the MultiplePlotsWithColorbar class + + Args: + num_plots: Number of plots (also number of rows) + figsize: Figure size in dpi + dpi: Dots per inch + cbar_ratio: Width ratio of color bar + height_ratios: Height ratio for rows + """ + if height_ratios is None: + height_ratios = [1] * num_plots + + plt.figure(figsize=figsize, dpi=dpi) + gs = gridspec.GridSpec(num_plots, 2, width_ratios=[1, cbar_ratio], height_ratios=height_ratios) + + self.num_plots = num_plots + self.axes = [] + self.cbar_axes = [] + + for i in range(self.num_plots): + self.axes.append(plt.subplot(gs[i, 0])) + self.cbar_axes.append(plt.subplot(gs[i, 1])) + +
[docs] def make_colorbars(self): + """Creates colorbars if the corresponding row needs a colorbar, or hides the axis in other cases.""" + for i in range(self.num_plots): + ax_img = self.axes[i].get_images() + + if len(ax_img) == 0: + self.cbar_axes[i].set_axis_off() + else: + plt.colorbar(ax_img[0], cax=self.cbar_axes[i]) + + plt.tight_layout()
+ + +
[docs]def color_argument_to_dict(colors, labels_set, default='gray'): + """Creates a color dictionary + + Args: + colors: Several options: 1. string of ``FMP_COLORMAPS``, 2. string of matplotlib colormap, + 3. list or np.ndarray of matplotlib color specifications, 4. dict that assigns labels to colors + labels_set: List of all labels + default: Default color, used for labels that are in labels_set, but not in colors + + Returns: + color_dict: Dictionary that maps labels to colors + """ + + if isinstance(colors, str): + # FMP colormap + if colors in FMP_COLORMAPS: + color_dict = {l: c for l, c in zip(labels_set, FMP_COLORMAPS[colors])} + # matplotlib colormap + else: + cm = plt.get_cmap(colors) + num_labels = len(labels_set) + colors = [cm(i / (num_labels + 1)) for i in range(num_labels)] + color_dict = {l: c for l, c in zip(labels_set, colors)} + + # list/np.ndarray of colors + elif isinstance(colors, (list, np.ndarray, tuple)): + color_dict = {l: c for l, c in zip(labels_set, colors)} + + # is already a dict, nothing to do + elif isinstance(colors, dict): + color_dict = colors + + else: + raise ValueError('`colors` must be str, list, np.ndarray, or dict') + + for key in labels_set: + if key not in color_dict: + color_dict[key] = default + + return color_dict
+ + +
[docs]def check_line_annotations(annot, default_label=''): + """Checks line annotation. If label is missing, adds an default label. + + Args: + annot: A List of the form of ``[(time_position, label), ...]``, or ``[(time_position, ), ...]``, + or ``[time_position, ...]`` + default_label: The default label used if label is missing + + Returns: + annot: A List of tuples in the form of ``[(time_position, label), ...]`` + """ + if isinstance(annot[0], (list, np.ndarray, tuple)): + len_annot = len(annot[0]) + assert all(len(a) == len_annot for a in annot) + if len_annot == 1: + annot = [(a[0], default_label) for a in annot] + + else: + assert isinstance(annot[0], (int, float, complex)) or np.isscalar(annot[0]) + annot = [(a, default_label) for a in annot] + + return annot
+ + +
[docs]def check_segment_annotations(annot, default_label=''): + """Checks segment annotation. If label is missing, adds an default label. + + Args: + annot: A List of the form of ``[(start_position, end_position, label), ...]``, or + ``[(start_position, end_position), ...]`` + default_label: The default label used if label is missing + + Returns: + annot: A List of tuples in the form of ``[(start_position, end_position, label), ...]`` + """ + assert isinstance(annot[0], (list, np.ndarray, tuple)) + len_annot = len(annot[0]) + assert all(len(a) == len_annot for a in annot) + if len_annot == 2: + annot = [(a[0], a[1], default_label) for a in annot] + + return annot
+ + +
[docs]def plot_annotation_line(annot, ax=None, label_keys={}, colors='FMP_1', figsize=(6, 1), direction='horizontal', + time_min=None, time_max=None, time_axis=True, nontime_axis=False, swap_time_ticks=False, + axis_off=False, dpi=72): + """Creates a line plot for annotation data + + Args: + annot: A List of tuples in the form of ``[(time_position, label), ...]`` + ax: The Axes instance to plot on. If None, will create a figure and axes. (Default value = None) + label_keys: A dict, where the keys are the labels used in `annot`. The values are dicts, which are used as + keyword arguments for matplotlib.pyplot.axvline or matplotlib.pyplot.axhline. (Default value = {}) + colors: Several options: 1. string of ``FMP_COLORMAPS``, 2. string of matplotlib colormap, 3. list or + np.ndarray of matplotlib color specifications, 4. dict that assigns labels to colors + (Default value = 'FMP_1') + figsize: Width, height in inches (Default value = (6, 1) + direction: 'vertical' or 'horizontal' (Default value = 'horizontal') + time_min: Minimal limit for time axis. If None, will be min annotation. (Default value = None) + time_max: Maximal limit for time axis. If None, will be max from annotation. (Default value = None) + time_axis: Display time axis ticks or not (Default value = True) + nontime_axis: Display non-time axis ticks or not (Default value = False) + swap_time_ticks: For horizontal: xticks up; for vertical: yticks left (Default value = False) + axis_off: Calls ax.axis('off') (Default value = False) + dpi: Dots per inch (Default value = 72) + + Returns: + fig: The created matplotlib figure or None if ax was given. + ax: The used axes. + """ + + assert direction in ['vertical', 'horizontal'] + annot = check_line_annotations(annot) + + fig = None + if ax is None: + fig, ax = plt.subplots(1, 1, figsize=figsize, dpi=dpi) + + labels_set = sorted(set([label for pos, label in annot])) + colors = color_argument_to_dict(colors, labels_set) + + for key, value in colors.items(): + if key not in label_keys: + label_keys[key] = {} + if 'color' not in label_keys[key]: + label_keys[key]['color'] = value + + for pos, label in annot: + if direction == 'horizontal': + ax.axvline(pos, **label_keys[label]) + else: + ax.axhline(pos, **label_keys[label]) + + if time_min is None: + time_min = min(pos for pos, label in annot) + if time_max is None: + time_max = max(pos for pos, label in annot) + + if direction == 'horizontal': + ax.set_xlim([time_min, time_max]) + if not time_axis: + ax.set_xticks([]) + if not nontime_axis: + ax.set_yticks([]) + if swap_time_ticks: + ax.xaxis.tick_top() + else: + ax.set_ylim([time_min, time_max]) + if not time_axis: + ax.set_yticks([]) + if not nontime_axis: + ax.set_xticks([]) + if swap_time_ticks: + ax.yaxis.tick_right() + + if axis_off: + ax.axis('off') + + if fig is not None: + plt.tight_layout() + + return fig, ax
+ + +
[docs]def plot_annotation_line_overlay(*args, **kwargs): + """Plot segment annotations as overlay + + See :func:`libfmp.b.b_plot.plot_annotation_line` for parameters and return values. + """ + assert 'nontime_axis' not in kwargs + kwargs['nontime_axis'] = True + return plot_annotation_line(*args, **kwargs)
+ + +
[docs]def plot_annotation_multiline(annot, ax=None, label_keys={}, colors='FMP_1', figsize=(6, 1.5), direction='horizontal', + sort_labels=None, time_min=None, time_max=None, time_axis=True, swap_time_ticks=False, + axis_off=False, dpi=72): + """Creates a multi-line plot for annotation data + + Args: + annot: A List of tuples in the form of ``[(time_position, label), ...]`` + ax: The Axes instance to plot on. If None, will create a figure and axes. (Default value = None) + label_keys: A dict, where the keys are the labels used in `annot`. The values are dicts, which are used as + keyword arguments for matplotlib.pyplot.axvline or matplotlib.pyplot.axhline. (Default value = {}) + colors: Several options: 1. string of ``FMP_COLORMAPS``, 2. string of matplotlib colormap, 3. list or np.ndarray + of matplotlib color specifications, 4. dict that assigns labels to colors (Default value = 'FMP_1') + figsize: Width, height in inches (Default value = (6, 1.5) + direction: 'vertical' or 'horizontal' (Default value = 'horizontal') + sort_labels: List of labels used for sorting the line plots (Default value = None) + time_min: Minimal limit for time axis. If None, will be min annotation. (Default value = None) + time_max: Maximal limit for time axis. If None, will be max from annotation. (Default value = None) + time_axis: Display time axis ticks or not (Default value = True) + swap_time_ticks: For horizontal: xticks up; for vertical: yticks left (Default value = False) + axis_off: Calls ax.axis('off') (Default value = False) + dpi: Dots per inch (Default value = 72) + + Returns: + fig: The created matplotlib figure or None if ax was given. + ax: The used axes. + """ + + assert direction in ['vertical', 'horizontal'] + annot = check_line_annotations(annot) + + fig = None + if ax is None: + fig, ax = plt.subplots(1, 1, figsize=figsize, dpi=dpi) + + labels_set = sorted(set([label for pos, label in annot])) + colors = color_argument_to_dict(colors, labels_set) + + for key, value in colors.items(): + if key not in label_keys: + label_keys[key] = {} + if 'color' not in label_keys[key]: + label_keys[key]['color'] = value + + if sort_labels: + sort_func = lambda x: sort_labels.index(x) if x in sort_labels else 0 + else: + sort_func = None + + all_labels = sorted(set(label for pos, label in annot), key=sort_func) + + for i, cur_label in enumerate(all_labels): + cur_pos = [pos for pos, label in annot if cur_label == label] + + if direction == 'horizontal': + ax.vlines(cur_pos, i, i+1, **label_keys[cur_label]) + else: + ax.hlines(cur_pos, i, i+1, **label_keys[cur_label]) + + if time_min is None: + time_min = min(pos for pos, label in annot) + if time_max is None: + time_max = max(pos for pos, label in annot) + + if direction == 'horizontal': + ax.set_ylim([0, len(all_labels)]) + ax.set_xlim([time_min, time_max]) + for seperator in range(1, len(all_labels)): + ax.axhline(seperator, color='k') + ax.set_yticks(np.arange(len(all_labels)) + 0.5) + ax.set_yticklabels(all_labels) + if not time_axis: + ax.set_xticks([]) + if swap_time_ticks: + ax.xaxis.tick_top() + + else: + ax.set_xlim([0, len(all_labels)]) + ax.set_ylim([time_min, time_max]) + for seperator in range(1, len(all_labels)): + ax.axvline(seperator, color='k') + ax.set_xticks(np.arange(len(all_labels)) + 0.5) + ax.set_xticklabels(all_labels, rotation=90) + if not time_axis: + ax.set_yticks([]) + if swap_time_ticks: + ax.yaxis.tick_right() + + if axis_off: + ax.axis('off') + + if fig is not None: + plt.tight_layout() + + return fig, ax
+ + +
[docs]def plot_segments(annot, ax=None, figsize=(6, 1), direction='horizontal', colors='FMP_1', time_min=None, + time_max=None, nontime_min=0, nontime_max=1, time_axis=True, nontime_axis=False, time_label=None, + swap_time_ticks=False, edgecolor='k', axis_off=False, dpi=72, adjust_time_axislim=True, + adjust_nontime_axislim=True, alpha=None, print_labels=True, label_ticks=False, **kwargs): + """Creates a multi-line plot for annotation data + + Args: + annot: A List of tuples in the form of ``[(start_position, end_position, label), ...]`` + ax: The Axes instance to plot on. If None, will create a figure and axes. (Default value = None) + figsize: Width, height in inches (Default value = (6, 1) + direction: 'vertical' or 'horizontal' (Default value = 'horizontal') + colors: Several options: 1. string of ``FMP_COLORMAPS``, 2. string of matplotlib colormap, 3. list or np.ndarray + of matplotlib color specifications, 4. dict that assigns labels to colors (Default value = 'FMP_1') + time_min: Minimal limit for time axis. If None, will be min annotation. (Default value = None) + time_max: Maximal limit for time axis. If None, will be max from annotation. (Default value = None) + nontime_min: Minimal limit for non-time axis. (Default value = 0) + nontime_max: Maximal limit for non-time axis. (Default value = 1) + time_axis: Display time axis ticks or not (Default value = True) + nontime_axis: Display non-time axis ticks or not (Default value = False) + time_label: Label for time axes (Default value = None) + swap_time_ticks: For horizontal: xticks up; for vertical: yticks left (Default value = False) + edgecolor: Color for edgelines of segment box (Default value = 'k') + axis_off: Calls ax.axis('off') (Default value = False) + dpi: Dots per inch (Default value = 72) + adjust_time_axislim: Adjust time-axis. Usually True for plotting on standalone axes and False for + overlay plotting (Default value = True) + adjust_nontime_axislim: Adjust non-time-axis. Usually True for plotting on standalone axes and False for + overlay plotting (Default value = True) + alpha: Alpha value for rectangle (Default value = None) + print_labels: Print labels inside Rectangles (Default value = True) + label_ticks: Print labels as ticks (Default value = False) + **kwargs: + + Returns: + fig: The created matplotlib figure or None if ax was given. + ax: The used axes. + """ + assert direction in ['vertical', 'horizontal'] + annot = check_segment_annotations(annot) + + if 'color' not in kwargs: + kwargs['color'] = 'k' + if 'weight' not in kwargs: + kwargs['weight'] = 'bold' + # kwargs['weight'] = 'normal' + if 'fontsize' not in kwargs: + kwargs['fontsize'] = 12 + if 'ha' not in kwargs: + kwargs['ha'] = 'center' + if 'va' not in kwargs: + kwargs['va'] = 'center' + + if colors is None: + colors = 'FMP_1' + + fig = None + if ax is None: + fig, ax = plt.subplots(1, 1, figsize=figsize, dpi=dpi) + + labels_set = sorted(set([label for start, end, label in annot])) + colors = color_argument_to_dict(colors, labels_set) + + nontime_width = nontime_max - nontime_min + nontime_middle = nontime_min + nontime_width / 2 + all_time_middles = [] + + for start, end, label in annot: + time_width = end - start + time_middle = start + time_width / 2 + all_time_middles.append(time_middle) + + if direction == 'horizontal': + rect = mpatch.Rectangle((start, nontime_min), time_width, nontime_width, + facecolor=colors[label], edgecolor=edgecolor, alpha=alpha) + ax.add_patch(rect) + if print_labels: + ax.annotate(label, (time_middle, nontime_middle), **kwargs) + else: + rect = mpatch.Rectangle((nontime_min, start), nontime_width, time_width, + facecolor=colors[label], edgecolor=edgecolor, alpha=alpha) + ax.add_patch(rect) + if print_labels: + ax.annotate(label, (nontime_middle, time_middle), **kwargs) + + if time_min is None: + time_min = min(start for start, end, label in annot) + if time_max is None: + time_max = max(end for start, end, label in annot) + + if direction == 'horizontal': + if adjust_time_axislim: + ax.set_xlim([time_min, time_max]) + if adjust_nontime_axislim: + ax.set_ylim([nontime_min, nontime_max]) + if not nontime_axis: + ax.set_yticks([]) + if not time_axis: + ax.set_xticks([]) + if swap_time_ticks: + ax.xaxis.tick_top() + if time_label: + ax.set_xlabel(time_label) + if label_ticks: + ax.set_xticks(all_time_middles) + ax.set_xticklabels([label for start, end, label in annot]) + + else: + if adjust_time_axislim: + ax.set_ylim([time_min, time_max]) + if adjust_nontime_axislim: + ax.set_xlim([nontime_min, nontime_max]) + if not nontime_axis: + ax.set_xticks([]) + if not time_axis: + ax.set_yticks([]) + if swap_time_ticks: + ax.yaxis.tick_right() + if time_label: + ax.set_ylabel(time_label) + if label_ticks: + ax.set_yticks(all_time_middles) + ax.set_yticklabels([label for start, end, label in annot]) + + if axis_off: + ax.axis('off') + + if fig is not None: + plt.tight_layout() + + return fig, ax
+ + +
[docs]def plot_segments_overlay(*args, **kwargs): + """Plot segment annotations as overlay + + See :func:`libfmp.b.b_plot.plot_segments` for parameters and return values. + """ + assert 'ax' in kwargs + ax = kwargs['ax'] + + if 'adjust_time_axislim' not in kwargs: + kwargs['adjust_time_axislim'] = False + if 'adjust_nontime_axislim' not in kwargs: + kwargs['adjust_nontime_axislim'] = False + if 'alpha' not in kwargs: + kwargs['alpha'] = 0.3 + if 'edgecolor' not in kwargs: + kwargs['edgecolor'] = None + if 'nontime_axis' not in kwargs: + kwargs['nontime_axis'] = True + + if 'direction' in kwargs and kwargs['direction'] == 'vertical': + kwargs['nontime_min'], kwargs['nontime_max'] = ax.get_xlim() + else: + kwargs['nontime_min'], kwargs['nontime_max'] = ax.get_ylim() + + fig, ax = plot_segments(*args, **kwargs) + + return fig, ax
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/b/b_sonification.html b/docs/build/html/_modules/libfmp/b/b_sonification.html new file mode 100644 index 0000000..ac73988 --- /dev/null +++ b/docs/build/html/_modules/libfmp/b/b_sonification.html @@ -0,0 +1,469 @@ + + + + + + + + + + libfmp.b.b_sonification — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.b.b_sonification
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.b.b_sonification

+"""
+Module: libfmp.b.b_sonification
+Author: Meinard Mueller, Tim Zunner
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP).
+"""
+
+import numpy as np
+
+
+
[docs]def list_to_chromagram(note_list, num_frames, frame_rate): + """Create a chromagram matrix from a list of note events + + Args: + note_list (list): A list of note events (e.g. gathered from a CSV file by + :func:`libfmp.c1.c1s2_symbolic_rep.csv_to_list`) + num_frames (int): Desired number of frames for the matrix + frame_rate (float): Frame rate for C (in Hz) + + Returns: + C (np.ndarray): Chromagram matrix + """ + C = np.zeros((12, num_frames)) + for l in note_list: + start_frame = max(0, int(l[0] * frame_rate)) + end_frame = min(num_frames, int((l[0] + l[1]) * frame_rate) + 1) + C[int(l[2] % 12), start_frame:end_frame] = 1 + return C
+ + +
[docs]def generate_shepard_tone(chromaNum, Fs, N, weight=1, Fc=440, sigma=15, phase=0): + """Generates shepard tone + + Args: + chromaNum (int): 1=C,... + Fs (scalar): Sampling frequency + N (int): Desired length (in samples) + weight (float): Scaling factor [0:1] (Default value = 1) + Fc (float): Frequency for A4 (Default value = 440) + sigma (float): Parameter for envelope of Shepard tone (Default value = 15) + phase (float): Phase of sine (Default value = 0) + + Returns: + tone (np.ndarray): Shepard tone + """ + tone = np.zeros(N) + # Envelope function for Shepard tones + p = 24 + chromaNum + if(p > 32): + p = p - 12 + while p < 108: + scale_factor = 1 / (np.sqrt(2 * np.pi) * sigma) + A = scale_factor * np.exp(-(p - 60) ** 2 / (2 * sigma ** 2)) + f_axis = np.arange(N) / Fs + sine = np.sin(2 * np.pi * np.power(2, ((p - 69) / 12)) * Fc * (f_axis + phase)) + tmp = weight * A * sine + tone = tone + tmp + p = p + 12 + return tone
+ + +
[docs]def sonify_chromagram(chroma_data, N, frame_rate, Fs, fading_msec=5): + """Sonify the chroma features from a chromagram + + Args: + chroma_data (np.ndarray): A chromagram (e.g., gathered from a list of note events by + :func:`libfmp.b.b_sonification.list_to_chromagram`) + N (int): Length of the sonification (in samples) + frame_rate (float): Frame rate for P (in Hz) + Fs (float): Sampling frequency (in Hz) + fading_msec (float): The length of the fade in and fade out for sonified tones (in msec) + (Default value = 5) + + Returns: + chroma_son (np.ndarray): Sonification of the chromagram + """ + + chroma_son = np.zeros((N,)) + fade_sample = int(fading_msec / 1000 * Fs) + + for i in range(12): + if np.sum(np.abs(chroma_data[i, :])) > 0: + shepard_tone = generate_shepard_tone(i, Fs, N) + weights = np.zeros((N,)) + for j in range(chroma_data.shape[1]): + if np.abs(chroma_data[i, j]) > 0: + start = min(N, max(0, int((j - 0.5) * Fs / frame_rate))) + end = min(N, int((j + 0.5) * Fs / frame_rate)) + fade_start = min(N, max(0, start+fade_sample)) + fade_end = min(N, end+fade_sample) + + weights[fade_start:end] += chroma_data[i, j] + weights[start:fade_start] += np.linspace(0, chroma_data[i, j], fade_start-start) + weights[end:fade_end] += np.linspace(chroma_data[i, j], 0, fade_end-end) + + chroma_son += shepard_tone * weights + + chroma_son = chroma_son / np.max(np.abs(chroma_son)) + + return chroma_son
+ + +
[docs]def sonify_chromagram_with_signal(chroma_data, x, frame_rate, Fs, fading_msec=5, stereo=True): + """Sonify the chroma features from a chromagram together with a corresponding signal + + Args: + chroma_data (np.ndarray): A chromagram (e.g., gathered from a list of note events by + :func:`libfmp.b.b_sonification.list_to_chromagram`) + x (np.ndarray): Original signal + frame_rate (float): Frame rate for P (in Hz) + Fs (float): Sampling frequency (in Hz) + fading_msec (float): The length of the fade in and fade out for sonified tones (in msec) + (Default value = 5) + stereo (bool): Decision between stereo and mono sonification (Default value = True) + + Returns: + chroma_son (np.ndarray): Sonification of the chromagram + out (np.ndarray): Sonification combined with the original signal + """ + + N = x.size + + chroma_son = sonify_chromagram(chroma_data, N, frame_rate, Fs, fading_msec=fading_msec) + chroma_scaled = chroma_son * np.sqrt(np.mean(x**2)) / np.sqrt(np.mean(chroma_son**2)) + + if stereo: + out = np.vstack((x, chroma_scaled)) + else: + out = x + chroma_scaled + out = out / np.amax(np.abs(out)) + + return chroma_son, out
+ + +
[docs]def list_to_pitch_activations(note_list, num_frames, frame_rate): + """Create a pitch activation matrix from a list of note events + + Args: + note_list (list): A list of note events (e.g., gathered from a CSV file by + :func:`libfmp.c1.c1s2_symbolic_rep.csv_to_list`) + num_frames (int): Desired number of frames for the matrix + frame_rate (float): Frame rate for P (in Hz) + + Returns: + P (np.ndarray): Pitch activation matrix (first axis: Indexed by [0:127], encoding MIDI pitches [1:128]) + F_coef_MIDI (np.ndarray): MIDI pitch axis + + """ + + P = np.zeros((128, num_frames)) + F_coef_MIDI = np.arange(128) + 1 + for l in note_list: + start_frame = max(0, int(l[0] * frame_rate)) + end_frame = min(num_frames, int((l[0] + l[1]) * frame_rate) + 1) + P[int(l[2]-1), start_frame:end_frame] = 1 + return P, F_coef_MIDI
+ + +
[docs]def sonify_pitch_activations(P, N, frame_rate, Fs, min_pitch=1, Fc=440, harmonics_weights=[1], fading_msec=5): + """Sonify the pitches from a pitch activation matrix + + Args: + P (np.ndarray): A pitch activation matrix (e.g., gathered from a list of note events by + :func:`libfmp.b.b_sonification.list_to_pitch_activations`). First axis: Indexed by [0:127], + encoding MIDI pitches [1:128] + N (int): Length of the sonification (in samples) + frame_rate (float): Frame rate for P (in Hz) + Fs (float): Sampling frequency (in Hz) + min_pitch (int): Lowest MIDI pitch in P (Default value = 1) + Fc (float): Tuning frequency (in Hz) (Default value = 440) + harmonics_weights (list): A list of weights for the harmonics of the tones to be sonified + (Default value = [1]) + fading_msec (float): The length of the fade in and fade out for sonified tones (in msec) + (Default value = 5) + + Returns: + pitch_son (np.ndarray): Sonification of the pitch activation matrix + """ + + fade_sample = int(fading_msec / 1000 * Fs) + pitch_son = np.zeros((N,)) + + for p in range(P.shape[0]): + if np.sum(np.abs(P[p, :])) > 0: + pitch = min_pitch + p + freq = (2 ** ((pitch - 69) / 12)) * Fc + sin_tone = np.zeros((N,)) + for i in range(len(harmonics_weights)): + sin_tone += harmonics_weights[i] * np.sin(2 * np.pi * (i+1) * freq * np.arange(N) / Fs) + + weights = np.zeros((N,)) + for n in range(P.shape[1]): + if np.abs(P[p, n]) > 0: + start = min(N, max(0, int((n - 0.5) * Fs / frame_rate))) + end = min(N, int((n + 0.5) * Fs / frame_rate)) + fade_start = min(N, start+fade_sample) + fade_end = min(N, end+fade_sample) + + weights[fade_start:end] += P[p, n] + weights[start:fade_start] += np.linspace(0, P[p, n], fade_start-start) + weights[end:fade_end] += np.linspace(P[p, n], 0, fade_end-end) + + pitch_son += weights * sin_tone + + pitch_son = pitch_son / np.max(np.abs(pitch_son)) + return pitch_son
+ + +
[docs]def sonify_pitch_activations_with_signal(P, x, frame_rate, Fs, min_pitch=1, Fc=440, harmonics_weights=[1], + fading_msec=5, stereo=True): + """Sonify the pitches from a pitch activation matrix together with a corresponding signal + + Args: + P (np.ndarray): A pitch activation matrix (e.g., gathered from a list of note events by + :func:`libfmp.b.b_sonification.list_to_pitch_activations`) + x (np.ndarray): Original signal + frame_rate (float): Frame rate for P (in Hz) + Fs (float): Sampling frequency (in Hz) + min_pitch (int): Lowest MIDI pitch in P (Default value = 1) + Fc (float): Tuning frequency (in Hz) (Default value = 440) + harmonics_weights (list): A list of weights for the harmonics of the tones to be sonified + (Default value = [1]) + fading_msec (float): The length of the fade in and fade out for sonified tones (in msec) + (Default value = 5) + stereo (bool): Decision between stereo and mono sonification (Default value = True) + + Returns: + pitch_son (np.ndarray): Sonification of the pitch activation matrix + out (np.ndarray): Sonification combined with the original signal + """ + + N = x.size + + pitch_son = sonify_pitch_activations(P, N, frame_rate, Fs, min_pitch=min_pitch, Fc=Fc, + harmonics_weights=harmonics_weights, fading_msec=fading_msec) + pitch_scaled = pitch_son * np.sqrt(np.mean(x**2)) / np.sqrt(np.mean(pitch_son**2)) + + if stereo: + out = np.vstack((x, pitch_scaled)) + else: + out = x + pitch_scaled + + return pitch_son, out
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/b/b_test_module.html b/docs/build/html/_modules/libfmp/b/b_test_module.html new file mode 100644 index 0000000..d04ad5c --- /dev/null +++ b/docs/build/html/_modules/libfmp/b/b_test_module.html @@ -0,0 +1,254 @@ + + + + + + + + + + libfmp.b.b_test_module — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.b.b_test_module
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.b.b_test_module

+"""
+Module: libfmp.b.b_test_module
+Author: Meinard Mueller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP).
+"""
+
+string = 'This is a test function'
+a, b, c = 1, 2, 3
+
+
+
[docs]def add(a, b=0, c=0): + """Function to add three numbers + + | Notebook: B/B_libfmp.ipynb and + | Notebook: B/B_PythonBasics.ipynb + + Args: + a (float): First number + b (float): Second number (default: 0) + c (float): Third number (default: 0) + + Returns: + d (float): Sum + """ + d = a + b + c + print('Addition: ', a, ' + ', b, ' + ', c, ' = ', d) + return d
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c1/c1s1_sheet_music.html b/docs/build/html/_modules/libfmp/c1/c1s1_sheet_music.html new file mode 100644 index 0000000..ee5231d --- /dev/null +++ b/docs/build/html/_modules/libfmp/c1/c1s1_sheet_music.html @@ -0,0 +1,345 @@ + + + + + + + + + + libfmp.c1.c1s1_sheet_music — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c1.c1s1_sheet_music
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c1.c1s1_sheet_music

+"""
+Module: libfmp.c1.c1s1_sheet_music
+Author: Meinard Müller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+
+import numpy as np
+
+
+
[docs]def generate_sinusoid_pitches(pitches=[69], dur=0.5, Fs=4000, amp=1): + """Generation of sinusoids for a given list of MIDI pitches + + Notebook: C1/C1S1_MusicalNotesPitches.ipynb + + Args: + pitches (list): List of MIDI pitches (Default value = [69]) + dur (float): Duration (in seconds) of each sinusoid (Default value = 0.5) + Fs (scalar): Sampling rate (Default value = 4000) + amp (float): Amplitude of generated signal (Default value = 1) + + Returns: + x (np.ndarray): Signal + t (np.ndarray): Time axis (in seconds) + """ + N = int(dur * Fs) + t = np.arange(N) / Fs + x = [] + for p in pitches: + freq = 2 ** ((p - 69) / 12) * 440 + x = np.append(x, np.sin(2 * np.pi * freq * t)) + x = amp * x / np.max(x) + return x, t
+ + +
[docs]def generate_shepard_tone(freq=440, dur=0.5, Fs=44100, amp=1): + """Generate Shepard tone + + Notebook: C1/C1S1_ChromaShepard.ipynb + + Args: + freq (float): Frequency of Shepard tone (Default value = 440) + dur (float): Duration (in seconds) (Default value = 0.5) + Fs (scalar): Sampling rate (Default value = 44100) + amp (float): Amplitude of generated signal (Default value = 1) + + Returns: + x (np.ndarray): Shepard tone + t (np.ndarray): Time axis (in seconds) + """ + N = int(dur * Fs) + t = np.arange(N) / Fs + num_sin = 1 + x = np.sin(2 * np.pi * freq * t) + freq_lower = freq / 2 + while freq_lower > 20: + num_sin += 1 + x = x + np.sin(2 * np.pi * freq_lower * t) + freq_lower = freq_lower / 2 + freq_upper = freq * 2 + while freq_upper < 20000: + num_sin += 1 + x = x + np.sin(2 * np.pi * freq_upper * t) + freq_upper = freq_upper * 2 + x = x / num_sin + x = amp * x / np.max(x) + return x, t
+ + +
[docs]def generate_chirp_exp_octave(freq_start=440, dur=8, Fs=44100, amp=1): + """Generate one octave of a chirp with exponential frequency increase + + Notebook: C1/C1S1_ChromaShepard.ipynb + + Args: + freq_start (float): Start frequency of chirp (Default value = 440) + dur (float): Duration (in seconds) (Default value = 8) + Fs (scalar): Sampling rate (Default value = 44100) + amp (float): Amplitude of generated signal (Default value = 1) + + Returns: + x (np.ndarray): Chirp signal + t (np.ndarray): Time axis (in seconds) + """ + N = int(dur * Fs) + t = np.arange(N) / Fs + x = np.sin(2 * np.pi * freq_start * np.power(2, t / dur) / np.log(2) * dur) + x = amp * x / np.max(x) + return x, t
+ + +
[docs]def generate_shepard_glissando(num_octaves=3, dur_octave=8, Fs=44100): + """Generate several ocatves of a Shepared glissando + + Notebook: C1/C1S1_ChromaShepard.ipynb + + Args: + num_octaves (int): Number of octaves (Default value = 3) + dur_octave (int): Duration (in seconds) per octave (Default value = 8) + Fs (scalar): Sampling rate (Default value = 44100) + + Returns: + x (np.ndarray): Shepared glissando + t (np.ndarray): Time axis (in seconds) + """ + freqs_start = 10 * 2**np.arange(0, 11) + # Generate Shepard glissando by superimposing chirps that differ by octaves + for freq in freqs_start: + if freq == 10: + x, t = generate_chirp_exp_octave(freq_start=freq, dur=dur_octave, Fs=Fs, amp=1) + else: + chirp, t = generate_chirp_exp_octave(freq_start=freq, dur=dur_octave, Fs=Fs, amp=1) + x = x + chirp + x = x / len(freqs_start) + # Concatenate several octaves + x = np.tile(x, num_octaves) + N = len(x) + t = np.arange(N) / Fs + return x, t
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c1/c1s2_symbolic_rep.html b/docs/build/html/_modules/libfmp/c1/c1s2_symbolic_rep.html new file mode 100644 index 0000000..0debc45 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c1/c1s2_symbolic_rep.html @@ -0,0 +1,413 @@ + + + + + + + + + + libfmp.c1.c1s2_symbolic_rep — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c1.c1s2_symbolic_rep
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c1.c1s2_symbolic_rep

+"""
+Module: libfmp.c1.c1s2_symbolic_rep
+Author: Frank Zalkow, Meinard Müller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import pandas as pd
+from matplotlib import pyplot as plt
+from matplotlib import patches
+import pretty_midi
+import music21 as m21
+
+import libfmp.b
+
+
+
[docs]def csv_to_list(csv): + """Convert a csv score file to a list of note events + + Notebook: C1/C1S2_CSV.ipynb + + Args: + csv (str or pd.DataFrame): Either a path to a csv file or a data frame + + Returns: + score (list): A list of note events where each note is specified as + ``[start, duration, pitch, velocity, label]`` + """ + + if isinstance(csv, str): + df = libfmp.b.read_csv(csv) + elif isinstance(csv, pd.DataFrame): + df = csv + else: + raise RuntimeError('csv must be a path to a csv file or pd.DataFrame') + + score = [] + for i, (start, duration, pitch, velocity, label) in df.iterrows(): + score.append([start, duration, pitch, velocity, label]) + return score
+ + +
[docs]def midi_to_list(midi): + """Convert a midi file to a list of note events + + Notebook: C1/C1S2_MIDI.ipynb + + Args: + midi (str or pretty_midi.pretty_midi.PrettyMIDI): Either a path to a midi file or PrettyMIDI object + + Returns: + score (list): A list of note events where each note is specified as + ``[start, duration, pitch, velocity, label]`` + """ + + if isinstance(midi, str): + midi_data = pretty_midi.pretty_midi.PrettyMIDI(midi) + elif isinstance(midi, pretty_midi.pretty_midi.PrettyMIDI): + midi_data = midi + else: + raise RuntimeError('midi must be a path to a midi file or pretty_midi.PrettyMIDI') + + score = [] + + for instrument in midi_data.instruments: + for note in instrument.notes: + start = note.start + duration = note.end - start + pitch = note.pitch + velocity = note.velocity / 128. + score.append([start, duration, pitch, velocity, instrument.name]) + return score
+ + +
[docs]def xml_to_list(xml): + """Convert a music xml file to a list of note events + + Notebook: C1/C1S2_MusicXML.ipynb + + Args: + xml (str or music21.stream.Score): Either a path to a music xml file or a music21.stream.Score + + Returns: + score (list): A list of note events where each note is specified as + ``[start, duration, pitch, velocity, label]`` + """ + + if isinstance(xml, str): + xml_data = m21.converter.parse(xml) + elif isinstance(xml, m21.stream.Score): + xml_data = xml + else: + raise RuntimeError('midi must be a path to a midi file or music21.stream.Score') + + score = [] + + for part in xml_data.parts: + instrument = part.getInstrument().instrumentName + + for note in part.flat.notes: + + if note.isChord: + start = note.offset + duration = note.quarterLength + + for chord_note in note.pitches: + pitch = chord_note.ps + volume = note.volume.realized + score.append([start, duration, pitch, volume, instrument]) + + else: + start = note.offset + duration = note.quarterLength + pitch = note.pitch.ps + volume = note.volume.realized + score.append([start, duration, pitch, volume, instrument]) + + score = sorted(score, key=lambda x: (x[0], x[2])) + return score
+ + +
[docs]def list_to_csv(score, fn_out): + """Convert a list of note events to a csv file + + Args: + score (list): List of note events + fn_out (str): The path of the csv file to be created + """ + df = pd.DataFrame(score, columns=['Start', 'Duration', 'Pitch', 'Velocity', 'Instrument']) + # ideally, I would like to use float_format='%.3f', but then the numeric columns are considered as strings and, + # therefore, are quoted + df.to_csv(fn_out, sep=';', index=False, quoting=2)
+ + +
[docs]def visualize_piano_roll(score, xlabel='Time (seconds)', ylabel='Pitch', colors='FMP_1', velocity_alpha=False, + figsize=(12, 4), ax=None, dpi=72): + """Plot a pianoroll visualization + + Notebook: C1/C1S2_CSV.ipynb + + Args: + score: List of note events + xlabel: Label for x axis (Default value = 'Time (seconds)') + ylabel: Label for y axis (Default value = 'Pitch') + colors: Several options: 1. string of FMP_COLORMAPS, 2. string of matplotlib colormap, + 3. list or np.ndarray of matplotlib color specifications, + 4. dict that assigns labels to colors (Default value = 'FMP_1') + velocity_alpha: Use the velocity value for the alpha value of the corresponding rectangle + (Default value = False) + figsize: Width, height in inches (Default value = (12) + ax: The Axes instance to plot on (Default value = None) + dpi: Dots per inch (Default value = 72) + + Returns: + fig: The created matplotlib figure or None if ax was given. + ax: The used axes + """ + fig = None + if ax is None: + fig = plt.figure(figsize=figsize, dpi=dpi) + ax = plt.subplot(1, 1, 1) + + labels_set = sorted(set([note[4] for note in score])) + colors = libfmp.b.color_argument_to_dict(colors, labels_set) + + pitch_min = min(note[2] for note in score) + pitch_max = max(note[2] for note in score) + time_min = min(note[0] for note in score) + time_max = max(note[0] + note[1] for note in score) + + for start, duration, pitch, velocity, label in score: + rect = patches.Rectangle((start, pitch - 0.5), duration, 1, linewidth=1, + edgecolor='k', facecolor=colors[label], alpha=velocity) + ax.add_patch(rect) + + ax.set_ylim([pitch_min - 1.5, pitch_max + 1.5]) + ax.set_xlim([min(time_min, 0), time_max + 0.5]) + ax.set_xlabel(xlabel) + ax.set_ylabel(ylabel) + ax.grid() + ax.set_axisbelow(True) + ax.legend([patches.Patch(linewidth=1, edgecolor='k', facecolor=colors[key]) for key in labels_set], + labels_set, loc='upper right', framealpha=1) + + if fig is not None: + plt.tight_layout() + + return fig, ax
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c1/c1s3_audio_rep.html b/docs/build/html/_modules/libfmp/c1/c1s3_audio_rep.html new file mode 100644 index 0000000..f549f6d --- /dev/null +++ b/docs/build/html/_modules/libfmp/c1/c1s3_audio_rep.html @@ -0,0 +1,580 @@ + + + + + + + + + + libfmp.c1.c1s3_audio_rep — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c1.c1s3_audio_rep
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c1.c1s3_audio_rep

+"""
+Module: libfmp.c1.c1s3_audio_rep
+Author: Meinard Müller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+from matplotlib import pyplot as plt
+import librosa
+import IPython.display as ipd
+
+
+
[docs]def f_pitch(p): + """Compute center frequency for (single or array of) MIDI note numbers + + Notebook: C1/C1S3_FrequencyPitch.ipynb + + Args: + p (float or np.ndarray): MIDI note numbers + + Returns: + freq_center (float or np.ndarray): Center frequency + """ + freq_center = 2 ** ((p - 69) / 12) * 440 + return freq_center
+ + +
[docs]def difference_cents(freq_1, freq_2): + """Difference between two frequency values specified in cents + + Notebook: C1/C1S3_FrequencyPitch.ipynb + + Args: + freq_1 (float): First frequency + freq_2 (float): Second frequency + + Returns: + delta (float): Difference in cents + """ + delta = np.log2(freq_1 / freq_2) * 1200 + return delta
+ + +
[docs]def generate_sinusoid(dur=5, Fs=1000, amp=1, freq=1, phase=0): + """Generation of sinusoid + + Notebook: C1/C1S3_FrequencyPitch.ipynb + + Args: + dur (float): Duration (in seconds) (Default value = 5) + Fs (scalar): Sampling rate (Default value = 1000) + amp (float): Amplitude of sinusoid (Default value = 1) + freq (float): Frequency of sinusoid (Default value = 1) + phase (float): Phase of sinusoid (Default value = 0) + + Returns: + x (np.ndarray): Signal + t (np.ndarray): Time axis (in seconds) + + """ + num_samples = int(Fs * dur) + t = np.arange(num_samples) / Fs + x = amp * np.sin(2*np.pi*(freq*t-phase)) + return x, t
+ + +
[docs]def compute_power_db(x, Fs, win_len_sec=0.1, power_ref=10**(-12)): + """Computation of the signal power in dB + + Notebook: C1/C1S3_Dynamics.ipynb + + Args: + x (np.ndarray): Signal (waveform) to be analyzed + Fs (scalar): Sampling rate + win_len_sec (float): Length (seconds) of the window (Default value = 0.1) + power_ref (float): Reference power level (0 dB) (Default value = 10**(-12)) + + Returns: + power_db (np.ndarray): Signal power in dB + """ + win_len = round(win_len_sec * Fs) + win = np.ones(win_len) / win_len + power_db = 10 * np.log10(np.convolve(x**2, win, mode='same') / power_ref) + return power_db
+ + +
[docs]def compute_equal_loudness_contour(freq_min=30, freq_max=15000, num_points=100): + """Computation of the equal loudness contour + + Notebook: C1/C1S3_Dynamics.ipynb + + Args: + freq_min (float): Lowest frequency to be evaluated (Default value = 30) + freq_max (float): Highest frequency to be evaluated (Default value = 15000) + num_points (int): Number of evaluation points (Default value = 100) + + Returns: + equal_loudness_contour (np.ndarray): Equal loudness contour (in dB) + freq_range (np.ndarray): Evaluated frequency points + """ + freq_range = np.logspace(np.log10(freq_min), np.log10(freq_max), num=num_points) + freq = 1000 + # Function D from https://bar.wikipedia.org/wiki/Datei:Acoustic_weighting_curves.svg + h_freq = ((1037918.48 - freq**2)**2 + 1080768.16 * freq**2) / ((9837328 - freq**2)**2 + 11723776 * freq**2) + n_freq = (freq / (6.8966888496476 * 10**(-5))) * np.sqrt(h_freq / ((freq**2 + 79919.29) * (freq**2 + 1345600))) + h_freq_range = ((1037918.48 - freq_range**2)**2 + 1080768.16 * freq_range**2) / ((9837328 - freq_range**2)**2 + + 11723776 * freq_range**2) + n_freq_range = (freq_range / (6.8966888496476 * 10**(-5))) * np.sqrt(h_freq_range / ((freq_range**2 + 79919.29) * + (freq_range**2 + 1345600))) + equal_loudness_contour = 20 * np.log10(np.abs(n_freq / n_freq_range)) + return equal_loudness_contour, freq_range
+ + +
[docs]def generate_chirp_exp(dur, freq_start, freq_end, Fs=22050): + """Generation chirp with exponential frequency increase + + Notebook: C1/C1S3_Dynamics.ipynb + + Args: + dur (float): Length (seconds) of the signal + freq_start (float): Start frequency of the chirp + freq_end (float): End frequency of the chirp + Fs (scalar): Sampling rate (Default value = 22050) + + Returns: + x (np.ndarray): Generated chirp signal + t (np.ndarray): Time axis (in seconds) + freq (np.ndarray): Instant frequency (in Hz) + """ + N = int(dur * Fs) + t = np.arange(N) / Fs + freq = np.exp(np.linspace(np.log(freq_start), np.log(freq_end), N)) + phases = np.zeros(N) + for n in range(1, N): + phases[n] = phases[n-1] + 2 * np.pi * freq[n-1] / Fs + x = np.sin(phases) + return x, t, freq
+ + +
[docs]def generate_chirp_exp_equal_loudness(dur, freq_start, freq_end, Fs=22050): + """Generation chirp with exponential frequency increase and equal loudness + + Notebook: C1/C1S3_Dynamics.ipynb + + Args: + dur (float): Length (seconds) of the signal + freq_start (float): Starting frequency of the chirp + freq_end (float): End frequency of the chirp + Fs (scalar): Sampling rate (Default value = 22050) + + Returns: + x (np.ndarray): Generated chirp signal + t (np.ndarray): Time axis (in seconds) + freq (np.ndarray): Instant frequency (in Hz) + intensity (np.ndarray): Instant intensity of the signal + """ + N = int(dur * Fs) + t = np.arange(N) / Fs + intensity, freq = compute_equal_loudness_contour(freq_min=freq_start, freq_max=freq_end, num_points=N) + amp = 10**(intensity / 20) + phases = np.zeros(N) + for n in range(1, N): + phases[n] = phases[n-1] + 2 * np.pi * freq[n-1] / Fs + x = amp * np.sin(phases) + return x, t, freq, intensity
+ + +
[docs]def compute_adsr(len_A=10, len_D=10, len_S=60, len_R=10, height_A=1.0, height_S=0.5): + """Computation of idealized ADSR model + + Notebook: C1/C1S3_Timbre.ipynb + + Args: + len_A (int): Length (samples) of A phase (Default value = 10) + len_D (int): Length (samples) of D phase (Default value = 10) + len_S (int): Length (samples) of S phase (Default value = 60) + len_R (int): Length (samples) of R phase (Default value = 10) + height_A (float): Height of A phase (Default value = 1.0) + height_S (float): Height of S phase (Default value = 0.5) + + Returns: + curve_ADSR (np.ndarray): ADSR model + """ + curve_A = np.arange(len_A) * height_A / len_A + curve_D = height_A - np.arange(len_D) * (height_A - height_S) / len_D + curve_S = np.ones(len_S) * height_S + curve_R = height_S * (1 - np.arange(1, len_R + 1) / len_R) + curve_ADSR = np.concatenate((curve_A, curve_D, curve_S, curve_R)) + return curve_ADSR
+ + +
[docs]def compute_envelope(x, win_len_sec=0.01, Fs=4000): + """Computation of a signal's envelopes + + Notebook: C1/C1S3_Timbre.ipynb + + Args: + x (np.ndarray): Signal (waveform) to be analyzed + win_len_sec (float): Length (seconds) of the window (Default value = 0.01) + Fs (scalar): Sampling rate (Default value = 4000) + + Returns: + env (np.ndarray): Magnitude envelope + env_upper (np.ndarray): Upper envelope + env_lower (np.ndarray): Lower envelope + """ + win_len_half = round(win_len_sec * Fs * 0.5) + N = x.shape[0] + env = np.zeros(N) + env_upper = np.zeros(N) + env_lower = np.zeros(N) + for i in range(N): + i_start = max(0, i - win_len_half) + i_end = min(N, i + win_len_half) + env[i] = np.amax(np.abs(x)[i_start:i_end]) + env_upper[i] = np.amax(x[i_start:i_end]) + env_lower[i] = np.amin(x[i_start:i_end]) + return env, env_upper, env_lower
+ + +
[docs]def compute_plot_envelope(x, win_len_sec, Fs, figsize=(6, 3), title=''): + """Computation and subsequent plotting of a signal's envelope + + Notebook: C1/C1S3_Timbre.ipynb + + Args: + x (np.ndarray): Signal (waveform) to be analyzed + win_len_sec (float): Length (seconds) of the window + Fs (scalar): Sampling rate + figsize (tuple): Size of the figure (Default value = (6, 3)) + title (str): Title of the figure (Default value = '') + + Returns: + fig (mpl.figure.Figure): Generated figure + """ + t = np.arange(x.size)/Fs + env, env_upper, env_lower = compute_envelope(x, win_len_sec=win_len_sec, Fs=Fs) + fig = plt.figure(figsize=figsize) + plt.plot(t, x, color='gray', label='Waveform') + plt.plot(t, env_upper, linewidth=2, color='cyan', label='Upper envelope') + plt.plot(t, env_lower, linewidth=2, color='blue', label='Lower envelope') + plt.plot(t, env, linewidth=2, color='red', label='Magnitude envelope') + plt.title(title) + plt.xlabel('Time (seconds)') + plt.ylabel('Amplitude') + plt.xlim([t[0], t[-1]]) + plt.ylim([-0.7, 0.7]) + plt.legend(loc='lower right') + plt.show() + ipd.display(ipd.Audio(data=x, rate=Fs)) + return fig
+ + +
[docs]def generate_sinusoid_vibrato(dur=5, Fs=1000, amp=0.5, freq=440, vib_amp=1, vib_rate=5): + """Generation of a sinusoid signal with vibrato + + Notebook: C1/C1S3_Timbre.ipynb + + Args: + dur (float): Duration (in seconds) (Default value = 5) + Fs (scalar): Sampling rate (Default value = 1000) + amp (float): Amplitude of sinusoid (Default value = 0.5) + freq (float): Frequency (Hz) of sinusoid (Default value = 440) + vib_amp (float): Amplitude (Hz) of the frequency oscillation (Default value = 1) + vib_rate (float): Rate (Hz) of the frequency oscillation (Default value = 5) + + Returns: + x (np.ndarray): Generated signal + t (np.ndarray): Time axis (in seconds) + + """ + num_samples = int(Fs * dur) + t = np.arange(num_samples) / Fs + freq_vib = freq + vib_amp * np.sin(t * 2 * np.pi * vib_rate) + phase_vib = np.zeros(num_samples) + for i in range(1, num_samples): + phase_vib[i] = phase_vib[i-1] + 2 * np.pi * freq_vib[i-1] / Fs + x = amp * np.sin(phase_vib) + return x, t
+ + +
[docs]def generate_sinusoid_tremolo(dur=5, Fs=1000, amp=0.5, freq=440, trem_amp=0.1, trem_rate=5): + """Generation of a sinusoid signal with tremolo + + Notebook: C1/C1S3_Timbre.ipynb + + Args: + dur (float): Duration (in seconds) (Default value = 5) + Fs (scalar): Sampling rate (Default value = 1000) + amp (float): Amplitude of sinusoid (Default value = 0.5) + freq (float): Frequency (Hz) of sinusoid (Default value = 440) + trem_amp (float): Amplitude of the amplitude oscillation (Default value = 0.1) + trem_rate (float): Rate (Hz) of the amplitude oscillation (Default value = 5) + + Returns: + x (np.ndarray): Generated signal + t (np.ndarray): Time axis (in seconds) + """ + num_samples = int(Fs * dur) + t = np.arange(num_samples) / Fs + amps = amp + trem_amp * np.sin(t * 2 * np.pi * trem_rate) + x = amps * np.sin(2*np.pi*(freq*t)) + return x, t
+ + +
[docs]def generate_tone(p=60, weight_harmonic=np.ones([16, 1]), Fs=11025, dur=2): + """Generation of a tone with harmonics + + Notebook: C1/C1S3_Timbre.ipynb + + Args: + p (float): MIDI pitch of the tone (Default value = 60) + weight_harmonic (np.ndarray): Weights for the different harmonics (Default value = np.ones([16, 1]) + Fs (scalar): Sampling frequency (Default value = 11025) + dur (float): Duration (seconds) of the signal (Default value = 2) + + Returns: + x (np.ndarray): Generated signal + t (np.ndarray): Time axis (in seconds) + """ + freq = 2 ** ((p - 69) / 12) * 440 + num_samples = int(Fs * dur) + t = np.arange(num_samples) / Fs + x = np.zeros(t.shape) + for h, w in enumerate(weight_harmonic): + x = x + w * np.sin(2 * np.pi * freq * (h + 1) * t) + return x, t
+ + +
[docs]def plot_spectrogram(x, Fs=11025, N=4096, H=2048, figsize=(4, 2)): + """Computation and subsequent plotting of the spectrogram of a signal + + Notebook: C1/C1S3_Timbre.ipynb + + Args: + x: Signal (waveform) to be analyzed + Fs: Sampling rate (Default value = 11025) + N: FFT length (Default value = 4096) + H: Hopsize (Default value = 2048) + figsize: Size of the figure (Default value = (4, 2)) + + """ + N, H = 2048, 1024 + X = librosa.stft(x, n_fft=N, hop_length=H, win_length=N, window='hanning') + Y = np.abs(X) + plt.figure(figsize=figsize) + librosa.display.specshow(librosa.amplitude_to_db(Y, ref=np.max), + y_axis='linear', x_axis='time', sr=Fs, hop_length=H, cmap='gray_r') + plt.ylim([0, 3000]) + # plt.colorbar(format='%+2.0f dB') + plt.xlabel('Time (seconds)') + plt.ylabel('Frequency (Hz)') + plt.tight_layout() + plt.show()
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c2/c2_complex.html b/docs/build/html/_modules/libfmp/c2/c2_complex.html new file mode 100644 index 0000000..c1595c1 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c2/c2_complex.html @@ -0,0 +1,271 @@ + + + + + + + + + + libfmp.c2.c2_complex — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c2.c2_complex
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c2.c2_complex

+"""
+Module: libfmp.c2.c2_complex
+Author: Meinard Müller, Frank Zalkow
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+from matplotlib import pyplot as plt
+
+
+
[docs]def generate_figure(figsize=(2, 2), xlim=[0, 1], ylim=[0, 1]): + """Generate figure for plotting complex numbers + + Notebook: C2/C2_ComplexNumbers.ipynb + + Args: + figsize: Figure size (Default value = (2, 2)) + xlim: Limits of x-axis (Default value = [0, 1]) + ylim: Limits of y-axis (Default value = [0, 1]) + """ + plt.figure(figsize=figsize) + plt.grid() + plt.xlim(xlim) + plt.ylim(ylim) + plt.xlabel(r'$\mathrm{Re}$') + plt.ylabel(r'$\mathrm{Im}$')
+ + +
[docs]def plot_vector(c, color='k', start=0, linestyle='-'): + """Plot arrow corresponding to difference of two complex numbers + + Notebook: C2/C2_ComplexNumbers.ipynb + + Args: + c: Complex number + color: Color of arrow (Default value = 'k') + start: Complex number encoding the start position (Default value = 0) + linestyle: Linestyle of arrow (Default value = '-') + + Returns: + arrow (matplotlib.patches.FancyArrow): Arrow + """ + return plt.arrow(np.real(start), np.imag(start), np.real(c), np.imag(c), + linestyle=linestyle, head_width=0.05, fc=color, ec=color, overhang=0.3, + length_includes_head=True)
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c2/c2_digitization.html b/docs/build/html/_modules/libfmp/c2/c2_digitization.html new file mode 100644 index 0000000..4c8b8e2 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c2/c2_digitization.html @@ -0,0 +1,477 @@ + + + + + + + + + + libfmp.c2.c2_digitization — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c2.c2_digitization
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c2.c2_digitization

+"""
+Module: libfmp.c2.c2_digitization
+Author: Meinard Müller, Michael Krause
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+from scipy.interpolate import interp1d
+from matplotlib import pyplot as plt
+
+
+
[docs]def generate_function(Fs, dur=1): + """Generate example function + + Notebook: C2/C2S2_DigitalSignalSampling.ipynb + + Args: + Fs (scalar): Sampling rate + dur (float): Duration (in seconds) of signal to be generated (Default value = 1) + + Returns: + x (np.ndarray): Signal + t (np.ndarray): Time axis (in seconds) + """ + N = int(Fs * dur) + t = np.arange(N) / Fs + x = 1 * np.sin(2 * np.pi * (2 * t - 0)) + x += 0.5 * np.sin(2 * np.pi * (6 * t - 0.1)) + x += 0.1 * np.sin(2 * np.pi * (20 * t - 0.2)) + return x, t
+ + +
[docs]def sampling_equidistant(x_1, t_1, Fs_2, dur=None): + """Equidistant sampling of interpolated signal + + Notebook: C2/C2S2_DigitalSignalSampling.ipynb + + Args: + x_1 (np.ndarray): Signal to be interpolated and sampled + t_1 (np.ndarray): Time axis (in seconds) of x_1 + Fs_2 (scalar): Sampling rate used for equidistant sampling + dur (float): Duration (in seconds) of sampled signal (Default value = None) + + Returns: + x (np.ndarray): Sampled signal + t (np.ndarray): Time axis (in seconds) of sampled signal + """ + if dur is None: + dur = len(t_1) * t_1[1] + N = int(Fs_2 * dur) + t_2 = np.arange(N) / Fs_2 + x_2 = interp1d(t_1, x_1, kind='linear', fill_value='extrapolate')(t_2) + return x_2, t_2
+ + +
[docs]def reconstruction_sinc(x, t, t_sinc): + """Reconstruction from sampled signal using sinc-functions + + Notebook: C2/C2S2_DigitalSignalSampling.ipynb + + Args: + x (np.ndarray): Sampled signal + t (np.ndarray): Equidistant discrete time axis (in seconds) of x + t_sinc (np.ndarray): Equidistant discrete time axis (in seconds) of signal to be reconstructed + + Returns: + x_sinc (np.ndarray): Reconstructed signal having time axis t_sinc + """ + Fs = 1 / t[1] + x_sinc = np.zeros(len(t_sinc)) + for n in range(0, len(t)): + x_sinc += x[n] * np.sinc(Fs * t_sinc - n) + return x_sinc
+ + +
[docs]def quantize_uniform(x, quant_min=-1.0, quant_max=1.0, quant_level=5): + """Uniform quantization approach + + Notebook: C2/C2S2_DigitalSignalQuantization.ipynb + + Args: + x (np.ndarray): Original signal + quant_min (float): Minimum quantization level (Default value = -1.0) + quant_max (float): Maximum quantization level (Default value = 1.0) + quant_level (int): Number of quantization levels (Default value = 5) + + Returns: + x_quant (np.ndarray): Quantized signal + """ + x_normalize = (x-quant_min) * (quant_level-1) / (quant_max-quant_min) + x_normalize[x_normalize > quant_level - 1] = quant_level - 1 + x_normalize[x_normalize < 0] = 0 + x_normalize_quant = np.around(x_normalize) + x_quant = (x_normalize_quant) * (quant_max-quant_min) / (quant_level-1) + quant_min + return x_quant
+ + +
[docs]def plot_graph_quant_function(ax, quant_min=-1.0, quant_max=1.0, quant_level=256, mu=255.0, quant='uniform'): + """Helper function for plotting a graph of quantization function and quantization error + + Notebook: C2/C2S2_DigitalSignalQuantization.ipynb + + Args: + ax (mpl.axes.Axes): Axis + quant_min (float): Minimum quantization level (Default value = -1.0) + quant_max (float): Maximum quantization level (Default value = 1.0) + quant_level (int): Number of quantization levels (Default value = 256) + mu (float): Encoding parameter (Default value = 255.0) + quant (str): Type of quantization (Default value = 'uniform') + """ + x = np.linspace(quant_min, quant_max, 1000) + if quant == 'uniform': + x_quant = quantize_uniform(x, quant_min=quant_min, quant_max=quant_max, quant_level=quant_level) + quant_stepsize = (quant_max - quant_min) / (quant_level-1) + title = r'$\lambda = %d, \Delta=%0.2f$' % (quant_level, quant_stepsize) + if quant == 'nonuniform': + x_quant = quantize_nonuniform_mu(x, mu=mu, quant_level=quant_level) + title = r'$\lambda = %d, \mu=%0.1f$' % (quant_level, mu) + error = np.abs(x_quant - x) + ax.plot(x, x, color='k', label='Original amplitude') + ax.plot(x, x_quant, color='b', label='Quantized amplitude') + ax.plot(x, error, 'r--', label='Quantization error') + ax.set_title(title) + ax.set_xlabel('Amplitude') + ax.set_ylabel('Quantized amplitude/error') + ax.set_xlim([quant_min, quant_max]) + ax.set_ylim([quant_min, quant_max]) + ax.grid('on') + ax.legend()
+ + +
[docs]def plot_signal_quant(x, t, x_quant, figsize=(8, 2), xlim=None, ylim=None, title=''): + """Helper function for plotting a signal and its quantized version + + Notebook: C2/C2S2_DigitalSignalQuantization.ipynb + + Args: + x: Original Signal + t: Time + x_quant: Quantized signal + figsize: Figure size (Default value = (8, 2)) + xlim: Limits for x-axis (Default value = None) + ylim: Limits for y-axis (Default value = None) + title: Title of figure (Default value = '') + """ + plt.figure(figsize=figsize) + plt.plot(t, x, color='gray', linewidth=1.0, linestyle='-', label='Original signal') + plt.plot(t, x_quant, color='red', linewidth=2.0, linestyle='-', label='Quantized signal') + if xlim is None: + plt.xlim([0, t[-1]]) + else: + plt.xlim(xlim) + if ylim is not None: + plt.ylim(ylim) + plt.xlabel('Time (seconds)') + plt.ylabel('Amplitude') + plt.title(title) + plt.legend(loc='upper right', framealpha=1) + plt.tight_layout() + plt.show()
+ + +
[docs]def encoding_mu_law(v, mu=255.0): + """mu-law encoding + + Notebook: C2/C2S2_DigitalSignalQuantization.ipynb + + Args: + v (float): Value between -1 and 1 + mu (float): Encoding parameter (Default value = 255.0) + + Returns: + v_encode (float): Encoded value + """ + v_encode = np.sign(v) * (np.log(1.0 + mu * np.abs(v)) / np.log(1.0 + mu)) + return v_encode
+ + +
[docs]def decoding_mu_law(v, mu=255.0): + """mu-law decoding + + Notebook: C2/C2S2_DigitalSignalQuantization.ipynb + + Args: + v (float): Value between -1 and 1 + mu (float): Dencoding parameter (Default value = 255.0) + + Returns: + v_decode (float): Decoded value + """ + v_decode = np.sign(v) * (1.0 / mu) * ((1.0 + mu)**np.abs(v) - 1.0) + return v_decode
+ + +
[docs]def plot_mu_law(mu=255.0, figsize=(8.5, 4)): + """Helper function for plotting a signal and its quantized version + + Notebook: C2/C2S2_DigitalSignalQuantization.ipynb + + Args: + mu (float): Dencoding parameter (Default value = 255.0) + figsize (tuple): Figure size (Default value = (8.5, 2)) + """ + values = np.linspace(-1, 1, 1000) + values_encoded = encoding_mu_law(values, mu=mu) + values_decoded = encoding_mu_law(values, mu=mu) + + plt.figure(figsize=figsize) + ax = plt.subplot(1, 2, 1) + ax.plot(values, values, color='k', label='Original values') + ax.plot(values, values_encoded, color='b', label='Encoded values') + ax.set_title(r'$\mu$-law encoding with $\mu=%.0f$' % mu) + ax.set_xlabel('$v$') + ax.set_ylabel(r'$F_\mu(v)$') + ax.set_xlim([-1, 1]) + ax.set_ylim([-1, 1]) + ax.grid('on') + ax.legend() + + ax = plt.subplot(1, 2, 2) + ax.plot(values, values, color='k', label='Original values') + ax.plot(values, values_decoded, color='b', label='Decoded values') + ax.set_title(r'$\mu$-law decoding with $\mu=%.0f$' % mu) + ax.set_xlabel('$v$') + ax.set_ylabel(r'$F_\mu^{-1}(v)$') + ax.set_xlim([-1, 1]) + ax.set_ylim([-1, 1]) + ax.grid('on') + ax.legend() + + plt.tight_layout() + plt.show()
+ + +
[docs]def quantize_nonuniform_mu(x, mu=255.0, quant_level=256): + """Nonuniform quantization approach using mu-encoding + + Notebook: C2/C2S2_DigitalSignalQuantization.ipynb + + Args: + x (np.ndarray): Original signal + mu (float): Encoding parameter (Default value = 255.0) + quant_level (int): Number of quantization levels (Default value = 256) + + Returns: + x_quant (np.ndarray): Quantized signal + """ + x_en = encoding_mu_law(x, mu=mu) + x_en_quant = quantize_uniform(x_en, quant_min=-1, quant_max=1, quant_level=quant_level) + x_quant = decoding_mu_law(x_en_quant, mu=mu) + return x_quant
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c2/c2_fourier.html b/docs/build/html/_modules/libfmp/c2/c2_fourier.html new file mode 100644 index 0000000..e893baa --- /dev/null +++ b/docs/build/html/_modules/libfmp/c2/c2_fourier.html @@ -0,0 +1,593 @@ + + + + + + + + + + libfmp.c2.c2_fourier — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c2.c2_fourier
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c2.c2_fourier

+"""
+Module: libfmp.c2.c2_fourier
+Author: Frank Zalkow, Meinard Müller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+from numba import jit
+import librosa
+
+
+
[docs]@jit(nopython=True) +def generate_matrix_dft(N, K): + """Generates a DFT (discrete Fourier transfrom) matrix + + Notebook: C2/C2_DFT-FFT.ipynb + + Args: + N (int): Number of samples + K (int): Number of frequency bins + + Returns: + dft (np.ndarray): The DFT matrix + """ + dft = np.zeros((K, N), dtype=np.complex128) + for n in range(N): + for k in range(K): + dft[k, n] = np.exp(-2j * np.pi * k * n / N) + return dft
+ + +
[docs]@jit(nopython=True) +def generate_matrix_dft_inv(N, K): + """Generates an IDFT (inverse discrete Fourier transfrom) matrix + + Notebook: C2/C2_STFT-Inverse.ipynb + + Args: + N (int): Number of samples + K (int): Number of frequency bins + + Returns: + dft (np.ndarray): The IDFT matrix + """ + dft = np.zeros((K, N), dtype=np.complex128) + for n in range(N): + for k in range(K): + dft[k, n] = np.exp(2j * np.pi * k * n / N) / N + return dft
+ + +
[docs]@jit(nopython=True) +def dft(x): + """Compute the disrcete Fourier transfrom (DFT) + + Notebook: C2/C2_DFT-FFT.ipynb + + Args: + x (np.ndarray): Signal to be transformed + + Returns: + X (np.ndarray): Fourier transform of x + """ + x = x.astype(np.complex128) + N = len(x) + dft_mat = generate_matrix_dft(N, N)/N + return np.dot(dft_mat, x)
+ + +
[docs]@jit(nopython=True) +def idft(X): + """Compute the inverse discrete Fourier transfrom (IDFT) + + Args: + X (np.ndarray): Signal to be transformed + + Returns: + x (np.ndarray): Inverse Fourier transform of X + """ + X = X.astype(np.complex128) + N = len(X) + dft_mat = generate_matrix_dft_inv(N, N) + return np.dot(dft_mat, X)
+ + +
[docs]@jit(nopython=True) +def twiddle(N): + """Generate the twiddle factors used in the computation of the fast Fourier transform (FFT) + + Notebook: C2/C2_DFT-FFT.ipynb + + Args: + N (int): Number of samples + + Returns: + sigma (np.ndarray): The twiddle factors + """ + k = np.arange(N // 2) + sigma = np.exp(-2j * np.pi * k / N) + return sigma
+ + +
[docs]@jit(nopython=True) +def twiddle_inv(N): + """Generate the twiddle factors used in the computation of the Inverse fast Fourier transform (IFFT) + + Args: + N (int): Number of samples + + Returns: + sigma (np.ndarray): The twiddle factors + """ + n = np.arange(N // 2) + sigma = np.exp(2j * np.pi * n / N) + return sigma
+ + +
[docs]@jit(nopython=True) +def fft(x): + """Compute the fast Fourier transform (FFT) + + Notebook: C2/C2_DFT-FFT.ipynb + + Args: + x (np.ndarray): Signal to be transformed + + Returns: + X (np.ndarray): Fourier transform of x + """ + x = x.astype(np.complex128) + N = len(x) + log2N = np.log2(N) + assert log2N == int(log2N), 'N must be a power of two!' + X = np.zeros(N, dtype=np.complex128) + + if N == 1: + return x + else: + this_range = np.arange(N) + A = fft(x[this_range % 2 == 0]) + B = fft(x[this_range % 2 == 1]) + C = twiddle(N) * B + X[:N//2] = A + C + X[N//2:] = A - C + return X
+ + +
[docs]@jit(nopython=True) +def ifft_noscale(X): + """Compute the inverse fast Fourier transform (IFFT) without the final scaling factor of 1/N + + Args: + X (np.ndarray): Fourier transform of x + + Returns: + x (np.ndarray): Inverse Fourier transform of X + """ + X = X.astype(np.complex128) + N = len(X) + log2N = np.log2(N) + assert log2N == int(log2N), 'N must be a power of two!' + x = np.zeros(N, dtype=np.complex128) + + if N == 1: + return X + else: + this_range = np.arange(N) + A = ifft_noscale(X[this_range % 2 == 0]) + B = ifft_noscale(X[this_range % 2 == 1]) + C = twiddle_inv(N) * B + x[:N//2] = A + C + x[N//2:] = A - C + return x
+ + +
[docs]@jit(nopython=True) +def ifft(X): + """Compute the inverse fast Fourier transform (IFFT) + + Args: + X (np.ndarray): Fourier transform of x + + Returns: + x (np.ndarray): Inverse Fourier transform of X + """ + return ifft_noscale(X) / len(X)
+ + +
[docs]def stft_basic(x, w, H=8, only_positive_frequencies=False): + """Compute a basic version of the discrete short-time Fourier transform (STFT) + + Notebook: C2/C2_STFT-Basic.ipynb + + Args: + x (np.ndarray): Signal to be transformed + w (np.ndarray): Window function + H (int): Hopsize (Default value = 8) + only_positive_frequencies (bool): Return only positive frequency part of spectrum (non-invertible) + (Default value = False) + + Returns: + X (np.ndarray): The discrete short-time Fourier transform + """ + N = len(w) + L = len(x) + M = np.floor((L - N) / H).astype(int) + 1 + X = np.zeros((N, M), dtype='complex') + for m in range(M): + x_win = x[m * H:m * H + N] * w + X_win = np.fft.fft(x_win) + X[:, m] = X_win + + if only_positive_frequencies: + K = 1 + N // 2 + X = X[0:K, :] + return X
+ + +
[docs]def istft_basic(X, w, H, L): + """Compute the inverse of the basic discrete short-time Fourier transform (ISTFT) + + Notebook: C2/C2_STFT-Inverse.ipynb + + Args: + X (np.ndarray): The discrete short-time Fourier transform + w (np.ndarray): Window function + H (int): Hopsize + L (int): Length of time signal + + Returns: + x (np.ndarray): Time signal + """ + N = len(w) + M = X.shape[1] + x_win_sum = np.zeros(L) + w_sum = np.zeros(L) + for m in range(M): + x_win = np.fft.ifft(X[:, m]) + # Avoid imaginary values (due to floating point arithmetic) + x_win = np.real(x_win) + x_win_sum[m * H:m * H + N] = x_win_sum[m * H:m * H + N] + x_win + w_shifted = np.zeros(L) + w_shifted[m * H:m * H + N] = w + w_sum = w_sum + w_shifted + # Avoid division by zero + w_sum[w_sum == 0] = np.finfo(np.float32).eps + x_rec = x_win_sum / w_sum + return x_rec, x_win_sum, w_sum
+ + +
[docs]@jit(nopython=True) +def stft(x, w, H=512, zero_padding=0, only_positive_frequencies=False): + """Compute the discrete short-time Fourier transform (STFT) + + Args: + x (np.ndarray): Signal to be transformed + w (np.ndarray): Window function + H (int): Hopsize (Default value = 512) + zero_padding (bool): Number of zeros to be padded after windowing and before the Fourier transform of a frame + (Note: The purpose of this step is to increase the frequency sampling.) (Default value = 0) + only_positive_frequencies (bool): Return only positive frequency part of spectrum (non-invertible) + (Default value = False) + + Returns: + X (np.ndarray): The discrete short-time Fourier transform + """ + + N = len(w) + x = np.concatenate((np.zeros(N // 2), x, np.zeros(N // 2))) + + L = len(x) + M = int(np.floor((L - N) / H)) + 1 + + X = np.zeros((N + zero_padding, M), dtype=np.complex128) + zero_padding_vector = np.zeros((zero_padding, ), dtype=x.dtype) + + for m in range(M): + x_win = x[m * H:m * H + N] * w + if zero_padding > 0: + x_win = np.concatenate((x_win, zero_padding_vector)) + X_win = fft(x_win) + # Note: X_win = np.fft.fft(x_win) does not work in combination with @jit + X[:, m] = X_win + + if only_positive_frequencies: + K = 1 + (N + zero_padding) // 2 + X = X[0:K, :] + return X
+ + +
[docs]@jit(nopython=True) +def istft(X, w, H, L, zero_padding=0): + """Compute the inverse discrete short-time Fourier transform (ISTFT) + + Args: + X (np.ndarray): The discrete short-time Fourier transform + w (np.ndarray): Window function + H (int): Hopsize + L (int): Length of time signal + zero_padding (bool): Number of zeros to be padded after windowing and before the Fourier transform of a frame + (Default value = 0) + + Returns: + x (np.ndarray): Reconstructed time signal + """ + N = len(w) + L = L + N + M = X.shape[1] + w_sum = np.zeros(L) + x_win_sum = np.zeros(L) + w_sum = np.zeros(L) + for m in range(M): + start_idx, end_idx = m * H, m * H + N + zero_padding + if start_idx > L: + break + + x_win = ifft(X[:, m]) + # Note: x_win = np.fft.ifft(X[:, m]) does not work in combination with @jit + if end_idx > L: + end_idx = L + x_win = x_win[:end_idx-start_idx] + cur_w = w[:end_idx-start_idx] + else: + cur_w = w + + # Avoid imaginary values (due to floating point arithmetic) + x_win_real = np.real(x_win) + x_win_sum[start_idx:end_idx] = x_win_sum[start_idx:end_idx] + x_win_real + w_shifted = np.zeros(L) + w_shifted[start_idx:start_idx + len(cur_w)] = cur_w + w_sum = w_sum + w_shifted + # Avoid division by zero + w_sum[w_sum == 0] = np.finfo(np.float32).eps + x_rec = x_win_sum / w_sum + x_rec = x_rec[N // 2:-N // 2] + return x_rec
+ + +
[docs]def stft_convention_fmp(x, Fs, N, H, pad_mode='constant', center=True, mag=False, gamma=0): + """Compute the discrete short-time Fourier transform (STFT) + + Notebook: C2/C2_STFT-FreqGridInterpol.ipynb + + Args: + x (np.ndarray): Signal to be transformed + Fs (scalar): Sampling rate + N (int): Window size + H (int): Hopsize + pad_mode (str): Padding strategy is used in librosa (Default value = 'constant') + center (bool): Centric view as used in librosa (Default value = True) + mag (bool): Computes magnitude STFT if mag==True (Default value = False) + gamma (float): Constant for logarithmic compression (only applied when mag==True) (Default value = 0) + + Returns: + X (np.ndarray): Discrete (magnitude) short-time Fourier transform + """ + X = librosa.stft(x, n_fft=N, hop_length=H, win_length=N, + window='hann', pad_mode=pad_mode, center=center) + if mag: + X = np.abs(X)**2 + if gamma > 0: + X = np.log(1 + gamma * X) + F_coef = librosa.fft_frequencies(sr=Fs, n_fft=N) + T_coef = librosa.frames_to_time(np.arange(X.shape[1]), sr=Fs, hop_length=H) + # T_coef = np.arange(X.shape[1]) * H/Fs + # F_coef = np.arange(N//2+1) * Fs/N + return X, T_coef, F_coef
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c2/c2_interference.html b/docs/build/html/_modules/libfmp/c2/c2_interference.html new file mode 100644 index 0000000..106f045 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c2/c2_interference.html @@ -0,0 +1,291 @@ + + + + + + + + + + libfmp.c2.c2_interference — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c2.c2_interference
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c2.c2_interference

+"""
+Module: libfmp.c2.c2_interference
+Author: Meinard Müller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+from matplotlib import pyplot as plt
+
+
+
[docs]def plot_interference(x1, x2, t, figsize=(8, 2), xlim=None, ylim=None, title=''): + """Helper function for plotting two signals and its superposition + + Notebook: C2/C2S3_InterferenceBeating.ipynb + + Args: + x1: Signal 1 + x2: Signal 2 + t: Time + figsize: figure size (Default value = (8, 2)) + xlim: x limits (Default value = None) + ylim: y limits (Default value = None) + title: figure title (Default value = '') + """ + plt.figure(figsize=(8, 2)) + plt.plot(t, x1, color='gray', linewidth=1.0, linestyle='-', label='x1') + plt.plot(t, x2, color='cyan', linewidth=1.0, linestyle='-', label='x2') + plt.plot(t, x1+x2, color='red', linewidth=2.0, linestyle='-', label='x1+x2') + if xlim is None: + plt.xlim([0, t[-1]]) + else: + plt.xlim(xlim) + if ylim is not None: + plt.ylim(ylim) + plt.xlabel('Time (seconds)') + plt.ylabel('Amplitude') + plt.title(title) + plt.legend(loc='upper right') + plt.tight_layout() + plt.show()
+ + +
[docs]def generate_chirp_linear(dur, freq_start, freq_end, amp=1.0, Fs=22050): + """Generation chirp with linear frequency increase + + Notebook: C2/C2S3_InterferenceBeating.ipynb + + Args: + dur (float): Duration (seconds) of the signal + freq_start (float): Start frequency of the chirp + freq_end (float): End frequency of the chirp + amp (float): Amplitude of chirp (Default value = 1.0) + Fs (scalar): Sampling rate (Default value = 22050) + + Returns: + x (np.ndarray): Generated chirp signal + t (np.ndarray): Time axis (in seconds) + freq (np.ndarray): Instant frequency (in Hz) + """ + N = int(dur * Fs) + t = np.arange(N) / Fs + a = (freq_end - freq_start) / dur + freq = a * t + freq_start + x = amp * np.sin(np.pi * a * t ** 2 + 2 * np.pi * freq_start * t) + return x, t, freq
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c2/c2_interpolation.html b/docs/build/html/_modules/libfmp/c2/c2_interpolation.html new file mode 100644 index 0000000..a1f95e9 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c2/c2_interpolation.html @@ -0,0 +1,291 @@ + + + + + + + + + + libfmp.c2.c2_interpolation — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c2.c2_interpolation
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c2.c2_interpolation

+"""
+Module: libfmp.c2.C2_interpolation
+Author: Meinard Müller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+from scipy.interpolate import interp1d
+
+
+
[docs]def compute_f_coef_linear(N, Fs, rho=1): + """Refines the frequency vector by factor of rho + + Notebook: C2/C2_STFT-FreqGridInterpol.ipynb + + Args: + N (int): Window size + Fs (scalar): Sampling rate + rho (int): Factor for refinement (Default value = 1) + + Returns: + F_coef_new (np.ndarray): Refined frequency vector + """ + L = rho * N + F_coef_new = np.arange(0, L//2+1) * Fs / L + return F_coef_new
+ + +
[docs]def compute_f_coef_log(R, F_min, F_max): + """Adapts the frequency vector in a logarithmic fashion + + Notebook: C2/C2_STFT-FreqGridInterpol.ipynb + + Args: + R (scalar): Resolution (cents) + F_min (float): Minimum frequency + F_max (float): Maximum frequency (not included) + + Returns: + F_coef_log (np.ndarray): Refined frequency vector with values given in Hz) + F_coef_cents (np.ndarray): Refined frequency vector with values given in cents. + Note: F_min serves as reference (0 cents) + """ + n_bins = np.ceil(1200 * np.log2(F_max / F_min) / R).astype(int) + F_coef_log = 2 ** (np.arange(0, n_bins) * R / 1200) * F_min + F_coef_cents = 1200 * np.log2(F_coef_log / F_min) + return F_coef_log, F_coef_cents
+ + +
[docs]def interpolate_freq_stft(Y, F_coef, F_coef_new): + """Interpolation of STFT along frequency axis + + Notebook: C2/C2_STFT-FreqGridInterpol.ipynb + + Args: + Y (np.ndarray): Magnitude STFT + F_coef (np.ndarray): Vector of frequency values + F_coef_new (np.ndarray): Vector of new frequency values + + Returns: + Y_interpol (np.ndarray): Interploated magnitude STFT + """ + compute_Y_interpol = interp1d(F_coef, Y, kind='cubic', axis=0) + Y_interpol = compute_Y_interpol(F_coef_new) + return Y_interpol
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c3/c3s1_audio_feature.html b/docs/build/html/_modules/libfmp/c3/c3s1_audio_feature.html new file mode 100644 index 0000000..852e240 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c3/c3s1_audio_feature.html @@ -0,0 +1,335 @@ + + + + + + + + + + libfmp.c3.c3s1_audio_feature — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c3.c3s1_audio_feature
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c3.c3s1_audio_feature

+"""
+Module: libfmp.c3.c3s1_audio_feature
+Author: Frank Zalkow, Meinard Müller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+from numba import jit
+
+
+
[docs]@jit(nopython=True) +def f_pitch(p, pitch_ref=69, freq_ref=440.0): + """Computes the center frequency/ies of a MIDI pitch + + Notebook: C3/C3S1_SpecLogFreq-Chromagram.ipynb + + Args: + p (float): MIDI pitch value(s) + pitch_ref (float): Reference pitch (default: 69) + freq_ref (float): Frequency of reference pitch (default: 440.0) + + Returns: + freqs (float): Frequency value(s) + """ + return 2 ** ((p - pitch_ref) / 12) * freq_ref
+ + +
[docs]@jit(nopython=True) +def pool_pitch(p, Fs, N, pitch_ref=69, freq_ref=440.0): + """Computes the set of frequency indices that are assigned to a given pitch + + Notebook: C3/C3S1_SpecLogFreq-Chromagram.ipynb + + Args: + p (float): MIDI pitch value + Fs (scalar): Sampling rate + N (int): Window size of Fourier fransform + pitch_ref (float): Reference pitch (default: 69) + freq_ref (float): Frequency of reference pitch (default: 440.0) + + Returns: + k (np.ndarray): Set of frequency indices + """ + lower = f_pitch(p - 0.5, pitch_ref, freq_ref) + upper = f_pitch(p + 0.5, pitch_ref, freq_ref) + k = np.arange(N // 2 + 1) + k_freq = k * Fs / N # F_coef(k, Fs, N) + mask = np.logical_and(lower <= k_freq, k_freq < upper) + return k[mask]
+ + +
[docs]@jit(nopython=True) +def compute_spec_log_freq(Y, Fs, N): + """Computes a log-frequency spectrogram + + Notebook: C3/C3S1_SpecLogFreq-Chromagram.ipynb + + Args: + Y (np.ndarray): Magnitude or power spectrogram + Fs (scalar): Sampling rate + N (int): Window size of Fourier fransform + + Returns: + Y_LF (np.ndarray): Log-frequency spectrogram + F_coef_pitch (np.ndarray): Pitch values + """ + Y_LF = np.zeros((128, Y.shape[1])) + for p in range(128): + k = pool_pitch(p, Fs, N) + Y_LF[p, :] = Y[k, :].sum(axis=0) + F_coef_pitch = np.arange(128) + return Y_LF, F_coef_pitch
+ + +
[docs]@jit(nopython=True) +def compute_chromagram(Y_LF): + """Computes a chromagram + + Notebook: C3/C3S1_SpecLogFreq-Chromagram.ipynb + + Args: + Y_LF (np.ndarray): Log-frequency spectrogram + + Returns: + C (np.ndarray): Chromagram + """ + C = np.zeros((12, Y_LF.shape[1])) + p = np.arange(128) + for c in range(12): + mask = (p % 12) == c + C[c, :] = Y_LF[mask, :].sum(axis=0) + return C
+ + +
[docs]def note_name(p): + """Returns note name of pitch + + Notebook: C3/C3S1_SpecLogFreq-Chromagram.ipynb + + Args: + p (int): Pitch value + + Returns: + name (str): Note name + """ + chroma = ['A', 'A$^\\sharp$', 'B', 'C', 'C$^\\sharp$', 'D', 'D$^\\sharp$', 'E', 'F', 'F$^\\sharp$', 'G', + 'G$^\\sharp$'] + name = chroma[(p - 69) % 12] + str(p // 12 - 1) + return name
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c3/c3s1_post_processing.html b/docs/build/html/_modules/libfmp/c3/c3s1_post_processing.html new file mode 100644 index 0000000..2911b61 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c3/c3s1_post_processing.html @@ -0,0 +1,364 @@ + + + + + + + + + + libfmp.c3.c3s1_post_processing — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c3.c3s1_post_processing
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c3.c3s1_post_processing

+"""
+Module: libfmp.c3.c3s1_post_processing
+Author: Meinard Müller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+
+import numpy as np
+from scipy import signal
+from numba import jit
+
+
+
[docs]@jit(nopython=True) +def log_compression(v, gamma=1.0): + """Logarithmically compresses a value or array + + Notebook: C3/C3S1_LogCompression.ipynb + + Args: + v (float or np.ndarray): Value or array + gamma (float): Compression factor (Default value = 1.0) + + Returns: + v_compressed (float or np.ndarray): Compressed value or array + """ + return np.log(1 + gamma * v)
+ + +
[docs]@jit(nopython=True) +def normalize_feature_sequence(X, norm='2', threshold=0.0001, v=None): + """Normalizes the columns of a feature sequence + + Notebook: C3/C3S1_FeatureNormalization.ipynb + + Args: + X (np.ndarray): Feature sequence + norm (str): The norm to be applied. '1', '2', 'max' or 'z' (Default value = '2') + threshold (float): An threshold below which the vector ``v`` used instead of normalization + (Default value = 0.0001) + v (float): Used instead of normalization below ``threshold``. If None, uses unit vector for given norm + (Default value = None) + + Returns: + X_norm (np.ndarray): Normalized feature sequence + """ + assert norm in ['1', '2', 'max', 'z'] + + K, N = X.shape + X_norm = np.zeros((K, N)) + + if norm == '1': + if v is None: + v = np.ones(K, dtype=np.float64) / K + for n in range(N): + s = np.sum(np.abs(X[:, n])) + if s > threshold: + X_norm[:, n] = X[:, n] / s + else: + X_norm[:, n] = v + + if norm == '2': + if v is None: + v = np.ones(K, dtype=np.float64) / np.sqrt(K) + for n in range(N): + s = np.sqrt(np.sum(X[:, n] ** 2)) + if s > threshold: + X_norm[:, n] = X[:, n] / s + else: + X_norm[:, n] = v + + if norm == 'max': + if v is None: + v = np.ones(K, dtype=np.float64) + for n in range(N): + s = np.max(np.abs(X[:, n])) + if s > threshold: + X_norm[:, n] = X[:, n] / s + else: + X_norm[:, n] = v + + if norm == 'z': + if v is None: + v = np.zeros(K, dtype=np.float64) + for n in range(N): + mu = np.sum(X[:, n]) / K + sigma = np.sqrt(np.sum((X[:, n] - mu) ** 2) / (K - 1)) + if sigma > threshold: + X_norm[:, n] = (X[:, n] - mu) / sigma + else: + X_norm[:, n] = v + + return X_norm
+ + +
[docs]def smooth_downsample_feature_sequence(X, Fs, filt_len=41, down_sampling=10, w_type='boxcar'): + """Smoothes and downsamples a feature sequence. Smoothing is achieved by convolution with a filter kernel + + Notebook: C3/C3S1_FeatureSmoothing.ipynb + + Args: + X (np.ndarray): Feature sequence + Fs (scalar): Frame rate of ``X`` + filt_len (int): Length of smoothing filter (Default value = 41) + down_sampling (int): Downsampling factor (Default value = 10) + w_type (str): Window type of smoothing filter (Default value = 'boxcar') + + Returns: + X_smooth (np.ndarray): Smoothed and downsampled feature sequence + Fs_feature (scalar): Frame rate of ``X_smooth`` + """ + filt_kernel = np.expand_dims(signal.get_window(w_type, filt_len), axis=0) + X_smooth = signal.convolve(X, filt_kernel, mode='same') / filt_len + X_smooth = X_smooth[:, ::down_sampling] + Fs_feature = Fs / down_sampling + return X_smooth, Fs_feature
+ + +
[docs]def median_downsample_feature_sequence(X, Fs, filt_len=41, down_sampling=10): + """Smoothes and downsamples a feature sequence. Smoothing is achieved by median filtering + + Notebook: C3/C3S1_FeatureSmoothing.ipynb + + Args: + X (np.ndarray): Feature sequence + Fs (scalar): Frame rate of ``X`` + filt_len (int): Length of smoothing filter (Default value = 41) + down_sampling (int): Downsampling factor (Default value = 10) + + Returns: + X_smooth (np.ndarray): Smoothed and downsampled feature sequence + Fs_feature (scalar): Frame rate of ``X_smooth`` + """ + assert filt_len % 2 == 1 # L needs to be odd + filt_len = [1, filt_len] + X_smooth = signal.medfilt2d(X, filt_len) + X_smooth = X_smooth[:, ::down_sampling] + Fs_feature = Fs / down_sampling + return X_smooth, Fs_feature
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c3/c3s1_transposition_tuning.html b/docs/build/html/_modules/libfmp/c3/c3s1_transposition_tuning.html new file mode 100644 index 0000000..a2aa842 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c3/c3s1_transposition_tuning.html @@ -0,0 +1,434 @@ + + + + + + + + + + libfmp.c3.c3s1_transposition_tuning — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c3.c3s1_transposition_tuning
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c3.c3s1_transposition_tuning

+"""
+Module: libfmp.c3.c3s1_transposition_tuning
+Author: Meinard Müller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+from matplotlib import pyplot as plt
+from scipy.interpolate import interp1d
+from scipy import signal
+import libfmp.b
+
+
+
[docs]def cyclic_shift(C, shift=1): + """Cyclically shift a chromagram + + Notebook: C3/C3S1_TranspositionTuning.ipynb + + Args: + C (np.ndarray): Chromagram + shift (int): Tranposition shift (Default value = 1) + + Returns: + C_shift (np.ndarray): Cyclically shifted chromagram + """ + C_shift = np.roll(C, shift=shift, axis=0) + return C_shift
+ + +
[docs]def compute_freq_distribution(x, Fs, N=16384, gamma=100.0, local=True, filt=True, filt_len=101): + """Compute an overall frequency distribution + + Notebook: C3/C3S1_TranspositionTuning.ipynb + + Args: + x (np.ndarray): Signal + Fs (scalar): Sampling rate + N (int): Window size (Default value = 16384) + gamma (float): Constant for logarithmic compression (Default value = 100.0) + local (bool): Computes STFT and averages; otherwise computes global DFT (Default value = True) + filt (bool): Applies local frequency averaging and by rectification (Default value = True) + filt_len (int): Filter length for local frequency averaging (length given in cents) (Default value = 101) + + Returns: + v (np.ndarray): Vector representing an overall frequency distribution + F_coef_cents (np.ndarray): Frequency axis (given in cents) + """ + if local: + # Compute an STFT and sum over time + if N > len(x)//2: + raise Exception('The signal length (%d) should be twice as long as the window length (%d)' % (len(x), N)) + Y, T_coef, F_coef = libfmp.c2.stft_convention_fmp(x=x, Fs=Fs, N=N, H=N//2, mag=True, gamma=gamma) + # Error "range() arg 3 must not be zero" occurs when N is too large. Why? + Y = np.sum(Y, axis=1) + else: + # Compute a single DFT for the entire signal + N = len(x) + Y = np.abs(np.fft.fft(x)) / Fs + Y = Y[:N//2+1] + Y = np.log(1 + gamma * Y) + # Y = libfmp.c3.log_compression(Y, gamma=100) + F_coef = np.arange(N // 2 + 1).astype(float) * Fs / N + + # Convert linearly spaced frequency axis in logarithmic axis (given in cents) + # The minimum frequency F_min corresponds 0 cents. + f_pitch = lambda p: 440 * 2 ** ((p - 69) / 12) + p_min = 24 # C1, MIDI pitch 24 + F_min = f_pitch(p_min) # 32.70 Hz + p_max = 108 # C8, MIDI pitch 108 + F_max = f_pitch(p_max) # 4186.01 Hz + F_coef_log, F_coef_cents = libfmp.c2.compute_f_coef_log(R=1, F_min=F_min, F_max=F_max) + Y_int = interp1d(F_coef, Y, kind='cubic', fill_value='extrapolate')(F_coef_log) + v = Y_int / np.max(Y_int) + + if filt: + # Subtract local average and rectify + filt_kernel = np.ones(filt_len) + Y_smooth = signal.convolve(Y_int, filt_kernel, mode='same') / filt_len + # Y_smooth = signal.medfilt(Y_int, filt_len) + Y_rectified = Y_int - Y_smooth + Y_rectified[Y_rectified < 0] = 0 + v = Y_rectified / np.max(Y_rectified) + + theta_axis, sim, ind_max, theta_max, template_max = tuning_similarity(v) + return v, F_coef_cents
+ + +
[docs]def template_comb(M, theta=0): + """Compute a comb template on a pitch axis + + Notebook: C3/C3S1_TranspositionTuning.ipynb + + Args: + M (int): Length template (given in cents) + theta (int): Shift parameter (given in cents); -50 <= theta < 50 (Default value = 0) + + Returns: + template (np.ndarray): Comb template shifted by theta + """ + template = np.zeros(M) + peak_positions = (np.arange(0, M, 100) + theta) + peak_positions = np.intersect1d(peak_positions, np.arange(M)).astype(int) + template[peak_positions] = 1 + return template
+ + +
[docs]def tuning_similarity(v): + """Compute tuning similarity + + Notebook: C3/C3S1_TranspositionTuning.ipynb + + Args: + v (np.ndarray): Vector representing an overall frequency distribution + + Returns: + theta_axis (np.ndarray): Axis consisting of all tuning parameters -50 <= theta < 50 + sim (np.ndarray): Similarity values for all tuning parameters + ind_max (int): Maximizing index + theta_max (int): Maximizing tuning parameter + template_max (np.ndarray): Similiarty-maximizing comb template + """ + theta_axis = np.arange(-50, 50) # Axis (given in cents) + num_theta = len(theta_axis) + sim = np.zeros(num_theta) + M = len(v) + for i in range(num_theta): + theta = theta_axis[i] + template = template_comb(M=M, theta=theta) + sim[i] = np.inner(template, v) + sim = sim / np.max(sim) + ind_max = np.argmax(sim) + theta_max = theta_axis[ind_max] + template_max = template_comb(M=M, theta=theta_max) + return theta_axis, sim, ind_max, theta_max, template_max
+ + +
[docs]def plot_tuning_similarity(sim, theta_axis, theta_max, ax=None, title=None, figsize=(4, 3)): + """Plots tuning similarity + + Notebook: C3/C3S1_TranspositionTuning.ipynb + + Args: + sim: Similarity values + theta_axis: Axis consisting of cent values [-50:49] + theta_max: Maximizing tuning parameter + ax: Axis (in case of ax=None, figure is generated) (Default value = None) + title: Title of figure (or subplot) (Default value = None) + figsize: Size of figure (only used when ax=None) (Default value = (4, 3)) + + Returns: + fig: Handle for figure + ax: Handle for axes + line: handle for line plot + """ + fig = None + if ax is None: + fig = plt.figure(figsize=figsize) + ax = plt.subplot(1, 1, 1) + if title is None: + title = 'Estimated tuning: %d cents' % theta_max + line = ax.plot(theta_axis, sim, 'k') + ax.set_xlim([theta_axis[0], theta_axis[-1]]) + ax.set_ylim([0, 1.1]) + ax.plot([theta_max, theta_max], [0, 1.1], 'r') + ax.set_xlabel('Tuning parameter (cents)') + ax.set_ylabel('Similarity') + ax.set_title(title) + if fig is not None: + plt.tight_layout() + return fig, ax, line
+ + +
[docs]def plot_freq_vector_template(v, F_coef_cents, template_max, theta_max, ax=None, title=None, figsize=(8, 3)): + """Plots frequency distribution and similarity-maximizing template + + Notebook: C3/C3S1_TranspositionTuning.ipynb + + Args: + v: Vector representing an overall frequency distribution + F_coef_cents: Frequency axis + template_max: Similarity-maximizing template + theta_max: Maximizing tuning parameter + ax: Axis (in case of ax=None, figure is generated) (Default value = None) + title: Title of figure (or subplot) (Default value = None) + figsize: Size of figure (only used when ax=None) (Default value = (8, 3)) + + Returns: + fig: Handle for figure + ax: Handle for axes + line: handle for line plot + """ + fig = None + if ax is None: + fig = plt.figure(figsize=figsize) + ax = plt.subplot(1, 1, 1) + if title is None: + title = r'Frequency distribution with maximizing comb template ($\theta$ = %d cents)' % theta_max + line = ax.plot(F_coef_cents, v, c='k', linewidth=1) + ax.set_xlim([F_coef_cents[0], F_coef_cents[-1]]) + ax.set_ylim([0, 1.1]) + x_ticks_freq = np.array([0, 1200, 2400, 3600, 4800, 6000, 7200, 8000]) + ax.plot(F_coef_cents, template_max * 1.1, 'r:', linewidth=0.5) + ax.set_xticks(x_ticks_freq) + ax.set_xlabel('Frequency (cents)') + plt.title(title) + if fig is not None: + plt.tight_layout() + return fig, ax, line
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c3/c3s2_dtw.html b/docs/build/html/_modules/libfmp/c3/c3s2_dtw.html new file mode 100644 index 0000000..023bb35 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c3/c3s2_dtw.html @@ -0,0 +1,380 @@ + + + + + + + + + + libfmp.c3.c3s2_dtw — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c3.c3s2_dtw
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c3.c3s2_dtw

+"""
+Module: libfmp.c3.c3s2_dtw
+Author: Meinard Mueller, Frank Zalkow
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+from numba import jit
+import numpy as np
+import scipy
+
+
+
[docs]def compute_cost_matrix(X, Y, metric='euclidean'): + """Compute the cost matrix of two feature sequences + + Notebook: C3/C3S2_DTWbasic.ipynb + + Args: + X (np.ndarray): Sequence 1 + Y (np.ndarray): Sequence 2 + metric (str): Cost metric, a valid strings for scipy.spatial.distance.cdist (Default value = 'euclidean') + + Returns: + C (np.ndarray): Cost matrix + """ + X, Y = np.atleast_2d(X, Y) + C = scipy.spatial.distance.cdist(X.T, Y.T, metric=metric) + return C
+ + +
[docs]@jit(nopython=True) +def compute_accumulated_cost_matrix(C): + """Compute the accumulated cost matrix given the cost matrix + + Notebook: C3/C3S2_DTWbasic.ipynb + + Args: + C (np.ndarray): Cost matrix + + Returns: + D (np.ndarray): Accumulated cost matrix + """ + N = C.shape[0] + M = C.shape[1] + D = np.zeros((N, M)) + D[0, 0] = C[0, 0] + for n in range(1, N): + D[n, 0] = D[n-1, 0] + C[n, 0] + for m in range(1, M): + D[0, m] = D[0, m-1] + C[0, m] + for n in range(1, N): + for m in range(1, M): + D[n, m] = C[n, m] + min(D[n-1, m], D[n, m-1], D[n-1, m-1]) + return D
+ + +
[docs]@jit(nopython=True) +def compute_optimal_warping_path(D): + """Compute the warping path given an accumulated cost matrix + + Notebook: C3/C3S2_DTWbasic.ipynb + + Args: + D (np.ndarray): Accumulated cost matrix + + Returns: + P (np.ndarray): Optimal warping path + """ + N = D.shape[0] + M = D.shape[1] + n = N - 1 + m = M - 1 + P = [(n, m)] + while n > 0 or m > 0: + if n == 0: + cell = (0, m - 1) + elif m == 0: + cell = (n - 1, 0) + else: + val = min(D[n-1, m-1], D[n-1, m], D[n, m-1]) + if val == D[n-1, m-1]: + cell = (n-1, m-1) + elif val == D[n-1, m]: + cell = (n-1, m) + else: + cell = (n, m-1) + P.append(cell) + (n, m) = cell + P.reverse() + return np.array(P)
+ + +
[docs]@jit(nopython=True) +def compute_accumulated_cost_matrix_21(C): + """Compute the accumulated cost matrix given the cost matrix + + Notebook: C3/C3S2_DTWvariants.ipynb + + Args: + C (np.ndarray): Cost matrix + + Returns: + D (np.ndarray): Accumulated cost matrix + """ + N = C.shape[0] + M = C.shape[1] + D = np.zeros((N + 2, M + 2)) + D[:, 0:2] = np.inf + D[0:2, :] = np.inf + D[2, 2] = C[0, 0] + + for n in range(N): + for m in range(M): + if n == 0 and m == 0: + continue + D[n+2, m+2] = C[n, m] + min(D[n-1+2, m-1+2], D[n-2+2, m-1+2], D[n-1+2, m-2+2]) + D = D[2:, 2:] + return D
+ + +
[docs]@jit(nopython=True) +def compute_optimal_warping_path_21(D): + """Compute the warping path given an accumulated cost matrix + + Notebook: C3/C3S2_DTWvariants.ipynb + + Args: + D (np.ndarray): Accumulated cost matrix + + Returns: + P (np.ndarray): Optimal warping path + """ + N = D.shape[0] + M = D.shape[1] + n = N - 1 + m = M - 1 + P = [(n, m)] + while n > 0 or m > 0: + if n == 0: + cell = (0, m - 1) + elif m == 0: + cell = (n - 1, 0) + else: + val = min(D[n-1, m-1], D[n-2, m-1], D[n-1, m-2]) + if val == D[n-1, m-1]: + cell = (n-1, m-1) + elif val == D[n-2, m-1]: + cell = (n-2, m-1) + else: + cell = (n-1, m-2) + P.append(cell) + (n, m) = cell + P.reverse() + P = np.array(P) + return P
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c3/c3s2_dtw_plot.html b/docs/build/html/_modules/libfmp/c3/c3s2_dtw_plot.html new file mode 100644 index 0000000..0eba37b --- /dev/null +++ b/docs/build/html/_modules/libfmp/c3/c3s2_dtw_plot.html @@ -0,0 +1,264 @@ + + + + + + + + + + libfmp.c3.c3s2_dtw_plot — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c3.c3s2_dtw_plot
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c3.c3s2_dtw_plot

+"""
+Module: libfmp.c3.c3s2_dtw_plot
+Author: Frank Zalkow, Meinard Mueller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+from matplotlib import pyplot as plt
+import libfmp.b
+
+
+
[docs]def plot_matrix_with_points(C, P=np.empty((0, 2)), color='r', marker='o', linestyle='', **kwargs): + """Compute the cost matrix of two feature sequences + + Args: + C: Matrix to be plotted + P: List of index pairs, to be visualized on the matrix (Default value = np.empty((0, 2))) + color: The color of the line plot (Default value = 'r'). + See https://matplotlib.org/users/colors.html + marker: The marker of the line plot (Default value = 'o'). + See https://matplotlib.org/3.1.0/api/markers_api.html + linestyle: The line-style of the line plot (Default value = ''). + See https://matplotlib.org/gallery/lines_bars_and_markers/line_styles_reference.html + **kwargs: keyword arguments for :func:`libfmp.b.b_plot.plot_matrix` + + Returns: + fig: Handle for figure + im: Handle for imshow + line: handle for line plot + """ + + fig, ax, im = libfmp.b.plot_matrix(C, **kwargs) + line = ax[0].plot(P[:, 1], P[:, 0], marker=marker, color=color, linestyle=linestyle) + + if fig is not None: + plt.tight_layout() + + return fig, im, line
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c3/c3s3_tempo_curve.html b/docs/build/html/_modules/libfmp/c3/c3s3_tempo_curve.html new file mode 100644 index 0000000..ddede33 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c3/c3s3_tempo_curve.html @@ -0,0 +1,458 @@ + + + + + + + + + + libfmp.c3.c3s3_tempo_curve — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c3.c3s3_tempo_curve
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c3.c3s3_tempo_curve

+"""
+Module: libfmp.c3.c3s3_tempo_curve
+Author: Meinard Müller, Frank Zalkow
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+from matplotlib import pyplot as plt
+from matplotlib.ticker import ScalarFormatter
+import librosa
+from scipy import signal
+from scipy.interpolate import interp1d
+import scipy.ndimage.filters
+
+import libfmp.c3
+
+
+
[docs]def compute_score_chromagram(score, Fs_beat): + """Compute chromagram from score representation + + Notebook: C3/C3S3_MusicAppTempoCurve.ipynb + + Args: + score (list): Score representation + Fs_beat (scalar): Sampling rate for beat axis + + Returns: + X_score (np.ndarray): Chromagram representation X_score + t_beat (np.ndarray): Time axis t_beat (given in beats) + """ + score_beat_min = min(n[0] for n in score) + score_beat_max = max(n[0] + n[1] for n in score) + beat_res = 1.0 / Fs_beat + t_beat = np.arange(score_beat_min, score_beat_max, beat_res) + X_score = np.zeros((12, len(t_beat))) + + for start, duration, pitch, velocity, label in score: + start_idx = int(round(start / beat_res)) + end_idx = int(round((start + duration) / beat_res)) + cur_chroma = int(round(pitch)) % 12 + X_score[cur_chroma, start_idx:end_idx] += velocity + + X_score = librosa.util.normalize(X_score, norm=2) + return X_score, t_beat
+ + +
[docs]def plot_measure(ax, measure_pos): + """Plot measure positions + + Notebook: C3/C3S3_MusicAppTempoCurve.ipynb + + Args: + ax (mpl.axes.Axes): Figure axis + measure_pos (list or np.ndarray): Array containing measure positions + """ + y_min, y_max = ax.get_ylim() + ax.vlines(measure_pos, y_min, y_max, color='r') + for m in range(len(measure_pos)): + ax.text(measure_pos[m], y_max, '%s' % (m + 1), + color='r', backgroundcolor='mistyrose', + verticalalignment='top', horizontalalignment='left')
+ + +
[docs]def compute_strict_alignment_path(P): + """Compute strict alignment path from a warping path + + Notebook: C3/C3S3_MusicAppTempoCurve.ipynb + + Args: + P (list or np.ndarray): Warping path + + Returns: + P_mod (list or np.ndarray): Strict alignment path + """ + # Initialize P_mod and enforce start boundary condition + P_mod = np.zeros(P.shape) + P_mod[0] = P[0] + N, M = P[-1] + # Go through all cells of P until reaching last row or column + assert N > 1 and M > 1, 'Length of sequences must be longer than one.' + i, j = 0, 0 + n1, m1 = P[i] + while True: + i += 1 + n2, m2 = P[i] + if n2 == N or m2 == M: + # If last row or column is reached, quit loop + break + if n2 > n1 and m2 > m1: + # Strict monotonicity condition is fulfuilled + j += 1 + P_mod[j] = n2, m2 + n1, m1 = n2, m2 + j += 1 + # Enforce end boundary condition + P_mod[j] = P[-1] + P_mod = P_mod[:j+1] + return P_mod
+ + +
[docs]def compute_strict_alignment_path_mask(P): + """Compute strict alignment path from a warping path + + Notebook: C3/C3S3_MusicAppTempoCurve.ipynb + + Args: + P (list or np.ndarray): Wapring path + + Returns: + P_mod (list or np.ndarray): Strict alignment path + """ + P = np.array(P, copy=True) + N, M = P[-1] + # Get indices for strict monotonicity + keep_mask = (P[1:, 0] > P[:-1, 0]) & (P[1:, 1] > P[:-1, 1]) + # Add first index to enforce start boundary condition + keep_mask = np.concatenate(([True], keep_mask)) + # Remove all indices for of last row or column + keep_mask[(P[:, 0] == N) | (P[:, 1] == M)] = False + # Add last index to enforce end boundary condition + keep_mask[-1] = True + P_mod = P[keep_mask, :] + + return P_mod
+ + +
[docs]def plot_tempo_curve(f_tempo, t_beat, ax=None, figsize=(8, 2), color='k', logscale=False, + xlabel='Time (beats)', ylabel='Temp (BPM)', xlim=None, ylim=None, + label='', measure_pos=[]): + """Plot a tempo curve + + Notebook: C3/C3S3_MusicAppTempoCurve.ipynb + + Args: + f_tempo: Tempo curve + t_beat: Time axis of tempo curve (given as sampled beat axis) + ax: Plot either as figure (ax==None) or into axis (ax==True) (Default value = None) + figsize: Size of figure (Default value = (8, 2)) + color: Color of tempo curve (Default value = 'k') + logscale: Use linear (logscale==False) or logartihmic (logscale==True) tempo axis (Default value = False) + xlabel: Label for x-axis (Default value = 'Time (beats)') + ylabel: Label for y-axis (Default value = 'Temp (BPM)') + xlim: Limits for x-axis (Default value = None) + ylim: Limits for x-axis (Default value = None) + label: Figure labels when plotting into axis (ax==True) (Default value = '') + measure_pos: Plot measure positions as spefified (Default value = []) + + Returns: + fig: figure handle + ax: axes handle + """ + fig = None + if ax is None: + fig = plt.figure(figsize=figsize) + ax = plt.subplot(1, 1, 1) + ax.plot(t_beat, f_tempo, color=color, label=label) + ax.set_title('Tempo curve') + if xlim is None: + xlim = [t_beat[0], t_beat[-1]] + if ylim is None: + ylim = [np.min(f_tempo) * 0.9, np.max(f_tempo) * 1.1] + ax.set_xlim(xlim) + ax.set_ylim(ylim) + ax.set_xlabel('Time (beats)') + ax.set_ylabel('Tempo (BPM)') + ax.grid(True, which='both') + if logscale: + ax.set_yscale('log') + ax.yaxis.set_major_formatter(ScalarFormatter()) + ax.yaxis.set_minor_formatter(ScalarFormatter()) + # ax.set_yticks([], minor=True) + # yticks = np.arange(ylim[0], ylim[1]+1, 10) + # ax.set_yticks(yticks) + plot_measure(ax, measure_pos) + return fig, ax
+ + +
[docs]def compute_tempo_curve(score, x, Fs=22050, Fs_beat=10, N=4410, H=2205, shift=0, + sigma=np.array([[1, 0], [0, 1], [2, 1], [1, 2], [1, 1]]), + win_len_beat=4): + """Compute a tempo curve + + Notebook: C3/C3S3_MusicAppTempoCurve.ipynb + + Args: + score (list): Score representation + x (np.ndarray): Audio signal + Fs (scalar): Samping rate of audio signal (Default value = 22050) + Fs_beat (scalar): Sampling rate for beat axis (Default value = 10) + N (int): Window size for computing audio chromagram (Default value = 4410) + H (int): Hope size for computing audio chromagram (Default value = 2205) + shift (int): Cyclic chroma shift applied to audio chromagram (Default value = 0) + sigma (np.ndarray): Step size set used for DTW + (Default value = np.array([[1, 0], [0, 1], [2, 1], [1, 2], [1, 1]])) + win_len_beat (float): Window length (given in beats) used for smoothing tempo curve (Default value = 4) + + Returns: + f_tempo (np.ndarray): Tempo curve + t_beat (np.ndarray): Time axis (given in beats) + """ + + # Compute score an audio chromagram + X_score, t_beat = compute_score_chromagram(score, Fs_beat) + Fs_X = Fs / H + X = librosa.feature.chroma_stft(y=x, sr=Fs, norm=2, tuning=0, hop_length=H, n_fft=N) + X = np.roll(X, shift, axis=0) + + # Apply DTW to compte C, D, P + C = libfmp.c3.compute_cost_matrix(X, X_score, metric='euclidean') + D, P = librosa.sequence.dtw(C=C, step_sizes_sigma=sigma) + P = P[::-1, :] # reverse P + P_mod = compute_strict_alignment_path(P) + + # Convert path into beat-time function and interpolte + t_path_beat = P_mod[:, 1] / Fs_beat + f_path_sec = P_mod[:, 0] / Fs_X + f_sec = interp1d(t_path_beat, f_path_sec, kind='linear', fill_value='extrapolate')(t_beat) + + # Compute difference and smooth with Hann window + f_diff_sec = np.diff(f_sec) * Fs_beat + pad = np.array([f_diff_sec[-1]]) + f_diff_sec = np.concatenate((f_diff_sec, pad)) + # f_diff_sec = np.concatenate((f_diff_sec, np.array([0]) )) + filt_len = int(win_len_beat * Fs_beat) + filt_win = signal.hann(filt_len) + filt_win = filt_win / np.sum(filt_win) + f_diff_smooth_sec = scipy.ndimage.filters.convolve(f_diff_sec, filt_win, mode='reflect') + + # Compute tempo curve + f_tempo = 1. / f_diff_smooth_sec * 60 + + return f_tempo, t_beat
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c4/c4s1_annotation.html b/docs/build/html/_modules/libfmp/c4/c4s1_annotation.html new file mode 100644 index 0000000..e7c5d2d --- /dev/null +++ b/docs/build/html/_modules/libfmp/c4/c4s1_annotation.html @@ -0,0 +1,326 @@ + + + + + + + + + + libfmp.c4.c4s1_annotation — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c4.c4s1_annotation
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c4.c4s1_annotation

+"""
+Module: libfmp.c4.c4s1_annotation
+Author: Meinard Müller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+
+import libfmp.b
+
+
+
[docs]def get_color_for_annotation_file(filename): + """Gets color dict for annotation file + + Args: + filename (str): Annotation file + + Returns: + color_ann (dict): Dictionary encoding color scheme + """ + color_ann = None + if filename == 'FMP_C4_Audio_Brahms_HungarianDances-05_Ormandy.csv': + color_ann = {'A1': [1, 0, 0, 0.2], 'A2': [1, 0, 0, 0.2], 'A3': [1, 0, 0, 0.2], + 'B1': [0, 1, 0, 0.2], 'B2': [0, 1, 0, 0.2], 'B3': [0, 1, 0, 0.2], + 'B4': [0, 1, 0, 0.2], 'C': [0, 0, 1, 0.2], '': [1, 1, 1, 0]} + if filename == 'FMP_C6_Audio_Brahms_HungarianDances-05_Ormandy.csv': + color_ann = {'A1': [1, 0, 0, 0.2], 'A2': [1, 0, 0, 0.2], 'A3': [1, 0, 0, 0.2], + 'B1': [0, 1, 0, 0.2], 'B2': [0, 1, 0, 0.2], 'B3': [0, 1, 0, 0.2], + 'B4': [0, 1, 0, 0.2], 'C': [0, 0, 1, 0.2], '': [1, 1, 1, 0]} + if filename == 'FMP_C4_F13_ZagerEvans_InTheYear2525.csv': + color_ann = {'I': [0, 1, 0, 0.2], 'V1': [1, 0, 0, 0.2], 'V2': [1, 0, 0, 0.2], + 'V3': [1, 0, 0, 0.2], 'V4': [1, 0, 0, 0.2], 'V5': [1, 0, 0, 0.2], + 'V6': [1, 0, 0, 0.2], 'V7': [1, 0, 0, 0.2], 'V8': [1, 0, 0, 0.2], + 'B': [0, 0, 1, 0.2], 'O': [1, 1, 0, 0.2], '': [1, 1, 1, 0]} + if filename == 'FMP_C6_Audio_ZagerEvans_InTheYear2525.csv': + color_ann = {'I': [0, 1, 0, 0.2], 'V1': [1, 0, 0, 0.2], 'V2': [1, 0, 0, 0.2], + 'V3': [1, 0, 0, 0.2], 'V4': [1, 0, 0, 0.2], 'V5': [1, 0, 0, 0.2], + 'V6': [1, 0, 0, 0.2], 'V7': [1, 0, 0, 0.2], 'V8': [1, 0, 0, 0.2], + 'B': [0, 0, 1, 0.2], 'O': [1, 1, 0, 0.2], '': [1, 1, 1, 0]} + return color_ann
+ + +
[docs]def convert_structure_annotation(ann, Fs=1, remove_digits=False, index=False): + """Convert structure annotations + + Notebook: C4/C4S1_MusicStructureGeneral.ipynb + + Args: + ann (list): Structure annotions + Fs (scalar): Sampling rate (Default value = 1) + remove_digits (bool): Remove digits from labels (Default value = False) + index (bool): Round to nearest integer (Default value = False) + + Returns: + ann_converted (list): Converted annotation + """ + ann_converted = [] + for r in ann: + s = r[0] * Fs + t = r[1] * Fs + if index: + s = int(np.round(s)) + t = int(np.round(t)) + if remove_digits: + label = ''.join([i for i in r[2] if not i.isdigit()]) + else: + label = r[2] + ann_converted = ann_converted + [[s, t, label]] + return ann_converted
+ + +
[docs]def read_structure_annotation(fn_ann, fn_ann_color='', Fs=1, remove_digits=False, index=False): + """Read and convert structure annotation and colors + + Notebook: C4/C4S1_MusicStructureGeneral.ipynb + + Args: + fn_ann (str): Path and filename for structure annotions + fn_ann_color (str): Filename used to identify colors (Default value = '') + Fs (scalar): Sampling rate (Default value = 1) + remove_digits (bool): Remove digits from labels (Default value = False) + index (bool): Round to nearest integer (Default value = False) + + Returns: + ann (list): Annotations + color_ann (dict): Color scheme + """ + df = libfmp.b.read_csv(fn_ann) + ann = [(start, end, label) for i, (start, end, label) in df.iterrows()] + ann = convert_structure_annotation(ann, Fs=Fs, remove_digits=remove_digits, index=index) + color_ann = {} + if len(fn_ann_color) > 0: + color_ann = get_color_for_annotation_file(fn_ann_color) + if remove_digits: + color_ann_reduced = {} + for key, value in color_ann.items(): + key_new = ''.join([i for i in key if not i.isdigit()]) + color_ann_reduced[key_new] = value + color_ann = color_ann_reduced + return ann, color_ann
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c4/c4s2_ssm.html b/docs/build/html/_modules/libfmp/c4/c4s2_ssm.html new file mode 100644 index 0000000..e92af0a --- /dev/null +++ b/docs/build/html/_modules/libfmp/c4/c4s2_ssm.html @@ -0,0 +1,615 @@ + + + + + + + + + + libfmp.c4.c4s2_ssm — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c4.c4s2_ssm
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c4.c4s2_ssm

+"""
+Module: libfmp.c4.c4s2_ssm
+Author: Meinard Müller, David Kopyto
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+import librosa
+from matplotlib import pyplot as plt
+from matplotlib.colors import ListedColormap
+from numba import jit
+
+import libfmp.b
+import libfmp.c3
+import libfmp.c4
+
+
+
[docs]@jit(nopython=True) +def compute_sm_dot(X, Y): + """Computes similarty matrix from feature sequences using dot (inner) product + + Notebook: C4/C4S2_SSM.ipynb + + Args: + X (np.ndarray): First sequence + Y (np.ndarray): Second Sequence + + Returns: + S (float): Dot product + """ + S = np.dot(np.transpose(X), Y) + return S
+ + +
[docs]def plot_feature_ssm(X, Fs_X, S, Fs_S, ann, duration, color_ann=None, + title='', label='Time (seconds)', time=True, + figsize=(5, 6), fontsize=10, clim_X=None, clim=None): + """Plot SSM along with feature representation and annotations (standard setting is time in seconds) + + Notebook: C4/C4S2_SSM.ipynb + + Args: + X: Feature representation + Fs_X: Feature rate of ``X`` + S: Similarity matrix (SM) + Fs_S: Feature rate of ``S`` + ann: Annotaions + duration: Duration + color_ann: Color annotations (see :func:`libfmp.b.b_plot.plot_segments`) (Default value = None) + title: Figure title (Default value = '') + label: Label for time axes (Default value = 'Time (seconds)') + time: Display time axis ticks or not (Default value = True) + figsize: Figure size (Default value = (5, 6)) + fontsize: Font size (Default value = 10) + clim_X: Color limits for matrix X (Default value = None) + clim: Color limits for matrix ``S`` (Default value = None) + + Returns: + fig: Handle for figure + ax: Handle for axes + """ + cmap = libfmp.b.compressed_gray_cmap(alpha=-10) + fig, ax = plt.subplots(3, 3, gridspec_kw={'width_ratios': [0.1, 1, 0.05], + 'wspace': 0.2, + 'height_ratios': [0.3, 1, 0.1]}, + figsize=figsize) + libfmp.b.plot_matrix(X, Fs=Fs_X, ax=[ax[0, 1], ax[0, 2]], clim=clim_X, + xlabel='', ylabel='', title=title) + ax[0, 0].axis('off') + libfmp.b.plot_matrix(S, Fs=Fs_S, ax=[ax[1, 1], ax[1, 2]], cmap=cmap, clim=clim, + title='', xlabel='', ylabel='', colorbar=True) + ax[1, 1].set_xticks([]) + ax[1, 1].set_yticks([]) + libfmp.b.plot_segments(ann, ax=ax[2, 1], time_axis=time, fontsize=fontsize, + colors=color_ann, + time_label=label, time_max=duration*Fs_X) + ax[2, 2].axis('off'), ax[2, 0].axis('off') + libfmp.b.plot_segments(ann, ax=ax[1, 0], time_axis=time, fontsize=fontsize, + direction='vertical', colors=color_ann, + time_label=label, time_max=duration*Fs_X) + return fig, ax
+ + +
[docs]@jit(nopython=True) +def filter_diag_sm(S, L): + """Path smoothing of similarity matrix by forward filtering along main diagonal + + Notebook: C4/C4S2_SSM-PathEnhancement.ipynb + + Args: + S (np.ndarray): Similarity matrix (SM) + L (int): Length of filter + + Returns: + S_L (np.ndarray): Smoothed SM + """ + N = S.shape[0] + M = S.shape[1] + S_L = np.zeros((N, M)) + S_extend_L = np.zeros((N + L, M + L)) + S_extend_L[0:N, 0:M] = S + for pos in range(0, L): + S_L = S_L + S_extend_L[pos:(N + pos), pos:(M + pos)] + S_L = S_L / L + return S_L
+ + +
[docs]def subplot_matrix_colorbar(S, fig, ax, title='', Fs=1, + xlabel='Time (seconds)', ylabel='Time (seconds)', + clim=None, xlim=None, ylim=None, cmap=None): + """Visualization function for showing zoomed sections of matrices + + Notebook: C4/C4S2_SSM-PathEnhancement.ipynb + + Args: + S: Similarity matrix (SM) + fig: Figure handle + ax: Axes handle + title: Title for figure (Default value = '') + Fs: Feature rate (Default value = 1) + xlabel: Label for x-axis (Default value = 'Time (seconds)') + ylabel: Label for y-axis (Default value = 'Time (seconds)') + clim: Color limits (Default value = None) + xlim: Limits for x-axis (Default value = None) + ylim: Limits for x-axis (Default value = None) + cmap: Colormap for imshow (Default value = None) + + Returns: + im: Imshow handle + """ + if cmap is None: + cmap = libfmp.b.compressed_gray_cmap(alpha=-100) + len_sec = S.shape[0] / Fs + extent = [0, len_sec, 0, len_sec] + im = ax.imshow(S, aspect='auto', extent=extent, cmap=cmap, origin='lower') + fig.sca(ax) + fig.colorbar(im) + ax.set_title(title) + ax.set_xlabel(xlabel) + ax.set_ylabel(ylabel) + if xlim is not None: + ax.set_xlim(xlim) + if ylim is not None: + ax.set_ylim(ylim) + if clim is not None: + im.set_clim(clim) + return im
+ + +
[docs]@jit(nopython=True) +def compute_tempo_rel_set(tempo_rel_min, tempo_rel_max, num): + """Compute logarithmically spaced relative tempo values + + Notebook: C4/C4S2_SSM-PathEnhancement.ipynb + + Args: + tempo_rel_min (float): Minimum relative tempo + tempo_rel_max (float): Maximum relative tempo + num (int): Number of relative tempo values (inlcuding the min and max) + + Returns: + tempo_rel_set (np.ndarray): Set of relative tempo values + """ + tempo_rel_set = np.exp(np.linspace(np.log(tempo_rel_min), np.log(tempo_rel_max), num)) + return tempo_rel_set
+ + +
[docs]@jit(nopython=True) +def filter_diag_mult_sm(S, L=1, tempo_rel_set=np.asarray([1]), direction=0): + """Path smoothing of similarity matrix by filtering in forward or backward direction + along various directions around main diagonal. + Note: Directions are simulated by resampling one axis using relative tempo values + + Notebook: C4/C4S2_SSM-PathEnhancement.ipynb + + Args: + S (np.ndarray): Self-similarity matrix (SSM) + L (int): Length of filter (Default value = 1) + tempo_rel_set (np.ndarray): Set of relative tempo values (Default value = np.asarray([1])) + direction (int): Direction of smoothing (0: forward; 1: backward) (Default value = 0) + + Returns: + S_L_final (np.ndarray): Smoothed SM + """ + N = S.shape[0] + M = S.shape[1] + num = len(tempo_rel_set) + S_L_final = np.zeros((N, M)) + + for s in range(0, num): + M_ceil = int(np.ceil(M / tempo_rel_set[s])) + resample = np.multiply(np.divide(np.arange(1, M_ceil+1), M_ceil), M) + np.around(resample, 0, resample) + resample = resample - 1 + index_resample = np.maximum(resample, np.zeros(len(resample))).astype(np.int64) + S_resample = S[:, index_resample] + + S_L = np.zeros((N, M_ceil)) + S_extend_L = np.zeros((N + L, M_ceil + L)) + + # Forward direction + if direction == 0: + S_extend_L[0:N, 0:M_ceil] = S_resample + for pos in range(0, L): + S_L = S_L + S_extend_L[pos:(N + pos), pos:(M_ceil + pos)] + + # Backward direction + if direction == 1: + S_extend_L[L:(N+L), L:(M_ceil+L)] = S_resample + for pos in range(0, L): + S_L = S_L + S_extend_L[(L-pos):(N + L - pos), (L-pos):(M_ceil + L - pos)] + + S_L = S_L / L + resample = np.multiply(np.divide(np.arange(1, M+1), M), M_ceil) + np.around(resample, 0, resample) + resample = resample - 1 + index_resample = np.maximum(resample, np.zeros(len(resample))).astype(np.int64) + + S_resample_inv = S_L[:, index_resample] + S_L_final = np.maximum(S_L_final, S_resample_inv) + + return S_L_final
+ + +
[docs]@jit(nopython=True) +def shift_cyc_matrix(X, shift=0): + """Cyclic shift of features matrix along first dimension + + Notebook: C4/C4S2_SSM-TranspositionInvariance.ipynb + + Args: + X (np.ndarray): Feature respresentation + shift (int): Number of bins to be shifted (Default value = 0) + + Returns: + X_cyc (np.ndarray): Cyclically shifted feature matrix + """ + # Note: X_cyc = np.roll(X, shift=shift, axis=0) does to work for jit + K, N = X.shape + shift = np.mod(shift, K) + X_cyc = np.zeros((K, N)) + X_cyc[shift:K, :] = X[0:K-shift, :] + X_cyc[0:shift, :] = X[K-shift:K, :] + return X_cyc
+ + +# @jit(nopython=True) +
[docs]def compute_sm_ti(X, Y, L=1, tempo_rel_set=np.asarray([1]), shift_set=np.asarray([0]), direction=2): + """Compute enhanced similaity matrix by applying path smoothing and transpositions + + Notebook: C4/C4S2_SSM-TranspositionInvariance.ipynb + + Args: + X (np.ndarray): First feature sequence + Y (np.ndarray): Second feature sequence + L (int): Length of filter (Default value = 1) + tempo_rel_set (np.ndarray): Set of relative tempo values (Default value = np.asarray([1])) + shift_set (np.ndarray): Set of shift indices (Default value = np.asarray([0])) + direction (int): Direction of smoothing (0: forward; 1: backward; 2: both directions) (Default value = 2) + + Returns: + S_TI (np.ndarray): Transposition-invariant SM + I_TI (np.ndarray): Transposition index matrix + """ + for shift in shift_set: + Y_cyc = shift_cyc_matrix(Y, shift) + S_cyc = libfmp.c4.compute_sm_dot(X, Y_cyc) + + if direction == 0: + S_cyc = libfmp.c4.filter_diag_mult_sm(S_cyc, L, tempo_rel_set, direction=0) + if direction == 1: + S_cyc = libfmp.c4.filter_diag_mult_sm(S_cyc, L, tempo_rel_set, direction=1) + if direction == 2: + S_forward = libfmp.c4.filter_diag_mult_sm(S_cyc, L, tempo_rel_set=tempo_rel_set, direction=0) + S_backward = libfmp.c4.filter_diag_mult_sm(S_cyc, L, tempo_rel_set=tempo_rel_set, direction=1) + S_cyc = np.maximum(S_forward, S_backward) + if shift == shift_set[0]: + S_TI = S_cyc + I_TI = np.ones((S_cyc.shape[0], S_cyc.shape[1])) * shift + else: + # jit does not like the following lines + # I_greater = np.greater(S_cyc, S_TI) + # I_greater = (S_cyc > S_TI) + I_TI[S_cyc > S_TI] = shift + S_TI = np.maximum(S_cyc, S_TI) + + return S_TI, I_TI
+ + +
[docs]def subplot_matrix_ti_colorbar(S, fig, ax, title='', Fs=1, xlabel='Time (seconds)', ylabel='Time (seconds)', + clim=None, xlim=None, ylim=None, cmap=None, alpha=1, ind_zero=False): + """Visualization function for showing transposition index matrix + + Notebook: C4/C4S2_SSM-TranspositionInvariance.ipynb + + Args: + S: Self-similarity matrix (SSM) + fig: Figure handle + ax: Axes handle + title: Title for figure (Default value = '') + Fs: Feature rate (Default value = 1) + xlabel: Label for x-axis (Default value = 'Time (seconds)') + ylabel: Label for y-axis (Default value = 'Time (seconds)') + clim: Color limits (Default value = None) + xlim: Limits for x-axis (Default value = None) + ylim: Limits for y-axis (Default value = None) + cmap: Color map (Default value = None) + alpha: Alpha value for imsow (Default value = 1) + ind_zero: Use white (True) or black (False) color for index zero (Default value = False) + + Returns: + im: Imshow handle + """ + if cmap is None: + color_ind_zero = np.array([0, 0, 0, 1]) + if ind_zero == 0: + color_ind_zero = np.array([0, 0, 0, 1]) + else: + color_ind_zero = np.array([1, 1, 1, 1]) + colorList = np.array([color_ind_zero, [1, 1, 0, 1], [0, 0.7, 0, 1], [1, 0, 1, 1], [0, 0, 1, 1], + [1, 0, 0, 1], [0, 0, 0, 0.5], [1, 0, 0, 0.3], [0, 0, 1, 0.3], [1, 0, 1, 0.3], + [0, 0.7, 0, 0.3], [1, 1, 0, 0.3]]) + cmap = ListedColormap(colorList) + len_sec = S.shape[0] / Fs + extent = [0, len_sec, 0, len_sec] + im = ax.imshow(S, aspect='auto', extent=extent, cmap=cmap, origin='lower', alpha=alpha) + if clim is None: + im.set_clim(vmin=-0.5, vmax=11.5) + fig.sca(ax) + ax_cb = fig.colorbar(im) + ax_cb.set_ticks(np.arange(0, 12, 1)) + ax_cb.set_ticklabels(np.arange(0, 12, 1)) + ax.set_title(title) + ax.set_xlabel(xlabel) + ax.set_ylabel(ylabel) + if xlim is not None: + ax.set_xlim(xlim) + if ylim is not None: + ax.set_ylim(ylim) + return im
+ + +
[docs]def compute_sm_from_filename(fn_wav, L=21, H=5, L_smooth=16, tempo_rel_set=np.array([1]), + shift_set=np.array([0]), strategy='relative', scale=True, thresh=0.15, + penalty=0.0, binarize=False): + """Compute an SSM + + Notebook: C4/C4S2_SSM-Thresholding.ipynb + + Args: + fn_wav (str): Path and filename of wav file + L (int): Length of smoothing filter (Default value = 21) + H (int): Downsampling factor (Default value = 5) + L_smooth (int): Length of filter (Default value = 16) + tempo_rel_set (np.ndarray): Set of relative tempo values (Default value = np.array([1])) + shift_set (np.ndarray): Set of shift indices (Default value = np.array([0])) + strategy (str): Thresholding strategy (see :func:`libfmp.c4.c4s2_ssm.compute_sm_ti`) + (Default value = 'relative') + scale (bool): If scale=True, then scaling of positive values to range [0,1] (Default value = True) + thresh (float): Treshold (meaning depends on strategy) (Default value = 0.15) + penalty (float): Set values below treshold to value specified (Default value = 0.0) + binarize (bool): Binarizes final matrix (positive: 1; otherwise: 0) (Default value = False) + + Returns: + x (np.ndarray): Audio signal + x_duration (float): Duration of audio signal (seconds) + X (np.ndarray): Feature sequence + Fs_feature (scalar): Feature rate + S_thresh (np.ndarray): SSM + I (np.ndarray): Index matrix + """ + # Waveform + Fs = 22050 + x, Fs = librosa.load(fn_wav, Fs) + x_duration = x.shape[0] / Fs + + # Chroma Feature Sequence and SSM (10 Hz) + C = librosa.feature.chroma_stft(y=x, sr=Fs, tuning=0, norm=2, hop_length=2205, n_fft=4410) + Fs_C = Fs / 2205 + + # Chroma Feature Sequence and SSM + X, Fs_feature = libfmp.c3.smooth_downsample_feature_sequence(C, Fs_C, filt_len=L, down_sampling=H) + X = libfmp.c3.normalize_feature_sequence(X, norm='2', threshold=0.001) + + # Compute SSM + S, I = libfmp.c4.compute_sm_ti(X, X, L=L_smooth, tempo_rel_set=tempo_rel_set, shift_set=shift_set, direction=2) + S_thresh = libfmp.c4.threshold_matrix(S, thresh=thresh, strategy=strategy, + scale=scale, penalty=penalty, binarize=binarize) + return x, x_duration, X, Fs_feature, S_thresh, I
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c4/c4s2_synthetic_ssm.html b/docs/build/html/_modules/libfmp/c4/c4s2_synthetic_ssm.html new file mode 100644 index 0000000..8b6ab8b --- /dev/null +++ b/docs/build/html/_modules/libfmp/c4/c4s2_synthetic_ssm.html @@ -0,0 +1,289 @@ + + + + + + + + + + libfmp.c4.c4s2_synthetic_ssm — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c4.c4s2_synthetic_ssm
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c4.c4s2_synthetic_ssm

+"""
+Module: libfmp.c4.c4s2_synthetic_ssm
+Author: Meinard Müller, Tim Zunner
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+import scipy.ndimage
+
+
+
[docs]def generate_ssm_from_annotation(ann, label_ann=None, score_path=1.0, score_block=0.5, main_diagonal=True, + smooth_sigma=0.0, noise_power=0.0): + """Generation of a SSM + + Notebook: C4/C4S2_SSM-Synthetic.ipynb + + Args: + ann (list): Description of sections (see explanation above) + label_ann (dict): Specification of property (path, block relation) (Default value = None) + score_path (float): SSM values for occurring paths (Default value = 1.0) + score_block (float): SSM values of blocks covering the same labels (Default value = 0.5) + main_diagonal (bool): True if a filled main diagonal should be enforced (Default value = True) + smooth_sigma (float): Standard deviation of a Gaussian smoothing filter. + filter length is 4*smooth_sigma (Default value = 0.0) + noise_power (float): Variance of additive white Gaussian noise (Default value = 0.0) + + Returns: + S (np.ndarray): Generated SSM + """ + N = ann[-1][1] + 1 + S = np.zeros((N, N)) + + if label_ann is None: + all_labels = [s[2] for s in ann] + labels = list(set(all_labels)) + label_ann = {l: [True, True] for l in labels} + + for s in ann: + for s2 in ann: + if s[2] == s2[2]: + if (label_ann[s[2]])[1]: + S[s[0]:s[1]+1, s2[0]:s2[1]+1] = score_block + + if (label_ann[s[2]])[0]: + length_1 = s[1] - s[0] + 1 + length_2 = s2[1] - s2[0] + 1 + + if length_1 >= length_2: + scale_fac = length_2 / length_1 + for i in range(s[1] - s[0] + 1): + S[s[0]+i, s2[0]+int(i*scale_fac)] = score_path + else: + scale_fac = length_1 / length_2 + for i in range(s2[1] - s2[0] + 1): + S[s[0]+int(i*scale_fac), s2[0]+i] = score_path + if main_diagonal: + for i in range(N): + S[i, i] = score_path + if smooth_sigma > 0: + S = scipy.ndimage.gaussian_filter(S, smooth_sigma) + if noise_power > 0: + S = S + np.sqrt(noise_power) * np.random.randn(S.shape[0], S.shape[1]) + return S
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c4/c4s2_threshold.html b/docs/build/html/_modules/libfmp/c4/c4s2_threshold.html new file mode 100644 index 0000000..3395022 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c4/c4s2_threshold.html @@ -0,0 +1,338 @@ + + + + + + + + + + libfmp.c4.c4s2_threshold — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c4.c4s2_threshold
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c4.c4s2_threshold

+"""
+Module: libfmp.c4.c4s2_threshold
+Author: Meinard Müller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+
+
+
[docs]def threshold_matrix_relative(S, thresh_rel=0.2, details=False): + """Treshold matrix in a relative fashion + + Notebook: C4/C4S2_SSM-Thresholding.ipynb + + Args: + S (np.ndarray): Input matrix + thresh_rel (float): Relative treshold (Default value = 0.2) + details (bool): Print details on thresholding procedure (Default value = False) + + Returns: + S_thresh (np.ndarray): Thresholded matrix + thresh_abs (float): Absolute threshold used for thresholding + """ + S_thresh = np.copy(S) + num_cells_below_thresh = int(np.round(S_thresh.size*(1-thresh_rel))) + values_sorted = np.sort(S_thresh.flatten('F')) + thresh_abs = values_sorted[num_cells_below_thresh] + S_thresh[S_thresh < thresh_abs] = 0 + if details: + print('thresh_rel=%0.2f, thresh_abs=%d, total_num_cells=%d, num_cells_below_thresh=%d, ' % + (thresh_rel, thresh_abs, S_thresh.size, num_cells_below_thresh)) + return S_thresh, thresh_abs
+ + +
[docs]def threshold_matrix(S, thresh, strategy='absolute', scale=False, penalty=0.0, binarize=False): + """Treshold matrix in a relative fashion + + Notebook: C4/C4S2_SSM-Thresholding.ipynb + + Args: + S (np.ndarray): Input matrix + thresh (float): Treshold (meaning depends on strategy) + strategy (str): Thresholding strategy ('absolute', 'relative', 'local') (Default value = 'absolute') + scale (bool): If scale=True, then scaling of positive values to range [0,1] (Default value = False) + penalty (float): Set values below treshold to value specified (Default value = 0.0) + binarize (bool): Binarizes final matrix (positive: 1; otherwise: 0) (Default value = False) + + Returns: + S_thresh (np.ndarray): Thresholded matrix + """ + if np.min(S) < 0: + raise Exception('All entries of the input matrix must be nonnegative') + + S_thresh = np.copy(S) + N, M = S.shape + num_cells = N * M + + if strategy == 'absolute': + thresh_abs = thresh + S_thresh[S_thresh < thresh] = 0 + + if strategy == 'relative': + thresh_rel = thresh + num_cells_below_thresh = int(np.round(S_thresh.size*(1-thresh_rel))) + if num_cells_below_thresh < num_cells: + values_sorted = np.sort(S_thresh.flatten('F')) + thresh_abs = values_sorted[num_cells_below_thresh] + S_thresh[S_thresh < thresh_abs] = 0 + else: + S_thresh = np.zeros([N, M]) + + if strategy == 'local': + thresh_rel_row = thresh[0] + thresh_rel_col = thresh[1] + S_binary_row = np.zeros([N, M]) + num_cells_row_below_thresh = int(np.round(M * (1-thresh_rel_row))) + for n in range(N): + row = S[n, :] + values_sorted = np.sort(row) + if num_cells_row_below_thresh < M: + thresh_abs = values_sorted[num_cells_row_below_thresh] + S_binary_row[n, :] = (row >= thresh_abs) + S_binary_col = np.zeros([N, M]) + num_cells_col_below_thresh = int(np.round(N * (1-thresh_rel_col))) + for m in range(M): + col = S[:, m] + values_sorted = np.sort(col) + if num_cells_col_below_thresh < N: + thresh_abs = values_sorted[num_cells_col_below_thresh] + S_binary_col[:, m] = (col >= thresh_abs) + S_thresh = S * S_binary_row * S_binary_col + + if scale: + cell_val_zero = np.where(S_thresh == 0) + cell_val_pos = np.where(S_thresh > 0) + if len(cell_val_pos[0]) == 0: + min_value = 0 + else: + min_value = np.min(S_thresh[cell_val_pos]) + max_value = np.max(S_thresh) + # print('min_value = ', min_value, ', max_value = ', max_value) + if max_value > min_value: + S_thresh = np.divide((S_thresh - min_value), (max_value - min_value)) + if len(cell_val_zero[0]) > 0: + S_thresh[cell_val_zero] = penalty + else: + print('Condition max_value > min_value is voliated: output zero matrix') + + if binarize: + S_thresh[S_thresh > 0] = 1 + S_thresh[S_thresh < 0] = 0 + return S_thresh
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c4/c4s3_thumbnail.html b/docs/build/html/_modules/libfmp/c4/c4s3_thumbnail.html new file mode 100644 index 0000000..a96bb40 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c4/c4s3_thumbnail.html @@ -0,0 +1,785 @@ + + + + + + + + + + libfmp.c4.c4s3_thumbnail — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c4.c4s3_thumbnail
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c4.c4s3_thumbnail

+"""
+Module: libfmp.c4.c4s3_thumbnail
+Author: Meinard Müller, Angel Villar-Corrales
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import math
+import numpy as np
+from matplotlib import pyplot as plt
+import matplotlib
+from numba import jit
+from matplotlib.colors import ListedColormap
+
+import libfmp.b
+import libfmp.c4
+
+
+
[docs]def colormap_penalty(penalty=-2, cmap=libfmp.b.compressed_gray_cmap(alpha=5)): + """Extend colormap with white color between the penalty value and zero + + Notebook: C4/C4S3_AudioThumbnailing.ipynb + + Args: + penalty (float): Negative number (Default value = -2.0) + cmap (mpl.colors.Colormap): Original colormap (Default value = libfmp.b.compressed_gray_cmap(alpha=5)) + + Returns: + cmap_penalty (mpl.colors.Colormap): Extended colormap + """ + if isinstance(cmap, str): + cmap = matplotlib.cm.get_cmap(cmap, 128) + cmap_matrix = cmap(np.linspace(0, 1, 128))[:, :3] + num_row = int(np.abs(penalty)*128) + # cmap_penalty = np.flip(np.concatenate((cmap_matrix, np.ones((num_row, 3))), axis=0), axis=0) + cmap_penalty = np.concatenate((np.ones((num_row, 3)), cmap_matrix), axis=0) + cmap_penalty = ListedColormap(cmap_penalty) + + return cmap_penalty
+ + +
[docs]def normalization_properties_ssm(S): + """Normalizes self-similartiy matrix to fulfill S(n,n)=1. + Yields a warning if max(S)<=1 is not fulfilled + + Notebook: C4/C4S3_AudioThumbnailing.ipynb + + Args: + S (np.ndarray): Self-similarity matrix (SSM) + + Returns: + S_normalized (np.ndarray): Normalized self-similarity matrix + """ + S_normalized = S.copy() + N = S_normalized.shape[0] + for n in range(N): + S_normalized[n, n] = 1 + max_S = np.max(S_normalized) + if max_S > 1: + print('Normalization condition for SSM not fulfill (max > 1)') + return S_normalized
+ + +
[docs]def plot_ssm_ann(S, ann, Fs=1, cmap='gray_r', color_ann=[], ann_x=True, ann_y=True, + fontsize=12, figsize=(5, 4.5), xlabel='', ylabel='', title=''): + """Plot SSM and annotations (horizontal and vertical as overlay) + + Notebook: C4/C4S3_AudioThumbnailing.ipynb + + Args: + S: Self-similarity matrix + ann: Annotations + Fs: Feature rate of path_family (Default value = 1) + cmap: Color map for S (Default value = 'gray_r') + color_ann: color scheme used for annotations (see :func:`libfmp.b.b_plot.plot_segments`) + (Default value = []) + ann_x: Plot annotations on x-axis (Default value = True) + ann_y: Plot annotations on y-axis (Default value = True) + fontsize: Font size used for annotation labels (Default value = 12) + figsize: Size of figure (Default value = (5, 4.5)) + xlabel: Label for x-axis (Default value = '') + ylabel: Label for y-axis (Default value = '') + title: Figure size (Default value = '') + + Returns: + fig: Handle for figure + ax: Handle for axes + im: Handle for imshow + """ + fig, ax = plt.subplots(2, 2, gridspec_kw={'width_ratios': [1, 0.05], + 'height_ratios': [1, 0.1]}, figsize=figsize) + + fig_im, ax_im, im = libfmp.b.plot_matrix(S, Fs=Fs, Fs_F=Fs, + ax=[ax[0, 0], ax[0, 1]], cmap=cmap, + xlabel='', ylabel='', title='') + ax[0, 0].set_ylabel(ylabel) + ax[0, 0].set_xlabel(xlabel) + ax[0, 0].set_title(title) + if ann_y: + libfmp.b.plot_segments_overlay(ann, ax=ax_im[0], direction='vertical', + time_max=S.shape[0]/Fs, print_labels=False, + colors=color_ann, alpha=0.05) + if ann_x: + libfmp.b.plot_segments(ann, ax=ax[1, 0], time_max=S.shape[0]/Fs, colors=color_ann, + time_axis=False, fontsize=fontsize) + else: + ax[1, 0].axis('off') + ax[1, 1].axis('off') + plt.tight_layout() + return fig, ax, im
+ + +
[docs]def plot_path_family(ax, path_family, Fs=1, x_offset=0, y_offset=0, proj_x=True, w_x=7, proj_y=True, w_y=7): + """Plot path family into a given axis + + Notebook: C4/C4S3_AudioThumbnailing.ipynb + + Args: + ax: Axis of plot + path_family: Path family + Fs: Feature rate of path_family (Default value = 1) + x_offset: Offset x-axis (Default value = 0) + y_offset: Yffset x-axis (Default value = 0) + proj_x: Display projection on x-axis (Default value = True) + w_x: Width used for projection on x-axis (Default value = 7) + proj_y: Display projection on y-axis (Default value = True) + w_y: Width used for projection on y-axis (Default value = 7) + """ + for path in path_family: + y = [(path[i][0] + y_offset)/Fs for i in range(len(path))] + x = [(path[i][1] + x_offset)/Fs for i in range(len(path))] + ax.plot(x, y, "o", color=[0, 0, 0], linewidth=3, markersize=5) + ax.plot(x, y, '.', color=[0.7, 1, 1], linewidth=2, markersize=6) + if proj_y: + for path in path_family: + y1 = path[0][0]/Fs + y2 = path[-1][0]/Fs + ax.add_patch(plt.Rectangle((0, y1), w_y, y2-y1, linewidth=1, + facecolor=[0, 1, 0], edgecolor=[0, 0, 0])) + # ax.plot([0, 0], [y1, y2], linewidth=8, color=[0, 1, 0]) + if proj_x: + for path in path_family: + x1 = (path[0][1] + x_offset)/Fs + x2 = (path[-1][1] + x_offset)/Fs + ax.add_patch(plt.Rectangle((x1, 0), x2-x1, w_x, linewidth=1, + facecolor=[0, 0, 1], edgecolor=[0, 0, 0]))
+ # ax.plot([x1, x2], [0, 0], linewidth=8, color=[0, 0, 1]) + + +
[docs]def compute_induced_segment_family_coverage(path_family): + """Compute induced segment family and coverage from path family + + Notebook: C4/C4S3_AudioThumbnailing.ipynb + + Args: + path_family (list): Path family + + Returns: + segment_family (np.ndarray): Induced segment family + coverage (float): Coverage of path family + """ + num_path = len(path_family) + coverage = 0 + if num_path > 0: + segment_family = np.zeros((num_path, 2), dtype=int) + for n in range(num_path): + segment_family[n, 0] = path_family[n][0][0] + segment_family[n, 1] = path_family[n][-1][0] + coverage = coverage + segment_family[n, 1] - segment_family[n, 0] + 1 + else: + segment_family = np.empty + + return segment_family, coverage
+ + +
[docs]@jit(nopython=True) +def compute_accumulated_score_matrix(S_seg): + """Compute the accumulated score matrix + + Notebook: C4/C4S3_AudioThumbnailing.ipynb + + Args: + S_seg (np.ndarray): Submatrix of an enhanced and normalized SSM ``S``. + Note: ``S`` must satisfy ``S(n,m) <= 1 and S(n,n) = 1`` + + Returns: + D (np.ndarray): Accumulated score matrix + score (float): Score of optimal path family + """ + inf = math.inf + N = S_seg.shape[0] + M = S_seg.shape[1]+1 + + # Iinitializing score matrix + D = -inf * np.ones((N, M), dtype=np.float64) + D[0, 0] = 0. + D[0, 1] = D[0, 0] + S_seg[0, 0] + + # Dynamic programming + for n in range(1, N): + D[n, 0] = max(D[n-1, 0], D[n-1, -1]) + D[n, 1] = D[n, 0] + S_seg[n, 0] + for m in range(2, M): + D[n, m] = S_seg[n, m-1] + max(D[n-1, m-1], D[n-1, m-2], D[n-2, m-1]) + + # Score of optimal path family + score = np.maximum(D[N-1, 0], D[N-1, M-1]) + + return D, score
+ + +
[docs]@jit(nopython=True) +def compute_optimal_path_family(D): + """Compute an optimal path family given an accumulated score matrix + + Notebook: C4/C4S3_AudioThumbnailing.ipynb + + Args: + D (np.ndarray): Accumulated score matrix + + Returns: + path_family (list): Optimal path family consisting of list of paths + (each path being a list of index pairs) + """ + # Initialization + inf = math.inf + N = int(D.shape[0]) + M = int(D.shape[1]) + + path_family = [] + path = [] + + n = N - 1 + if(D[n, M-1] < D[n, 0]): + m = 0 + else: + m = M-1 + path_point = (N-1, M-2) + path.append(path_point) + + # Backtracking + while n > 0 or m > 0: + + # obtaining the set of possible predecesors given our current position + if(n <= 2 and m <= 2): + predecessors = [(n-1, m-1)] + elif(n <= 2 and m > 2): + predecessors = [(n-1, m-1), (n-1, m-2)] + elif(n > 2 and m <= 2): + predecessors = [(n-1, m-1), (n-2, m-1)] + else: + predecessors = [(n-1, m-1), (n-2, m-1), (n-1, m-2)] + + # case for the first row. Only horizontal movements allowed + if n == 0: + cell = (0, m-1) + # case for the elevator column: we can keep going down the column or jumping to the end of the next row + elif m == 0: + if(D[n-1, M-1] > D[n-1, 0]): + cell = (n-1, M-1) + path_point = (n-1, M-2) + if(len(path) > 0): + path.reverse() + path_family.append(path) + path = [path_point] + else: + cell = (n-1, 0) + # case for m=1, only horizontal steps to the elevator column are allowed + elif m == 1: + cell = (n, 0) + # regular case + else: + + # obtaining the best of the possible predecesors + max_val = -inf + for i in range(len(predecessors)): + if(max_val < D[predecessors[i][0], predecessors[i][1]]): + max_val = D[predecessors[i][0], predecessors[i][1]] + cell = predecessors[i] + + # saving the point in the current path + path_point = (cell[0], cell[1]-1) + path.append(path_point) + + (n, m) = cell + + # adding last path to the path family + path.reverse() + path_family.append(path) + path_family.reverse() + + return path_family
+ + +
[docs]def compute_fitness(path_family, score, N): + """Compute fitness measure and other metrics from path family + + Notebook: C4/C4S3_AudioThumbnailing.ipynb + + Args: + path_family (list): Path family + score (float): Score + N (int): Length of feature sequence + + Returns: + fitness (float): Fitness + score (float): Score + score_n (float): Normalized score + coverage (float): Coverage + coverage_n (float): Normalized coverage + path_family_length (int): Length of path family (total number of cells) + """ + eps = 1e-16 + num_path = len(path_family) + M = path_family[0][-1][1] + 1 + + # Normalized score + path_family_length = 0 + for n in range(num_path): + path_family_length = path_family_length + len(path_family[n]) + score_n = (score - M) / (path_family_length + eps) + + # Normalized coverage + segment_family, coverage = compute_induced_segment_family_coverage(path_family) + coverage_n = (coverage - M) / (N + eps) + + # Fitness measure + fitness = 2 * score_n * coverage_n / (score_n + coverage_n + eps) + + return fitness, score, score_n, coverage, coverage_n, path_family_length
+ + +
[docs]def plot_ssm_ann_optimal_path_family(S, ann, seg, Fs=1, cmap='gray_r', color_ann=[], fontsize=12, + figsize=(5, 4.5), xlabel='', ylabel=''): + """Plot SSM, annotations, and computed optimal path family + + Notebook: C4/C4S3_AudioThumbnailing.ipynb + + Args: + S: Self-similarity matrix + ann: Annotations + seg: Segment for computing the optimal path family + Fs: Feature rate of path_family (Default value = 1) + cmap: Color map for S (Default value = 'gray_r') + color_ann: color scheme used for annotations (see :func:`libfmp.b.b_plot.plot_segments`) + (Default value = []) + fontsize: Font size used for annotation labels (Default value = 12) + figsize: Size of figure (Default value = (5, 4.5)) + xlabel: Label for x-axis (Default value = '') + ylabel: Label for y-axis (Default value = '') + + Returns: + fig: Handle for figure + ax: Handle for axes + im: Handle for imshow + """ + N = S.shape[0] + S_seg = S[:, seg[0]:seg[1]+1] + D, score = compute_accumulated_score_matrix(S_seg) + path_family = compute_optimal_path_family(D) + fitness, score, score_n, coverage, coverage_n, path_family_length = compute_fitness( + path_family, score, N) + title = r'$\bar{\sigma}(\alpha)=%0.2f$, $\bar{\gamma}(\alpha)=%0.2f$, $\varphi(\alpha)=%0.2f$' % \ + (score_n, coverage_n, fitness) + fig, ax, im = plot_ssm_ann(S, ann, color_ann=color_ann, Fs=1, cmap=cmap, + figsize=figsize, fontsize=fontsize, + xlabel=r'$\alpha=[%d:%d]$' % (seg[0], seg[-1]), ylabel=ylabel, title=title) + plot_path_family(ax[0, 0], path_family, Fs=1, x_offset=seg[0]) + return fig, ax, im
+ + +
[docs]def visualize_scape_plot(SP, Fs=1, ax=None, figsize=(4, 3), title='', + xlabel='Center (seconds)', ylabel='Length (seconds)'): + """Visualize scape plot + + Notebook: C4/C4S3_ScapePlot.ipynb + + Args: + SP: Scape plot data (encodes as start-duration matrix) + Fs: Sampling rate (Default value = 1) + ax: Used axes (Default value = None) + figsize: Figure size (Default value = (4, 3)) + title: Title of figure (Default value = '') + xlabel: Label for x-axis (Default value = 'Center (seconds)') + ylabel: Label for y-axis (Default value = 'Length (seconds)') + + Returns: + fig: Handle for figure + ax: Handle for axes + im: Handle for imshow + """ + fig = None + if(ax is None): + fig = plt.figure(figsize=figsize) + ax = plt.gca() + N = SP.shape[0] + SP_vis = np.zeros((N, N)) + for length_minus_one in range(N): + for start in range(N-length_minus_one): + center = start + length_minus_one//2 + SP_vis[length_minus_one, center] = SP[length_minus_one, start] + + extent = np.array([-0.5, (N-1)+0.5, -0.5, (N-1)+0.5]) / Fs + im = plt.imshow(SP_vis, cmap='hot_r', aspect='auto', origin='lower', extent=extent) + x = np.asarray(range(N)) + x_half_lower = x/2 + x_half_upper = x/2 + N/2 - 1/2 + plt.plot(x_half_lower/Fs, x/Fs, '-', linewidth=3, color='black') + plt.plot(x_half_upper/Fs, np.flip(x, axis=0)/Fs, '-', linewidth=3, color='black') + plt.plot(x/Fs, np.zeros(N)/Fs, '-', linewidth=3, color='black') + plt.xlim([0, (N-1) / Fs]) + plt.ylim([0, (N-1) / Fs]) + ax.set_title(title) + ax.set_xlabel(xlabel) + ax.set_ylabel(ylabel) + plt.tight_layout() + plt.colorbar(im, ax=ax) + return fig, ax, im
+ + +# @jit(nopython=True) +
[docs]def compute_fitness_scape_plot(S): + """Compute scape plot for fitness and other measures + + Notebook: C4/C4S3_ScapePlot.ipynb + + Args: + S (np.ndarray): Self-similarity matrix + + Returns: + SP_all (np.ndarray): Vector containing five different scape plots for five measures + (fitness, score, normalized score, coverage, normlized coverage) + """ + N = S.shape[0] + SP_fitness = np.zeros((N, N)) + SP_score = np.zeros((N, N)) + SP_score_n = np.zeros((N, N)) + SP_coverage = np.zeros((N, N)) + SP_coverage_n = np.zeros((N, N)) + + for length_minus_one in range(N): + for start in range(N-length_minus_one): + S_seg = S[:, start:start+length_minus_one+1] + D, score = libfmp.c4.compute_accumulated_score_matrix(S_seg) + path_family = libfmp.c4.compute_optimal_path_family(D) + fitness, score, score_n, coverage, coverage_n, path_family_length = libfmp.c4.compute_fitness( + path_family, score, N) + SP_fitness[length_minus_one, start] = fitness + SP_score[length_minus_one, start] = score + SP_score_n[length_minus_one, start] = score_n + SP_coverage[length_minus_one, start] = coverage + SP_coverage_n[length_minus_one, start] = coverage_n + SP_all = [SP_fitness, SP_score, SP_score_n, SP_coverage, SP_coverage_n] + return SP_all
+ + +
[docs]def seg_max_sp(SP): + """Return segment with maximal value in SP + + Notebook: C4/C4S3_ScapePlot.ipynb + + Args: + SP (np.ndarray): Scape plot + + Returns: + seg (tuple): Segment ``(start_index, end_index)`` + """ + N = SP.shape[0] + # value_max = np.max(SP) + arg_max = np.argmax(SP) + ind_max = np.unravel_index(arg_max, [N, N]) + seg = [ind_max[1], ind_max[1]+ind_max[0]] + return seg
+ + +
[docs]def plot_seg_in_sp(ax, seg, S=None, Fs=1): + """Plot segment and induced segements as points in SP visualization + + Notebook: C4/C4S3_ScapePlot.ipynb + + Args: + ax: Axis for image + seg: Segment ``(start_index, end_index)`` + S: Self-similarity matrix (Default value = None) + Fs: Sampling rate (Default value = 1) + """ + if S is not None: + S_seg = S[:, seg[0]:seg[1]+1] + D, score = libfmp.c4.compute_accumulated_score_matrix(S_seg) + path_family = libfmp.c4.compute_optimal_path_family(D) + segment_family, coverage = libfmp.c4.compute_induced_segment_family_coverage(path_family) + length = segment_family[:, 1] - segment_family[:, 0] + 1 + center = segment_family[:, 0] + length//2 + ax.scatter(center/Fs, length/Fs, s=64, c='white', zorder=9999) + ax.scatter(center/Fs, length/Fs, s=16, c='lime', zorder=9999) + length = seg[1] - seg[0] + 1 + center = seg[0] + length//2 + ax.scatter(center/Fs, length/Fs, s=64, c='white', zorder=9999) + ax.scatter(center/Fs, length/Fs, s=16, c='blue', zorder=9999)
+ + +
[docs]def plot_sp_ssm(SP, seg, S, ann, color_ann=[], title='', figsize=(5, 4)): + """Visulization of SP and SSM + + Notebook: C4/C4S3_ScapePlot.ipynb + + Args: + SP: Scape plot + seg: Segment ``(start_index, end_index)`` + S: Self-similarity matrix + ann: Annotation + color_ann: color scheme used for annotations (Default value = []) + title: Title of figure (Default value = '') + figsize: Figure size (Default value = (5, 4)) + """ + float_box = libfmp.b.FloatingBox() + fig, ax, im = visualize_scape_plot(SP, figsize=figsize, title=title, + xlabel='Center (frames)', ylabel='Length (frames)') + plot_seg_in_sp(ax, seg, S) + float_box.add_fig(fig) + + penalty = np.min(S) + cmap_penalty = libfmp.c4.colormap_penalty(penalty=penalty) + fig, ax, im = libfmp.c4.plot_ssm_ann_optimal_path_family( + S, ann, seg, color_ann=color_ann, fontsize=8, cmap=cmap_penalty, figsize=(4, 4), + ylabel='Time (frames)') + float_box.add_fig(fig) + float_box.show()
+ + +
[docs]def check_segment(seg, S): + """Prints properties of segments with regard to SSM ``S`` + + Notebook: C4/C4S3_ScapePlot.ipynb + + Args: + seg (tuple): Segment ``(start_index, end_index)`` + S (np.ndarray): Self-similarity matrix + + Returns: + path_family (list): Optimal path family + """ + N = S.shape[0] + S_seg = S[:, seg[0]:seg[1]+1] + D, score = libfmp.c4.compute_accumulated_score_matrix(S_seg) + path_family = libfmp.c4.compute_optimal_path_family(D) + fitness, score, score_n, coverage, coverage_n, path_family_length = libfmp.c4.compute_fitness( + path_family, score, N) + segment_family, coverage2 = libfmp.c4.compute_induced_segment_family_coverage(path_family) + print('Segment (alpha):', seg) + print('Length of segment:', seg[-1]-seg[0]+1) + print('Length of feature sequence:', N) + print('Induced segment path family:\n', segment_family) + print('Fitness: %0.10f' % fitness) + print('Score: %0.10f' % score) + print('Normalized score: %0.10f' % score_n) + print('Coverage: %d, %d' % (coverage, coverage2)) + print('Normalized coverage: %0.10f' % coverage_n) + print('Length of all paths of family: %d' % path_family_length) + return path_family
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c4/c4s4_novelty_kernel.html b/docs/build/html/_modules/libfmp/c4/c4s4_novelty_kernel.html new file mode 100644 index 0000000..f58d240 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c4/c4s4_novelty_kernel.html @@ -0,0 +1,312 @@ + + + + + + + + + + libfmp.c4.c4s4_novelty_kernel — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c4.c4s4_novelty_kernel
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c4.c4s4_novelty_kernel

+"""
+Module: libfmp.c4.c4s4_novelty_kernel
+Author: Meinard Müller, Julian Reck
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+from numba import jit
+
+
+
[docs]def compute_kernel_checkerboard_box(L): + """Compute box-like checkerboard kernel [FMP, Section 4.4.1] + + Notebook: C4/C4S4_NoveltySegmentation.ipynb + + Args: + L (int): Parameter specifying the kernel size 2*L+1 + + Returns: + kernel (np.ndarray): Kernel matrix of size (2*L+1) x (2*L+1) + """ + axis = np.arange(-L, L+1) + kernel = np.outer(np.sign(axis), np.sign(axis)) + return kernel
+ + +
[docs]@jit(nopython=True) +def compute_kernel_checkerboard_gaussian(L, var=1.0, normalize=True): + """Compute Guassian-like checkerboard kernel [FMP, Section 4.4.1]. + See also: https://scipython.com/blog/visualizing-the-bivariate-gaussian-distribution/ + + Notebook: C4/C4S4_NoveltySegmentation.ipynb + + Args: + L (int): Parameter specifying the kernel size M=2*L+1 + var (float): Variance parameter determing the tapering (epsilon) (Default value = 1.0) + normalize (bool): Normalize kernel (Default value = True) + + Returns: + kernel (np.ndarray): Kernel matrix of size M x M + """ + taper = np.sqrt(1/2) / (L * var) + axis = np.arange(-L, L+1) + gaussian1D = np.exp(-taper**2 * (axis**2)) + gaussian2D = np.outer(gaussian1D, gaussian1D) + kernel_box = np.outer(np.sign(axis), np.sign(axis)) + kernel = kernel_box * gaussian2D + if normalize: + kernel = kernel / np.sum(np.abs(kernel)) + return kernel
+ + +# @jit(nopython=True) +
[docs]def compute_novelty_ssm(S, kernel=None, L=10, var=0.5, exclude=False): + """Compute novelty function from SSM [FMP, Section 4.4.1] + + Notebook: C4/C4S4_NoveltySegmentation.ipynb + + Args: + S (np.ndarray): SSM + kernel (np.ndarray): Checkerboard kernel (if kernel==None, it will be computed) (Default value = None) + L (int): Parameter specifying the kernel size M=2*L+1 (Default value = 10) + var (float): Variance parameter determing the tapering (epsilon) (Default value = 0.5) + exclude (bool): Sets the first L and last L values of novelty function to zero (Default value = False) + + Returns: + nov (np.ndarray): Novelty function + """ + if kernel is None: + kernel = compute_kernel_checkerboard_gaussian(L=L, var=var) + N = S.shape[0] + M = 2*L + 1 + nov = np.zeros(N) + # np.pad does not work with numba/jit + S_padded = np.pad(S, L, mode='constant') + + for n in range(N): + # Does not work with numba/jit + nov[n] = np.sum(S_padded[n:n+M, n:n+M] * kernel) + if exclude: + right = np.min([L, N]) + left = np.max([0, N-L]) + nov[0:right] = 0 + nov[left:N] = 0 + + return nov
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c4/c4s4_structure_feature.html b/docs/build/html/_modules/libfmp/c4/c4s4_structure_feature.html new file mode 100644 index 0000000..249d45f --- /dev/null +++ b/docs/build/html/_modules/libfmp/c4/c4s4_structure_feature.html @@ -0,0 +1,329 @@ + + + + + + + + + + libfmp.c4.c4s4_structure_feature — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c4.c4s4_structure_feature
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c4.c4s4_structure_feature

+"""
+Module: libfmp.c4.c4s4_structure_feature
+Author: Meinard Müller, Tim Zunner
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+from matplotlib import pyplot as plt
+
+import libfmp.b
+
+
+
[docs]def compute_time_lag_representation(S, circular=True): + """Computation of (circular) time-lag representation + + Notebook: C4/C4S4_StructureFeature.ipynb + + Args: + S (np.ndarray): Self-similarity matrix + circular (bool): Computes circular version (Default value = True) + + Returns: + L (np.ndarray): (Circular) time-lag representation of S + """ + N = S.shape[0] + if circular: + L = np.zeros((N, N)) + for n in range(N): + L[:, n] = np.roll(S[:, n], -n) + else: + L = np.zeros((2*N-1, N)) + for n in range(N): + L[((N-1)-n):((2*N)-1-n), n] = S[:, n] + return L
+ + +
[docs]def novelty_structure_feature(L, padding=True): + """Computation of the novelty function from a circular time-lag representation + + Notebook: C4/C4S4_StructureFeature.ipynb + + Args: + L (np.ndarray): Circular time-lag representation + padding (bool): Padding the result with the value zero (Default value = True) + + Returns: + nov (np.ndarray): Novelty function + """ + N = L.shape[0] + if padding: + nov = np.zeros(N) + else: + nov = np.zeros(N-1) + for n in range(N-1): + nov[n] = np.linalg.norm(L[:, n+1] - L[:, n]) + return nov
+ + +
[docs]def plot_ssm_structure_feature_nov(S, L, nov, Fs=1, figsize=(10, 3), ann=[], color_ann=[]): + """Plotting an SSM, structure features, and a novelty function + + Notebook: C4/C4S4_StructureFeature.ipynb + + Args: + S: SSM + L: Circular time-lag representation + nov: Novelty function + Fs: Feature rate (indicated in title of SSM) (Default value = 1) + figsize: Figure size (Default value = (10, 3)) + ann: Annotations (Default value = []) + color_ann: Colors used for annotations (see :func:`libfmp.b.b_plot.plot_segments`) (Default value = []) + + Returns: + ax1: First subplot + ax2: Second subplot + ax3: Third subplot + """ + plt.figure(figsize=figsize) + ax1 = plt.subplot(131) + if Fs == 1: + title = 'SSM' + else: + title = 'SSM (Fs = %d)' % Fs + fig_im, ax_im, im = libfmp.b.plot_matrix(S, ax=[ax1], title=title, + xlabel='Time (frames)', ylabel='Time (frames)') + if ann: + libfmp.b.plot_segments_overlay(ann, ax=ax_im[0], edgecolor='k', + print_labels=False, colors=color_ann, alpha=0.05) + + ax2 = plt.subplot(132) + fig_im, ax_im, im = libfmp.b.plot_matrix(L, ax=[ax2], title='Structure features', + xlabel='Time (frames)', ylabel='Lag (frames)', colorbar=True) + if ann: + libfmp.b.plot_segments_overlay(ann, ax=ax_im[0], edgecolor='k', ylim=False, + print_labels=False, colors=color_ann, alpha=0.05) + + ax3 = plt.subplot(133) + fig, ax, im = libfmp.b.plot_signal(nov, ax=ax3, title='Novelty function', + xlabel='Time (frames)', color='k') + if ann: + libfmp.b.plot_segments_overlay(ann, ax=ax, edgecolor='k', colors=color_ann, alpha=0.05) + plt.tight_layout() + return ax1, ax2, ax3
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c4/c4s5_evaluation.html b/docs/build/html/_modules/libfmp/c4/c4s5_evaluation.html new file mode 100644 index 0000000..e41a3c7 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c4/c4s5_evaluation.html @@ -0,0 +1,557 @@ + + + + + + + + + + libfmp.c4.c4s5_evaluation — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c4.c4s5_evaluation
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c4.c4s5_evaluation

+"""
+Module: libfmp.c4.c4s5_evaluation
+Author: Meinard Müller, Tim Zunner
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+import matplotlib.pyplot as plt
+from matplotlib.colors import ListedColormap
+
+import libfmp.b
+
+
+
[docs]def measure_prf(num_TP, num_FN, num_FP): + """Compute P, R, and F from size of TP, FN, and FP [FMP, Section 4.5.1] + + Notebook: C4/C4S5_Evaluation.ipynb + + Args: + num_TP (int): True positives + num_FN (int): False negative + num_FP (int): False positives + + Returns: + P (float): Precision + R (float): Recall + F (float): F-measure + """ + P = num_TP / (num_TP + num_FP) + R = num_TP / (num_TP + num_FN) + if (P + R) > 0: + F = 2 * P * R / (P + R) + else: + F = 0 + return P, R, F
+ + +
[docs]def measure_prf_sets(I, I_ref_pos, I_est_pos, details=False): + """Compute P, R, and F from sets I, I_ref_pos, I_est_pos [FMP, Section 4.5.1] + + Notebook: C4/C4S5_Evaluation.ipynb + + Args: + I: Set of items + I_ref_pos: Reference set of positive items + I_est_pos: Set of items being estimated as positive + details: Print details (Default value = False) + + Returns: + P (float): Precision + R (float): Recall + F (float): F-measure + """ + I_ref_neg = I.difference(I_ref_pos) + I_est_neg = I.difference(I_est_pos) + TP = I_est_pos.intersection(I_ref_pos) + FN = I_est_neg.intersection(I_ref_pos) + FP = I_est_pos.intersection(I_ref_neg) + P, R, F = measure_prf(len(TP), len(FN), len(FP)) + if details: + print('TP = ', TP, '; FN = ', FN, '; FP = ', FP) + print('P = %0.3f; R = %0.3f; F = %0.3f' % (P, R, F)) + return P, R, F
+ + +
[docs]def convert_ann_to_seq_label(ann): + """Convert structure annotation with integer time positions (given in indices) + into label sequence + + Notebook: C4/C4S5_Evaluation.ipynb + + Args: + ann (list): Annotation (list ``[[s, t, 'label'], ...]``, with ``s``, ``t`` being integers) + + Returns: + X (list): Sequencs of labels + """ + X = [] + for seg in ann: + K = seg[1] - seg[0] + for k in range(K): + X.append(seg[2]) + return X
+ + +
[docs]def plot_seq_label(ax, X, Fs=1, color_label=[], direction='horizontal', + fontsize=10, time_axis=False, print_labels=True): + """Plot label sequence in the style of annotations + + Notebook: C4/C4S5_Evaluation.ipynb + + Args: + ax: Axis used for plotting + X: Label sequence + Fs: Sampling rate (Default value = 1) + color_label: List of colors for labels (Default value = []) + direction: Parameter used for :func:`libfmp.b.b_plot.plot_segments` (Default value = 'horizontal') + fontsize: Parameter used for :func:`libfmp.b.b_plot.plot_segments` (Default value = 10) + time_axis: Parameter used for :func:`libfmp.b.b_plot.plot_segments` (Default value = False) + print_labels: Parameter used for :func:`libfmp.b.b_plot.plot_segments` (Default value = True) + + Returns: + ann_X: Structure annotation for label sequence + """ + ann_X = [] + for m in range(len(X)): + ann_X.append([(m-0.5)/Fs, (m+0.5)/Fs, X[m]]) + libfmp.b.plot_segments(ann_X, ax=ax, time_axis=time_axis, fontsize=fontsize, + direction=direction, colors=color_label, print_labels=print_labels) + return ann_X
+ + +
[docs]def compare_pairwise(X): + """Compute set of positive items from label sequence [FMP, Section 4.5.3] + + Notebook: C4/C4S5_Evaluation.ipynb + + Args: + X (list or np.ndarray): Label sequence + + Returns: + I_pos (np.ndarray): Set of positive items + """ + N = len(X) + I_pos = np.zeros((N, N)) + for n in range(1, N): + for m in range(n): + if X[n] is X[m]: + I_pos[n, m] = 1 + return I_pos
+ + +
[docs]def evaluate_pairwise(I_ref_pos, I_est_pos): + """Compute pairwise evaluation measures [FMP, Section 4.5.3] + + Notebook: C4/C4S5_Evaluation.ipynb + + Args: + I_ref_pos (np.ndarray): Referenence set of positive items + I_est_pos (np.ndarray): Set of items being estimated as positive + + Returns: + P (float): Precision + R (float): Recall + F (float): F-measure + num_TP (int): Number of true positives + num_FN (int): Number of false negatives + num_FP (int): Number of false positives + I_eval (np.ndarray): Data structure encoding TP, FN, FP + """ + I_eval = np.zeros(I_ref_pos.shape) + TP = (I_ref_pos + I_est_pos) > 1 + FN = (I_ref_pos - I_est_pos) > 0 + FP = (I_ref_pos - I_est_pos) < 0 + I_eval[TP] = 1 + I_eval[FN] = 2 + I_eval[FP] = 3 + num_TP = np.sum(TP) + num_FN = np.sum(FN) + num_FP = np.sum(FP) + P, R, F = measure_prf(num_TP, num_FN, num_FP) + return P, R, F, num_TP, num_FN, num_FP, I_eval
+ + +
[docs]def plot_matrix_label(M, X, color_label=None, figsize=(3, 3), cmap='gray_r', fontsize=8, print_labels=True): + """Plot matrix and label sequence + + Notebook: C4/C4S5_Evaluation.ipynb + + Args: + M: Matrix + X: Label sequence + color_label: List of colors for labels (Default value = None) + figsize: Figure size (Default value = (3, 3)) + cmap: Colormap for imshow (Default value = 'gray_r') + fontsize: Font size (Default value = 8) + print_labels: Display labels inside Rectangles (Default value = True) + + Returns: + fig: Handle for figure + ax: Handle for axes + """ + fig, ax = plt.subplots(2, 3, gridspec_kw={'width_ratios': [0.1, 1, 0.05], + 'wspace': 0.2, 'height_ratios': [1, 0.1]}, + figsize=figsize) + + colorList = np.array([[1, 1, 1, 1], [0, 0, 0, 0.7]]) + cmap = ListedColormap(colorList) + im = ax[0, 1].imshow(M, aspect='auto', cmap=cmap, origin='lower') + im.set_clim(vmin=-0.5, vmax=1.5) + ax_cb = plt.colorbar(im, cax=ax[0, 2]) + ax_cb.set_ticks(np.arange(0, 2, 1)) + ax_cb.set_ticklabels(np.arange(0, 2, 1)) + ax[0, 1].set_xticks([]) + ax[0, 1].set_yticks([]) + plot_seq_label(ax[1, 1], X, color_label=color_label, fontsize=fontsize, print_labels=print_labels) + ax[1, 2].axis('off'), ax[1, 0].axis('off') + plot_seq_label(ax[0, 0], X, color_label=color_label, fontsize=fontsize, print_labels=print_labels, + direction='vertical') + return fig, ax
+ + +
[docs]def plot_matrix_pairwise(I_eval, figsize=(3, 2.5)): + """Plot matrix I_eval encoding TP, FN, FP (see :func:`libfmp.c4.c4s5_evaluation.evaluate_pairwise`) + + Notebook: C4/C4S5_Evaluation.ipynb + + Args: + I_eval: Data structure encoding TP, FN, FP + figsize: Figure size (Default value = (3, 2.5)) + + Returns: + fig: Handle for figure + im: Handle for imshow + """ + fig = plt.figure(figsize=figsize) + colorList = np.array([[1, 1, 1, 1], [0, 0.7, 0, 1], [1, 0, 0, 1], [1, 0.5, 0.5, 1]]) + cmap = ListedColormap(colorList) + im = plt.imshow(I_eval, aspect='auto', cmap=cmap, origin='lower') + im.set_clim(vmin=-0.5, vmax=3.5) + plt.xticks([]) + plt.yticks([]) + ax_cb = plt.colorbar(im) + ax_cb.set_ticks(np.arange(0, 4, 1)) + ax_cb.set_ticklabels(['', 'TP', 'FN', 'FP']) + return fig, im
+ + +
[docs]def evaluate_boundary(B_ref, B_est, tau): + """Compute boundary evaluation measures [FMP, Section 4.5.4] + + Notebook: C4/C4S5_Evaluation.ipynb + + Args: + B_ref (np.ndarray): Reference boundary annotations + B_est (np.ndarray): Estimated boundary annotations + tau (int): Tolerance parameter. + Note: Condition ``|b_{k+1}-b_k|>2tau`` should be fulfilled [FMP, Eq. 4.58] + + Returns: + P (float): Precision + R (float): Recall + F (float): F-measure + num_TP (int): Number of true positives + num_FN (int): Number of false negatives + num_FP (int): Number of false positives + B_tol (np.ndarray): Data structure encoding B_ref with tolerance + I_eval (np.ndarray): Data structure encoding TP, FN, FP + """ + N = len(B_ref) + num_TP = 0 + num_FN = 0 + num_FP = 0 + B_tol = np.zeros((np.array([B_ref])).shape) + B_eval = np.zeros((np.array([B_ref])).shape) + for n in range(N): + min_idx = max(0, n - tau) + max_idx = min(N - 1, n + tau) + if B_ref[n] == 1: + B_tol[:, min_idx:max_idx+1] = 2 + B_tol[:, n] = 1 + temp = sum(B_est[min_idx:max_idx+1]) + if temp > 0: + num_TP += temp + else: + num_FN += 1 + B_eval[:, n] = 2 + if B_est[n] == 1: + if sum(B_ref[min_idx:max_idx+1]) == 0: + num_FP += 1 + B_eval[:, n] = 3 + else: + B_eval[:, n] = 1 + P, R, F = measure_prf(num_TP, num_FN, num_FP) + return P, R, F, num_TP, num_FN, num_FP, B_tol, B_eval
+ + +
[docs]def plot_boundary_measures(B_ref, B_est, tau, figsize=(8, 2.5)): + """Plot B_ref and B_est (see :func:`libfmp.c4.c4s5_evaluation.evaluate_boundary`) + + Notebook: C4/C4S5_Evaluation.ipynb + + Args: + B_ref: Reference boundary annotations + B_est: Estimated boundary annotations + tau: Tolerance parameter + figsize: Figure size (Default value = (8, 2.5)) + + Returns: + fig: Handle for figure + ax: Handle for axes + """ + P, R, F, num_TP, num_FN, num_FP, B_tol, B_eval = evaluate_boundary(B_ref, B_est, tau) + + colorList = np.array([[1., 1., 1., 1.], [0., 0., 0., 1.], [0.7, 0.7, 0.7, 1.]]) + cmap_tol = ListedColormap(colorList) + colorList = np.array([[1, 1, 1, 1], [0, 0.7, 0, 1], [1, 0, 0, 1], [1, 0.5, 0.5, 1]]) + cmap_measures = ListedColormap(colorList) + + fig, ax = plt.subplots(3, 2, gridspec_kw={'width_ratios': [1, 0.02], + 'wspace': 0.2, 'height_ratios': [1, 1, 1]}, + figsize=figsize) + + im = ax[0, 0].imshow(B_tol, cmap=cmap_tol) + ax[0, 0].set_title('Reference boundaries (with tolerance)') + im.set_clim(vmin=-0.5, vmax=2.5) + ax[0, 0].set_xticks([]) + ax[0, 0].set_yticks([]) + ax_cb = plt.colorbar(im, cax=ax[0, 1]) + ax_cb.set_ticks(np.arange(0, 3, 1)) + ax_cb.set_ticklabels(['', 'Positive', 'Tolerance']) + + im = ax[1, 0].imshow(np.array([B_est]), cmap=cmap_tol) + ax[1, 0].set_title('Estimated boundaries') + im.set_clim(vmin=-0.5, vmax=2.5) + ax[1, 0].set_xticks([]) + ax[1, 0].set_yticks([]) + ax_cb = plt.colorbar(im, cax=ax[1, 1]) + ax_cb.set_ticks(np.arange(0, 3, 1)) + ax_cb.set_ticklabels(['', 'Positive', 'Tolerance']) + + im = ax[2, 0].imshow(B_eval, cmap_measures) + ax[2, 0].set_title('Evaluation') + im.set_clim(vmin=-0.5, vmax=3.5) + ax[2, 0].set_xticks([]) + ax[2, 0].set_yticks([]) + ax_cb = plt.colorbar(im, cax=ax[2, 1]) + ax_cb.set_ticks(np.arange(0, 4, 1)) + ax_cb.set_ticklabels(['', 'TP', 'FN', 'FP']) + plt.show() + return fig, ax
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c5/c5s1_basic_theory_harmony.html b/docs/build/html/_modules/libfmp/c5/c5s1_basic_theory_harmony.html new file mode 100644 index 0000000..9339af8 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c5/c5s1_basic_theory_harmony.html @@ -0,0 +1,282 @@ + + + + + + + + + + libfmp.c5.c5s1_basic_theory_harmony — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c5.c5s1_basic_theory_harmony
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c5.c5s1_basic_theory_harmony

+"""
+Module: libfmp.c5.c5s1_basic_theory_harmony
+Author: Meinard Müller, Christof Weiss
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+
+import numpy as np
+
+
+
[docs]def generate_sinusoid_scale(pitches=[69], duration=0.5, Fs=4000, amplitude_max=0.5): + """Generate synthetic sound of scale using sinusoids + + Notebook: C5/C5S1_Scales_CircleFifth.ipynb + + Args: + pitches (list): List of pitchs (MIDI note numbers) (Default value = [69]) + duration (float): Duration (seconds) (Default value = 0.5) + Fs (scalar): Sampling rate (Default value = 4000) + amplitude_max (float): Amplitude (Default value = 0.5) + + Returns: + x (np.ndarray): Synthesized signal + """ + N = int(duration * Fs) + t = np.arange(0, N) / Fs + x = [] + for p in pitches: + omega = 2 ** ((p - 69) / 12) * 440 + x = np.append(x, np.sin(2 * np.pi * omega * t)) + x = amplitude_max * x / np.max(x) + return x
+ + +
[docs]def generate_sinusoid_chord(pitches=[69], duration=1, Fs=4000, amplitude_max=0.5): + """Generate synthetic sound of chord using sinusoids + + Notebook: C5/C5S1_Chords.ipynb + + Args: + pitches (list): List of pitches (MIDI note numbers) (Default value = [69]) + duration (float): Duration (seconds) (Default value = 1) + Fs (scalar): Sampling rate (Default value = 4000) + amplitude_max (float): Amplitude (Default value = 0.5) + + Returns: + x (np.ndarray): Synthesized signal + """ + N = int(duration * Fs) + t = np.arange(0, N) / Fs + x = np.zeros(N) + for p in pitches: + omega = 2 ** ((p - 69) / 12) * 440 + x = x + np.sin(2 * np.pi * omega * t) + x = amplitude_max * x / np.max(x) + return x
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c5/c5s2_chord_rec_template.html b/docs/build/html/_modules/libfmp/c5/c5s2_chord_rec_template.html new file mode 100644 index 0000000..3692615 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c5/c5s2_chord_rec_template.html @@ -0,0 +1,571 @@ + + + + + + + + + + libfmp.c5.c5s2_chord_rec_template — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c5.c5s2_chord_rec_template
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c5.c5s2_chord_rec_template

+"""
+Module: libfmp.c5.c5s2_chord_rec_template
+Author: Meinard Müller, Christof Weiss
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+
+import copy
+import numpy as np
+from matplotlib import pyplot as plt
+from matplotlib import colors
+import librosa
+
+import libfmp.c3
+import libfmp.c4
+
+
+
[docs]def compute_chromagram_from_filename(fn_wav, Fs=22050, N=4096, H=2048, gamma=None, version='STFT', norm='2'): + """Compute chromagram for WAV file specified by filename + + Notebook: C5/C5S2_ChordRec_Templates.ipynb + + Args: + fn_wav (str): Filenname of WAV + Fs (scalar): Sampling rate (Default value = 22050) + N (int): Window size (Default value = 4096) + H (int): Hop size (Default value = 2048) + gamma (float): Constant for logarithmic compression (Default value = None) + version (str): Technique used for front-end decomposition ('STFT', 'IIS', 'CQT') (Default value = 'STFT') + norm (str): If not 'None', chroma vectors are normalized by norm as specified ('1', '2', 'max') + (Default value = '2') + + Returns: + X (np.ndarray): Chromagram + Fs_X (scalar): Feature reate of chromagram + x (np.ndarray): Audio signal + Fs (scalar): Sampling rate of audio signal + x_dur (float): Duration (seconds) of audio signal + """ + x, Fs = librosa.load(fn_wav, sr=Fs) + x_dur = x.shape[0] / Fs + if version == 'STFT': + # Compute chroma features with STFT + X = librosa.stft(x, n_fft=N, hop_length=H, pad_mode='constant', center=True) + if gamma is not None: + X = np.log(1 + gamma * np.abs(X) ** 2) + else: + X = np.abs(X) ** 2 + X = librosa.feature.chroma_stft(S=X, sr=Fs, tuning=0, norm=None, hop_length=H, n_fft=N) + if version == 'CQT': + # Compute chroma features with CQT decomposition + X = librosa.feature.chroma_cqt(y=x, sr=Fs, hop_length=H, norm=None) + if version == 'IIR': + # Compute chroma features with filter bank (using IIR elliptic filter) + X = librosa.iirt(y=x, sr=Fs, win_length=N, hop_length=H, center=True, tuning=0.0) + if gamma is not None: + X = np.log(1.0 + gamma * X) + X = librosa.feature.chroma_cqt(C=X, bins_per_octave=12, n_octaves=7, + fmin=librosa.midi_to_hz(24), norm=None) + if norm is not None: + X = libfmp.c3.normalize_feature_sequence(X, norm='2') + Fs_X = Fs / H + return X, Fs_X, x, Fs, x_dur
+ + +
[docs]def plot_chromagram_annotation(ax, X, Fs_X, ann, color_ann, x_dur, cmap='gray_r', title=''): + """Plot chromagram and annotation + + Notebook: C5/C5S2_ChordRec_Templates.ipynb + + Args: + ax: Axes handle + X: Feature representation + Fs_X: Feature rate + ann: Annotations + color_ann: Color for annotations + x_dur: Duration of feature representation + cmap: Color map for imshow (Default value = 'gray_r') + title: Title for figure (Default value = '') + """ + libfmp.b.plot_chromagram(X, Fs=Fs_X, ax=ax, + chroma_yticks=[0, 4, 7, 11], clim=[0, 1], cmap=cmap, + title=title, ylabel='Chroma', colorbar=True) + libfmp.b.plot_segments_overlay(ann, ax=ax[0], time_max=x_dur, + print_labels=False, colors=color_ann, alpha=0.1)
+ + +
[docs]def get_chord_labels(ext_minor='m', nonchord=False): + """Generate chord labels for major and minor triads (and possibly nonchord label) + + Notebook: C5/C5S2_ChordRec_Templates.ipynb + + Args: + ext_minor (str): Extension for minor chords (Default value = 'm') + nonchord (bool): If "True" then add nonchord label (Default value = False) + + Returns: + chord_labels (list): List of chord labels + """ + chroma_labels = ['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'A#', 'B'] + chord_labels_maj = chroma_labels + chord_labels_min = [s + ext_minor for s in chroma_labels] + chord_labels = chord_labels_maj + chord_labels_min + if nonchord is True: + chord_labels = chord_labels + ['N'] + return chord_labels
+ + +
[docs]def generate_chord_templates(nonchord=False): + """Generate chord templates of major and minor triads (and possibly nonchord) + + Notebook: C5/C5S2_ChordRec_Templates.ipynb + + Args: + nonchord (bool): If "True" then add nonchord template (Default value = False) + + Returns: + chord_templates (np.ndarray): Matrix containing chord_templates as columns + """ + template_cmaj = np.array([1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0]).T + template_cmin = np.array([1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0]).T + num_chord = 24 + if nonchord: + num_chord = 25 + chord_templates = np.ones((12, num_chord)) + for shift in range(12): + chord_templates[:, shift] = np.roll(template_cmaj, shift) + chord_templates[:, shift+12] = np.roll(template_cmin, shift) + return chord_templates
+ + +
[docs]def chord_recognition_template(X, norm_sim='1', nonchord=False): + """Conducts template-based chord recognition + with major and minor triads (and possibly nonchord) + + Notebook: C5/C5S2_ChordRec_Templates.ipynb + + Args: + X (np.ndarray): Chromagram + norm_sim (str): Specifies norm used for normalizing chord similarity matrix (Default value = '1') + nonchord (bool): If "True" then add nonchord template (Default value = False) + + Returns: + chord_sim (np.ndarray): Chord similarity matrix + chord_max (np.ndarray): Binarized chord similarity matrix only containing maximizing chord + """ + chord_templates = generate_chord_templates(nonchord=nonchord) + X_norm = libfmp.c3.normalize_feature_sequence(X, norm='2') + chord_templates_norm = libfmp.c3.normalize_feature_sequence(chord_templates, norm='2') + chord_sim = np.matmul(chord_templates_norm.T, X_norm) + if norm_sim is not None: + chord_sim = libfmp.c3.normalize_feature_sequence(chord_sim, norm=norm_sim) + # chord_max = (chord_sim == chord_sim.max(axis=0)).astype(int) + chord_max_index = np.argmax(chord_sim, axis=0) + chord_max = np.zeros(chord_sim.shape).astype(np.int32) + for n in range(chord_sim.shape[1]): + chord_max[chord_max_index[n], n] = 1 + + return chord_sim, chord_max
+ + +
[docs]def convert_chord_label(ann): + """Replace for segment-based annotation in each chord label the string ':min' by 'm' + and convert flat chords into sharp chords using enharmonic equivalence + + Notebook: C5/C5S2_ChordRec_Eval.ipynb + + Args: + ann (list): Segment-based annotation with chord labels + + Returns: + ann_conv (list): Converted segment-based annotation with chord labels + """ + ann_conv = copy.deepcopy(ann) + + for k in range(len(ann)): + ann_conv[k][2] = ann_conv[k][2].replace(':min', 'm') + ann_conv[k][2] = ann_conv[k][2].replace('Db', 'C#') + ann_conv[k][2] = ann_conv[k][2].replace('Eb', 'D#') + ann_conv[k][2] = ann_conv[k][2].replace('Gb', 'F#') + ann_conv[k][2] = ann_conv[k][2].replace('Ab', 'G#') + ann_conv[k][2] = ann_conv[k][2].replace('Bb', 'A#') + return ann_conv
+ + +
[docs]def convert_sequence_ann(seq, Fs=1): + """Convert label sequence into segment-based annotation + + Notebook: C5/C5S2_ChordRec_Eval.ipynb + + Args: + seq (list): Label sequence + Fs (scalar): Feature rate (Default value = 1) + + Returns: + ann (list): Segment-based annotation for label sequence + """ + ann = [] + for m in range(len(seq)): + ann.append([(m-0.5) / Fs, (m+0.5) / Fs, seq[m]]) + return ann
+ + +
[docs]def convert_chord_ann_matrix(fn_ann, chord_labels, Fs=1, N=None, last=False): + """Convert segment-based chord annotation into various formats + + Notebook: C5/C5S2_ChordRec_Eval.ipynb + + Args: + fn_ann (str): Filename of segment-based chord annotation + chord_labels (list): List of chord labels + Fs (scalar): Feature rate (Default value = 1) + N (int): Number of frames to be generated (by cutting or extending). + Only enforced for ann_matrix, ann_frame, ann_seg_frame (Default value = None) + last (bool): If 'True' uses for extension last chord label, otherwise uses nonchord label 'N' + (Default value = False) + + Returns: + ann_matrix (np.ndarray): Encoding of label sequence in form of a binary time-chord representation + ann_frame (list): Label sequence (specified on the frame level) + ann_seg_frame (list): Encoding of label sequence as segment-based annotation (given in indices) + ann_seg_ind (list): Segment-based annotation with segments (given in indices) + ann_seg_sec (list): Segment-based annotation with segments (given in seconds) + """ + ann_seg_sec, _ = libfmp.c4.read_structure_annotation(fn_ann) + ann_seg_sec = convert_chord_label(ann_seg_sec) + ann_seg_ind, _ = libfmp.c4.read_structure_annotation(fn_ann, Fs=Fs, index=True) + ann_seg_ind = convert_chord_label(ann_seg_ind) + + ann_frame = libfmp.c4.convert_ann_to_seq_label(ann_seg_ind) + if N is None: + N = len(ann_frame) + if N < len(ann_frame): + ann_frame = ann_frame[:N] + if N > len(ann_frame): + if last: + pad_symbol = ann_frame[-1] + else: + pad_symbol = 'N' + ann_frame = ann_frame + [pad_symbol] * (N-len(ann_frame)) + ann_seg_frame = convert_sequence_ann(ann_frame, Fs=1) + + num_chords = len(chord_labels) + ann_matrix = np.zeros((num_chords, N)) + for n in range(N): + label = ann_frame[n] + # Generates a one-entry only for labels that are contained in "chord_labels" + if label in chord_labels: + label_index = chord_labels.index(label) + ann_matrix[label_index, n] = 1 + return ann_matrix, ann_frame, ann_seg_frame, ann_seg_ind, ann_seg_sec
+ + +
[docs]def compute_eval_measures(I_ref, I_est): + """Compute evaluation measures including precision, recall, and F-measure + + Notebook: C5/C5S2_ChordRec_Eval.ipynb + + Args: + I_ref (np.ndarray): Reference set of items + I_est (np.ndarray): Set of estimated items + + Returns: + P (float): Precision + R (float): Recall + F (float): F-measure + num_TP (int): Number of true positives + num_FN (int): Number of false negatives + num_FP (int): Number of false positives + """ + assert I_ref.shape == I_est.shape, "Dimension of input matrices must agree" + TP = np.sum(np.logical_and(I_ref, I_est)) + FP = np.sum(I_est > 0, axis=None) - TP + FN = np.sum(I_ref > 0, axis=None) - TP + P = 0 + R = 0 + F = 0 + if TP > 0: + P = TP / (TP + FP) + R = TP / (TP + FN) + F = 2 * P * R / (P + R) + return P, R, F, TP, FP, FN
+ + +
[docs]def plot_matrix_chord_eval(I_ref, I_est, Fs=1, xlabel='Time (seconds)', ylabel='Chord', + title='', chord_labels=None, ax=None, grid=True, figsize=(9, 3.5)): + """Plots TP-, FP-, and FN-items in a color-coded form in time–chord grid + + Notebook: C5/C5S2_ChordRec_Eval.ipynb + + Args: + I_ref: Reference set of items + I_est: Set of estimated items + Fs: Feature rate (Default value = 1) + xlabel: Label for x-axis (Default value = 'Time (seconds)') + ylabel: Label for y-axis (Default value = 'Chord') + title: Title of figure (Default value = '') + chord_labels: List of chord labels used for vertical axis (Default value = None) + ax: Array of axes (Default value = None) + grid: If "True" the plot grid (Default value = True) + figsize: Size of figure (if axes are not specified) (Default value = (9, 3.5)) + + Returns: + fig: The created matplotlib figure or None if ax was given. + ax: The used axes + im: The image plot + """ + fig = None + if ax is None: + fig, ax = plt.subplots(1, 1, figsize=figsize) + ax = [ax] + I_TP = np.sum(np.logical_and(I_ref, I_est)) + I_FP = I_est - I_TP + I_FN = I_ref - I_TP + I_vis = 3 * I_TP + 2 * I_FN + 1 * I_FP + + eval_cmap = colors.ListedColormap([[1, 1, 1], [1, 0.3, 0.3], [1, 0.7, 0.7], [0, 0, 0]]) + eval_bounds = np.array([0, 1, 2, 3, 4])-0.5 + eval_norm = colors.BoundaryNorm(eval_bounds, 4) + eval_ticks = [0, 1, 2, 3] + + T_coef = np.arange(I_vis.shape[1]) / Fs + F_coef = np.arange(I_vis.shape[0]) + x_ext1 = (T_coef[1] - T_coef[0]) / 2 + x_ext2 = (T_coef[-1] - T_coef[-2]) / 2 + y_ext1 = (F_coef[1] - F_coef[0]) / 2 + y_ext2 = (F_coef[-1] - F_coef[-2]) / 2 + extent = [T_coef[0] - x_ext1, T_coef[-1] + x_ext2, F_coef[0] - y_ext1, F_coef[-1] + y_ext2] + + im = ax[0].imshow(I_vis, origin='lower', aspect='auto', cmap=eval_cmap, norm=eval_norm, extent=extent) + if len(ax) == 2: + cbar = plt.colorbar(im, cax=ax[1], cmap=eval_cmap, norm=eval_norm, boundaries=eval_bounds, ticks=eval_ticks) + elif len(ax) == 1: + plt.sca(ax[0]) + cbar = plt.colorbar(im, cmap=eval_cmap, norm=eval_norm, boundaries=eval_bounds, ticks=eval_ticks) + cbar.ax.set_yticklabels(['TN', 'FP', 'FN', 'TP']) + ax[0].set_xlabel(xlabel) + ax[0].set_ylabel(ylabel) + ax[0].set_title(title) + if chord_labels is not None: + ax[0].set_yticks(np.arange(len(chord_labels))) + ax[0].set_yticklabels(chord_labels) + if grid is True: + ax[0].grid() + return fig, ax, im
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c5/c5s3_chord_rec_hmm.html b/docs/build/html/_modules/libfmp/c5/c5s3_chord_rec_hmm.html new file mode 100644 index 0000000..a9c1095 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c5/c5s3_chord_rec_hmm.html @@ -0,0 +1,605 @@ + + + + + + + + + + libfmp.c5.c5s3_chord_rec_hmm — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c5.c5s3_chord_rec_hmm
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c5.c5s3_chord_rec_hmm

+"""
+Module: libfmp.c5.c5s3_chord_rec_hmm
+Author: Meinard Müller, Christof Weiss
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+
+import numpy as np
+from sklearn.preprocessing import normalize
+from scipy.linalg import circulant
+from numba import jit
+from matplotlib import pyplot as plt
+
+import libfmp.c3
+from libfmp.c5 import get_chord_labels
+
+
+
[docs]def generate_sequence_hmm(N, A, C, B, details=False): + """Generate observation and state sequence from given HMM + + Notebook: C5/C5S3_HiddenMarkovModel.ipynb + + Args: + N (int): Number of observations to be generated + A (np.ndarray): State transition probability matrix of dimension I x I + C (np.ndarray): Initial state distribution of dimension I + B (np.ndarray): Output probability matrix of dimension I x K + details (bool): If "True" then shows details (Default value = False) + + Returns: + O (np.ndarray): Observation sequence of length N + S (np.ndarray): State sequence of length N + """ + assert N > 0, "N should be at least one" + I = A.shape[1] + K = B.shape[1] + assert I == A.shape[0], "A should be an I-square matrix" + assert I == C.shape[0], "Dimension of C should be I" + assert I == B.shape[0], "Column-dimension of B should be I" + + O = np.zeros(N, int) + S = np.zeros(N, int) + for n in range(N): + if n == 0: + i = np.random.choice(np.arange(I), p=C) + else: + i = np.random.choice(np.arange(I), p=A[i, :]) + k = np.random.choice(np.arange(K), p=B[i, :]) + S[n] = i + O[n] = k + if details: + print('n = %d, S[%d] = %d, O[%d] = %d' % (n, n, S[n], n, O[n])) + return O, S
+ + +
[docs]def estimate_hmm_from_o_s(O, S, I, K): + """Estimate the state transition and output probability matrices from + a given observation and state sequence + + Notebook: C5/C5S3_HiddenMarkovModel.ipynb + + Args: + O (np.ndarray): Observation sequence of length N + S (np.ndarray): State sequence of length N + I (int): Number of states + K (int): Number of observation symbols + + Returns: + A_est (np.ndarray): State transition probability matrix of dimension I x I + B_est (np.ndarray): Output probability matrix of dimension I x K + """ + # Estimate A + A_est = np.zeros([I, I]) + N = len(S) + for n in range(N-1): + i = S[n] + j = S[n+1] + A_est[i, j] += 1 + A_est = normalize(A_est, axis=1, norm='l1') + + # Estimate B + B_est = np.zeros([I, K]) + for i in range(I): + for k in range(K): + B_est[i, k] = np.sum(np.logical_and(S == i, O == k)) + B_est = normalize(B_est, axis=1, norm='l1') + return A_est, B_est
+ + +
[docs]@jit(nopython=True) +def viterbi(A, C, B, O): + """Viterbi algorithm for solving the uncovering problem + + Notebook: C5/C5S3_Viterbi.ipynb + + Args: + A (np.ndarray): State transition probability matrix of dimension I x I + C (np.ndarray): Initial state distribution of dimension I + B (np.ndarray): Output probability matrix of dimension I x K + O (np.ndarray): Observation sequence of length N + + Returns: + S_opt (np.ndarray): Optimal state sequence of length N + D (np.ndarray): Accumulated probability matrix + E (np.ndarray): Backtracking matrix + """ + I = A.shape[0] # Number of states + N = len(O) # Length of observation sequence + + # Initialize D and E matrices + D = np.zeros((I, N)) + E = np.zeros((I, N-1)).astype(np.int32) + D[:, 0] = np.multiply(C, B[:, O[0]]) + + # Compute D and E in a nested loop + for n in range(1, N): + for i in range(I): + temp_product = np.multiply(A[:, i], D[:, n-1]) + D[i, n] = np.max(temp_product) * B[i, O[n]] + E[i, n-1] = np.argmax(temp_product) + + # Backtracking + S_opt = np.zeros(N).astype(np.int32) + S_opt[-1] = np.argmax(D[:, -1]) + for n in range(N-2, -1, -1): + S_opt[n] = E[int(S_opt[n+1]), n] + + return S_opt, D, E
+ + +
[docs]@jit(nopython=True) +def viterbi_log(A, C, B, O): + """Viterbi algorithm (log variant) for solving the uncovering problem + + Notebook: C5/C5S3_Viterbi.ipynb + + Args: + A (np.ndarray): State transition probability matrix of dimension I x I + C (np.ndarray): Initial state distribution of dimension I + B (np.ndarray): Output probability matrix of dimension I x K + O (np.ndarray): Observation sequence of length N + + Returns: + S_opt (np.ndarray): Optimal state sequence of length N + D_log (np.ndarray): Accumulated log probability matrix + E (np.ndarray): Backtracking matrix + """ + I = A.shape[0] # Number of states + N = len(O) # Length of observation sequence + tiny = np.finfo(0.).tiny + A_log = np.log(A + tiny) + C_log = np.log(C + tiny) + B_log = np.log(B + tiny) + + # Initialize D and E matrices + D_log = np.zeros((I, N)) + E = np.zeros((I, N-1)).astype(np.int32) + D_log[:, 0] = C_log + B_log[:, O[0]] + + # Compute D and E in a nested loop + for n in range(1, N): + for i in range(I): + temp_sum = A_log[:, i] + D_log[:, n-1] + D_log[i, n] = np.max(temp_sum) + B_log[i, O[n]] + E[i, n-1] = np.argmax(temp_sum) + + # Backtracking + S_opt = np.zeros(N).astype(np.int32) + S_opt[-1] = np.argmax(D_log[:, -1]) + for n in range(N-2, -1, -1): + S_opt[n] = E[int(S_opt[n+1]), n] + + return S_opt, D_log, E
+ + +
[docs]def plot_transition_matrix(A, log=True, ax=None, figsize=(6, 5), title='', + xlabel='State (chord label)', ylabel='State (chord label)', + cmap='gray_r', quadrant=False): + """Plot a transition matrix for 24 chord models (12 major and 12 minor triads) + + Notebook: C5/C5S3_ChordRec_HMM.ipynb + + Args: + A: Transition matrix + log: Show log probabilities (Default value = True) + ax: Axis (Default value = None) + figsize: Width, height in inches (only used when ax=None) (Default value = (6, 5)) + title: Title for plot (Default value = '') + xlabel: Label for x-axis (Default value = 'State (chord label)') + ylabel: Label for y-axis (Default value = 'State (chord label)') + cmap: Color map (Default value = 'gray_r') + quadrant: Plots additional lines for C-major and C-minor quadrants (Default value = False) + + Returns: + fig: The created matplotlib figure or None if ax was given. + ax: The used axes. + im: The image plot + """ + fig = None + if ax is None: + fig, ax = plt.subplots(1, 1, figsize=figsize) + ax = [ax] + + if log is True: + A_plot = np.log(A) + cbar_label = 'Log probability' + clim = [-6, 0] + else: + A_plot = A + cbar_label = 'Probability' + clim = [0, 1] + im = ax[0].imshow(A_plot, origin='lower', aspect='equal', cmap=cmap) + im.set_clim(clim) + plt.sca(ax[0]) + cbar = plt.colorbar(im) + ax[0].set_xlabel(xlabel) + ax[0].set_ylabel(ylabel) + ax[0].set_title(title) + cbar.ax.set_ylabel(cbar_label) + + chord_labels = get_chord_labels() + chord_labels_squeezed = chord_labels.copy() + for k in [1, 3, 6, 8, 10, 11, 13, 15, 17, 18, 20, 22]: + chord_labels_squeezed[k] = '' + + ax[0].set_xticks(np.arange(24)) + ax[0].set_yticks(np.arange(24)) + ax[0].set_xticklabels(chord_labels_squeezed) + ax[0].set_yticklabels(chord_labels) + + if quadrant is True: + ax[0].axvline(x=11.5, ymin=0, ymax=24, linewidth=2, color='r') + ax[0].axhline(y=11.5, xmin=0, xmax=24, linewidth=2, color='r') + + return fig, ax, im
+ + +
[docs]def matrix_circular_mean(A): + """Computes circulant matrix with mean diagonal sums + + Notebook: C5/C5S3_ChordRec_HMM.ipynb + + Args: + A (np.ndarray): Square matrix + + Returns: + A_mean (np.ndarray): Circulant output matrix + """ + N = A.shape[0] + A_shear = np.zeros((N, N)) + for n in range(N): + A_shear[:, n] = np.roll(A[:, n], -n) + circ_sum = np.sum(A_shear, axis=1) + A_mean = circulant(circ_sum) / N + return A_mean
+ + +
[docs]def matrix_chord24_trans_inv(A): + """Computes transposition-invariant matrix for transition matrix + based 12 major chords and 12 minor chords + + Notebook: C5/C5S3_ChordRec_HMM.ipynb + + Args: + A (np.ndarray): Input transition matrix + + Returns: + A_ti (np.ndarray): Output transition matrix + """ + A_ti = np.zeros(A.shape) + A_ti[0:12, 0:12] = matrix_circular_mean(A[0:12, 0:12]) + A_ti[0:12, 12:24] = matrix_circular_mean(A[0:12, 12:24]) + A_ti[12:24, 0:12] = matrix_circular_mean(A[12:24, 0:12]) + A_ti[12:24, 12:24] = matrix_circular_mean(A[12:24, 12:24]) + return A_ti
+ + +
[docs]def uniform_transition_matrix(p=0.01, N=24): + """Computes uniform transition matrix + + Notebook: C5/C5S3_ChordRec_HMM.ipynb + + Args: + p (float): Self transition probability (Default value = 0.01) + N (int): Column and row dimension (Default value = 24) + + Returns: + A (np.ndarray): Output transition matrix + """ + off_diag_entries = (1-p) / (N-1) # rows should sum up to 1 + A = off_diag_entries * np.ones([N, N]) + np.fill_diagonal(A, p) + return A
+ + +
[docs]@jit(nopython=True) +def viterbi_log_likelihood(A, C, B_O): + """Viterbi algorithm (log variant) for solving the uncovering problem + + Notebook: C5/C5S3_Viterbi.ipynb + + Args: + A (np.ndarray): State transition probability matrix of dimension I x I + C (np.ndarray): Initial state distribution of dimension I + B_O (np.ndarray): Likelihood matrix of dimension I x N + + Returns: + S_opt (np.ndarray): Optimal state sequence of length N + S_mat (np.ndarray): Binary matrix representation of optimal state sequence + D_log (np.ndarray): Accumulated log probability matrix + E (np.ndarray): Backtracking matrix + """ + I = A.shape[0] # Number of states + N = B_O.shape[1] # Length of observation sequence + tiny = np.finfo(0.).tiny + A_log = np.log(A + tiny) + C_log = np.log(C + tiny) + B_O_log = np.log(B_O + tiny) + + # Initialize D and E matrices + D_log = np.zeros((I, N)) + E = np.zeros((I, N-1)).astype(np.int32) + D_log[:, 0] = C_log + B_O_log[:, 0] + + # Compute D and E in a nested loop + for n in range(1, N): + for i in range(I): + temp_sum = A_log[:, i] + D_log[:, n-1] + D_log[i, n] = np.max(temp_sum) + B_O_log[i, n] + E[i, n-1] = np.argmax(temp_sum) + + # Backtracking + S_opt = np.zeros(N).astype(np.int32) + S_opt[-1] = np.argmax(D_log[:, -1]) + for n in range(N-2, -1, -1): + S_opt[n] = E[int(S_opt[n+1]), n] + + # Matrix representation of result + S_mat = np.zeros((I, N)).astype(np.int32) + for n in range(N): + S_mat[S_opt[n], n] = 1 + + return S_mat, S_opt, D_log, E
+ + +
[docs]def chord_recognition_all(X, ann_matrix, p=0.15, filt_len=None, filt_type='mean'): + """Conduct template- and HMM-based chord recognition and evaluates the approaches + + Notebook: C5/C5S3_ChordRec_Beatles.ipynb + + Args: + X (np.ndarray): Chromagram + ann_matrix (np.ndarray): Reference annotation as given as time-chord binary matrix + p (float): Self-transition probability used for HMM (Default value = 0.15) + filt_len (int): Filter length used for prefilitering (Default value = None) + filt_type (str): Filter type used for prefilitering (Default value = 'mean') + + Returns: + result_Tem (tuple): Chord recogntion evaluation results ([P, R, F, TP, FP, FN]) for template-based approach + result_HMM (tuple): Chord recogntion evaluation results ([P, R, F, TP, FP, FN]) for HMM-based approach + chord_Tem (np.ndarray): Template-based chord recogntion result given as binary matrix + chord_HMM (np.ndarray): HMM-based chord recogntion result given as binary matrix + chord_sim (np.ndarray): Chord similarity matrix + """ + if filt_len is not None: + if filt_type == 'mean': + X, Fs_X = libfmp.c3.smooth_downsample_feature_sequence(X, Fs=1, filt_len=filt_len, down_sampling=1) + if filt_type == 'median': + X, Fs_X = libfmp.c3.median_downsample_feature_sequence(X, Fs=1, filt_len=filt_len, down_sampling=1) + # Template-based chord recogntion + chord_sim, chord_Tem = libfmp.c5.chord_recognition_template(X, norm_sim='1') + result_Tem = libfmp.c5.compute_eval_measures(ann_matrix, chord_Tem) + # HMM-based chord recogntion + A = libfmp.c5.uniform_transition_matrix(p=p) + C = 1 / 24 * np.ones((1, 24)) + B_O = chord_sim + chord_HMM, _, _, _ = libfmp.c5.viterbi_log_likelihood(A, C, B_O) + result_HMM = libfmp.c5.compute_eval_measures(ann_matrix, chord_HMM) + return result_Tem, result_HMM, chord_Tem, chord_HMM, chord_sim
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c6/c6s1_onset_detection.html b/docs/build/html/_modules/libfmp/c6/c6s1_onset_detection.html new file mode 100644 index 0000000..93478f7 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c6/c6s1_onset_detection.html @@ -0,0 +1,526 @@ + + + + + + + + + + libfmp.c6.c6s1_onset_detection — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c6.c6s1_onset_detection
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c6.c6s1_onset_detection

+"""
+Module: libfmp.c6.c6s1_onset_detection
+Author: Meinard Müller, Angel Villar-Corrales
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+
+import numpy as np
+from numba import jit
+from scipy import signal
+from scipy.interpolate import interp1d
+from scipy import ndimage
+import librosa
+import libfmp.b
+
+
+
[docs]def read_annotation_pos(fn_ann, label='', header=True, print_table=False): + """Read and convert file containing either list of pairs (number,label) or list of (number) + + Notebook: C6/C6S1_OnsetDetection.ipynb + + Args: + fn_ann (str): Name of file + label (str): Name of label (Default value = '') + header (bool): Assumes header (True) or not (False) (Default value = True) + print_table (bool): Prints table if True (Default value = False) + + Returns: + ann (list): List of annotations + label_keys (dict): Dictionaries specifying color and line style used for labels + """ + df = libfmp.b.read_csv(fn_ann, header=header) + if print_table: + print(df) + num_col = df.values[0].shape[0] + if num_col == 1: + df = df.assign(label=[label] * len(df.index)) + ann = df.values.tolist() + + label_keys = {'beat': {'linewidth': 2, 'linestyle': ':', 'color': 'r'}, + 'onset': {'linewidth': 1, 'linestyle': ':', 'color': 'r'}} + return ann, label_keys
+ + +
[docs]def compute_novelty_energy(x, Fs=1, N=2048, H=128, gamma=10.0, norm=True): + """Compute energy-based novelty function + + Notebook: C6/C6S1_NoveltyEnergy.ipynb + + Args: + x (np.ndarray): Signal + Fs (scalar): Sampling rate (Default value = 1) + N (int): Window size (Default value = 2048) + H (int): Hope size (Default value = 128) + gamma (float): Parameter for logarithmic compression (Default value = 10.0) + norm (bool): Apply max norm (if norm==True) (Default value = True) + + Returns: + novelty_energy (np.ndarray): Energy-based novelty function + Fs_feature (scalar): Feature rate + """ + # x_power = x**2 + w = signal.hann(N) + Fs_feature = Fs / H + energy_local = np.convolve(x**2, w**2, 'same') + energy_local = energy_local[::H] + if gamma is not None: + energy_local = np.log(1 + gamma * energy_local) + energy_local_diff = np.diff(energy_local) + energy_local_diff = np.concatenate((energy_local_diff, np.array([0]))) + novelty_energy = np.copy(energy_local_diff) + novelty_energy[energy_local_diff < 0] = 0 + if norm: + max_value = max(novelty_energy) + if max_value > 0: + novelty_energy = novelty_energy / max_value + return novelty_energy, Fs_feature
+ + +
[docs]@jit(nopython=True) +def compute_local_average(x, M): + """Compute local average of signal + + Notebook: C6/C6S1_NoveltySpectral.ipynb + + Args: + x (np.ndarray): Signal + M (int): Determines size (2M+1) in samples of centric window used for local average + + Returns: + local_average (np.ndarray): Local average signal + """ + L = len(x) + local_average = np.zeros(L) + for m in range(L): + a = max(m - M, 0) + b = min(m + M + 1, L) + local_average[m] = (1 / (2 * M + 1)) * np.sum(x[a:b]) + return local_average
+ + +
[docs]def compute_novelty_spectrum(x, Fs=1, N=1024, H=256, gamma=100.0, M=10, norm=True): + """Compute spectral-based novelty function + + Notebook: C6/C6S1_NoveltySpectral.ipynb + + Args: + x (np.ndarray): Signal + Fs (scalar): Sampling rate (Default value = 1) + N (int): Window size (Default value = 1024) + H (int): Hope size (Default value = 256) + gamma (float): Parameter for logarithmic compression (Default value = 100.0) + M (int): Size (frames) of local average (Default value = 10) + norm (bool): Apply max norm (if norm==True) (Default value = True) + + Returns: + novelty_spectrum (np.ndarray): Energy-based novelty function + Fs_feature (scalar): Feature rate + """ + X = librosa.stft(x, n_fft=N, hop_length=H, win_length=N, window='hanning') + Fs_feature = Fs / H + Y = np.log(1 + gamma * np.abs(X)) + Y_diff = np.diff(Y) + Y_diff[Y_diff < 0] = 0 + novelty_spectrum = np.sum(Y_diff, axis=0) + novelty_spectrum = np.concatenate((novelty_spectrum, np.array([0.0]))) + if M > 0: + local_average = compute_local_average(novelty_spectrum, M) + novelty_spectrum = novelty_spectrum - local_average + novelty_spectrum[novelty_spectrum < 0] = 0.0 + if norm: + max_value = max(novelty_spectrum) + if max_value > 0: + novelty_spectrum = novelty_spectrum / max_value + return novelty_spectrum, Fs_feature
+ + +
[docs]def principal_argument(v): + """Principal argument function + + | Notebook: C6/C6S1_NoveltyPhase.ipynb, see also + | Notebook: C8/C8S2_InstantFreqEstimation.ipynb + + Args: + v (float or np.ndarray): Value (or vector of values) + + Returns: + w (float or np.ndarray): Principle value of v + """ + w = np.mod(v + 0.5, 1) - 0.5 + return w
+ + +
[docs]def compute_novelty_phase(x, Fs=1, N=1024, H=64, M=40, norm=True): + """Compute phase-based novelty function + + Notebook: C6/C6S1_NoveltyPhase.ipynb + + Args: + x (np.ndarray): Signal + Fs (scalar): Sampling rate (Default value = 1) + N (int): Window size (Default value = 1024) + H (int): Hop size (Default value = 64) + M (int): Determines size (2M+1) in samples of centric window used for local average (Default value = 40) + norm (bool): Apply max norm (if norm==True) (Default value = True) + + Returns: + novelty_phase (np.ndarray): Energy-based novelty function + Fs_feature (scalar): Feature rate + """ + X = librosa.stft(x, n_fft=N, hop_length=H, win_length=N, window='hanning') + Fs_feature = Fs / H + phase = np.angle(X) / (2*np.pi) + phase_diff = principal_argument(np.diff(phase, axis=1)) + phase_diff2 = principal_argument(np.diff(phase_diff, axis=1)) + novelty_phase = np.sum(np.abs(phase_diff2), axis=0) + novelty_phase = np.concatenate((novelty_phase, np.array([0, 0]))) + if M > 0: + local_average = compute_local_average(novelty_phase, M) + novelty_phase = novelty_phase - local_average + novelty_phase[novelty_phase < 0] = 0 + if norm: + max_value = np.max(novelty_phase) + if max_value > 0: + novelty_phase = novelty_phase / max_value + return novelty_phase, Fs_feature
+ + +
[docs]def compute_novelty_complex(x, Fs=1, N=1024, H=64, gamma=10.0, M=40, norm=True): + """Compute complex-domain novelty function + + Notebook: C6/C6S1_NoveltyComplex.ipynb + + Args: + x (np.ndarray): Signal + Fs (scalar): Sampling rate (Default value = 1) + N (int): Window size (Default value = 1024) + H (int): Hop size (Default value = 64) + gamma (float): Parameter for logarithmic compression (Default value = 10.0) + M (int): Determines size (2M+1) in samples of centric window used for local average (Default value = 40) + norm (bool): Apply max norm (if norm==True) (Default value = True) + + Returns: + novelty_complex (np.ndarray): Energy-based novelty function + Fs_feature (scalar): Feature rate + """ + X = librosa.stft(x, n_fft=N, hop_length=H, win_length=N, window='hanning') + Fs_feature = Fs / H + mag = np.abs(X) + if gamma > 0: + mag = np.log(1 + gamma * mag) + phase = np.angle(X) / (2*np.pi) + phase_diff = np.diff(phase, axis=1) + phase_diff = np.concatenate((phase_diff, np.zeros((phase.shape[0], 1))), axis=1) + X_hat = mag * np.exp(2*np.pi*1j*(phase+phase_diff)) + X_prime = np.abs(X_hat - X) + X_plus = np.copy(X_prime) + for n in range(1, X.shape[0]): + idx = np.where(mag[n, :] < mag[n-1, :]) + X_plus[n, idx] = 0 + novelty_complex = np.sum(X_plus, axis=0) + if M > 0: + local_average = compute_local_average(novelty_complex, M) + novelty_complex = novelty_complex - local_average + novelty_complex[novelty_complex < 0] = 0 + if norm: + max_value = np.max(novelty_complex) + if max_value > 0: + novelty_complex = novelty_complex / max_value + return novelty_complex, Fs_feature
+ + +
[docs]def resample_signal(x_in, Fs_in, Fs_out=100, norm=True, time_max_sec=None, sigma=None): + """Resample and smooth signal + + Notebook: C6/C6S1_NoveltyComparison.ipynb + + Args: + x_in (np.ndarray): Input signal + Fs_in (scalar): Sampling rate of input signal + Fs_out (scalar): Sampling rate of output signal (Default value = 100) + norm (bool): Apply max norm (if norm==True) (Default value = True) + time_max_sec (float): Duration of output signal (given in seconds) (Default value = None) + sigma (float): Standard deviation for smoothing Gaussian kernel (Default value = None) + + Returns: + x_out (np.ndarray): Output signal + Fs_out (scalar): Feature rate of output signal + """ + if sigma is not None: + x_in = ndimage.gaussian_filter(x_in, sigma=sigma) + T_coef_in = np.arange(x_in.shape[0]) / Fs_in + time_in_max_sec = T_coef_in[-1] + if time_max_sec is None: + time_max_sec = time_in_max_sec + N_out = int(np.ceil(time_max_sec*Fs_out)) + T_coef_out = np.arange(N_out) / Fs_out + if T_coef_out[-1] > time_in_max_sec: + x_in = np.append(x_in, [0]) + T_coef_in = np.append(T_coef_in, [T_coef_out[-1]]) + x_out = interp1d(T_coef_in, x_in, kind='linear')(T_coef_out) + if norm: + x_max = max(x_out) + if x_max > 0: + x_out = x_out / max(x_out) + return x_out, Fs_out
+ + +
[docs]def average_nov_dic(nov_dic, time_max_sec, Fs_out=100, norm=True, sigma=None): + """Average respamples set of novelty functions + + Notebook: C6/C6S1_NoveltyComparison.ipynb + + Args: + nov_dic (dict): Dictionary of novelty functions + time_max_sec (float): Duration of output signals (given in seconds) + Fs_out (scalar): Sampling rate of output signal (Default value = 100) + norm (bool): Apply max norm (if norm==True) (Default value = True) + sigma (float): Standard deviation for smoothing Gaussian kernel (Default value = None) + + Returns: + nov_matrix (np.ndarray): Matrix containing resampled output signal (last one is average) + Fs_out (scalar): Sampling rate of output signals + """ + nov_num = len(nov_dic) + N_out = int(np.ceil(time_max_sec*Fs_out)) + nov_matrix = np.zeros([nov_num + 1, N_out]) + for k in range(nov_num): + nov = nov_dic[k][0] + Fs_nov = nov_dic[k][1] + nov_out, Fs_out = resample_signal(nov, Fs_in=Fs_nov, Fs_out=Fs_out, + time_max_sec=time_max_sec, sigma=sigma) + nov_matrix[k, :] = nov_out + nov_average = np.sum(nov_matrix, axis=0)/nov_num + if norm: + max_value = np.max(nov_average) + if max_value > 0: + nov_average = nov_average / max_value + nov_matrix[k+1, :] = nov_average + return nov_matrix, Fs_out
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c6/c6s1_peak_picking.html b/docs/build/html/_modules/libfmp/c6/c6s1_peak_picking.html new file mode 100644 index 0000000..41936db --- /dev/null +++ b/docs/build/html/_modules/libfmp/c6/c6s1_peak_picking.html @@ -0,0 +1,468 @@ + + + + + + + + + + libfmp.c6.c6s1_peak_picking — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c6.c6s1_peak_picking
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c6.c6s1_peak_picking

+"""
+Module: libfmp.c6.c6s1_peak_picking
+Author: Angel Villar Corrales, Meinard Mueller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+
+import numpy as np
+from scipy.ndimage import filters
+
+
+
[docs]def peak_picking_simple(x, threshold=None): + """Peak picking strategy looking for positions with increase followed by descrease + + Notebook: C6/C6S1_PeakPicking.ipynb + + Args: + x (np.ndarray): Input function + threshold (float): Lower threshold for peak to survive + + Returns: + peaks (np.ndarray): Array containing peak positions + """ + peaks = [] + if threshold is None: + threshold = np.min(x) - 1 + for i in range(1, x.shape[0] - 1): + if x[i - 1] < x[i] and x[i] > x[i + 1]: + if x[i] >= threshold: + peaks.append(i) + peaks = np.array(peaks) + return peaks
+ + +
[docs]def peak_picking_boeck(activations, threshold=0.5, fps=100, include_scores=False, combine=False, + pre_avg=12, post_avg=6, pre_max=6, post_max=6): + """Detects peaks. + + | Implements the peak-picking method described in: + | "Evaluating the Online Capabilities of Onset Detection Methods" + | Sebastian Boeck, Florian Krebs and Markus Schedl + | Proceedings of the 13th International Society for Music Information Retrieval Conference (ISMIR), 2012 + + Modified by Jan Schlueter, 2014-04-24 + + Args: + activations (np.nadarray): Vector of activations to process + threshold (float): Threshold for peak-picking (Default value = 0.5) + fps (scalar): Frame rate of onset activation function in Hz (Default value = 100) + include_scores (bool): Include activation for each returned peak (Default value = False) + combine (bool): Only report 1 onset for N seconds (Default value = False) + pre_avg (float): Use N past seconds for moving average (Default value = 12) + post_avg (float): Use N future seconds for moving average (Default value = 6) + pre_max (float): Use N past seconds for moving maximum (Default value = 6) + post_max (float): Use N future seconds for moving maximum (Default value = 6) + + Returns: + peaks (np.ndarray): Peak positions + """ + + import scipy.ndimage.filters as sf + activations = activations.ravel() + + # detections are activations equal to the moving maximum + max_length = int((pre_max + post_max) * fps) + 1 + if max_length > 1: + max_origin = int((pre_max - post_max) * fps / 2) + mov_max = sf.maximum_filter1d(activations, max_length, mode='constant', origin=max_origin) + detections = activations * (activations == mov_max) + else: + detections = activations + + # detections must be greater than or equal to the moving average + threshold + avg_length = int((pre_avg + post_avg) * fps) + 1 + if avg_length > 1: + avg_origin = int((pre_avg - post_avg) * fps / 2) + mov_avg = sf.uniform_filter1d(activations, avg_length, mode='constant', origin=avg_origin) + detections = detections * (detections >= mov_avg + threshold) + else: + # if there is no moving average, treat the threshold as a global one + detections = detections * (detections >= threshold) + + # convert detected onsets to a list of timestamps + if combine: + stamps = [] + last_onset = 0 + for i in np.nonzero(detections)[0]: + # only report an onset if the last N frames none was reported + if i > last_onset + combine: + stamps.append(i) + # save last reported onset + last_onset = i + stamps = np.array(stamps) + else: + stamps = np.where(detections)[0] + + # include corresponding activations per peak if needed + if include_scores: + scores = activations[stamps] + if avg_length > 1: + scores -= mov_avg[stamps] + return stamps / float(fps), scores + else: + return stamps / float(fps)
+ + +
[docs]def peak_picking_roeder(x, direction=None, abs_thresh=None, rel_thresh=None, descent_thresh=None, tmin=None, tmax=None): + """| Computes the positive peaks of the input vector x + | Python adaption from the Matlab Roeder_Peak_Picking script peaks.m from the internal Sync Toolbox + | reckjn 2017 + + Args: + x (np.nadarray): Signal to be searched for (positive) peaks + direction (int): +1 for forward peak searching, -1 for backward peak searching. + default is dir == -1. (Default value = None) + abs_thresh (float): Absolute threshold signal, i.e. only peaks + satisfying x(i)>=abs_thresh(i) will be reported. + abs_thresh must have the same number of samples as x. + a sensible choice for this parameter would be a global or local + average or median of the signal x. + If omitted, half the median of x will be used. (Default value = None) + rel_thresh (float): Relative threshold signal. Only peak positions i with an + uninterrupted positive ascent before position i of at least + rel_thresh(i) and a possibly interrupted (see parameter descent_thresh) + descent of at least rel_thresh(i) will be reported. + rel_thresh must have the same number of samples as x. + A sensible choice would be some measure related to the + global or local variance of the signal x. + if omitted, half the standard deviation of W will be used. + descent_thresh (float): Descent threshold. during peak candidate verfication, if a slope change + from negative to positive slope occurs at sample i BEFORE the descent has + exceeded rel_thresh(i), and if descent_thresh(i) has not been exceeded yet, + the current peak candidate will be dropped. + this situation corresponds to a secondary peak + occuring shortly after the current candidate peak (which might lead + to a higher peak value)! + | + | The value descent_thresh(i) must not be larger than rel_thresh(i). + | + | descent_thresh must have the same number of samples as x. + a sensible choice would be some measure related to the + global or local variance of the signal x. + if omitted, 0.5*rel_thresh will be used. (Default value = None) + tmin (int): Index of start sample. peak search will begin at x(tmin). (Default value = None) + tmax (int): Index of end sample. peak search will end at x(tmax). (Default value = None) + + Returns: + peaks (np.nadarray): Array of peak positions + """ + + # set default values + if direction is None: + direction = -1 + if abs_thresh is None: + abs_thresh = np.tile(0.5*np.median(x), len(x)) + if rel_thresh is None: + rel_thresh = 0.5*np.tile(np.sqrt(np.var(x)), len(x)) + if descent_thresh is None: + descent_thresh = 0.5*rel_thresh + if tmin is None: + tmin = 1 + if tmax is None: + tmax = len(x) + + dyold = 0 + dy = 0 + rise = 0 # current amount of ascent during a rising portion of the signal x + riseold = 0 # accumulated amount of ascent from the last rising portion of x + descent = 0 # current amount of descent (<0) during a falling portion of the signal x + searching_peak = True + candidate = 1 + P = [] + + if direction == 1: + my_range = np.arange(tmin, tmax) + elif direction == -1: + my_range = np.arange(tmin, tmax) + my_range = my_range[::-1] + + # run through x + for cur_idx in my_range: + # get local gradient + dy = x[cur_idx+direction] - x[cur_idx] + + if (dy >= 0): + rise = rise + dy + else: + descent = descent + dy + + if (dyold >= 0): + if (dy < 0): # slope change positive->negative + if (rise >= rel_thresh[cur_idx] and searching_peak is True): + candidate = cur_idx + searching_peak = False + riseold = rise + rise = 0 + else: # dyold < 0 + if (dy < 0): # in descent + if (descent <= -rel_thresh[candidate] and searching_peak is False): + if (x[candidate] >= abs_thresh[candidate]): + P.append(candidate) # verified candidate as True peak + searching_peak = True + else: # dy >= 0 slope change negative->positive + if searching_peak is False: # currently verifying a peak + if (x[candidate] - x[cur_idx] <= descent_thresh[cur_idx]): + rise = riseold + descent # skip intermediary peak + if (descent <= -rel_thresh[candidate]): + if x[candidate] >= abs_thresh[candidate]: + P.append(candidate) # verified candidate as True peak + searching_peak = True + descent = 0 + dyold = dy + peaks = np.array(P) + return peaks
+ + +
[docs]def peak_picking_MSAF(x, median_len=16, offset_rel=0.05, sigma=4.0): + """Peak picking strategy following MSFA using an adaptive threshold (https://github.com/urinieto/msaf) + + Notebook: C6/C6S1_PeakPicking.ipynb + + Args: + x (np.ndarray): Input function + median_len (int): Length of media filter used for adaptive thresholding (Default value = 16) + offset_rel (float): Additional offset used for adaptive thresholding (Default value = 0.05) + sigma (float): Variance for Gaussian kernel used for smoothing the novelty function (Default value = 4.0) + + Returns: + peaks (np.ndarray): Peak positions + x (np.ndarray): Local threshold + threshold_local (np.ndarray): Filtered novelty curve + """ + offset = x.mean() * offset_rel + x = filters.gaussian_filter1d(x, sigma=sigma) + threshold_local = filters.median_filter(x, size=median_len) + offset + peaks = [] + for i in range(1, x.shape[0] - 1): + if x[i - 1] < x[i] and x[i] > x[i + 1]: + if x[i] > threshold_local[i]: + peaks.append(i) + peaks = np.array(peaks) + return peaks, x, threshold_local
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c6/c6s2_tempo_analysis.html b/docs/build/html/_modules/libfmp/c6/c6s2_tempo_analysis.html new file mode 100644 index 0000000..3a704d8 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c6/c6s2_tempo_analysis.html @@ -0,0 +1,586 @@ + + + + + + + + + + libfmp.c6.c6s2_tempo_analysis — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c6.c6s2_tempo_analysis
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c6.c6s2_tempo_analysis

+"""
+Module: libfmp.c6.c6s2_tempo_analysis
+Author: Meinard Müller, Angel Villar-Corrales
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+import librosa
+from scipy import signal
+from scipy.interpolate import interp1d
+from matplotlib import pyplot as plt
+from numba import jit
+import IPython.display as ipd
+
+import libfmp.b
+import libfmp.c6
+
+
+
[docs]@jit(nopython=True) +def compute_tempogram_fourier(x, Fs, N, H, Theta=np.arange(30, 601, 1)): + """Compute Fourier-based tempogram [FMP, Section 6.2.2] + + Notebook: C6/C6S2_TempogramFourier.ipynb + + Args: + x (np.ndarray): Input signal + Fs (scalar): Sampling rate + N (int): Window length + H (int): Hop size + Theta (np.ndarray): Set of tempi (given in BPM) (Default value = np.arange(30, 601, 1)) + + Returns: + X (np.ndarray): Tempogram + T_coef (np.ndarray): Time axis (seconds) + F_coef_BPM (np.ndarray): Tempo axis (BPM) + """ + win = np.hanning(N) + N_left = N // 2 + L = x.shape[0] + L_left = N_left + L_right = N_left + L_pad = L + L_left + L_right + # x_pad = np.pad(x, (L_left, L_right), 'constant') # doesn't work with jit + x_pad = np.concatenate((np.zeros(L_left), x, np.zeros(L_right))) + t_pad = np.arange(L_pad) + M = int(np.floor(L_pad - N) / H) + 1 + K = len(Theta) + X = np.zeros((K, M), dtype=np.complex_) + + for k in range(K): + omega = (Theta[k] / 60) / Fs + exponential = np.exp(-2 * np.pi * 1j * omega * t_pad) + x_exp = x_pad * exponential + for n in range(M): + t_0 = n * H + t_1 = t_0 + N + X[k, n] = np.sum(win * x_exp[t_0:t_1]) + T_coef = np.arange(M) * H / Fs + F_coef_BPM = Theta + return X, T_coef, F_coef_BPM
+ + +
[docs]def compute_sinusoid_optimal(c, tempo, n, Fs, N, H): + """Compute windowed sinusoid with optimal phase + + Notebook: C6/C6S2_TempogramFourier.ipynb + + Args: + c (complex): Coefficient of tempogram (c=X(k,n)) + tempo (float): Tempo parameter corresponding to c (tempo=F_coef_BPM[k]) + n (int): Frame parameter of c + Fs (scalar): Sampling rate + N (int): Window length + H (int): Hop size + + Returns: + kernel (np.ndarray): Windowed sinusoid + t_kernel (np.ndarray): Time axis (samples) of kernel + t_kernel_sec (np.ndarray): Time axis (seconds) of kernel + """ + win = np.hanning(N) + N_left = N // 2 + omega = (tempo / 60) / Fs + t_0 = n * H + t_1 = t_0 + N + phase = - np.angle(c) / (2 * np.pi) + t_kernel = np.arange(t_0, t_1) + kernel = win * np.cos(2 * np.pi * (t_kernel*omega - phase)) + t_kernel_sec = (t_kernel - N_left) / Fs + return kernel, t_kernel, t_kernel_sec
+ + +
[docs]def plot_signal_kernel(x, t_x, kernel, t_kernel, xlim=None, figsize=(8, 2), title=None): + """Visualize signal and local kernel + + Notebook: C6/C6S2_TempogramFourier.ipynb + + Args: + x: Signal + t_x: Time axis of x (given in seconds) + kernel: Local kernel + t_kernel: Time axis of kernel (given in seconds) + xlim: Limits for x-axis (Default value = None) + figsize: Figure size (Default value = (8, 2)) + title: Title of figure (Default value = None) + + Returns: + fig: Matplotlib figure handle + """ + if xlim is None: + xlim = [t_x[0], t_x[-1]] + fig = plt.figure(figsize=figsize) + plt.plot(t_x, x, 'k') + plt.plot(t_kernel, kernel, 'r') + plt.title(title) + plt.xlim(xlim) + plt.tight_layout() + return fig
+ + +# @jit(nopython=True) # not possible because of np.correlate with mode='full' +
[docs]def compute_autocorrelation_local(x, Fs, N, H, norm_sum=True): + """Compute local autocorrelation [FMP, Section 6.2.3] + + Notebook: C6/C6S2_TempogramAutocorrelation.ipynb + + Args: + x (np.ndarray): Input signal + Fs (scalar): Sampling rate + N (int): Window length + H (int): Hop size + norm_sum (bool): Normalizes by the number of summands in local autocorrelation (Default value = True) + + Returns: + A (np.ndarray): Time-lag representation + T_coef (np.ndarray): Time axis (seconds) + F_coef_lag (np.ndarray): Lag axis + """ + # L = len(x) + L_left = round(N / 2) + L_right = L_left + x_pad = np.concatenate((np.zeros(L_left), x, np.zeros(L_right))) + L_pad = len(x_pad) + M = int(np.floor(L_pad - N) / H) + 1 + A = np.zeros((N, M)) + win = np.ones(N) + if norm_sum is True: + lag_summand_num = np.arange(N, 0, -1) + for n in range(M): + t_0 = n * H + t_1 = t_0 + N + x_local = win * x_pad[t_0:t_1] + r_xx = np.correlate(x_local, x_local, mode='full') + r_xx = r_xx[N-1:] + if norm_sum is True: + r_xx = r_xx / lag_summand_num + A[:, n] = r_xx + Fs_A = Fs / H + T_coef = np.arange(A.shape[1]) / Fs_A + F_coef_lag = np.arange(N) / Fs + return A, T_coef, F_coef_lag
+ + +
[docs]def plot_signal_local_lag(x, t_x, local_lag, t_local_lag, lag, xlim=None, figsize=(8, 1.5), title=''): + """Visualize signal and local lag [FMP, Figure 6.14] + + Notebook: C6/C6S2_TempogramAutocorrelation.ipynb + + Args: + x: Signal + t_x: Time axis of x (given in seconds) + local_lag: Local lag + t_local_lag: Time axis of kernel (given in seconds) + lag: Lag (given in seconds) + xlim: Limits for x-axis (Default value = None) + figsize: Figure size (Default value = (8, 1.5)) + title: Title of figure (Default value = '') + + Returns: + fig: Matplotlib figure handle + """ + if xlim is None: + xlim = [t_x[0], t_x[-1]] + fig = plt.figure(figsize=figsize) + plt.plot(t_x, x, 'k:', linewidth=0.5) + plt.plot(t_local_lag, local_lag, 'k', linewidth=3.0) + plt.plot(t_local_lag+lag, local_lag, 'r', linewidth=2) + plt.title(title) + plt.ylim([0, 1.1 * np.max(x)]) + plt.xlim(xlim) + plt.tight_layout() + return fig
+ + +# @jit(nopython=True) +
[docs]def compute_tempogram_autocorr(x, Fs, N, H, norm_sum=False, Theta=np.arange(30, 601)): + """Compute autocorrelation-based tempogram + + Notebook: C6/C6S2_TempogramAutocorrelation.ipynb + + Args: + x (np.ndarray): Input signal + Fs (scalar): Sampling rate + N (int): Window length + H (int): Hop size + norm_sum (bool): Normalizes by the number of summands in local autocorrelation (Default value = False) + Theta (np.ndarray): Set of tempi (given in BPM) (Default value = np.arange(30, 601)) + + Returns: + tempogram (np.ndarray): Tempogram tempogram + T_coef (np.ndarray): Time axis T_coef (seconds) + F_coef_BPM (np.ndarray): Tempo axis F_coef_BPM (BPM) + A_cut (np.ndarray): Time-lag representation A_cut (cut according to Theta) + F_coef_lag_cut (np.ndarray): Lag axis F_coef_lag_cut + """ + tempo_min = Theta[0] + tempo_max = Theta[-1] + lag_min = int(np.ceil(Fs * 60 / tempo_max)) + lag_max = int(np.ceil(Fs * 60 / tempo_min)) + A, T_coef, F_coef_lag = compute_autocorrelation_local(x, Fs, N, H, norm_sum=norm_sum) + A_cut = A[lag_min:lag_max+1, :] + F_coef_lag_cut = F_coef_lag[lag_min:lag_max+1] + F_coef_BPM_cut = 60 / F_coef_lag_cut + F_coef_BPM = Theta + tempogram = interp1d(F_coef_BPM_cut, A_cut, kind='linear', + axis=0, fill_value='extrapolate')(F_coef_BPM) + return tempogram, T_coef, F_coef_BPM, A_cut, F_coef_lag_cut
+ + +
[docs]def compute_cyclic_tempogram(tempogram, F_coef_BPM, tempo_ref=30, + octave_bin=40, octave_num=4): + """Compute cyclic tempogram + + Notebook: C6/C6S2_TempogramCyclic.ipynb + + Args: + tempogram (np.ndarray): Input tempogram + F_coef_BPM (np.ndarray): Tempo axis (BPM) + tempo_ref (float): Reference tempo (BPM) (Default value = 30) + octave_bin (int): Number of bins per tempo octave (Default value = 40) + octave_num (int): Number of tempo octaves to be considered (Default value = 4) + + Returns: + tempogram_cyclic (np.ndarray): Cyclic tempogram tempogram_cyclic + F_coef_scale (np.ndarray): Tempo axis with regard to scaling parameter + tempogram_log (np.ndarray): Tempogram with logarithmic tempo axis + F_coef_BPM_log (np.ndarray): Logarithmic tempo axis (BPM) + """ + F_coef_BPM_log = tempo_ref * np.power(2, np.arange(0, octave_num*octave_bin)/octave_bin) + F_coef_scale = np.power(2, np.arange(0, octave_bin)/octave_bin) + tempogram_log = interp1d(F_coef_BPM, tempogram, kind='linear', axis=0, fill_value='extrapolate')(F_coef_BPM_log) + K = len(F_coef_BPM_log) + tempogram_cyclic = np.zeros((octave_bin, tempogram.shape[1])) + for m in np.arange(octave_bin): + tempogram_cyclic[m, :] = np.mean(tempogram_log[m:K:octave_bin, :], axis=0) + return tempogram_cyclic, F_coef_scale, tempogram_log, F_coef_BPM_log
+ + +
[docs]def set_yticks_tempogram_cyclic(ax, octave_bin, F_coef_scale, num_tick=5): + """Set yticks with regard to scaling parmater + + Notebook: C6/C6S2_TempogramCyclic.ipynb + + Args: + ax (mpl.axes.Axes): Figure axis + octave_bin (int): Number of bins per tempo octave + F_coef_scale (np.ndarra): Tempo axis with regard to scaling parameter + num_tick (int): Number of yticks (Default value = 5) + """ + yticks = np.arange(0, octave_bin, octave_bin // num_tick) + ax.set_yticks(yticks) + ax.set_yticklabels(F_coef_scale[yticks].astype((np.unicode_, 4)))
+ + +
[docs]@jit(nopython=True) +def compute_plp(X, Fs, L, N, H, Theta): + """Compute windowed sinusoid with optimal phase + + Notebook: C6/C6S3_PredominantLocalPulse.ipynb + + Args: + X (np.ndarray): Fourier-based (complex-valued) tempogram + Fs (scalar): Sampling rate + L (int): Length of novelty curve + N (int): Window length + H (int): Hop size + Theta (np.ndarray): Set of tempi (given in BPM) + + Returns: + nov_PLP (np.ndarray): PLP function + """ + win = np.hanning(N) + N_left = N // 2 + L_left = N_left + L_right = N_left + L_pad = L + L_left + L_right + nov_PLP = np.zeros(L_pad) + M = X.shape[1] + tempogram = np.abs(X) + for n in range(M): + k = np.argmax(tempogram[:, n]) + tempo = Theta[k] + omega = (tempo / 60) / Fs + c = X[k, n] + phase = - np.angle(c) / (2 * np.pi) + t_0 = n * H + t_1 = t_0 + N + t_kernel = np.arange(t_0, t_1) + kernel = win * np.cos(2 * np.pi * (t_kernel * omega - phase)) + nov_PLP[t_kernel] = nov_PLP[t_kernel] + kernel + nov_PLP = nov_PLP[L_left:L_pad-L_right] + nov_PLP[nov_PLP < 0] = 0 + return nov_PLP
+ + +
[docs]def compute_plot_tempogram_plp(fn_wav, Fs=22050, N=500, H=10, Theta=np.arange(30, 601), + title='', figsize=(8, 4), plot_maxtempo=False): + """Compute and plot Fourier-based tempogram and PLP function + + Notebook: C6/C6S3_PredominantLocalPulse.ipynb + + Args: + fn_wav: Filename of audio file + Fs: Sample rate (Default value = 22050) + N: Window size (Default value = 500) + H: Hop size (Default value = 10) + Theta: Set of tempi (given in BPM) (Default value = np.arange(30, 601)) + title: Title of figure (Default value = '') + figsize: Figure size (Default value = (8, 4)) + plot_maxtempo: Visualize tempo with greatest coefficients in tempogram (Default value = False) + """ + x, Fs = librosa.load(fn_wav, Fs) + + nov, Fs_nov = libfmp.c6.compute_novelty_spectrum(x, Fs=Fs, N=2048, H=512, gamma=100, M=10, norm=1) + nov, Fs_nov = libfmp.c6.resample_signal(nov, Fs_in=Fs_nov, Fs_out=100) + + L = len(nov) + H = 10 + X, T_coef, F_coef_BPM = libfmp.c6.compute_tempogram_fourier(nov, Fs=Fs_nov, N=N, H=H, Theta=Theta) + nov_PLP = compute_plp(X, Fs_nov, L, N, H, Theta) + tempogram = np.abs(X) + + fig, ax = plt.subplots(2, 2, gridspec_kw={'width_ratios': [1, 0.05], + 'height_ratios': [2, 1]}, + figsize=figsize) + libfmp.b.plot_matrix(tempogram, T_coef=T_coef, F_coef=F_coef_BPM, title=title, + ax=[ax[0, 0], ax[0, 1]], ylabel='Tempo (BPM)', colorbar=True) + if plot_maxtempo: + coef_k = np.argmax(tempogram, axis=0) + ax[0, 0].plot(T_coef, F_coef_BPM[coef_k], 'r.') + + t_nov = np.arange(nov.shape[0]) / Fs_nov + peaks, properties = signal.find_peaks(nov_PLP, prominence=0.05) + peaks_sec = t_nov[peaks] + libfmp.b.plot_signal(nov_PLP, Fs_nov, color='k', ax=ax[1, 0]) + ax[1, 1].set_axis_off() + ax[1, 0].plot(peaks_sec, nov_PLP[peaks], 'ro') + plt.show() + x_peaks = librosa.clicks(peaks_sec, sr=Fs, click_freq=1000, length=len(x)) + ipd.display(ipd.Audio(x + x_peaks, rate=Fs))
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c6/c6s3_adaptive_windowing.html b/docs/build/html/_modules/libfmp/c6/c6s3_adaptive_windowing.html new file mode 100644 index 0000000..9d3ddb9 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c6/c6s3_adaptive_windowing.html @@ -0,0 +1,335 @@ + + + + + + + + + + libfmp.c6.c6s3_adaptive_windowing — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c6.c6s3_adaptive_windowing
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c6.c6s3_adaptive_windowing

+"""
+Module: libfmp.c6.c6s3_adaptive_windowing
+Author: Meinard Müller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+
+import numpy as np
+from matplotlib import pyplot as plt
+import libfmp.b
+
+
+
[docs]def plot_beat_grid(B_sec, ax, color='r', linestyle=':', linewidth=1): + """Plot beat grid (given in seconds) into axis + + Notebook: C6/C6S3_AdaptiveWindowing.ipynb + + Args: + B_sec: Beat grid + ax: Axes for plotting + color: Color of lines (Default value = 'r') + linestyle: Style of lines (Default value = ':') + linewidth: Width of lines (Default value = 1) + """ + for b in B_sec: + ax.axvline(x=b, color=color, linestyle=linestyle, linewidth=linewidth)
+ + +
[docs]def adaptive_windowing(X, B, neigborhood=1, add_start=False, add_end=False): + """Apply adaptive windowing [FMP, Section 6.3.3] + + Notebook: C6/C6S3_AdaptiveWindowing.ipynb + + Args: + X (np.ndarray): Feature sequence + B (np.ndarray): Beat sequence (spefied in frames) + neigborhood (float): Parameter specifying relative range considered for windowing (Default value = 1) + add_start (bool): Add first index of X to beat sequence (if not existent) (Default value = False) + add_end (bool): Add last index of X to beat sequence (if not existent) (Default value = False) + + Returns: + X_adapt (np.ndarray): Feature sequence adapted to beat sequence + B_s (np.ndarray): Sequence specifying start (in frames) of window sections + B_t (np.ndarray): Sequence specifying end (in frames) of window sections + """ + len_X = X.shape[1] + max_B = np.max(B) + if max_B > len_X: + print('Beat exceeds length of features sequence (b=%d, |X|=%d)' % (max_B, len_X)) + B = B[B < len_X] + if add_start: + if B[0] > 0: + B = np.insert(B, 0, 0) + if add_end: + if B[-1] < len_X: + B = np.append(B, len_X) + X_adapt = np.zeros((X.shape[0], len(B)-1)) + B_s = np.zeros(len(B)-1).astype(int) + B_t = np.zeros(len(B)-1).astype(int) + for b in range(len(B)-1): + s = B[b] + t = B[b+1] + reduce = np.floor((1 - neigborhood)*(t-s+1)/2).astype(int) + s = s + reduce + t = t - reduce + if s == t: + t = t + 1 + X_slice = X[:, range(s, t)] + X_adapt[:, b] = np.mean(X_slice, axis=1) + B_s[b] = s + B_t[b] = t + return X_adapt, B_s, B_t
+ + +
[docs]def compute_plot_adaptive_windowing(x, Fs, H, X, B, neigborhood=1, add_start=False, add_end=False): + """Compute and plot process for adaptive windowing [FMP, Section 6.3.3] + + Notebook: C6/C6S3_AdaptiveWindowing.ipynb + + Args: + x (np.ndarray): Signal + Fs (scalar): Sample Rate + H (int): Hop size + X (int): Feature sequence + B (np.ndarray): Beat sequence (spefied in frames) + neigborhood (float): Parameter specifying relative range considered for windowing (Default value = 1) + add_start (bool): Add first index of X to beat sequence (if not existent) (Default value = False) + add_end (bool): Add last index of X to beat sequence (if not existent) (Default value = False) + + Returns: + X_adapt (np.ndarray): Feature sequence adapted to beat sequence + """ + X_adapt, B_s, B_t = adaptive_windowing(X, B, neigborhood=neigborhood, + add_start=add_start, add_end=add_end) + + fig, ax = plt.subplots(2, 2, gridspec_kw={'width_ratios': [1, 0.03], + 'height_ratios': [1, 3]}, figsize=(10, 4)) + + libfmp.b.plot_signal(x, Fs, ax=ax[0, 0], title=r'Adaptive windowing using $\lambda = %0.2f$' % neigborhood) + ax[0, 1].set_axis_off() + plot_beat_grid(B_s * H / Fs, ax[0, 0], color='b') + plot_beat_grid(B_t * H / Fs, ax[0, 0], color='g') + plot_beat_grid(B * H / Fs, ax[0, 0], color='r') + for k in range(len(B_s)): + ax[0, 0].fill_between([B_s[k] * H / Fs, B_t[k] * H / Fs], -1, 1, facecolor='red', alpha=0.1) + + libfmp.b.plot_matrix(X_adapt, ax=[ax[1, 0], ax[1, 1]], xlabel='Time (frames)', ylabel='Frequency (bins)') + plt.tight_layout() + return X_adapt
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c6/c6s3_beat_tracking.html b/docs/build/html/_modules/libfmp/c6/c6s3_beat_tracking.html new file mode 100644 index 0000000..c683964 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c6/c6s3_beat_tracking.html @@ -0,0 +1,364 @@ + + + + + + + + + + libfmp.c6.c6s3_beat_tracking — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c6.c6s3_beat_tracking
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c6.c6s3_beat_tracking

+"""
+Module: libfmp.c6.c6s3_beat_tracking
+Author: Meinard Müller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+
+
+import numpy as np
+import librosa
+from matplotlib import pyplot as plt
+import IPython.display as ipd
+
+import libfmp.b
+
+
+
[docs]def compute_penalty(N, beat_ref): + """| Compute penalty funtion used for beat tracking [FMP, Section 6.3.2] + | Note: Concatenation of '0' because of Python indexing conventions + + Notebook: C6/C6S3_BeatTracking.ipynb + + Args: + N (int): Length of vector representing penalty function + beat_ref (int): Reference beat period (given in samples) + + Returns: + penalty (np.ndarray): Penalty function + """ + t = np.arange(1, N) / beat_ref + penalty = -np.square(np.log2(t)) + t = np.concatenate((np.array([0]), t)) + penalty = np.concatenate((np.array([0]), penalty)) + return penalty
+ + +
[docs]def compute_beat_sequence(novelty, beat_ref, penalty=None, factor=1.0, return_all=False): + """| Compute beat sequence using dynamic programming [FMP, Section 6.3.2] + | Note: Concatenation of '0' because of Python indexing conventions + + Notebook: C6/C6S3_BeatTracking.ipynb + + Args: + novelty (np.ndarray): Novelty function + beat_ref (int): Reference beat period + penalty (np.ndarray): Penalty function (Default value = None) + factor (float): Weight parameter for adjusting the penalty (Default value = 1.0) + return_all (bool): Return details (Default value = False) + + Returns: + B (np.ndarray): Optimal beat sequence + D (np.ndarray): Accumulated score + P (np.ndarray): Maximization information + """ + N = len(novelty) + if penalty is None: + penalty = compute_penalty(N, beat_ref) + penalty = penalty * factor + novelty = np.concatenate((np.array([0]), novelty)) + D = np.zeros(N+1) + P = np.zeros(N+1, dtype=int) + D[1] = novelty[1] + P[1] = 0 + # forward calculation + for n in range(2, N+1): + m_indices = np.arange(1, n) + scores = D[m_indices] + penalty[n-m_indices] + maxium = np.max(scores) + if maxium <= 0: + D[n] = novelty[n] + P[n] = 0 + else: + D[n] = novelty[n] + maxium + P[n] = np.argmax(scores) + 1 + # backtracking + B = np.zeros(N, dtype=int) + k = 0 + B[k] = np.argmax(D) + while(P[B[k]] != 0): + k = k+1 + B[k] = P[B[k-1]] + B = B[0:k+1] + B = B[::-1] + B = B - 1 + if return_all: + return B, D, P + else: + return B
+ + +
[docs]def beat_period_to_tempo(beat, Fs): + """Convert beat period (samples) to tempo (BPM) [FMP, Section 6.3.2] + + Notebook: C6/C6S3_BeatTracking.ipynb + + Args: + beat (int): Beat period (samples) + Fs (scalar): Sample rate + + Returns: + tempo (float): Tempo (BPM) + """ + tempo = 60 / (beat / Fs) + return tempo
+ + +
[docs]def compute_plot_sonify_beat(x, Fs, nov, Fs_nov, beat_ref, factor, title=None, figsize=(6, 2)): + """Compute, plot, and sonfy beat sequence from novelty function [FMP, Section 6.3.2] + + Notebook: C6/C6S3_BeatTracking.ipynb + + Args: + x: Novelty function + Fs: Sample rate + nov: Novelty function + Fs_nov: Rate of novelty function + beat_ref: Reference beat period + factor: Weight parameter for adjusting the penalty + title: Title of figure (Default value = None) + figsize: Size of figure (Default value = (6, 2)) + """ + B = compute_beat_sequence(nov, beat_ref=beat_ref, factor=factor) + + beats = np.zeros(len(nov)) + beats[np.array(B, dtype=np.int32)] = 1 + if title is None: + tempo = beat_period_to_tempo(beat_ref, Fs_nov) + title = (r'Optimal beat sequence ($\hat{\delta}=%d$, $F_\mathrm{s}=%d$, ' + r'$\hat{\tau}=%0.0f$ BPM, $\lambda=%0.2f$)' % (beat_ref, Fs_nov, tempo, factor)) + + fig, ax, line = libfmp.b.plot_signal(nov, Fs_nov, color='k', title=title, figsize=figsize) + T_coef = np.arange(nov.shape[0]) / Fs_nov + ax.plot(T_coef, beats, ':r', linewidth=1) + plt.show() + + beats_sec = T_coef[B] + x_peaks = librosa.clicks(beats_sec, sr=Fs, click_freq=1000, length=len(x)) + ipd.display(ipd.Audio(x + x_peaks, rate=Fs))
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c7/c7s1_audio_id.html b/docs/build/html/_modules/libfmp/c7/c7s1_audio_id.html new file mode 100644 index 0000000..7d3615f --- /dev/null +++ b/docs/build/html/_modules/libfmp/c7/c7s1_audio_id.html @@ -0,0 +1,405 @@ + + + + + + + + + + libfmp.c7.c7s1_audio_id — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c7.c7s1_audio_id
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c7.c7s1_audio_id

+"""
+Module: libfmp.c7.c7s1_audio_id
+Author: Meinard Mueller, Patricio Lopez-Serrano
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+from scipy import ndimage
+from matplotlib import pyplot as plt
+from numba import jit
+
+
+
[docs]@jit(nopython=True) +def compute_constellation_map_naive(Y, dist_freq=7, dist_time=7, thresh=0.01): + """Compute constellation map (naive implementation) + + Notebook: C7/C7S1_AudioIdentification.ipynb + + Args: + Y (np.ndarray): Spectrogram (magnitude) + dist_freq (int): Neighborhood parameter for frequency direction (kappa) (Default value = 7) + dist_time (int): Neighborhood parameter for time direction (tau) (Default value = 7) + thresh (float): Threshold parameter for minimal peak magnitude (Default value = 0.01) + + Returns: + Cmap (np.ndarray): Boolean mask for peak structure (same size as Y) + """ + # spectrogram dimensions + if Y.ndim > 1: + (K, N) = Y.shape + else: + K = Y.shape[0] + N = 1 + Cmap = np.zeros((K, N), dtype=np.bool8) + + # loop over spectrogram + for k in range(K): + f1 = max(k - dist_freq, 0) + f2 = min(k + dist_freq + 1, K) + for n in range(N): + t1 = max(n - dist_time, 0) + t2 = min(n + dist_time + 1, N) + curr_mag = Y[k, n] + curr_rect = Y[f1:f2, t1:t2] + c_max = np.max(curr_rect) + if ((curr_mag == c_max) and (curr_mag > thresh)): + Cmap[k, n] = True + return Cmap
+ + +
[docs]def plot_constellation_map(Cmap, Y=None, xlim=None, ylim=None, title='', + xlabel='Time (sample)', ylabel='Frequency (bins)', + s=5, color='r', marker='o', figsize=(7, 3), dpi=72): + """Plot constellation map + + Notebook: C7/C7S1_AudioIdentification.ipynb + + Args: + Cmap: Constellation map given as boolean mask for peak structure + Y: Spectrogram representation (Default value = None) + xlim: Limits for x-axis (Default value = None) + ylim: Limits for y-axis (Default value = None) + title: Title for plot (Default value = '') + xlabel: Label for x-axis (Default value = 'Time (sample)') + ylabel: Label for y-axis (Default value = 'Frequency (bins)') + s: Size of dots in scatter plot (Default value = 5) + color: Color used for scatter plot (Default value = 'r') + marker: Marker for peaks (Default value = 'o') + figsize: Width, height in inches (Default value = (7, 3)) + dpi: Dots per inch (Default value = 72) + + Returns: + fig: The created matplotlib figure + ax: The used axes. + im: The image plot + """ + if Cmap.ndim > 1: + (K, N) = Cmap.shape + else: + K = Cmap.shape[0] + N = 1 + if Y is None: + Y = np.zeros((K, N)) + fig, ax = plt.subplots(1, 1, figsize=figsize, dpi=dpi) + im = ax.imshow(Y, origin='lower', aspect='auto', cmap='gray_r') + ax.set_xlabel(xlabel) + ax.set_ylabel(ylabel) + ax.set_title(title) + Fs = 1 + if xlim is None: + xlim = [-0.5/Fs, (N-0.5)/Fs] + if ylim is None: + ylim = [-0.5/Fs, (K-0.5)/Fs] + ax.set_xlim(xlim) + ax.set_ylim(ylim) + n, k = np.argwhere(Cmap == 1).T + ax.scatter(k, n, color=color, s=s, marker=marker) + plt.tight_layout() + return fig, ax, im
+ + +
[docs]def compute_constellation_map(Y, dist_freq=7, dist_time=7, thresh=0.01): + """Compute constellation map (implementation using image processing) + + Notebook: C7/C7S1_AudioIdentification.ipynb + + Args: + Y (np.ndarray): Spectrogram (magnitude) + dist_freq (int): Neighborhood parameter for frequency direction (kappa) (Default value = 7) + dist_time (int): Neighborhood parameter for time direction (tau) (Default value = 7) + thresh (float): Threshold parameter for minimal peak magnitude (Default value = 0.01) + + Returns: + Cmap (np.ndarray): Boolean mask for peak structure (same size as Y) + """ + result = ndimage.maximum_filter(Y, size=[2*dist_freq+1, 2*dist_time+1], mode='constant') + Cmap = np.logical_and(Y == result, result > thresh) + return Cmap
+ + +
[docs]def match_binary_matrices_tol(C_ref, C_est, tol_freq=0, tol_time=0): + """| Compare binary matrices with tolerance + | Note: The tolerance parameters should be smaller than the minimum distance of + peaks (1-entries in C_ref ad C_est) to obtain meaningful TP, FN, FP values + + Notebook: C7/C7S1_AudioIdentification.ipynb + + Args: + C_ref (np.ndarray): Binary matrix used as reference + C_est (np.ndarray): Binary matrix used as estimation + tol_freq (int): Tolerance in frequency direction (vertical) (Default value = 0) + tol_time (int): Tolerance in time direction (horizontal) (Default value = 0) + + Returns: + TP (int): True positives + FN (int): False negatives + FP (int): False positives + C_AND (np.ndarray): Boolean mask of AND of C_ref and C_est (with tolerance) + """ + assert C_ref.shape == C_est.shape, "Dimensions need to agree" + N = np.sum(C_ref) + M = np.sum(C_est) + # Expand C_est with 2D-max-filter using the tolerance parameters + C_est_max = ndimage.maximum_filter(C_est, size=(2*tol_freq+1, 2*tol_time+1), + mode='constant') + C_AND = np.logical_and(C_est_max, C_ref) + TP = np.sum(C_AND) + FN = N - TP + FP = M - TP + return TP, FN, FP, C_AND
+ + +
[docs]def compute_matching_function(C_D, C_Q, tol_freq=1, tol_time=1): + """Computes matching function for constellation maps + + Notebook: C7/C7S1_AudioIdentification.ipynb + + Args: + C_D (np.ndarray): Binary matrix used as dababase document + C_Q (np.ndarray): Binary matrix used as query document + tol_freq (int): Tolerance in frequency direction (vertical) (Default value = 1) + tol_time (int): Tolerance in time direction (horizontal) (Default value = 1) + + Returns: + Delta (np.ndarray): Matching function + shift_max (int): Optimal shift position maximizing Delta + """ + L = C_D.shape[1] + N = C_Q.shape[1] + M = L - N + assert M >= 0, "Query must be shorter than document" + Delta = np.zeros(L) + for m in range(M + 1): + C_D_crop = C_D[:, m:m+N] + TP, FN, FP, C_AND = match_binary_matrices_tol(C_D_crop, C_Q, + tol_freq=tol_freq, tol_time=tol_time) + Delta[m] = TP + shift_max = np.argmax(Delta) + return Delta, shift_max
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c7/c7s2_audio_matching.html b/docs/build/html/_modules/libfmp/c7/c7s2_audio_matching.html new file mode 100644 index 0000000..dae6461 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c7/c7s2_audio_matching.html @@ -0,0 +1,684 @@ + + + + + + + + + + libfmp.c7.c7s2_audio_matching — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c7.c7s2_audio_matching
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c7.c7s2_audio_matching

+"""
+Module: libfmp.c7.c7s2_audio_matching
+Author: Meinard Mueller, Frank Zalkow
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+from matplotlib import patches
+from numba import jit
+import scipy
+import librosa
+
+import libfmp.c3
+
+
+
[docs]def quantize_matrix(C, quant_fct=None): + """Quantize matrix values in a logarithmic manner (as done for CENS features) + + Notebook: C7/C7S2_CENS.ipynb + + Args: + C (np.ndarray): Input matrix + quant_fct (list): List specifying the quantization function (Default value = None) + + Returns: + C_quant (np.ndarray): Output matrix + """ + C_quant = np.empty_like(C) + if quant_fct is None: + quant_fct = [(0.0, 0.05, 0), (0.05, 0.1, 1), (0.1, 0.2, 2), (0.2, 0.4, 3), (0.4, 1, 4)] + for min_val, max_val, target_val in quant_fct: + mask = np.logical_and(min_val <= C, C < max_val) + C_quant[mask] = target_val + return C_quant
+ + +
[docs]def compute_cens_from_chromagram(C, Fs=1, ell=41, d=10, quant=True): + """Compute CENS features from chromagram + + Notebook: C7/C7S2_CENS.ipynb + + Args: + C (np.ndarray): Input chromagram + Fs (scalar): Feature rate of chromagram (Default value = 1) + ell (int): Smoothing length (Default value = 41) + d (int): Downsampling factor (Default value = 10) + quant (bool): Apply quantization (Default value = True) + + Returns: + C_CENS (np.ndarray): CENS features + Fs_CENS (scalar): Feature rate of CENS features + """ + C_norm = libfmp.c3.normalize_feature_sequence(C, norm='1') + C_Q = quantize_matrix(C_norm) if quant else C_norm + + C_smooth, Fs_CENS = libfmp.c3.smooth_downsample_feature_sequence(C_Q, Fs, filt_len=ell, + down_sampling=d, w_type='hann') + C_CENS = libfmp.c3.normalize_feature_sequence(C_smooth, norm='2') + + return C_CENS, Fs_CENS
+ + +
[docs]def scale_tempo_sequence(X, factor=1): + """Scales a sequence (given as feature matrix) along time (second dimension) + + Notebook: C7/C7S2_DiagonalMatching.ipynb + + Args: + X (np.ndarray): Feature sequences (given as K x N matrix) + factor (float): Scaling factor (resulting in length "round(factor * N)"") (Default value = 1) + + Returns: + X_new (np.ndarray): Scaled feature sequence + N_new (int): Length of scaled feature sequence + """ + N = X.shape[1] + t = np.linspace(0, 1, num=N, endpoint=True) + N_new = np.round(factor * N).astype(int) + t_new = np.linspace(0, 1, num=N_new, endpoint=True) + X_new = scipy.interpolate.interp1d(t, X, axis=1)(t_new) + return X_new, N_new
+ + +
[docs]def cost_matrix_dot(X, Y): + """Computes cost matrix via dot product + + Notebook: C7/C7S2_DiagonalMatching.ipynb + + Args: + X (np.ndarray): First sequence (K x N matrix) + Y (np.ndarray): Second sequence (K x M matrix) + + Returns: + C (np.ndarray): Cost matrix + """ + return 1 - np.dot(X.T, Y)
+ + +
[docs]def matching_function_diag(C, cyclic=False): + """Computes diagonal matching function + + Notebook: C7/C7S2_DiagonalMatching.ipynb + + Args: + C (np.ndarray): Cost matrix + cyclic (bool): If "True" then matching is done cyclically (Default value = False) + + Returns: + Delta (np.ndarray): Matching function + """ + N, M = C.shape + assert N <= M, "N <= M is required" + Delta = C[0, :] + for n in range(1, N): + Delta = Delta + np.roll(C[n, :], -n) + Delta = Delta / N + if cyclic is False: + Delta[M-N+1:M] = np.inf + return Delta
+ + +
[docs]def mininma_from_matching_function(Delta, rho=2, tau=0.2, num=None): + """Derives local minima positions of matching function in an iterative fashion + + Notebook: C7/C7S2_DiagonalMatching.ipynb + + Args: + Delta (np.ndarray): Matching function + rho (int): Parameter to exclude neighborhood of a matching position for subsequent matches (Default value = 2) + tau (float): Threshold for maximum Delta value allowed for matches (Default value = 0.2) + num (int): Maximum number of matches (Default value = None) + + Returns: + pos (np.ndarray): Array of local minima + """ + Delta_tmp = Delta.copy() + M = len(Delta) + pos = [] + num_pos = 0 + rho = int(rho) + if num is None: + num = M + while num_pos < num and np.sum(Delta_tmp < tau) > 0: + m = np.argmin(Delta_tmp) + pos.append(m) + num_pos += 1 + Delta_tmp[max(0, m - rho):min(m + rho, M)] = np.inf + pos = np.array(pos).astype(int) + return pos
+ + +
[docs]def matches_diag(pos, Delta_N): + """Derives matches from positions in the case of diagonal matching + + Notebook: C7/C7S2_DiagonalMatching.ipynb + + Args: + pos (np.ndarray or list): Starting positions of matches + Delta_N (int or np.ndarray or list): Length of match (a single number or a list of same length as Delta) + + Returns: + matches (np.ndarray): Array containing matches (start, end) + """ + matches = np.zeros((len(pos), 2)).astype(int) + for k in range(len(pos)): + s = pos[k] + matches[k, 0] = s + if isinstance(Delta_N, int): + matches[k, 1] = s + Delta_N - 1 + else: + matches[k, 1] = s + Delta_N[s] - 1 + return matches
+ + +
[docs]def plot_matches(ax, matches, Delta, Fs=1, alpha=0.2, color='r', s_marker='o', t_marker=''): + """Plots matches into existing axis + + Notebook: C7/C7S2_DiagonalMatching.ipynb + + Args: + ax: Axis + matches: Array of matches (start, end) + Delta: Matching function + Fs: Feature rate (Default value = 1) + alpha: Transparency pramaeter for match visualization (Default value = 0.2) + color: Color used to indicated matches (Default value = 'r') + s_marker: Marker used to indicate start of matches (Default value = 'o') + t_marker: Marker used to indicate end of matches (Default value = '') + """ + y_min, y_max = ax.get_ylim() + for (s, t) in matches: + ax.plot(s/Fs, Delta[s], color=color, marker=s_marker, linestyle='None') + ax.plot(t/Fs, Delta[t], color=color, marker=t_marker, linestyle='None') + rect = patches.Rectangle(((s-0.5)/Fs, y_min), (t-s+1)/Fs, y_max, facecolor=color, alpha=alpha) + ax.add_patch(rect)
+ + +
[docs]def matching_function_diag_multiple(X, Y, tempo_rel_set=[1], cyclic=False): + """Computes diagonal matching function using multiple query strategy + + Notebook: C7/C7S2_DiagonalMatching.ipynb + + Args: + X (np.ndarray): First sequence (K x N matrix) + Y (np.ndarray): Second sequence (K x M matrix) + tempo_rel_set (np.ndarray): Set of relative tempo values (scaling) (Default value = [1]) + cyclic (bool): If "True" then matching is done cyclically (Default value = False) + + Returns: + Delta_min (np.ndarray): Matching function (obtained by from minimizing over several matching functions) + Delta_N (np.ndarray): Query length of best match for each time position + Delta_scale (np.ndarray): Set of matching functions (for each of the scaled versions of the query) + """ + M = Y.shape[1] + num_tempo = len(tempo_rel_set) + Delta_scale = np.zeros((num_tempo, M)) + N_scale = np.zeros(num_tempo) + for k in range(num_tempo): + X_scale, N_scale[k] = scale_tempo_sequence(X, factor=tempo_rel_set[k]) + C_scale = cost_matrix_dot(X_scale, Y) + Delta_scale[k, :] = matching_function_diag(C_scale, cyclic=cyclic) + Delta_min = np.min(Delta_scale, axis=0) + Delta_argmin = np.argmin(Delta_scale, axis=0) + Delta_N = N_scale[Delta_argmin] + return Delta_min, Delta_N, Delta_scale
+ + +
[docs]@jit(nopython=True) +def compute_accumulated_cost_matrix_subsequence_dtw(C): + """Given the cost matrix, compute the accumulated cost matrix for + subsequence dynamic time warping with step sizes {(1, 0), (0, 1), (1, 1)} + + Notebook: C7/C7S2_SubsequenceDTW.ipynb + + Args: + C (np.ndarray): Cost matrix + + Returns: + D (np.ndarray): Accumulated cost matrix + """ + N, M = C.shape + D = np.zeros((N, M)) + D[:, 0] = np.cumsum(C[:, 0]) + D[0, :] = C[0, :] + for n in range(1, N): + for m in range(1, M): + D[n, m] = C[n, m] + min(D[n-1, m], D[n, m-1], D[n-1, m-1]) + return D
+ + +
[docs]@jit(nopython=True) +def compute_optimal_warping_path_subsequence_dtw(D, m=-1): + """Given an accumulated cost matrix, compute the warping path for + subsequence dynamic time warping with step sizes {(1, 0), (0, 1), (1, 1)} + + Notebook: C7/C7S2_SubsequenceDTW.ipynb + + Args: + D (np.ndarray): Accumulated cost matrix + m (int): Index to start back tracking; if set to -1, optimal m is used (Default value = -1) + + Returns: + P (np.ndarray): Optimal warping path (array of index pairs) + """ + N, M = D.shape + n = N - 1 + if m < 0: + m = D[N - 1, :].argmin() + P = [(n, m)] + + while n > 0: + if m == 0: + cell = (n - 1, 0) + else: + val = min(D[n-1, m-1], D[n-1, m], D[n, m-1]) + if val == D[n-1, m-1]: + cell = (n-1, m-1) + elif val == D[n-1, m]: + cell = (n-1, m) + else: + cell = (n, m-1) + P.append(cell) + n, m = cell + P.reverse() + P = np.array(P) + return P
+ + +
[docs]@jit(nopython=True) +def compute_accumulated_cost_matrix_subsequence_dtw_21(C): + """Given the cost matrix, compute the accumulated cost matrix for + subsequence dynamic time warping with step sizes {(1, 1), (2, 1), (1, 2)} + + Notebook: C7/C7S2_SubsequenceDTW.ipynb + + Args: + C (np.ndarray): Cost matrix + + Returns: + D (np.ndarray): Accumulated cost matrix + """ + N, M = C.shape + D = np.zeros((N + 1, M + 2)) + D[0:1, :] = np.inf + D[:, 0:2] = np.inf + + D[1, 2:] = C[0, :] + + for n in range(1, N): + for m in range(0, M): + if n == 0 and m == 0: + continue + D[n+1, m+2] = C[n, m] + min(D[n-1+1, m-1+2], D[n-2+1, m-1+2], D[n-1+1, m-2+2]) + D = D[1:, 2:] + return D
+ + +
[docs]@jit(nopython=True) +def compute_optimal_warping_path_subsequence_dtw_21(D, m=-1): + """Given an accumulated cost matrix, compute the warping path for + subsequence dynamic time warping with step sizes {(1, 1), (2, 1), (1, 2)} + + Notebook: C7/C7S2_SubsequenceDTW.ipynb + + Args: + D (np.ndarray): Accumulated cost matrix + m (int): Index to start back tracking; if set to -1, optimal m is used (Default value = -1) + + Returns: + P (np.ndarray): Optimal warping path (array of index pairs) + """ + N, M = D.shape + n = N - 1 + if m < 0: + m = D[N - 1, :].argmin() + P = [(n, m)] + + while n > 0: + if m == 0: + cell = (n-1, 0) + else: + val = min(D[n-1, m-1], D[n-2, m-1], D[n-1, m-2]) + if val == D[n-1, m-1]: + cell = (n-1, m-1) + elif val == D[n-2, m-1]: + cell = (n-2, m-1) + else: + cell = (n-1, m-2) + P.append(cell) + n, m = cell + P.reverse() + P = np.array(P) + return P
+ + +
[docs]def compute_cens_from_file(fn_wav, Fs=22050, N=4410, H=2205, ell=21, d=5): + """Compute CENS features from file + + Notebook: C7/C7S2_AudioMatching.ipynb + + Args: + fn_wav (str): Filename of wav file + Fs (scalar): Feature rate of wav file (Default value = 22050) + N (int): Window size for STFT (Default value = 4410) + H (int): Hope size for STFT (Default value = 2205) + ell (int): Smoothing length (Default value = 21) + d (int): Downsampling factor (Default value = 5) + + Returns: + X_CENS (np.ndarray): CENS features + L (int): Length of CENS feature sequence + Fs_CENS (scalar): Feature rate of CENS features + x_duration (float): Duration (seconds) of wav file + """ + x, Fs = librosa.load(fn_wav, sr=Fs) + x_duration = x.shape[0] / Fs + X_chroma = librosa.feature.chroma_stft(y=x, sr=Fs, tuning=0, norm=None, hop_length=H, n_fft=N) + X_CENS, Fs_CENS = libfmp.c7.compute_cens_from_chromagram(X_chroma, Fs=Fs/H, ell=ell, d=d) + L = X_CENS.shape[1] + return X_CENS, L, Fs_CENS, x_duration
+ + +
[docs]def compute_matching_function_dtw(X, Y, stepsize=2): + """Compute CENS features from file + + Notebook: C7/C7S2_AudioMatching.ipynb + + Args: + X (np.ndarray): Query feature sequence (given as K x N matrix) + Y (np.ndarray): Database feature sequence (given as K x M matrix) + stepsize (int): Parameter for step size condition (1 or 2) (Default value = 2) + + Returns: + Delta (np.ndarray): DTW-based matching function + C (np.ndarray): Cost matrix + D (np.ndarray): Accumulated cost matrix + """ + C = libfmp.c7.cost_matrix_dot(X, Y) + if stepsize == 1: + D = libfmp.c7.compute_accumulated_cost_matrix_subsequence_dtw(C) + if stepsize == 2: + D = libfmp.c7.compute_accumulated_cost_matrix_subsequence_dtw_21(C) + N, M = C.shape + Delta = D[-1, :] / N + return Delta, C, D
+ + +
[docs]def matches_dtw(pos, D, stepsize=2): + """Derives matches from positions for DTW-based strategy + + Notebook: C7/C7S2_AudioMatching.ipynb + + Args: + pos (np.ndarray): End positions of matches + D (np.ndarray): Accumulated cost matrix + stepsize (int): Parameter for step size condition (1 or 2) (Default value = 2) + + Returns: + matches (np.ndarray): Array containing matches (start, end) + """ + matches = np.zeros((len(pos), 2)).astype(int) + for k in range(len(pos)): + t = pos[k] + matches[k, 1] = t + if stepsize == 1: + P = libfmp.c7.compute_optimal_warping_path_subsequence_dtw(D, m=t) + if stepsize == 2: + P = libfmp.c7.compute_optimal_warping_path_subsequence_dtw_21(D, m=t) + s = P[0, 1] + matches[k, 0] = s + return matches
+ + +
[docs]def compute_matching_function_dtw_ti(X, Y, cyc=np.arange(12), stepsize=2): + """Compute transposition-invariant matching function + + Notebook: C7/C7S2_AudioMatching.ipynb + + Args: + X (np.ndarray): Query feature sequence (given as K x N matrix) + Y (np.ndarray): Database feature sequence (given as K x M matrix) + cyc (np.nda(rray): Set of cyclic shift indices to be considered (Default value = np.arange(12)) + stepsize (int): Parameter for step size condition (1 or 2) (Default value = 2) + + Returns: + Delta_TI (np.ndarray): Transposition-invariant matching function + Delta_ind (np.ndarray): Cost-minimizing indices + Delta_cyc (np.ndarray): Array containing all matching functions + """ + M = Y.shape[1] + num_cyc = len(cyc) + Delta_cyc = np.zeros((num_cyc, M)) + for k in range(num_cyc): + X_cyc = np.roll(X, k, axis=0) + Delta_cyc[k, :], C, D = compute_matching_function_dtw(X_cyc, Y, stepsize=stepsize) + Delta_TI = np.min(Delta_cyc, axis=0) + Delta_ind = np.argmin(Delta_cyc, axis=0) + return Delta_TI, Delta_ind, Delta_cyc
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c7/c7s3_version_id.html b/docs/build/html/_modules/libfmp/c7/c7s3_version_id.html new file mode 100644 index 0000000..1f4eae9 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c7/c7s3_version_id.html @@ -0,0 +1,479 @@ + + + + + + + + + + libfmp.c7.c7s3_version_id — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c7.c7s3_version_id
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c7.c7s3_version_id

+"""
+Module: libfmp.c7.c7s3_version_id
+Author: Meinard Mueller, Tim Zunner, Frank Zalkow
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+import numpy as np
+from numba import jit
+
+import librosa
+import libfmp.c4
+import libfmp.c7
+
+
+
[docs]@jit(nopython=True) +def compute_accumulated_score_matrix_common_subsequence(S): + """Given the score matrix, compute the accumulated score matrix + for common subsequence matching with step sizes {(1, 0), (0, 1), (1, 1)} + + Notebook: C7/C7S3_CommonSubsequence.ipynb + + Args: + S (np.ndarray): Score matrix + + Returns: + D (np.ndarray): Accumulated score matrix + """ + N, M = S.shape + D = np.zeros((N, M)) + + D[0, 0] = max(0, S[0, 0]) + + for n in range(1, N): + D[n, 0] = max(0, D[n-1, 0] + S[n, 0]) + + for m in range(1, M): + D[0, m] = max(0, D[0, m-1] + S[0, m]) + + for n in range(1, N): + for m in range(1, M): + D[n, m] = max(0, D[n-1, m-1] + S[n, m], D[n-1, m] + S[n, m], D[n, m-1] + S[n, m]) + + return D
+ + +
[docs]@jit(nopython=True) +def compute_optimal_path_common_subsequence(D, cellmax=True, n=0, m=0): + """Given an accumulated score matrix, compute the score-maximizing path + for common subsequence matching with step sizes {(1, 0), (0, 1), (1, 1)} + + Notebook: C7/C7S3_CommonSubsequence.ipynb + + Args: + D (np.ndarray): Accumulated score matrix + cellmax (bool): If "True", score-maximizing cell will be computed (Default value = True) + n (int): Index (first axis) of cell for backtracking start; only used when cellmax=False (Default value = 0) + m (int): Index (second axis) of cell for backtracking start; only used when cellmax=False (Default value = 0) + + Returns: + P (np.ndarray): Score-maximizing path (array of index pairs) + """ + if cellmax: + # n, m = np.unravel_index(np.argmax(D), D.shape) # doesn't work with jit + n, m = divmod(np.argmax(D), D.shape[1]) + P = [(n, m)] + + while ((n, m) != (0, 0) and (D[n, m] != 0)): + if n == 0: + cell = (0, m-1) + elif m == 0: + cell = (n-1, 0) + else: + val = max(D[n-1, m-1], D[n-1, m], D[n, m-1]) + if val == D[n-1, m-1]: + cell = (n-1, m-1) + elif val == D[n-1, m]: + cell = (n-1, m) + else: + cell = (n, m-1) + P.append(cell) + n, m = cell + if (D[n, m] == 0): + del P[-1] + P.reverse() + P = np.array(P) + return P
+ + +
[docs]@jit(nopython=True) +def get_induced_segments(P): + """Given a path, compute the induces segments + + Notebook: C7/C7S3_CommonSubsequence.ipynb + + Args: + P (np.ndarray): Path (list of index pairs) + + Returns: + seg_X (np.ndarray): Induced segment of first sequence + seg_Y (np.ndarray): Induced segment of second sequence + """ + seg_X = np.arange(P[0, 0], P[-1, 0] + 1) + seg_Y = np.arange(P[0, 1], P[-1, 1] + 1) + return seg_X, seg_Y
+ + +
[docs]@jit(nopython=True) +def compute_partial_matching(S): + """Given the score matrix, compute the accumulated score matrix + for partial matching + + Notebook: C7/C7S3_CommonSubsequence.ipynb + + Args: + S (np.ndarray): Score matrix + + Returns: + D (np.ndarray): Accumulated score matrix + P (np.ndarray): Partial match (array of index pairs) + """ + N, M = S.shape + D = np.zeros((N+1, M+1)) + for n in range(1, N+1): + for m in range(1, M+1): + D[n, m] = max(D[n, m-1], D[n-1, m], D[n-1, m-1] + S[n-1, m-1]) + + P = [] + n = N + m = M + while (n > 0) and (m > 0): + if D[n, m] == D[n, m-1]: + m = m - 1 + elif D[n, m] == D[n-1, m]: + n = n - 1 + else: + P.append((n-1, m-1)) + n = n - 1 + m = m - 1 + P.reverse() + P = np.array(P) + return D, P
+ + +
[docs]def compute_sm_from_wav(x1, x2, Fs, N=4410, H=2205, ell=21, d=5, L_smooth=12, + tempo_rel_set=np.array([0.66, 0.81, 1, 1.22, 1.5]), + shift_set=np.array([0]), strategy='relative', scale=True, + thresh=0.15, penalty=-2.0, binarize=False): + """Compute a similarity matrix (SM) + + Notebook: C7/C7S3_VersionIdentification.ipynb + + Args: + x1 (np.ndarray): First signal + x2 (np.ndarray): Second signal + Fs (scalar): Sampling rate of WAV files + N (int): Window size for computing STFT-based chroma features (Default value = 4410) + H (int): Hop size for computing STFT-based chroma features (Default value = 2205) + ell (int): Smoothing length for computing CENS features (Default value = 21) + d (int): Downsampling factor for computing CENS features (Default value = 5) + L_smooth (int): Length of filter for enhancing SM (Default value = 12) + tempo_rel_set (np.ndarray): Set of relative tempo values for enhancing SM + (Default value = np.array([0.66, 0.81, 1, 1.22, 1.5])) + shift_set (np.ndarray): Set of shift indices for enhancing SM (Default value = np.array([0])) + strategy (str): Thresholding strategy for thresholding SM ('absolute', 'relative', 'local') + (Default value = 'relative') + scale (bool): If scale=True, then scaling of positive values to range [0,1] for thresholding SM + (Default value = True) + thresh (float): Treshold (meaning depends on strategy) (Default value = 0.15) + penalty (float): Set values below treshold to value specified (Default value = -2.0) + binarize (bool): Binarizes final matrix (positive: 1; otherwise: 0) (Default value = False) + + Returns: + X (np.ndarray): CENS feature sequence for first signal + Y (np.ndarray): CENS feature sequence for second signal + Fs_feature (scalar): Feature rate + S_thresh (np.ndarray): Similarity matrix + I (np.ndarray): Index matrix + """ + # Computation of CENS features + C1 = librosa.feature.chroma_stft(y=x1, sr=Fs, tuning=0, norm=1, hop_length=H, n_fft=N) + C2 = librosa.feature.chroma_stft(y=x2, sr=Fs, tuning=0, norm=1, hop_length=H, n_fft=N) + Fs_C = Fs / H + X, Fs_feature = libfmp.c7.compute_cens_from_chromagram(C1, Fs_C, ell=ell, d=d) + Y, Fs_feature = libfmp.c7.compute_cens_from_chromagram(C2, Fs_C, ell=ell, d=d) + + # Compute enhanced SM + S, I = libfmp.c4.compute_sm_ti(X, Y, L=L_smooth, tempo_rel_set=tempo_rel_set, + shift_set=shift_set, direction=2) + S_thresh = libfmp.c4.threshold_matrix(S, thresh=thresh, strategy=strategy, + scale=scale, penalty=penalty, binarize=binarize) + return X, Y, Fs_feature, S_thresh, I
+ + +
[docs]def compute_prf_metrics(I, score, I_Q): + """Compute precision, recall, F-measures and other + evaluation metrics for document-level retrieval + + Notebook: C7/C7S3_Evaluation.ipynb + + Args: + I (np.ndarray): Array of items + score (np.ndarray): Array containing the score values of the times + I_Q (np.ndarray): Array of relevant (positive) items + + Returns: + P_Q (float): Precision + R_Q (float): Recall + F_Q (float): F-measures sorted by rank + BEP (float): Break-even point + F_max (float): Maximal F-measure + P_average (float): Mean average + X_Q (np.ndarray): Relevance function + rank (np.ndarray): Array of rank values + I_sorted (np.ndarray): Array of items sorted by rank + rank_sorted (np.ndarray): Array of rank values sorted by rank + """ + # Compute rank and sort documents according to rank + K = len(I) + index_sorted = np.flip(np.argsort(score)) + I_sorted = I[index_sorted] + rank = np.argsort(index_sorted) + 1 + rank_sorted = np.arange(1, K+1) + + # Compute relevance function X_Q (indexing starts with zero) + # X_Q = np.zeros(K, dtype=bool) + # for i in range(K): + # if I_sorted[i] in I_Q: + # X_Q[i] = True + X_Q = np.isin(I_sorted, I_Q) + # P_Q = np.cumsum(X_Q) / np.arange(1, K+1) + + # Compute precision and recall values (indexing starts with zero) + M = len(I_Q) + # P_Q = np.zeros(K) + # R_Q = np.zeros(K) + # for i in range(K): + # r = rank_sorted[i] + # P_Q[i] = np.sum(X_Q[:r]) / r + # R_Q[i] = np.sum(X_Q[:r]) / M + P_Q = np.cumsum(X_Q) / np.arange(1, K+1) + R_Q = np.cumsum(X_Q) / M + + # Break-even point + BEP = P_Q[M-1] + # Maximal F-measure + sum_PR = P_Q + R_Q + sum_PR[sum_PR == 0] = 1 # Avoid division by zero + F_Q = 2 * (P_Q * R_Q) / sum_PR + F_max = F_Q.max() + # Average precision + P_average = np.sum(P_Q * X_Q) / len(I_Q) + + return P_Q, R_Q, F_Q, BEP, F_max, P_average, X_Q, rank, I_sorted, rank_sorted
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c8/c8s1_hps.html b/docs/build/html/_modules/libfmp/c8/c8s1_hps.html new file mode 100644 index 0000000..9b34d2d --- /dev/null +++ b/docs/build/html/_modules/libfmp/c8/c8s1_hps.html @@ -0,0 +1,580 @@ + + + + + + + + + + libfmp.c8.c8s1_hps — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c8.c8s1_hps
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c8.c8s1_hps

+"""
+Module: libfmp.c8.c8s1_hps
+Author: Meinard Müller, Frank Zalkow
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+
+from collections import OrderedDict
+import numpy as np
+from scipy import signal
+import librosa
+import IPython.display as ipd
+import pandas as pd
+
+
+
[docs]def median_filter_horizontal(x, filter_len): + """Apply median filter in horizontal direction + + Notebook: C8/C8S1_HPS.ipynb + + Args: + x (np.ndarray): Input matrix + filter_len (int): Filter length + + Returns: + x_h (np.ndarray): Filtered matrix + """ + return signal.medfilt(x, [1, filter_len])
+ + +
[docs]def median_filter_vertical(x, filter_len): + """Apply median filter in vertical direction + + Notebook: C8/C8S1_HPS.ipynb + + Args: + x: Input matrix + filter_len (int): Filter length + + Returns: + x_p (np.ndarray): Filtered matrix + """ + return signal.medfilt(x, [filter_len, 1])
+ + +
[docs]def convert_l_sec_to_frames(L_h_sec, Fs=22050, N=1024, H=512): + """Convert filter length parameter from seconds to frame indices + + Notebook: C8/C8S1_HPS.ipynb + + Args: + L_h_sec (float): Filter length (in seconds) + Fs (scalar): Sample rate (Default value = 22050) + N (int): Window size (Default value = 1024) + H (int): Hop size (Default value = 512) + + Returns: + L_h (int): Filter length (in samples) + """ + L_h = int(np.ceil(L_h_sec * Fs / H)) + return L_h
+ + +
[docs]def convert_l_hertz_to_bins(L_p_Hz, Fs=22050, N=1024, H=512): + """Convert filter length parameter from Hertz to frequency bins + + Notebook: C8/C8S1_HPS.ipynb + + Args: + L_p_Hz (float): Filter length (in Hertz) + Fs (scalar): Sample rate (Default value = 22050) + N (int): Window size (Default value = 1024) + H (int): Hop size (Default value = 512) + + Returns: + L_p (int): Filter length (in frequency bins) + """ + L_p = int(np.ceil(L_p_Hz * N / Fs)) + return L_p
+ + +
[docs]def make_integer_odd(n): + """Convert integer into odd integer + + Notebook: C8/C8S1_HPS.ipynb + + Args: + n (int): Integer + + Returns: + n (int): Odd integer + """ + if(n % 2 == 0): + n += 1 + return n
+ + +
[docs]def hps(x, Fs, N, H, L_h, L_p, L_unit='physical', mask='binary', eps=0.001, detail=False): + """Harmonic-percussive separation (HPS) algorithm + + Notebook: C8/C8S1_HPS.ipynb + + Args: + x (np.ndarray): Input signal + Fs (scalar): Sampling rate of x + N (int): Frame length + H (int): Hopsize + L_h (float): Horizontal median filter length given in seconds or frames + L_p (float): Percussive median filter length given in Hertz or bins + L_unit (str): Adjusts unit, either 'pyhsical' or 'indices' (Default value = 'physical') + mask (str): Either 'binary' or 'soft' (Default value = 'binary') + eps (float): Parameter used in soft maskig (Default value = 0.001) + detail (bool): Returns detailed information (Default value = False) + + Returns: + x_h (np.ndarray): Harmonic signal + x_p (np.ndarray): Percussive signal + details (dict): Dictionary containing detailed information; returned if ``detail=True`` + """ + assert L_unit in ['physical', 'indices'] + assert mask in ['binary', 'soft'] + # stft + X = librosa.stft(x, n_fft=N, hop_length=H, win_length=N, window='hann', center=True, pad_mode='constant') + # power spectrogram + Y = np.abs(X) ** 2 + # median filtering + if L_unit == 'physical': + L_h = convert_l_sec_to_frames(L_h_sec=L_h, Fs=Fs, N=N, H=H) + L_p = convert_l_hertz_to_bins(L_p_Hz=L_p, Fs=Fs, N=N, H=H) + L_h = make_integer_odd(L_h) + L_p = make_integer_odd(L_p) + Y_h = signal.medfilt(Y, [1, L_h]) + Y_p = signal.medfilt(Y, [L_p, 1]) + + # masking + if mask == 'binary': + M_h = np.int8(Y_h >= Y_p) + M_p = np.int8(Y_h < Y_p) + if mask == 'soft': + eps = 0.00001 + M_h = (Y_h + eps / 2) / (Y_h + Y_p + eps) + M_p = (Y_p + eps / 2) / (Y_h + Y_p + eps) + X_h = X * M_h + X_p = X * M_p + + # istft + x_h = librosa.istft(X_h, hop_length=H, win_length=N, window='hann', center=True, length=x.size) + x_p = librosa.istft(X_p, hop_length=H, win_length=N, window='hann', center=True, length=x.size) + + if detail: + return x_h, x_p, dict(Y_h=Y_h, Y_p=Y_p, M_h=M_h, M_p=M_p, X_h=X_h, X_p=X_p) + else: + return x_h, x_p
+ + +
[docs]def generate_audio_tag_html_list(list_x, Fs, width='150', height='40'): + """Generates audio tag for html needed to be shown in table + + Notebook: C8/C8S1_HPS.ipynb + + Args: + list_x (list): List of waveforms + Fs (scalar): Sample rate + width (str): Width in px (Default value = '150') + height (str): Height in px (Default value = '40') + + Returns: + audio_tag_html_list (list): List of HTML strings with audio tags + """ + audio_tag_html_list = [] + for i in range(len(list_x)): + audio_tag = ipd.Audio(list_x[i], rate=Fs) + audio_tag_html = audio_tag._repr_html_().replace('\n', '').strip() + audio_tag_html = audio_tag_html.replace('<audio ', + '<audio style="width: '+width+'px; height: '+height+'px;"') + audio_tag_html_list.append(audio_tag_html) + return audio_tag_html_list
+ + +
[docs]def hrps(x, Fs, N, H, L_h, L_p, beta=2.0, L_unit='physical', detail=False): + """Harmonic-residual-percussive separation (HRPS) algorithm + + Notebook: C8/C8S1_HRPS.ipynb + + Args: + x (np.ndarray): Input signal + Fs (scalar): Sampling rate of x + N (int): Frame length + H (int): Hopsize + L_h (float): Horizontal median filter length given in seconds or frames + L_p (float): Percussive median filter length given in Hertz or bins + beta (float): Separation factor (Default value = 2.0) + L_unit (str): Adjusts unit, either 'pyhsical' or 'indices' (Default value = 'physical') + detail (bool): Returns detailed information (Default value = False) + + Returns: + x_h (np.ndarray): Harmonic signal + x_p (np.ndarray): Percussive signal + x_r (np.ndarray): Residual signal + details (dict): Dictionary containing detailed information; returned if "detail=True" + """ + assert L_unit in ['physical', 'indices'] + # stft + X = librosa.stft(x, n_fft=N, hop_length=H, win_length=N, window='hann', center=True, pad_mode='constant') + # power spectrogram + Y = np.abs(X) ** 2 + # median filtering + if L_unit == 'physical': + L_h = convert_l_sec_to_frames(L_h_sec=L_h, Fs=Fs, N=N, H=H) + L_p = convert_l_hertz_to_bins(L_p_Hz=L_p, Fs=Fs, N=N, H=H) + L_h = make_integer_odd(L_h) + L_p = make_integer_odd(L_p) + Y_h = signal.medfilt(Y, [1, L_h]) + Y_p = signal.medfilt(Y, [L_p, 1]) + + # masking + M_h = np.int8(Y_h >= beta * Y_p) + M_p = np.int8(Y_p > beta * Y_h) + M_r = 1 - (M_h + M_p) + X_h = X * M_h + X_p = X * M_p + X_r = X * M_r + + # istft + x_h = librosa.istft(X_h, hop_length=H, win_length=N, window='hann', center=True, length=x.size) + x_p = librosa.istft(X_p, hop_length=H, win_length=N, window='hann', center=True, length=x.size) + x_r = librosa.istft(X_r, hop_length=H, win_length=N, window='hann', center=True, length=x.size) + + if detail: + return x_h, x_p, x_r, dict(Y_h=Y_h, Y_p=Y_p, M_h=M_h, M_r=M_r, M_p=M_p, X_h=X_h, X_r=X_r, X_p=X_p) + else: + return x_h, x_p, x_r
+ + +
[docs]def experiment_hps_parameter(fn_wav, param_list): + """Script for running an HPS experiment over a parameter list, such as ``[[1024, 256, 0.1, 100], ...]`` + + Notebook: C8/C8S1_HPS.ipynb + + Args: + fn_wav (str): Path to wave file + param_list (list): List of parameters + """ + Fs = 22050 + x, Fs = librosa.load(fn_wav, sr=Fs) + + list_x = [] + list_x_h = [] + list_x_p = [] + list_N = [] + list_H = [] + list_L_h_sec = [] + list_L_p_Hz = [] + list_L_h = [] + list_L_p = [] + + for param in param_list: + N, H, L_h_sec, L_p_Hz = param + print('N=%4d, H=%4d, L_h_sec=%4.2f, L_p_Hz=%3.1f' % (N, H, L_h_sec, L_p_Hz)) + x_h, x_p = hps(x, Fs=Fs, N=N, H=H, L_h=L_h_sec, L_p=L_p_Hz) + L_h = convert_l_sec_to_frames(L_h_sec=L_h_sec, Fs=Fs, N=N, H=H) + L_p = convert_l_hertz_to_bins(L_p_Hz=L_p_Hz, Fs=Fs, N=N, H=H) + list_x.append(x) + list_x_h.append(x_h) + list_x_p.append(x_p) + list_N.append(N) + list_H.append(H) + list_L_h_sec.append(L_h_sec) + list_L_p_Hz.append(L_p_Hz) + list_L_h.append(L_h) + list_L_p.append(L_p) + + html_x = generate_audio_tag_html_list(list_x, Fs=Fs) + html_x_h = generate_audio_tag_html_list(list_x_h, Fs=Fs) + html_x_p = generate_audio_tag_html_list(list_x_p, Fs=Fs) + + pd.options.display.float_format = '{:,.1f}'.format + pd.set_option('display.max_colwidth', None) + df = pd.DataFrame(OrderedDict([ + ('$N$', list_N), + ('$H$', list_H), + ('$L_h$ (sec)', list_L_h_sec), + ('$L_p$ (Hz)', list_L_p_Hz), + ('$L_h$', list_L_h), + ('$L_p$', list_L_p), + ('$x$', html_x), + ('$x_h$', html_x_h), + ('$x_p$', html_x_p)])) + df.index = np.arange(1, len(df) + 1) + ipd.display(ipd.HTML(df.to_html(escape=False, index=False)))
+ + +
[docs]def experiment_hrps_parameter(fn_wav, param_list): + """Script for running an HRPS experiment over a parameter list, such as ``[[1024, 256, 0.1, 100], ...]`` + + Args: + fn_wav (str): Path to wave file + param_list (list): List of parameters + """ + Fs = 22050 + x, Fs = librosa.load(fn_wav, sr=Fs) + + list_x = [] + list_x_h = [] + list_x_p = [] + list_x_r = [] + list_N = [] + list_H = [] + list_L_h_sec = [] + list_L_p_Hz = [] + list_L_h = [] + list_L_p = [] + list_beta = [] + + for param in param_list: + N, H, L_h_sec, L_p_Hz, beta = param + print('N=%4d, H=%4d, L_h_sec=%4.2f, L_p_Hz=%3.1f, beta=%3.1f' % (N, H, L_h_sec, L_p_Hz, beta)) + x_h, x_p, x_r = hrps(x, Fs=Fs, N=1024, H=512, L_h=L_h_sec, L_p=L_p_Hz, beta=beta) + L_h = convert_l_sec_to_frames(L_h_sec=L_h_sec, Fs=Fs, N=N, H=H) + L_p = convert_l_hertz_to_bins(L_p_Hz=L_p_Hz, Fs=Fs, N=N, H=H) + list_x.append(x) + list_x_h.append(x_h) + list_x_p.append(x_p) + list_x_r.append(x_r) + list_N.append(N) + list_H.append(H) + list_L_h_sec.append(L_h_sec) + list_L_p_Hz.append(L_p_Hz) + list_L_h.append(L_h) + list_L_p.append(L_p) + list_beta.append(beta) + + html_x = generate_audio_tag_html_list(list_x, Fs=Fs) + html_x_h = generate_audio_tag_html_list(list_x_h, Fs=Fs) + html_x_p = generate_audio_tag_html_list(list_x_p, Fs=Fs) + html_x_r = generate_audio_tag_html_list(list_x_r, Fs=Fs) + + pd.options.display.float_format = '{:,.1f}'.format + pd.set_option('display.max_colwidth', None) + df = pd.DataFrame(OrderedDict([ + ('$N$', list_N), + ('$H$', list_H), + ('$L_h$ (sec)', list_L_h_sec), + ('$L_p$ (Hz)', list_L_p_Hz), + ('$L_h$', list_L_h), + ('$L_p$', list_L_p), + ('$\\beta$', list_beta), + ('$x$', html_x), + ('$x_h$', html_x_h), + ('$x_r$', html_x_r), + ('$x_p$', html_x_p)])) + + df.index = np.arange(1, len(df) + 1) + ipd.display(ipd.HTML(df.to_html(escape=False, index=False)))
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c8/c8s2_f0.html b/docs/build/html/_modules/libfmp/c8/c8s2_f0.html new file mode 100644 index 0000000..4041ca4 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c8/c8s2_f0.html @@ -0,0 +1,694 @@ + + + + + + + + + + libfmp.c8.c8s2_f0 — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c8.c8s2_f0
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c8.c8s2_f0

+"""
+Module: libfmp.c8.c8s2_f0
+Author: Sebastian Rosenzweig, Meinard Müller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+
+import numpy as np
+import librosa
+from scipy import ndimage, linalg
+from scipy.interpolate import interp1d
+from numba import jit
+import matplotlib
+import matplotlib.pyplot as plt
+
+import libfmp.b
+
+
+
[docs]def hz_to_cents(F, F_ref=55.0): + """Converts frequency in Hz to cents + + Notebook: C8/C8S2_FundFreqTracking.ipynb + + Args: + F (float or np.ndarray): Frequency value in Hz + F_ref (float): Reference frequency in Hz (Default value = 55.0) + + Returns: + F_cent (float or np.ndarray): Frequency in cents + """ + F_cent = 1200 * np.log2(F / F_ref) + return F_cent
+ + +
[docs]def cents_to_hz(F_cent, F_ref=55.0): + """Converts frequency in cents to Hz + + Notebook: C8/C8S2_FundFreqTracking.ipynb + + Args: + F_cent (float or np.ndarray): Frequency in cents + F_ref (float): Reference frequency in Hz (Default value = 55.0) + + Returns: + F (float or np.ndarray): Frequency in Hz + """ + F = F_ref * 2 ** (F_cent / 1200) + return F
+ + +
[docs]def sonify_trajectory_with_sinusoid(traj, audio_len, Fs=22050, amplitude=0.3, smooth_len=11): + """Sonification of trajectory with sinusoidal + + Notebook: C8/C8S2_FundFreqTracking.ipynb + + Args: + traj (np.ndarray): F0 trajectory (time in seconds, frequency in Hz) + audio_len (int): Desired audio length in samples + Fs (scalar): Sampling rate (Default value = 22050) + amplitude (float): Amplitude (Default value = 0.3) + smooth_len (int): Length of amplitude smoothing filter (Default value = 11) + + Returns: + x_soni (np.ndarray): Sonification + """ + # unit confidence if not specified + if traj.shape[1] < 3: + confidence = np.zeros(traj.shape[0]) + confidence[traj[:, 1] > 0] = amplitude + else: + confidence = traj[:, 2] + + # initialize + x_soni = np.zeros(audio_len) + amplitude_mod = np.zeros(audio_len) + + # Computation of hop size + # sine_len = int(2 ** np.round(np.log(traj[1, 0]*Fs) / np.log(2))) + sine_len = int(traj[1, 0] * Fs) + + t = np.arange(0, sine_len) / Fs + phase = 0 + + # loop over all F0 values, insure continuous phase + for idx in np.arange(0, traj.shape[0]): + cur_f = traj[idx, 1] + cur_amp = confidence[idx] + + if cur_f == 0: + phase = 0 + continue + + cur_soni = np.sin(2*np.pi*(cur_f*t+phase)) + diff = np.maximum(0, (idx+1)*sine_len - len(x_soni)) + if diff > 0: + x_soni[idx * sine_len:(idx + 1) * sine_len - diff] = cur_soni[:-diff] + amplitude_mod[idx * sine_len:(idx + 1) * sine_len - diff] = cur_amp + else: + x_soni[idx*sine_len:(idx+1)*sine_len-diff] = cur_soni + amplitude_mod[idx*sine_len:(idx+1)*sine_len-diff] = cur_amp + + phase += cur_f * sine_len / Fs + phase -= 2 * np.round(phase/2) + + # filter amplitudes to avoid transients + amplitude_mod = np.convolve(amplitude_mod, np.hanning(smooth_len)/np.sum(np.hanning(smooth_len)), 'same') + x_soni = x_soni * amplitude_mod + return x_soni
+ + +
[docs]def visualize_salience_traj_constraints(Z, T_coef, F_coef_cents, F_ref=55.0, colorbar=True, cmap='gray_r', + figsize=(7, 4), traj=None, constraint_region=None, ax=None): + """Visualize salience representation with optional F0-trajectory and constraint regions + + Notebook: C8/C8S2_FundFreqTracking.ipynb + + Args: + Z: Salience representation + T_coef: Time axis + F_coef_cents: Frequency axis in cents + F_ref: Reference frequency (Default value = 55.0) + colorbar: Show or hide colorbar (Default value = True) + cmap: Color map (Default value = 'gray_r') + figsize: Figure size (Default value = (7, 4)) + traj: F0 trajectory (time in seconds, frequency in Hz) (Default value = None) + constraint_region: Constraint regions, row-format: (t_start_sec, t_end_sec, f_start_hz, f_end,hz) + (Default value = None) + ax: Handle to existing axis (Default value = None) + + Returns: + fig: Handle to figure + ax: Handle to cent axis + ax_f: Handle to frequency axis + """ + fig = None + if ax is None: + fig, ax = plt.subplots(1, 1, figsize=figsize) + + sal = ax.imshow(Z, extent=[T_coef[0], T_coef[-1], F_coef_cents[0], F_coef_cents[-1]], + cmap=cmap, origin='lower', aspect='auto') + + y_ticklabels_left = np.arange(F_coef_cents[0], F_coef_cents[-1]+1, 1200) + ax.set_yticks(y_ticklabels_left) + ax.set_yticklabels(y_ticklabels_left) + ax.set_ylabel('Frequency (Cents)') + + plt.colorbar(sal, ax=ax, pad=0.1) + + ax_f = ax.twinx() # instantiate a second axes that shares the same y-axis + ax_f.set_yticks(y_ticklabels_left - F_coef_cents[0]) + y_ticklabels_right = cents_to_hz(y_ticklabels_left, F_ref).astype(int) + ax_f.set_yticklabels(y_ticklabels_right) + ax_f.set_ylabel('Frequency (Hz)') + + # plot contour + if traj is not None: + traj_plot = traj[traj[:, 1] > 0, :] + traj_plot[:, 1] = hz_to_cents(traj_plot[:, 1], F_ref) + ax.plot(traj_plot[:, 0], traj_plot[:, 1], color='r', markersize=4, marker='.', linestyle='') + + # plot constraint regions + if constraint_region is not None: + for row in constraint_region: + t_start = row[0] # sec + t_end = row[1] # sec + f_start = row[2] # Hz + f_end = row[3] # Hz + ax.add_patch(matplotlib.patches.Rectangle(( + t_start, hz_to_cents(f_start, F_ref)), width=t_end-t_start, + height=hz_to_cents(f_end, F_ref)-hz_to_cents(f_start, F_ref), + fill=False, edgecolor='k', linewidth=3, zorder=2)) + + ax.set_xlabel('Time (seconds)') + + if fig is not None: + plt.tight_layout() + + return fig, ax, ax_f
+ + +# @jit(nopython=True) +
[docs]def define_transition_matrix(B, tol=0, score_low=0.01, score_high=1.0): + """Generate transition matrix + + Notebook: C8/C8S2_FundFreqTracking.ipynb + + Args: + B (int): Number of bins + tol (int): Tolerance parameter for transition matrix (Default value = 0) + score_low (float): Score (low) for transition matrix (Default value = 0.01) + score_high (float): Score (high) for transition matrix (Default value = 1.0) + + Returns: + T (np.ndarray): Transition matrix + """ + col = np.ones((B,)) * score_low + col[0:tol+1] = np.ones((tol+1, )) * score_high + T = linalg.toeplitz(col) + return T
+ + +
[docs]@jit(nopython=True) +def compute_trajectory_dp(Z, T): + """Trajectory tracking using dynamic programming + + Notebook: C8/C8S2_FundFreqTracking.ipynb + + Args: + Z: Salience representation + T: Transisition matrix + + Returns: + eta_DP (np.ndarray): Trajectory indices + """ + B, N = Z.shape + eps_machine = np.finfo(np.float32).eps + Z_log = np.log(Z + eps_machine) + T_log = np.log(T + eps_machine) + + E = np.zeros((B, N)) + D = np.zeros((B, N)) + D[:, 0] = Z_log[:, 0] + + for n in np.arange(1, N): + for b in np.arange(0, B): + D[b, n] = np.max(T_log[b, :] + D[:, n-1]) + Z_log[b, n] + E[b, n-1] = np.argmax(T_log[b, :] + D[:, n-1]) + + # backtracking + eta_DP = np.zeros(N) + eta_DP[N-1] = int(np.argmax(D[:, N-1])) + + for n in np.arange(N-2, -1, -1): + eta_DP[n] = E[int(eta_DP[n+1]), n] + + return eta_DP.astype(np.int64)
+ + +
[docs]def convert_ann_to_constraint_region(ann, tol_freq_cents=300.0): + """Convert score annotations to constraint regions + + Notebook: C8/C8S2_FundFreqTracking.ipynb + + Args: + ann (list): Score annotations [[start_time, end_time, MIDI_pitch], ... + tol_freq_cents (float): Tolerance in pitch directions specified in cents (Default value = 300.0) + + Returns: + constraint_region (np.ndarray): Constraint regions + """ + tol_pitch = tol_freq_cents / 100 + freq_lower = 2 ** ((ann[:, 2] - tol_pitch - 69)/12) * 440 + freq_upper = 2 ** ((ann[:, 2] + tol_pitch - 69)/12) * 440 + constraint_region = np.concatenate((ann[:, 0:2], + freq_lower.reshape(-1, 1), + freq_upper.reshape(-1, 1)), axis=1) + return constraint_region
+ + +# @jit(nopython=True) +
[docs]def compute_trajectory_cr(Z, T_coef, F_coef_hertz, constraint_region=None, + tol=5, score_low=0.01, score_high=1.0): + """Trajectory tracking with constraint regions + + Notebook: C8/C8S2_FundFreqTracking.ipynb + + Args: + Z (np.ndarray): Salience representation + T_coef (np.ndarray): Time axis + F_coef_hertz (np.ndarray): Frequency axis in Hz + constraint_region (np.ndarray): Constraint regions, row-format: (t_start_sec, t_end_sec, f_start_hz, f_end_hz) + (Default value = None) + tol (int): Tolerance parameter for transition matrix (Default value = 5) + score_low (float): Score (low) for transition matrix (Default value = 0.01) + score_high (float): Score (high) for transition matrix (Default value = 1.0) + + Returns: + eta (np.ndarray): Trajectory indices, unvoiced frames are indicated with -1 + """ + # do tracking within every constraint region + if constraint_region is not None: + # initialize contour, unvoiced frames are indicated with -1 + eta = np.full(len(T_coef), -1) + + for row_idx in range(constraint_region.shape[0]): + t_start = constraint_region[row_idx, 0] # sec + t_end = constraint_region[row_idx, 1] # sec + f_start = constraint_region[row_idx, 2] # Hz + f_end = constraint_region[row_idx, 3] # Hz + + # convert start/end values to indices + t_start_idx = np.argmin(np.abs(T_coef - t_start)) + t_end_idx = np.argmin(np.abs(T_coef - t_end)) + f_start_idx = np.argmin(np.abs(F_coef_hertz - f_start)) + f_end_idx = np.argmin(np.abs(F_coef_hertz - f_end)) + + # track in salience part + cur_Z = Z[f_start_idx:f_end_idx+1, t_start_idx:t_end_idx+1] + T = define_transition_matrix(cur_Z.shape[0], tol=tol, + score_low=score_low, score_high=score_high) + cur_eta = compute_trajectory_dp(cur_Z, T) + + # fill contour + eta[t_start_idx:t_end_idx+1] = f_start_idx + cur_eta + else: + T = define_transition_matrix(Z.shape[0], tol=tol, score_low=score_low, score_high=score_high) + eta = compute_trajectory_dp(Z, T) + + return eta
+ + +
[docs]def compute_traj_from_audio(x, Fs=22050, N=1024, H=128, R=10.0, F_min=55.0, F_max=1760.0, + num_harm=10, freq_smooth_len=11, alpha=0.9, gamma=0.0, + constraint_region=None, tol=5, score_low=0.01, score_high=1.0): + """Compute F0 contour from audio signal + + Notebook: C8/C8S2_FundFreqTracking.ipynb + + Args: + x (np.ndarray): Audio signal + Fs (scalar): Sampling frequency (Default value = 22050) + N (int): Window length in samples (Default value = 1024) + H (int): Hopsize in samples (Default value = 128) + R (float): Frequency resolution in cents (Default value = 10.0) + F_min (float): Lower frequency bound (reference frequency) (Default value = 55.0) + F_max (float): Upper frequency bound (Default value = 1760.0) + num_harm (int): Number of harmonics (Default value = 10) + freq_smooth_len (int): Filter length for vertical smoothing (Default value = 11) + alpha (float): Weighting parameter for harmonics (Default value = 0.9) + gamma (float): Logarithmic compression factor (Default value = 0.0) + constraint_region (np.ndarray): Constraint regions, row-format: (t_start_sec, t_end_sec, f_start_hz, f_end,hz) + (Default value = None) + tol (int): Tolerance parameter for transition matrix (Default value = 5) + score_low (float): Score (low) for transition matrix (Default value = 0.01) + score_high (float): Score (high) for transition matrix (Default value = 1.0) + + Returns: + traj (np.ndarray): F0 contour, time in seconds in 1st column, frequency in Hz in 2nd column + Z (np.ndarray): Salience representation + T_coef (np.ndarray): Time axis + F_coef_hertz (np.ndarray): Frequency axis in Hz + F_coef_cents (np.ndarray): Frequency axis in cents + """ + Z, F_coef_hertz, F_coef_cents = libfmp.c8.compute_salience_rep( + x, Fs, N=N, H=H, R=R, F_min=F_min, F_max=F_max, num_harm=num_harm, freq_smooth_len=freq_smooth_len, + alpha=alpha, gamma=gamma) + + T_coef = (np.arange(Z.shape[1]) * H) / Fs + index_CR = compute_trajectory_cr(Z, T_coef, F_coef_hertz, constraint_region, + tol=tol, score_low=score_low, score_high=score_high) + + traj = np.hstack((T_coef.reshape(-1, 1), F_coef_hertz[index_CR].reshape(-1, 1))) + traj[index_CR == -1, 1] = 0 + return traj, Z, T_coef, F_coef_hertz, F_coef_cents
+ + +
[docs]def convert_trajectory_to_mask_bin(traj, F_coef, n_harmonics=1, tol_bin=0): + """Computes binary mask from F0 trajectory + + Notebook: C8/C8S2_MelodyExtractSep.ipynb + + Args: + traj (np.ndarray): F0 trajectory (time in seconds in 1st column, frequency in Hz in 2nd column) + F_coef (np.ndarray): Frequency axis + n_harmonics (int): Number of harmonics (Default value = 1) + tol_bin (int): Tolerance in frequency bins (Default value = 0) + + Returns: + mask (np.ndarray): Binary mask + """ + # Compute STFT bin for trajectory + traj_bin = np.argmin(np.abs(F_coef[:, None] - traj[:, 1][None, :]), axis=0) + + K = len(F_coef) + N = traj.shape[0] + max_idx_harm = np.max([K, np.max(traj_bin)*n_harmonics]) + mask_pad = np.zeros((max_idx_harm.astype(int)+1, N)) + + for h in range(n_harmonics): + mask_pad[traj_bin*h, np.arange(N)] = 1 + mask = mask_pad[1:K+1, :] + + if tol_bin > 0: + smooth_len = 2*tol_bin + 1 + mask = ndimage.filters.maximum_filter1d(mask, smooth_len, axis=0, mode='constant', cval=0, origin=0) + + return mask
+ + +
[docs]def convert_trajectory_to_mask_cent(traj, F_coef, n_harmonics=1, tol_cent=0.0): + """Computes binary mask from F0 trajectory + + Notebook: C8/C8S2_MelodyExtractSep.ipynb + + Args: + traj (np.ndarray): F0 trajectory (time in seconds in 1st column, frequency in Hz in 2nd column) + F_coef (np.ndarray): Frequency axis + n_harmonics (int): Number of harmonics (Default value = 1) + tol_cent (float): Tolerance in cents (Default value = 0.0) + + Returns: + mask (np.ndarray): Binary mask + """ + K = len(F_coef) + N = traj.shape[0] + mask = np.zeros((K, N)) + + freq_res = F_coef[1] - F_coef[0] + tol_factor = np.power(2, tol_cent/1200) + F_coef_upper = F_coef * tol_factor + F_coef_lower = F_coef / tol_factor + F_coef_upper_bin = (np.ceil(F_coef_upper / freq_res)).astype(int) + F_coef_upper_bin[F_coef_upper_bin > K-1] = K-1 + F_coef_lower_bin = (np.floor(F_coef_lower / freq_res)).astype(int) + + for n in range(N): + for h in range(n_harmonics): + freq = traj[n, 1] * (1 + h) + freq_bin = np.round(freq / freq_res).astype(int) + if freq_bin < K: + idx_upper = F_coef_upper_bin[freq_bin] + idx_lower = F_coef_lower_bin[freq_bin] + mask[idx_lower:idx_upper+1, n] = 1 + return mask
+ + +
[docs]def separate_melody_accompaniment(x, Fs, N, H, traj, n_harmonics=10, tol_cent=50.0): + """F0-based melody-accompaniement separation + + Notebook: C8/C8S2_MelodyExtractSep.ipynb + + Args: + x (np.ndarray): Audio signal + Fs (scalar): Sampling frequency + N (int): Window size in samples + H (int): Hopsize in samples + traj (np.ndarray): F0 traj (time in seconds in 1st column, frequency in Hz in 2nd column) + n_harmonics (int): Number of harmonics (Default value = 10) + tol_cent (float): Tolerance in cents (Default value = 50.0) + + Returns: + x_mel (np.ndarray): Reconstructed audio signal for melody + x_acc (np.ndarray): Reconstructed audio signal for accompaniement + """ + # Compute STFT + X = librosa.stft(x, n_fft=N, hop_length=H, win_length=N, pad_mode='constant') + Fs_feature = Fs / H + T_coef = np.arange(X.shape[1]) / Fs_feature + freq_res = Fs / N + F_coef = np.arange(X.shape[0]) * freq_res + + # Adjust trajectory + traj_X_values = interp1d(traj[:, 0], traj[:, 1], kind='nearest', fill_value='extrapolate')(T_coef) + traj_X = np.hstack((T_coef[:, None], traj_X_values[:, None, ])) + + # Compute binary masks + mask_mel = convert_trajectory_to_mask_cent(traj_X, F_coef, n_harmonics=n_harmonics, tol_cent=tol_cent) + mask_acc = np.ones(mask_mel.shape) - mask_mel + + # Compute masked STFTs + X_mel = X * mask_mel + X_acc = X * mask_acc + + # Reconstruct signals + x_mel = librosa.istft(X_mel, hop_length=H, win_length=N, window='hann', center=True, length=x.size) + x_acc = librosa.istft(X_acc, hop_length=H, win_length=N, window='hann', center=True, length=x.size) + + return x_mel, x_acc
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c8/c8s2_salience.html b/docs/build/html/_modules/libfmp/c8/c8s2_salience.html new file mode 100644 index 0000000..65702c9 --- /dev/null +++ b/docs/build/html/_modules/libfmp/c8/c8s2_salience.html @@ -0,0 +1,527 @@ + + + + + + + + + + libfmp.c8.c8s2_salience — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c8.c8s2_salience
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c8.c8s2_salience

+"""
+Module: libfmp.c8.c8s2_salience
+Author: Sebastian Rosenzweig, Meinard Müller
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+
+import numpy as np
+import librosa
+from scipy import ndimage
+from numba import jit
+
+import libfmp.b
+
+
+
[docs]@jit(nopython=True) +def principal_argument(v): + """Principal argument function + + | Notebook: C6/C6S1_NoveltyPhase.ipynb, see also + | Notebook: C8/C8S2_InstantFreqEstimation.ipynb + + Args: + v (float or np.ndarray): Value (or vector of values) + + Returns: + w (float or np.ndarray): Principle value of v + """ + w = np.mod(v + 0.5, 1) - 0.5 + return w
+ + +
[docs]@jit(nopython=True) +def compute_if(X, Fs, N, H): + """Instantenous frequency (IF) estamation + + | Notebook: C8/C8S2_InstantFreqEstimation.ipynb, see also + | Notebook: C6/C6S1_NoveltyPhase.ipynb + + Args: + X (np.ndarray): STFT + Fs (scalar): Sampling rate + N (int): Window size in samples + H (int): Hop size in samples + + Returns: + F_coef_IF (np.ndarray): Matrix of IF values + """ + phi_1 = np.angle(X[:, 0:-1]) / (2 * np.pi) + phi_2 = np.angle(X[:, 1:]) / (2 * np.pi) + + K = X.shape[0] + index_k = np.arange(0, K).reshape(-1, 1) + # Bin offset (FMP, Eq. (8.45)) + kappa = (N / H) * principal_argument(phi_2 - phi_1 - index_k * H / N) + # Instantaneous frequencies (FMP, Eq. (8.44)) + F_coef_IF = (index_k + kappa) * Fs / N + + # Extend F_coef_IF by copying first column to match dimensions of X + F_coef_IF = np.hstack((np.copy(F_coef_IF[:, 0]).reshape(-1, 1), F_coef_IF)) + + return F_coef_IF
+ + +
[docs]@jit(nopython=True) +def f_coef(k, Fs, N): + """STFT center frequency + + Notebook: C8/C8S2_SalienceRepresentation.ipynb + + Args: + k (int): Coefficient number + Fs (scalar): Sampling rate in Hz + N (int): Window length in samples + + Returns: + freq (float): STFT center frequency + """ + return k * Fs / N
+ + +
[docs]@jit(nopython=True) +def frequency_to_bin_index(F, R=10.0, F_ref=55.0): + """| Binning function with variable frequency resolution + | Note: Indexing starts with 0 (opposed to [FMP, Eq. (8.49)]) + + Notebook: C8/C8S2_SalienceRepresentation.ipynb + + Args: + F (float): Frequency in Hz + R (float): Frequency resolution in cents (Default value = 10.0) + F_ref (float): Reference frequency in Hz (Default value = 55.0) + + Returns: + bin_index (int): Index for bin (starting with index 0) + """ + bin_index = np.floor((1200 / R) * np.log2(F / F_ref) + 0.5).astype(np.int64) + return bin_index
+ + +
[docs]@jit(nopython=True) +def p_bin(b, freq, R=10.0, F_ref=55.0): + """Computes binning mask [FMP, Eq. (8.50)] + + Notebook: C8/C8S2_SalienceRepresentation.ipynb + + Args: + b (int): Bin index + freq (float): Center frequency + R (float): Frequency resolution in cents (Default value = 10.0) + F_ref (float): Reference frequency in Hz (Default value = 55.0) + + Returns: + mask (float): Binning mask + """ + mask = frequency_to_bin_index(freq, R, F_ref) == b + mask = mask.reshape(-1, 1) + return mask
+ + +
[docs]@jit(nopython=True) +def compute_y_lf_bin(Y, Fs, N, R=10.0, F_min=55.0, F_max=1760.0): + """Log-frequency Spectrogram with variable frequency resolution using binning + + Notebook: C8/C8S2_SalienceRepresentation.ipynb + + Args: + Y (np.ndarray): Magnitude spectrogram + Fs (scalar): Sampling rate in Hz + N (int): Window length in samples + R (float): Frequency resolution in cents (Default value = 10.0) + F_min (float): Lower frequency bound (reference frequency) (Default value = 55.0) + F_max (float): Upper frequency bound (is included) (Default value = 1760.0) + + Returns: + Y_LF_bin (np.ndarray): Binned log-frequency spectrogram + F_coef_hertz (np.ndarray): Frequency axis in Hz + F_coef_cents (np.ndarray): Frequency axis in cents + """ + # [FMP, Eq. (8.51)] + B = frequency_to_bin_index(np.array([F_max]), R, F_min)[0] + 1 + F_coef_hertz = 2 ** (np.arange(0, B) * R / 1200) * F_min + F_coef_cents = np.arange(0, B*R, R) + Y_LF_bin = np.zeros((B, Y.shape[1])) + + K = Y.shape[0] + freq = f_coef(np.arange(0, K), Fs, N) + freq_lim_idx = np.where(np.logical_and(freq >= F_min, freq <= F_max))[0] + freq_lim = freq[freq_lim_idx] + Y_lim = Y[freq_lim_idx, :] + + for b in range(B): + coef_mask = p_bin(b, freq_lim, R, F_min) + Y_LF_bin[b, :] = (Y_lim*coef_mask).sum(axis=0) + return Y_LF_bin, F_coef_hertz, F_coef_cents
+ + +
[docs]@jit(nopython=True) +def p_bin_if(b, F_coef_IF, R=10.0, F_ref=55.0): + """Computes binning mask for instantaneous frequency binning [FMP, Eq. (8.52)] + + Notebook: C8/C8S2_SalienceRepresentation.ipynb + + Args: + b (int): Bin index + F_coef_IF (float): Instantaneous frequencies + R (float): Frequency resolution in cents (Default value = 10.0) + F_ref (float): Reference frequency in Hz (Default value = 55.0) + + Returns: + mask (np.ndarray): Binning mask + """ + mask = frequency_to_bin_index(F_coef_IF, R, F_ref) == b + return mask
+ + +
[docs]@jit(nopython=True) +def compute_y_lf_if_bin(X, Fs, N, H, R=10, F_min=55.0, F_max=1760.0, gamma=0.0): + """Binned Log-frequency Spectrogram with variable frequency resolution based on instantaneous frequency + + Notebook: C8/C8S2_SalienceRepresentation.ipynb + + Args: + X (np.ndarray): Complex spectrogram + Fs (scalar): Sampling rate in Hz + N (int): Window length in samples + H (int): Hopsize in samples + R (float): Frequency resolution in cents (Default value = 10) + F_min (float): Lower frequency bound (reference frequency) (Default value = 55.0) + F_max (float): Upper frequency bound (Default value = 1760.0) + gamma (float): Logarithmic compression factor (Default value = 0.0) + + Returns: + Y_LF_IF_bin (np.ndarray): Binned log-frequency spectrogram using instantaneous frequency + F_coef_hertz (np.ndarray): Frequency axis in Hz + F_coef_cents (np.ndarray): Frequency axis in cents + """ + # Compute instantaneous frequencies + F_coef_IF = libfmp.c8.compute_if(X, Fs, N, H) + freq_lim_mask = np.logical_and(F_coef_IF >= F_min, F_coef_IF < F_max) + F_coef_IF = F_coef_IF * freq_lim_mask + + # Initialize ouput array and compute frequency axis + B = frequency_to_bin_index(np.array([F_max]), R, F_min)[0] + 1 + F_coef_hertz = 2 ** (np.arange(0, B) * R / 1200) * F_min + F_coef_cents = np.arange(0, B*R, R) + Y_LF_IF_bin = np.zeros((B, X.shape[1])) + + # Magnitude binning + if gamma == 0: + Y = np.abs(X) ** 2 + else: + Y = np.log(1 + np.float32(gamma)*np.abs(X)) + for b in range(B): + coef_mask = p_bin_if(b, F_coef_IF, R, F_min) + + Y_LF_IF_bin[b, :] = (Y * coef_mask).sum(axis=0) + return Y_LF_IF_bin, F_coef_hertz, F_coef_cents
+ + +
[docs]@jit(nopython=True) +def harmonic_summation(Y, num_harm=10, alpha=1.0): + """Harmonic summation for spectrogram [FMP, Eq. (8.54)] + + Notebook: C8/C8S2_SalienceRepresentation.ipynb + + Args: + Y (np.ndarray): Magnitude spectrogram + num_harm (int): Number of harmonics (Default value = 10) + alpha (float): Weighting parameter (Default value = 1.0) + + Returns: + Y_HS (np.ndarray): Spectrogram after harmonic summation + """ + Y_HS = np.zeros(Y.shape) + Y_zero_pad = np.vstack((Y, np.zeros((Y.shape[0]*num_harm, Y.shape[1])))) + K = Y.shape[0] + for k in range(K): + harm_idx = np.arange(1, num_harm+1)*(k) + weights = alpha ** (np.arange(1, num_harm+1) - 1).reshape(-1, 1) + Y_HS[k, :] = (Y_zero_pad[harm_idx, :] * weights).sum(axis=0) + return Y_HS
+ + +
[docs]@jit(nopython=True) +def harmonic_summation_lf(Y_LF_bin, R, num_harm=10, alpha=1.0): + """Harmonic summation for log-frequency spectrogram [FMP, Eq. (8.55)] + + Notebook: C8/C8S2_SalienceRepresentation.ipynb + + Args: + Y_LF_bin (np.ndarray): Log-frequency spectrogram + R (float): Frequency resolution in cents + num_harm (int): Number of harmonics (Default value = 10) + alpha (float): Weighting parameter (Default value = 1.0) + + Returns: + Y_LF_bin_HS (np.ndarray): Log-frequency spectrogram after harmonic summation + """ + Y_LF_bin_HS = np.zeros(Y_LF_bin.shape) + pad_len = int(np.floor(np.log2(num_harm) * 1200 / R)) + Y_LF_bin_zero_pad = np.vstack((Y_LF_bin, np.zeros((pad_len, Y_LF_bin.shape[1])))) + B = Y_LF_bin.shape[0] + for b in range(B): + harmonics = np.arange(1, num_harm+1) + harm_idx = b + np.floor(np.log2(harmonics) * 1200 / R).astype(np.int64) + weights = alpha ** (np.arange(1, num_harm+1) - 1).reshape(-1, 1) + Y_LF_bin_HS[b, :] = (Y_LF_bin_zero_pad[harm_idx, :] * weights).sum(axis=0) + return Y_LF_bin_HS
+ + +
[docs]def compute_salience_rep(x, Fs, N, H, R, F_min=55.0, F_max=1760.0, num_harm=10, freq_smooth_len=11, alpha=1.0, + gamma=0.0): + """Salience representation [FMP, Eq. (8.56)] + + Notebook: C8/C8S2_SalienceRepresentation.ipynb + + Args: + x (np.ndarray): Audio signal + Fs (scalar): Sampling frequency + N (int): Window length in samples + H (int): Hopsize in samples + R (float): Frequency resolution in cents + F_min (float): Lower frequency bound (reference frequency) (Default value = 55.0) + F_max (float): Upper frequency bound (Default value = 1760.0) + num_harm (int): Number of harmonics (Default value = 10) + freq_smooth_len (int): Filter length for vertical smoothing (Default value = 11) + alpha (float): Weighting parameter (Default value = 1.0) + gamma (float): Logarithmic compression factor (Default value = 0.0) + + Returns: + Z (np.ndarray): Salience representation + F_coef_hertz (np.ndarray): Frequency axis in Hz + F_coef_cents (np.ndarray): Frequency axis in cents + """ + X = librosa.stft(x, n_fft=N, hop_length=H, win_length=N, pad_mode='constant') + Y_LF_IF_bin, F_coef_hertz, F_coef_cents = compute_y_lf_if_bin(X, Fs, N, H, R, F_min, F_max, gamma=gamma) + # smoothing + Y_LF_IF_bin = ndimage.filters.convolve1d(Y_LF_IF_bin, np.hanning(freq_smooth_len), axis=0, mode='constant') + Z = harmonic_summation_lf(Y_LF_IF_bin, R=R, num_harm=num_harm, alpha=alpha) + return Z, F_coef_hertz, F_coef_cents
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_modules/libfmp/c8/c8s3_nmf.html b/docs/build/html/_modules/libfmp/c8/c8s3_nmf.html new file mode 100644 index 0000000..64358cd --- /dev/null +++ b/docs/build/html/_modules/libfmp/c8/c8s3_nmf.html @@ -0,0 +1,542 @@ + + + + + + + + + + libfmp.c8.c8s3_nmf — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Module code »
  • + +
  • libfmp.c8.c8s3_nmf
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ +

Source code for libfmp.c8.c8s3_nmf

+"""
+Module: libfmp.c8.c8s3_nmf
+Author: Meinard Müller, Tim Zunner
+License: The MIT license, https://opensource.org/licenses/MIT
+
+This file is part of the FMP Notebooks (https://www.audiolabs-erlangen.de/FMP)
+"""
+
+import numpy as np
+import matplotlib.pyplot as plt
+from numba import jit
+
+
+
[docs]@jit(nopython=True) +def nmf(V, R, thresh=0.001, L=1000, W=None, H=None, norm=False, report=False): + """NMF algorithm with Euclidean distance + + Notebook: C8/C8S3_NMFbasic.ipynb + + Args: + V (np.ndarray): Nonnegative matrix of size K x N + R (int): Rank parameter + thresh (float): Threshold used as stop criterion (Default value = 0.001) + L (int): Maximal number of iteration (Default value = 1000) + W (np.ndarray): Nonnegative matrix of size K x R used for initialization (Default value = None) + H (np.ndarray): Nonnegative matrix of size R x N used for initialization (Default value = None) + norm (bool): Applies max-normalization of columns of final W (Default value = False) + report (bool): Reports errors during runtime (Default value = False) + + Returns: + W (np.ndarray): Nonnegative matrix of size K x R + H (np.ndarray): Nonnegative matrix of size R x N + V_approx (np.ndarray): Nonnegative matrix W*H of size K x N + V_approx_err (float): Error between V and V_approx + H_W_error (np.ndarray): History of errors of subsequent H and W matrices + """ + K = V.shape[0] + N = V.shape[1] + if W is None: + W = np.random.rand(K, R) + if H is None: + H = np.random.rand(R, N) + V = V.astype(np.float64) + W = W.astype(np.float64) + H = H.astype(np.float64) + H_W_error = np.zeros((2, L)) + ell = 1 + below_thresh = False + eps_machine = np.finfo(np.float32).eps + while not below_thresh and ell <= L: + H_ell = H + W_ell = W + H = H * (W.transpose().dot(V) / (W.transpose().dot(W).dot(H) + eps_machine)) + W = W * (V.dot(H.transpose()) / (W.dot(H).dot(H.transpose()) + eps_machine)) + + # H+1 = H *p ((W^T * V) / p (W^T * W * H)) + # H = np.multiply(H, np.divide(np.matmul(np.transpose(W), V), + # np.matmul(np.matmul(np.transpose(W), W), H))) + # W+1 = W *p ((V * H^T) / p (W * H * H^T)) + # W = np.multiply(W, np.divide(np.matmul(V, np.transpose(H)), + # np.matmul(np.matmul(W, H), np.transpose(H)))) + + H_error = np.linalg.norm(H-H_ell, ord=2) + W_error = np.linalg.norm(W - W_ell, ord=2) + H_W_error[:, ell-1] = [H_error, W_error] + if report: + print('Iteration: ', ell, ', H_error: ', H_error, ', W_error: ', W_error) + if H_error < thresh and W_error < thresh: + below_thresh = True + H_W_error = H_W_error[:, 0:ell] + ell += 1 + if norm: + for r in range(R): + v_max = np.max(W[:, r]) + if v_max > 0: + W[:, r] = W[:, r] / v_max + H[r, :] = H[r, :] * v_max + V_approx = W.dot(H) + V_approx_err = np.linalg.norm(V-V_approx, ord=2) + return W, H, V_approx, V_approx_err, H_W_error
+ + +
[docs]def plot_nmf_factors(W, H, V, Fs, N_fft, H_fft, freq_max, label_pitch=None, + title_W='W', title_H='H', title_V='V', figsize=(13, 3)): + """Plots the factore of an NMF-based spectral decomposition + + Notebook: C8/C8S3_NMFSpecFac.ipynb + + Args: + W: Template matrix + H: Activation matrix + V: Reconstructed input matrix + Fs: Sampling frequency + N_fft: FFT length + H_fft: Hopsize + freq_max: Maximum frequency to be plotted + label_pitch: Labels for the different pitches (Default value = None) + title_W: Title for imshow of matrix W (Default value = 'W') + title_H: Title for imshow of matrix H (Default value = 'H') + title_V: Title for imshow of matrix V (Default value = 'V') + figsize: Size of the figure (Default value = (13, 3)) + """ + R = W.shape[1] + N = H.shape[1] + # cmap = libfmp.b.compressed_gray_cmap(alpha=5) + cmap = 'gray_r' + dur_sec = (N-1) * H_fft / Fs + if label_pitch is None: + label_pitch = np.arange(R) + + plt.figure(figsize=figsize) + plt.subplot(131) + plt.imshow(W, cmap=cmap, origin='lower', aspect='auto', extent=[0, R, 0, Fs/2]) + plt.ylim([0, freq_max]) + plt.colorbar() + plt.xticks(np.arange(R) + 0.5, label_pitch) + plt.xlabel('Pitch') + plt.ylabel('Frequency (Hz)') + plt.title(title_W) + + plt.subplot(132) + plt.imshow(H, cmap=cmap, origin='lower', aspect='auto', extent=[0, dur_sec, 0, R]) + plt.colorbar() + plt.yticks(np.arange(R) + 0.5, label_pitch) + plt.xlabel('Time (seconds)') + plt.ylabel('Pitch') + plt.title(title_H) + + plt.subplot(133) + plt.imshow(V, cmap=cmap, origin='lower', aspect='auto', extent=[0, dur_sec, 0, Fs/2]) + plt.ylim([0, freq_max]) + plt.colorbar() + plt.xlabel('Time (seconds)') + plt.ylabel('Frequency (Hz)') + plt.title(title_V) + + plt.tight_layout() + plt.show()
+ + +
[docs]def pitch_from_annotation(annotation): + """Extract set of occurring pitches from annotation + + Notebook: C8/C8S3_NMFSpecFac.ipynb + + Args: + annotation (list): Annotation data + + Returns: + pitch_set (np.ndarray): Set of occurring pitches + """ + pitch_all = np.array([c[2] for c in annotation]) + pitch_set = np.unique(pitch_all) + return pitch_set
+ + +
[docs]def template_pitch(K, pitch, freq_res, tol_pitch=0.05): + """Defines spectral template for a given pitch + + Notebook: C8/C8S3_NMFSpecFac.ipynb + + Args: + K (int): Number of frequency points + pitch (float): Fundamental pitch + freq_res (float): Frequency resolution + tol_pitch (float): Relative frequency tolerance for the harmonics (Default value = 0.05) + + Returns: + template (np.ndarray): Nonnegative template vector of size K + """ + max_freq = K * freq_res + pitch_freq = 2**((pitch - 69) / 12) * 440 + max_order = int(np.ceil(max_freq / ((1 - tol_pitch) * pitch_freq))) + template = np.zeros(K) + for m in range(1, max_order + 1): + min_idx = max(0, int((1 - tol_pitch) * m * pitch_freq / freq_res)) + max_idx = min(K-1, int((1 + tol_pitch) * m * pitch_freq / freq_res)) + template[min_idx:max_idx+1] = 1 / m + return template
+ + +
[docs]def init_nmf_template_pitch(K, pitch_set, freq_res, tol_pitch=0.05): + """Initializes template matrix for a given set of pitches + + Notebook: C8/C8S3_NMFSpecFac.ipynb + + Args: + K (int): Number of frequency points + pitch_set (np.ndarray): Set of fundamental pitches + freq_res (float): Frequency resolution + tol_pitch (float): Relative frequency tolerance for the harmonics (Default value = 0.05) + + Returns: + W (np.ndarray): Nonnegative matrix of size K x R with R = len(pitch_set) + """ + R = len(pitch_set) + W = np.zeros((K, R)) + for r in range(R): + W[:, r] = template_pitch(K, pitch_set[r], freq_res, tol_pitch=tol_pitch) + return W
+ + +
[docs]def init_nmf_activation_score(N, annotation, frame_res, tol_note=[0.2, 0.5], pitch_set=None): + """Initializes activation matrix for given score annotations + + Notebook: C8/C8S3_NMFSpecFac.ipynb + + Args: + N (int): Number of frames + annotation (list): Annotation data + frame_res (time): Time resolution + tol_note (list or np.ndarray): Tolerance (seconds) for beginning and end of a note (Default value = [0.2, 0.5]) + pitch_set (np.ndarray): Set of occurring pitches (Default value = None) + + Returns: + H (np.ndarray): Nonnegative matrix of size R x N + pitch_set (np.ndarray): Set of occurring pitches + """ + note_start = np.array([c[0] for c in annotation]) + note_dur = np.array([c[1] for c in annotation]) + pitch_all = np.array([c[2] for c in annotation]) + if pitch_set is None: + pitch_set = np.unique(pitch_all) + R = len(pitch_set) + H = np.zeros((R, N)) + for i in range(len(note_start)): + start_idx = max(0, int((note_start[i] - tol_note[0]) / frame_res)) + end_idx = min(N, int((note_start[i] + note_dur[i] + tol_note[1]) / frame_res)) + pitch_idx = np.argwhere(pitch_set == pitch_all[i]) + H[pitch_idx, start_idx:end_idx] = 1 + return H, pitch_set
+ + +
[docs]def init_nmf_template_pitch_onset(K, pitch_set, freq_res, tol_pitch=0.05): + """Initializes template matrix with onsets for a given set of pitches + + Notebook: C8/C8S3_NMFSpecFac.ipynb + + Args: + K (int): Number of frequency points + pitch_set (np.ndarray): Set of fundamental pitches + freq_res (float): Frequency resolution + tol_pitch (float): Relative frequency tolerance for the harmonics (Default value = 0.05) + + Returns: + W (np.ndarray): Nonnegative matrix of size K x (2R) with R = len(pitch_set) + """ + R = len(pitch_set) + W = np.zeros((K, 2*R)) + for r in range(R): + W[:, 2*r] = 0.1 + W[:, 2*r+1] = template_pitch(K, pitch_set[r], freq_res, tol_pitch=tol_pitch) + return W
+ + +
[docs]def init_nmf_activation_score_onset(N, annotation, frame_res, tol_note=[0.2, 0.5], tol_onset=[0.3, 0.1], + pitch_set=None): + """Initializes activation matrix with onsets for given score annotations + + Notebook: C8/C8S3_NMFSpecFac.ipynb + + Args: + N (int): Number of frames + annotation (list): Annotation data + frame_res (float): Time resolution + tol_note (list or np.ndarray): Tolerance (seconds) for beginning and end of a note (Default value = [0.2, 0.5]) + tol_onset (list or np.ndarray): Tolerance (seconds) for beginning and end of an onset + (Default value = [0.3, 0.1]) + pitch_set (np.ndarray): Set of occurring pitches (Default value = None) + + Returns: + H (np.ndarray): Nonnegative matrix of size (2R) x N + pitch_set (np.ndarray): Set of occurring pitches + label_pitch (np.ndarray): Pitch labels for the templates + """ + note_start = np.array([c[0] for c in annotation]) + note_dur = np.array([c[1] for c in annotation]) + pitch_all = np.array([c[2] for c in annotation]) + if pitch_set is None: + pitch_set = np.unique(pitch_all) + R = len(pitch_set) + H = np.zeros((2*R, N)) + for i in range(len(note_start)): + start_idx = max(0, int((note_start[i] - tol_note[0]) / frame_res)) + end_idx = min(N, int((note_start[i] + note_dur[i] + tol_note[1]) / frame_res)) + start_onset_idx = max(0, int((note_start[i] - tol_onset[0]) / frame_res)) + end_onset_idx = min(N, int((note_start[i] + tol_onset[1]) / frame_res)) + pitch_idx = np.argwhere(pitch_set == pitch_all[i]) + H[2*pitch_idx, start_onset_idx:end_onset_idx] = 1 + H[2*pitch_idx+1, start_idx:end_idx] = 1 + label_pitch = np.zeros(2*len(pitch_set), dtype=int) + for k in range(len(pitch_set)): + label_pitch[2*k] = pitch_set[k] + label_pitch[2*k+1] = pitch_set[k] + return H, pitch_set, label_pitch
+ + +
[docs]def split_annotation_lh_rh(ann): + """Splitting of the annotation data in left and right hand + + Notebook: C8/C8S3_NMFAudioDecomp.ipynb + + Args: + ann (list): Annotation data + + Returns: + ann_lh (list): Annotation data for left hand + ann_rh (list): Annotation data for right hand + """ + ann_lh = [] + ann_rh = [] + for a in ann: + if a[4] == 'lh': + ann_lh = ann_lh + [a] + if a[4] == 'rh': + ann_rh = ann_rh + [a] + return ann_lh, ann_rh
+
+ +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/_sources/genindex.rst.txt b/docs/build/html/_sources/genindex.rst.txt new file mode 100644 index 0000000..9e530fa --- /dev/null +++ b/docs/build/html/_sources/genindex.rst.txt @@ -0,0 +1,2 @@ +Index +===== diff --git a/docs/build/html/_sources/getting_started.rst.txt b/docs/build/html/_sources/getting_started.rst.txt new file mode 100644 index 0000000..a58d828 --- /dev/null +++ b/docs/build/html/_sources/getting_started.rst.txt @@ -0,0 +1,17 @@ +Getting Started +=============== + +You can install libfmp using the Python package manager pip: + +.. code-block:: bash + + pip install libfmp + +Beyond the API documentation of this webpage, you find extensive explanations of libfmp's functionality in the FMP Notebooks: + +https://www.audiolabs-erlangen.de/FMP + +In particular, there are dedicated notebooks on how to get started with FMP and on libfmp. + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/B/B_GetStarted.html +https://www.audiolabs-erlangen.de/resources/MIR/FMP/B/B_libfmp.html diff --git a/docs/build/html/_sources/index.rst.txt b/docs/build/html/_sources/index.rst.txt new file mode 100644 index 0000000..7766a9c --- /dev/null +++ b/docs/build/html/_sources/index.rst.txt @@ -0,0 +1,45 @@ +Libfmp API Documentation +======================== + +This webpage contains the API documentation for the Python package libfmp. +This package goes hand in hand with the FMP Notebooks, a collection of educational material for teaching and learning Fundamentals of Music Processing (FMP) with a particular focus on the audio domain. +For detailed explanations and example applications of the libfmp-functions, we refer to the FMP Notebooks: + +http://audiolabs-erlangen.de/FMP + +The source code for the package libfmp is hosted at GitHub: + +https://github.com/meinardmueller/libfmp + +If you use libfmp in a scholarly work, please consider citing the FMP article. [#]_ + +.. [#] Meinard Müller and Frank Zalkow. FMP Notebooks: Educational Material for Teaching and Learning Fundamentals of Music Processing. Proceedings of the International Conference on Music Information Retrieval (ISMIR), pp. 573-580, Delft, The Netherlands, 2019. + +.. toctree:: + :hidden: + + getting_started + + +.. toctree:: + :caption: API Documentation + :maxdepth: 1 + :hidden: + + index_b + index_c1 + index_c2 + index_c3 + index_c4 + index_c5 + index_c6 + index_c7 + index_c8 + +.. toctree:: + :caption: Reference + :maxdepth: 1 + :hidden: + + genindex + py-modindex diff --git a/docs/build/html/_sources/index_b.rst.txt b/docs/build/html/_sources/index_b.rst.txt new file mode 100644 index 0000000..a540f3a --- /dev/null +++ b/docs/build/html/_sources/index_b.rst.txt @@ -0,0 +1,29 @@ +Basics (libfmp.b) +================= + +The `FMP notebooks `_ provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL: + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/B/B.html + +.. automodule:: libfmp.b + :members: + :undoc-members: +.. automodule:: libfmp.b.b_annotation + :members: + :undoc-members: +.. automodule:: libfmp.b.b_audio + :members: + :undoc-members: +.. automodule:: libfmp.b.b_layout + :members: + :undoc-members: +.. automodule:: libfmp.b.b_plot + :members: + :undoc-members: +.. automodule:: libfmp.b.b_sonification + :members: + :undoc-members: +.. automodule:: libfmp.b.b_test_module + :members: + :undoc-members: diff --git a/docs/build/html/_sources/index_c1.rst.txt b/docs/build/html/_sources/index_c1.rst.txt new file mode 100644 index 0000000..e27347e --- /dev/null +++ b/docs/build/html/_sources/index_c1.rst.txt @@ -0,0 +1,20 @@ +Music Representations (libfmp.c1) +================================= + +The `FMP notebooks `_ provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL: + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/C1/C1.html + +.. automodule:: libfmp.c1 + :members: + :undoc-members: +.. automodule:: libfmp.c1.c1s1_sheet_music + :members: + :undoc-members: +.. automodule:: libfmp.c1.c1s2_symbolic_rep + :members: + :undoc-members: +.. automodule:: libfmp.c1.c1s3_audio_rep + :members: + :undoc-members: diff --git a/docs/build/html/_sources/index_c2.rst.txt b/docs/build/html/_sources/index_c2.rst.txt new file mode 100644 index 0000000..703613c --- /dev/null +++ b/docs/build/html/_sources/index_c2.rst.txt @@ -0,0 +1,26 @@ +Fourier Analysis of Signals (libfmp.c2) +======================================= + +The `FMP notebooks `_ provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL: + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/C2/C2.html + +.. automodule:: libfmp.c2 + :members: + :undoc-members: +.. automodule:: libfmp.c2.c2_complex + :members: + :undoc-members: +.. automodule:: libfmp.c2.c2_digitization + :members: + :undoc-members: +.. automodule:: libfmp.c2.c2_fourier + :members: + :undoc-members: +.. automodule:: libfmp.c2.c2_interference + :members: + :undoc-members: +.. automodule:: libfmp.c2.c2_interpolation + :members: + :undoc-members: diff --git a/docs/build/html/_sources/index_c3.rst.txt b/docs/build/html/_sources/index_c3.rst.txt new file mode 100644 index 0000000..0bcba4a --- /dev/null +++ b/docs/build/html/_sources/index_c3.rst.txt @@ -0,0 +1,29 @@ +Music Synchronization (libfmp.c3) +================================= + +The `FMP notebooks `_ provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL: + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/C3/C3.html + +.. automodule:: libfmp.c3 + :members: + :undoc-members: +.. automodule:: libfmp.c3.c3s1_audio_feature + :members: + :undoc-members: +.. automodule:: libfmp.c3.c3s1_post_processing + :members: + :undoc-members: +.. automodule:: libfmp.c3.c3s1_transposition_tuning + :members: + :undoc-members: +.. automodule:: libfmp.c3.c3s2_dtw + :members: + :undoc-members: +.. automodule:: libfmp.c3.c3s2_dtw_plot + :members: + :undoc-members: +.. automodule:: libfmp.c3.c3s3_tempo_curve + :members: + :undoc-members: diff --git a/docs/build/html/_sources/index_c4.rst.txt b/docs/build/html/_sources/index_c4.rst.txt new file mode 100644 index 0000000..6b1421d --- /dev/null +++ b/docs/build/html/_sources/index_c4.rst.txt @@ -0,0 +1,35 @@ +Music Structure Analysis (libfmp.c4) +==================================== + +The `FMP notebooks `_ provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL: + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/C4/C4.html + +.. automodule:: libfmp.c4 + :members: + :undoc-members: +.. automodule:: libfmp.c4.c4s1_annotation + :members: + :undoc-members: +.. automodule:: libfmp.c4.c4s2_ssm + :members: + :undoc-members: +.. automodule:: libfmp.c4.c4s2_synthetic_ssm + :members: + :undoc-members: +.. automodule:: libfmp.c4.c4s2_threshold + :members: + :undoc-members: +.. automodule:: libfmp.c4.c4s3_thumbnail + :members: + :undoc-members: +.. automodule:: libfmp.c4.c4s4_novelty_kernel + :members: + :undoc-members: +.. automodule:: libfmp.c4.c4s4_structure_feature + :members: + :undoc-members: +.. automodule:: libfmp.c4.c4s5_evaluation + :members: + :undoc-members: diff --git a/docs/build/html/_sources/index_c5.rst.txt b/docs/build/html/_sources/index_c5.rst.txt new file mode 100644 index 0000000..ce3e73c --- /dev/null +++ b/docs/build/html/_sources/index_c5.rst.txt @@ -0,0 +1,20 @@ +Chord Recognition (libfmp.c5) +============================= + +The `FMP notebooks `_ provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL: + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/C5/C5.html + +.. automodule:: libfmp.c5 + :members: + :undoc-members: +.. automodule:: libfmp.c5.c5s1_basic_theory_harmony + :members: + :undoc-members: +.. automodule:: libfmp.c5.c5s2_chord_rec_template + :members: + :undoc-members: +.. automodule:: libfmp.c5.c5s3_chord_rec_hmm + :members: + :undoc-members: diff --git a/docs/build/html/_sources/index_c6.rst.txt b/docs/build/html/_sources/index_c6.rst.txt new file mode 100644 index 0000000..a3ff5fb --- /dev/null +++ b/docs/build/html/_sources/index_c6.rst.txt @@ -0,0 +1,26 @@ +Tempo and Beat Tracking (libfmp.c6) +=================================== + +The `FMP notebooks `_ provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL: + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/C6/C6.html + +.. automodule:: libfmp.c6 + :members: + :undoc-members: +.. automodule:: libfmp.c6.c6s1_onset_detection + :members: + :undoc-members: +.. automodule:: libfmp.c6.c6s1_peak_picking + :members: + :undoc-members: +.. automodule:: libfmp.c6.c6s2_tempo_analysis + :members: + :undoc-members: +.. automodule:: libfmp.c6.c6s3_adaptive_windowing + :members: + :undoc-members: +.. automodule:: libfmp.c6.c6s3_beat_tracking + :members: + :undoc-members: diff --git a/docs/build/html/_sources/index_c7.rst.txt b/docs/build/html/_sources/index_c7.rst.txt new file mode 100644 index 0000000..1497c02 --- /dev/null +++ b/docs/build/html/_sources/index_c7.rst.txt @@ -0,0 +1,20 @@ +Content-Based Audio Retrieval (libfmp.c7) +========================================= + +The `FMP notebooks `_ provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL: + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/C7/C7.html + +.. automodule:: libfmp.c7 + :members: + :undoc-members: +.. automodule:: libfmp.c7.c7s1_audio_id + :members: + :undoc-members: +.. automodule:: libfmp.c7.c7s2_audio_matching + :members: + :undoc-members: +.. automodule:: libfmp.c7.c7s3_version_id + :members: + :undoc-members: diff --git a/docs/build/html/_sources/index_c8.rst.txt b/docs/build/html/_sources/index_c8.rst.txt new file mode 100644 index 0000000..82b007e --- /dev/null +++ b/docs/build/html/_sources/index_c8.rst.txt @@ -0,0 +1,23 @@ +Musically Informed Audio Decomposition (libfmp.c8) +================================================== + +The `FMP notebooks `_ provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL: + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/C8/C8.html + +.. automodule:: libfmp.c8 + :members: + :undoc-members: +.. automodule:: libfmp.c8.c8s1_hps + :members: + :undoc-members: +.. automodule:: libfmp.c8.c8s2_f0 + :members: + :undoc-members: +.. automodule:: libfmp.c8.c8s2_salience + :members: + :undoc-members: +.. automodule:: libfmp.c8.c8s3_nmf + :members: + :undoc-members: diff --git a/docs/build/html/_sources/py-modindex.rst.txt b/docs/build/html/_sources/py-modindex.rst.txt new file mode 100644 index 0000000..f6c180c --- /dev/null +++ b/docs/build/html/_sources/py-modindex.rst.txt @@ -0,0 +1,2 @@ +Module Index +============ diff --git a/docs/build/html/_static/Logo_libfmp.png b/docs/build/html/_static/Logo_libfmp.png new file mode 100644 index 0000000..ba7177a Binary files /dev/null and b/docs/build/html/_static/Logo_libfmp.png differ diff --git a/docs/build/html/_static/basic.css b/docs/build/html/_static/basic.css new file mode 100644 index 0000000..f7c33d2 --- /dev/null +++ b/docs/build/html/_static/basic.css @@ -0,0 +1,861 @@ +/* + * basic.css + * ~~~~~~~~~ + * + * Sphinx stylesheet -- basic theme. + * + * :copyright: Copyright 2007-2021 by the Sphinx team, see AUTHORS. + * :license: BSD, see LICENSE for details. + * + */ + +/* -- main layout ----------------------------------------------------------- */ + +div.clearer { + clear: both; +} + +div.section::after { + display: block; + content: ''; + clear: left; +} + +/* -- relbar ---------------------------------------------------------------- */ + +div.related { + width: 100%; + font-size: 90%; +} + +div.related h3 { + display: none; +} + +div.related ul { + margin: 0; + padding: 0 0 0 10px; + list-style: none; +} + +div.related li { + display: inline; +} + +div.related li.right { + float: right; + margin-right: 5px; +} + +/* -- sidebar --------------------------------------------------------------- */ + +div.sphinxsidebarwrapper { + padding: 10px 5px 0 10px; +} + +div.sphinxsidebar { + float: left; + width: 230px; + margin-left: -100%; + font-size: 90%; + word-wrap: break-word; + overflow-wrap : break-word; +} + +div.sphinxsidebar ul { + list-style: none; +} + +div.sphinxsidebar ul ul, +div.sphinxsidebar ul.want-points { + margin-left: 20px; + list-style: square; +} + +div.sphinxsidebar ul ul { + margin-top: 0; + margin-bottom: 0; +} + +div.sphinxsidebar form { + margin-top: 10px; +} + +div.sphinxsidebar input { + border: 1px solid #98dbcc; + font-family: sans-serif; + font-size: 1em; +} + +div.sphinxsidebar #searchbox form.search { + overflow: hidden; +} + +div.sphinxsidebar #searchbox input[type="text"] { + float: left; + width: 80%; + padding: 0.25em; + box-sizing: border-box; +} + +div.sphinxsidebar #searchbox input[type="submit"] { + float: left; + width: 20%; + border-left: none; + padding: 0.25em; + box-sizing: border-box; +} + + +img { + border: 0; + max-width: 100%; +} + +/* -- search page ----------------------------------------------------------- */ + +ul.search { + margin: 10px 0 0 20px; + padding: 0; +} + +ul.search li { + padding: 5px 0 5px 20px; + background-image: url(file.png); + background-repeat: no-repeat; + background-position: 0 7px; +} + +ul.search li a { + font-weight: bold; +} + +ul.search li p.context { + color: #888; + margin: 2px 0 0 30px; + text-align: left; +} + +ul.keywordmatches li.goodmatch a { + font-weight: bold; +} + +/* -- index page ------------------------------------------------------------ */ + +table.contentstable { + width: 90%; + margin-left: auto; + margin-right: auto; +} + +table.contentstable p.biglink { + line-height: 150%; +} + +a.biglink { + font-size: 1.3em; +} + +span.linkdescr { + font-style: italic; + padding-top: 5px; + font-size: 90%; +} + +/* -- general index --------------------------------------------------------- */ + +table.indextable { + width: 100%; +} + +table.indextable td { + text-align: left; + vertical-align: top; +} + +table.indextable ul { + margin-top: 0; + margin-bottom: 0; + list-style-type: none; +} + +table.indextable > tbody > tr > td > ul { + padding-left: 0em; +} + +table.indextable tr.pcap { + height: 10px; +} + +table.indextable tr.cap { + margin-top: 10px; + background-color: #f2f2f2; +} + +img.toggler { + margin-right: 3px; + margin-top: 3px; + cursor: pointer; +} + +div.modindex-jumpbox { + border-top: 1px solid #ddd; + border-bottom: 1px solid #ddd; + margin: 1em 0 1em 0; + padding: 0.4em; +} + +div.genindex-jumpbox { + border-top: 1px solid #ddd; + border-bottom: 1px solid #ddd; + margin: 1em 0 1em 0; + padding: 0.4em; +} + +/* -- domain module index --------------------------------------------------- */ + +table.modindextable td { + padding: 2px; + border-collapse: collapse; +} + +/* -- general body styles --------------------------------------------------- */ + +div.body { + min-width: 450px; + max-width: 800px; +} + +div.body p, div.body dd, div.body li, div.body blockquote { + -moz-hyphens: auto; + -ms-hyphens: auto; + -webkit-hyphens: auto; + hyphens: auto; +} + +a.headerlink { + visibility: hidden; +} + +a.brackets:before, +span.brackets > a:before{ + content: "["; +} + +a.brackets:after, +span.brackets > a:after { + content: "]"; +} + +h1:hover > a.headerlink, +h2:hover > a.headerlink, +h3:hover > a.headerlink, +h4:hover > a.headerlink, +h5:hover > a.headerlink, +h6:hover > a.headerlink, +dt:hover > a.headerlink, +caption:hover > a.headerlink, +p.caption:hover > a.headerlink, +div.code-block-caption:hover > a.headerlink { + visibility: visible; +} + +div.body p.caption { + text-align: inherit; +} + +div.body td { + text-align: left; +} + +.first { + margin-top: 0 !important; +} + +p.rubric { + margin-top: 30px; + font-weight: bold; +} + +img.align-left, figure.align-left, .figure.align-left, object.align-left { + clear: left; + float: left; + margin-right: 1em; +} + +img.align-right, figure.align-right, .figure.align-right, object.align-right { + clear: right; + float: right; + margin-left: 1em; +} + +img.align-center, figure.align-center, .figure.align-center, object.align-center { + display: block; + margin-left: auto; + margin-right: auto; +} + +img.align-default, figure.align-default, .figure.align-default { + display: block; + margin-left: auto; + margin-right: auto; +} + +.align-left { + text-align: left; +} + +.align-center { + text-align: center; +} + +.align-default { + text-align: center; +} + +.align-right { + text-align: right; +} + +/* -- sidebars -------------------------------------------------------------- */ + +div.sidebar, +aside.sidebar { + margin: 0 0 0.5em 1em; + border: 1px solid #ddb; + padding: 7px; + background-color: #ffe; + width: 40%; + float: right; + clear: right; + overflow-x: auto; +} + +p.sidebar-title { + font-weight: bold; +} + +div.admonition, div.topic, blockquote { + clear: left; +} + +/* -- topics ---------------------------------------------------------------- */ + +div.topic { + border: 1px solid #ccc; + padding: 7px; + margin: 10px 0 10px 0; +} + +p.topic-title { + font-size: 1.1em; + font-weight: bold; + margin-top: 10px; +} + +/* -- admonitions ----------------------------------------------------------- */ + +div.admonition { + margin-top: 10px; + margin-bottom: 10px; + padding: 7px; +} + +div.admonition dt { + font-weight: bold; +} + +p.admonition-title { + margin: 0px 10px 5px 0px; + font-weight: bold; +} + +div.body p.centered { + text-align: center; + margin-top: 25px; +} + +/* -- content of sidebars/topics/admonitions -------------------------------- */ + +div.sidebar > :last-child, +aside.sidebar > :last-child, +div.topic > :last-child, +div.admonition > :last-child { + margin-bottom: 0; +} + +div.sidebar::after, +aside.sidebar::after, +div.topic::after, +div.admonition::after, +blockquote::after { + display: block; + content: ''; + clear: both; +} + +/* -- tables ---------------------------------------------------------------- */ + +table.docutils { + margin-top: 10px; + margin-bottom: 10px; + border: 0; + border-collapse: collapse; +} + +table.align-center { + margin-left: auto; + margin-right: auto; +} + +table.align-default { + margin-left: auto; + margin-right: auto; +} + +table caption span.caption-number { + font-style: italic; +} + +table caption span.caption-text { +} + +table.docutils td, table.docutils th { + padding: 1px 8px 1px 5px; + border-top: 0; + border-left: 0; + border-right: 0; + border-bottom: 1px solid #aaa; +} + +table.footnote td, table.footnote th { + border: 0 !important; +} + +th { + text-align: left; + padding-right: 5px; +} + +table.citation { + border-left: solid 1px gray; + margin-left: 1px; +} + +table.citation td { + border-bottom: none; +} + +th > :first-child, +td > :first-child { + margin-top: 0px; +} + +th > :last-child, +td > :last-child { + margin-bottom: 0px; +} + +/* -- figures --------------------------------------------------------------- */ + +div.figure, figure { + margin: 0.5em; + padding: 0.5em; +} + +div.figure p.caption, figcaption { + padding: 0.3em; +} + +div.figure p.caption span.caption-number, +figcaption span.caption-number { + font-style: italic; +} + +div.figure p.caption span.caption-text, +figcaption span.caption-text { +} + +/* -- field list styles ----------------------------------------------------- */ + +table.field-list td, table.field-list th { + border: 0 !important; +} + +.field-list ul { + margin: 0; + padding-left: 1em; +} + +.field-list p { + margin: 0; +} + +.field-name { + -moz-hyphens: manual; + -ms-hyphens: manual; + -webkit-hyphens: manual; + hyphens: manual; +} + +/* -- hlist styles ---------------------------------------------------------- */ + +table.hlist { + margin: 1em 0; +} + +table.hlist td { + vertical-align: top; +} + + +/* -- other body styles ----------------------------------------------------- */ + +ol.arabic { + list-style: decimal; +} + +ol.loweralpha { + list-style: lower-alpha; +} + +ol.upperalpha { + list-style: upper-alpha; +} + +ol.lowerroman { + list-style: lower-roman; +} + +ol.upperroman { + list-style: upper-roman; +} + +:not(li) > ol > li:first-child > :first-child, +:not(li) > ul > li:first-child > :first-child { + margin-top: 0px; +} + +:not(li) > ol > li:last-child > :last-child, +:not(li) > ul > li:last-child > :last-child { + margin-bottom: 0px; +} + +ol.simple ol p, +ol.simple ul p, +ul.simple ol p, +ul.simple ul p { + margin-top: 0; +} + +ol.simple > li:not(:first-child) > p, +ul.simple > li:not(:first-child) > p { + margin-top: 0; +} + +ol.simple p, +ul.simple p { + margin-bottom: 0; +} + +dl.footnote > dt, +dl.citation > dt { + float: left; + margin-right: 0.5em; +} + +dl.footnote > dd, +dl.citation > dd { + margin-bottom: 0em; +} + +dl.footnote > dd:after, +dl.citation > dd:after { + content: ""; + clear: both; +} + +dl.field-list { + display: grid; + grid-template-columns: fit-content(30%) auto; +} + +dl.field-list > dt { + font-weight: bold; + word-break: break-word; + padding-left: 0.5em; + padding-right: 5px; +} + +dl.field-list > dt:after { + content: ":"; +} + +dl.field-list > dd { + padding-left: 0.5em; + margin-top: 0em; + margin-left: 0em; + margin-bottom: 0em; +} + +dl { + margin-bottom: 15px; +} + +dd > :first-child { + margin-top: 0px; +} + +dd ul, dd table { + margin-bottom: 10px; +} + +dd { + margin-top: 3px; + margin-bottom: 10px; + margin-left: 30px; +} + +dl > dd:last-child, +dl > dd:last-child > :last-child { + margin-bottom: 0; +} + +dt:target, span.highlighted { + background-color: #fbe54e; +} + +rect.highlighted { + fill: #fbe54e; +} + +dl.glossary dt { + font-weight: bold; + font-size: 1.1em; +} + +.optional { + font-size: 1.3em; +} + +.sig-paren { + font-size: larger; +} + +.versionmodified { + font-style: italic; +} + +.system-message { + background-color: #fda; + padding: 5px; + border: 3px solid red; +} + +.footnote:target { + background-color: #ffa; +} + +.line-block { + display: block; + margin-top: 1em; + margin-bottom: 1em; +} + +.line-block .line-block { + margin-top: 0; + margin-bottom: 0; + margin-left: 1.5em; +} + +.guilabel, .menuselection { + font-family: sans-serif; +} + +.accelerator { + text-decoration: underline; +} + +.classifier { + font-style: oblique; +} + +.classifier:before { + font-style: normal; + margin: 0.5em; + content: ":"; +} + +abbr, acronym { + border-bottom: dotted 1px; + cursor: help; +} + +/* -- code displays --------------------------------------------------------- */ + +pre { + overflow: auto; + overflow-y: hidden; /* fixes display issues on Chrome browsers */ +} + +pre, div[class*="highlight-"] { + clear: both; +} + +span.pre { + -moz-hyphens: none; + -ms-hyphens: none; + -webkit-hyphens: none; + hyphens: none; +} + +div[class*="highlight-"] { + margin: 1em 0; +} + +td.linenos pre { + border: 0; + background-color: transparent; + color: #aaa; +} + +table.highlighttable { + display: block; +} + +table.highlighttable tbody { + display: block; +} + +table.highlighttable tr { + display: flex; +} + +table.highlighttable td { + margin: 0; + padding: 0; +} + +table.highlighttable td.linenos { + padding-right: 0.5em; +} + +table.highlighttable td.code { + flex: 1; + overflow: hidden; +} + +.highlight .hll { + display: block; +} + +div.highlight pre, +table.highlighttable pre { + margin: 0; +} + +div.code-block-caption + div { + margin-top: 0; +} + +div.code-block-caption { + margin-top: 1em; + padding: 2px 5px; + font-size: small; +} + +div.code-block-caption code { + background-color: transparent; +} + +table.highlighttable td.linenos, +span.linenos, +div.doctest > div.highlight span.gp { /* gp: Generic.Prompt */ + user-select: none; +} + +div.code-block-caption span.caption-number { + padding: 0.1em 0.3em; + font-style: italic; +} + +div.code-block-caption span.caption-text { +} + +div.literal-block-wrapper { + margin: 1em 0; +} + +code.descname { + background-color: transparent; + font-weight: bold; + font-size: 1.2em; +} + +code.descclassname { + background-color: transparent; +} + +code.xref, a code { + background-color: transparent; + font-weight: bold; +} + +h1 code, h2 code, h3 code, h4 code, h5 code, h6 code { + background-color: transparent; +} + +.viewcode-link { + float: right; +} + +.viewcode-back { + float: right; + font-family: sans-serif; +} + +div.viewcode-block:target { + margin: -1px -10px; + padding: 0 10px; +} + +/* -- math display ---------------------------------------------------------- */ + +img.math { + vertical-align: middle; +} + +div.body div.math p { + text-align: center; +} + +span.eqno { + float: right; +} + +span.eqno a.headerlink { + position: absolute; + z-index: 1; +} + +div.math:hover a.headerlink { + visibility: visible; +} + +/* -- printout stylesheet --------------------------------------------------- */ + +@media print { + div.document, + div.documentwrapper, + div.bodywrapper { + margin: 0 !important; + width: 100%; + } + + div.sphinxsidebar, + div.related, + div.footer, + #top-link { + display: none; + } +} \ No newline at end of file diff --git a/docs/build/html/_static/css/badge_only.css b/docs/build/html/_static/css/badge_only.css new file mode 100644 index 0000000..e380325 --- /dev/null +++ b/docs/build/html/_static/css/badge_only.css @@ -0,0 +1 @@ +.fa:before{-webkit-font-smoothing:antialiased}.clearfix{*zoom:1}.clearfix:after,.clearfix:before{display:table;content:""}.clearfix:after{clear:both}@font-face{font-family:FontAwesome;font-style:normal;font-weight:400;src:url(fonts/fontawesome-webfont.eot?674f50d287a8c48dc19ba404d20fe713?#iefix) format("embedded-opentype"),url(fonts/fontawesome-webfont.woff2?af7ae505a9eed503f8b8e6982036873e) format("woff2"),url(fonts/fontawesome-webfont.woff?fee66e712a8a08eef5805a46892932ad) format("woff"),url(fonts/fontawesome-webfont.ttf?b06871f281fee6b241d60582ae9369b9) format("truetype"),url(fonts/fontawesome-webfont.svg?912ec66d7572ff821749319396470bde#FontAwesome) format("svg")}.fa:before{font-family:FontAwesome;font-style:normal;font-weight:400;line-height:1}.fa:before,a .fa{text-decoration:inherit}.fa:before,a .fa,li .fa{display:inline-block}li .fa-large:before{width:1.875em}ul.fas{list-style-type:none;margin-left:2em;text-indent:-.8em}ul.fas li .fa{width:.8em}ul.fas li .fa-large:before{vertical-align:baseline}.fa-book:before,.icon-book:before{content:"\f02d"}.fa-caret-down:before,.icon-caret-down:before{content:"\f0d7"}.fa-caret-up:before,.icon-caret-up:before{content:"\f0d8"}.fa-caret-left:before,.icon-caret-left:before{content:"\f0d9"}.fa-caret-right:before,.icon-caret-right:before{content:"\f0da"}.rst-versions{position:fixed;bottom:0;left:0;width:300px;color:#fcfcfc;background:#1f1d1d;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;z-index:400}.rst-versions a{color:#2980b9;text-decoration:none}.rst-versions .rst-badge-small{display:none}.rst-versions .rst-current-version{padding:12px;background-color:#272525;display:block;text-align:right;font-size:90%;cursor:pointer;color:#27ae60}.rst-versions .rst-current-version:after{clear:both;content:"";display:block}.rst-versions .rst-current-version .fa{color:#fcfcfc}.rst-versions .rst-current-version .fa-book,.rst-versions .rst-current-version .icon-book{float:left}.rst-versions .rst-current-version.rst-out-of-date{background-color:#e74c3c;color:#fff}.rst-versions .rst-current-version.rst-active-old-version{background-color:#f1c40f;color:#000}.rst-versions.shift-up{height:auto;max-height:100%;overflow-y:scroll}.rst-versions.shift-up .rst-other-versions{display:block}.rst-versions .rst-other-versions{font-size:90%;padding:12px;color:grey;display:none}.rst-versions .rst-other-versions hr{display:block;height:1px;border:0;margin:20px 0;padding:0;border-top:1px solid #413d3d}.rst-versions .rst-other-versions dd{display:inline-block;margin:0}.rst-versions .rst-other-versions dd a{display:inline-block;padding:6px;color:#fcfcfc}.rst-versions.rst-badge{width:auto;bottom:20px;right:20px;left:auto;border:none;max-width:300px;max-height:90%}.rst-versions.rst-badge .fa-book,.rst-versions.rst-badge .icon-book{float:none;line-height:30px}.rst-versions.rst-badge.shift-up .rst-current-version{text-align:right}.rst-versions.rst-badge.shift-up .rst-current-version .fa-book,.rst-versions.rst-badge.shift-up .rst-current-version .icon-book{float:left}.rst-versions.rst-badge>.rst-current-version{width:auto;height:30px;line-height:30px;padding:0 6px;display:block;text-align:center}@media screen and (max-width:768px){.rst-versions{width:85%;display:none}.rst-versions.shift{display:block}} \ No newline at end of file diff --git a/docs/build/html/_static/css/fonts/Roboto-Slab-Bold.woff b/docs/build/html/_static/css/fonts/Roboto-Slab-Bold.woff new file mode 100644 index 0000000..6cb6000 Binary files /dev/null and b/docs/build/html/_static/css/fonts/Roboto-Slab-Bold.woff differ diff --git a/docs/build/html/_static/css/fonts/Roboto-Slab-Bold.woff2 b/docs/build/html/_static/css/fonts/Roboto-Slab-Bold.woff2 new file mode 100644 index 0000000..7059e23 Binary files /dev/null and b/docs/build/html/_static/css/fonts/Roboto-Slab-Bold.woff2 differ diff --git a/docs/build/html/_static/css/fonts/Roboto-Slab-Regular.woff b/docs/build/html/_static/css/fonts/Roboto-Slab-Regular.woff new file mode 100644 index 0000000..f815f63 Binary files /dev/null and b/docs/build/html/_static/css/fonts/Roboto-Slab-Regular.woff differ diff --git a/docs/build/html/_static/css/fonts/Roboto-Slab-Regular.woff2 b/docs/build/html/_static/css/fonts/Roboto-Slab-Regular.woff2 new file mode 100644 index 0000000..f2c76e5 Binary files /dev/null and b/docs/build/html/_static/css/fonts/Roboto-Slab-Regular.woff2 differ diff --git a/docs/build/html/_static/css/fonts/fontawesome-webfont.eot b/docs/build/html/_static/css/fonts/fontawesome-webfont.eot new file mode 100644 index 0000000..e9f60ca Binary files /dev/null and b/docs/build/html/_static/css/fonts/fontawesome-webfont.eot differ diff --git a/docs/build/html/_static/css/fonts/fontawesome-webfont.svg b/docs/build/html/_static/css/fonts/fontawesome-webfont.svg new file mode 100644 index 0000000..855c845 --- /dev/null +++ b/docs/build/html/_static/css/fonts/fontawesome-webfont.svg @@ -0,0 +1,2671 @@ + + + + +Created by FontForge 20120731 at Mon Oct 24 17:37:40 2016 + By ,,, +Copyright Dave Gandy 2016. All rights reserved. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/docs/build/html/_static/css/fonts/fontawesome-webfont.ttf b/docs/build/html/_static/css/fonts/fontawesome-webfont.ttf new file mode 100644 index 0000000..35acda2 Binary files /dev/null and b/docs/build/html/_static/css/fonts/fontawesome-webfont.ttf differ diff --git a/docs/build/html/_static/css/fonts/fontawesome-webfont.woff b/docs/build/html/_static/css/fonts/fontawesome-webfont.woff new file mode 100644 index 0000000..400014a Binary files /dev/null and b/docs/build/html/_static/css/fonts/fontawesome-webfont.woff differ diff --git a/docs/build/html/_static/css/fonts/fontawesome-webfont.woff2 b/docs/build/html/_static/css/fonts/fontawesome-webfont.woff2 new file mode 100644 index 0000000..4d13fc6 Binary files /dev/null and b/docs/build/html/_static/css/fonts/fontawesome-webfont.woff2 differ diff --git a/docs/build/html/_static/css/fonts/lato-bold-italic.woff b/docs/build/html/_static/css/fonts/lato-bold-italic.woff new file mode 100644 index 0000000..88ad05b Binary files /dev/null and b/docs/build/html/_static/css/fonts/lato-bold-italic.woff differ diff --git a/docs/build/html/_static/css/fonts/lato-bold-italic.woff2 b/docs/build/html/_static/css/fonts/lato-bold-italic.woff2 new file mode 100644 index 0000000..c4e3d80 Binary files /dev/null and b/docs/build/html/_static/css/fonts/lato-bold-italic.woff2 differ diff --git a/docs/build/html/_static/css/fonts/lato-bold.woff b/docs/build/html/_static/css/fonts/lato-bold.woff new file mode 100644 index 0000000..c6dff51 Binary files /dev/null and b/docs/build/html/_static/css/fonts/lato-bold.woff differ diff --git a/docs/build/html/_static/css/fonts/lato-bold.woff2 b/docs/build/html/_static/css/fonts/lato-bold.woff2 new file mode 100644 index 0000000..bb19504 Binary files /dev/null and b/docs/build/html/_static/css/fonts/lato-bold.woff2 differ diff --git a/docs/build/html/_static/css/fonts/lato-normal-italic.woff b/docs/build/html/_static/css/fonts/lato-normal-italic.woff new file mode 100644 index 0000000..76114bc Binary files /dev/null and b/docs/build/html/_static/css/fonts/lato-normal-italic.woff differ diff --git a/docs/build/html/_static/css/fonts/lato-normal-italic.woff2 b/docs/build/html/_static/css/fonts/lato-normal-italic.woff2 new file mode 100644 index 0000000..3404f37 Binary files /dev/null and b/docs/build/html/_static/css/fonts/lato-normal-italic.woff2 differ diff --git a/docs/build/html/_static/css/fonts/lato-normal.woff b/docs/build/html/_static/css/fonts/lato-normal.woff new file mode 100644 index 0000000..ae1307f Binary files /dev/null and b/docs/build/html/_static/css/fonts/lato-normal.woff differ diff --git a/docs/build/html/_static/css/fonts/lato-normal.woff2 b/docs/build/html/_static/css/fonts/lato-normal.woff2 new file mode 100644 index 0000000..3bf9843 Binary files /dev/null and b/docs/build/html/_static/css/fonts/lato-normal.woff2 differ diff --git a/docs/build/html/_static/css/theme.css b/docs/build/html/_static/css/theme.css new file mode 100644 index 0000000..8cd4f10 --- /dev/null +++ b/docs/build/html/_static/css/theme.css @@ -0,0 +1,4 @@ +html{box-sizing:border-box}*,:after,:before{box-sizing:inherit}article,aside,details,figcaption,figure,footer,header,hgroup,nav,section{display:block}audio,canvas,video{display:inline-block;*display:inline;*zoom:1}[hidden],audio:not([controls]){display:none}*{-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box}html{font-size:100%;-webkit-text-size-adjust:100%;-ms-text-size-adjust:100%}body{margin:0}a:active,a:hover{outline:0}abbr[title]{border-bottom:1px dotted}b,strong{font-weight:700}blockquote{margin:0}dfn{font-style:italic}ins{background:#ff9;text-decoration:none}ins,mark{color:#000}mark{background:#ff0;font-style:italic;font-weight:700}.rst-content code,.rst-content tt,code,kbd,pre,samp{font-family:monospace,serif;_font-family:courier new,monospace;font-size:1em}pre{white-space:pre}q{quotes:none}q:after,q:before{content:"";content:none}small{font-size:85%}sub,sup{font-size:75%;line-height:0;position:relative;vertical-align:baseline}sup{top:-.5em}sub{bottom:-.25em}dl,ol,ul{margin:0;padding:0;list-style:none;list-style-image:none}li{list-style:none}dd{margin:0}img{border:0;-ms-interpolation-mode:bicubic;vertical-align:middle;max-width:100%}svg:not(:root){overflow:hidden}figure,form{margin:0}label{cursor:pointer}button,input,select,textarea{font-size:100%;margin:0;vertical-align:baseline;*vertical-align:middle}button,input{line-height:normal}button,input[type=button],input[type=reset],input[type=submit]{cursor:pointer;-webkit-appearance:button;*overflow:visible}button[disabled],input[disabled]{cursor:default}input[type=search]{-webkit-appearance:textfield;-moz-box-sizing:content-box;-webkit-box-sizing:content-box;box-sizing:content-box}textarea{resize:vertical}table{border-collapse:collapse;border-spacing:0}td{vertical-align:top}.chromeframe{margin:.2em 0;background:#ccc;color:#000;padding:.2em 0}.ir{display:block;border:0;text-indent:-999em;overflow:hidden;background-color:transparent;background-repeat:no-repeat;text-align:left;direction:ltr;*line-height:0}.ir br{display:none}.hidden{display:none!important;visibility:hidden}.visuallyhidden{border:0;clip:rect(0 0 0 0);height:1px;margin:-1px;overflow:hidden;padding:0;position:absolute;width:1px}.visuallyhidden.focusable:active,.visuallyhidden.focusable:focus{clip:auto;height:auto;margin:0;overflow:visible;position:static;width:auto}.invisible{visibility:hidden}.relative{position:relative}big,small{font-size:100%}@media print{body,html,section{background:none!important}*{box-shadow:none!important;text-shadow:none!important;filter:none!important;-ms-filter:none!important}a,a:visited{text-decoration:underline}.ir a:after,a[href^="#"]:after,a[href^="javascript:"]:after{content:""}blockquote,pre{page-break-inside:avoid}thead{display:table-header-group}img,tr{page-break-inside:avoid}img{max-width:100%!important}@page{margin:.5cm}.rst-content .toctree-wrapper>p.caption,h2,h3,p{orphans:3;widows:3}.rst-content .toctree-wrapper>p.caption,h2,h3{page-break-after:avoid}}.btn,.fa:before,.icon:before,.rst-content .admonition,.rst-content .admonition-title:before,.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .code-block-caption .headerlink:before,.rst-content .danger,.rst-content .error,.rst-content .hint,.rst-content .important,.rst-content .note,.rst-content .seealso,.rst-content .tip,.rst-content .warning,.rst-content code.download span:first-child:before,.rst-content dl dt .headerlink:before,.rst-content h1 .headerlink:before,.rst-content h2 .headerlink:before,.rst-content h3 .headerlink:before,.rst-content h4 .headerlink:before,.rst-content h5 .headerlink:before,.rst-content h6 .headerlink:before,.rst-content p.caption .headerlink:before,.rst-content table>caption .headerlink:before,.rst-content tt.download span:first-child:before,.wy-alert,.wy-dropdown .caret:before,.wy-inline-validate.wy-inline-validate-danger .wy-input-context:before,.wy-inline-validate.wy-inline-validate-info .wy-input-context:before,.wy-inline-validate.wy-inline-validate-success .wy-input-context:before,.wy-inline-validate.wy-inline-validate-warning .wy-input-context:before,.wy-menu-vertical li.current>a,.wy-menu-vertical li.current>a span.toctree-expand:before,.wy-menu-vertical li.on a,.wy-menu-vertical li.on a span.toctree-expand:before,.wy-menu-vertical li span.toctree-expand:before,.wy-nav-top a,.wy-side-nav-search .wy-dropdown>a,.wy-side-nav-search>a,input[type=color],input[type=date],input[type=datetime-local],input[type=datetime],input[type=email],input[type=month],input[type=number],input[type=password],input[type=search],input[type=tel],input[type=text],input[type=time],input[type=url],input[type=week],select,textarea{-webkit-font-smoothing:antialiased}.clearfix{*zoom:1}.clearfix:after,.clearfix:before{display:table;content:""}.clearfix:after{clear:both}/*! + * Font Awesome 4.7.0 by @davegandy - http://fontawesome.io - @fontawesome + * License - http://fontawesome.io/license (Font: SIL OFL 1.1, CSS: MIT License) + */@font-face{font-family:FontAwesome;src:url(fonts/fontawesome-webfont.eot?674f50d287a8c48dc19ba404d20fe713);src:url(fonts/fontawesome-webfont.eot?674f50d287a8c48dc19ba404d20fe713?#iefix&v=4.7.0) format("embedded-opentype"),url(fonts/fontawesome-webfont.woff2?af7ae505a9eed503f8b8e6982036873e) format("woff2"),url(fonts/fontawesome-webfont.woff?fee66e712a8a08eef5805a46892932ad) format("woff"),url(fonts/fontawesome-webfont.ttf?b06871f281fee6b241d60582ae9369b9) format("truetype"),url(fonts/fontawesome-webfont.svg?912ec66d7572ff821749319396470bde#fontawesomeregular) format("svg");font-weight:400;font-style:normal}.fa,.icon,.rst-content .admonition-title,.rst-content .code-block-caption .headerlink,.rst-content code.download span:first-child,.rst-content dl dt .headerlink,.rst-content h1 .headerlink,.rst-content h2 .headerlink,.rst-content h3 .headerlink,.rst-content h4 .headerlink,.rst-content h5 .headerlink,.rst-content h6 .headerlink,.rst-content p.caption .headerlink,.rst-content table>caption .headerlink,.rst-content tt.download span:first-child,.wy-menu-vertical li.current>a span.toctree-expand,.wy-menu-vertical li.on a span.toctree-expand,.wy-menu-vertical li span.toctree-expand{display:inline-block;font:normal normal normal 14px/1 FontAwesome;font-size:inherit;text-rendering:auto;-webkit-font-smoothing:antialiased;-moz-osx-font-smoothing:grayscale}.fa-lg{font-size:1.33333em;line-height:.75em;vertical-align:-15%}.fa-2x{font-size:2em}.fa-3x{font-size:3em}.fa-4x{font-size:4em}.fa-5x{font-size:5em}.fa-fw{width:1.28571em;text-align:center}.fa-ul{padding-left:0;margin-left:2.14286em;list-style-type:none}.fa-ul>li{position:relative}.fa-li{position:absolute;left:-2.14286em;width:2.14286em;top:.14286em;text-align:center}.fa-li.fa-lg{left:-1.85714em}.fa-border{padding:.2em .25em .15em;border:.08em solid #eee;border-radius:.1em}.fa-pull-left{float:left}.fa-pull-right{float:right}.fa-pull-left.icon,.fa.fa-pull-left,.rst-content .code-block-caption .fa-pull-left.headerlink,.rst-content .fa-pull-left.admonition-title,.rst-content code.download span.fa-pull-left:first-child,.rst-content dl dt .fa-pull-left.headerlink,.rst-content h1 .fa-pull-left.headerlink,.rst-content h2 .fa-pull-left.headerlink,.rst-content h3 .fa-pull-left.headerlink,.rst-content h4 .fa-pull-left.headerlink,.rst-content h5 .fa-pull-left.headerlink,.rst-content h6 .fa-pull-left.headerlink,.rst-content p.caption .fa-pull-left.headerlink,.rst-content table>caption .fa-pull-left.headerlink,.rst-content tt.download span.fa-pull-left:first-child,.wy-menu-vertical li.current>a span.fa-pull-left.toctree-expand,.wy-menu-vertical li.on a span.fa-pull-left.toctree-expand,.wy-menu-vertical li span.fa-pull-left.toctree-expand{margin-right:.3em}.fa-pull-right.icon,.fa.fa-pull-right,.rst-content .code-block-caption .fa-pull-right.headerlink,.rst-content .fa-pull-right.admonition-title,.rst-content code.download span.fa-pull-right:first-child,.rst-content dl dt .fa-pull-right.headerlink,.rst-content h1 .fa-pull-right.headerlink,.rst-content h2 .fa-pull-right.headerlink,.rst-content h3 .fa-pull-right.headerlink,.rst-content h4 .fa-pull-right.headerlink,.rst-content h5 .fa-pull-right.headerlink,.rst-content h6 .fa-pull-right.headerlink,.rst-content p.caption .fa-pull-right.headerlink,.rst-content table>caption .fa-pull-right.headerlink,.rst-content tt.download span.fa-pull-right:first-child,.wy-menu-vertical li.current>a span.fa-pull-right.toctree-expand,.wy-menu-vertical li.on a span.fa-pull-right.toctree-expand,.wy-menu-vertical li span.fa-pull-right.toctree-expand{margin-left:.3em}.pull-right{float:right}.pull-left{float:left}.fa.pull-left,.pull-left.icon,.rst-content .code-block-caption .pull-left.headerlink,.rst-content .pull-left.admonition-title,.rst-content code.download span.pull-left:first-child,.rst-content dl dt .pull-left.headerlink,.rst-content h1 .pull-left.headerlink,.rst-content h2 .pull-left.headerlink,.rst-content h3 .pull-left.headerlink,.rst-content h4 .pull-left.headerlink,.rst-content h5 .pull-left.headerlink,.rst-content h6 .pull-left.headerlink,.rst-content p.caption .pull-left.headerlink,.rst-content table>caption .pull-left.headerlink,.rst-content tt.download span.pull-left:first-child,.wy-menu-vertical li.current>a span.pull-left.toctree-expand,.wy-menu-vertical li.on a span.pull-left.toctree-expand,.wy-menu-vertical li span.pull-left.toctree-expand{margin-right:.3em}.fa.pull-right,.pull-right.icon,.rst-content .code-block-caption .pull-right.headerlink,.rst-content .pull-right.admonition-title,.rst-content code.download span.pull-right:first-child,.rst-content dl dt .pull-right.headerlink,.rst-content h1 .pull-right.headerlink,.rst-content h2 .pull-right.headerlink,.rst-content h3 .pull-right.headerlink,.rst-content h4 .pull-right.headerlink,.rst-content h5 .pull-right.headerlink,.rst-content h6 .pull-right.headerlink,.rst-content p.caption .pull-right.headerlink,.rst-content table>caption .pull-right.headerlink,.rst-content tt.download span.pull-right:first-child,.wy-menu-vertical li.current>a span.pull-right.toctree-expand,.wy-menu-vertical li.on a span.pull-right.toctree-expand,.wy-menu-vertical li span.pull-right.toctree-expand{margin-left:.3em}.fa-spin{-webkit-animation:fa-spin 2s linear infinite;animation:fa-spin 2s linear infinite}.fa-pulse{-webkit-animation:fa-spin 1s steps(8) infinite;animation:fa-spin 1s steps(8) infinite}@-webkit-keyframes fa-spin{0%{-webkit-transform:rotate(0deg);transform:rotate(0deg)}to{-webkit-transform:rotate(359deg);transform:rotate(359deg)}}@keyframes fa-spin{0%{-webkit-transform:rotate(0deg);transform:rotate(0deg)}to{-webkit-transform:rotate(359deg);transform:rotate(359deg)}}.fa-rotate-90{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=1)";-webkit-transform:rotate(90deg);-ms-transform:rotate(90deg);transform:rotate(90deg)}.fa-rotate-180{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=2)";-webkit-transform:rotate(180deg);-ms-transform:rotate(180deg);transform:rotate(180deg)}.fa-rotate-270{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=3)";-webkit-transform:rotate(270deg);-ms-transform:rotate(270deg);transform:rotate(270deg)}.fa-flip-horizontal{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=0, mirror=1)";-webkit-transform:scaleX(-1);-ms-transform:scaleX(-1);transform:scaleX(-1)}.fa-flip-vertical{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=2, mirror=1)";-webkit-transform:scaleY(-1);-ms-transform:scaleY(-1);transform:scaleY(-1)}:root .fa-flip-horizontal,:root .fa-flip-vertical,:root .fa-rotate-90,:root .fa-rotate-180,:root .fa-rotate-270{filter:none}.fa-stack{position:relative;display:inline-block;width:2em;height:2em;line-height:2em;vertical-align:middle}.fa-stack-1x,.fa-stack-2x{position:absolute;left:0;width:100%;text-align:center}.fa-stack-1x{line-height:inherit}.fa-stack-2x{font-size:2em}.fa-inverse{color:#fff}.fa-glass:before{content:""}.fa-music:before{content:""}.fa-search:before,.icon-search:before{content:""}.fa-envelope-o:before{content:""}.fa-heart:before{content:""}.fa-star:before{content:""}.fa-star-o:before{content:""}.fa-user:before{content:""}.fa-film:before{content:""}.fa-th-large:before{content:""}.fa-th:before{content:""}.fa-th-list:before{content:""}.fa-check:before{content:""}.fa-close:before,.fa-remove:before,.fa-times:before{content:""}.fa-search-plus:before{content:""}.fa-search-minus:before{content:""}.fa-power-off:before{content:""}.fa-signal:before{content:""}.fa-cog:before,.fa-gear:before{content:""}.fa-trash-o:before{content:""}.fa-home:before,.icon-home:before{content:""}.fa-file-o:before{content:""}.fa-clock-o:before{content:""}.fa-road:before{content:""}.fa-download:before,.rst-content code.download span:first-child:before,.rst-content tt.download span:first-child:before{content:""}.fa-arrow-circle-o-down:before{content:""}.fa-arrow-circle-o-up:before{content:""}.fa-inbox:before{content:""}.fa-play-circle-o:before{content:""}.fa-repeat:before,.fa-rotate-right:before{content:""}.fa-refresh:before{content:""}.fa-list-alt:before{content:""}.fa-lock:before{content:""}.fa-flag:before{content:""}.fa-headphones:before{content:""}.fa-volume-off:before{content:""}.fa-volume-down:before{content:""}.fa-volume-up:before{content:""}.fa-qrcode:before{content:""}.fa-barcode:before{content:""}.fa-tag:before{content:""}.fa-tags:before{content:""}.fa-book:before,.icon-book:before{content:""}.fa-bookmark:before{content:""}.fa-print:before{content:""}.fa-camera:before{content:""}.fa-font:before{content:""}.fa-bold:before{content:""}.fa-italic:before{content:""}.fa-text-height:before{content:""}.fa-text-width:before{content:""}.fa-align-left:before{content:""}.fa-align-center:before{content:""}.fa-align-right:before{content:""}.fa-align-justify:before{content:""}.fa-list:before{content:""}.fa-dedent:before,.fa-outdent:before{content:""}.fa-indent:before{content:""}.fa-video-camera:before{content:""}.fa-image:before,.fa-photo:before,.fa-picture-o:before{content:""}.fa-pencil:before{content:""}.fa-map-marker:before{content:""}.fa-adjust:before{content:""}.fa-tint:before{content:""}.fa-edit:before,.fa-pencil-square-o:before{content:""}.fa-share-square-o:before{content:""}.fa-check-square-o:before{content:""}.fa-arrows:before{content:""}.fa-step-backward:before{content:""}.fa-fast-backward:before{content:""}.fa-backward:before{content:""}.fa-play:before{content:""}.fa-pause:before{content:""}.fa-stop:before{content:""}.fa-forward:before{content:""}.fa-fast-forward:before{content:""}.fa-step-forward:before{content:""}.fa-eject:before{content:""}.fa-chevron-left:before{content:""}.fa-chevron-right:before{content:""}.fa-plus-circle:before{content:""}.fa-minus-circle:before{content:""}.fa-times-circle:before,.wy-inline-validate.wy-inline-validate-danger .wy-input-context:before{content:""}.fa-check-circle:before,.wy-inline-validate.wy-inline-validate-success .wy-input-context:before{content:""}.fa-question-circle:before{content:""}.fa-info-circle:before{content:""}.fa-crosshairs:before{content:""}.fa-times-circle-o:before{content:""}.fa-check-circle-o:before{content:""}.fa-ban:before{content:""}.fa-arrow-left:before{content:""}.fa-arrow-right:before{content:""}.fa-arrow-up:before{content:""}.fa-arrow-down:before{content:""}.fa-mail-forward:before,.fa-share:before{content:""}.fa-expand:before{content:""}.fa-compress:before{content:""}.fa-plus:before{content:""}.fa-minus:before{content:""}.fa-asterisk:before{content:""}.fa-exclamation-circle:before,.rst-content .admonition-title:before,.wy-inline-validate.wy-inline-validate-info .wy-input-context:before,.wy-inline-validate.wy-inline-validate-warning .wy-input-context:before{content:""}.fa-gift:before{content:""}.fa-leaf:before{content:""}.fa-fire:before,.icon-fire:before{content:""}.fa-eye:before{content:""}.fa-eye-slash:before{content:""}.fa-exclamation-triangle:before,.fa-warning:before{content:""}.fa-plane:before{content:""}.fa-calendar:before{content:""}.fa-random:before{content:""}.fa-comment:before{content:""}.fa-magnet:before{content:""}.fa-chevron-up:before{content:""}.fa-chevron-down:before{content:""}.fa-retweet:before{content:""}.fa-shopping-cart:before{content:""}.fa-folder:before{content:""}.fa-folder-open:before{content:""}.fa-arrows-v:before{content:""}.fa-arrows-h:before{content:""}.fa-bar-chart-o:before,.fa-bar-chart:before{content:""}.fa-twitter-square:before{content:""}.fa-facebook-square:before{content:""}.fa-camera-retro:before{content:""}.fa-key:before{content:""}.fa-cogs:before,.fa-gears:before{content:""}.fa-comments:before{content:""}.fa-thumbs-o-up:before{content:""}.fa-thumbs-o-down:before{content:""}.fa-star-half:before{content:""}.fa-heart-o:before{content:""}.fa-sign-out:before{content:""}.fa-linkedin-square:before{content:""}.fa-thumb-tack:before{content:""}.fa-external-link:before{content:""}.fa-sign-in:before{content:""}.fa-trophy:before{content:""}.fa-github-square:before{content:""}.fa-upload:before{content:""}.fa-lemon-o:before{content:""}.fa-phone:before{content:""}.fa-square-o:before{content:""}.fa-bookmark-o:before{content:""}.fa-phone-square:before{content:""}.fa-twitter:before{content:""}.fa-facebook-f:before,.fa-facebook:before{content:""}.fa-github:before,.icon-github:before{content:""}.fa-unlock:before{content:""}.fa-credit-card:before{content:""}.fa-feed:before,.fa-rss:before{content:""}.fa-hdd-o:before{content:""}.fa-bullhorn:before{content:""}.fa-bell:before{content:""}.fa-certificate:before{content:""}.fa-hand-o-right:before{content:""}.fa-hand-o-left:before{content:""}.fa-hand-o-up:before{content:""}.fa-hand-o-down:before{content:""}.fa-arrow-circle-left:before,.icon-circle-arrow-left:before{content:""}.fa-arrow-circle-right:before,.icon-circle-arrow-right:before{content:""}.fa-arrow-circle-up:before{content:""}.fa-arrow-circle-down:before{content:""}.fa-globe:before{content:""}.fa-wrench:before{content:""}.fa-tasks:before{content:""}.fa-filter:before{content:""}.fa-briefcase:before{content:""}.fa-arrows-alt:before{content:""}.fa-group:before,.fa-users:before{content:""}.fa-chain:before,.fa-link:before,.icon-link:before{content:""}.fa-cloud:before{content:""}.fa-flask:before{content:""}.fa-cut:before,.fa-scissors:before{content:""}.fa-copy:before,.fa-files-o:before{content:""}.fa-paperclip:before{content:""}.fa-floppy-o:before,.fa-save:before{content:""}.fa-square:before{content:""}.fa-bars:before,.fa-navicon:before,.fa-reorder:before{content:""}.fa-list-ul:before{content:""}.fa-list-ol:before{content:""}.fa-strikethrough:before{content:""}.fa-underline:before{content:""}.fa-table:before{content:""}.fa-magic:before{content:""}.fa-truck:before{content:""}.fa-pinterest:before{content:""}.fa-pinterest-square:before{content:""}.fa-google-plus-square:before{content:""}.fa-google-plus:before{content:""}.fa-money:before{content:""}.fa-caret-down:before,.icon-caret-down:before,.wy-dropdown .caret:before{content:""}.fa-caret-up:before{content:""}.fa-caret-left:before{content:""}.fa-caret-right:before{content:""}.fa-columns:before{content:""}.fa-sort:before,.fa-unsorted:before{content:""}.fa-sort-desc:before,.fa-sort-down:before{content:""}.fa-sort-asc:before,.fa-sort-up:before{content:""}.fa-envelope:before{content:""}.fa-linkedin:before{content:""}.fa-rotate-left:before,.fa-undo:before{content:""}.fa-gavel:before,.fa-legal:before{content:""}.fa-dashboard:before,.fa-tachometer:before{content:""}.fa-comment-o:before{content:""}.fa-comments-o:before{content:""}.fa-bolt:before,.fa-flash:before{content:""}.fa-sitemap:before{content:""}.fa-umbrella:before{content:""}.fa-clipboard:before,.fa-paste:before{content:""}.fa-lightbulb-o:before{content:""}.fa-exchange:before{content:""}.fa-cloud-download:before{content:""}.fa-cloud-upload:before{content:""}.fa-user-md:before{content:""}.fa-stethoscope:before{content:""}.fa-suitcase:before{content:""}.fa-bell-o:before{content:""}.fa-coffee:before{content:""}.fa-cutlery:before{content:""}.fa-file-text-o:before{content:""}.fa-building-o:before{content:""}.fa-hospital-o:before{content:""}.fa-ambulance:before{content:""}.fa-medkit:before{content:""}.fa-fighter-jet:before{content:""}.fa-beer:before{content:""}.fa-h-square:before{content:""}.fa-plus-square:before{content:""}.fa-angle-double-left:before{content:""}.fa-angle-double-right:before{content:""}.fa-angle-double-up:before{content:""}.fa-angle-double-down:before{content:""}.fa-angle-left:before{content:""}.fa-angle-right:before{content:""}.fa-angle-up:before{content:""}.fa-angle-down:before{content:""}.fa-desktop:before{content:""}.fa-laptop:before{content:""}.fa-tablet:before{content:""}.fa-mobile-phone:before,.fa-mobile:before{content:""}.fa-circle-o:before{content:""}.fa-quote-left:before{content:""}.fa-quote-right:before{content:""}.fa-spinner:before{content:""}.fa-circle:before{content:""}.fa-mail-reply:before,.fa-reply:before{content:""}.fa-github-alt:before{content:""}.fa-folder-o:before{content:""}.fa-folder-open-o:before{content:""}.fa-smile-o:before{content:""}.fa-frown-o:before{content:""}.fa-meh-o:before{content:""}.fa-gamepad:before{content:""}.fa-keyboard-o:before{content:""}.fa-flag-o:before{content:""}.fa-flag-checkered:before{content:""}.fa-terminal:before{content:""}.fa-code:before{content:""}.fa-mail-reply-all:before,.fa-reply-all:before{content:""}.fa-star-half-empty:before,.fa-star-half-full:before,.fa-star-half-o:before{content:""}.fa-location-arrow:before{content:""}.fa-crop:before{content:""}.fa-code-fork:before{content:""}.fa-chain-broken:before,.fa-unlink:before{content:""}.fa-question:before{content:""}.fa-info:before{content:""}.fa-exclamation:before{content:""}.fa-superscript:before{content:""}.fa-subscript:before{content:""}.fa-eraser:before{content:""}.fa-puzzle-piece:before{content:""}.fa-microphone:before{content:""}.fa-microphone-slash:before{content:""}.fa-shield:before{content:""}.fa-calendar-o:before{content:""}.fa-fire-extinguisher:before{content:""}.fa-rocket:before{content:""}.fa-maxcdn:before{content:""}.fa-chevron-circle-left:before{content:""}.fa-chevron-circle-right:before{content:""}.fa-chevron-circle-up:before{content:""}.fa-chevron-circle-down:before{content:""}.fa-html5:before{content:""}.fa-css3:before{content:""}.fa-anchor:before{content:""}.fa-unlock-alt:before{content:""}.fa-bullseye:before{content:""}.fa-ellipsis-h:before{content:""}.fa-ellipsis-v:before{content:""}.fa-rss-square:before{content:""}.fa-play-circle:before{content:""}.fa-ticket:before{content:""}.fa-minus-square:before{content:""}.fa-minus-square-o:before,.wy-menu-vertical li.current>a span.toctree-expand:before,.wy-menu-vertical li.on a span.toctree-expand:before{content:""}.fa-level-up:before{content:""}.fa-level-down:before{content:""}.fa-check-square:before{content:""}.fa-pencil-square:before{content:""}.fa-external-link-square:before{content:""}.fa-share-square:before{content:""}.fa-compass:before{content:""}.fa-caret-square-o-down:before,.fa-toggle-down:before{content:""}.fa-caret-square-o-up:before,.fa-toggle-up:before{content:""}.fa-caret-square-o-right:before,.fa-toggle-right:before{content:""}.fa-eur:before,.fa-euro:before{content:""}.fa-gbp:before{content:""}.fa-dollar:before,.fa-usd:before{content:""}.fa-inr:before,.fa-rupee:before{content:""}.fa-cny:before,.fa-jpy:before,.fa-rmb:before,.fa-yen:before{content:""}.fa-rouble:before,.fa-rub:before,.fa-ruble:before{content:""}.fa-krw:before,.fa-won:before{content:""}.fa-bitcoin:before,.fa-btc:before{content:""}.fa-file:before{content:""}.fa-file-text:before{content:""}.fa-sort-alpha-asc:before{content:""}.fa-sort-alpha-desc:before{content:""}.fa-sort-amount-asc:before{content:""}.fa-sort-amount-desc:before{content:""}.fa-sort-numeric-asc:before{content:""}.fa-sort-numeric-desc:before{content:""}.fa-thumbs-up:before{content:""}.fa-thumbs-down:before{content:""}.fa-youtube-square:before{content:""}.fa-youtube:before{content:""}.fa-xing:before{content:""}.fa-xing-square:before{content:""}.fa-youtube-play:before{content:""}.fa-dropbox:before{content:""}.fa-stack-overflow:before{content:""}.fa-instagram:before{content:""}.fa-flickr:before{content:""}.fa-adn:before{content:""}.fa-bitbucket:before,.icon-bitbucket:before{content:""}.fa-bitbucket-square:before{content:""}.fa-tumblr:before{content:""}.fa-tumblr-square:before{content:""}.fa-long-arrow-down:before{content:""}.fa-long-arrow-up:before{content:""}.fa-long-arrow-left:before{content:""}.fa-long-arrow-right:before{content:""}.fa-apple:before{content:""}.fa-windows:before{content:""}.fa-android:before{content:""}.fa-linux:before{content:""}.fa-dribbble:before{content:""}.fa-skype:before{content:""}.fa-foursquare:before{content:""}.fa-trello:before{content:""}.fa-female:before{content:""}.fa-male:before{content:""}.fa-gittip:before,.fa-gratipay:before{content:""}.fa-sun-o:before{content:""}.fa-moon-o:before{content:""}.fa-archive:before{content:""}.fa-bug:before{content:""}.fa-vk:before{content:""}.fa-weibo:before{content:""}.fa-renren:before{content:""}.fa-pagelines:before{content:""}.fa-stack-exchange:before{content:""}.fa-arrow-circle-o-right:before{content:""}.fa-arrow-circle-o-left:before{content:""}.fa-caret-square-o-left:before,.fa-toggle-left:before{content:""}.fa-dot-circle-o:before{content:""}.fa-wheelchair:before{content:""}.fa-vimeo-square:before{content:""}.fa-try:before,.fa-turkish-lira:before{content:""}.fa-plus-square-o:before,.wy-menu-vertical li span.toctree-expand:before{content:""}.fa-space-shuttle:before{content:""}.fa-slack:before{content:""}.fa-envelope-square:before{content:""}.fa-wordpress:before{content:""}.fa-openid:before{content:""}.fa-bank:before,.fa-institution:before,.fa-university:before{content:""}.fa-graduation-cap:before,.fa-mortar-board:before{content:""}.fa-yahoo:before{content:""}.fa-google:before{content:""}.fa-reddit:before{content:""}.fa-reddit-square:before{content:""}.fa-stumbleupon-circle:before{content:""}.fa-stumbleupon:before{content:""}.fa-delicious:before{content:""}.fa-digg:before{content:""}.fa-pied-piper-pp:before{content:""}.fa-pied-piper-alt:before{content:""}.fa-drupal:before{content:""}.fa-joomla:before{content:""}.fa-language:before{content:""}.fa-fax:before{content:""}.fa-building:before{content:""}.fa-child:before{content:""}.fa-paw:before{content:""}.fa-spoon:before{content:""}.fa-cube:before{content:""}.fa-cubes:before{content:""}.fa-behance:before{content:""}.fa-behance-square:before{content:""}.fa-steam:before{content:""}.fa-steam-square:before{content:""}.fa-recycle:before{content:""}.fa-automobile:before,.fa-car:before{content:""}.fa-cab:before,.fa-taxi:before{content:""}.fa-tree:before{content:""}.fa-spotify:before{content:""}.fa-deviantart:before{content:""}.fa-soundcloud:before{content:""}.fa-database:before{content:""}.fa-file-pdf-o:before{content:""}.fa-file-word-o:before{content:""}.fa-file-excel-o:before{content:""}.fa-file-powerpoint-o:before{content:""}.fa-file-image-o:before,.fa-file-photo-o:before,.fa-file-picture-o:before{content:""}.fa-file-archive-o:before,.fa-file-zip-o:before{content:""}.fa-file-audio-o:before,.fa-file-sound-o:before{content:""}.fa-file-movie-o:before,.fa-file-video-o:before{content:""}.fa-file-code-o:before{content:""}.fa-vine:before{content:""}.fa-codepen:before{content:""}.fa-jsfiddle:before{content:""}.fa-life-bouy:before,.fa-life-buoy:before,.fa-life-ring:before,.fa-life-saver:before,.fa-support:before{content:""}.fa-circle-o-notch:before{content:""}.fa-ra:before,.fa-rebel:before,.fa-resistance:before{content:""}.fa-empire:before,.fa-ge:before{content:""}.fa-git-square:before{content:""}.fa-git:before{content:""}.fa-hacker-news:before,.fa-y-combinator-square:before,.fa-yc-square:before{content:""}.fa-tencent-weibo:before{content:""}.fa-qq:before{content:""}.fa-wechat:before,.fa-weixin:before{content:""}.fa-paper-plane:before,.fa-send:before{content:""}.fa-paper-plane-o:before,.fa-send-o:before{content:""}.fa-history:before{content:""}.fa-circle-thin:before{content:""}.fa-header:before{content:""}.fa-paragraph:before{content:""}.fa-sliders:before{content:""}.fa-share-alt:before{content:""}.fa-share-alt-square:before{content:""}.fa-bomb:before{content:""}.fa-futbol-o:before,.fa-soccer-ball-o:before{content:""}.fa-tty:before{content:""}.fa-binoculars:before{content:""}.fa-plug:before{content:""}.fa-slideshare:before{content:""}.fa-twitch:before{content:""}.fa-yelp:before{content:""}.fa-newspaper-o:before{content:""}.fa-wifi:before{content:""}.fa-calculator:before{content:""}.fa-paypal:before{content:""}.fa-google-wallet:before{content:""}.fa-cc-visa:before{content:""}.fa-cc-mastercard:before{content:""}.fa-cc-discover:before{content:""}.fa-cc-amex:before{content:""}.fa-cc-paypal:before{content:""}.fa-cc-stripe:before{content:""}.fa-bell-slash:before{content:""}.fa-bell-slash-o:before{content:""}.fa-trash:before{content:""}.fa-copyright:before{content:""}.fa-at:before{content:""}.fa-eyedropper:before{content:""}.fa-paint-brush:before{content:""}.fa-birthday-cake:before{content:""}.fa-area-chart:before{content:""}.fa-pie-chart:before{content:""}.fa-line-chart:before{content:""}.fa-lastfm:before{content:""}.fa-lastfm-square:before{content:""}.fa-toggle-off:before{content:""}.fa-toggle-on:before{content:""}.fa-bicycle:before{content:""}.fa-bus:before{content:""}.fa-ioxhost:before{content:""}.fa-angellist:before{content:""}.fa-cc:before{content:""}.fa-ils:before,.fa-shekel:before,.fa-sheqel:before{content:""}.fa-meanpath:before{content:""}.fa-buysellads:before{content:""}.fa-connectdevelop:before{content:""}.fa-dashcube:before{content:""}.fa-forumbee:before{content:""}.fa-leanpub:before{content:""}.fa-sellsy:before{content:""}.fa-shirtsinbulk:before{content:""}.fa-simplybuilt:before{content:""}.fa-skyatlas:before{content:""}.fa-cart-plus:before{content:""}.fa-cart-arrow-down:before{content:""}.fa-diamond:before{content:""}.fa-ship:before{content:""}.fa-user-secret:before{content:""}.fa-motorcycle:before{content:""}.fa-street-view:before{content:""}.fa-heartbeat:before{content:""}.fa-venus:before{content:""}.fa-mars:before{content:""}.fa-mercury:before{content:""}.fa-intersex:before,.fa-transgender:before{content:""}.fa-transgender-alt:before{content:""}.fa-venus-double:before{content:""}.fa-mars-double:before{content:""}.fa-venus-mars:before{content:""}.fa-mars-stroke:before{content:""}.fa-mars-stroke-v:before{content:""}.fa-mars-stroke-h:before{content:""}.fa-neuter:before{content:""}.fa-genderless:before{content:""}.fa-facebook-official:before{content:""}.fa-pinterest-p:before{content:""}.fa-whatsapp:before{content:""}.fa-server:before{content:""}.fa-user-plus:before{content:""}.fa-user-times:before{content:""}.fa-bed:before,.fa-hotel:before{content:""}.fa-viacoin:before{content:""}.fa-train:before{content:""}.fa-subway:before{content:""}.fa-medium:before{content:""}.fa-y-combinator:before,.fa-yc:before{content:""}.fa-optin-monster:before{content:""}.fa-opencart:before{content:""}.fa-expeditedssl:before{content:""}.fa-battery-4:before,.fa-battery-full:before,.fa-battery:before{content:""}.fa-battery-3:before,.fa-battery-three-quarters:before{content:""}.fa-battery-2:before,.fa-battery-half:before{content:""}.fa-battery-1:before,.fa-battery-quarter:before{content:""}.fa-battery-0:before,.fa-battery-empty:before{content:""}.fa-mouse-pointer:before{content:""}.fa-i-cursor:before{content:""}.fa-object-group:before{content:""}.fa-object-ungroup:before{content:""}.fa-sticky-note:before{content:""}.fa-sticky-note-o:before{content:""}.fa-cc-jcb:before{content:""}.fa-cc-diners-club:before{content:""}.fa-clone:before{content:""}.fa-balance-scale:before{content:""}.fa-hourglass-o:before{content:""}.fa-hourglass-1:before,.fa-hourglass-start:before{content:""}.fa-hourglass-2:before,.fa-hourglass-half:before{content:""}.fa-hourglass-3:before,.fa-hourglass-end:before{content:""}.fa-hourglass:before{content:""}.fa-hand-grab-o:before,.fa-hand-rock-o:before{content:""}.fa-hand-paper-o:before,.fa-hand-stop-o:before{content:""}.fa-hand-scissors-o:before{content:""}.fa-hand-lizard-o:before{content:""}.fa-hand-spock-o:before{content:""}.fa-hand-pointer-o:before{content:""}.fa-hand-peace-o:before{content:""}.fa-trademark:before{content:""}.fa-registered:before{content:""}.fa-creative-commons:before{content:""}.fa-gg:before{content:""}.fa-gg-circle:before{content:""}.fa-tripadvisor:before{content:""}.fa-odnoklassniki:before{content:""}.fa-odnoklassniki-square:before{content:""}.fa-get-pocket:before{content:""}.fa-wikipedia-w:before{content:""}.fa-safari:before{content:""}.fa-chrome:before{content:""}.fa-firefox:before{content:""}.fa-opera:before{content:""}.fa-internet-explorer:before{content:""}.fa-television:before,.fa-tv:before{content:""}.fa-contao:before{content:""}.fa-500px:before{content:""}.fa-amazon:before{content:""}.fa-calendar-plus-o:before{content:""}.fa-calendar-minus-o:before{content:""}.fa-calendar-times-o:before{content:""}.fa-calendar-check-o:before{content:""}.fa-industry:before{content:""}.fa-map-pin:before{content:""}.fa-map-signs:before{content:""}.fa-map-o:before{content:""}.fa-map:before{content:""}.fa-commenting:before{content:""}.fa-commenting-o:before{content:""}.fa-houzz:before{content:""}.fa-vimeo:before{content:""}.fa-black-tie:before{content:""}.fa-fonticons:before{content:""}.fa-reddit-alien:before{content:""}.fa-edge:before{content:""}.fa-credit-card-alt:before{content:""}.fa-codiepie:before{content:""}.fa-modx:before{content:""}.fa-fort-awesome:before{content:""}.fa-usb:before{content:""}.fa-product-hunt:before{content:""}.fa-mixcloud:before{content:""}.fa-scribd:before{content:""}.fa-pause-circle:before{content:""}.fa-pause-circle-o:before{content:""}.fa-stop-circle:before{content:""}.fa-stop-circle-o:before{content:""}.fa-shopping-bag:before{content:""}.fa-shopping-basket:before{content:""}.fa-hashtag:before{content:""}.fa-bluetooth:before{content:""}.fa-bluetooth-b:before{content:""}.fa-percent:before{content:""}.fa-gitlab:before,.icon-gitlab:before{content:""}.fa-wpbeginner:before{content:""}.fa-wpforms:before{content:""}.fa-envira:before{content:""}.fa-universal-access:before{content:""}.fa-wheelchair-alt:before{content:""}.fa-question-circle-o:before{content:""}.fa-blind:before{content:""}.fa-audio-description:before{content:""}.fa-volume-control-phone:before{content:""}.fa-braille:before{content:""}.fa-assistive-listening-systems:before{content:""}.fa-american-sign-language-interpreting:before,.fa-asl-interpreting:before{content:""}.fa-deaf:before,.fa-deafness:before,.fa-hard-of-hearing:before{content:""}.fa-glide:before{content:""}.fa-glide-g:before{content:""}.fa-sign-language:before,.fa-signing:before{content:""}.fa-low-vision:before{content:""}.fa-viadeo:before{content:""}.fa-viadeo-square:before{content:""}.fa-snapchat:before{content:""}.fa-snapchat-ghost:before{content:""}.fa-snapchat-square:before{content:""}.fa-pied-piper:before{content:""}.fa-first-order:before{content:""}.fa-yoast:before{content:""}.fa-themeisle:before{content:""}.fa-google-plus-circle:before,.fa-google-plus-official:before{content:""}.fa-fa:before,.fa-font-awesome:before{content:""}.fa-handshake-o:before{content:""}.fa-envelope-open:before{content:""}.fa-envelope-open-o:before{content:""}.fa-linode:before{content:""}.fa-address-book:before{content:""}.fa-address-book-o:before{content:""}.fa-address-card:before,.fa-vcard:before{content:""}.fa-address-card-o:before,.fa-vcard-o:before{content:""}.fa-user-circle:before{content:""}.fa-user-circle-o:before{content:""}.fa-user-o:before{content:""}.fa-id-badge:before{content:""}.fa-drivers-license:before,.fa-id-card:before{content:""}.fa-drivers-license-o:before,.fa-id-card-o:before{content:""}.fa-quora:before{content:""}.fa-free-code-camp:before{content:""}.fa-telegram:before{content:""}.fa-thermometer-4:before,.fa-thermometer-full:before,.fa-thermometer:before{content:""}.fa-thermometer-3:before,.fa-thermometer-three-quarters:before{content:""}.fa-thermometer-2:before,.fa-thermometer-half:before{content:""}.fa-thermometer-1:before,.fa-thermometer-quarter:before{content:""}.fa-thermometer-0:before,.fa-thermometer-empty:before{content:""}.fa-shower:before{content:""}.fa-bath:before,.fa-bathtub:before,.fa-s15:before{content:""}.fa-podcast:before{content:""}.fa-window-maximize:before{content:""}.fa-window-minimize:before{content:""}.fa-window-restore:before{content:""}.fa-times-rectangle:before,.fa-window-close:before{content:""}.fa-times-rectangle-o:before,.fa-window-close-o:before{content:""}.fa-bandcamp:before{content:""}.fa-grav:before{content:""}.fa-etsy:before{content:""}.fa-imdb:before{content:""}.fa-ravelry:before{content:""}.fa-eercast:before{content:""}.fa-microchip:before{content:""}.fa-snowflake-o:before{content:""}.fa-superpowers:before{content:""}.fa-wpexplorer:before{content:""}.fa-meetup:before{content:""}.sr-only{position:absolute;width:1px;height:1px;padding:0;margin:-1px;overflow:hidden;clip:rect(0,0,0,0);border:0}.sr-only-focusable:active,.sr-only-focusable:focus{position:static;width:auto;height:auto;margin:0;overflow:visible;clip:auto}.fa,.icon,.rst-content .admonition-title,.rst-content .code-block-caption .headerlink,.rst-content code.download span:first-child,.rst-content dl dt .headerlink,.rst-content h1 .headerlink,.rst-content h2 .headerlink,.rst-content h3 .headerlink,.rst-content h4 .headerlink,.rst-content h5 .headerlink,.rst-content h6 .headerlink,.rst-content p.caption .headerlink,.rst-content table>caption .headerlink,.rst-content tt.download span:first-child,.wy-dropdown .caret,.wy-inline-validate.wy-inline-validate-danger .wy-input-context,.wy-inline-validate.wy-inline-validate-info .wy-input-context,.wy-inline-validate.wy-inline-validate-success .wy-input-context,.wy-inline-validate.wy-inline-validate-warning .wy-input-context,.wy-menu-vertical li.current>a span.toctree-expand,.wy-menu-vertical li.on a span.toctree-expand,.wy-menu-vertical li span.toctree-expand{font-family:inherit}.fa:before,.icon:before,.rst-content .admonition-title:before,.rst-content .code-block-caption .headerlink:before,.rst-content code.download span:first-child:before,.rst-content dl dt .headerlink:before,.rst-content h1 .headerlink:before,.rst-content h2 .headerlink:before,.rst-content h3 .headerlink:before,.rst-content h4 .headerlink:before,.rst-content h5 .headerlink:before,.rst-content h6 .headerlink:before,.rst-content p.caption .headerlink:before,.rst-content table>caption .headerlink:before,.rst-content tt.download span:first-child:before,.wy-dropdown .caret:before,.wy-inline-validate.wy-inline-validate-danger .wy-input-context:before,.wy-inline-validate.wy-inline-validate-info .wy-input-context:before,.wy-inline-validate.wy-inline-validate-success .wy-input-context:before,.wy-inline-validate.wy-inline-validate-warning .wy-input-context:before,.wy-menu-vertical li.current>a span.toctree-expand:before,.wy-menu-vertical li.on a span.toctree-expand:before,.wy-menu-vertical li span.toctree-expand:before{font-family:FontAwesome;display:inline-block;font-style:normal;font-weight:400;line-height:1;text-decoration:inherit}.rst-content .code-block-caption a .headerlink,.rst-content a .admonition-title,.rst-content code.download a span:first-child,.rst-content dl dt a .headerlink,.rst-content h1 a .headerlink,.rst-content h2 a .headerlink,.rst-content h3 a .headerlink,.rst-content h4 a .headerlink,.rst-content h5 a .headerlink,.rst-content h6 a .headerlink,.rst-content p.caption a .headerlink,.rst-content table>caption a .headerlink,.rst-content tt.download a span:first-child,.wy-menu-vertical li.current>a span.toctree-expand,.wy-menu-vertical li.on a span.toctree-expand,.wy-menu-vertical li a span.toctree-expand,a .fa,a .icon,a .rst-content .admonition-title,a .rst-content .code-block-caption .headerlink,a .rst-content code.download span:first-child,a .rst-content dl dt .headerlink,a .rst-content h1 .headerlink,a .rst-content h2 .headerlink,a .rst-content h3 .headerlink,a .rst-content h4 .headerlink,a .rst-content h5 .headerlink,a .rst-content h6 .headerlink,a .rst-content p.caption .headerlink,a .rst-content table>caption .headerlink,a .rst-content tt.download span:first-child,a .wy-menu-vertical li span.toctree-expand{display:inline-block;text-decoration:inherit}.btn .fa,.btn .icon,.btn .rst-content .admonition-title,.btn .rst-content .code-block-caption .headerlink,.btn .rst-content code.download span:first-child,.btn .rst-content dl dt .headerlink,.btn .rst-content h1 .headerlink,.btn .rst-content h2 .headerlink,.btn .rst-content h3 .headerlink,.btn .rst-content h4 .headerlink,.btn .rst-content h5 .headerlink,.btn .rst-content h6 .headerlink,.btn .rst-content p.caption .headerlink,.btn .rst-content table>caption .headerlink,.btn .rst-content tt.download span:first-child,.btn .wy-menu-vertical li.current>a span.toctree-expand,.btn .wy-menu-vertical li.on a span.toctree-expand,.btn .wy-menu-vertical li span.toctree-expand,.nav .fa,.nav .icon,.nav .rst-content .admonition-title,.nav .rst-content .code-block-caption .headerlink,.nav .rst-content code.download span:first-child,.nav .rst-content dl dt .headerlink,.nav .rst-content h1 .headerlink,.nav .rst-content h2 .headerlink,.nav .rst-content h3 .headerlink,.nav .rst-content h4 .headerlink,.nav .rst-content h5 .headerlink,.nav .rst-content h6 .headerlink,.nav .rst-content p.caption .headerlink,.nav .rst-content table>caption .headerlink,.nav .rst-content tt.download span:first-child,.nav .wy-menu-vertical li.current>a span.toctree-expand,.nav .wy-menu-vertical li.on a span.toctree-expand,.nav .wy-menu-vertical li span.toctree-expand,.rst-content .btn .admonition-title,.rst-content .code-block-caption .btn .headerlink,.rst-content .code-block-caption .nav .headerlink,.rst-content .nav .admonition-title,.rst-content code.download .btn span:first-child,.rst-content code.download .nav span:first-child,.rst-content dl dt .btn .headerlink,.rst-content dl dt .nav .headerlink,.rst-content h1 .btn .headerlink,.rst-content h1 .nav .headerlink,.rst-content h2 .btn .headerlink,.rst-content h2 .nav .headerlink,.rst-content h3 .btn .headerlink,.rst-content h3 .nav .headerlink,.rst-content h4 .btn .headerlink,.rst-content h4 .nav .headerlink,.rst-content h5 .btn .headerlink,.rst-content h5 .nav .headerlink,.rst-content h6 .btn .headerlink,.rst-content h6 .nav .headerlink,.rst-content p.caption .btn .headerlink,.rst-content p.caption .nav .headerlink,.rst-content table>caption .btn .headerlink,.rst-content table>caption .nav .headerlink,.rst-content tt.download .btn span:first-child,.rst-content tt.download .nav span:first-child,.wy-menu-vertical li .btn span.toctree-expand,.wy-menu-vertical li.current>a .btn span.toctree-expand,.wy-menu-vertical li.current>a .nav span.toctree-expand,.wy-menu-vertical li .nav span.toctree-expand,.wy-menu-vertical li.on a .btn span.toctree-expand,.wy-menu-vertical li.on a .nav span.toctree-expand{display:inline}.btn .fa-large.icon,.btn .fa.fa-large,.btn .rst-content .code-block-caption .fa-large.headerlink,.btn .rst-content .fa-large.admonition-title,.btn .rst-content code.download span.fa-large:first-child,.btn .rst-content dl dt .fa-large.headerlink,.btn .rst-content h1 .fa-large.headerlink,.btn .rst-content h2 .fa-large.headerlink,.btn .rst-content h3 .fa-large.headerlink,.btn .rst-content h4 .fa-large.headerlink,.btn .rst-content h5 .fa-large.headerlink,.btn .rst-content h6 .fa-large.headerlink,.btn .rst-content p.caption .fa-large.headerlink,.btn .rst-content table>caption .fa-large.headerlink,.btn .rst-content tt.download span.fa-large:first-child,.btn .wy-menu-vertical li span.fa-large.toctree-expand,.nav .fa-large.icon,.nav .fa.fa-large,.nav .rst-content .code-block-caption .fa-large.headerlink,.nav .rst-content .fa-large.admonition-title,.nav .rst-content code.download span.fa-large:first-child,.nav .rst-content dl dt .fa-large.headerlink,.nav .rst-content h1 .fa-large.headerlink,.nav .rst-content h2 .fa-large.headerlink,.nav .rst-content h3 .fa-large.headerlink,.nav .rst-content h4 .fa-large.headerlink,.nav .rst-content h5 .fa-large.headerlink,.nav .rst-content h6 .fa-large.headerlink,.nav .rst-content p.caption .fa-large.headerlink,.nav .rst-content table>caption .fa-large.headerlink,.nav .rst-content tt.download span.fa-large:first-child,.nav .wy-menu-vertical li span.fa-large.toctree-expand,.rst-content .btn .fa-large.admonition-title,.rst-content .code-block-caption .btn .fa-large.headerlink,.rst-content .code-block-caption .nav .fa-large.headerlink,.rst-content .nav .fa-large.admonition-title,.rst-content code.download .btn span.fa-large:first-child,.rst-content code.download .nav span.fa-large:first-child,.rst-content dl dt .btn .fa-large.headerlink,.rst-content dl dt .nav .fa-large.headerlink,.rst-content h1 .btn .fa-large.headerlink,.rst-content h1 .nav .fa-large.headerlink,.rst-content h2 .btn .fa-large.headerlink,.rst-content h2 .nav .fa-large.headerlink,.rst-content h3 .btn .fa-large.headerlink,.rst-content h3 .nav .fa-large.headerlink,.rst-content h4 .btn .fa-large.headerlink,.rst-content h4 .nav .fa-large.headerlink,.rst-content h5 .btn .fa-large.headerlink,.rst-content h5 .nav .fa-large.headerlink,.rst-content h6 .btn .fa-large.headerlink,.rst-content h6 .nav .fa-large.headerlink,.rst-content p.caption .btn .fa-large.headerlink,.rst-content p.caption .nav .fa-large.headerlink,.rst-content table>caption .btn .fa-large.headerlink,.rst-content table>caption .nav .fa-large.headerlink,.rst-content tt.download .btn span.fa-large:first-child,.rst-content tt.download .nav span.fa-large:first-child,.wy-menu-vertical li .btn span.fa-large.toctree-expand,.wy-menu-vertical li .nav span.fa-large.toctree-expand{line-height:.9em}.btn .fa-spin.icon,.btn .fa.fa-spin,.btn .rst-content .code-block-caption .fa-spin.headerlink,.btn .rst-content .fa-spin.admonition-title,.btn .rst-content code.download span.fa-spin:first-child,.btn .rst-content dl dt .fa-spin.headerlink,.btn .rst-content h1 .fa-spin.headerlink,.btn .rst-content h2 .fa-spin.headerlink,.btn .rst-content h3 .fa-spin.headerlink,.btn .rst-content h4 .fa-spin.headerlink,.btn .rst-content h5 .fa-spin.headerlink,.btn .rst-content h6 .fa-spin.headerlink,.btn .rst-content p.caption .fa-spin.headerlink,.btn .rst-content table>caption .fa-spin.headerlink,.btn .rst-content tt.download span.fa-spin:first-child,.btn .wy-menu-vertical li span.fa-spin.toctree-expand,.nav .fa-spin.icon,.nav .fa.fa-spin,.nav .rst-content .code-block-caption .fa-spin.headerlink,.nav .rst-content .fa-spin.admonition-title,.nav .rst-content code.download span.fa-spin:first-child,.nav .rst-content dl dt .fa-spin.headerlink,.nav .rst-content h1 .fa-spin.headerlink,.nav .rst-content h2 .fa-spin.headerlink,.nav .rst-content h3 .fa-spin.headerlink,.nav .rst-content h4 .fa-spin.headerlink,.nav .rst-content h5 .fa-spin.headerlink,.nav .rst-content h6 .fa-spin.headerlink,.nav .rst-content p.caption .fa-spin.headerlink,.nav .rst-content table>caption .fa-spin.headerlink,.nav .rst-content tt.download span.fa-spin:first-child,.nav .wy-menu-vertical li span.fa-spin.toctree-expand,.rst-content .btn .fa-spin.admonition-title,.rst-content .code-block-caption .btn .fa-spin.headerlink,.rst-content .code-block-caption .nav .fa-spin.headerlink,.rst-content .nav .fa-spin.admonition-title,.rst-content code.download .btn span.fa-spin:first-child,.rst-content code.download .nav span.fa-spin:first-child,.rst-content dl dt .btn .fa-spin.headerlink,.rst-content dl dt .nav .fa-spin.headerlink,.rst-content h1 .btn .fa-spin.headerlink,.rst-content h1 .nav .fa-spin.headerlink,.rst-content h2 .btn .fa-spin.headerlink,.rst-content h2 .nav .fa-spin.headerlink,.rst-content h3 .btn .fa-spin.headerlink,.rst-content h3 .nav .fa-spin.headerlink,.rst-content h4 .btn .fa-spin.headerlink,.rst-content h4 .nav .fa-spin.headerlink,.rst-content h5 .btn .fa-spin.headerlink,.rst-content h5 .nav .fa-spin.headerlink,.rst-content h6 .btn .fa-spin.headerlink,.rst-content h6 .nav .fa-spin.headerlink,.rst-content p.caption .btn .fa-spin.headerlink,.rst-content p.caption .nav .fa-spin.headerlink,.rst-content table>caption .btn .fa-spin.headerlink,.rst-content table>caption .nav .fa-spin.headerlink,.rst-content tt.download .btn span.fa-spin:first-child,.rst-content tt.download .nav span.fa-spin:first-child,.wy-menu-vertical li .btn span.fa-spin.toctree-expand,.wy-menu-vertical li .nav span.fa-spin.toctree-expand{display:inline-block}.btn.fa:before,.btn.icon:before,.rst-content .btn.admonition-title:before,.rst-content .code-block-caption .btn.headerlink:before,.rst-content code.download span.btn:first-child:before,.rst-content dl dt .btn.headerlink:before,.rst-content h1 .btn.headerlink:before,.rst-content h2 .btn.headerlink:before,.rst-content h3 .btn.headerlink:before,.rst-content h4 .btn.headerlink:before,.rst-content h5 .btn.headerlink:before,.rst-content h6 .btn.headerlink:before,.rst-content p.caption .btn.headerlink:before,.rst-content table>caption .btn.headerlink:before,.rst-content tt.download span.btn:first-child:before,.wy-menu-vertical li span.btn.toctree-expand:before{opacity:.5;-webkit-transition:opacity .05s ease-in;-moz-transition:opacity .05s ease-in;transition:opacity .05s ease-in}.btn.fa:hover:before,.btn.icon:hover:before,.rst-content .btn.admonition-title:hover:before,.rst-content .code-block-caption .btn.headerlink:hover:before,.rst-content code.download span.btn:first-child:hover:before,.rst-content dl dt .btn.headerlink:hover:before,.rst-content h1 .btn.headerlink:hover:before,.rst-content h2 .btn.headerlink:hover:before,.rst-content h3 .btn.headerlink:hover:before,.rst-content h4 .btn.headerlink:hover:before,.rst-content h5 .btn.headerlink:hover:before,.rst-content h6 .btn.headerlink:hover:before,.rst-content p.caption .btn.headerlink:hover:before,.rst-content table>caption .btn.headerlink:hover:before,.rst-content tt.download span.btn:first-child:hover:before,.wy-menu-vertical li span.btn.toctree-expand:hover:before{opacity:1}.btn-mini .fa:before,.btn-mini .icon:before,.btn-mini .rst-content .admonition-title:before,.btn-mini .rst-content .code-block-caption .headerlink:before,.btn-mini .rst-content code.download span:first-child:before,.btn-mini .rst-content dl dt .headerlink:before,.btn-mini .rst-content h1 .headerlink:before,.btn-mini .rst-content h2 .headerlink:before,.btn-mini .rst-content h3 .headerlink:before,.btn-mini .rst-content h4 .headerlink:before,.btn-mini .rst-content h5 .headerlink:before,.btn-mini .rst-content h6 .headerlink:before,.btn-mini .rst-content p.caption .headerlink:before,.btn-mini .rst-content table>caption .headerlink:before,.btn-mini .rst-content tt.download span:first-child:before,.btn-mini .wy-menu-vertical li span.toctree-expand:before,.rst-content .btn-mini .admonition-title:before,.rst-content .code-block-caption .btn-mini .headerlink:before,.rst-content code.download .btn-mini span:first-child:before,.rst-content dl dt .btn-mini .headerlink:before,.rst-content h1 .btn-mini .headerlink:before,.rst-content h2 .btn-mini .headerlink:before,.rst-content h3 .btn-mini .headerlink:before,.rst-content h4 .btn-mini .headerlink:before,.rst-content h5 .btn-mini .headerlink:before,.rst-content h6 .btn-mini .headerlink:before,.rst-content p.caption .btn-mini .headerlink:before,.rst-content table>caption .btn-mini .headerlink:before,.rst-content tt.download .btn-mini span:first-child:before,.wy-menu-vertical li .btn-mini span.toctree-expand:before{font-size:14px;vertical-align:-15%}.rst-content .admonition,.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .danger,.rst-content .error,.rst-content .hint,.rst-content .important,.rst-content .note,.rst-content .seealso,.rst-content .tip,.rst-content .warning,.wy-alert{padding:12px;line-height:24px;margin-bottom:24px;background:#e7f2fa}.rst-content .admonition-title,.wy-alert-title{font-weight:700;display:block;color:#fff;background:#6ab0de;padding:6px 12px;margin:-12px -12px 12px}.rst-content .danger,.rst-content .error,.rst-content .wy-alert-danger.admonition,.rst-content .wy-alert-danger.admonition-todo,.rst-content .wy-alert-danger.attention,.rst-content .wy-alert-danger.caution,.rst-content .wy-alert-danger.hint,.rst-content .wy-alert-danger.important,.rst-content .wy-alert-danger.note,.rst-content .wy-alert-danger.seealso,.rst-content .wy-alert-danger.tip,.rst-content .wy-alert-danger.warning,.wy-alert.wy-alert-danger{background:#fdf3f2}.rst-content .danger .admonition-title,.rst-content .danger .wy-alert-title,.rst-content .error .admonition-title,.rst-content .error .wy-alert-title,.rst-content .wy-alert-danger.admonition-todo .admonition-title,.rst-content .wy-alert-danger.admonition-todo .wy-alert-title,.rst-content .wy-alert-danger.admonition .admonition-title,.rst-content .wy-alert-danger.admonition .wy-alert-title,.rst-content .wy-alert-danger.attention .admonition-title,.rst-content .wy-alert-danger.attention .wy-alert-title,.rst-content .wy-alert-danger.caution .admonition-title,.rst-content .wy-alert-danger.caution .wy-alert-title,.rst-content .wy-alert-danger.hint .admonition-title,.rst-content .wy-alert-danger.hint .wy-alert-title,.rst-content .wy-alert-danger.important .admonition-title,.rst-content .wy-alert-danger.important .wy-alert-title,.rst-content .wy-alert-danger.note .admonition-title,.rst-content .wy-alert-danger.note .wy-alert-title,.rst-content .wy-alert-danger.seealso .admonition-title,.rst-content .wy-alert-danger.seealso .wy-alert-title,.rst-content .wy-alert-danger.tip .admonition-title,.rst-content .wy-alert-danger.tip .wy-alert-title,.rst-content .wy-alert-danger.warning .admonition-title,.rst-content .wy-alert-danger.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-danger .admonition-title,.wy-alert.wy-alert-danger .rst-content .admonition-title,.wy-alert.wy-alert-danger .wy-alert-title{background:#f29f97}.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .warning,.rst-content .wy-alert-warning.admonition,.rst-content .wy-alert-warning.danger,.rst-content .wy-alert-warning.error,.rst-content .wy-alert-warning.hint,.rst-content .wy-alert-warning.important,.rst-content .wy-alert-warning.note,.rst-content .wy-alert-warning.seealso,.rst-content .wy-alert-warning.tip,.wy-alert.wy-alert-warning{background:#ffedcc}.rst-content .admonition-todo .admonition-title,.rst-content .admonition-todo .wy-alert-title,.rst-content .attention .admonition-title,.rst-content .attention .wy-alert-title,.rst-content .caution .admonition-title,.rst-content .caution .wy-alert-title,.rst-content .warning .admonition-title,.rst-content .warning .wy-alert-title,.rst-content .wy-alert-warning.admonition .admonition-title,.rst-content .wy-alert-warning.admonition .wy-alert-title,.rst-content .wy-alert-warning.danger .admonition-title,.rst-content .wy-alert-warning.danger .wy-alert-title,.rst-content .wy-alert-warning.error .admonition-title,.rst-content .wy-alert-warning.error .wy-alert-title,.rst-content .wy-alert-warning.hint .admonition-title,.rst-content .wy-alert-warning.hint .wy-alert-title,.rst-content .wy-alert-warning.important .admonition-title,.rst-content .wy-alert-warning.important .wy-alert-title,.rst-content .wy-alert-warning.note .admonition-title,.rst-content .wy-alert-warning.note .wy-alert-title,.rst-content .wy-alert-warning.seealso .admonition-title,.rst-content .wy-alert-warning.seealso .wy-alert-title,.rst-content .wy-alert-warning.tip .admonition-title,.rst-content .wy-alert-warning.tip .wy-alert-title,.rst-content .wy-alert.wy-alert-warning .admonition-title,.wy-alert.wy-alert-warning .rst-content .admonition-title,.wy-alert.wy-alert-warning .wy-alert-title{background:#f0b37e}.rst-content .note,.rst-content .seealso,.rst-content .wy-alert-info.admonition,.rst-content .wy-alert-info.admonition-todo,.rst-content .wy-alert-info.attention,.rst-content .wy-alert-info.caution,.rst-content .wy-alert-info.danger,.rst-content .wy-alert-info.error,.rst-content .wy-alert-info.hint,.rst-content .wy-alert-info.important,.rst-content .wy-alert-info.tip,.rst-content .wy-alert-info.warning,.wy-alert.wy-alert-info{background:#e7f2fa}.rst-content .note .admonition-title,.rst-content .note .wy-alert-title,.rst-content .seealso .admonition-title,.rst-content .seealso .wy-alert-title,.rst-content .wy-alert-info.admonition-todo .admonition-title,.rst-content .wy-alert-info.admonition-todo .wy-alert-title,.rst-content .wy-alert-info.admonition .admonition-title,.rst-content .wy-alert-info.admonition .wy-alert-title,.rst-content .wy-alert-info.attention .admonition-title,.rst-content .wy-alert-info.attention .wy-alert-title,.rst-content .wy-alert-info.caution .admonition-title,.rst-content .wy-alert-info.caution .wy-alert-title,.rst-content .wy-alert-info.danger .admonition-title,.rst-content .wy-alert-info.danger .wy-alert-title,.rst-content .wy-alert-info.error .admonition-title,.rst-content .wy-alert-info.error .wy-alert-title,.rst-content .wy-alert-info.hint .admonition-title,.rst-content .wy-alert-info.hint .wy-alert-title,.rst-content .wy-alert-info.important .admonition-title,.rst-content .wy-alert-info.important .wy-alert-title,.rst-content .wy-alert-info.tip .admonition-title,.rst-content .wy-alert-info.tip .wy-alert-title,.rst-content .wy-alert-info.warning .admonition-title,.rst-content .wy-alert-info.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-info .admonition-title,.wy-alert.wy-alert-info .rst-content .admonition-title,.wy-alert.wy-alert-info .wy-alert-title{background:#6ab0de}.rst-content .hint,.rst-content .important,.rst-content .tip,.rst-content .wy-alert-success.admonition,.rst-content .wy-alert-success.admonition-todo,.rst-content .wy-alert-success.attention,.rst-content .wy-alert-success.caution,.rst-content .wy-alert-success.danger,.rst-content .wy-alert-success.error,.rst-content .wy-alert-success.note,.rst-content .wy-alert-success.seealso,.rst-content .wy-alert-success.warning,.wy-alert.wy-alert-success{background:#dbfaf4}.rst-content .hint .admonition-title,.rst-content .hint .wy-alert-title,.rst-content .important .admonition-title,.rst-content .important .wy-alert-title,.rst-content .tip .admonition-title,.rst-content .tip .wy-alert-title,.rst-content .wy-alert-success.admonition-todo .admonition-title,.rst-content .wy-alert-success.admonition-todo .wy-alert-title,.rst-content .wy-alert-success.admonition .admonition-title,.rst-content .wy-alert-success.admonition .wy-alert-title,.rst-content .wy-alert-success.attention .admonition-title,.rst-content .wy-alert-success.attention .wy-alert-title,.rst-content .wy-alert-success.caution .admonition-title,.rst-content .wy-alert-success.caution .wy-alert-title,.rst-content .wy-alert-success.danger .admonition-title,.rst-content .wy-alert-success.danger .wy-alert-title,.rst-content .wy-alert-success.error .admonition-title,.rst-content .wy-alert-success.error .wy-alert-title,.rst-content .wy-alert-success.note .admonition-title,.rst-content .wy-alert-success.note .wy-alert-title,.rst-content .wy-alert-success.seealso .admonition-title,.rst-content .wy-alert-success.seealso .wy-alert-title,.rst-content .wy-alert-success.warning .admonition-title,.rst-content .wy-alert-success.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-success .admonition-title,.wy-alert.wy-alert-success .rst-content .admonition-title,.wy-alert.wy-alert-success .wy-alert-title{background:#1abc9c}.rst-content .wy-alert-neutral.admonition,.rst-content .wy-alert-neutral.admonition-todo,.rst-content .wy-alert-neutral.attention,.rst-content .wy-alert-neutral.caution,.rst-content .wy-alert-neutral.danger,.rst-content .wy-alert-neutral.error,.rst-content .wy-alert-neutral.hint,.rst-content .wy-alert-neutral.important,.rst-content .wy-alert-neutral.note,.rst-content .wy-alert-neutral.seealso,.rst-content .wy-alert-neutral.tip,.rst-content .wy-alert-neutral.warning,.wy-alert.wy-alert-neutral{background:#f3f6f6}.rst-content .wy-alert-neutral.admonition-todo .admonition-title,.rst-content .wy-alert-neutral.admonition-todo .wy-alert-title,.rst-content .wy-alert-neutral.admonition .admonition-title,.rst-content .wy-alert-neutral.admonition .wy-alert-title,.rst-content .wy-alert-neutral.attention .admonition-title,.rst-content .wy-alert-neutral.attention .wy-alert-title,.rst-content .wy-alert-neutral.caution .admonition-title,.rst-content .wy-alert-neutral.caution .wy-alert-title,.rst-content .wy-alert-neutral.danger .admonition-title,.rst-content .wy-alert-neutral.danger .wy-alert-title,.rst-content .wy-alert-neutral.error .admonition-title,.rst-content .wy-alert-neutral.error .wy-alert-title,.rst-content .wy-alert-neutral.hint .admonition-title,.rst-content .wy-alert-neutral.hint .wy-alert-title,.rst-content .wy-alert-neutral.important .admonition-title,.rst-content .wy-alert-neutral.important .wy-alert-title,.rst-content .wy-alert-neutral.note .admonition-title,.rst-content .wy-alert-neutral.note .wy-alert-title,.rst-content .wy-alert-neutral.seealso .admonition-title,.rst-content .wy-alert-neutral.seealso .wy-alert-title,.rst-content .wy-alert-neutral.tip .admonition-title,.rst-content .wy-alert-neutral.tip .wy-alert-title,.rst-content .wy-alert-neutral.warning .admonition-title,.rst-content .wy-alert-neutral.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-neutral .admonition-title,.wy-alert.wy-alert-neutral .rst-content .admonition-title,.wy-alert.wy-alert-neutral .wy-alert-title{color:#404040;background:#e1e4e5}.rst-content .wy-alert-neutral.admonition-todo a,.rst-content .wy-alert-neutral.admonition a,.rst-content .wy-alert-neutral.attention a,.rst-content .wy-alert-neutral.caution a,.rst-content .wy-alert-neutral.danger a,.rst-content .wy-alert-neutral.error a,.rst-content .wy-alert-neutral.hint a,.rst-content .wy-alert-neutral.important a,.rst-content .wy-alert-neutral.note a,.rst-content .wy-alert-neutral.seealso a,.rst-content .wy-alert-neutral.tip a,.rst-content .wy-alert-neutral.warning a,.wy-alert.wy-alert-neutral a{color:#2980b9}.rst-content .admonition-todo p:last-child,.rst-content .admonition p:last-child,.rst-content .attention p:last-child,.rst-content .caution p:last-child,.rst-content .danger p:last-child,.rst-content .error p:last-child,.rst-content .hint p:last-child,.rst-content .important p:last-child,.rst-content .note p:last-child,.rst-content .seealso p:last-child,.rst-content .tip p:last-child,.rst-content .warning p:last-child,.wy-alert p:last-child{margin-bottom:0}.wy-tray-container{position:fixed;bottom:0;left:0;z-index:600}.wy-tray-container li{display:block;width:300px;background:transparent;color:#fff;text-align:center;box-shadow:0 5px 5px 0 rgba(0,0,0,.1);padding:0 24px;min-width:20%;opacity:0;height:0;line-height:56px;overflow:hidden;-webkit-transition:all .3s ease-in;-moz-transition:all .3s ease-in;transition:all .3s ease-in}.wy-tray-container li.wy-tray-item-success{background:#27ae60}.wy-tray-container li.wy-tray-item-info{background:#2980b9}.wy-tray-container li.wy-tray-item-warning{background:#e67e22}.wy-tray-container li.wy-tray-item-danger{background:#e74c3c}.wy-tray-container li.on{opacity:1;height:56px}@media screen and (max-width:768px){.wy-tray-container{bottom:auto;top:0;width:100%}.wy-tray-container li{width:100%}}button{font-size:100%;margin:0;vertical-align:baseline;*vertical-align:middle;cursor:pointer;line-height:normal;-webkit-appearance:button;*overflow:visible}button::-moz-focus-inner,input::-moz-focus-inner{border:0;padding:0}button[disabled]{cursor:default}.btn{display:inline-block;border-radius:2px;line-height:normal;white-space:nowrap;text-align:center;cursor:pointer;font-size:100%;padding:6px 12px 8px;color:#fff;border:1px solid rgba(0,0,0,.1);background-color:#27ae60;text-decoration:none;font-weight:400;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;box-shadow:inset 0 1px 2px -1px hsla(0,0%,100%,.5),inset 0 -2px 0 0 rgba(0,0,0,.1);outline-none:false;vertical-align:middle;*display:inline;zoom:1;-webkit-user-drag:none;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none;-webkit-transition:all .1s linear;-moz-transition:all .1s linear;transition:all .1s linear}.btn-hover{background:#2e8ece;color:#fff}.btn:hover{background:#2cc36b;color:#fff}.btn:focus{background:#2cc36b;outline:0}.btn:active{box-shadow:inset 0 -1px 0 0 rgba(0,0,0,.05),inset 0 2px 0 0 rgba(0,0,0,.1);padding:8px 12px 6px}.btn:visited{color:#fff}.btn-disabled,.btn-disabled:active,.btn-disabled:focus,.btn-disabled:hover,.btn:disabled{background-image:none;filter:progid:DXImageTransform.Microsoft.gradient(enabled = false);filter:alpha(opacity=40);opacity:.4;cursor:not-allowed;box-shadow:none}.btn::-moz-focus-inner{padding:0;border:0}.btn-small{font-size:80%}.btn-info{background-color:#2980b9!important}.btn-info:hover{background-color:#2e8ece!important}.btn-neutral{background-color:#f3f6f6!important;color:#404040!important}.btn-neutral:hover{background-color:#e5ebeb!important;color:#404040}.btn-neutral:visited{color:#404040!important}.btn-success{background-color:#27ae60!important}.btn-success:hover{background-color:#295!important}.btn-danger{background-color:#e74c3c!important}.btn-danger:hover{background-color:#ea6153!important}.btn-warning{background-color:#e67e22!important}.btn-warning:hover{background-color:#e98b39!important}.btn-invert{background-color:#222}.btn-invert:hover{background-color:#2f2f2f!important}.btn-link{background-color:transparent!important;color:#2980b9;box-shadow:none;border-color:transparent!important}.btn-link:active,.btn-link:hover{background-color:transparent!important;color:#409ad5!important;box-shadow:none}.btn-link:visited{color:#9b59b6}.wy-btn-group .btn,.wy-control .btn{vertical-align:middle}.wy-btn-group{margin-bottom:24px;*zoom:1}.wy-btn-group:after,.wy-btn-group:before{display:table;content:""}.wy-btn-group:after{clear:both}.wy-dropdown{position:relative;display:inline-block}.wy-dropdown-active .wy-dropdown-menu{display:block}.wy-dropdown-menu{position:absolute;left:0;display:none;float:left;top:100%;min-width:100%;background:#fcfcfc;z-index:100;border:1px solid #cfd7dd;box-shadow:0 2px 2px 0 rgba(0,0,0,.1);padding:12px}.wy-dropdown-menu>dd>a{display:block;clear:both;color:#404040;white-space:nowrap;font-size:90%;padding:0 12px;cursor:pointer}.wy-dropdown-menu>dd>a:hover{background:#2980b9;color:#fff}.wy-dropdown-menu>dd.divider{border-top:1px solid #cfd7dd;margin:6px 0}.wy-dropdown-menu>dd.search{padding-bottom:12px}.wy-dropdown-menu>dd.search input[type=search]{width:100%}.wy-dropdown-menu>dd.call-to-action{background:#e3e3e3;text-transform:uppercase;font-weight:500;font-size:80%}.wy-dropdown-menu>dd.call-to-action:hover{background:#e3e3e3}.wy-dropdown-menu>dd.call-to-action .btn{color:#fff}.wy-dropdown.wy-dropdown-up .wy-dropdown-menu{bottom:100%;top:auto;left:auto;right:0}.wy-dropdown.wy-dropdown-bubble .wy-dropdown-menu{background:#fcfcfc;margin-top:2px}.wy-dropdown.wy-dropdown-bubble .wy-dropdown-menu a{padding:6px 12px}.wy-dropdown.wy-dropdown-bubble .wy-dropdown-menu a:hover{background:#2980b9;color:#fff}.wy-dropdown.wy-dropdown-left .wy-dropdown-menu{right:0;left:auto;text-align:right}.wy-dropdown-arrow:before{content:" ";border-bottom:5px solid #f5f5f5;border-left:5px solid transparent;border-right:5px solid transparent;position:absolute;display:block;top:-4px;left:50%;margin-left:-3px}.wy-dropdown-arrow.wy-dropdown-arrow-left:before{left:11px}.wy-form-stacked select{display:block}.wy-form-aligned .wy-help-inline,.wy-form-aligned input,.wy-form-aligned label,.wy-form-aligned select,.wy-form-aligned textarea{display:inline-block;*display:inline;*zoom:1;vertical-align:middle}.wy-form-aligned .wy-control-group>label{display:inline-block;vertical-align:middle;width:10em;margin:6px 12px 0 0;float:left}.wy-form-aligned .wy-control{float:left}.wy-form-aligned .wy-control label{display:block}.wy-form-aligned .wy-control select{margin-top:6px}fieldset{margin:0}fieldset,legend{border:0;padding:0}legend{width:100%;white-space:normal;margin-bottom:24px;font-size:150%;*margin-left:-7px}label,legend{display:block}label{margin:0 0 .3125em;color:#333;font-size:90%}input,select,textarea{font-size:100%;margin:0;vertical-align:baseline;*vertical-align:middle}.wy-control-group{margin-bottom:24px;max-width:1200px;margin-left:auto;margin-right:auto;*zoom:1}.wy-control-group:after,.wy-control-group:before{display:table;content:""}.wy-control-group:after{clear:both}.wy-control-group.wy-control-group-required>label:after{content:" *";color:#e74c3c}.wy-control-group .wy-form-full,.wy-control-group .wy-form-halves,.wy-control-group .wy-form-thirds{padding-bottom:12px}.wy-control-group .wy-form-full input[type=color],.wy-control-group .wy-form-full input[type=date],.wy-control-group .wy-form-full input[type=datetime-local],.wy-control-group .wy-form-full input[type=datetime],.wy-control-group .wy-form-full input[type=email],.wy-control-group .wy-form-full input[type=month],.wy-control-group .wy-form-full input[type=number],.wy-control-group .wy-form-full input[type=password],.wy-control-group .wy-form-full input[type=search],.wy-control-group .wy-form-full input[type=tel],.wy-control-group .wy-form-full input[type=text],.wy-control-group .wy-form-full input[type=time],.wy-control-group .wy-form-full input[type=url],.wy-control-group .wy-form-full input[type=week],.wy-control-group .wy-form-full select,.wy-control-group .wy-form-halves input[type=color],.wy-control-group .wy-form-halves input[type=date],.wy-control-group .wy-form-halves input[type=datetime-local],.wy-control-group .wy-form-halves input[type=datetime],.wy-control-group .wy-form-halves input[type=email],.wy-control-group .wy-form-halves input[type=month],.wy-control-group .wy-form-halves input[type=number],.wy-control-group .wy-form-halves input[type=password],.wy-control-group .wy-form-halves input[type=search],.wy-control-group .wy-form-halves input[type=tel],.wy-control-group .wy-form-halves input[type=text],.wy-control-group .wy-form-halves input[type=time],.wy-control-group .wy-form-halves input[type=url],.wy-control-group .wy-form-halves input[type=week],.wy-control-group .wy-form-halves select,.wy-control-group .wy-form-thirds input[type=color],.wy-control-group .wy-form-thirds input[type=date],.wy-control-group .wy-form-thirds input[type=datetime-local],.wy-control-group .wy-form-thirds input[type=datetime],.wy-control-group .wy-form-thirds input[type=email],.wy-control-group .wy-form-thirds input[type=month],.wy-control-group .wy-form-thirds input[type=number],.wy-control-group .wy-form-thirds input[type=password],.wy-control-group .wy-form-thirds input[type=search],.wy-control-group .wy-form-thirds input[type=tel],.wy-control-group .wy-form-thirds input[type=text],.wy-control-group .wy-form-thirds input[type=time],.wy-control-group .wy-form-thirds input[type=url],.wy-control-group .wy-form-thirds input[type=week],.wy-control-group .wy-form-thirds select{width:100%}.wy-control-group .wy-form-full{float:left;display:block;width:100%;margin-right:0}.wy-control-group .wy-form-full:last-child{margin-right:0}.wy-control-group .wy-form-halves{float:left;display:block;margin-right:2.35765%;width:48.82117%}.wy-control-group .wy-form-halves:last-child,.wy-control-group .wy-form-halves:nth-of-type(2n){margin-right:0}.wy-control-group .wy-form-halves:nth-of-type(odd){clear:left}.wy-control-group .wy-form-thirds{float:left;display:block;margin-right:2.35765%;width:31.76157%}.wy-control-group .wy-form-thirds:last-child,.wy-control-group .wy-form-thirds:nth-of-type(3n){margin-right:0}.wy-control-group .wy-form-thirds:nth-of-type(3n+1){clear:left}.wy-control-group.wy-control-group-no-input .wy-control,.wy-control-no-input{margin:6px 0 0;font-size:90%}.wy-control-no-input{display:inline-block}.wy-control-group.fluid-input input[type=color],.wy-control-group.fluid-input input[type=date],.wy-control-group.fluid-input input[type=datetime-local],.wy-control-group.fluid-input input[type=datetime],.wy-control-group.fluid-input input[type=email],.wy-control-group.fluid-input input[type=month],.wy-control-group.fluid-input input[type=number],.wy-control-group.fluid-input input[type=password],.wy-control-group.fluid-input input[type=search],.wy-control-group.fluid-input input[type=tel],.wy-control-group.fluid-input input[type=text],.wy-control-group.fluid-input input[type=time],.wy-control-group.fluid-input input[type=url],.wy-control-group.fluid-input input[type=week]{width:100%}.wy-form-message-inline{padding-left:.3em;color:#666;font-size:90%}.wy-form-message{display:block;color:#999;font-size:70%;margin-top:.3125em;font-style:italic}.wy-form-message p{font-size:inherit;font-style:italic;margin-bottom:6px}.wy-form-message p:last-child{margin-bottom:0}input{line-height:normal}input[type=button],input[type=reset],input[type=submit]{-webkit-appearance:button;cursor:pointer;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;*overflow:visible}input[type=color],input[type=date],input[type=datetime-local],input[type=datetime],input[type=email],input[type=month],input[type=number],input[type=password],input[type=search],input[type=tel],input[type=text],input[type=time],input[type=url],input[type=week]{-webkit-appearance:none;padding:6px;display:inline-block;border:1px solid #ccc;font-size:80%;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;box-shadow:inset 0 1px 3px #ddd;border-radius:0;-webkit-transition:border .3s linear;-moz-transition:border .3s linear;transition:border .3s linear}input[type=datetime-local]{padding:.34375em .625em}input[disabled]{cursor:default}input[type=checkbox],input[type=radio]{padding:0;margin-right:.3125em;*height:13px;*width:13px}input[type=checkbox],input[type=radio],input[type=search]{-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box}input[type=search]::-webkit-search-cancel-button,input[type=search]::-webkit-search-decoration{-webkit-appearance:none}input[type=color]:focus,input[type=date]:focus,input[type=datetime-local]:focus,input[type=datetime]:focus,input[type=email]:focus,input[type=month]:focus,input[type=number]:focus,input[type=password]:focus,input[type=search]:focus,input[type=tel]:focus,input[type=text]:focus,input[type=time]:focus,input[type=url]:focus,input[type=week]:focus{outline:0;outline:thin dotted\9;border-color:#333}input.no-focus:focus{border-color:#ccc!important}input[type=checkbox]:focus,input[type=file]:focus,input[type=radio]:focus{outline:thin dotted #333;outline:1px auto #129fea}input[type=color][disabled],input[type=date][disabled],input[type=datetime-local][disabled],input[type=datetime][disabled],input[type=email][disabled],input[type=month][disabled],input[type=number][disabled],input[type=password][disabled],input[type=search][disabled],input[type=tel][disabled],input[type=text][disabled],input[type=time][disabled],input[type=url][disabled],input[type=week][disabled]{cursor:not-allowed;background-color:#fafafa}input:focus:invalid,select:focus:invalid,textarea:focus:invalid{color:#e74c3c;border:1px solid #e74c3c}input:focus:invalid:focus,select:focus:invalid:focus,textarea:focus:invalid:focus{border-color:#e74c3c}input[type=checkbox]:focus:invalid:focus,input[type=file]:focus:invalid:focus,input[type=radio]:focus:invalid:focus{outline-color:#e74c3c}input.wy-input-large{padding:12px;font-size:100%}textarea{overflow:auto;vertical-align:top;width:100%;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif}select,textarea{padding:.5em .625em;display:inline-block;border:1px solid #ccc;font-size:80%;box-shadow:inset 0 1px 3px #ddd;-webkit-transition:border .3s linear;-moz-transition:border .3s linear;transition:border .3s linear}select{border:1px solid #ccc;background-color:#fff}select[multiple]{height:auto}select:focus,textarea:focus{outline:0}input[readonly],select[disabled],select[readonly],textarea[disabled],textarea[readonly]{cursor:not-allowed;background-color:#fafafa}input[type=checkbox][disabled],input[type=radio][disabled]{cursor:not-allowed}.wy-checkbox,.wy-radio{margin:6px 0;color:#404040;display:block}.wy-checkbox input,.wy-radio input{vertical-align:baseline}.wy-form-message-inline{display:inline-block;*display:inline;*zoom:1;vertical-align:middle}.wy-input-prefix,.wy-input-suffix{white-space:nowrap;padding:6px}.wy-input-prefix .wy-input-context,.wy-input-suffix .wy-input-context{line-height:27px;padding:0 8px;display:inline-block;font-size:80%;background-color:#f3f6f6;border:1px solid #ccc;color:#999}.wy-input-suffix .wy-input-context{border-left:0}.wy-input-prefix .wy-input-context{border-right:0}.wy-switch{position:relative;display:block;height:24px;margin-top:12px;cursor:pointer}.wy-switch:before{left:0;top:0;width:36px;height:12px;background:#ccc}.wy-switch:after,.wy-switch:before{position:absolute;content:"";display:block;border-radius:4px;-webkit-transition:all .2s ease-in-out;-moz-transition:all .2s ease-in-out;transition:all .2s ease-in-out}.wy-switch:after{width:18px;height:18px;background:#999;left:-3px;top:-3px}.wy-switch span{position:absolute;left:48px;display:block;font-size:12px;color:#ccc;line-height:1}.wy-switch.active:before{background:#1e8449}.wy-switch.active:after{left:24px;background:#27ae60}.wy-switch.disabled{cursor:not-allowed;opacity:.8}.wy-control-group.wy-control-group-error .wy-form-message,.wy-control-group.wy-control-group-error>label{color:#e74c3c}.wy-control-group.wy-control-group-error input[type=color],.wy-control-group.wy-control-group-error input[type=date],.wy-control-group.wy-control-group-error input[type=datetime-local],.wy-control-group.wy-control-group-error input[type=datetime],.wy-control-group.wy-control-group-error input[type=email],.wy-control-group.wy-control-group-error input[type=month],.wy-control-group.wy-control-group-error input[type=number],.wy-control-group.wy-control-group-error input[type=password],.wy-control-group.wy-control-group-error input[type=search],.wy-control-group.wy-control-group-error input[type=tel],.wy-control-group.wy-control-group-error input[type=text],.wy-control-group.wy-control-group-error input[type=time],.wy-control-group.wy-control-group-error input[type=url],.wy-control-group.wy-control-group-error input[type=week],.wy-control-group.wy-control-group-error textarea{border:1px solid #e74c3c}.wy-inline-validate{white-space:nowrap}.wy-inline-validate .wy-input-context{padding:.5em .625em;display:inline-block;font-size:80%}.wy-inline-validate.wy-inline-validate-success .wy-input-context{color:#27ae60}.wy-inline-validate.wy-inline-validate-danger .wy-input-context{color:#e74c3c}.wy-inline-validate.wy-inline-validate-warning .wy-input-context{color:#e67e22}.wy-inline-validate.wy-inline-validate-info .wy-input-context{color:#2980b9}.rotate-90{-webkit-transform:rotate(90deg);-moz-transform:rotate(90deg);-ms-transform:rotate(90deg);-o-transform:rotate(90deg);transform:rotate(90deg)}.rotate-180{-webkit-transform:rotate(180deg);-moz-transform:rotate(180deg);-ms-transform:rotate(180deg);-o-transform:rotate(180deg);transform:rotate(180deg)}.rotate-270{-webkit-transform:rotate(270deg);-moz-transform:rotate(270deg);-ms-transform:rotate(270deg);-o-transform:rotate(270deg);transform:rotate(270deg)}.mirror{-webkit-transform:scaleX(-1);-moz-transform:scaleX(-1);-ms-transform:scaleX(-1);-o-transform:scaleX(-1);transform:scaleX(-1)}.mirror.rotate-90{-webkit-transform:scaleX(-1) rotate(90deg);-moz-transform:scaleX(-1) rotate(90deg);-ms-transform:scaleX(-1) rotate(90deg);-o-transform:scaleX(-1) rotate(90deg);transform:scaleX(-1) rotate(90deg)}.mirror.rotate-180{-webkit-transform:scaleX(-1) rotate(180deg);-moz-transform:scaleX(-1) rotate(180deg);-ms-transform:scaleX(-1) rotate(180deg);-o-transform:scaleX(-1) rotate(180deg);transform:scaleX(-1) rotate(180deg)}.mirror.rotate-270{-webkit-transform:scaleX(-1) rotate(270deg);-moz-transform:scaleX(-1) rotate(270deg);-ms-transform:scaleX(-1) rotate(270deg);-o-transform:scaleX(-1) rotate(270deg);transform:scaleX(-1) rotate(270deg)}@media only screen and (max-width:480px){.wy-form button[type=submit]{margin:.7em 0 0}.wy-form input[type=color],.wy-form input[type=date],.wy-form input[type=datetime-local],.wy-form input[type=datetime],.wy-form input[type=email],.wy-form input[type=month],.wy-form input[type=number],.wy-form input[type=password],.wy-form input[type=search],.wy-form input[type=tel],.wy-form input[type=text],.wy-form input[type=time],.wy-form input[type=url],.wy-form input[type=week],.wy-form label{margin-bottom:.3em;display:block}.wy-form input[type=color],.wy-form input[type=date],.wy-form input[type=datetime-local],.wy-form input[type=datetime],.wy-form input[type=email],.wy-form input[type=month],.wy-form input[type=number],.wy-form input[type=password],.wy-form input[type=search],.wy-form input[type=tel],.wy-form input[type=time],.wy-form input[type=url],.wy-form input[type=week]{margin-bottom:0}.wy-form-aligned .wy-control-group label{margin-bottom:.3em;text-align:left;display:block;width:100%}.wy-form-aligned .wy-control{margin:1.5em 0 0}.wy-form-message,.wy-form-message-inline,.wy-form .wy-help-inline{display:block;font-size:80%;padding:6px 0}}@media screen and (max-width:768px){.tablet-hide{display:none}}@media screen and (max-width:480px){.mobile-hide{display:none}}.float-left{float:left}.float-right{float:right}.full-width{width:100%}.rst-content table.docutils,.rst-content table.field-list,.wy-table{border-collapse:collapse;border-spacing:0;empty-cells:show;margin-bottom:24px}.rst-content table.docutils caption,.rst-content table.field-list caption,.wy-table caption{color:#000;font:italic 85%/1 arial,sans-serif;padding:1em 0;text-align:center}.rst-content table.docutils td,.rst-content table.docutils th,.rst-content table.field-list td,.rst-content table.field-list th,.wy-table td,.wy-table th{font-size:90%;margin:0;overflow:visible;padding:8px 16px}.rst-content table.docutils td:first-child,.rst-content table.docutils th:first-child,.rst-content table.field-list td:first-child,.rst-content table.field-list th:first-child,.wy-table td:first-child,.wy-table th:first-child{border-left-width:0}.rst-content table.docutils thead,.rst-content table.field-list thead,.wy-table thead{color:#000;text-align:left;vertical-align:bottom;white-space:nowrap}.rst-content table.docutils thead th,.rst-content table.field-list thead th,.wy-table thead th{font-weight:700;border-bottom:2px solid #e1e4e5}.rst-content table.docutils td,.rst-content table.field-list td,.wy-table td{background-color:transparent;vertical-align:middle}.rst-content table.docutils td p,.rst-content table.field-list td p,.wy-table td p{line-height:18px}.rst-content table.docutils td p:last-child,.rst-content table.field-list td p:last-child,.wy-table td p:last-child{margin-bottom:0}.rst-content table.docutils .wy-table-cell-min,.rst-content table.field-list .wy-table-cell-min,.wy-table .wy-table-cell-min{width:1%;padding-right:0}.rst-content table.docutils .wy-table-cell-min input[type=checkbox],.rst-content table.field-list .wy-table-cell-min input[type=checkbox],.wy-table .wy-table-cell-min input[type=checkbox]{margin:0}.wy-table-secondary{color:grey;font-size:90%}.wy-table-tertiary{color:grey;font-size:80%}.rst-content table.docutils:not(.field-list) tr:nth-child(2n-1) td,.wy-table-backed,.wy-table-odd td,.wy-table-striped tr:nth-child(2n-1) td{background-color:#f3f6f6}.rst-content table.docutils,.wy-table-bordered-all{border:1px solid #e1e4e5}.rst-content table.docutils td,.wy-table-bordered-all td{border-bottom:1px solid #e1e4e5;border-left:1px solid #e1e4e5}.rst-content table.docutils tbody>tr:last-child td,.wy-table-bordered-all tbody>tr:last-child td{border-bottom-width:0}.wy-table-bordered{border:1px solid #e1e4e5}.wy-table-bordered-rows td{border-bottom:1px solid #e1e4e5}.wy-table-bordered-rows tbody>tr:last-child td{border-bottom-width:0}.wy-table-horizontal td,.wy-table-horizontal th{border-width:0 0 1px;border-bottom:1px solid #e1e4e5}.wy-table-horizontal tbody>tr:last-child td{border-bottom-width:0}.wy-table-responsive{margin-bottom:24px;max-width:100%;overflow:auto}.wy-table-responsive table{margin-bottom:0!important}.wy-table-responsive table td,.wy-table-responsive table th{white-space:nowrap}a{color:#2980b9;text-decoration:none;cursor:pointer}a:hover{color:#3091d1}a:visited{color:#9b59b6}html{height:100%}body,html{overflow-x:hidden}body{font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;font-weight:400;color:#404040;min-height:100%;background:#edf0f2}.wy-text-left{text-align:left}.wy-text-center{text-align:center}.wy-text-right{text-align:right}.wy-text-large{font-size:120%}.wy-text-normal{font-size:100%}.wy-text-small,small{font-size:80%}.wy-text-strike{text-decoration:line-through}.wy-text-warning{color:#e67e22!important}a.wy-text-warning:hover{color:#eb9950!important}.wy-text-info{color:#2980b9!important}a.wy-text-info:hover{color:#409ad5!important}.wy-text-success{color:#27ae60!important}a.wy-text-success:hover{color:#36d278!important}.wy-text-danger{color:#e74c3c!important}a.wy-text-danger:hover{color:#ed7669!important}.wy-text-neutral{color:#404040!important}a.wy-text-neutral:hover{color:#595959!important}.rst-content .toctree-wrapper>p.caption,h1,h2,h3,h4,h5,h6,legend{margin-top:0;font-weight:700;font-family:Roboto Slab,ff-tisa-web-pro,Georgia,Arial,sans-serif}p{line-height:24px;font-size:16px;margin:0 0 24px}h1{font-size:175%}.rst-content .toctree-wrapper>p.caption,h2{font-size:150%}h3{font-size:125%}h4{font-size:115%}h5{font-size:110%}h6{font-size:100%}hr{display:block;height:1px;border:0;border-top:1px solid #e1e4e5;margin:24px 0;padding:0}.rst-content code,.rst-content tt,code{white-space:nowrap;max-width:100%;background:#fff;border:1px solid #e1e4e5;font-size:75%;padding:0 5px;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;color:#e74c3c;overflow-x:auto}.rst-content tt.code-large,code.code-large{font-size:90%}.rst-content .section ul,.rst-content .toctree-wrapper ul,.wy-plain-list-disc,article ul{list-style:disc;line-height:24px;margin-bottom:24px}.rst-content .section ul li,.rst-content .toctree-wrapper ul li,.wy-plain-list-disc li,article ul li{list-style:disc;margin-left:24px}.rst-content .section ul li p:last-child,.rst-content .section ul li ul,.rst-content .toctree-wrapper ul li p:last-child,.rst-content .toctree-wrapper ul li ul,.wy-plain-list-disc li p:last-child,.wy-plain-list-disc li ul,article ul li p:last-child,article ul li ul{margin-bottom:0}.rst-content .section ul li li,.rst-content .toctree-wrapper ul li li,.wy-plain-list-disc li li,article ul li li{list-style:circle}.rst-content .section ul li li li,.rst-content .toctree-wrapper ul li li li,.wy-plain-list-disc li li li,article ul li li li{list-style:square}.rst-content .section ul li ol li,.rst-content .toctree-wrapper ul li ol li,.wy-plain-list-disc li ol li,article ul li ol li{list-style:decimal}.rst-content .section ol,.rst-content ol.arabic,.wy-plain-list-decimal,article ol{list-style:decimal;line-height:24px;margin-bottom:24px}.rst-content .section ol li,.rst-content ol.arabic li,.wy-plain-list-decimal li,article ol li{list-style:decimal;margin-left:24px}.rst-content .section ol li p:last-child,.rst-content .section ol li ul,.rst-content ol.arabic li p:last-child,.rst-content ol.arabic li ul,.wy-plain-list-decimal li p:last-child,.wy-plain-list-decimal li ul,article ol li p:last-child,article ol li ul{margin-bottom:0}.rst-content .section ol li ul li,.rst-content ol.arabic li ul li,.wy-plain-list-decimal li ul li,article ol li ul li{list-style:disc}.wy-breadcrumbs{*zoom:1}.wy-breadcrumbs:after,.wy-breadcrumbs:before{display:table;content:""}.wy-breadcrumbs:after{clear:both}.wy-breadcrumbs li{display:inline-block}.wy-breadcrumbs li.wy-breadcrumbs-aside{float:right}.wy-breadcrumbs li a{display:inline-block;padding:5px}.wy-breadcrumbs li a:first-child{padding-left:0}.rst-content .wy-breadcrumbs li tt,.wy-breadcrumbs li .rst-content tt,.wy-breadcrumbs li code{padding:5px;border:none;background:none}.rst-content .wy-breadcrumbs li tt.literal,.wy-breadcrumbs li .rst-content tt.literal,.wy-breadcrumbs li code.literal{color:#404040}.wy-breadcrumbs-extra{margin-bottom:0;color:#b3b3b3;font-size:80%;display:inline-block}@media screen and (max-width:480px){.wy-breadcrumbs-extra,.wy-breadcrumbs li.wy-breadcrumbs-aside{display:none}}@media print{.wy-breadcrumbs li.wy-breadcrumbs-aside{display:none}}html{font-size:16px}.wy-affix{position:fixed;top:1.618em}.wy-menu a:hover{text-decoration:none}.wy-menu-horiz{*zoom:1}.wy-menu-horiz:after,.wy-menu-horiz:before{display:table;content:""}.wy-menu-horiz:after{clear:both}.wy-menu-horiz li,.wy-menu-horiz ul{display:inline-block}.wy-menu-horiz li:hover{background:hsla(0,0%,100%,.1)}.wy-menu-horiz li.divide-left{border-left:1px solid #404040}.wy-menu-horiz li.divide-right{border-right:1px solid #404040}.wy-menu-horiz a{height:32px;display:inline-block;line-height:32px;padding:0 16px}.wy-menu-vertical{width:300px}.wy-menu-vertical header,.wy-menu-vertical p.caption{color:#55a5d9;height:32px;line-height:32px;padding:0 1.618em;margin:12px 0 0;display:block;font-weight:700;text-transform:uppercase;font-size:85%;white-space:nowrap}.wy-menu-vertical ul{margin-bottom:0}.wy-menu-vertical li.divide-top{border-top:1px solid #404040}.wy-menu-vertical li.divide-bottom{border-bottom:1px solid #404040}.wy-menu-vertical li.current{background:#e3e3e3}.wy-menu-vertical li.current a{color:grey;border-right:1px solid #c9c9c9;padding:.4045em 2.427em}.wy-menu-vertical li.current a:hover{background:#d6d6d6}.rst-content .wy-menu-vertical li tt,.wy-menu-vertical li .rst-content tt,.wy-menu-vertical li code{border:none;background:inherit;color:inherit;padding-left:0;padding-right:0}.wy-menu-vertical li span.toctree-expand{display:block;float:left;margin-left:-1.2em;font-size:.8em;line-height:1.6em;color:#4d4d4d}.wy-menu-vertical li.current>a,.wy-menu-vertical li.on a{color:#404040;font-weight:700;position:relative;background:#fcfcfc;border:none;padding:.4045em 1.618em}.wy-menu-vertical li.current>a:hover,.wy-menu-vertical li.on a:hover{background:#fcfcfc}.wy-menu-vertical li.current>a:hover span.toctree-expand,.wy-menu-vertical li.on a:hover span.toctree-expand{color:grey}.wy-menu-vertical li.current>a span.toctree-expand,.wy-menu-vertical li.on a span.toctree-expand{display:block;font-size:.8em;line-height:1.6em;color:#333}.wy-menu-vertical li.toctree-l1.current>a{border-bottom:1px solid #c9c9c9;border-top:1px solid #c9c9c9}.wy-menu-vertical .toctree-l1.current .toctree-l2>ul,.wy-menu-vertical .toctree-l2.current .toctree-l3>ul,.wy-menu-vertical .toctree-l3.current .toctree-l4>ul,.wy-menu-vertical .toctree-l4.current .toctree-l5>ul,.wy-menu-vertical .toctree-l5.current .toctree-l6>ul,.wy-menu-vertical .toctree-l6.current .toctree-l7>ul,.wy-menu-vertical .toctree-l7.current .toctree-l8>ul,.wy-menu-vertical .toctree-l8.current .toctree-l9>ul,.wy-menu-vertical .toctree-l9.current .toctree-l10>ul,.wy-menu-vertical .toctree-l10.current .toctree-l11>ul{display:none}.wy-menu-vertical .toctree-l1.current .current.toctree-l2>ul,.wy-menu-vertical .toctree-l2.current .current.toctree-l3>ul,.wy-menu-vertical .toctree-l3.current .current.toctree-l4>ul,.wy-menu-vertical .toctree-l4.current .current.toctree-l5>ul,.wy-menu-vertical .toctree-l5.current .current.toctree-l6>ul,.wy-menu-vertical .toctree-l6.current .current.toctree-l7>ul,.wy-menu-vertical .toctree-l7.current .current.toctree-l8>ul,.wy-menu-vertical .toctree-l8.current .current.toctree-l9>ul,.wy-menu-vertical .toctree-l9.current .current.toctree-l10>ul,.wy-menu-vertical .toctree-l10.current .current.toctree-l11>ul{display:block}.wy-menu-vertical li.toctree-l3,.wy-menu-vertical li.toctree-l4{font-size:.9em}.wy-menu-vertical li.toctree-l2 a,.wy-menu-vertical li.toctree-l3 a,.wy-menu-vertical li.toctree-l4 a,.wy-menu-vertical li.toctree-l5 a,.wy-menu-vertical li.toctree-l6 a,.wy-menu-vertical li.toctree-l7 a,.wy-menu-vertical li.toctree-l8 a,.wy-menu-vertical li.toctree-l9 a,.wy-menu-vertical li.toctree-l10 a{color:#404040}.wy-menu-vertical li.toctree-l2 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l3 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l4 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l5 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l6 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l7 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l8 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l9 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l10 a:hover span.toctree-expand{color:grey}.wy-menu-vertical li.toctree-l2.current li.toctree-l3>a,.wy-menu-vertical li.toctree-l3.current li.toctree-l4>a,.wy-menu-vertical li.toctree-l4.current li.toctree-l5>a,.wy-menu-vertical li.toctree-l5.current li.toctree-l6>a,.wy-menu-vertical li.toctree-l6.current li.toctree-l7>a,.wy-menu-vertical li.toctree-l7.current li.toctree-l8>a,.wy-menu-vertical li.toctree-l8.current li.toctree-l9>a,.wy-menu-vertical li.toctree-l9.current li.toctree-l10>a,.wy-menu-vertical li.toctree-l10.current li.toctree-l11>a{display:block}.wy-menu-vertical li.toctree-l2.current>a{padding:.4045em 2.427em}.wy-menu-vertical li.toctree-l2.current li.toctree-l3>a,.wy-menu-vertical li.toctree-l3.current>a{padding:.4045em 4.045em}.wy-menu-vertical li.toctree-l3.current li.toctree-l4>a,.wy-menu-vertical li.toctree-l4.current>a{padding:.4045em 5.663em}.wy-menu-vertical li.toctree-l4.current li.toctree-l5>a,.wy-menu-vertical li.toctree-l5.current>a{padding:.4045em 7.281em}.wy-menu-vertical li.toctree-l5.current li.toctree-l6>a,.wy-menu-vertical li.toctree-l6.current>a{padding:.4045em 8.899em}.wy-menu-vertical li.toctree-l6.current li.toctree-l7>a,.wy-menu-vertical li.toctree-l7.current>a{padding:.4045em 10.517em}.wy-menu-vertical li.toctree-l7.current li.toctree-l8>a,.wy-menu-vertical li.toctree-l8.current>a{padding:.4045em 12.135em}.wy-menu-vertical li.toctree-l8.current li.toctree-l9>a,.wy-menu-vertical li.toctree-l9.current>a{padding:.4045em 13.753em}.wy-menu-vertical li.toctree-l9.current li.toctree-l10>a,.wy-menu-vertical li.toctree-l10.current>a{padding:.4045em 15.371em}.wy-menu-vertical li.toctree-l10.current li.toctree-l11>a{padding:.4045em 16.989em}.wy-menu-vertical li.toctree-l2.current>a,.wy-menu-vertical li.toctree-l2.current li.toctree-l3>a{background:#c9c9c9}.wy-menu-vertical li.toctree-l2 span.toctree-expand{color:#a3a3a3}.wy-menu-vertical li.toctree-l3.current>a,.wy-menu-vertical li.toctree-l3.current li.toctree-l4>a{background:#bdbdbd}.wy-menu-vertical li.toctree-l3 span.toctree-expand{color:#969696}.wy-menu-vertical li.current ul{display:block}.wy-menu-vertical li ul{margin-bottom:0;display:none}.wy-menu-vertical li ul li a{margin-bottom:0;color:#d9d9d9;font-weight:400}.wy-menu-vertical a{line-height:18px;padding:.4045em 1.618em;display:block;position:relative;font-size:90%;color:#d9d9d9}.wy-menu-vertical a:hover{background-color:#4e4a4a;cursor:pointer}.wy-menu-vertical a:hover span.toctree-expand{color:#d9d9d9}.wy-menu-vertical a:active{background-color:#2980b9;cursor:pointer;color:#fff}.wy-menu-vertical a:active span.toctree-expand{color:#fff}.wy-side-nav-search{display:block;width:300px;padding:.809em;margin-bottom:.809em;z-index:200;background-color:#2980b9;text-align:center;color:#fcfcfc}.wy-side-nav-search input[type=text]{width:100%;border-radius:50px;padding:6px 12px;border-color:#2472a4}.wy-side-nav-search img{display:block;margin:auto auto .809em;height:45px;width:45px;background-color:#2980b9;padding:5px;border-radius:100%}.wy-side-nav-search .wy-dropdown>a,.wy-side-nav-search>a{color:#fcfcfc;font-size:100%;font-weight:700;display:inline-block;padding:4px 6px;margin-bottom:.809em}.wy-side-nav-search .wy-dropdown>a:hover,.wy-side-nav-search>a:hover{background:hsla(0,0%,100%,.1)}.wy-side-nav-search .wy-dropdown>a img.logo,.wy-side-nav-search>a img.logo{display:block;margin:0 auto;height:auto;width:auto;border-radius:0;max-width:100%;background:transparent}.wy-side-nav-search .wy-dropdown>a.icon img.logo,.wy-side-nav-search>a.icon img.logo{margin-top:.85em}.wy-side-nav-search>div.version{margin-top:-.4045em;margin-bottom:.809em;font-weight:400;color:hsla(0,0%,100%,.3)}.wy-nav .wy-menu-vertical header{color:#2980b9}.wy-nav .wy-menu-vertical a{color:#b3b3b3}.wy-nav .wy-menu-vertical a:hover{background-color:#2980b9;color:#fff}[data-menu-wrap]{-webkit-transition:all .2s ease-in;-moz-transition:all .2s ease-in;transition:all .2s ease-in;position:absolute;opacity:1;width:100%;opacity:0}[data-menu-wrap].move-center{left:0;right:auto;opacity:1}[data-menu-wrap].move-left{right:auto;left:-100%;opacity:0}[data-menu-wrap].move-right{right:-100%;left:auto;opacity:0}.wy-body-for-nav{background:#fcfcfc}.wy-grid-for-nav{position:absolute;width:100%;height:100%}.wy-nav-side{position:fixed;top:0;bottom:0;left:0;padding-bottom:2em;width:300px;overflow-x:hidden;overflow-y:hidden;min-height:100%;color:#9b9b9b;background:#343131;z-index:200}.wy-side-scroll{width:320px;position:relative;overflow-x:hidden;overflow-y:scroll;height:100%}.wy-nav-top{display:none;background:#2980b9;color:#fff;padding:.4045em .809em;position:relative;line-height:50px;text-align:center;font-size:100%;*zoom:1}.wy-nav-top:after,.wy-nav-top:before{display:table;content:""}.wy-nav-top:after{clear:both}.wy-nav-top a{color:#fff;font-weight:700}.wy-nav-top img{margin-right:12px;height:45px;width:45px;background-color:#2980b9;padding:5px;border-radius:100%}.wy-nav-top i{font-size:30px;float:left;cursor:pointer;padding-top:inherit}.wy-nav-content-wrap{margin-left:300px;background:#fcfcfc;min-height:100%}.wy-nav-content{padding:1.618em 3.236em;height:100%;max-width:800px;margin:auto}.wy-body-mask{position:fixed;width:100%;height:100%;background:rgba(0,0,0,.2);display:none;z-index:499}.wy-body-mask.on{display:block}footer{color:grey}footer p{margin-bottom:12px}.rst-content footer span.commit tt,footer span.commit .rst-content tt,footer span.commit code{padding:0;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;font-size:1em;background:none;border:none;color:grey}.rst-footer-buttons{*zoom:1}.rst-footer-buttons:after,.rst-footer-buttons:before{width:100%;display:table;content:""}.rst-footer-buttons:after{clear:both}.rst-breadcrumbs-buttons{margin-top:12px;*zoom:1}.rst-breadcrumbs-buttons:after,.rst-breadcrumbs-buttons:before{display:table;content:""}.rst-breadcrumbs-buttons:after{clear:both}#search-results .search li{margin-bottom:24px;border-bottom:1px solid #e1e4e5;padding-bottom:24px}#search-results .search li:first-child{border-top:1px solid #e1e4e5;padding-top:24px}#search-results .search li a{font-size:120%;margin-bottom:12px;display:inline-block}#search-results .context{color:grey;font-size:90%}.genindextable li>ul{margin-left:24px}@media screen and (max-width:768px){.wy-body-for-nav{background:#fcfcfc}.wy-nav-top{display:block}.wy-nav-side{left:-300px}.wy-nav-side.shift{width:85%;left:0}.wy-menu.wy-menu-vertical,.wy-side-nav-search,.wy-side-scroll{width:auto}.wy-nav-content-wrap{margin-left:0}.wy-nav-content-wrap .wy-nav-content{padding:1.618em}.wy-nav-content-wrap.shift{position:fixed;min-width:100%;left:85%;top:0;height:100%;overflow:hidden}}@media screen and (min-width:1100px){.wy-nav-content-wrap{background:rgba(0,0,0,.05)}.wy-nav-content{margin:0;background:#fcfcfc}}@media print{.rst-versions,.wy-nav-side,footer{display:none}.wy-nav-content-wrap{margin-left:0}}.rst-versions{position:fixed;bottom:0;left:0;width:300px;color:#fcfcfc;background:#1f1d1d;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;z-index:400}.rst-versions a{color:#2980b9;text-decoration:none}.rst-versions .rst-badge-small{display:none}.rst-versions .rst-current-version{padding:12px;background-color:#272525;display:block;text-align:right;font-size:90%;cursor:pointer;color:#27ae60;*zoom:1}.rst-versions .rst-current-version:after,.rst-versions .rst-current-version:before{display:table;content:""}.rst-versions .rst-current-version:after{clear:both}.rst-content .code-block-caption .rst-versions .rst-current-version .headerlink,.rst-content .rst-versions .rst-current-version .admonition-title,.rst-content code.download .rst-versions .rst-current-version span:first-child,.rst-content dl dt .rst-versions .rst-current-version .headerlink,.rst-content h1 .rst-versions .rst-current-version .headerlink,.rst-content h2 .rst-versions .rst-current-version .headerlink,.rst-content h3 .rst-versions .rst-current-version .headerlink,.rst-content h4 .rst-versions .rst-current-version .headerlink,.rst-content h5 .rst-versions .rst-current-version .headerlink,.rst-content h6 .rst-versions .rst-current-version .headerlink,.rst-content p.caption .rst-versions .rst-current-version .headerlink,.rst-content table>caption .rst-versions .rst-current-version .headerlink,.rst-content tt.download .rst-versions .rst-current-version span:first-child,.rst-versions .rst-current-version .fa,.rst-versions .rst-current-version .icon,.rst-versions .rst-current-version .rst-content .admonition-title,.rst-versions .rst-current-version .rst-content .code-block-caption .headerlink,.rst-versions .rst-current-version .rst-content code.download span:first-child,.rst-versions .rst-current-version .rst-content dl dt .headerlink,.rst-versions .rst-current-version .rst-content h1 .headerlink,.rst-versions .rst-current-version .rst-content h2 .headerlink,.rst-versions .rst-current-version .rst-content h3 .headerlink,.rst-versions .rst-current-version .rst-content h4 .headerlink,.rst-versions .rst-current-version .rst-content h5 .headerlink,.rst-versions .rst-current-version .rst-content h6 .headerlink,.rst-versions .rst-current-version .rst-content p.caption .headerlink,.rst-versions .rst-current-version .rst-content table>caption .headerlink,.rst-versions .rst-current-version .rst-content tt.download span:first-child,.rst-versions .rst-current-version .wy-menu-vertical li span.toctree-expand,.wy-menu-vertical li .rst-versions .rst-current-version span.toctree-expand{color:#fcfcfc}.rst-versions .rst-current-version .fa-book,.rst-versions .rst-current-version .icon-book{float:left}.rst-versions .rst-current-version.rst-out-of-date{background-color:#e74c3c;color:#fff}.rst-versions .rst-current-version.rst-active-old-version{background-color:#f1c40f;color:#000}.rst-versions.shift-up{height:auto;max-height:100%;overflow-y:scroll}.rst-versions.shift-up .rst-other-versions{display:block}.rst-versions .rst-other-versions{font-size:90%;padding:12px;color:grey;display:none}.rst-versions .rst-other-versions hr{display:block;height:1px;border:0;margin:20px 0;padding:0;border-top:1px solid #413d3d}.rst-versions .rst-other-versions dd{display:inline-block;margin:0}.rst-versions .rst-other-versions dd a{display:inline-block;padding:6px;color:#fcfcfc}.rst-versions.rst-badge{width:auto;bottom:20px;right:20px;left:auto;border:none;max-width:300px;max-height:90%}.rst-versions.rst-badge .fa-book,.rst-versions.rst-badge .icon-book{float:none;line-height:30px}.rst-versions.rst-badge.shift-up .rst-current-version{text-align:right}.rst-versions.rst-badge.shift-up .rst-current-version .fa-book,.rst-versions.rst-badge.shift-up .rst-current-version .icon-book{float:left}.rst-versions.rst-badge>.rst-current-version{width:auto;height:30px;line-height:30px;padding:0 6px;display:block;text-align:center}@media screen and (max-width:768px){.rst-versions{width:85%;display:none}.rst-versions.shift{display:block}}.rst-content img{max-width:100%;height:auto}.rst-content div.figure{margin-bottom:24px}.rst-content div.figure p.caption{font-style:italic}.rst-content div.figure p:last-child.caption{margin-bottom:0}.rst-content div.figure.align-center{text-align:center}.rst-content .section>a>img,.rst-content .section>img{margin-bottom:24px}.rst-content abbr[title]{text-decoration:none}.rst-content.style-external-links a.reference.external:after{font-family:FontAwesome;content:"\f08e";color:#b3b3b3;vertical-align:super;font-size:60%;margin:0 .2em}.rst-content blockquote{margin-left:24px;line-height:24px;margin-bottom:24px}.rst-content pre.literal-block{white-space:pre;margin:0;padding:12px;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;display:block;overflow:auto}.rst-content div[class^=highlight],.rst-content pre.literal-block{border:1px solid #e1e4e5;overflow-x:auto;margin:1px 0 24px}.rst-content div[class^=highlight] div[class^=highlight],.rst-content pre.literal-block div[class^=highlight]{padding:0;border:none;margin:0}.rst-content div[class^=highlight] td.code{width:100%}.rst-content .linenodiv pre{border-right:1px solid #e6e9ea;margin:0;padding:12px;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;user-select:none;pointer-events:none}.rst-content div[class^=highlight] pre{white-space:pre;margin:0;padding:12px;display:block;overflow:auto}.rst-content div[class^=highlight] pre .hll{display:block;margin:0 -12px;padding:0 12px}.rst-content .linenodiv pre,.rst-content div[class^=highlight] pre,.rst-content pre.literal-block{font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;font-size:12px;line-height:1.4}.rst-content div.highlight .gp{user-select:none;pointer-events:none}.rst-content .code-block-caption{font-style:italic;font-size:85%;line-height:1;padding:1em 0;text-align:center}@media print{.rst-content .codeblock,.rst-content div[class^=highlight],.rst-content div[class^=highlight] pre{white-space:pre-wrap}}.rst-content .admonition,.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .danger,.rst-content .error,.rst-content .hint,.rst-content .important,.rst-content .note,.rst-content .seealso,.rst-content .tip,.rst-content .warning{clear:both}.rst-content .admonition-todo .last,.rst-content .admonition-todo>:last-child,.rst-content .admonition .last,.rst-content .admonition>:last-child,.rst-content .attention .last,.rst-content .attention>:last-child,.rst-content .caution .last,.rst-content .caution>:last-child,.rst-content .danger .last,.rst-content .danger>:last-child,.rst-content .error .last,.rst-content .error>:last-child,.rst-content .hint .last,.rst-content .hint>:last-child,.rst-content .important .last,.rst-content .important>:last-child,.rst-content .note .last,.rst-content .note>:last-child,.rst-content .seealso .last,.rst-content .seealso>:last-child,.rst-content .tip .last,.rst-content .tip>:last-child,.rst-content .warning .last,.rst-content .warning>:last-child{margin-bottom:0}.rst-content .admonition-title:before{margin-right:4px}.rst-content .admonition table{border-color:rgba(0,0,0,.1)}.rst-content .admonition table td,.rst-content .admonition table th{background:transparent!important;border-color:rgba(0,0,0,.1)!important}.rst-content .section ol.loweralpha,.rst-content .section ol.loweralpha>li{list-style:lower-alpha}.rst-content .section ol.upperalpha,.rst-content .section ol.upperalpha>li{list-style:upper-alpha}.rst-content .section ol li>*,.rst-content .section ul li>*{margin-top:12px;margin-bottom:12px}.rst-content .section ol li>:first-child,.rst-content .section ul li>:first-child{margin-top:0}.rst-content .section ol li>p,.rst-content .section ol li>p:last-child,.rst-content .section ul li>p,.rst-content .section ul li>p:last-child{margin-bottom:12px}.rst-content .section ol li>p:only-child,.rst-content .section ol li>p:only-child:last-child,.rst-content .section ul li>p:only-child,.rst-content .section ul li>p:only-child:last-child{margin-bottom:0}.rst-content .section ol li>ol,.rst-content .section ol li>ul,.rst-content .section ul li>ol,.rst-content .section ul li>ul{margin-bottom:12px}.rst-content .section ol.simple li>*,.rst-content .section ol.simple li ol,.rst-content .section ol.simple li ul,.rst-content .section ul.simple li>*,.rst-content .section ul.simple li ol,.rst-content .section ul.simple li ul{margin-top:0;margin-bottom:0}.rst-content .line-block{margin-left:0;margin-bottom:24px;line-height:24px}.rst-content .line-block .line-block{margin-left:24px;margin-bottom:0}.rst-content .topic-title{font-weight:700;margin-bottom:12px}.rst-content .toc-backref{color:#404040}.rst-content .align-right{float:right;margin:0 0 24px 24px}.rst-content .align-left{float:left;margin:0 24px 24px 0}.rst-content .align-center{margin:auto}.rst-content .align-center:not(table){display:block}.rst-content .code-block-caption .headerlink,.rst-content .toctree-wrapper>p.caption .headerlink,.rst-content dl dt .headerlink,.rst-content h1 .headerlink,.rst-content h2 .headerlink,.rst-content h3 .headerlink,.rst-content h4 .headerlink,.rst-content h5 .headerlink,.rst-content h6 .headerlink,.rst-content p.caption .headerlink,.rst-content table>caption .headerlink{visibility:hidden;font-size:14px}.rst-content .code-block-caption .headerlink:after,.rst-content .toctree-wrapper>p.caption .headerlink:after,.rst-content dl dt .headerlink:after,.rst-content h1 .headerlink:after,.rst-content h2 .headerlink:after,.rst-content h3 .headerlink:after,.rst-content h4 .headerlink:after,.rst-content h5 .headerlink:after,.rst-content h6 .headerlink:after,.rst-content p.caption .headerlink:after,.rst-content table>caption .headerlink:after{content:"\f0c1";font-family:FontAwesome}.rst-content .code-block-caption:hover .headerlink:after,.rst-content .toctree-wrapper>p.caption:hover .headerlink:after,.rst-content dl dt:hover .headerlink:after,.rst-content h1:hover .headerlink:after,.rst-content h2:hover .headerlink:after,.rst-content h3:hover .headerlink:after,.rst-content h4:hover .headerlink:after,.rst-content h5:hover .headerlink:after,.rst-content h6:hover .headerlink:after,.rst-content p.caption:hover .headerlink:after,.rst-content table>caption:hover .headerlink:after{visibility:visible}.rst-content table>caption .headerlink:after{font-size:12px}.rst-content .centered{text-align:center}.rst-content .sidebar{float:right;width:40%;display:block;margin:0 0 24px 24px;padding:24px;background:#f3f6f6;border:1px solid #e1e4e5}.rst-content .sidebar dl,.rst-content .sidebar p,.rst-content .sidebar ul{font-size:90%}.rst-content .sidebar .last,.rst-content .sidebar>:last-child{margin-bottom:0}.rst-content .sidebar .sidebar-title{display:block;font-family:Roboto Slab,ff-tisa-web-pro,Georgia,Arial,sans-serif;font-weight:700;background:#e1e4e5;padding:6px 12px;margin:-24px -24px 24px;font-size:100%}.rst-content .highlighted{background:#f1c40f;box-shadow:0 0 0 2px #f1c40f;display:inline;font-weight:700}.rst-content .citation-reference,.rst-content .footnote-reference{vertical-align:baseline;position:relative;top:-.4em;line-height:0;font-size:90%}.rst-content .hlist{width:100%}html.writer-html4 .rst-content table.docutils.citation,html.writer-html4 .rst-content table.docutils.footnote{background:none;border:none}html.writer-html4 .rst-content table.docutils.citation td,html.writer-html4 .rst-content table.docutils.citation tr,html.writer-html4 .rst-content table.docutils.footnote td,html.writer-html4 .rst-content table.docutils.footnote tr{border:none;background-color:transparent!important;white-space:normal}html.writer-html4 .rst-content table.docutils.citation td.label,html.writer-html4 .rst-content table.docutils.footnote td.label{padding-left:0;padding-right:0;vertical-align:top}html.writer-html5 .rst-content dl dt span.classifier:before{content:" : "}html.writer-html5 .rst-content dl.field-list,html.writer-html5 .rst-content dl.footnote{display:grid;grid-template-columns:max-content auto}html.writer-html5 .rst-content dl.field-list>dt,html.writer-html5 .rst-content dl.footnote>dt{padding-left:1rem}html.writer-html5 .rst-content dl.field-list>dt:after,html.writer-html5 .rst-content dl.footnote>dt:after{content:":"}html.writer-html5 .rst-content dl.field-list>dd,html.writer-html5 .rst-content dl.field-list>dt,html.writer-html5 .rst-content dl.footnote>dd,html.writer-html5 .rst-content dl.footnote>dt{margin-bottom:0}html.writer-html5 .rst-content dl.footnote{font-size:.9rem}html.writer-html5 .rst-content dl.footnote>dt{margin:0 .5rem .5rem 0;line-height:1.2rem;word-break:break-all;font-weight:400}html.writer-html5 .rst-content dl.footnote>dt>span.brackets{margin-right:.5rem}html.writer-html5 .rst-content dl.footnote>dt>span.brackets:before{content:"["}html.writer-html5 .rst-content dl.footnote>dt>span.brackets:after{content:"]"}html.writer-html5 .rst-content dl.footnote>dt>span.fn-backref{font-style:italic}html.writer-html5 .rst-content dl.footnote>dd{margin:0 0 .5rem;line-height:1.2rem}html.writer-html5 .rst-content dl.footnote>dd p,html.writer-html5 .rst-content dl.option-list kbd{font-size:.9rem}.rst-content table.docutils.footnote,html.writer-html4 .rst-content table.docutils.citation,html.writer-html5 .rst-content dl.footnote{color:grey}.rst-content table.docutils.footnote code,.rst-content table.docutils.footnote tt,html.writer-html4 .rst-content table.docutils.citation code,html.writer-html4 .rst-content table.docutils.citation tt,html.writer-html5 .rst-content dl.footnote code,html.writer-html5 .rst-content dl.footnote tt{color:#555}.rst-content .wy-table-responsive.citation,.rst-content .wy-table-responsive.footnote{margin-bottom:0}.rst-content .wy-table-responsive.citation+:not(.citation),.rst-content .wy-table-responsive.footnote+:not(.footnote){margin-top:24px}.rst-content .wy-table-responsive.citation:last-child,.rst-content .wy-table-responsive.footnote:last-child{margin-bottom:24px}.rst-content table.docutils th{border-color:#e1e4e5}html.writer-html5 .rst-content table.docutils th{border:1px solid #e1e4e5}html.writer-html5 .rst-content table.docutils td>p,html.writer-html5 .rst-content table.docutils th>p{line-height:1rem;margin-bottom:0;font-size:.9rem}.rst-content table.docutils td .last,.rst-content table.docutils td .last>:last-child{margin-bottom:0}.rst-content table.field-list,.rst-content table.field-list td{border:none}.rst-content table.field-list td p{font-size:inherit;line-height:inherit}.rst-content table.field-list td>strong{display:inline-block}.rst-content table.field-list .field-name{padding-right:10px;text-align:left;white-space:nowrap}.rst-content table.field-list .field-body{text-align:left}.rst-content code,.rst-content tt{color:#000;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;padding:2px 5px}.rst-content code big,.rst-content code em,.rst-content tt big,.rst-content tt em{font-size:100%!important;line-height:normal}.rst-content code.literal,.rst-content tt.literal{color:#e74c3c}.rst-content code.xref,.rst-content tt.xref,a .rst-content code,a .rst-content tt{font-weight:700;color:#404040}.rst-content kbd,.rst-content pre,.rst-content samp{font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace}.rst-content a code,.rst-content a tt{color:#2980b9}.rst-content dl{margin-bottom:24px}.rst-content dl dt{font-weight:700;margin-bottom:12px}.rst-content dl ol,.rst-content dl p,.rst-content dl table,.rst-content dl ul{margin-bottom:12px}.rst-content dl dd{margin:0 0 12px 24px;line-height:24px}html.writer-html4 .rst-content dl:not(.docutils),html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple){margin-bottom:24px}html.writer-html4 .rst-content dl:not(.docutils)>dt,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple)>dt{display:table;margin:6px 0;font-size:90%;line-height:normal;background:#e7f2fa;color:#2980b9;border-top:3px solid #6ab0de;padding:6px;position:relative}html.writer-html4 .rst-content dl:not(.docutils)>dt:before,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple)>dt:before{color:#6ab0de}html.writer-html4 .rst-content dl:not(.docutils)>dt .headerlink,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple)>dt .headerlink{color:#404040;font-size:100%!important}html.writer-html4 .rst-content dl:not(.docutils) dl:not(.field-list)>dt,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) dl:not(.field-list)>dt{margin-bottom:6px;border:none;border-left:3px solid #ccc;background:#f0f0f0;color:#555}html.writer-html4 .rst-content dl:not(.docutils) dl:not(.field-list)>dt .headerlink,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) dl:not(.field-list)>dt .headerlink{color:#404040;font-size:100%!important}html.writer-html4 .rst-content dl:not(.docutils)>dt:first-child,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple)>dt:first-child{margin-top:0}html.writer-html4 .rst-content dl:not(.docutils) code,html.writer-html4 .rst-content dl:not(.docutils) tt,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) code,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) tt{font-weight:700}html.writer-html4 .rst-content dl:not(.docutils) code.descclassname,html.writer-html4 .rst-content dl:not(.docutils) code.descname,html.writer-html4 .rst-content dl:not(.docutils) tt.descclassname,html.writer-html4 .rst-content dl:not(.docutils) tt.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) code.descclassname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) code.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) tt.descclassname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) tt.descname{background-color:transparent;border:none;padding:0;font-size:100%!important}html.writer-html4 .rst-content dl:not(.docutils) code.descname,html.writer-html4 .rst-content dl:not(.docutils) tt.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) code.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) tt.descname{font-weight:700}html.writer-html4 .rst-content dl:not(.docutils) .optional,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) .optional{display:inline-block;padding:0 4px;color:#000;font-weight:700}html.writer-html4 .rst-content dl:not(.docutils) .property,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) .property{display:inline-block;padding-right:8px}.rst-content .viewcode-back,.rst-content .viewcode-link{display:inline-block;color:#27ae60;font-size:80%;padding-left:24px}.rst-content .viewcode-back{display:block;float:right}.rst-content p.rubric{margin-bottom:12px;font-weight:700}.rst-content code.download,.rst-content tt.download{background:inherit;padding:inherit;font-weight:400;font-family:inherit;font-size:inherit;color:inherit;border:inherit;white-space:inherit}.rst-content code.download span:first-child,.rst-content tt.download span:first-child{-webkit-font-smoothing:subpixel-antialiased}.rst-content code.download span:first-child:before,.rst-content tt.download span:first-child:before{margin-right:4px}.rst-content .guilabel{border:1px solid #7fbbe3;background:#e7f2fa;font-size:80%;font-weight:700;border-radius:4px;padding:2.4px 6px;margin:auto 2px}.rst-content .versionmodified{font-style:italic}@media screen and (max-width:480px){.rst-content .sidebar{width:100%}}span[id*=MathJax-Span]{color:#404040}.math{text-align:center}@font-face{font-family:Lato;src:url(fonts/lato-normal.woff2?bd03a2cc277bbbc338d464e679fe9942) format("woff2"),url(fonts/lato-normal.woff?27bd77b9162d388cb8d4c4217c7c5e2a) format("woff");font-weight:400;font-style:normal;font-display:block}@font-face{font-family:Lato;src:url(fonts/lato-bold.woff2?cccb897485813c7c256901dbca54ecf2) format("woff2"),url(fonts/lato-bold.woff?d878b6c29b10beca227e9eef4246111b) format("woff");font-weight:700;font-style:normal;font-display:block}@font-face{font-family:Lato;src:url(fonts/lato-bold-italic.woff2?0b6bb6725576b072c5d0b02ecdd1900d) format("woff2"),url(fonts/lato-bold-italic.woff?9c7e4e9eb485b4a121c760e61bc3707c) format("woff");font-weight:700;font-style:italic;font-display:block}@font-face{font-family:Lato;src:url(fonts/lato-normal-italic.woff2?4eb103b4d12be57cb1d040ed5e162e9d) format("woff2"),url(fonts/lato-normal-italic.woff?f28f2d6482446544ef1ea1ccc6dd5892) format("woff");font-weight:400;font-style:italic;font-display:block}@font-face{font-family:Roboto Slab;font-style:normal;font-weight:400;src:url(fonts/Roboto-Slab-Regular.woff2?7abf5b8d04d26a2cafea937019bca958) format("woff2"),url(fonts/Roboto-Slab-Regular.woff?c1be9284088d487c5e3ff0a10a92e58c) format("woff");font-display:block}@font-face{font-family:Roboto Slab;font-style:normal;font-weight:700;src:url(fonts/Roboto-Slab-Bold.woff2?9984f4a9bda09be08e83f2506954adbe) format("woff2"),url(fonts/Roboto-Slab-Bold.woff?bed5564a116b05148e3b3bea6fb1162a) format("woff");font-display:block} \ No newline at end of file diff --git a/docs/build/html/_static/doctools.js b/docs/build/html/_static/doctools.js new file mode 100644 index 0000000..61ac9d2 --- /dev/null +++ b/docs/build/html/_static/doctools.js @@ -0,0 +1,321 @@ +/* + * doctools.js + * ~~~~~~~~~~~ + * + * Sphinx JavaScript utilities for all documentation. + * + * :copyright: Copyright 2007-2021 by the Sphinx team, see AUTHORS. + * :license: BSD, see LICENSE for details. + * + */ + +/** + * select a different prefix for underscore + */ +$u = _.noConflict(); + +/** + * make the code below compatible with browsers without + * an installed firebug like debugger +if (!window.console || !console.firebug) { + var names = ["log", "debug", "info", "warn", "error", "assert", "dir", + "dirxml", "group", "groupEnd", "time", "timeEnd", "count", "trace", + "profile", "profileEnd"]; + window.console = {}; + for (var i = 0; i < names.length; ++i) + window.console[names[i]] = function() {}; +} + */ + +/** + * small helper function to urldecode strings + * + * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/decodeURIComponent#Decoding_query_parameters_from_a_URL + */ +jQuery.urldecode = function(x) { + if (!x) { + return x + } + return decodeURIComponent(x.replace(/\+/g, ' ')); +}; + +/** + * small helper function to urlencode strings + */ +jQuery.urlencode = encodeURIComponent; + +/** + * This function returns the parsed url parameters of the + * current request. Multiple values per key are supported, + * it will always return arrays of strings for the value parts. + */ +jQuery.getQueryParameters = function(s) { + if (typeof s === 'undefined') + s = document.location.search; + var parts = s.substr(s.indexOf('?') + 1).split('&'); + var result = {}; + for (var i = 0; i < parts.length; i++) { + var tmp = parts[i].split('=', 2); + var key = jQuery.urldecode(tmp[0]); + var value = jQuery.urldecode(tmp[1]); + if (key in result) + result[key].push(value); + else + result[key] = [value]; + } + return result; +}; + +/** + * highlight a given string on a jquery object by wrapping it in + * span elements with the given class name. + */ +jQuery.fn.highlightText = function(text, className) { + function highlight(node, addItems) { + if (node.nodeType === 3) { + var val = node.nodeValue; + var pos = val.toLowerCase().indexOf(text); + if (pos >= 0 && + !jQuery(node.parentNode).hasClass(className) && + !jQuery(node.parentNode).hasClass("nohighlight")) { + var span; + var isInSVG = jQuery(node).closest("body, svg, foreignObject").is("svg"); + if (isInSVG) { + span = document.createElementNS("http://www.w3.org/2000/svg", "tspan"); + } else { + span = document.createElement("span"); + span.className = className; + } + span.appendChild(document.createTextNode(val.substr(pos, text.length))); + node.parentNode.insertBefore(span, node.parentNode.insertBefore( + document.createTextNode(val.substr(pos + text.length)), + node.nextSibling)); + node.nodeValue = val.substr(0, pos); + if (isInSVG) { + var rect = document.createElementNS("http://www.w3.org/2000/svg", "rect"); + var bbox = node.parentElement.getBBox(); + rect.x.baseVal.value = bbox.x; + rect.y.baseVal.value = bbox.y; + rect.width.baseVal.value = bbox.width; + rect.height.baseVal.value = bbox.height; + rect.setAttribute('class', className); + addItems.push({ + "parent": node.parentNode, + "target": rect}); + } + } + } + else if (!jQuery(node).is("button, select, textarea")) { + jQuery.each(node.childNodes, function() { + highlight(this, addItems); + }); + } + } + var addItems = []; + var result = this.each(function() { + highlight(this, addItems); + }); + for (var i = 0; i < addItems.length; ++i) { + jQuery(addItems[i].parent).before(addItems[i].target); + } + return result; +}; + +/* + * backward compatibility for jQuery.browser + * This will be supported until firefox bug is fixed. + */ +if (!jQuery.browser) { + jQuery.uaMatch = function(ua) { + ua = ua.toLowerCase(); + + var match = /(chrome)[ \/]([\w.]+)/.exec(ua) || + /(webkit)[ \/]([\w.]+)/.exec(ua) || + /(opera)(?:.*version|)[ \/]([\w.]+)/.exec(ua) || + /(msie) ([\w.]+)/.exec(ua) || + ua.indexOf("compatible") < 0 && /(mozilla)(?:.*? rv:([\w.]+)|)/.exec(ua) || + []; + + return { + browser: match[ 1 ] || "", + version: match[ 2 ] || "0" + }; + }; + jQuery.browser = {}; + jQuery.browser[jQuery.uaMatch(navigator.userAgent).browser] = true; +} + +/** + * Small JavaScript module for the documentation. + */ +var Documentation = { + + init : function() { + this.fixFirefoxAnchorBug(); + this.highlightSearchWords(); + this.initIndexTable(); + if (DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS) { + this.initOnKeyListeners(); + } + }, + + /** + * i18n support + */ + TRANSLATIONS : {}, + PLURAL_EXPR : function(n) { return n === 1 ? 0 : 1; }, + LOCALE : 'unknown', + + // gettext and ngettext don't access this so that the functions + // can safely bound to a different name (_ = Documentation.gettext) + gettext : function(string) { + var translated = Documentation.TRANSLATIONS[string]; + if (typeof translated === 'undefined') + return string; + return (typeof translated === 'string') ? translated : translated[0]; + }, + + ngettext : function(singular, plural, n) { + var translated = Documentation.TRANSLATIONS[singular]; + if (typeof translated === 'undefined') + return (n == 1) ? singular : plural; + return translated[Documentation.PLURALEXPR(n)]; + }, + + addTranslations : function(catalog) { + for (var key in catalog.messages) + this.TRANSLATIONS[key] = catalog.messages[key]; + this.PLURAL_EXPR = new Function('n', 'return +(' + catalog.plural_expr + ')'); + this.LOCALE = catalog.locale; + }, + + /** + * add context elements like header anchor links + */ + addContextElements : function() { + $('div[id] > :header:first').each(function() { + $('\u00B6'). + attr('href', '#' + this.id). + attr('title', _('Permalink to this headline')). + appendTo(this); + }); + $('dt[id]').each(function() { + $('\u00B6'). + attr('href', '#' + this.id). + attr('title', _('Permalink to this definition')). + appendTo(this); + }); + }, + + /** + * workaround a firefox stupidity + * see: https://bugzilla.mozilla.org/show_bug.cgi?id=645075 + */ + fixFirefoxAnchorBug : function() { + if (document.location.hash && $.browser.mozilla) + window.setTimeout(function() { + document.location.href += ''; + }, 10); + }, + + /** + * highlight the search words provided in the url in the text + */ + highlightSearchWords : function() { + var params = $.getQueryParameters(); + var terms = (params.highlight) ? params.highlight[0].split(/\s+/) : []; + if (terms.length) { + var body = $('div.body'); + if (!body.length) { + body = $('body'); + } + window.setTimeout(function() { + $.each(terms, function() { + body.highlightText(this.toLowerCase(), 'highlighted'); + }); + }, 10); + $('') + .appendTo($('#searchbox')); + } + }, + + /** + * init the domain index toggle buttons + */ + initIndexTable : function() { + var togglers = $('img.toggler').click(function() { + var src = $(this).attr('src'); + var idnum = $(this).attr('id').substr(7); + $('tr.cg-' + idnum).toggle(); + if (src.substr(-9) === 'minus.png') + $(this).attr('src', src.substr(0, src.length-9) + 'plus.png'); + else + $(this).attr('src', src.substr(0, src.length-8) + 'minus.png'); + }).css('display', ''); + if (DOCUMENTATION_OPTIONS.COLLAPSE_INDEX) { + togglers.click(); + } + }, + + /** + * helper function to hide the search marks again + */ + hideSearchWords : function() { + $('#searchbox .highlight-link').fadeOut(300); + $('span.highlighted').removeClass('highlighted'); + }, + + /** + * make the url absolute + */ + makeURL : function(relativeURL) { + return DOCUMENTATION_OPTIONS.URL_ROOT + '/' + relativeURL; + }, + + /** + * get the current relative url + */ + getCurrentURL : function() { + var path = document.location.pathname; + var parts = path.split(/\//); + $.each(DOCUMENTATION_OPTIONS.URL_ROOT.split(/\//), function() { + if (this === '..') + parts.pop(); + }); + var url = parts.join('/'); + return path.substring(url.lastIndexOf('/') + 1, path.length - 1); + }, + + initOnKeyListeners: function() { + $(document).keydown(function(event) { + var activeElementType = document.activeElement.tagName; + // don't navigate when in search box, textarea, dropdown or button + if (activeElementType !== 'TEXTAREA' && activeElementType !== 'INPUT' && activeElementType !== 'SELECT' + && activeElementType !== 'BUTTON' && !event.altKey && !event.ctrlKey && !event.metaKey + && !event.shiftKey) { + switch (event.keyCode) { + case 37: // left + var prevHref = $('link[rel="prev"]').prop('href'); + if (prevHref) { + window.location.href = prevHref; + return false; + } + case 39: // right + var nextHref = $('link[rel="next"]').prop('href'); + if (nextHref) { + window.location.href = nextHref; + return false; + } + } + } + }); + } +}; + +// quick alias for translations +_ = Documentation.gettext; + +$(document).ready(function() { + Documentation.init(); +}); diff --git a/docs/build/html/_static/documentation_options.js b/docs/build/html/_static/documentation_options.js new file mode 100644 index 0000000..b283bb6 --- /dev/null +++ b/docs/build/html/_static/documentation_options.js @@ -0,0 +1,12 @@ +var DOCUMENTATION_OPTIONS = { + URL_ROOT: document.getElementById("documentation_options").getAttribute('data-url_root'), + VERSION: '1.1.1', + LANGUAGE: 'None', + COLLAPSE_INDEX: false, + BUILDER: 'html', + FILE_SUFFIX: '.html', + LINK_SUFFIX: '.html', + HAS_SOURCE: true, + SOURCELINK_SUFFIX: '.txt', + NAVIGATION_WITH_KEYS: false +}; \ No newline at end of file diff --git a/docs/build/html/_static/file.png b/docs/build/html/_static/file.png new file mode 100644 index 0000000..a858a41 Binary files /dev/null and b/docs/build/html/_static/file.png differ diff --git a/docs/build/html/_static/fonts/Inconsolata-Bold.ttf b/docs/build/html/_static/fonts/Inconsolata-Bold.ttf new file mode 100644 index 0000000..809c1f5 Binary files /dev/null and b/docs/build/html/_static/fonts/Inconsolata-Bold.ttf differ diff --git a/docs/build/html/_static/fonts/Inconsolata-Regular.ttf b/docs/build/html/_static/fonts/Inconsolata-Regular.ttf new file mode 100644 index 0000000..fc981ce Binary files /dev/null and b/docs/build/html/_static/fonts/Inconsolata-Regular.ttf differ diff --git a/docs/build/html/_static/fonts/Inconsolata.ttf b/docs/build/html/_static/fonts/Inconsolata.ttf new file mode 100644 index 0000000..4b8a36d Binary files /dev/null and b/docs/build/html/_static/fonts/Inconsolata.ttf differ diff --git a/docs/build/html/_static/fonts/Lato-Bold.ttf b/docs/build/html/_static/fonts/Lato-Bold.ttf new file mode 100644 index 0000000..1d23c70 Binary files /dev/null and b/docs/build/html/_static/fonts/Lato-Bold.ttf differ diff --git a/docs/build/html/_static/fonts/Lato-Regular.ttf b/docs/build/html/_static/fonts/Lato-Regular.ttf new file mode 100644 index 0000000..0f3d0f8 Binary files /dev/null and b/docs/build/html/_static/fonts/Lato-Regular.ttf differ diff --git a/docs/build/html/_static/fonts/Lato/lato-bold.eot b/docs/build/html/_static/fonts/Lato/lato-bold.eot new file mode 100644 index 0000000..3361183 Binary files /dev/null and b/docs/build/html/_static/fonts/Lato/lato-bold.eot differ diff --git a/docs/build/html/_static/fonts/Lato/lato-bold.ttf b/docs/build/html/_static/fonts/Lato/lato-bold.ttf new file mode 100644 index 0000000..29f691d Binary files /dev/null and b/docs/build/html/_static/fonts/Lato/lato-bold.ttf differ diff --git a/docs/build/html/_static/fonts/Lato/lato-bold.woff b/docs/build/html/_static/fonts/Lato/lato-bold.woff new file mode 100644 index 0000000..c6dff51 Binary files /dev/null and b/docs/build/html/_static/fonts/Lato/lato-bold.woff differ diff --git a/docs/build/html/_static/fonts/Lato/lato-bold.woff2 b/docs/build/html/_static/fonts/Lato/lato-bold.woff2 new file mode 100644 index 0000000..bb19504 Binary files /dev/null and b/docs/build/html/_static/fonts/Lato/lato-bold.woff2 differ diff --git a/docs/build/html/_static/fonts/Lato/lato-bolditalic.eot b/docs/build/html/_static/fonts/Lato/lato-bolditalic.eot new file mode 100644 index 0000000..3d41549 Binary files /dev/null and b/docs/build/html/_static/fonts/Lato/lato-bolditalic.eot differ diff --git a/docs/build/html/_static/fonts/Lato/lato-bolditalic.ttf b/docs/build/html/_static/fonts/Lato/lato-bolditalic.ttf new file mode 100644 index 0000000..f402040 Binary files /dev/null and b/docs/build/html/_static/fonts/Lato/lato-bolditalic.ttf differ diff --git a/docs/build/html/_static/fonts/Lato/lato-bolditalic.woff b/docs/build/html/_static/fonts/Lato/lato-bolditalic.woff new file mode 100644 index 0000000..88ad05b Binary files /dev/null and b/docs/build/html/_static/fonts/Lato/lato-bolditalic.woff differ diff --git a/docs/build/html/_static/fonts/Lato/lato-bolditalic.woff2 b/docs/build/html/_static/fonts/Lato/lato-bolditalic.woff2 new file mode 100644 index 0000000..c4e3d80 Binary files /dev/null and b/docs/build/html/_static/fonts/Lato/lato-bolditalic.woff2 differ diff --git a/docs/build/html/_static/fonts/Lato/lato-italic.eot b/docs/build/html/_static/fonts/Lato/lato-italic.eot new file mode 100644 index 0000000..3f82642 Binary files /dev/null and b/docs/build/html/_static/fonts/Lato/lato-italic.eot differ diff --git a/docs/build/html/_static/fonts/Lato/lato-italic.ttf b/docs/build/html/_static/fonts/Lato/lato-italic.ttf new file mode 100644 index 0000000..b4bfc9b Binary files /dev/null and b/docs/build/html/_static/fonts/Lato/lato-italic.ttf differ diff --git a/docs/build/html/_static/fonts/Lato/lato-italic.woff b/docs/build/html/_static/fonts/Lato/lato-italic.woff new file mode 100644 index 0000000..76114bc Binary files /dev/null and b/docs/build/html/_static/fonts/Lato/lato-italic.woff differ diff --git a/docs/build/html/_static/fonts/Lato/lato-italic.woff2 b/docs/build/html/_static/fonts/Lato/lato-italic.woff2 new file mode 100644 index 0000000..3404f37 Binary files /dev/null and b/docs/build/html/_static/fonts/Lato/lato-italic.woff2 differ diff --git a/docs/build/html/_static/fonts/Lato/lato-regular.eot b/docs/build/html/_static/fonts/Lato/lato-regular.eot new file mode 100644 index 0000000..11e3f2a Binary files /dev/null and b/docs/build/html/_static/fonts/Lato/lato-regular.eot differ diff --git a/docs/build/html/_static/fonts/Lato/lato-regular.ttf b/docs/build/html/_static/fonts/Lato/lato-regular.ttf new file mode 100644 index 0000000..74decd9 Binary files /dev/null and b/docs/build/html/_static/fonts/Lato/lato-regular.ttf differ diff --git a/docs/build/html/_static/fonts/Lato/lato-regular.woff b/docs/build/html/_static/fonts/Lato/lato-regular.woff new file mode 100644 index 0000000..ae1307f Binary files /dev/null and b/docs/build/html/_static/fonts/Lato/lato-regular.woff differ diff --git a/docs/build/html/_static/fonts/Lato/lato-regular.woff2 b/docs/build/html/_static/fonts/Lato/lato-regular.woff2 new file mode 100644 index 0000000..3bf9843 Binary files /dev/null and b/docs/build/html/_static/fonts/Lato/lato-regular.woff2 differ diff --git a/docs/build/html/_static/fonts/RobotoSlab-Bold.ttf b/docs/build/html/_static/fonts/RobotoSlab-Bold.ttf new file mode 100644 index 0000000..df5d1df Binary files /dev/null and b/docs/build/html/_static/fonts/RobotoSlab-Bold.ttf differ diff --git a/docs/build/html/_static/fonts/RobotoSlab-Regular.ttf b/docs/build/html/_static/fonts/RobotoSlab-Regular.ttf new file mode 100644 index 0000000..eb52a79 Binary files /dev/null and b/docs/build/html/_static/fonts/RobotoSlab-Regular.ttf differ diff --git a/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-bold.eot b/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-bold.eot new file mode 100644 index 0000000..79dc8ef Binary files /dev/null and b/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-bold.eot differ diff --git a/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-bold.ttf b/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-bold.ttf new file mode 100644 index 0000000..df5d1df Binary files /dev/null and b/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-bold.ttf differ diff --git a/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-bold.woff b/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-bold.woff new file mode 100644 index 0000000..6cb6000 Binary files /dev/null and b/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-bold.woff differ diff --git a/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-bold.woff2 b/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-bold.woff2 new file mode 100644 index 0000000..7059e23 Binary files /dev/null and b/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-bold.woff2 differ diff --git a/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-regular.eot b/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-regular.eot new file mode 100644 index 0000000..2f7ca78 Binary files /dev/null and b/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-regular.eot differ diff --git a/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-regular.ttf b/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-regular.ttf new file mode 100644 index 0000000..eb52a79 Binary files /dev/null and b/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-regular.ttf differ diff --git a/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-regular.woff b/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-regular.woff new file mode 100644 index 0000000..f815f63 Binary files /dev/null and b/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-regular.woff differ diff --git a/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-regular.woff2 b/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-regular.woff2 new file mode 100644 index 0000000..f2c76e5 Binary files /dev/null and b/docs/build/html/_static/fonts/RobotoSlab/roboto-slab-v7-regular.woff2 differ diff --git a/docs/build/html/_static/fonts/fontawesome-webfont.eot b/docs/build/html/_static/fonts/fontawesome-webfont.eot new file mode 100644 index 0000000..e9f60ca Binary files /dev/null and b/docs/build/html/_static/fonts/fontawesome-webfont.eot differ diff --git a/docs/build/html/_static/fonts/fontawesome-webfont.svg b/docs/build/html/_static/fonts/fontawesome-webfont.svg new file mode 100644 index 0000000..855c845 --- /dev/null +++ b/docs/build/html/_static/fonts/fontawesome-webfont.svg @@ -0,0 +1,2671 @@ + + + + +Created by FontForge 20120731 at Mon Oct 24 17:37:40 2016 + By ,,, +Copyright Dave Gandy 2016. All rights reserved. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/docs/build/html/_static/fonts/fontawesome-webfont.ttf b/docs/build/html/_static/fonts/fontawesome-webfont.ttf new file mode 100644 index 0000000..35acda2 Binary files /dev/null and b/docs/build/html/_static/fonts/fontawesome-webfont.ttf differ diff --git a/docs/build/html/_static/fonts/fontawesome-webfont.woff b/docs/build/html/_static/fonts/fontawesome-webfont.woff new file mode 100644 index 0000000..400014a Binary files /dev/null and b/docs/build/html/_static/fonts/fontawesome-webfont.woff differ diff --git a/docs/build/html/_static/fonts/fontawesome-webfont.woff2 b/docs/build/html/_static/fonts/fontawesome-webfont.woff2 new file mode 100644 index 0000000..4d13fc6 Binary files /dev/null and b/docs/build/html/_static/fonts/fontawesome-webfont.woff2 differ diff --git a/docs/build/html/_static/jquery-3.5.1.js b/docs/build/html/_static/jquery-3.5.1.js new file mode 100644 index 0000000..5093733 --- /dev/null +++ b/docs/build/html/_static/jquery-3.5.1.js @@ -0,0 +1,10872 @@ +/*! + * jQuery JavaScript Library v3.5.1 + * https://jquery.com/ + * + * Includes Sizzle.js + * https://sizzlejs.com/ + * + * Copyright JS Foundation and other contributors + * Released under the MIT license + * https://jquery.org/license + * + * Date: 2020-05-04T22:49Z + */ +( function( global, factory ) { + + "use strict"; + + if ( typeof module === "object" && typeof module.exports === "object" ) { + + // For CommonJS and CommonJS-like environments where a proper `window` + // is present, execute the factory and get jQuery. + // For environments that do not have a `window` with a `document` + // (such as Node.js), expose a factory as module.exports. + // This accentuates the need for the creation of a real `window`. + // e.g. var jQuery = require("jquery")(window); + // See ticket #14549 for more info. + module.exports = global.document ? + factory( global, true ) : + function( w ) { + if ( !w.document ) { + throw new Error( "jQuery requires a window with a document" ); + } + return factory( w ); + }; + } else { + factory( global ); + } + +// Pass this if window is not defined yet +} )( typeof window !== "undefined" ? window : this, function( window, noGlobal ) { + +// Edge <= 12 - 13+, Firefox <=18 - 45+, IE 10 - 11, Safari 5.1 - 9+, iOS 6 - 9.1 +// throw exceptions when non-strict code (e.g., ASP.NET 4.5) accesses strict mode +// arguments.callee.caller (trac-13335). But as of jQuery 3.0 (2016), strict mode should be common +// enough that all such attempts are guarded in a try block. +"use strict"; + +var arr = []; + +var getProto = Object.getPrototypeOf; + +var slice = arr.slice; + +var flat = arr.flat ? function( array ) { + return arr.flat.call( array ); +} : function( array ) { + return arr.concat.apply( [], array ); +}; + + +var push = arr.push; + +var indexOf = arr.indexOf; + +var class2type = {}; + +var toString = class2type.toString; + +var hasOwn = class2type.hasOwnProperty; + +var fnToString = hasOwn.toString; + +var ObjectFunctionString = fnToString.call( Object ); + +var support = {}; + +var isFunction = function isFunction( obj ) { + + // Support: Chrome <=57, Firefox <=52 + // In some browsers, typeof returns "function" for HTML elements + // (i.e., `typeof document.createElement( "object" ) === "function"`). + // We don't want to classify *any* DOM node as a function. + return typeof obj === "function" && typeof obj.nodeType !== "number"; + }; + + +var isWindow = function isWindow( obj ) { + return obj != null && obj === obj.window; + }; + + +var document = window.document; + + + + var preservedScriptAttributes = { + type: true, + src: true, + nonce: true, + noModule: true + }; + + function DOMEval( code, node, doc ) { + doc = doc || document; + + var i, val, + script = doc.createElement( "script" ); + + script.text = code; + if ( node ) { + for ( i in preservedScriptAttributes ) { + + // Support: Firefox 64+, Edge 18+ + // Some browsers don't support the "nonce" property on scripts. + // On the other hand, just using `getAttribute` is not enough as + // the `nonce` attribute is reset to an empty string whenever it + // becomes browsing-context connected. + // See https://github.com/whatwg/html/issues/2369 + // See https://html.spec.whatwg.org/#nonce-attributes + // The `node.getAttribute` check was added for the sake of + // `jQuery.globalEval` so that it can fake a nonce-containing node + // via an object. + val = node[ i ] || node.getAttribute && node.getAttribute( i ); + if ( val ) { + script.setAttribute( i, val ); + } + } + } + doc.head.appendChild( script ).parentNode.removeChild( script ); + } + + +function toType( obj ) { + if ( obj == null ) { + return obj + ""; + } + + // Support: Android <=2.3 only (functionish RegExp) + return typeof obj === "object" || typeof obj === "function" ? + class2type[ toString.call( obj ) ] || "object" : + typeof obj; +} +/* global Symbol */ +// Defining this global in .eslintrc.json would create a danger of using the global +// unguarded in another place, it seems safer to define global only for this module + + + +var + version = "3.5.1", + + // Define a local copy of jQuery + jQuery = function( selector, context ) { + + // The jQuery object is actually just the init constructor 'enhanced' + // Need init if jQuery is called (just allow error to be thrown if not included) + return new jQuery.fn.init( selector, context ); + }; + +jQuery.fn = jQuery.prototype = { + + // The current version of jQuery being used + jquery: version, + + constructor: jQuery, + + // The default length of a jQuery object is 0 + length: 0, + + toArray: function() { + return slice.call( this ); + }, + + // Get the Nth element in the matched element set OR + // Get the whole matched element set as a clean array + get: function( num ) { + + // Return all the elements in a clean array + if ( num == null ) { + return slice.call( this ); + } + + // Return just the one element from the set + return num < 0 ? this[ num + this.length ] : this[ num ]; + }, + + // Take an array of elements and push it onto the stack + // (returning the new matched element set) + pushStack: function( elems ) { + + // Build a new jQuery matched element set + var ret = jQuery.merge( this.constructor(), elems ); + + // Add the old object onto the stack (as a reference) + ret.prevObject = this; + + // Return the newly-formed element set + return ret; + }, + + // Execute a callback for every element in the matched set. + each: function( callback ) { + return jQuery.each( this, callback ); + }, + + map: function( callback ) { + return this.pushStack( jQuery.map( this, function( elem, i ) { + return callback.call( elem, i, elem ); + } ) ); + }, + + slice: function() { + return this.pushStack( slice.apply( this, arguments ) ); + }, + + first: function() { + return this.eq( 0 ); + }, + + last: function() { + return this.eq( -1 ); + }, + + even: function() { + return this.pushStack( jQuery.grep( this, function( _elem, i ) { + return ( i + 1 ) % 2; + } ) ); + }, + + odd: function() { + return this.pushStack( jQuery.grep( this, function( _elem, i ) { + return i % 2; + } ) ); + }, + + eq: function( i ) { + var len = this.length, + j = +i + ( i < 0 ? len : 0 ); + return this.pushStack( j >= 0 && j < len ? [ this[ j ] ] : [] ); + }, + + end: function() { + return this.prevObject || this.constructor(); + }, + + // For internal use only. + // Behaves like an Array's method, not like a jQuery method. + push: push, + sort: arr.sort, + splice: arr.splice +}; + +jQuery.extend = jQuery.fn.extend = function() { + var options, name, src, copy, copyIsArray, clone, + target = arguments[ 0 ] || {}, + i = 1, + length = arguments.length, + deep = false; + + // Handle a deep copy situation + if ( typeof target === "boolean" ) { + deep = target; + + // Skip the boolean and the target + target = arguments[ i ] || {}; + i++; + } + + // Handle case when target is a string or something (possible in deep copy) + if ( typeof target !== "object" && !isFunction( target ) ) { + target = {}; + } + + // Extend jQuery itself if only one argument is passed + if ( i === length ) { + target = this; + i--; + } + + for ( ; i < length; i++ ) { + + // Only deal with non-null/undefined values + if ( ( options = arguments[ i ] ) != null ) { + + // Extend the base object + for ( name in options ) { + copy = options[ name ]; + + // Prevent Object.prototype pollution + // Prevent never-ending loop + if ( name === "__proto__" || target === copy ) { + continue; + } + + // Recurse if we're merging plain objects or arrays + if ( deep && copy && ( jQuery.isPlainObject( copy ) || + ( copyIsArray = Array.isArray( copy ) ) ) ) { + src = target[ name ]; + + // Ensure proper type for the source value + if ( copyIsArray && !Array.isArray( src ) ) { + clone = []; + } else if ( !copyIsArray && !jQuery.isPlainObject( src ) ) { + clone = {}; + } else { + clone = src; + } + copyIsArray = false; + + // Never move original objects, clone them + target[ name ] = jQuery.extend( deep, clone, copy ); + + // Don't bring in undefined values + } else if ( copy !== undefined ) { + target[ name ] = copy; + } + } + } + } + + // Return the modified object + return target; +}; + +jQuery.extend( { + + // Unique for each copy of jQuery on the page + expando: "jQuery" + ( version + Math.random() ).replace( /\D/g, "" ), + + // Assume jQuery is ready without the ready module + isReady: true, + + error: function( msg ) { + throw new Error( msg ); + }, + + noop: function() {}, + + isPlainObject: function( obj ) { + var proto, Ctor; + + // Detect obvious negatives + // Use toString instead of jQuery.type to catch host objects + if ( !obj || toString.call( obj ) !== "[object Object]" ) { + return false; + } + + proto = getProto( obj ); + + // Objects with no prototype (e.g., `Object.create( null )`) are plain + if ( !proto ) { + return true; + } + + // Objects with prototype are plain iff they were constructed by a global Object function + Ctor = hasOwn.call( proto, "constructor" ) && proto.constructor; + return typeof Ctor === "function" && fnToString.call( Ctor ) === ObjectFunctionString; + }, + + isEmptyObject: function( obj ) { + var name; + + for ( name in obj ) { + return false; + } + return true; + }, + + // Evaluates a script in a provided context; falls back to the global one + // if not specified. + globalEval: function( code, options, doc ) { + DOMEval( code, { nonce: options && options.nonce }, doc ); + }, + + each: function( obj, callback ) { + var length, i = 0; + + if ( isArrayLike( obj ) ) { + length = obj.length; + for ( ; i < length; i++ ) { + if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) { + break; + } + } + } else { + for ( i in obj ) { + if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) { + break; + } + } + } + + return obj; + }, + + // results is for internal usage only + makeArray: function( arr, results ) { + var ret = results || []; + + if ( arr != null ) { + if ( isArrayLike( Object( arr ) ) ) { + jQuery.merge( ret, + typeof arr === "string" ? + [ arr ] : arr + ); + } else { + push.call( ret, arr ); + } + } + + return ret; + }, + + inArray: function( elem, arr, i ) { + return arr == null ? -1 : indexOf.call( arr, elem, i ); + }, + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + merge: function( first, second ) { + var len = +second.length, + j = 0, + i = first.length; + + for ( ; j < len; j++ ) { + first[ i++ ] = second[ j ]; + } + + first.length = i; + + return first; + }, + + grep: function( elems, callback, invert ) { + var callbackInverse, + matches = [], + i = 0, + length = elems.length, + callbackExpect = !invert; + + // Go through the array, only saving the items + // that pass the validator function + for ( ; i < length; i++ ) { + callbackInverse = !callback( elems[ i ], i ); + if ( callbackInverse !== callbackExpect ) { + matches.push( elems[ i ] ); + } + } + + return matches; + }, + + // arg is for internal usage only + map: function( elems, callback, arg ) { + var length, value, + i = 0, + ret = []; + + // Go through the array, translating each of the items to their new values + if ( isArrayLike( elems ) ) { + length = elems.length; + for ( ; i < length; i++ ) { + value = callback( elems[ i ], i, arg ); + + if ( value != null ) { + ret.push( value ); + } + } + + // Go through every key on the object, + } else { + for ( i in elems ) { + value = callback( elems[ i ], i, arg ); + + if ( value != null ) { + ret.push( value ); + } + } + } + + // Flatten any nested arrays + return flat( ret ); + }, + + // A global GUID counter for objects + guid: 1, + + // jQuery.support is not used in Core but other projects attach their + // properties to it so it needs to exist. + support: support +} ); + +if ( typeof Symbol === "function" ) { + jQuery.fn[ Symbol.iterator ] = arr[ Symbol.iterator ]; +} + +// Populate the class2type map +jQuery.each( "Boolean Number String Function Array Date RegExp Object Error Symbol".split( " " ), +function( _i, name ) { + class2type[ "[object " + name + "]" ] = name.toLowerCase(); +} ); + +function isArrayLike( obj ) { + + // Support: real iOS 8.2 only (not reproducible in simulator) + // `in` check used to prevent JIT error (gh-2145) + // hasOwn isn't used here due to false negatives + // regarding Nodelist length in IE + var length = !!obj && "length" in obj && obj.length, + type = toType( obj ); + + if ( isFunction( obj ) || isWindow( obj ) ) { + return false; + } + + return type === "array" || length === 0 || + typeof length === "number" && length > 0 && ( length - 1 ) in obj; +} +var Sizzle = +/*! + * Sizzle CSS Selector Engine v2.3.5 + * https://sizzlejs.com/ + * + * Copyright JS Foundation and other contributors + * Released under the MIT license + * https://js.foundation/ + * + * Date: 2020-03-14 + */ +( function( window ) { +var i, + support, + Expr, + getText, + isXML, + tokenize, + compile, + select, + outermostContext, + sortInput, + hasDuplicate, + + // Local document vars + setDocument, + document, + docElem, + documentIsHTML, + rbuggyQSA, + rbuggyMatches, + matches, + contains, + + // Instance-specific data + expando = "sizzle" + 1 * new Date(), + preferredDoc = window.document, + dirruns = 0, + done = 0, + classCache = createCache(), + tokenCache = createCache(), + compilerCache = createCache(), + nonnativeSelectorCache = createCache(), + sortOrder = function( a, b ) { + if ( a === b ) { + hasDuplicate = true; + } + return 0; + }, + + // Instance methods + hasOwn = ( {} ).hasOwnProperty, + arr = [], + pop = arr.pop, + pushNative = arr.push, + push = arr.push, + slice = arr.slice, + + // Use a stripped-down indexOf as it's faster than native + // https://jsperf.com/thor-indexof-vs-for/5 + indexOf = function( list, elem ) { + var i = 0, + len = list.length; + for ( ; i < len; i++ ) { + if ( list[ i ] === elem ) { + return i; + } + } + return -1; + }, + + booleans = "checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|" + + "ismap|loop|multiple|open|readonly|required|scoped", + + // Regular expressions + + // http://www.w3.org/TR/css3-selectors/#whitespace + whitespace = "[\\x20\\t\\r\\n\\f]", + + // https://www.w3.org/TR/css-syntax-3/#ident-token-diagram + identifier = "(?:\\\\[\\da-fA-F]{1,6}" + whitespace + + "?|\\\\[^\\r\\n\\f]|[\\w-]|[^\0-\\x7f])+", + + // Attribute selectors: http://www.w3.org/TR/selectors/#attribute-selectors + attributes = "\\[" + whitespace + "*(" + identifier + ")(?:" + whitespace + + + // Operator (capture 2) + "*([*^$|!~]?=)" + whitespace + + + // "Attribute values must be CSS identifiers [capture 5] + // or strings [capture 3 or capture 4]" + "*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|(" + identifier + "))|)" + + whitespace + "*\\]", + + pseudos = ":(" + identifier + ")(?:\\((" + + + // To reduce the number of selectors needing tokenize in the preFilter, prefer arguments: + // 1. quoted (capture 3; capture 4 or capture 5) + "('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|" + + + // 2. simple (capture 6) + "((?:\\\\.|[^\\\\()[\\]]|" + attributes + ")*)|" + + + // 3. anything else (capture 2) + ".*" + + ")\\)|)", + + // Leading and non-escaped trailing whitespace, capturing some non-whitespace characters preceding the latter + rwhitespace = new RegExp( whitespace + "+", "g" ), + rtrim = new RegExp( "^" + whitespace + "+|((?:^|[^\\\\])(?:\\\\.)*)" + + whitespace + "+$", "g" ), + + rcomma = new RegExp( "^" + whitespace + "*," + whitespace + "*" ), + rcombinators = new RegExp( "^" + whitespace + "*([>+~]|" + whitespace + ")" + whitespace + + "*" ), + rdescend = new RegExp( whitespace + "|>" ), + + rpseudo = new RegExp( pseudos ), + ridentifier = new RegExp( "^" + identifier + "$" ), + + matchExpr = { + "ID": new RegExp( "^#(" + identifier + ")" ), + "CLASS": new RegExp( "^\\.(" + identifier + ")" ), + "TAG": new RegExp( "^(" + identifier + "|[*])" ), + "ATTR": new RegExp( "^" + attributes ), + "PSEUDO": new RegExp( "^" + pseudos ), + "CHILD": new RegExp( "^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\(" + + whitespace + "*(even|odd|(([+-]|)(\\d*)n|)" + whitespace + "*(?:([+-]|)" + + whitespace + "*(\\d+)|))" + whitespace + "*\\)|)", "i" ), + "bool": new RegExp( "^(?:" + booleans + ")$", "i" ), + + // For use in libraries implementing .is() + // We use this for POS matching in `select` + "needsContext": new RegExp( "^" + whitespace + + "*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\(" + whitespace + + "*((?:-\\d)?\\d*)" + whitespace + "*\\)|)(?=[^-]|$)", "i" ) + }, + + rhtml = /HTML$/i, + rinputs = /^(?:input|select|textarea|button)$/i, + rheader = /^h\d$/i, + + rnative = /^[^{]+\{\s*\[native \w/, + + // Easily-parseable/retrievable ID or TAG or CLASS selectors + rquickExpr = /^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/, + + rsibling = /[+~]/, + + // CSS escapes + // http://www.w3.org/TR/CSS21/syndata.html#escaped-characters + runescape = new RegExp( "\\\\[\\da-fA-F]{1,6}" + whitespace + "?|\\\\([^\\r\\n\\f])", "g" ), + funescape = function( escape, nonHex ) { + var high = "0x" + escape.slice( 1 ) - 0x10000; + + return nonHex ? + + // Strip the backslash prefix from a non-hex escape sequence + nonHex : + + // Replace a hexadecimal escape sequence with the encoded Unicode code point + // Support: IE <=11+ + // For values outside the Basic Multilingual Plane (BMP), manually construct a + // surrogate pair + high < 0 ? + String.fromCharCode( high + 0x10000 ) : + String.fromCharCode( high >> 10 | 0xD800, high & 0x3FF | 0xDC00 ); + }, + + // CSS string/identifier serialization + // https://drafts.csswg.org/cssom/#common-serializing-idioms + rcssescape = /([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g, + fcssescape = function( ch, asCodePoint ) { + if ( asCodePoint ) { + + // U+0000 NULL becomes U+FFFD REPLACEMENT CHARACTER + if ( ch === "\0" ) { + return "\uFFFD"; + } + + // Control characters and (dependent upon position) numbers get escaped as code points + return ch.slice( 0, -1 ) + "\\" + + ch.charCodeAt( ch.length - 1 ).toString( 16 ) + " "; + } + + // Other potentially-special ASCII characters get backslash-escaped + return "\\" + ch; + }, + + // Used for iframes + // See setDocument() + // Removing the function wrapper causes a "Permission Denied" + // error in IE + unloadHandler = function() { + setDocument(); + }, + + inDisabledFieldset = addCombinator( + function( elem ) { + return elem.disabled === true && elem.nodeName.toLowerCase() === "fieldset"; + }, + { dir: "parentNode", next: "legend" } + ); + +// Optimize for push.apply( _, NodeList ) +try { + push.apply( + ( arr = slice.call( preferredDoc.childNodes ) ), + preferredDoc.childNodes + ); + + // Support: Android<4.0 + // Detect silently failing push.apply + // eslint-disable-next-line no-unused-expressions + arr[ preferredDoc.childNodes.length ].nodeType; +} catch ( e ) { + push = { apply: arr.length ? + + // Leverage slice if possible + function( target, els ) { + pushNative.apply( target, slice.call( els ) ); + } : + + // Support: IE<9 + // Otherwise append directly + function( target, els ) { + var j = target.length, + i = 0; + + // Can't trust NodeList.length + while ( ( target[ j++ ] = els[ i++ ] ) ) {} + target.length = j - 1; + } + }; +} + +function Sizzle( selector, context, results, seed ) { + var m, i, elem, nid, match, groups, newSelector, + newContext = context && context.ownerDocument, + + // nodeType defaults to 9, since context defaults to document + nodeType = context ? context.nodeType : 9; + + results = results || []; + + // Return early from calls with invalid selector or context + if ( typeof selector !== "string" || !selector || + nodeType !== 1 && nodeType !== 9 && nodeType !== 11 ) { + + return results; + } + + // Try to shortcut find operations (as opposed to filters) in HTML documents + if ( !seed ) { + setDocument( context ); + context = context || document; + + if ( documentIsHTML ) { + + // If the selector is sufficiently simple, try using a "get*By*" DOM method + // (excepting DocumentFragment context, where the methods don't exist) + if ( nodeType !== 11 && ( match = rquickExpr.exec( selector ) ) ) { + + // ID selector + if ( ( m = match[ 1 ] ) ) { + + // Document context + if ( nodeType === 9 ) { + if ( ( elem = context.getElementById( m ) ) ) { + + // Support: IE, Opera, Webkit + // TODO: identify versions + // getElementById can match elements by name instead of ID + if ( elem.id === m ) { + results.push( elem ); + return results; + } + } else { + return results; + } + + // Element context + } else { + + // Support: IE, Opera, Webkit + // TODO: identify versions + // getElementById can match elements by name instead of ID + if ( newContext && ( elem = newContext.getElementById( m ) ) && + contains( context, elem ) && + elem.id === m ) { + + results.push( elem ); + return results; + } + } + + // Type selector + } else if ( match[ 2 ] ) { + push.apply( results, context.getElementsByTagName( selector ) ); + return results; + + // Class selector + } else if ( ( m = match[ 3 ] ) && support.getElementsByClassName && + context.getElementsByClassName ) { + + push.apply( results, context.getElementsByClassName( m ) ); + return results; + } + } + + // Take advantage of querySelectorAll + if ( support.qsa && + !nonnativeSelectorCache[ selector + " " ] && + ( !rbuggyQSA || !rbuggyQSA.test( selector ) ) && + + // Support: IE 8 only + // Exclude object elements + ( nodeType !== 1 || context.nodeName.toLowerCase() !== "object" ) ) { + + newSelector = selector; + newContext = context; + + // qSA considers elements outside a scoping root when evaluating child or + // descendant combinators, which is not what we want. + // In such cases, we work around the behavior by prefixing every selector in the + // list with an ID selector referencing the scope context. + // The technique has to be used as well when a leading combinator is used + // as such selectors are not recognized by querySelectorAll. + // Thanks to Andrew Dupont for this technique. + if ( nodeType === 1 && + ( rdescend.test( selector ) || rcombinators.test( selector ) ) ) { + + // Expand context for sibling selectors + newContext = rsibling.test( selector ) && testContext( context.parentNode ) || + context; + + // We can use :scope instead of the ID hack if the browser + // supports it & if we're not changing the context. + if ( newContext !== context || !support.scope ) { + + // Capture the context ID, setting it first if necessary + if ( ( nid = context.getAttribute( "id" ) ) ) { + nid = nid.replace( rcssescape, fcssescape ); + } else { + context.setAttribute( "id", ( nid = expando ) ); + } + } + + // Prefix every selector in the list + groups = tokenize( selector ); + i = groups.length; + while ( i-- ) { + groups[ i ] = ( nid ? "#" + nid : ":scope" ) + " " + + toSelector( groups[ i ] ); + } + newSelector = groups.join( "," ); + } + + try { + push.apply( results, + newContext.querySelectorAll( newSelector ) + ); + return results; + } catch ( qsaError ) { + nonnativeSelectorCache( selector, true ); + } finally { + if ( nid === expando ) { + context.removeAttribute( "id" ); + } + } + } + } + } + + // All others + return select( selector.replace( rtrim, "$1" ), context, results, seed ); +} + +/** + * Create key-value caches of limited size + * @returns {function(string, object)} Returns the Object data after storing it on itself with + * property name the (space-suffixed) string and (if the cache is larger than Expr.cacheLength) + * deleting the oldest entry + */ +function createCache() { + var keys = []; + + function cache( key, value ) { + + // Use (key + " ") to avoid collision with native prototype properties (see Issue #157) + if ( keys.push( key + " " ) > Expr.cacheLength ) { + + // Only keep the most recent entries + delete cache[ keys.shift() ]; + } + return ( cache[ key + " " ] = value ); + } + return cache; +} + +/** + * Mark a function for special use by Sizzle + * @param {Function} fn The function to mark + */ +function markFunction( fn ) { + fn[ expando ] = true; + return fn; +} + +/** + * Support testing using an element + * @param {Function} fn Passed the created element and returns a boolean result + */ +function assert( fn ) { + var el = document.createElement( "fieldset" ); + + try { + return !!fn( el ); + } catch ( e ) { + return false; + } finally { + + // Remove from its parent by default + if ( el.parentNode ) { + el.parentNode.removeChild( el ); + } + + // release memory in IE + el = null; + } +} + +/** + * Adds the same handler for all of the specified attrs + * @param {String} attrs Pipe-separated list of attributes + * @param {Function} handler The method that will be applied + */ +function addHandle( attrs, handler ) { + var arr = attrs.split( "|" ), + i = arr.length; + + while ( i-- ) { + Expr.attrHandle[ arr[ i ] ] = handler; + } +} + +/** + * Checks document order of two siblings + * @param {Element} a + * @param {Element} b + * @returns {Number} Returns less than 0 if a precedes b, greater than 0 if a follows b + */ +function siblingCheck( a, b ) { + var cur = b && a, + diff = cur && a.nodeType === 1 && b.nodeType === 1 && + a.sourceIndex - b.sourceIndex; + + // Use IE sourceIndex if available on both nodes + if ( diff ) { + return diff; + } + + // Check if b follows a + if ( cur ) { + while ( ( cur = cur.nextSibling ) ) { + if ( cur === b ) { + return -1; + } + } + } + + return a ? 1 : -1; +} + +/** + * Returns a function to use in pseudos for input types + * @param {String} type + */ +function createInputPseudo( type ) { + return function( elem ) { + var name = elem.nodeName.toLowerCase(); + return name === "input" && elem.type === type; + }; +} + +/** + * Returns a function to use in pseudos for buttons + * @param {String} type + */ +function createButtonPseudo( type ) { + return function( elem ) { + var name = elem.nodeName.toLowerCase(); + return ( name === "input" || name === "button" ) && elem.type === type; + }; +} + +/** + * Returns a function to use in pseudos for :enabled/:disabled + * @param {Boolean} disabled true for :disabled; false for :enabled + */ +function createDisabledPseudo( disabled ) { + + // Known :disabled false positives: fieldset[disabled] > legend:nth-of-type(n+2) :can-disable + return function( elem ) { + + // Only certain elements can match :enabled or :disabled + // https://html.spec.whatwg.org/multipage/scripting.html#selector-enabled + // https://html.spec.whatwg.org/multipage/scripting.html#selector-disabled + if ( "form" in elem ) { + + // Check for inherited disabledness on relevant non-disabled elements: + // * listed form-associated elements in a disabled fieldset + // https://html.spec.whatwg.org/multipage/forms.html#category-listed + // https://html.spec.whatwg.org/multipage/forms.html#concept-fe-disabled + // * option elements in a disabled optgroup + // https://html.spec.whatwg.org/multipage/forms.html#concept-option-disabled + // All such elements have a "form" property. + if ( elem.parentNode && elem.disabled === false ) { + + // Option elements defer to a parent optgroup if present + if ( "label" in elem ) { + if ( "label" in elem.parentNode ) { + return elem.parentNode.disabled === disabled; + } else { + return elem.disabled === disabled; + } + } + + // Support: IE 6 - 11 + // Use the isDisabled shortcut property to check for disabled fieldset ancestors + return elem.isDisabled === disabled || + + // Where there is no isDisabled, check manually + /* jshint -W018 */ + elem.isDisabled !== !disabled && + inDisabledFieldset( elem ) === disabled; + } + + return elem.disabled === disabled; + + // Try to winnow out elements that can't be disabled before trusting the disabled property. + // Some victims get caught in our net (label, legend, menu, track), but it shouldn't + // even exist on them, let alone have a boolean value. + } else if ( "label" in elem ) { + return elem.disabled === disabled; + } + + // Remaining elements are neither :enabled nor :disabled + return false; + }; +} + +/** + * Returns a function to use in pseudos for positionals + * @param {Function} fn + */ +function createPositionalPseudo( fn ) { + return markFunction( function( argument ) { + argument = +argument; + return markFunction( function( seed, matches ) { + var j, + matchIndexes = fn( [], seed.length, argument ), + i = matchIndexes.length; + + // Match elements found at the specified indexes + while ( i-- ) { + if ( seed[ ( j = matchIndexes[ i ] ) ] ) { + seed[ j ] = !( matches[ j ] = seed[ j ] ); + } + } + } ); + } ); +} + +/** + * Checks a node for validity as a Sizzle context + * @param {Element|Object=} context + * @returns {Element|Object|Boolean} The input node if acceptable, otherwise a falsy value + */ +function testContext( context ) { + return context && typeof context.getElementsByTagName !== "undefined" && context; +} + +// Expose support vars for convenience +support = Sizzle.support = {}; + +/** + * Detects XML nodes + * @param {Element|Object} elem An element or a document + * @returns {Boolean} True iff elem is a non-HTML XML node + */ +isXML = Sizzle.isXML = function( elem ) { + var namespace = elem.namespaceURI, + docElem = ( elem.ownerDocument || elem ).documentElement; + + // Support: IE <=8 + // Assume HTML when documentElement doesn't yet exist, such as inside loading iframes + // https://bugs.jquery.com/ticket/4833 + return !rhtml.test( namespace || docElem && docElem.nodeName || "HTML" ); +}; + +/** + * Sets document-related variables once based on the current document + * @param {Element|Object} [doc] An element or document object to use to set the document + * @returns {Object} Returns the current document + */ +setDocument = Sizzle.setDocument = function( node ) { + var hasCompare, subWindow, + doc = node ? node.ownerDocument || node : preferredDoc; + + // Return early if doc is invalid or already selected + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( doc == document || doc.nodeType !== 9 || !doc.documentElement ) { + return document; + } + + // Update global variables + document = doc; + docElem = document.documentElement; + documentIsHTML = !isXML( document ); + + // Support: IE 9 - 11+, Edge 12 - 18+ + // Accessing iframe documents after unload throws "permission denied" errors (jQuery #13936) + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( preferredDoc != document && + ( subWindow = document.defaultView ) && subWindow.top !== subWindow ) { + + // Support: IE 11, Edge + if ( subWindow.addEventListener ) { + subWindow.addEventListener( "unload", unloadHandler, false ); + + // Support: IE 9 - 10 only + } else if ( subWindow.attachEvent ) { + subWindow.attachEvent( "onunload", unloadHandler ); + } + } + + // Support: IE 8 - 11+, Edge 12 - 18+, Chrome <=16 - 25 only, Firefox <=3.6 - 31 only, + // Safari 4 - 5 only, Opera <=11.6 - 12.x only + // IE/Edge & older browsers don't support the :scope pseudo-class. + // Support: Safari 6.0 only + // Safari 6.0 supports :scope but it's an alias of :root there. + support.scope = assert( function( el ) { + docElem.appendChild( el ).appendChild( document.createElement( "div" ) ); + return typeof el.querySelectorAll !== "undefined" && + !el.querySelectorAll( ":scope fieldset div" ).length; + } ); + + /* Attributes + ---------------------------------------------------------------------- */ + + // Support: IE<8 + // Verify that getAttribute really returns attributes and not properties + // (excepting IE8 booleans) + support.attributes = assert( function( el ) { + el.className = "i"; + return !el.getAttribute( "className" ); + } ); + + /* getElement(s)By* + ---------------------------------------------------------------------- */ + + // Check if getElementsByTagName("*") returns only elements + support.getElementsByTagName = assert( function( el ) { + el.appendChild( document.createComment( "" ) ); + return !el.getElementsByTagName( "*" ).length; + } ); + + // Support: IE<9 + support.getElementsByClassName = rnative.test( document.getElementsByClassName ); + + // Support: IE<10 + // Check if getElementById returns elements by name + // The broken getElementById methods don't pick up programmatically-set names, + // so use a roundabout getElementsByName test + support.getById = assert( function( el ) { + docElem.appendChild( el ).id = expando; + return !document.getElementsByName || !document.getElementsByName( expando ).length; + } ); + + // ID filter and find + if ( support.getById ) { + Expr.filter[ "ID" ] = function( id ) { + var attrId = id.replace( runescape, funescape ); + return function( elem ) { + return elem.getAttribute( "id" ) === attrId; + }; + }; + Expr.find[ "ID" ] = function( id, context ) { + if ( typeof context.getElementById !== "undefined" && documentIsHTML ) { + var elem = context.getElementById( id ); + return elem ? [ elem ] : []; + } + }; + } else { + Expr.filter[ "ID" ] = function( id ) { + var attrId = id.replace( runescape, funescape ); + return function( elem ) { + var node = typeof elem.getAttributeNode !== "undefined" && + elem.getAttributeNode( "id" ); + return node && node.value === attrId; + }; + }; + + // Support: IE 6 - 7 only + // getElementById is not reliable as a find shortcut + Expr.find[ "ID" ] = function( id, context ) { + if ( typeof context.getElementById !== "undefined" && documentIsHTML ) { + var node, i, elems, + elem = context.getElementById( id ); + + if ( elem ) { + + // Verify the id attribute + node = elem.getAttributeNode( "id" ); + if ( node && node.value === id ) { + return [ elem ]; + } + + // Fall back on getElementsByName + elems = context.getElementsByName( id ); + i = 0; + while ( ( elem = elems[ i++ ] ) ) { + node = elem.getAttributeNode( "id" ); + if ( node && node.value === id ) { + return [ elem ]; + } + } + } + + return []; + } + }; + } + + // Tag + Expr.find[ "TAG" ] = support.getElementsByTagName ? + function( tag, context ) { + if ( typeof context.getElementsByTagName !== "undefined" ) { + return context.getElementsByTagName( tag ); + + // DocumentFragment nodes don't have gEBTN + } else if ( support.qsa ) { + return context.querySelectorAll( tag ); + } + } : + + function( tag, context ) { + var elem, + tmp = [], + i = 0, + + // By happy coincidence, a (broken) gEBTN appears on DocumentFragment nodes too + results = context.getElementsByTagName( tag ); + + // Filter out possible comments + if ( tag === "*" ) { + while ( ( elem = results[ i++ ] ) ) { + if ( elem.nodeType === 1 ) { + tmp.push( elem ); + } + } + + return tmp; + } + return results; + }; + + // Class + Expr.find[ "CLASS" ] = support.getElementsByClassName && function( className, context ) { + if ( typeof context.getElementsByClassName !== "undefined" && documentIsHTML ) { + return context.getElementsByClassName( className ); + } + }; + + /* QSA/matchesSelector + ---------------------------------------------------------------------- */ + + // QSA and matchesSelector support + + // matchesSelector(:active) reports false when true (IE9/Opera 11.5) + rbuggyMatches = []; + + // qSa(:focus) reports false when true (Chrome 21) + // We allow this because of a bug in IE8/9 that throws an error + // whenever `document.activeElement` is accessed on an iframe + // So, we allow :focus to pass through QSA all the time to avoid the IE error + // See https://bugs.jquery.com/ticket/13378 + rbuggyQSA = []; + + if ( ( support.qsa = rnative.test( document.querySelectorAll ) ) ) { + + // Build QSA regex + // Regex strategy adopted from Diego Perini + assert( function( el ) { + + var input; + + // Select is set to empty string on purpose + // This is to test IE's treatment of not explicitly + // setting a boolean content attribute, + // since its presence should be enough + // https://bugs.jquery.com/ticket/12359 + docElem.appendChild( el ).innerHTML = "" + + ""; + + // Support: IE8, Opera 11-12.16 + // Nothing should be selected when empty strings follow ^= or $= or *= + // The test attribute must be unknown in Opera but "safe" for WinRT + // https://msdn.microsoft.com/en-us/library/ie/hh465388.aspx#attribute_section + if ( el.querySelectorAll( "[msallowcapture^='']" ).length ) { + rbuggyQSA.push( "[*^$]=" + whitespace + "*(?:''|\"\")" ); + } + + // Support: IE8 + // Boolean attributes and "value" are not treated correctly + if ( !el.querySelectorAll( "[selected]" ).length ) { + rbuggyQSA.push( "\\[" + whitespace + "*(?:value|" + booleans + ")" ); + } + + // Support: Chrome<29, Android<4.4, Safari<7.0+, iOS<7.0+, PhantomJS<1.9.8+ + if ( !el.querySelectorAll( "[id~=" + expando + "-]" ).length ) { + rbuggyQSA.push( "~=" ); + } + + // Support: IE 11+, Edge 15 - 18+ + // IE 11/Edge don't find elements on a `[name='']` query in some cases. + // Adding a temporary attribute to the document before the selection works + // around the issue. + // Interestingly, IE 10 & older don't seem to have the issue. + input = document.createElement( "input" ); + input.setAttribute( "name", "" ); + el.appendChild( input ); + if ( !el.querySelectorAll( "[name='']" ).length ) { + rbuggyQSA.push( "\\[" + whitespace + "*name" + whitespace + "*=" + + whitespace + "*(?:''|\"\")" ); + } + + // Webkit/Opera - :checked should return selected option elements + // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked + // IE8 throws error here and will not see later tests + if ( !el.querySelectorAll( ":checked" ).length ) { + rbuggyQSA.push( ":checked" ); + } + + // Support: Safari 8+, iOS 8+ + // https://bugs.webkit.org/show_bug.cgi?id=136851 + // In-page `selector#id sibling-combinator selector` fails + if ( !el.querySelectorAll( "a#" + expando + "+*" ).length ) { + rbuggyQSA.push( ".#.+[+~]" ); + } + + // Support: Firefox <=3.6 - 5 only + // Old Firefox doesn't throw on a badly-escaped identifier. + el.querySelectorAll( "\\\f" ); + rbuggyQSA.push( "[\\r\\n\\f]" ); + } ); + + assert( function( el ) { + el.innerHTML = "" + + ""; + + // Support: Windows 8 Native Apps + // The type and name attributes are restricted during .innerHTML assignment + var input = document.createElement( "input" ); + input.setAttribute( "type", "hidden" ); + el.appendChild( input ).setAttribute( "name", "D" ); + + // Support: IE8 + // Enforce case-sensitivity of name attribute + if ( el.querySelectorAll( "[name=d]" ).length ) { + rbuggyQSA.push( "name" + whitespace + "*[*^$|!~]?=" ); + } + + // FF 3.5 - :enabled/:disabled and hidden elements (hidden elements are still enabled) + // IE8 throws error here and will not see later tests + if ( el.querySelectorAll( ":enabled" ).length !== 2 ) { + rbuggyQSA.push( ":enabled", ":disabled" ); + } + + // Support: IE9-11+ + // IE's :disabled selector does not pick up the children of disabled fieldsets + docElem.appendChild( el ).disabled = true; + if ( el.querySelectorAll( ":disabled" ).length !== 2 ) { + rbuggyQSA.push( ":enabled", ":disabled" ); + } + + // Support: Opera 10 - 11 only + // Opera 10-11 does not throw on post-comma invalid pseudos + el.querySelectorAll( "*,:x" ); + rbuggyQSA.push( ",.*:" ); + } ); + } + + if ( ( support.matchesSelector = rnative.test( ( matches = docElem.matches || + docElem.webkitMatchesSelector || + docElem.mozMatchesSelector || + docElem.oMatchesSelector || + docElem.msMatchesSelector ) ) ) ) { + + assert( function( el ) { + + // Check to see if it's possible to do matchesSelector + // on a disconnected node (IE 9) + support.disconnectedMatch = matches.call( el, "*" ); + + // This should fail with an exception + // Gecko does not error, returns false instead + matches.call( el, "[s!='']:x" ); + rbuggyMatches.push( "!=", pseudos ); + } ); + } + + rbuggyQSA = rbuggyQSA.length && new RegExp( rbuggyQSA.join( "|" ) ); + rbuggyMatches = rbuggyMatches.length && new RegExp( rbuggyMatches.join( "|" ) ); + + /* Contains + ---------------------------------------------------------------------- */ + hasCompare = rnative.test( docElem.compareDocumentPosition ); + + // Element contains another + // Purposefully self-exclusive + // As in, an element does not contain itself + contains = hasCompare || rnative.test( docElem.contains ) ? + function( a, b ) { + var adown = a.nodeType === 9 ? a.documentElement : a, + bup = b && b.parentNode; + return a === bup || !!( bup && bup.nodeType === 1 && ( + adown.contains ? + adown.contains( bup ) : + a.compareDocumentPosition && a.compareDocumentPosition( bup ) & 16 + ) ); + } : + function( a, b ) { + if ( b ) { + while ( ( b = b.parentNode ) ) { + if ( b === a ) { + return true; + } + } + } + return false; + }; + + /* Sorting + ---------------------------------------------------------------------- */ + + // Document order sorting + sortOrder = hasCompare ? + function( a, b ) { + + // Flag for duplicate removal + if ( a === b ) { + hasDuplicate = true; + return 0; + } + + // Sort on method existence if only one input has compareDocumentPosition + var compare = !a.compareDocumentPosition - !b.compareDocumentPosition; + if ( compare ) { + return compare; + } + + // Calculate position if both inputs belong to the same document + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + compare = ( a.ownerDocument || a ) == ( b.ownerDocument || b ) ? + a.compareDocumentPosition( b ) : + + // Otherwise we know they are disconnected + 1; + + // Disconnected nodes + if ( compare & 1 || + ( !support.sortDetached && b.compareDocumentPosition( a ) === compare ) ) { + + // Choose the first element that is related to our preferred document + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( a == document || a.ownerDocument == preferredDoc && + contains( preferredDoc, a ) ) { + return -1; + } + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( b == document || b.ownerDocument == preferredDoc && + contains( preferredDoc, b ) ) { + return 1; + } + + // Maintain original order + return sortInput ? + ( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) : + 0; + } + + return compare & 4 ? -1 : 1; + } : + function( a, b ) { + + // Exit early if the nodes are identical + if ( a === b ) { + hasDuplicate = true; + return 0; + } + + var cur, + i = 0, + aup = a.parentNode, + bup = b.parentNode, + ap = [ a ], + bp = [ b ]; + + // Parentless nodes are either documents or disconnected + if ( !aup || !bup ) { + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + /* eslint-disable eqeqeq */ + return a == document ? -1 : + b == document ? 1 : + /* eslint-enable eqeqeq */ + aup ? -1 : + bup ? 1 : + sortInput ? + ( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) : + 0; + + // If the nodes are siblings, we can do a quick check + } else if ( aup === bup ) { + return siblingCheck( a, b ); + } + + // Otherwise we need full lists of their ancestors for comparison + cur = a; + while ( ( cur = cur.parentNode ) ) { + ap.unshift( cur ); + } + cur = b; + while ( ( cur = cur.parentNode ) ) { + bp.unshift( cur ); + } + + // Walk down the tree looking for a discrepancy + while ( ap[ i ] === bp[ i ] ) { + i++; + } + + return i ? + + // Do a sibling check if the nodes have a common ancestor + siblingCheck( ap[ i ], bp[ i ] ) : + + // Otherwise nodes in our document sort first + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + /* eslint-disable eqeqeq */ + ap[ i ] == preferredDoc ? -1 : + bp[ i ] == preferredDoc ? 1 : + /* eslint-enable eqeqeq */ + 0; + }; + + return document; +}; + +Sizzle.matches = function( expr, elements ) { + return Sizzle( expr, null, null, elements ); +}; + +Sizzle.matchesSelector = function( elem, expr ) { + setDocument( elem ); + + if ( support.matchesSelector && documentIsHTML && + !nonnativeSelectorCache[ expr + " " ] && + ( !rbuggyMatches || !rbuggyMatches.test( expr ) ) && + ( !rbuggyQSA || !rbuggyQSA.test( expr ) ) ) { + + try { + var ret = matches.call( elem, expr ); + + // IE 9's matchesSelector returns false on disconnected nodes + if ( ret || support.disconnectedMatch || + + // As well, disconnected nodes are said to be in a document + // fragment in IE 9 + elem.document && elem.document.nodeType !== 11 ) { + return ret; + } + } catch ( e ) { + nonnativeSelectorCache( expr, true ); + } + } + + return Sizzle( expr, document, null, [ elem ] ).length > 0; +}; + +Sizzle.contains = function( context, elem ) { + + // Set document vars if needed + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( ( context.ownerDocument || context ) != document ) { + setDocument( context ); + } + return contains( context, elem ); +}; + +Sizzle.attr = function( elem, name ) { + + // Set document vars if needed + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( ( elem.ownerDocument || elem ) != document ) { + setDocument( elem ); + } + + var fn = Expr.attrHandle[ name.toLowerCase() ], + + // Don't get fooled by Object.prototype properties (jQuery #13807) + val = fn && hasOwn.call( Expr.attrHandle, name.toLowerCase() ) ? + fn( elem, name, !documentIsHTML ) : + undefined; + + return val !== undefined ? + val : + support.attributes || !documentIsHTML ? + elem.getAttribute( name ) : + ( val = elem.getAttributeNode( name ) ) && val.specified ? + val.value : + null; +}; + +Sizzle.escape = function( sel ) { + return ( sel + "" ).replace( rcssescape, fcssescape ); +}; + +Sizzle.error = function( msg ) { + throw new Error( "Syntax error, unrecognized expression: " + msg ); +}; + +/** + * Document sorting and removing duplicates + * @param {ArrayLike} results + */ +Sizzle.uniqueSort = function( results ) { + var elem, + duplicates = [], + j = 0, + i = 0; + + // Unless we *know* we can detect duplicates, assume their presence + hasDuplicate = !support.detectDuplicates; + sortInput = !support.sortStable && results.slice( 0 ); + results.sort( sortOrder ); + + if ( hasDuplicate ) { + while ( ( elem = results[ i++ ] ) ) { + if ( elem === results[ i ] ) { + j = duplicates.push( i ); + } + } + while ( j-- ) { + results.splice( duplicates[ j ], 1 ); + } + } + + // Clear input after sorting to release objects + // See https://github.com/jquery/sizzle/pull/225 + sortInput = null; + + return results; +}; + +/** + * Utility function for retrieving the text value of an array of DOM nodes + * @param {Array|Element} elem + */ +getText = Sizzle.getText = function( elem ) { + var node, + ret = "", + i = 0, + nodeType = elem.nodeType; + + if ( !nodeType ) { + + // If no nodeType, this is expected to be an array + while ( ( node = elem[ i++ ] ) ) { + + // Do not traverse comment nodes + ret += getText( node ); + } + } else if ( nodeType === 1 || nodeType === 9 || nodeType === 11 ) { + + // Use textContent for elements + // innerText usage removed for consistency of new lines (jQuery #11153) + if ( typeof elem.textContent === "string" ) { + return elem.textContent; + } else { + + // Traverse its children + for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) { + ret += getText( elem ); + } + } + } else if ( nodeType === 3 || nodeType === 4 ) { + return elem.nodeValue; + } + + // Do not include comment or processing instruction nodes + + return ret; +}; + +Expr = Sizzle.selectors = { + + // Can be adjusted by the user + cacheLength: 50, + + createPseudo: markFunction, + + match: matchExpr, + + attrHandle: {}, + + find: {}, + + relative: { + ">": { dir: "parentNode", first: true }, + " ": { dir: "parentNode" }, + "+": { dir: "previousSibling", first: true }, + "~": { dir: "previousSibling" } + }, + + preFilter: { + "ATTR": function( match ) { + match[ 1 ] = match[ 1 ].replace( runescape, funescape ); + + // Move the given value to match[3] whether quoted or unquoted + match[ 3 ] = ( match[ 3 ] || match[ 4 ] || + match[ 5 ] || "" ).replace( runescape, funescape ); + + if ( match[ 2 ] === "~=" ) { + match[ 3 ] = " " + match[ 3 ] + " "; + } + + return match.slice( 0, 4 ); + }, + + "CHILD": function( match ) { + + /* matches from matchExpr["CHILD"] + 1 type (only|nth|...) + 2 what (child|of-type) + 3 argument (even|odd|\d*|\d*n([+-]\d+)?|...) + 4 xn-component of xn+y argument ([+-]?\d*n|) + 5 sign of xn-component + 6 x of xn-component + 7 sign of y-component + 8 y of y-component + */ + match[ 1 ] = match[ 1 ].toLowerCase(); + + if ( match[ 1 ].slice( 0, 3 ) === "nth" ) { + + // nth-* requires argument + if ( !match[ 3 ] ) { + Sizzle.error( match[ 0 ] ); + } + + // numeric x and y parameters for Expr.filter.CHILD + // remember that false/true cast respectively to 0/1 + match[ 4 ] = +( match[ 4 ] ? + match[ 5 ] + ( match[ 6 ] || 1 ) : + 2 * ( match[ 3 ] === "even" || match[ 3 ] === "odd" ) ); + match[ 5 ] = +( ( match[ 7 ] + match[ 8 ] ) || match[ 3 ] === "odd" ); + + // other types prohibit arguments + } else if ( match[ 3 ] ) { + Sizzle.error( match[ 0 ] ); + } + + return match; + }, + + "PSEUDO": function( match ) { + var excess, + unquoted = !match[ 6 ] && match[ 2 ]; + + if ( matchExpr[ "CHILD" ].test( match[ 0 ] ) ) { + return null; + } + + // Accept quoted arguments as-is + if ( match[ 3 ] ) { + match[ 2 ] = match[ 4 ] || match[ 5 ] || ""; + + // Strip excess characters from unquoted arguments + } else if ( unquoted && rpseudo.test( unquoted ) && + + // Get excess from tokenize (recursively) + ( excess = tokenize( unquoted, true ) ) && + + // advance to the next closing parenthesis + ( excess = unquoted.indexOf( ")", unquoted.length - excess ) - unquoted.length ) ) { + + // excess is a negative index + match[ 0 ] = match[ 0 ].slice( 0, excess ); + match[ 2 ] = unquoted.slice( 0, excess ); + } + + // Return only captures needed by the pseudo filter method (type and argument) + return match.slice( 0, 3 ); + } + }, + + filter: { + + "TAG": function( nodeNameSelector ) { + var nodeName = nodeNameSelector.replace( runescape, funescape ).toLowerCase(); + return nodeNameSelector === "*" ? + function() { + return true; + } : + function( elem ) { + return elem.nodeName && elem.nodeName.toLowerCase() === nodeName; + }; + }, + + "CLASS": function( className ) { + var pattern = classCache[ className + " " ]; + + return pattern || + ( pattern = new RegExp( "(^|" + whitespace + + ")" + className + "(" + whitespace + "|$)" ) ) && classCache( + className, function( elem ) { + return pattern.test( + typeof elem.className === "string" && elem.className || + typeof elem.getAttribute !== "undefined" && + elem.getAttribute( "class" ) || + "" + ); + } ); + }, + + "ATTR": function( name, operator, check ) { + return function( elem ) { + var result = Sizzle.attr( elem, name ); + + if ( result == null ) { + return operator === "!="; + } + if ( !operator ) { + return true; + } + + result += ""; + + /* eslint-disable max-len */ + + return operator === "=" ? result === check : + operator === "!=" ? result !== check : + operator === "^=" ? check && result.indexOf( check ) === 0 : + operator === "*=" ? check && result.indexOf( check ) > -1 : + operator === "$=" ? check && result.slice( -check.length ) === check : + operator === "~=" ? ( " " + result.replace( rwhitespace, " " ) + " " ).indexOf( check ) > -1 : + operator === "|=" ? result === check || result.slice( 0, check.length + 1 ) === check + "-" : + false; + /* eslint-enable max-len */ + + }; + }, + + "CHILD": function( type, what, _argument, first, last ) { + var simple = type.slice( 0, 3 ) !== "nth", + forward = type.slice( -4 ) !== "last", + ofType = what === "of-type"; + + return first === 1 && last === 0 ? + + // Shortcut for :nth-*(n) + function( elem ) { + return !!elem.parentNode; + } : + + function( elem, _context, xml ) { + var cache, uniqueCache, outerCache, node, nodeIndex, start, + dir = simple !== forward ? "nextSibling" : "previousSibling", + parent = elem.parentNode, + name = ofType && elem.nodeName.toLowerCase(), + useCache = !xml && !ofType, + diff = false; + + if ( parent ) { + + // :(first|last|only)-(child|of-type) + if ( simple ) { + while ( dir ) { + node = elem; + while ( ( node = node[ dir ] ) ) { + if ( ofType ? + node.nodeName.toLowerCase() === name : + node.nodeType === 1 ) { + + return false; + } + } + + // Reverse direction for :only-* (if we haven't yet done so) + start = dir = type === "only" && !start && "nextSibling"; + } + return true; + } + + start = [ forward ? parent.firstChild : parent.lastChild ]; + + // non-xml :nth-child(...) stores cache data on `parent` + if ( forward && useCache ) { + + // Seek `elem` from a previously-cached index + + // ...in a gzip-friendly way + node = parent; + outerCache = node[ expando ] || ( node[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ node.uniqueID ] || + ( outerCache[ node.uniqueID ] = {} ); + + cache = uniqueCache[ type ] || []; + nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ]; + diff = nodeIndex && cache[ 2 ]; + node = nodeIndex && parent.childNodes[ nodeIndex ]; + + while ( ( node = ++nodeIndex && node && node[ dir ] || + + // Fallback to seeking `elem` from the start + ( diff = nodeIndex = 0 ) || start.pop() ) ) { + + // When found, cache indexes on `parent` and break + if ( node.nodeType === 1 && ++diff && node === elem ) { + uniqueCache[ type ] = [ dirruns, nodeIndex, diff ]; + break; + } + } + + } else { + + // Use previously-cached element index if available + if ( useCache ) { + + // ...in a gzip-friendly way + node = elem; + outerCache = node[ expando ] || ( node[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ node.uniqueID ] || + ( outerCache[ node.uniqueID ] = {} ); + + cache = uniqueCache[ type ] || []; + nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ]; + diff = nodeIndex; + } + + // xml :nth-child(...) + // or :nth-last-child(...) or :nth(-last)?-of-type(...) + if ( diff === false ) { + + // Use the same loop as above to seek `elem` from the start + while ( ( node = ++nodeIndex && node && node[ dir ] || + ( diff = nodeIndex = 0 ) || start.pop() ) ) { + + if ( ( ofType ? + node.nodeName.toLowerCase() === name : + node.nodeType === 1 ) && + ++diff ) { + + // Cache the index of each encountered element + if ( useCache ) { + outerCache = node[ expando ] || + ( node[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ node.uniqueID ] || + ( outerCache[ node.uniqueID ] = {} ); + + uniqueCache[ type ] = [ dirruns, diff ]; + } + + if ( node === elem ) { + break; + } + } + } + } + } + + // Incorporate the offset, then check against cycle size + diff -= last; + return diff === first || ( diff % first === 0 && diff / first >= 0 ); + } + }; + }, + + "PSEUDO": function( pseudo, argument ) { + + // pseudo-class names are case-insensitive + // http://www.w3.org/TR/selectors/#pseudo-classes + // Prioritize by case sensitivity in case custom pseudos are added with uppercase letters + // Remember that setFilters inherits from pseudos + var args, + fn = Expr.pseudos[ pseudo ] || Expr.setFilters[ pseudo.toLowerCase() ] || + Sizzle.error( "unsupported pseudo: " + pseudo ); + + // The user may use createPseudo to indicate that + // arguments are needed to create the filter function + // just as Sizzle does + if ( fn[ expando ] ) { + return fn( argument ); + } + + // But maintain support for old signatures + if ( fn.length > 1 ) { + args = [ pseudo, pseudo, "", argument ]; + return Expr.setFilters.hasOwnProperty( pseudo.toLowerCase() ) ? + markFunction( function( seed, matches ) { + var idx, + matched = fn( seed, argument ), + i = matched.length; + while ( i-- ) { + idx = indexOf( seed, matched[ i ] ); + seed[ idx ] = !( matches[ idx ] = matched[ i ] ); + } + } ) : + function( elem ) { + return fn( elem, 0, args ); + }; + } + + return fn; + } + }, + + pseudos: { + + // Potentially complex pseudos + "not": markFunction( function( selector ) { + + // Trim the selector passed to compile + // to avoid treating leading and trailing + // spaces as combinators + var input = [], + results = [], + matcher = compile( selector.replace( rtrim, "$1" ) ); + + return matcher[ expando ] ? + markFunction( function( seed, matches, _context, xml ) { + var elem, + unmatched = matcher( seed, null, xml, [] ), + i = seed.length; + + // Match elements unmatched by `matcher` + while ( i-- ) { + if ( ( elem = unmatched[ i ] ) ) { + seed[ i ] = !( matches[ i ] = elem ); + } + } + } ) : + function( elem, _context, xml ) { + input[ 0 ] = elem; + matcher( input, null, xml, results ); + + // Don't keep the element (issue #299) + input[ 0 ] = null; + return !results.pop(); + }; + } ), + + "has": markFunction( function( selector ) { + return function( elem ) { + return Sizzle( selector, elem ).length > 0; + }; + } ), + + "contains": markFunction( function( text ) { + text = text.replace( runescape, funescape ); + return function( elem ) { + return ( elem.textContent || getText( elem ) ).indexOf( text ) > -1; + }; + } ), + + // "Whether an element is represented by a :lang() selector + // is based solely on the element's language value + // being equal to the identifier C, + // or beginning with the identifier C immediately followed by "-". + // The matching of C against the element's language value is performed case-insensitively. + // The identifier C does not have to be a valid language name." + // http://www.w3.org/TR/selectors/#lang-pseudo + "lang": markFunction( function( lang ) { + + // lang value must be a valid identifier + if ( !ridentifier.test( lang || "" ) ) { + Sizzle.error( "unsupported lang: " + lang ); + } + lang = lang.replace( runescape, funescape ).toLowerCase(); + return function( elem ) { + var elemLang; + do { + if ( ( elemLang = documentIsHTML ? + elem.lang : + elem.getAttribute( "xml:lang" ) || elem.getAttribute( "lang" ) ) ) { + + elemLang = elemLang.toLowerCase(); + return elemLang === lang || elemLang.indexOf( lang + "-" ) === 0; + } + } while ( ( elem = elem.parentNode ) && elem.nodeType === 1 ); + return false; + }; + } ), + + // Miscellaneous + "target": function( elem ) { + var hash = window.location && window.location.hash; + return hash && hash.slice( 1 ) === elem.id; + }, + + "root": function( elem ) { + return elem === docElem; + }, + + "focus": function( elem ) { + return elem === document.activeElement && + ( !document.hasFocus || document.hasFocus() ) && + !!( elem.type || elem.href || ~elem.tabIndex ); + }, + + // Boolean properties + "enabled": createDisabledPseudo( false ), + "disabled": createDisabledPseudo( true ), + + "checked": function( elem ) { + + // In CSS3, :checked should return both checked and selected elements + // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked + var nodeName = elem.nodeName.toLowerCase(); + return ( nodeName === "input" && !!elem.checked ) || + ( nodeName === "option" && !!elem.selected ); + }, + + "selected": function( elem ) { + + // Accessing this property makes selected-by-default + // options in Safari work properly + if ( elem.parentNode ) { + // eslint-disable-next-line no-unused-expressions + elem.parentNode.selectedIndex; + } + + return elem.selected === true; + }, + + // Contents + "empty": function( elem ) { + + // http://www.w3.org/TR/selectors/#empty-pseudo + // :empty is negated by element (1) or content nodes (text: 3; cdata: 4; entity ref: 5), + // but not by others (comment: 8; processing instruction: 7; etc.) + // nodeType < 6 works because attributes (2) do not appear as children + for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) { + if ( elem.nodeType < 6 ) { + return false; + } + } + return true; + }, + + "parent": function( elem ) { + return !Expr.pseudos[ "empty" ]( elem ); + }, + + // Element/input types + "header": function( elem ) { + return rheader.test( elem.nodeName ); + }, + + "input": function( elem ) { + return rinputs.test( elem.nodeName ); + }, + + "button": function( elem ) { + var name = elem.nodeName.toLowerCase(); + return name === "input" && elem.type === "button" || name === "button"; + }, + + "text": function( elem ) { + var attr; + return elem.nodeName.toLowerCase() === "input" && + elem.type === "text" && + + // Support: IE<8 + // New HTML5 attribute values (e.g., "search") appear with elem.type === "text" + ( ( attr = elem.getAttribute( "type" ) ) == null || + attr.toLowerCase() === "text" ); + }, + + // Position-in-collection + "first": createPositionalPseudo( function() { + return [ 0 ]; + } ), + + "last": createPositionalPseudo( function( _matchIndexes, length ) { + return [ length - 1 ]; + } ), + + "eq": createPositionalPseudo( function( _matchIndexes, length, argument ) { + return [ argument < 0 ? argument + length : argument ]; + } ), + + "even": createPositionalPseudo( function( matchIndexes, length ) { + var i = 0; + for ( ; i < length; i += 2 ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ), + + "odd": createPositionalPseudo( function( matchIndexes, length ) { + var i = 1; + for ( ; i < length; i += 2 ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ), + + "lt": createPositionalPseudo( function( matchIndexes, length, argument ) { + var i = argument < 0 ? + argument + length : + argument > length ? + length : + argument; + for ( ; --i >= 0; ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ), + + "gt": createPositionalPseudo( function( matchIndexes, length, argument ) { + var i = argument < 0 ? argument + length : argument; + for ( ; ++i < length; ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ) + } +}; + +Expr.pseudos[ "nth" ] = Expr.pseudos[ "eq" ]; + +// Add button/input type pseudos +for ( i in { radio: true, checkbox: true, file: true, password: true, image: true } ) { + Expr.pseudos[ i ] = createInputPseudo( i ); +} +for ( i in { submit: true, reset: true } ) { + Expr.pseudos[ i ] = createButtonPseudo( i ); +} + +// Easy API for creating new setFilters +function setFilters() {} +setFilters.prototype = Expr.filters = Expr.pseudos; +Expr.setFilters = new setFilters(); + +tokenize = Sizzle.tokenize = function( selector, parseOnly ) { + var matched, match, tokens, type, + soFar, groups, preFilters, + cached = tokenCache[ selector + " " ]; + + if ( cached ) { + return parseOnly ? 0 : cached.slice( 0 ); + } + + soFar = selector; + groups = []; + preFilters = Expr.preFilter; + + while ( soFar ) { + + // Comma and first run + if ( !matched || ( match = rcomma.exec( soFar ) ) ) { + if ( match ) { + + // Don't consume trailing commas as valid + soFar = soFar.slice( match[ 0 ].length ) || soFar; + } + groups.push( ( tokens = [] ) ); + } + + matched = false; + + // Combinators + if ( ( match = rcombinators.exec( soFar ) ) ) { + matched = match.shift(); + tokens.push( { + value: matched, + + // Cast descendant combinators to space + type: match[ 0 ].replace( rtrim, " " ) + } ); + soFar = soFar.slice( matched.length ); + } + + // Filters + for ( type in Expr.filter ) { + if ( ( match = matchExpr[ type ].exec( soFar ) ) && ( !preFilters[ type ] || + ( match = preFilters[ type ]( match ) ) ) ) { + matched = match.shift(); + tokens.push( { + value: matched, + type: type, + matches: match + } ); + soFar = soFar.slice( matched.length ); + } + } + + if ( !matched ) { + break; + } + } + + // Return the length of the invalid excess + // if we're just parsing + // Otherwise, throw an error or return tokens + return parseOnly ? + soFar.length : + soFar ? + Sizzle.error( selector ) : + + // Cache the tokens + tokenCache( selector, groups ).slice( 0 ); +}; + +function toSelector( tokens ) { + var i = 0, + len = tokens.length, + selector = ""; + for ( ; i < len; i++ ) { + selector += tokens[ i ].value; + } + return selector; +} + +function addCombinator( matcher, combinator, base ) { + var dir = combinator.dir, + skip = combinator.next, + key = skip || dir, + checkNonElements = base && key === "parentNode", + doneName = done++; + + return combinator.first ? + + // Check against closest ancestor/preceding element + function( elem, context, xml ) { + while ( ( elem = elem[ dir ] ) ) { + if ( elem.nodeType === 1 || checkNonElements ) { + return matcher( elem, context, xml ); + } + } + return false; + } : + + // Check against all ancestor/preceding elements + function( elem, context, xml ) { + var oldCache, uniqueCache, outerCache, + newCache = [ dirruns, doneName ]; + + // We can't set arbitrary data on XML nodes, so they don't benefit from combinator caching + if ( xml ) { + while ( ( elem = elem[ dir ] ) ) { + if ( elem.nodeType === 1 || checkNonElements ) { + if ( matcher( elem, context, xml ) ) { + return true; + } + } + } + } else { + while ( ( elem = elem[ dir ] ) ) { + if ( elem.nodeType === 1 || checkNonElements ) { + outerCache = elem[ expando ] || ( elem[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ elem.uniqueID ] || + ( outerCache[ elem.uniqueID ] = {} ); + + if ( skip && skip === elem.nodeName.toLowerCase() ) { + elem = elem[ dir ] || elem; + } else if ( ( oldCache = uniqueCache[ key ] ) && + oldCache[ 0 ] === dirruns && oldCache[ 1 ] === doneName ) { + + // Assign to newCache so results back-propagate to previous elements + return ( newCache[ 2 ] = oldCache[ 2 ] ); + } else { + + // Reuse newcache so results back-propagate to previous elements + uniqueCache[ key ] = newCache; + + // A match means we're done; a fail means we have to keep checking + if ( ( newCache[ 2 ] = matcher( elem, context, xml ) ) ) { + return true; + } + } + } + } + } + return false; + }; +} + +function elementMatcher( matchers ) { + return matchers.length > 1 ? + function( elem, context, xml ) { + var i = matchers.length; + while ( i-- ) { + if ( !matchers[ i ]( elem, context, xml ) ) { + return false; + } + } + return true; + } : + matchers[ 0 ]; +} + +function multipleContexts( selector, contexts, results ) { + var i = 0, + len = contexts.length; + for ( ; i < len; i++ ) { + Sizzle( selector, contexts[ i ], results ); + } + return results; +} + +function condense( unmatched, map, filter, context, xml ) { + var elem, + newUnmatched = [], + i = 0, + len = unmatched.length, + mapped = map != null; + + for ( ; i < len; i++ ) { + if ( ( elem = unmatched[ i ] ) ) { + if ( !filter || filter( elem, context, xml ) ) { + newUnmatched.push( elem ); + if ( mapped ) { + map.push( i ); + } + } + } + } + + return newUnmatched; +} + +function setMatcher( preFilter, selector, matcher, postFilter, postFinder, postSelector ) { + if ( postFilter && !postFilter[ expando ] ) { + postFilter = setMatcher( postFilter ); + } + if ( postFinder && !postFinder[ expando ] ) { + postFinder = setMatcher( postFinder, postSelector ); + } + return markFunction( function( seed, results, context, xml ) { + var temp, i, elem, + preMap = [], + postMap = [], + preexisting = results.length, + + // Get initial elements from seed or context + elems = seed || multipleContexts( + selector || "*", + context.nodeType ? [ context ] : context, + [] + ), + + // Prefilter to get matcher input, preserving a map for seed-results synchronization + matcherIn = preFilter && ( seed || !selector ) ? + condense( elems, preMap, preFilter, context, xml ) : + elems, + + matcherOut = matcher ? + + // If we have a postFinder, or filtered seed, or non-seed postFilter or preexisting results, + postFinder || ( seed ? preFilter : preexisting || postFilter ) ? + + // ...intermediate processing is necessary + [] : + + // ...otherwise use results directly + results : + matcherIn; + + // Find primary matches + if ( matcher ) { + matcher( matcherIn, matcherOut, context, xml ); + } + + // Apply postFilter + if ( postFilter ) { + temp = condense( matcherOut, postMap ); + postFilter( temp, [], context, xml ); + + // Un-match failing elements by moving them back to matcherIn + i = temp.length; + while ( i-- ) { + if ( ( elem = temp[ i ] ) ) { + matcherOut[ postMap[ i ] ] = !( matcherIn[ postMap[ i ] ] = elem ); + } + } + } + + if ( seed ) { + if ( postFinder || preFilter ) { + if ( postFinder ) { + + // Get the final matcherOut by condensing this intermediate into postFinder contexts + temp = []; + i = matcherOut.length; + while ( i-- ) { + if ( ( elem = matcherOut[ i ] ) ) { + + // Restore matcherIn since elem is not yet a final match + temp.push( ( matcherIn[ i ] = elem ) ); + } + } + postFinder( null, ( matcherOut = [] ), temp, xml ); + } + + // Move matched elements from seed to results to keep them synchronized + i = matcherOut.length; + while ( i-- ) { + if ( ( elem = matcherOut[ i ] ) && + ( temp = postFinder ? indexOf( seed, elem ) : preMap[ i ] ) > -1 ) { + + seed[ temp ] = !( results[ temp ] = elem ); + } + } + } + + // Add elements to results, through postFinder if defined + } else { + matcherOut = condense( + matcherOut === results ? + matcherOut.splice( preexisting, matcherOut.length ) : + matcherOut + ); + if ( postFinder ) { + postFinder( null, results, matcherOut, xml ); + } else { + push.apply( results, matcherOut ); + } + } + } ); +} + +function matcherFromTokens( tokens ) { + var checkContext, matcher, j, + len = tokens.length, + leadingRelative = Expr.relative[ tokens[ 0 ].type ], + implicitRelative = leadingRelative || Expr.relative[ " " ], + i = leadingRelative ? 1 : 0, + + // The foundational matcher ensures that elements are reachable from top-level context(s) + matchContext = addCombinator( function( elem ) { + return elem === checkContext; + }, implicitRelative, true ), + matchAnyContext = addCombinator( function( elem ) { + return indexOf( checkContext, elem ) > -1; + }, implicitRelative, true ), + matchers = [ function( elem, context, xml ) { + var ret = ( !leadingRelative && ( xml || context !== outermostContext ) ) || ( + ( checkContext = context ).nodeType ? + matchContext( elem, context, xml ) : + matchAnyContext( elem, context, xml ) ); + + // Avoid hanging onto element (issue #299) + checkContext = null; + return ret; + } ]; + + for ( ; i < len; i++ ) { + if ( ( matcher = Expr.relative[ tokens[ i ].type ] ) ) { + matchers = [ addCombinator( elementMatcher( matchers ), matcher ) ]; + } else { + matcher = Expr.filter[ tokens[ i ].type ].apply( null, tokens[ i ].matches ); + + // Return special upon seeing a positional matcher + if ( matcher[ expando ] ) { + + // Find the next relative operator (if any) for proper handling + j = ++i; + for ( ; j < len; j++ ) { + if ( Expr.relative[ tokens[ j ].type ] ) { + break; + } + } + return setMatcher( + i > 1 && elementMatcher( matchers ), + i > 1 && toSelector( + + // If the preceding token was a descendant combinator, insert an implicit any-element `*` + tokens + .slice( 0, i - 1 ) + .concat( { value: tokens[ i - 2 ].type === " " ? "*" : "" } ) + ).replace( rtrim, "$1" ), + matcher, + i < j && matcherFromTokens( tokens.slice( i, j ) ), + j < len && matcherFromTokens( ( tokens = tokens.slice( j ) ) ), + j < len && toSelector( tokens ) + ); + } + matchers.push( matcher ); + } + } + + return elementMatcher( matchers ); +} + +function matcherFromGroupMatchers( elementMatchers, setMatchers ) { + var bySet = setMatchers.length > 0, + byElement = elementMatchers.length > 0, + superMatcher = function( seed, context, xml, results, outermost ) { + var elem, j, matcher, + matchedCount = 0, + i = "0", + unmatched = seed && [], + setMatched = [], + contextBackup = outermostContext, + + // We must always have either seed elements or outermost context + elems = seed || byElement && Expr.find[ "TAG" ]( "*", outermost ), + + // Use integer dirruns iff this is the outermost matcher + dirrunsUnique = ( dirruns += contextBackup == null ? 1 : Math.random() || 0.1 ), + len = elems.length; + + if ( outermost ) { + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + outermostContext = context == document || context || outermost; + } + + // Add elements passing elementMatchers directly to results + // Support: IE<9, Safari + // Tolerate NodeList properties (IE: "length"; Safari: ) matching elements by id + for ( ; i !== len && ( elem = elems[ i ] ) != null; i++ ) { + if ( byElement && elem ) { + j = 0; + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( !context && elem.ownerDocument != document ) { + setDocument( elem ); + xml = !documentIsHTML; + } + while ( ( matcher = elementMatchers[ j++ ] ) ) { + if ( matcher( elem, context || document, xml ) ) { + results.push( elem ); + break; + } + } + if ( outermost ) { + dirruns = dirrunsUnique; + } + } + + // Track unmatched elements for set filters + if ( bySet ) { + + // They will have gone through all possible matchers + if ( ( elem = !matcher && elem ) ) { + matchedCount--; + } + + // Lengthen the array for every element, matched or not + if ( seed ) { + unmatched.push( elem ); + } + } + } + + // `i` is now the count of elements visited above, and adding it to `matchedCount` + // makes the latter nonnegative. + matchedCount += i; + + // Apply set filters to unmatched elements + // NOTE: This can be skipped if there are no unmatched elements (i.e., `matchedCount` + // equals `i`), unless we didn't visit _any_ elements in the above loop because we have + // no element matchers and no seed. + // Incrementing an initially-string "0" `i` allows `i` to remain a string only in that + // case, which will result in a "00" `matchedCount` that differs from `i` but is also + // numerically zero. + if ( bySet && i !== matchedCount ) { + j = 0; + while ( ( matcher = setMatchers[ j++ ] ) ) { + matcher( unmatched, setMatched, context, xml ); + } + + if ( seed ) { + + // Reintegrate element matches to eliminate the need for sorting + if ( matchedCount > 0 ) { + while ( i-- ) { + if ( !( unmatched[ i ] || setMatched[ i ] ) ) { + setMatched[ i ] = pop.call( results ); + } + } + } + + // Discard index placeholder values to get only actual matches + setMatched = condense( setMatched ); + } + + // Add matches to results + push.apply( results, setMatched ); + + // Seedless set matches succeeding multiple successful matchers stipulate sorting + if ( outermost && !seed && setMatched.length > 0 && + ( matchedCount + setMatchers.length ) > 1 ) { + + Sizzle.uniqueSort( results ); + } + } + + // Override manipulation of globals by nested matchers + if ( outermost ) { + dirruns = dirrunsUnique; + outermostContext = contextBackup; + } + + return unmatched; + }; + + return bySet ? + markFunction( superMatcher ) : + superMatcher; +} + +compile = Sizzle.compile = function( selector, match /* Internal Use Only */ ) { + var i, + setMatchers = [], + elementMatchers = [], + cached = compilerCache[ selector + " " ]; + + if ( !cached ) { + + // Generate a function of recursive functions that can be used to check each element + if ( !match ) { + match = tokenize( selector ); + } + i = match.length; + while ( i-- ) { + cached = matcherFromTokens( match[ i ] ); + if ( cached[ expando ] ) { + setMatchers.push( cached ); + } else { + elementMatchers.push( cached ); + } + } + + // Cache the compiled function + cached = compilerCache( + selector, + matcherFromGroupMatchers( elementMatchers, setMatchers ) + ); + + // Save selector and tokenization + cached.selector = selector; + } + return cached; +}; + +/** + * A low-level selection function that works with Sizzle's compiled + * selector functions + * @param {String|Function} selector A selector or a pre-compiled + * selector function built with Sizzle.compile + * @param {Element} context + * @param {Array} [results] + * @param {Array} [seed] A set of elements to match against + */ +select = Sizzle.select = function( selector, context, results, seed ) { + var i, tokens, token, type, find, + compiled = typeof selector === "function" && selector, + match = !seed && tokenize( ( selector = compiled.selector || selector ) ); + + results = results || []; + + // Try to minimize operations if there is only one selector in the list and no seed + // (the latter of which guarantees us context) + if ( match.length === 1 ) { + + // Reduce context if the leading compound selector is an ID + tokens = match[ 0 ] = match[ 0 ].slice( 0 ); + if ( tokens.length > 2 && ( token = tokens[ 0 ] ).type === "ID" && + context.nodeType === 9 && documentIsHTML && Expr.relative[ tokens[ 1 ].type ] ) { + + context = ( Expr.find[ "ID" ]( token.matches[ 0 ] + .replace( runescape, funescape ), context ) || [] )[ 0 ]; + if ( !context ) { + return results; + + // Precompiled matchers will still verify ancestry, so step up a level + } else if ( compiled ) { + context = context.parentNode; + } + + selector = selector.slice( tokens.shift().value.length ); + } + + // Fetch a seed set for right-to-left matching + i = matchExpr[ "needsContext" ].test( selector ) ? 0 : tokens.length; + while ( i-- ) { + token = tokens[ i ]; + + // Abort if we hit a combinator + if ( Expr.relative[ ( type = token.type ) ] ) { + break; + } + if ( ( find = Expr.find[ type ] ) ) { + + // Search, expanding context for leading sibling combinators + if ( ( seed = find( + token.matches[ 0 ].replace( runescape, funescape ), + rsibling.test( tokens[ 0 ].type ) && testContext( context.parentNode ) || + context + ) ) ) { + + // If seed is empty or no tokens remain, we can return early + tokens.splice( i, 1 ); + selector = seed.length && toSelector( tokens ); + if ( !selector ) { + push.apply( results, seed ); + return results; + } + + break; + } + } + } + } + + // Compile and execute a filtering function if one is not provided + // Provide `match` to avoid retokenization if we modified the selector above + ( compiled || compile( selector, match ) )( + seed, + context, + !documentIsHTML, + results, + !context || rsibling.test( selector ) && testContext( context.parentNode ) || context + ); + return results; +}; + +// One-time assignments + +// Sort stability +support.sortStable = expando.split( "" ).sort( sortOrder ).join( "" ) === expando; + +// Support: Chrome 14-35+ +// Always assume duplicates if they aren't passed to the comparison function +support.detectDuplicates = !!hasDuplicate; + +// Initialize against the default document +setDocument(); + +// Support: Webkit<537.32 - Safari 6.0.3/Chrome 25 (fixed in Chrome 27) +// Detached nodes confoundingly follow *each other* +support.sortDetached = assert( function( el ) { + + // Should return 1, but returns 4 (following) + return el.compareDocumentPosition( document.createElement( "fieldset" ) ) & 1; +} ); + +// Support: IE<8 +// Prevent attribute/property "interpolation" +// https://msdn.microsoft.com/en-us/library/ms536429%28VS.85%29.aspx +if ( !assert( function( el ) { + el.innerHTML = ""; + return el.firstChild.getAttribute( "href" ) === "#"; +} ) ) { + addHandle( "type|href|height|width", function( elem, name, isXML ) { + if ( !isXML ) { + return elem.getAttribute( name, name.toLowerCase() === "type" ? 1 : 2 ); + } + } ); +} + +// Support: IE<9 +// Use defaultValue in place of getAttribute("value") +if ( !support.attributes || !assert( function( el ) { + el.innerHTML = ""; + el.firstChild.setAttribute( "value", "" ); + return el.firstChild.getAttribute( "value" ) === ""; +} ) ) { + addHandle( "value", function( elem, _name, isXML ) { + if ( !isXML && elem.nodeName.toLowerCase() === "input" ) { + return elem.defaultValue; + } + } ); +} + +// Support: IE<9 +// Use getAttributeNode to fetch booleans when getAttribute lies +if ( !assert( function( el ) { + return el.getAttribute( "disabled" ) == null; +} ) ) { + addHandle( booleans, function( elem, name, isXML ) { + var val; + if ( !isXML ) { + return elem[ name ] === true ? name.toLowerCase() : + ( val = elem.getAttributeNode( name ) ) && val.specified ? + val.value : + null; + } + } ); +} + +return Sizzle; + +} )( window ); + + + +jQuery.find = Sizzle; +jQuery.expr = Sizzle.selectors; + +// Deprecated +jQuery.expr[ ":" ] = jQuery.expr.pseudos; +jQuery.uniqueSort = jQuery.unique = Sizzle.uniqueSort; +jQuery.text = Sizzle.getText; +jQuery.isXMLDoc = Sizzle.isXML; +jQuery.contains = Sizzle.contains; +jQuery.escapeSelector = Sizzle.escape; + + + + +var dir = function( elem, dir, until ) { + var matched = [], + truncate = until !== undefined; + + while ( ( elem = elem[ dir ] ) && elem.nodeType !== 9 ) { + if ( elem.nodeType === 1 ) { + if ( truncate && jQuery( elem ).is( until ) ) { + break; + } + matched.push( elem ); + } + } + return matched; +}; + + +var siblings = function( n, elem ) { + var matched = []; + + for ( ; n; n = n.nextSibling ) { + if ( n.nodeType === 1 && n !== elem ) { + matched.push( n ); + } + } + + return matched; +}; + + +var rneedsContext = jQuery.expr.match.needsContext; + + + +function nodeName( elem, name ) { + + return elem.nodeName && elem.nodeName.toLowerCase() === name.toLowerCase(); + +}; +var rsingleTag = ( /^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i ); + + + +// Implement the identical functionality for filter and not +function winnow( elements, qualifier, not ) { + if ( isFunction( qualifier ) ) { + return jQuery.grep( elements, function( elem, i ) { + return !!qualifier.call( elem, i, elem ) !== not; + } ); + } + + // Single element + if ( qualifier.nodeType ) { + return jQuery.grep( elements, function( elem ) { + return ( elem === qualifier ) !== not; + } ); + } + + // Arraylike of elements (jQuery, arguments, Array) + if ( typeof qualifier !== "string" ) { + return jQuery.grep( elements, function( elem ) { + return ( indexOf.call( qualifier, elem ) > -1 ) !== not; + } ); + } + + // Filtered directly for both simple and complex selectors + return jQuery.filter( qualifier, elements, not ); +} + +jQuery.filter = function( expr, elems, not ) { + var elem = elems[ 0 ]; + + if ( not ) { + expr = ":not(" + expr + ")"; + } + + if ( elems.length === 1 && elem.nodeType === 1 ) { + return jQuery.find.matchesSelector( elem, expr ) ? [ elem ] : []; + } + + return jQuery.find.matches( expr, jQuery.grep( elems, function( elem ) { + return elem.nodeType === 1; + } ) ); +}; + +jQuery.fn.extend( { + find: function( selector ) { + var i, ret, + len = this.length, + self = this; + + if ( typeof selector !== "string" ) { + return this.pushStack( jQuery( selector ).filter( function() { + for ( i = 0; i < len; i++ ) { + if ( jQuery.contains( self[ i ], this ) ) { + return true; + } + } + } ) ); + } + + ret = this.pushStack( [] ); + + for ( i = 0; i < len; i++ ) { + jQuery.find( selector, self[ i ], ret ); + } + + return len > 1 ? jQuery.uniqueSort( ret ) : ret; + }, + filter: function( selector ) { + return this.pushStack( winnow( this, selector || [], false ) ); + }, + not: function( selector ) { + return this.pushStack( winnow( this, selector || [], true ) ); + }, + is: function( selector ) { + return !!winnow( + this, + + // If this is a positional/relative selector, check membership in the returned set + // so $("p:first").is("p:last") won't return true for a doc with two "p". + typeof selector === "string" && rneedsContext.test( selector ) ? + jQuery( selector ) : + selector || [], + false + ).length; + } +} ); + + +// Initialize a jQuery object + + +// A central reference to the root jQuery(document) +var rootjQuery, + + // A simple way to check for HTML strings + // Prioritize #id over to avoid XSS via location.hash (#9521) + // Strict HTML recognition (#11290: must start with <) + // Shortcut simple #id case for speed + rquickExpr = /^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/, + + init = jQuery.fn.init = function( selector, context, root ) { + var match, elem; + + // HANDLE: $(""), $(null), $(undefined), $(false) + if ( !selector ) { + return this; + } + + // Method init() accepts an alternate rootjQuery + // so migrate can support jQuery.sub (gh-2101) + root = root || rootjQuery; + + // Handle HTML strings + if ( typeof selector === "string" ) { + if ( selector[ 0 ] === "<" && + selector[ selector.length - 1 ] === ">" && + selector.length >= 3 ) { + + // Assume that strings that start and end with <> are HTML and skip the regex check + match = [ null, selector, null ]; + + } else { + match = rquickExpr.exec( selector ); + } + + // Match html or make sure no context is specified for #id + if ( match && ( match[ 1 ] || !context ) ) { + + // HANDLE: $(html) -> $(array) + if ( match[ 1 ] ) { + context = context instanceof jQuery ? context[ 0 ] : context; + + // Option to run scripts is true for back-compat + // Intentionally let the error be thrown if parseHTML is not present + jQuery.merge( this, jQuery.parseHTML( + match[ 1 ], + context && context.nodeType ? context.ownerDocument || context : document, + true + ) ); + + // HANDLE: $(html, props) + if ( rsingleTag.test( match[ 1 ] ) && jQuery.isPlainObject( context ) ) { + for ( match in context ) { + + // Properties of context are called as methods if possible + if ( isFunction( this[ match ] ) ) { + this[ match ]( context[ match ] ); + + // ...and otherwise set as attributes + } else { + this.attr( match, context[ match ] ); + } + } + } + + return this; + + // HANDLE: $(#id) + } else { + elem = document.getElementById( match[ 2 ] ); + + if ( elem ) { + + // Inject the element directly into the jQuery object + this[ 0 ] = elem; + this.length = 1; + } + return this; + } + + // HANDLE: $(expr, $(...)) + } else if ( !context || context.jquery ) { + return ( context || root ).find( selector ); + + // HANDLE: $(expr, context) + // (which is just equivalent to: $(context).find(expr) + } else { + return this.constructor( context ).find( selector ); + } + + // HANDLE: $(DOMElement) + } else if ( selector.nodeType ) { + this[ 0 ] = selector; + this.length = 1; + return this; + + // HANDLE: $(function) + // Shortcut for document ready + } else if ( isFunction( selector ) ) { + return root.ready !== undefined ? + root.ready( selector ) : + + // Execute immediately if ready is not present + selector( jQuery ); + } + + return jQuery.makeArray( selector, this ); + }; + +// Give the init function the jQuery prototype for later instantiation +init.prototype = jQuery.fn; + +// Initialize central reference +rootjQuery = jQuery( document ); + + +var rparentsprev = /^(?:parents|prev(?:Until|All))/, + + // Methods guaranteed to produce a unique set when starting from a unique set + guaranteedUnique = { + children: true, + contents: true, + next: true, + prev: true + }; + +jQuery.fn.extend( { + has: function( target ) { + var targets = jQuery( target, this ), + l = targets.length; + + return this.filter( function() { + var i = 0; + for ( ; i < l; i++ ) { + if ( jQuery.contains( this, targets[ i ] ) ) { + return true; + } + } + } ); + }, + + closest: function( selectors, context ) { + var cur, + i = 0, + l = this.length, + matched = [], + targets = typeof selectors !== "string" && jQuery( selectors ); + + // Positional selectors never match, since there's no _selection_ context + if ( !rneedsContext.test( selectors ) ) { + for ( ; i < l; i++ ) { + for ( cur = this[ i ]; cur && cur !== context; cur = cur.parentNode ) { + + // Always skip document fragments + if ( cur.nodeType < 11 && ( targets ? + targets.index( cur ) > -1 : + + // Don't pass non-elements to Sizzle + cur.nodeType === 1 && + jQuery.find.matchesSelector( cur, selectors ) ) ) { + + matched.push( cur ); + break; + } + } + } + } + + return this.pushStack( matched.length > 1 ? jQuery.uniqueSort( matched ) : matched ); + }, + + // Determine the position of an element within the set + index: function( elem ) { + + // No argument, return index in parent + if ( !elem ) { + return ( this[ 0 ] && this[ 0 ].parentNode ) ? this.first().prevAll().length : -1; + } + + // Index in selector + if ( typeof elem === "string" ) { + return indexOf.call( jQuery( elem ), this[ 0 ] ); + } + + // Locate the position of the desired element + return indexOf.call( this, + + // If it receives a jQuery object, the first element is used + elem.jquery ? elem[ 0 ] : elem + ); + }, + + add: function( selector, context ) { + return this.pushStack( + jQuery.uniqueSort( + jQuery.merge( this.get(), jQuery( selector, context ) ) + ) + ); + }, + + addBack: function( selector ) { + return this.add( selector == null ? + this.prevObject : this.prevObject.filter( selector ) + ); + } +} ); + +function sibling( cur, dir ) { + while ( ( cur = cur[ dir ] ) && cur.nodeType !== 1 ) {} + return cur; +} + +jQuery.each( { + parent: function( elem ) { + var parent = elem.parentNode; + return parent && parent.nodeType !== 11 ? parent : null; + }, + parents: function( elem ) { + return dir( elem, "parentNode" ); + }, + parentsUntil: function( elem, _i, until ) { + return dir( elem, "parentNode", until ); + }, + next: function( elem ) { + return sibling( elem, "nextSibling" ); + }, + prev: function( elem ) { + return sibling( elem, "previousSibling" ); + }, + nextAll: function( elem ) { + return dir( elem, "nextSibling" ); + }, + prevAll: function( elem ) { + return dir( elem, "previousSibling" ); + }, + nextUntil: function( elem, _i, until ) { + return dir( elem, "nextSibling", until ); + }, + prevUntil: function( elem, _i, until ) { + return dir( elem, "previousSibling", until ); + }, + siblings: function( elem ) { + return siblings( ( elem.parentNode || {} ).firstChild, elem ); + }, + children: function( elem ) { + return siblings( elem.firstChild ); + }, + contents: function( elem ) { + if ( elem.contentDocument != null && + + // Support: IE 11+ + // elements with no `data` attribute has an object + // `contentDocument` with a `null` prototype. + getProto( elem.contentDocument ) ) { + + return elem.contentDocument; + } + + // Support: IE 9 - 11 only, iOS 7 only, Android Browser <=4.3 only + // Treat the template element as a regular one in browsers that + // don't support it. + if ( nodeName( elem, "template" ) ) { + elem = elem.content || elem; + } + + return jQuery.merge( [], elem.childNodes ); + } +}, function( name, fn ) { + jQuery.fn[ name ] = function( until, selector ) { + var matched = jQuery.map( this, fn, until ); + + if ( name.slice( -5 ) !== "Until" ) { + selector = until; + } + + if ( selector && typeof selector === "string" ) { + matched = jQuery.filter( selector, matched ); + } + + if ( this.length > 1 ) { + + // Remove duplicates + if ( !guaranteedUnique[ name ] ) { + jQuery.uniqueSort( matched ); + } + + // Reverse order for parents* and prev-derivatives + if ( rparentsprev.test( name ) ) { + matched.reverse(); + } + } + + return this.pushStack( matched ); + }; +} ); +var rnothtmlwhite = ( /[^\x20\t\r\n\f]+/g ); + + + +// Convert String-formatted options into Object-formatted ones +function createOptions( options ) { + var object = {}; + jQuery.each( options.match( rnothtmlwhite ) || [], function( _, flag ) { + object[ flag ] = true; + } ); + return object; +} + +/* + * Create a callback list using the following parameters: + * + * options: an optional list of space-separated options that will change how + * the callback list behaves or a more traditional option object + * + * By default a callback list will act like an event callback list and can be + * "fired" multiple times. + * + * Possible options: + * + * once: will ensure the callback list can only be fired once (like a Deferred) + * + * memory: will keep track of previous values and will call any callback added + * after the list has been fired right away with the latest "memorized" + * values (like a Deferred) + * + * unique: will ensure a callback can only be added once (no duplicate in the list) + * + * stopOnFalse: interrupt callings when a callback returns false + * + */ +jQuery.Callbacks = function( options ) { + + // Convert options from String-formatted to Object-formatted if needed + // (we check in cache first) + options = typeof options === "string" ? + createOptions( options ) : + jQuery.extend( {}, options ); + + var // Flag to know if list is currently firing + firing, + + // Last fire value for non-forgettable lists + memory, + + // Flag to know if list was already fired + fired, + + // Flag to prevent firing + locked, + + // Actual callback list + list = [], + + // Queue of execution data for repeatable lists + queue = [], + + // Index of currently firing callback (modified by add/remove as needed) + firingIndex = -1, + + // Fire callbacks + fire = function() { + + // Enforce single-firing + locked = locked || options.once; + + // Execute callbacks for all pending executions, + // respecting firingIndex overrides and runtime changes + fired = firing = true; + for ( ; queue.length; firingIndex = -1 ) { + memory = queue.shift(); + while ( ++firingIndex < list.length ) { + + // Run callback and check for early termination + if ( list[ firingIndex ].apply( memory[ 0 ], memory[ 1 ] ) === false && + options.stopOnFalse ) { + + // Jump to end and forget the data so .add doesn't re-fire + firingIndex = list.length; + memory = false; + } + } + } + + // Forget the data if we're done with it + if ( !options.memory ) { + memory = false; + } + + firing = false; + + // Clean up if we're done firing for good + if ( locked ) { + + // Keep an empty list if we have data for future add calls + if ( memory ) { + list = []; + + // Otherwise, this object is spent + } else { + list = ""; + } + } + }, + + // Actual Callbacks object + self = { + + // Add a callback or a collection of callbacks to the list + add: function() { + if ( list ) { + + // If we have memory from a past run, we should fire after adding + if ( memory && !firing ) { + firingIndex = list.length - 1; + queue.push( memory ); + } + + ( function add( args ) { + jQuery.each( args, function( _, arg ) { + if ( isFunction( arg ) ) { + if ( !options.unique || !self.has( arg ) ) { + list.push( arg ); + } + } else if ( arg && arg.length && toType( arg ) !== "string" ) { + + // Inspect recursively + add( arg ); + } + } ); + } )( arguments ); + + if ( memory && !firing ) { + fire(); + } + } + return this; + }, + + // Remove a callback from the list + remove: function() { + jQuery.each( arguments, function( _, arg ) { + var index; + while ( ( index = jQuery.inArray( arg, list, index ) ) > -1 ) { + list.splice( index, 1 ); + + // Handle firing indexes + if ( index <= firingIndex ) { + firingIndex--; + } + } + } ); + return this; + }, + + // Check if a given callback is in the list. + // If no argument is given, return whether or not list has callbacks attached. + has: function( fn ) { + return fn ? + jQuery.inArray( fn, list ) > -1 : + list.length > 0; + }, + + // Remove all callbacks from the list + empty: function() { + if ( list ) { + list = []; + } + return this; + }, + + // Disable .fire and .add + // Abort any current/pending executions + // Clear all callbacks and values + disable: function() { + locked = queue = []; + list = memory = ""; + return this; + }, + disabled: function() { + return !list; + }, + + // Disable .fire + // Also disable .add unless we have memory (since it would have no effect) + // Abort any pending executions + lock: function() { + locked = queue = []; + if ( !memory && !firing ) { + list = memory = ""; + } + return this; + }, + locked: function() { + return !!locked; + }, + + // Call all callbacks with the given context and arguments + fireWith: function( context, args ) { + if ( !locked ) { + args = args || []; + args = [ context, args.slice ? args.slice() : args ]; + queue.push( args ); + if ( !firing ) { + fire(); + } + } + return this; + }, + + // Call all the callbacks with the given arguments + fire: function() { + self.fireWith( this, arguments ); + return this; + }, + + // To know if the callbacks have already been called at least once + fired: function() { + return !!fired; + } + }; + + return self; +}; + + +function Identity( v ) { + return v; +} +function Thrower( ex ) { + throw ex; +} + +function adoptValue( value, resolve, reject, noValue ) { + var method; + + try { + + // Check for promise aspect first to privilege synchronous behavior + if ( value && isFunction( ( method = value.promise ) ) ) { + method.call( value ).done( resolve ).fail( reject ); + + // Other thenables + } else if ( value && isFunction( ( method = value.then ) ) ) { + method.call( value, resolve, reject ); + + // Other non-thenables + } else { + + // Control `resolve` arguments by letting Array#slice cast boolean `noValue` to integer: + // * false: [ value ].slice( 0 ) => resolve( value ) + // * true: [ value ].slice( 1 ) => resolve() + resolve.apply( undefined, [ value ].slice( noValue ) ); + } + + // For Promises/A+, convert exceptions into rejections + // Since jQuery.when doesn't unwrap thenables, we can skip the extra checks appearing in + // Deferred#then to conditionally suppress rejection. + } catch ( value ) { + + // Support: Android 4.0 only + // Strict mode functions invoked without .call/.apply get global-object context + reject.apply( undefined, [ value ] ); + } +} + +jQuery.extend( { + + Deferred: function( func ) { + var tuples = [ + + // action, add listener, callbacks, + // ... .then handlers, argument index, [final state] + [ "notify", "progress", jQuery.Callbacks( "memory" ), + jQuery.Callbacks( "memory" ), 2 ], + [ "resolve", "done", jQuery.Callbacks( "once memory" ), + jQuery.Callbacks( "once memory" ), 0, "resolved" ], + [ "reject", "fail", jQuery.Callbacks( "once memory" ), + jQuery.Callbacks( "once memory" ), 1, "rejected" ] + ], + state = "pending", + promise = { + state: function() { + return state; + }, + always: function() { + deferred.done( arguments ).fail( arguments ); + return this; + }, + "catch": function( fn ) { + return promise.then( null, fn ); + }, + + // Keep pipe for back-compat + pipe: function( /* fnDone, fnFail, fnProgress */ ) { + var fns = arguments; + + return jQuery.Deferred( function( newDefer ) { + jQuery.each( tuples, function( _i, tuple ) { + + // Map tuples (progress, done, fail) to arguments (done, fail, progress) + var fn = isFunction( fns[ tuple[ 4 ] ] ) && fns[ tuple[ 4 ] ]; + + // deferred.progress(function() { bind to newDefer or newDefer.notify }) + // deferred.done(function() { bind to newDefer or newDefer.resolve }) + // deferred.fail(function() { bind to newDefer or newDefer.reject }) + deferred[ tuple[ 1 ] ]( function() { + var returned = fn && fn.apply( this, arguments ); + if ( returned && isFunction( returned.promise ) ) { + returned.promise() + .progress( newDefer.notify ) + .done( newDefer.resolve ) + .fail( newDefer.reject ); + } else { + newDefer[ tuple[ 0 ] + "With" ]( + this, + fn ? [ returned ] : arguments + ); + } + } ); + } ); + fns = null; + } ).promise(); + }, + then: function( onFulfilled, onRejected, onProgress ) { + var maxDepth = 0; + function resolve( depth, deferred, handler, special ) { + return function() { + var that = this, + args = arguments, + mightThrow = function() { + var returned, then; + + // Support: Promises/A+ section 2.3.3.3.3 + // https://promisesaplus.com/#point-59 + // Ignore double-resolution attempts + if ( depth < maxDepth ) { + return; + } + + returned = handler.apply( that, args ); + + // Support: Promises/A+ section 2.3.1 + // https://promisesaplus.com/#point-48 + if ( returned === deferred.promise() ) { + throw new TypeError( "Thenable self-resolution" ); + } + + // Support: Promises/A+ sections 2.3.3.1, 3.5 + // https://promisesaplus.com/#point-54 + // https://promisesaplus.com/#point-75 + // Retrieve `then` only once + then = returned && + + // Support: Promises/A+ section 2.3.4 + // https://promisesaplus.com/#point-64 + // Only check objects and functions for thenability + ( typeof returned === "object" || + typeof returned === "function" ) && + returned.then; + + // Handle a returned thenable + if ( isFunction( then ) ) { + + // Special processors (notify) just wait for resolution + if ( special ) { + then.call( + returned, + resolve( maxDepth, deferred, Identity, special ), + resolve( maxDepth, deferred, Thrower, special ) + ); + + // Normal processors (resolve) also hook into progress + } else { + + // ...and disregard older resolution values + maxDepth++; + + then.call( + returned, + resolve( maxDepth, deferred, Identity, special ), + resolve( maxDepth, deferred, Thrower, special ), + resolve( maxDepth, deferred, Identity, + deferred.notifyWith ) + ); + } + + // Handle all other returned values + } else { + + // Only substitute handlers pass on context + // and multiple values (non-spec behavior) + if ( handler !== Identity ) { + that = undefined; + args = [ returned ]; + } + + // Process the value(s) + // Default process is resolve + ( special || deferred.resolveWith )( that, args ); + } + }, + + // Only normal processors (resolve) catch and reject exceptions + process = special ? + mightThrow : + function() { + try { + mightThrow(); + } catch ( e ) { + + if ( jQuery.Deferred.exceptionHook ) { + jQuery.Deferred.exceptionHook( e, + process.stackTrace ); + } + + // Support: Promises/A+ section 2.3.3.3.4.1 + // https://promisesaplus.com/#point-61 + // Ignore post-resolution exceptions + if ( depth + 1 >= maxDepth ) { + + // Only substitute handlers pass on context + // and multiple values (non-spec behavior) + if ( handler !== Thrower ) { + that = undefined; + args = [ e ]; + } + + deferred.rejectWith( that, args ); + } + } + }; + + // Support: Promises/A+ section 2.3.3.3.1 + // https://promisesaplus.com/#point-57 + // Re-resolve promises immediately to dodge false rejection from + // subsequent errors + if ( depth ) { + process(); + } else { + + // Call an optional hook to record the stack, in case of exception + // since it's otherwise lost when execution goes async + if ( jQuery.Deferred.getStackHook ) { + process.stackTrace = jQuery.Deferred.getStackHook(); + } + window.setTimeout( process ); + } + }; + } + + return jQuery.Deferred( function( newDefer ) { + + // progress_handlers.add( ... ) + tuples[ 0 ][ 3 ].add( + resolve( + 0, + newDefer, + isFunction( onProgress ) ? + onProgress : + Identity, + newDefer.notifyWith + ) + ); + + // fulfilled_handlers.add( ... ) + tuples[ 1 ][ 3 ].add( + resolve( + 0, + newDefer, + isFunction( onFulfilled ) ? + onFulfilled : + Identity + ) + ); + + // rejected_handlers.add( ... ) + tuples[ 2 ][ 3 ].add( + resolve( + 0, + newDefer, + isFunction( onRejected ) ? + onRejected : + Thrower + ) + ); + } ).promise(); + }, + + // Get a promise for this deferred + // If obj is provided, the promise aspect is added to the object + promise: function( obj ) { + return obj != null ? jQuery.extend( obj, promise ) : promise; + } + }, + deferred = {}; + + // Add list-specific methods + jQuery.each( tuples, function( i, tuple ) { + var list = tuple[ 2 ], + stateString = tuple[ 5 ]; + + // promise.progress = list.add + // promise.done = list.add + // promise.fail = list.add + promise[ tuple[ 1 ] ] = list.add; + + // Handle state + if ( stateString ) { + list.add( + function() { + + // state = "resolved" (i.e., fulfilled) + // state = "rejected" + state = stateString; + }, + + // rejected_callbacks.disable + // fulfilled_callbacks.disable + tuples[ 3 - i ][ 2 ].disable, + + // rejected_handlers.disable + // fulfilled_handlers.disable + tuples[ 3 - i ][ 3 ].disable, + + // progress_callbacks.lock + tuples[ 0 ][ 2 ].lock, + + // progress_handlers.lock + tuples[ 0 ][ 3 ].lock + ); + } + + // progress_handlers.fire + // fulfilled_handlers.fire + // rejected_handlers.fire + list.add( tuple[ 3 ].fire ); + + // deferred.notify = function() { deferred.notifyWith(...) } + // deferred.resolve = function() { deferred.resolveWith(...) } + // deferred.reject = function() { deferred.rejectWith(...) } + deferred[ tuple[ 0 ] ] = function() { + deferred[ tuple[ 0 ] + "With" ]( this === deferred ? undefined : this, arguments ); + return this; + }; + + // deferred.notifyWith = list.fireWith + // deferred.resolveWith = list.fireWith + // deferred.rejectWith = list.fireWith + deferred[ tuple[ 0 ] + "With" ] = list.fireWith; + } ); + + // Make the deferred a promise + promise.promise( deferred ); + + // Call given func if any + if ( func ) { + func.call( deferred, deferred ); + } + + // All done! + return deferred; + }, + + // Deferred helper + when: function( singleValue ) { + var + + // count of uncompleted subordinates + remaining = arguments.length, + + // count of unprocessed arguments + i = remaining, + + // subordinate fulfillment data + resolveContexts = Array( i ), + resolveValues = slice.call( arguments ), + + // the master Deferred + master = jQuery.Deferred(), + + // subordinate callback factory + updateFunc = function( i ) { + return function( value ) { + resolveContexts[ i ] = this; + resolveValues[ i ] = arguments.length > 1 ? slice.call( arguments ) : value; + if ( !( --remaining ) ) { + master.resolveWith( resolveContexts, resolveValues ); + } + }; + }; + + // Single- and empty arguments are adopted like Promise.resolve + if ( remaining <= 1 ) { + adoptValue( singleValue, master.done( updateFunc( i ) ).resolve, master.reject, + !remaining ); + + // Use .then() to unwrap secondary thenables (cf. gh-3000) + if ( master.state() === "pending" || + isFunction( resolveValues[ i ] && resolveValues[ i ].then ) ) { + + return master.then(); + } + } + + // Multiple arguments are aggregated like Promise.all array elements + while ( i-- ) { + adoptValue( resolveValues[ i ], updateFunc( i ), master.reject ); + } + + return master.promise(); + } +} ); + + +// These usually indicate a programmer mistake during development, +// warn about them ASAP rather than swallowing them by default. +var rerrorNames = /^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/; + +jQuery.Deferred.exceptionHook = function( error, stack ) { + + // Support: IE 8 - 9 only + // Console exists when dev tools are open, which can happen at any time + if ( window.console && window.console.warn && error && rerrorNames.test( error.name ) ) { + window.console.warn( "jQuery.Deferred exception: " + error.message, error.stack, stack ); + } +}; + + + + +jQuery.readyException = function( error ) { + window.setTimeout( function() { + throw error; + } ); +}; + + + + +// The deferred used on DOM ready +var readyList = jQuery.Deferred(); + +jQuery.fn.ready = function( fn ) { + + readyList + .then( fn ) + + // Wrap jQuery.readyException in a function so that the lookup + // happens at the time of error handling instead of callback + // registration. + .catch( function( error ) { + jQuery.readyException( error ); + } ); + + return this; +}; + +jQuery.extend( { + + // Is the DOM ready to be used? Set to true once it occurs. + isReady: false, + + // A counter to track how many items to wait for before + // the ready event fires. See #6781 + readyWait: 1, + + // Handle when the DOM is ready + ready: function( wait ) { + + // Abort if there are pending holds or we're already ready + if ( wait === true ? --jQuery.readyWait : jQuery.isReady ) { + return; + } + + // Remember that the DOM is ready + jQuery.isReady = true; + + // If a normal DOM Ready event fired, decrement, and wait if need be + if ( wait !== true && --jQuery.readyWait > 0 ) { + return; + } + + // If there are functions bound, to execute + readyList.resolveWith( document, [ jQuery ] ); + } +} ); + +jQuery.ready.then = readyList.then; + +// The ready event handler and self cleanup method +function completed() { + document.removeEventListener( "DOMContentLoaded", completed ); + window.removeEventListener( "load", completed ); + jQuery.ready(); +} + +// Catch cases where $(document).ready() is called +// after the browser event has already occurred. +// Support: IE <=9 - 10 only +// Older IE sometimes signals "interactive" too soon +if ( document.readyState === "complete" || + ( document.readyState !== "loading" && !document.documentElement.doScroll ) ) { + + // Handle it asynchronously to allow scripts the opportunity to delay ready + window.setTimeout( jQuery.ready ); + +} else { + + // Use the handy event callback + document.addEventListener( "DOMContentLoaded", completed ); + + // A fallback to window.onload, that will always work + window.addEventListener( "load", completed ); +} + + + + +// Multifunctional method to get and set values of a collection +// The value/s can optionally be executed if it's a function +var access = function( elems, fn, key, value, chainable, emptyGet, raw ) { + var i = 0, + len = elems.length, + bulk = key == null; + + // Sets many values + if ( toType( key ) === "object" ) { + chainable = true; + for ( i in key ) { + access( elems, fn, i, key[ i ], true, emptyGet, raw ); + } + + // Sets one value + } else if ( value !== undefined ) { + chainable = true; + + if ( !isFunction( value ) ) { + raw = true; + } + + if ( bulk ) { + + // Bulk operations run against the entire set + if ( raw ) { + fn.call( elems, value ); + fn = null; + + // ...except when executing function values + } else { + bulk = fn; + fn = function( elem, _key, value ) { + return bulk.call( jQuery( elem ), value ); + }; + } + } + + if ( fn ) { + for ( ; i < len; i++ ) { + fn( + elems[ i ], key, raw ? + value : + value.call( elems[ i ], i, fn( elems[ i ], key ) ) + ); + } + } + } + + if ( chainable ) { + return elems; + } + + // Gets + if ( bulk ) { + return fn.call( elems ); + } + + return len ? fn( elems[ 0 ], key ) : emptyGet; +}; + + +// Matches dashed string for camelizing +var rmsPrefix = /^-ms-/, + rdashAlpha = /-([a-z])/g; + +// Used by camelCase as callback to replace() +function fcamelCase( _all, letter ) { + return letter.toUpperCase(); +} + +// Convert dashed to camelCase; used by the css and data modules +// Support: IE <=9 - 11, Edge 12 - 15 +// Microsoft forgot to hump their vendor prefix (#9572) +function camelCase( string ) { + return string.replace( rmsPrefix, "ms-" ).replace( rdashAlpha, fcamelCase ); +} +var acceptData = function( owner ) { + + // Accepts only: + // - Node + // - Node.ELEMENT_NODE + // - Node.DOCUMENT_NODE + // - Object + // - Any + return owner.nodeType === 1 || owner.nodeType === 9 || !( +owner.nodeType ); +}; + + + + +function Data() { + this.expando = jQuery.expando + Data.uid++; +} + +Data.uid = 1; + +Data.prototype = { + + cache: function( owner ) { + + // Check if the owner object already has a cache + var value = owner[ this.expando ]; + + // If not, create one + if ( !value ) { + value = {}; + + // We can accept data for non-element nodes in modern browsers, + // but we should not, see #8335. + // Always return an empty object. + if ( acceptData( owner ) ) { + + // If it is a node unlikely to be stringify-ed or looped over + // use plain assignment + if ( owner.nodeType ) { + owner[ this.expando ] = value; + + // Otherwise secure it in a non-enumerable property + // configurable must be true to allow the property to be + // deleted when data is removed + } else { + Object.defineProperty( owner, this.expando, { + value: value, + configurable: true + } ); + } + } + } + + return value; + }, + set: function( owner, data, value ) { + var prop, + cache = this.cache( owner ); + + // Handle: [ owner, key, value ] args + // Always use camelCase key (gh-2257) + if ( typeof data === "string" ) { + cache[ camelCase( data ) ] = value; + + // Handle: [ owner, { properties } ] args + } else { + + // Copy the properties one-by-one to the cache object + for ( prop in data ) { + cache[ camelCase( prop ) ] = data[ prop ]; + } + } + return cache; + }, + get: function( owner, key ) { + return key === undefined ? + this.cache( owner ) : + + // Always use camelCase key (gh-2257) + owner[ this.expando ] && owner[ this.expando ][ camelCase( key ) ]; + }, + access: function( owner, key, value ) { + + // In cases where either: + // + // 1. No key was specified + // 2. A string key was specified, but no value provided + // + // Take the "read" path and allow the get method to determine + // which value to return, respectively either: + // + // 1. The entire cache object + // 2. The data stored at the key + // + if ( key === undefined || + ( ( key && typeof key === "string" ) && value === undefined ) ) { + + return this.get( owner, key ); + } + + // When the key is not a string, or both a key and value + // are specified, set or extend (existing objects) with either: + // + // 1. An object of properties + // 2. A key and value + // + this.set( owner, key, value ); + + // Since the "set" path can have two possible entry points + // return the expected data based on which path was taken[*] + return value !== undefined ? value : key; + }, + remove: function( owner, key ) { + var i, + cache = owner[ this.expando ]; + + if ( cache === undefined ) { + return; + } + + if ( key !== undefined ) { + + // Support array or space separated string of keys + if ( Array.isArray( key ) ) { + + // If key is an array of keys... + // We always set camelCase keys, so remove that. + key = key.map( camelCase ); + } else { + key = camelCase( key ); + + // If a key with the spaces exists, use it. + // Otherwise, create an array by matching non-whitespace + key = key in cache ? + [ key ] : + ( key.match( rnothtmlwhite ) || [] ); + } + + i = key.length; + + while ( i-- ) { + delete cache[ key[ i ] ]; + } + } + + // Remove the expando if there's no more data + if ( key === undefined || jQuery.isEmptyObject( cache ) ) { + + // Support: Chrome <=35 - 45 + // Webkit & Blink performance suffers when deleting properties + // from DOM nodes, so set to undefined instead + // https://bugs.chromium.org/p/chromium/issues/detail?id=378607 (bug restricted) + if ( owner.nodeType ) { + owner[ this.expando ] = undefined; + } else { + delete owner[ this.expando ]; + } + } + }, + hasData: function( owner ) { + var cache = owner[ this.expando ]; + return cache !== undefined && !jQuery.isEmptyObject( cache ); + } +}; +var dataPriv = new Data(); + +var dataUser = new Data(); + + + +// Implementation Summary +// +// 1. Enforce API surface and semantic compatibility with 1.9.x branch +// 2. Improve the module's maintainability by reducing the storage +// paths to a single mechanism. +// 3. Use the same single mechanism to support "private" and "user" data. +// 4. _Never_ expose "private" data to user code (TODO: Drop _data, _removeData) +// 5. Avoid exposing implementation details on user objects (eg. expando properties) +// 6. Provide a clear path for implementation upgrade to WeakMap in 2014 + +var rbrace = /^(?:\{[\w\W]*\}|\[[\w\W]*\])$/, + rmultiDash = /[A-Z]/g; + +function getData( data ) { + if ( data === "true" ) { + return true; + } + + if ( data === "false" ) { + return false; + } + + if ( data === "null" ) { + return null; + } + + // Only convert to a number if it doesn't change the string + if ( data === +data + "" ) { + return +data; + } + + if ( rbrace.test( data ) ) { + return JSON.parse( data ); + } + + return data; +} + +function dataAttr( elem, key, data ) { + var name; + + // If nothing was found internally, try to fetch any + // data from the HTML5 data-* attribute + if ( data === undefined && elem.nodeType === 1 ) { + name = "data-" + key.replace( rmultiDash, "-$&" ).toLowerCase(); + data = elem.getAttribute( name ); + + if ( typeof data === "string" ) { + try { + data = getData( data ); + } catch ( e ) {} + + // Make sure we set the data so it isn't changed later + dataUser.set( elem, key, data ); + } else { + data = undefined; + } + } + return data; +} + +jQuery.extend( { + hasData: function( elem ) { + return dataUser.hasData( elem ) || dataPriv.hasData( elem ); + }, + + data: function( elem, name, data ) { + return dataUser.access( elem, name, data ); + }, + + removeData: function( elem, name ) { + dataUser.remove( elem, name ); + }, + + // TODO: Now that all calls to _data and _removeData have been replaced + // with direct calls to dataPriv methods, these can be deprecated. + _data: function( elem, name, data ) { + return dataPriv.access( elem, name, data ); + }, + + _removeData: function( elem, name ) { + dataPriv.remove( elem, name ); + } +} ); + +jQuery.fn.extend( { + data: function( key, value ) { + var i, name, data, + elem = this[ 0 ], + attrs = elem && elem.attributes; + + // Gets all values + if ( key === undefined ) { + if ( this.length ) { + data = dataUser.get( elem ); + + if ( elem.nodeType === 1 && !dataPriv.get( elem, "hasDataAttrs" ) ) { + i = attrs.length; + while ( i-- ) { + + // Support: IE 11 only + // The attrs elements can be null (#14894) + if ( attrs[ i ] ) { + name = attrs[ i ].name; + if ( name.indexOf( "data-" ) === 0 ) { + name = camelCase( name.slice( 5 ) ); + dataAttr( elem, name, data[ name ] ); + } + } + } + dataPriv.set( elem, "hasDataAttrs", true ); + } + } + + return data; + } + + // Sets multiple values + if ( typeof key === "object" ) { + return this.each( function() { + dataUser.set( this, key ); + } ); + } + + return access( this, function( value ) { + var data; + + // The calling jQuery object (element matches) is not empty + // (and therefore has an element appears at this[ 0 ]) and the + // `value` parameter was not undefined. An empty jQuery object + // will result in `undefined` for elem = this[ 0 ] which will + // throw an exception if an attempt to read a data cache is made. + if ( elem && value === undefined ) { + + // Attempt to get data from the cache + // The key will always be camelCased in Data + data = dataUser.get( elem, key ); + if ( data !== undefined ) { + return data; + } + + // Attempt to "discover" the data in + // HTML5 custom data-* attrs + data = dataAttr( elem, key ); + if ( data !== undefined ) { + return data; + } + + // We tried really hard, but the data doesn't exist. + return; + } + + // Set the data... + this.each( function() { + + // We always store the camelCased key + dataUser.set( this, key, value ); + } ); + }, null, value, arguments.length > 1, null, true ); + }, + + removeData: function( key ) { + return this.each( function() { + dataUser.remove( this, key ); + } ); + } +} ); + + +jQuery.extend( { + queue: function( elem, type, data ) { + var queue; + + if ( elem ) { + type = ( type || "fx" ) + "queue"; + queue = dataPriv.get( elem, type ); + + // Speed up dequeue by getting out quickly if this is just a lookup + if ( data ) { + if ( !queue || Array.isArray( data ) ) { + queue = dataPriv.access( elem, type, jQuery.makeArray( data ) ); + } else { + queue.push( data ); + } + } + return queue || []; + } + }, + + dequeue: function( elem, type ) { + type = type || "fx"; + + var queue = jQuery.queue( elem, type ), + startLength = queue.length, + fn = queue.shift(), + hooks = jQuery._queueHooks( elem, type ), + next = function() { + jQuery.dequeue( elem, type ); + }; + + // If the fx queue is dequeued, always remove the progress sentinel + if ( fn === "inprogress" ) { + fn = queue.shift(); + startLength--; + } + + if ( fn ) { + + // Add a progress sentinel to prevent the fx queue from being + // automatically dequeued + if ( type === "fx" ) { + queue.unshift( "inprogress" ); + } + + // Clear up the last queue stop function + delete hooks.stop; + fn.call( elem, next, hooks ); + } + + if ( !startLength && hooks ) { + hooks.empty.fire(); + } + }, + + // Not public - generate a queueHooks object, or return the current one + _queueHooks: function( elem, type ) { + var key = type + "queueHooks"; + return dataPriv.get( elem, key ) || dataPriv.access( elem, key, { + empty: jQuery.Callbacks( "once memory" ).add( function() { + dataPriv.remove( elem, [ type + "queue", key ] ); + } ) + } ); + } +} ); + +jQuery.fn.extend( { + queue: function( type, data ) { + var setter = 2; + + if ( typeof type !== "string" ) { + data = type; + type = "fx"; + setter--; + } + + if ( arguments.length < setter ) { + return jQuery.queue( this[ 0 ], type ); + } + + return data === undefined ? + this : + this.each( function() { + var queue = jQuery.queue( this, type, data ); + + // Ensure a hooks for this queue + jQuery._queueHooks( this, type ); + + if ( type === "fx" && queue[ 0 ] !== "inprogress" ) { + jQuery.dequeue( this, type ); + } + } ); + }, + dequeue: function( type ) { + return this.each( function() { + jQuery.dequeue( this, type ); + } ); + }, + clearQueue: function( type ) { + return this.queue( type || "fx", [] ); + }, + + // Get a promise resolved when queues of a certain type + // are emptied (fx is the type by default) + promise: function( type, obj ) { + var tmp, + count = 1, + defer = jQuery.Deferred(), + elements = this, + i = this.length, + resolve = function() { + if ( !( --count ) ) { + defer.resolveWith( elements, [ elements ] ); + } + }; + + if ( typeof type !== "string" ) { + obj = type; + type = undefined; + } + type = type || "fx"; + + while ( i-- ) { + tmp = dataPriv.get( elements[ i ], type + "queueHooks" ); + if ( tmp && tmp.empty ) { + count++; + tmp.empty.add( resolve ); + } + } + resolve(); + return defer.promise( obj ); + } +} ); +var pnum = ( /[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/ ).source; + +var rcssNum = new RegExp( "^(?:([+-])=|)(" + pnum + ")([a-z%]*)$", "i" ); + + +var cssExpand = [ "Top", "Right", "Bottom", "Left" ]; + +var documentElement = document.documentElement; + + + + var isAttached = function( elem ) { + return jQuery.contains( elem.ownerDocument, elem ); + }, + composed = { composed: true }; + + // Support: IE 9 - 11+, Edge 12 - 18+, iOS 10.0 - 10.2 only + // Check attachment across shadow DOM boundaries when possible (gh-3504) + // Support: iOS 10.0-10.2 only + // Early iOS 10 versions support `attachShadow` but not `getRootNode`, + // leading to errors. We need to check for `getRootNode`. + if ( documentElement.getRootNode ) { + isAttached = function( elem ) { + return jQuery.contains( elem.ownerDocument, elem ) || + elem.getRootNode( composed ) === elem.ownerDocument; + }; + } +var isHiddenWithinTree = function( elem, el ) { + + // isHiddenWithinTree might be called from jQuery#filter function; + // in that case, element will be second argument + elem = el || elem; + + // Inline style trumps all + return elem.style.display === "none" || + elem.style.display === "" && + + // Otherwise, check computed style + // Support: Firefox <=43 - 45 + // Disconnected elements can have computed display: none, so first confirm that elem is + // in the document. + isAttached( elem ) && + + jQuery.css( elem, "display" ) === "none"; + }; + + + +function adjustCSS( elem, prop, valueParts, tween ) { + var adjusted, scale, + maxIterations = 20, + currentValue = tween ? + function() { + return tween.cur(); + } : + function() { + return jQuery.css( elem, prop, "" ); + }, + initial = currentValue(), + unit = valueParts && valueParts[ 3 ] || ( jQuery.cssNumber[ prop ] ? "" : "px" ), + + // Starting value computation is required for potential unit mismatches + initialInUnit = elem.nodeType && + ( jQuery.cssNumber[ prop ] || unit !== "px" && +initial ) && + rcssNum.exec( jQuery.css( elem, prop ) ); + + if ( initialInUnit && initialInUnit[ 3 ] !== unit ) { + + // Support: Firefox <=54 + // Halve the iteration target value to prevent interference from CSS upper bounds (gh-2144) + initial = initial / 2; + + // Trust units reported by jQuery.css + unit = unit || initialInUnit[ 3 ]; + + // Iteratively approximate from a nonzero starting point + initialInUnit = +initial || 1; + + while ( maxIterations-- ) { + + // Evaluate and update our best guess (doubling guesses that zero out). + // Finish if the scale equals or crosses 1 (making the old*new product non-positive). + jQuery.style( elem, prop, initialInUnit + unit ); + if ( ( 1 - scale ) * ( 1 - ( scale = currentValue() / initial || 0.5 ) ) <= 0 ) { + maxIterations = 0; + } + initialInUnit = initialInUnit / scale; + + } + + initialInUnit = initialInUnit * 2; + jQuery.style( elem, prop, initialInUnit + unit ); + + // Make sure we update the tween properties later on + valueParts = valueParts || []; + } + + if ( valueParts ) { + initialInUnit = +initialInUnit || +initial || 0; + + // Apply relative offset (+=/-=) if specified + adjusted = valueParts[ 1 ] ? + initialInUnit + ( valueParts[ 1 ] + 1 ) * valueParts[ 2 ] : + +valueParts[ 2 ]; + if ( tween ) { + tween.unit = unit; + tween.start = initialInUnit; + tween.end = adjusted; + } + } + return adjusted; +} + + +var defaultDisplayMap = {}; + +function getDefaultDisplay( elem ) { + var temp, + doc = elem.ownerDocument, + nodeName = elem.nodeName, + display = defaultDisplayMap[ nodeName ]; + + if ( display ) { + return display; + } + + temp = doc.body.appendChild( doc.createElement( nodeName ) ); + display = jQuery.css( temp, "display" ); + + temp.parentNode.removeChild( temp ); + + if ( display === "none" ) { + display = "block"; + } + defaultDisplayMap[ nodeName ] = display; + + return display; +} + +function showHide( elements, show ) { + var display, elem, + values = [], + index = 0, + length = elements.length; + + // Determine new display value for elements that need to change + for ( ; index < length; index++ ) { + elem = elements[ index ]; + if ( !elem.style ) { + continue; + } + + display = elem.style.display; + if ( show ) { + + // Since we force visibility upon cascade-hidden elements, an immediate (and slow) + // check is required in this first loop unless we have a nonempty display value (either + // inline or about-to-be-restored) + if ( display === "none" ) { + values[ index ] = dataPriv.get( elem, "display" ) || null; + if ( !values[ index ] ) { + elem.style.display = ""; + } + } + if ( elem.style.display === "" && isHiddenWithinTree( elem ) ) { + values[ index ] = getDefaultDisplay( elem ); + } + } else { + if ( display !== "none" ) { + values[ index ] = "none"; + + // Remember what we're overwriting + dataPriv.set( elem, "display", display ); + } + } + } + + // Set the display of the elements in a second loop to avoid constant reflow + for ( index = 0; index < length; index++ ) { + if ( values[ index ] != null ) { + elements[ index ].style.display = values[ index ]; + } + } + + return elements; +} + +jQuery.fn.extend( { + show: function() { + return showHide( this, true ); + }, + hide: function() { + return showHide( this ); + }, + toggle: function( state ) { + if ( typeof state === "boolean" ) { + return state ? this.show() : this.hide(); + } + + return this.each( function() { + if ( isHiddenWithinTree( this ) ) { + jQuery( this ).show(); + } else { + jQuery( this ).hide(); + } + } ); + } +} ); +var rcheckableType = ( /^(?:checkbox|radio)$/i ); + +var rtagName = ( /<([a-z][^\/\0>\x20\t\r\n\f]*)/i ); + +var rscriptType = ( /^$|^module$|\/(?:java|ecma)script/i ); + + + +( function() { + var fragment = document.createDocumentFragment(), + div = fragment.appendChild( document.createElement( "div" ) ), + input = document.createElement( "input" ); + + // Support: Android 4.0 - 4.3 only + // Check state lost if the name is set (#11217) + // Support: Windows Web Apps (WWA) + // `name` and `type` must use .setAttribute for WWA (#14901) + input.setAttribute( "type", "radio" ); + input.setAttribute( "checked", "checked" ); + input.setAttribute( "name", "t" ); + + div.appendChild( input ); + + // Support: Android <=4.1 only + // Older WebKit doesn't clone checked state correctly in fragments + support.checkClone = div.cloneNode( true ).cloneNode( true ).lastChild.checked; + + // Support: IE <=11 only + // Make sure textarea (and checkbox) defaultValue is properly cloned + div.innerHTML = ""; + support.noCloneChecked = !!div.cloneNode( true ).lastChild.defaultValue; + + // Support: IE <=9 only + // IE <=9 replaces "; + support.option = !!div.lastChild; +} )(); + + +// We have to close these tags to support XHTML (#13200) +var wrapMap = { + + // XHTML parsers do not magically insert elements in the + // same way that tag soup parsers do. So we cannot shorten + // this by omitting or other required elements. + thead: [ 1, "", "
" ], + col: [ 2, "", "
" ], + tr: [ 2, "", "
" ], + td: [ 3, "", "
" ], + + _default: [ 0, "", "" ] +}; + +wrapMap.tbody = wrapMap.tfoot = wrapMap.colgroup = wrapMap.caption = wrapMap.thead; +wrapMap.th = wrapMap.td; + +// Support: IE <=9 only +if ( !support.option ) { + wrapMap.optgroup = wrapMap.option = [ 1, "" ]; +} + + +function getAll( context, tag ) { + + // Support: IE <=9 - 11 only + // Use typeof to avoid zero-argument method invocation on host objects (#15151) + var ret; + + if ( typeof context.getElementsByTagName !== "undefined" ) { + ret = context.getElementsByTagName( tag || "*" ); + + } else if ( typeof context.querySelectorAll !== "undefined" ) { + ret = context.querySelectorAll( tag || "*" ); + + } else { + ret = []; + } + + if ( tag === undefined || tag && nodeName( context, tag ) ) { + return jQuery.merge( [ context ], ret ); + } + + return ret; +} + + +// Mark scripts as having already been evaluated +function setGlobalEval( elems, refElements ) { + var i = 0, + l = elems.length; + + for ( ; i < l; i++ ) { + dataPriv.set( + elems[ i ], + "globalEval", + !refElements || dataPriv.get( refElements[ i ], "globalEval" ) + ); + } +} + + +var rhtml = /<|&#?\w+;/; + +function buildFragment( elems, context, scripts, selection, ignored ) { + var elem, tmp, tag, wrap, attached, j, + fragment = context.createDocumentFragment(), + nodes = [], + i = 0, + l = elems.length; + + for ( ; i < l; i++ ) { + elem = elems[ i ]; + + if ( elem || elem === 0 ) { + + // Add nodes directly + if ( toType( elem ) === "object" ) { + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + jQuery.merge( nodes, elem.nodeType ? [ elem ] : elem ); + + // Convert non-html into a text node + } else if ( !rhtml.test( elem ) ) { + nodes.push( context.createTextNode( elem ) ); + + // Convert html into DOM nodes + } else { + tmp = tmp || fragment.appendChild( context.createElement( "div" ) ); + + // Deserialize a standard representation + tag = ( rtagName.exec( elem ) || [ "", "" ] )[ 1 ].toLowerCase(); + wrap = wrapMap[ tag ] || wrapMap._default; + tmp.innerHTML = wrap[ 1 ] + jQuery.htmlPrefilter( elem ) + wrap[ 2 ]; + + // Descend through wrappers to the right content + j = wrap[ 0 ]; + while ( j-- ) { + tmp = tmp.lastChild; + } + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + jQuery.merge( nodes, tmp.childNodes ); + + // Remember the top-level container + tmp = fragment.firstChild; + + // Ensure the created nodes are orphaned (#12392) + tmp.textContent = ""; + } + } + } + + // Remove wrapper from fragment + fragment.textContent = ""; + + i = 0; + while ( ( elem = nodes[ i++ ] ) ) { + + // Skip elements already in the context collection (trac-4087) + if ( selection && jQuery.inArray( elem, selection ) > -1 ) { + if ( ignored ) { + ignored.push( elem ); + } + continue; + } + + attached = isAttached( elem ); + + // Append to fragment + tmp = getAll( fragment.appendChild( elem ), "script" ); + + // Preserve script evaluation history + if ( attached ) { + setGlobalEval( tmp ); + } + + // Capture executables + if ( scripts ) { + j = 0; + while ( ( elem = tmp[ j++ ] ) ) { + if ( rscriptType.test( elem.type || "" ) ) { + scripts.push( elem ); + } + } + } + } + + return fragment; +} + + +var + rkeyEvent = /^key/, + rmouseEvent = /^(?:mouse|pointer|contextmenu|drag|drop)|click/, + rtypenamespace = /^([^.]*)(?:\.(.+)|)/; + +function returnTrue() { + return true; +} + +function returnFalse() { + return false; +} + +// Support: IE <=9 - 11+ +// focus() and blur() are asynchronous, except when they are no-op. +// So expect focus to be synchronous when the element is already active, +// and blur to be synchronous when the element is not already active. +// (focus and blur are always synchronous in other supported browsers, +// this just defines when we can count on it). +function expectSync( elem, type ) { + return ( elem === safeActiveElement() ) === ( type === "focus" ); +} + +// Support: IE <=9 only +// Accessing document.activeElement can throw unexpectedly +// https://bugs.jquery.com/ticket/13393 +function safeActiveElement() { + try { + return document.activeElement; + } catch ( err ) { } +} + +function on( elem, types, selector, data, fn, one ) { + var origFn, type; + + // Types can be a map of types/handlers + if ( typeof types === "object" ) { + + // ( types-Object, selector, data ) + if ( typeof selector !== "string" ) { + + // ( types-Object, data ) + data = data || selector; + selector = undefined; + } + for ( type in types ) { + on( elem, type, selector, data, types[ type ], one ); + } + return elem; + } + + if ( data == null && fn == null ) { + + // ( types, fn ) + fn = selector; + data = selector = undefined; + } else if ( fn == null ) { + if ( typeof selector === "string" ) { + + // ( types, selector, fn ) + fn = data; + data = undefined; + } else { + + // ( types, data, fn ) + fn = data; + data = selector; + selector = undefined; + } + } + if ( fn === false ) { + fn = returnFalse; + } else if ( !fn ) { + return elem; + } + + if ( one === 1 ) { + origFn = fn; + fn = function( event ) { + + // Can use an empty set, since event contains the info + jQuery().off( event ); + return origFn.apply( this, arguments ); + }; + + // Use same guid so caller can remove using origFn + fn.guid = origFn.guid || ( origFn.guid = jQuery.guid++ ); + } + return elem.each( function() { + jQuery.event.add( this, types, fn, data, selector ); + } ); +} + +/* + * Helper functions for managing events -- not part of the public interface. + * Props to Dean Edwards' addEvent library for many of the ideas. + */ +jQuery.event = { + + global: {}, + + add: function( elem, types, handler, data, selector ) { + + var handleObjIn, eventHandle, tmp, + events, t, handleObj, + special, handlers, type, namespaces, origType, + elemData = dataPriv.get( elem ); + + // Only attach events to objects that accept data + if ( !acceptData( elem ) ) { + return; + } + + // Caller can pass in an object of custom data in lieu of the handler + if ( handler.handler ) { + handleObjIn = handler; + handler = handleObjIn.handler; + selector = handleObjIn.selector; + } + + // Ensure that invalid selectors throw exceptions at attach time + // Evaluate against documentElement in case elem is a non-element node (e.g., document) + if ( selector ) { + jQuery.find.matchesSelector( documentElement, selector ); + } + + // Make sure that the handler has a unique ID, used to find/remove it later + if ( !handler.guid ) { + handler.guid = jQuery.guid++; + } + + // Init the element's event structure and main handler, if this is the first + if ( !( events = elemData.events ) ) { + events = elemData.events = Object.create( null ); + } + if ( !( eventHandle = elemData.handle ) ) { + eventHandle = elemData.handle = function( e ) { + + // Discard the second event of a jQuery.event.trigger() and + // when an event is called after a page has unloaded + return typeof jQuery !== "undefined" && jQuery.event.triggered !== e.type ? + jQuery.event.dispatch.apply( elem, arguments ) : undefined; + }; + } + + // Handle multiple events separated by a space + types = ( types || "" ).match( rnothtmlwhite ) || [ "" ]; + t = types.length; + while ( t-- ) { + tmp = rtypenamespace.exec( types[ t ] ) || []; + type = origType = tmp[ 1 ]; + namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort(); + + // There *must* be a type, no attaching namespace-only handlers + if ( !type ) { + continue; + } + + // If event changes its type, use the special event handlers for the changed type + special = jQuery.event.special[ type ] || {}; + + // If selector defined, determine special event api type, otherwise given type + type = ( selector ? special.delegateType : special.bindType ) || type; + + // Update special based on newly reset type + special = jQuery.event.special[ type ] || {}; + + // handleObj is passed to all event handlers + handleObj = jQuery.extend( { + type: type, + origType: origType, + data: data, + handler: handler, + guid: handler.guid, + selector: selector, + needsContext: selector && jQuery.expr.match.needsContext.test( selector ), + namespace: namespaces.join( "." ) + }, handleObjIn ); + + // Init the event handler queue if we're the first + if ( !( handlers = events[ type ] ) ) { + handlers = events[ type ] = []; + handlers.delegateCount = 0; + + // Only use addEventListener if the special events handler returns false + if ( !special.setup || + special.setup.call( elem, data, namespaces, eventHandle ) === false ) { + + if ( elem.addEventListener ) { + elem.addEventListener( type, eventHandle ); + } + } + } + + if ( special.add ) { + special.add.call( elem, handleObj ); + + if ( !handleObj.handler.guid ) { + handleObj.handler.guid = handler.guid; + } + } + + // Add to the element's handler list, delegates in front + if ( selector ) { + handlers.splice( handlers.delegateCount++, 0, handleObj ); + } else { + handlers.push( handleObj ); + } + + // Keep track of which events have ever been used, for event optimization + jQuery.event.global[ type ] = true; + } + + }, + + // Detach an event or set of events from an element + remove: function( elem, types, handler, selector, mappedTypes ) { + + var j, origCount, tmp, + events, t, handleObj, + special, handlers, type, namespaces, origType, + elemData = dataPriv.hasData( elem ) && dataPriv.get( elem ); + + if ( !elemData || !( events = elemData.events ) ) { + return; + } + + // Once for each type.namespace in types; type may be omitted + types = ( types || "" ).match( rnothtmlwhite ) || [ "" ]; + t = types.length; + while ( t-- ) { + tmp = rtypenamespace.exec( types[ t ] ) || []; + type = origType = tmp[ 1 ]; + namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort(); + + // Unbind all events (on this namespace, if provided) for the element + if ( !type ) { + for ( type in events ) { + jQuery.event.remove( elem, type + types[ t ], handler, selector, true ); + } + continue; + } + + special = jQuery.event.special[ type ] || {}; + type = ( selector ? special.delegateType : special.bindType ) || type; + handlers = events[ type ] || []; + tmp = tmp[ 2 ] && + new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ); + + // Remove matching events + origCount = j = handlers.length; + while ( j-- ) { + handleObj = handlers[ j ]; + + if ( ( mappedTypes || origType === handleObj.origType ) && + ( !handler || handler.guid === handleObj.guid ) && + ( !tmp || tmp.test( handleObj.namespace ) ) && + ( !selector || selector === handleObj.selector || + selector === "**" && handleObj.selector ) ) { + handlers.splice( j, 1 ); + + if ( handleObj.selector ) { + handlers.delegateCount--; + } + if ( special.remove ) { + special.remove.call( elem, handleObj ); + } + } + } + + // Remove generic event handler if we removed something and no more handlers exist + // (avoids potential for endless recursion during removal of special event handlers) + if ( origCount && !handlers.length ) { + if ( !special.teardown || + special.teardown.call( elem, namespaces, elemData.handle ) === false ) { + + jQuery.removeEvent( elem, type, elemData.handle ); + } + + delete events[ type ]; + } + } + + // Remove data and the expando if it's no longer used + if ( jQuery.isEmptyObject( events ) ) { + dataPriv.remove( elem, "handle events" ); + } + }, + + dispatch: function( nativeEvent ) { + + var i, j, ret, matched, handleObj, handlerQueue, + args = new Array( arguments.length ), + + // Make a writable jQuery.Event from the native event object + event = jQuery.event.fix( nativeEvent ), + + handlers = ( + dataPriv.get( this, "events" ) || Object.create( null ) + )[ event.type ] || [], + special = jQuery.event.special[ event.type ] || {}; + + // Use the fix-ed jQuery.Event rather than the (read-only) native event + args[ 0 ] = event; + + for ( i = 1; i < arguments.length; i++ ) { + args[ i ] = arguments[ i ]; + } + + event.delegateTarget = this; + + // Call the preDispatch hook for the mapped type, and let it bail if desired + if ( special.preDispatch && special.preDispatch.call( this, event ) === false ) { + return; + } + + // Determine handlers + handlerQueue = jQuery.event.handlers.call( this, event, handlers ); + + // Run delegates first; they may want to stop propagation beneath us + i = 0; + while ( ( matched = handlerQueue[ i++ ] ) && !event.isPropagationStopped() ) { + event.currentTarget = matched.elem; + + j = 0; + while ( ( handleObj = matched.handlers[ j++ ] ) && + !event.isImmediatePropagationStopped() ) { + + // If the event is namespaced, then each handler is only invoked if it is + // specially universal or its namespaces are a superset of the event's. + if ( !event.rnamespace || handleObj.namespace === false || + event.rnamespace.test( handleObj.namespace ) ) { + + event.handleObj = handleObj; + event.data = handleObj.data; + + ret = ( ( jQuery.event.special[ handleObj.origType ] || {} ).handle || + handleObj.handler ).apply( matched.elem, args ); + + if ( ret !== undefined ) { + if ( ( event.result = ret ) === false ) { + event.preventDefault(); + event.stopPropagation(); + } + } + } + } + } + + // Call the postDispatch hook for the mapped type + if ( special.postDispatch ) { + special.postDispatch.call( this, event ); + } + + return event.result; + }, + + handlers: function( event, handlers ) { + var i, handleObj, sel, matchedHandlers, matchedSelectors, + handlerQueue = [], + delegateCount = handlers.delegateCount, + cur = event.target; + + // Find delegate handlers + if ( delegateCount && + + // Support: IE <=9 + // Black-hole SVG instance trees (trac-13180) + cur.nodeType && + + // Support: Firefox <=42 + // Suppress spec-violating clicks indicating a non-primary pointer button (trac-3861) + // https://www.w3.org/TR/DOM-Level-3-Events/#event-type-click + // Support: IE 11 only + // ...but not arrow key "clicks" of radio inputs, which can have `button` -1 (gh-2343) + !( event.type === "click" && event.button >= 1 ) ) { + + for ( ; cur !== this; cur = cur.parentNode || this ) { + + // Don't check non-elements (#13208) + // Don't process clicks on disabled elements (#6911, #8165, #11382, #11764) + if ( cur.nodeType === 1 && !( event.type === "click" && cur.disabled === true ) ) { + matchedHandlers = []; + matchedSelectors = {}; + for ( i = 0; i < delegateCount; i++ ) { + handleObj = handlers[ i ]; + + // Don't conflict with Object.prototype properties (#13203) + sel = handleObj.selector + " "; + + if ( matchedSelectors[ sel ] === undefined ) { + matchedSelectors[ sel ] = handleObj.needsContext ? + jQuery( sel, this ).index( cur ) > -1 : + jQuery.find( sel, this, null, [ cur ] ).length; + } + if ( matchedSelectors[ sel ] ) { + matchedHandlers.push( handleObj ); + } + } + if ( matchedHandlers.length ) { + handlerQueue.push( { elem: cur, handlers: matchedHandlers } ); + } + } + } + } + + // Add the remaining (directly-bound) handlers + cur = this; + if ( delegateCount < handlers.length ) { + handlerQueue.push( { elem: cur, handlers: handlers.slice( delegateCount ) } ); + } + + return handlerQueue; + }, + + addProp: function( name, hook ) { + Object.defineProperty( jQuery.Event.prototype, name, { + enumerable: true, + configurable: true, + + get: isFunction( hook ) ? + function() { + if ( this.originalEvent ) { + return hook( this.originalEvent ); + } + } : + function() { + if ( this.originalEvent ) { + return this.originalEvent[ name ]; + } + }, + + set: function( value ) { + Object.defineProperty( this, name, { + enumerable: true, + configurable: true, + writable: true, + value: value + } ); + } + } ); + }, + + fix: function( originalEvent ) { + return originalEvent[ jQuery.expando ] ? + originalEvent : + new jQuery.Event( originalEvent ); + }, + + special: { + load: { + + // Prevent triggered image.load events from bubbling to window.load + noBubble: true + }, + click: { + + // Utilize native event to ensure correct state for checkable inputs + setup: function( data ) { + + // For mutual compressibility with _default, replace `this` access with a local var. + // `|| data` is dead code meant only to preserve the variable through minification. + var el = this || data; + + // Claim the first handler + if ( rcheckableType.test( el.type ) && + el.click && nodeName( el, "input" ) ) { + + // dataPriv.set( el, "click", ... ) + leverageNative( el, "click", returnTrue ); + } + + // Return false to allow normal processing in the caller + return false; + }, + trigger: function( data ) { + + // For mutual compressibility with _default, replace `this` access with a local var. + // `|| data` is dead code meant only to preserve the variable through minification. + var el = this || data; + + // Force setup before triggering a click + if ( rcheckableType.test( el.type ) && + el.click && nodeName( el, "input" ) ) { + + leverageNative( el, "click" ); + } + + // Return non-false to allow normal event-path propagation + return true; + }, + + // For cross-browser consistency, suppress native .click() on links + // Also prevent it if we're currently inside a leveraged native-event stack + _default: function( event ) { + var target = event.target; + return rcheckableType.test( target.type ) && + target.click && nodeName( target, "input" ) && + dataPriv.get( target, "click" ) || + nodeName( target, "a" ); + } + }, + + beforeunload: { + postDispatch: function( event ) { + + // Support: Firefox 20+ + // Firefox doesn't alert if the returnValue field is not set. + if ( event.result !== undefined && event.originalEvent ) { + event.originalEvent.returnValue = event.result; + } + } + } + } +}; + +// Ensure the presence of an event listener that handles manually-triggered +// synthetic events by interrupting progress until reinvoked in response to +// *native* events that it fires directly, ensuring that state changes have +// already occurred before other listeners are invoked. +function leverageNative( el, type, expectSync ) { + + // Missing expectSync indicates a trigger call, which must force setup through jQuery.event.add + if ( !expectSync ) { + if ( dataPriv.get( el, type ) === undefined ) { + jQuery.event.add( el, type, returnTrue ); + } + return; + } + + // Register the controller as a special universal handler for all event namespaces + dataPriv.set( el, type, false ); + jQuery.event.add( el, type, { + namespace: false, + handler: function( event ) { + var notAsync, result, + saved = dataPriv.get( this, type ); + + if ( ( event.isTrigger & 1 ) && this[ type ] ) { + + // Interrupt processing of the outer synthetic .trigger()ed event + // Saved data should be false in such cases, but might be a leftover capture object + // from an async native handler (gh-4350) + if ( !saved.length ) { + + // Store arguments for use when handling the inner native event + // There will always be at least one argument (an event object), so this array + // will not be confused with a leftover capture object. + saved = slice.call( arguments ); + dataPriv.set( this, type, saved ); + + // Trigger the native event and capture its result + // Support: IE <=9 - 11+ + // focus() and blur() are asynchronous + notAsync = expectSync( this, type ); + this[ type ](); + result = dataPriv.get( this, type ); + if ( saved !== result || notAsync ) { + dataPriv.set( this, type, false ); + } else { + result = {}; + } + if ( saved !== result ) { + + // Cancel the outer synthetic event + event.stopImmediatePropagation(); + event.preventDefault(); + return result.value; + } + + // If this is an inner synthetic event for an event with a bubbling surrogate + // (focus or blur), assume that the surrogate already propagated from triggering the + // native event and prevent that from happening again here. + // This technically gets the ordering wrong w.r.t. to `.trigger()` (in which the + // bubbling surrogate propagates *after* the non-bubbling base), but that seems + // less bad than duplication. + } else if ( ( jQuery.event.special[ type ] || {} ).delegateType ) { + event.stopPropagation(); + } + + // If this is a native event triggered above, everything is now in order + // Fire an inner synthetic event with the original arguments + } else if ( saved.length ) { + + // ...and capture the result + dataPriv.set( this, type, { + value: jQuery.event.trigger( + + // Support: IE <=9 - 11+ + // Extend with the prototype to reset the above stopImmediatePropagation() + jQuery.extend( saved[ 0 ], jQuery.Event.prototype ), + saved.slice( 1 ), + this + ) + } ); + + // Abort handling of the native event + event.stopImmediatePropagation(); + } + } + } ); +} + +jQuery.removeEvent = function( elem, type, handle ) { + + // This "if" is needed for plain objects + if ( elem.removeEventListener ) { + elem.removeEventListener( type, handle ); + } +}; + +jQuery.Event = function( src, props ) { + + // Allow instantiation without the 'new' keyword + if ( !( this instanceof jQuery.Event ) ) { + return new jQuery.Event( src, props ); + } + + // Event object + if ( src && src.type ) { + this.originalEvent = src; + this.type = src.type; + + // Events bubbling up the document may have been marked as prevented + // by a handler lower down the tree; reflect the correct value. + this.isDefaultPrevented = src.defaultPrevented || + src.defaultPrevented === undefined && + + // Support: Android <=2.3 only + src.returnValue === false ? + returnTrue : + returnFalse; + + // Create target properties + // Support: Safari <=6 - 7 only + // Target should not be a text node (#504, #13143) + this.target = ( src.target && src.target.nodeType === 3 ) ? + src.target.parentNode : + src.target; + + this.currentTarget = src.currentTarget; + this.relatedTarget = src.relatedTarget; + + // Event type + } else { + this.type = src; + } + + // Put explicitly provided properties onto the event object + if ( props ) { + jQuery.extend( this, props ); + } + + // Create a timestamp if incoming event doesn't have one + this.timeStamp = src && src.timeStamp || Date.now(); + + // Mark it as fixed + this[ jQuery.expando ] = true; +}; + +// jQuery.Event is based on DOM3 Events as specified by the ECMAScript Language Binding +// https://www.w3.org/TR/2003/WD-DOM-Level-3-Events-20030331/ecma-script-binding.html +jQuery.Event.prototype = { + constructor: jQuery.Event, + isDefaultPrevented: returnFalse, + isPropagationStopped: returnFalse, + isImmediatePropagationStopped: returnFalse, + isSimulated: false, + + preventDefault: function() { + var e = this.originalEvent; + + this.isDefaultPrevented = returnTrue; + + if ( e && !this.isSimulated ) { + e.preventDefault(); + } + }, + stopPropagation: function() { + var e = this.originalEvent; + + this.isPropagationStopped = returnTrue; + + if ( e && !this.isSimulated ) { + e.stopPropagation(); + } + }, + stopImmediatePropagation: function() { + var e = this.originalEvent; + + this.isImmediatePropagationStopped = returnTrue; + + if ( e && !this.isSimulated ) { + e.stopImmediatePropagation(); + } + + this.stopPropagation(); + } +}; + +// Includes all common event props including KeyEvent and MouseEvent specific props +jQuery.each( { + altKey: true, + bubbles: true, + cancelable: true, + changedTouches: true, + ctrlKey: true, + detail: true, + eventPhase: true, + metaKey: true, + pageX: true, + pageY: true, + shiftKey: true, + view: true, + "char": true, + code: true, + charCode: true, + key: true, + keyCode: true, + button: true, + buttons: true, + clientX: true, + clientY: true, + offsetX: true, + offsetY: true, + pointerId: true, + pointerType: true, + screenX: true, + screenY: true, + targetTouches: true, + toElement: true, + touches: true, + + which: function( event ) { + var button = event.button; + + // Add which for key events + if ( event.which == null && rkeyEvent.test( event.type ) ) { + return event.charCode != null ? event.charCode : event.keyCode; + } + + // Add which for click: 1 === left; 2 === middle; 3 === right + if ( !event.which && button !== undefined && rmouseEvent.test( event.type ) ) { + if ( button & 1 ) { + return 1; + } + + if ( button & 2 ) { + return 3; + } + + if ( button & 4 ) { + return 2; + } + + return 0; + } + + return event.which; + } +}, jQuery.event.addProp ); + +jQuery.each( { focus: "focusin", blur: "focusout" }, function( type, delegateType ) { + jQuery.event.special[ type ] = { + + // Utilize native event if possible so blur/focus sequence is correct + setup: function() { + + // Claim the first handler + // dataPriv.set( this, "focus", ... ) + // dataPriv.set( this, "blur", ... ) + leverageNative( this, type, expectSync ); + + // Return false to allow normal processing in the caller + return false; + }, + trigger: function() { + + // Force setup before trigger + leverageNative( this, type ); + + // Return non-false to allow normal event-path propagation + return true; + }, + + delegateType: delegateType + }; +} ); + +// Create mouseenter/leave events using mouseover/out and event-time checks +// so that event delegation works in jQuery. +// Do the same for pointerenter/pointerleave and pointerover/pointerout +// +// Support: Safari 7 only +// Safari sends mouseenter too often; see: +// https://bugs.chromium.org/p/chromium/issues/detail?id=470258 +// for the description of the bug (it existed in older Chrome versions as well). +jQuery.each( { + mouseenter: "mouseover", + mouseleave: "mouseout", + pointerenter: "pointerover", + pointerleave: "pointerout" +}, function( orig, fix ) { + jQuery.event.special[ orig ] = { + delegateType: fix, + bindType: fix, + + handle: function( event ) { + var ret, + target = this, + related = event.relatedTarget, + handleObj = event.handleObj; + + // For mouseenter/leave call the handler if related is outside the target. + // NB: No relatedTarget if the mouse left/entered the browser window + if ( !related || ( related !== target && !jQuery.contains( target, related ) ) ) { + event.type = handleObj.origType; + ret = handleObj.handler.apply( this, arguments ); + event.type = fix; + } + return ret; + } + }; +} ); + +jQuery.fn.extend( { + + on: function( types, selector, data, fn ) { + return on( this, types, selector, data, fn ); + }, + one: function( types, selector, data, fn ) { + return on( this, types, selector, data, fn, 1 ); + }, + off: function( types, selector, fn ) { + var handleObj, type; + if ( types && types.preventDefault && types.handleObj ) { + + // ( event ) dispatched jQuery.Event + handleObj = types.handleObj; + jQuery( types.delegateTarget ).off( + handleObj.namespace ? + handleObj.origType + "." + handleObj.namespace : + handleObj.origType, + handleObj.selector, + handleObj.handler + ); + return this; + } + if ( typeof types === "object" ) { + + // ( types-object [, selector] ) + for ( type in types ) { + this.off( type, selector, types[ type ] ); + } + return this; + } + if ( selector === false || typeof selector === "function" ) { + + // ( types [, fn] ) + fn = selector; + selector = undefined; + } + if ( fn === false ) { + fn = returnFalse; + } + return this.each( function() { + jQuery.event.remove( this, types, fn, selector ); + } ); + } +} ); + + +var + + // Support: IE <=10 - 11, Edge 12 - 13 only + // In IE/Edge using regex groups here causes severe slowdowns. + // See https://connect.microsoft.com/IE/feedback/details/1736512/ + rnoInnerhtml = /\s*$/g; + +// Prefer a tbody over its parent table for containing new rows +function manipulationTarget( elem, content ) { + if ( nodeName( elem, "table" ) && + nodeName( content.nodeType !== 11 ? content : content.firstChild, "tr" ) ) { + + return jQuery( elem ).children( "tbody" )[ 0 ] || elem; + } + + return elem; +} + +// Replace/restore the type attribute of script elements for safe DOM manipulation +function disableScript( elem ) { + elem.type = ( elem.getAttribute( "type" ) !== null ) + "/" + elem.type; + return elem; +} +function restoreScript( elem ) { + if ( ( elem.type || "" ).slice( 0, 5 ) === "true/" ) { + elem.type = elem.type.slice( 5 ); + } else { + elem.removeAttribute( "type" ); + } + + return elem; +} + +function cloneCopyEvent( src, dest ) { + var i, l, type, pdataOld, udataOld, udataCur, events; + + if ( dest.nodeType !== 1 ) { + return; + } + + // 1. Copy private data: events, handlers, etc. + if ( dataPriv.hasData( src ) ) { + pdataOld = dataPriv.get( src ); + events = pdataOld.events; + + if ( events ) { + dataPriv.remove( dest, "handle events" ); + + for ( type in events ) { + for ( i = 0, l = events[ type ].length; i < l; i++ ) { + jQuery.event.add( dest, type, events[ type ][ i ] ); + } + } + } + } + + // 2. Copy user data + if ( dataUser.hasData( src ) ) { + udataOld = dataUser.access( src ); + udataCur = jQuery.extend( {}, udataOld ); + + dataUser.set( dest, udataCur ); + } +} + +// Fix IE bugs, see support tests +function fixInput( src, dest ) { + var nodeName = dest.nodeName.toLowerCase(); + + // Fails to persist the checked state of a cloned checkbox or radio button. + if ( nodeName === "input" && rcheckableType.test( src.type ) ) { + dest.checked = src.checked; + + // Fails to return the selected option to the default selected state when cloning options + } else if ( nodeName === "input" || nodeName === "textarea" ) { + dest.defaultValue = src.defaultValue; + } +} + +function domManip( collection, args, callback, ignored ) { + + // Flatten any nested arrays + args = flat( args ); + + var fragment, first, scripts, hasScripts, node, doc, + i = 0, + l = collection.length, + iNoClone = l - 1, + value = args[ 0 ], + valueIsFunction = isFunction( value ); + + // We can't cloneNode fragments that contain checked, in WebKit + if ( valueIsFunction || + ( l > 1 && typeof value === "string" && + !support.checkClone && rchecked.test( value ) ) ) { + return collection.each( function( index ) { + var self = collection.eq( index ); + if ( valueIsFunction ) { + args[ 0 ] = value.call( this, index, self.html() ); + } + domManip( self, args, callback, ignored ); + } ); + } + + if ( l ) { + fragment = buildFragment( args, collection[ 0 ].ownerDocument, false, collection, ignored ); + first = fragment.firstChild; + + if ( fragment.childNodes.length === 1 ) { + fragment = first; + } + + // Require either new content or an interest in ignored elements to invoke the callback + if ( first || ignored ) { + scripts = jQuery.map( getAll( fragment, "script" ), disableScript ); + hasScripts = scripts.length; + + // Use the original fragment for the last item + // instead of the first because it can end up + // being emptied incorrectly in certain situations (#8070). + for ( ; i < l; i++ ) { + node = fragment; + + if ( i !== iNoClone ) { + node = jQuery.clone( node, true, true ); + + // Keep references to cloned scripts for later restoration + if ( hasScripts ) { + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + jQuery.merge( scripts, getAll( node, "script" ) ); + } + } + + callback.call( collection[ i ], node, i ); + } + + if ( hasScripts ) { + doc = scripts[ scripts.length - 1 ].ownerDocument; + + // Reenable scripts + jQuery.map( scripts, restoreScript ); + + // Evaluate executable scripts on first document insertion + for ( i = 0; i < hasScripts; i++ ) { + node = scripts[ i ]; + if ( rscriptType.test( node.type || "" ) && + !dataPriv.access( node, "globalEval" ) && + jQuery.contains( doc, node ) ) { + + if ( node.src && ( node.type || "" ).toLowerCase() !== "module" ) { + + // Optional AJAX dependency, but won't run scripts if not present + if ( jQuery._evalUrl && !node.noModule ) { + jQuery._evalUrl( node.src, { + nonce: node.nonce || node.getAttribute( "nonce" ) + }, doc ); + } + } else { + DOMEval( node.textContent.replace( rcleanScript, "" ), node, doc ); + } + } + } + } + } + } + + return collection; +} + +function remove( elem, selector, keepData ) { + var node, + nodes = selector ? jQuery.filter( selector, elem ) : elem, + i = 0; + + for ( ; ( node = nodes[ i ] ) != null; i++ ) { + if ( !keepData && node.nodeType === 1 ) { + jQuery.cleanData( getAll( node ) ); + } + + if ( node.parentNode ) { + if ( keepData && isAttached( node ) ) { + setGlobalEval( getAll( node, "script" ) ); + } + node.parentNode.removeChild( node ); + } + } + + return elem; +} + +jQuery.extend( { + htmlPrefilter: function( html ) { + return html; + }, + + clone: function( elem, dataAndEvents, deepDataAndEvents ) { + var i, l, srcElements, destElements, + clone = elem.cloneNode( true ), + inPage = isAttached( elem ); + + // Fix IE cloning issues + if ( !support.noCloneChecked && ( elem.nodeType === 1 || elem.nodeType === 11 ) && + !jQuery.isXMLDoc( elem ) ) { + + // We eschew Sizzle here for performance reasons: https://jsperf.com/getall-vs-sizzle/2 + destElements = getAll( clone ); + srcElements = getAll( elem ); + + for ( i = 0, l = srcElements.length; i < l; i++ ) { + fixInput( srcElements[ i ], destElements[ i ] ); + } + } + + // Copy the events from the original to the clone + if ( dataAndEvents ) { + if ( deepDataAndEvents ) { + srcElements = srcElements || getAll( elem ); + destElements = destElements || getAll( clone ); + + for ( i = 0, l = srcElements.length; i < l; i++ ) { + cloneCopyEvent( srcElements[ i ], destElements[ i ] ); + } + } else { + cloneCopyEvent( elem, clone ); + } + } + + // Preserve script evaluation history + destElements = getAll( clone, "script" ); + if ( destElements.length > 0 ) { + setGlobalEval( destElements, !inPage && getAll( elem, "script" ) ); + } + + // Return the cloned set + return clone; + }, + + cleanData: function( elems ) { + var data, elem, type, + special = jQuery.event.special, + i = 0; + + for ( ; ( elem = elems[ i ] ) !== undefined; i++ ) { + if ( acceptData( elem ) ) { + if ( ( data = elem[ dataPriv.expando ] ) ) { + if ( data.events ) { + for ( type in data.events ) { + if ( special[ type ] ) { + jQuery.event.remove( elem, type ); + + // This is a shortcut to avoid jQuery.event.remove's overhead + } else { + jQuery.removeEvent( elem, type, data.handle ); + } + } + } + + // Support: Chrome <=35 - 45+ + // Assign undefined instead of using delete, see Data#remove + elem[ dataPriv.expando ] = undefined; + } + if ( elem[ dataUser.expando ] ) { + + // Support: Chrome <=35 - 45+ + // Assign undefined instead of using delete, see Data#remove + elem[ dataUser.expando ] = undefined; + } + } + } + } +} ); + +jQuery.fn.extend( { + detach: function( selector ) { + return remove( this, selector, true ); + }, + + remove: function( selector ) { + return remove( this, selector ); + }, + + text: function( value ) { + return access( this, function( value ) { + return value === undefined ? + jQuery.text( this ) : + this.empty().each( function() { + if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { + this.textContent = value; + } + } ); + }, null, value, arguments.length ); + }, + + append: function() { + return domManip( this, arguments, function( elem ) { + if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { + var target = manipulationTarget( this, elem ); + target.appendChild( elem ); + } + } ); + }, + + prepend: function() { + return domManip( this, arguments, function( elem ) { + if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { + var target = manipulationTarget( this, elem ); + target.insertBefore( elem, target.firstChild ); + } + } ); + }, + + before: function() { + return domManip( this, arguments, function( elem ) { + if ( this.parentNode ) { + this.parentNode.insertBefore( elem, this ); + } + } ); + }, + + after: function() { + return domManip( this, arguments, function( elem ) { + if ( this.parentNode ) { + this.parentNode.insertBefore( elem, this.nextSibling ); + } + } ); + }, + + empty: function() { + var elem, + i = 0; + + for ( ; ( elem = this[ i ] ) != null; i++ ) { + if ( elem.nodeType === 1 ) { + + // Prevent memory leaks + jQuery.cleanData( getAll( elem, false ) ); + + // Remove any remaining nodes + elem.textContent = ""; + } + } + + return this; + }, + + clone: function( dataAndEvents, deepDataAndEvents ) { + dataAndEvents = dataAndEvents == null ? false : dataAndEvents; + deepDataAndEvents = deepDataAndEvents == null ? dataAndEvents : deepDataAndEvents; + + return this.map( function() { + return jQuery.clone( this, dataAndEvents, deepDataAndEvents ); + } ); + }, + + html: function( value ) { + return access( this, function( value ) { + var elem = this[ 0 ] || {}, + i = 0, + l = this.length; + + if ( value === undefined && elem.nodeType === 1 ) { + return elem.innerHTML; + } + + // See if we can take a shortcut and just use innerHTML + if ( typeof value === "string" && !rnoInnerhtml.test( value ) && + !wrapMap[ ( rtagName.exec( value ) || [ "", "" ] )[ 1 ].toLowerCase() ] ) { + + value = jQuery.htmlPrefilter( value ); + + try { + for ( ; i < l; i++ ) { + elem = this[ i ] || {}; + + // Remove element nodes and prevent memory leaks + if ( elem.nodeType === 1 ) { + jQuery.cleanData( getAll( elem, false ) ); + elem.innerHTML = value; + } + } + + elem = 0; + + // If using innerHTML throws an exception, use the fallback method + } catch ( e ) {} + } + + if ( elem ) { + this.empty().append( value ); + } + }, null, value, arguments.length ); + }, + + replaceWith: function() { + var ignored = []; + + // Make the changes, replacing each non-ignored context element with the new content + return domManip( this, arguments, function( elem ) { + var parent = this.parentNode; + + if ( jQuery.inArray( this, ignored ) < 0 ) { + jQuery.cleanData( getAll( this ) ); + if ( parent ) { + parent.replaceChild( elem, this ); + } + } + + // Force callback invocation + }, ignored ); + } +} ); + +jQuery.each( { + appendTo: "append", + prependTo: "prepend", + insertBefore: "before", + insertAfter: "after", + replaceAll: "replaceWith" +}, function( name, original ) { + jQuery.fn[ name ] = function( selector ) { + var elems, + ret = [], + insert = jQuery( selector ), + last = insert.length - 1, + i = 0; + + for ( ; i <= last; i++ ) { + elems = i === last ? this : this.clone( true ); + jQuery( insert[ i ] )[ original ]( elems ); + + // Support: Android <=4.0 only, PhantomJS 1 only + // .get() because push.apply(_, arraylike) throws on ancient WebKit + push.apply( ret, elems.get() ); + } + + return this.pushStack( ret ); + }; +} ); +var rnumnonpx = new RegExp( "^(" + pnum + ")(?!px)[a-z%]+$", "i" ); + +var getStyles = function( elem ) { + + // Support: IE <=11 only, Firefox <=30 (#15098, #14150) + // IE throws on elements created in popups + // FF meanwhile throws on frame elements through "defaultView.getComputedStyle" + var view = elem.ownerDocument.defaultView; + + if ( !view || !view.opener ) { + view = window; + } + + return view.getComputedStyle( elem ); + }; + +var swap = function( elem, options, callback ) { + var ret, name, + old = {}; + + // Remember the old values, and insert the new ones + for ( name in options ) { + old[ name ] = elem.style[ name ]; + elem.style[ name ] = options[ name ]; + } + + ret = callback.call( elem ); + + // Revert the old values + for ( name in options ) { + elem.style[ name ] = old[ name ]; + } + + return ret; +}; + + +var rboxStyle = new RegExp( cssExpand.join( "|" ), "i" ); + + + +( function() { + + // Executing both pixelPosition & boxSizingReliable tests require only one layout + // so they're executed at the same time to save the second computation. + function computeStyleTests() { + + // This is a singleton, we need to execute it only once + if ( !div ) { + return; + } + + container.style.cssText = "position:absolute;left:-11111px;width:60px;" + + "margin-top:1px;padding:0;border:0"; + div.style.cssText = + "position:relative;display:block;box-sizing:border-box;overflow:scroll;" + + "margin:auto;border:1px;padding:1px;" + + "width:60%;top:1%"; + documentElement.appendChild( container ).appendChild( div ); + + var divStyle = window.getComputedStyle( div ); + pixelPositionVal = divStyle.top !== "1%"; + + // Support: Android 4.0 - 4.3 only, Firefox <=3 - 44 + reliableMarginLeftVal = roundPixelMeasures( divStyle.marginLeft ) === 12; + + // Support: Android 4.0 - 4.3 only, Safari <=9.1 - 10.1, iOS <=7.0 - 9.3 + // Some styles come back with percentage values, even though they shouldn't + div.style.right = "60%"; + pixelBoxStylesVal = roundPixelMeasures( divStyle.right ) === 36; + + // Support: IE 9 - 11 only + // Detect misreporting of content dimensions for box-sizing:border-box elements + boxSizingReliableVal = roundPixelMeasures( divStyle.width ) === 36; + + // Support: IE 9 only + // Detect overflow:scroll screwiness (gh-3699) + // Support: Chrome <=64 + // Don't get tricked when zoom affects offsetWidth (gh-4029) + div.style.position = "absolute"; + scrollboxSizeVal = roundPixelMeasures( div.offsetWidth / 3 ) === 12; + + documentElement.removeChild( container ); + + // Nullify the div so it wouldn't be stored in the memory and + // it will also be a sign that checks already performed + div = null; + } + + function roundPixelMeasures( measure ) { + return Math.round( parseFloat( measure ) ); + } + + var pixelPositionVal, boxSizingReliableVal, scrollboxSizeVal, pixelBoxStylesVal, + reliableTrDimensionsVal, reliableMarginLeftVal, + container = document.createElement( "div" ), + div = document.createElement( "div" ); + + // Finish early in limited (non-browser) environments + if ( !div.style ) { + return; + } + + // Support: IE <=9 - 11 only + // Style of cloned element affects source element cloned (#8908) + div.style.backgroundClip = "content-box"; + div.cloneNode( true ).style.backgroundClip = ""; + support.clearCloneStyle = div.style.backgroundClip === "content-box"; + + jQuery.extend( support, { + boxSizingReliable: function() { + computeStyleTests(); + return boxSizingReliableVal; + }, + pixelBoxStyles: function() { + computeStyleTests(); + return pixelBoxStylesVal; + }, + pixelPosition: function() { + computeStyleTests(); + return pixelPositionVal; + }, + reliableMarginLeft: function() { + computeStyleTests(); + return reliableMarginLeftVal; + }, + scrollboxSize: function() { + computeStyleTests(); + return scrollboxSizeVal; + }, + + // Support: IE 9 - 11+, Edge 15 - 18+ + // IE/Edge misreport `getComputedStyle` of table rows with width/height + // set in CSS while `offset*` properties report correct values. + // Behavior in IE 9 is more subtle than in newer versions & it passes + // some versions of this test; make sure not to make it pass there! + reliableTrDimensions: function() { + var table, tr, trChild, trStyle; + if ( reliableTrDimensionsVal == null ) { + table = document.createElement( "table" ); + tr = document.createElement( "tr" ); + trChild = document.createElement( "div" ); + + table.style.cssText = "position:absolute;left:-11111px"; + tr.style.height = "1px"; + trChild.style.height = "9px"; + + documentElement + .appendChild( table ) + .appendChild( tr ) + .appendChild( trChild ); + + trStyle = window.getComputedStyle( tr ); + reliableTrDimensionsVal = parseInt( trStyle.height ) > 3; + + documentElement.removeChild( table ); + } + return reliableTrDimensionsVal; + } + } ); +} )(); + + +function curCSS( elem, name, computed ) { + var width, minWidth, maxWidth, ret, + + // Support: Firefox 51+ + // Retrieving style before computed somehow + // fixes an issue with getting wrong values + // on detached elements + style = elem.style; + + computed = computed || getStyles( elem ); + + // getPropertyValue is needed for: + // .css('filter') (IE 9 only, #12537) + // .css('--customProperty) (#3144) + if ( computed ) { + ret = computed.getPropertyValue( name ) || computed[ name ]; + + if ( ret === "" && !isAttached( elem ) ) { + ret = jQuery.style( elem, name ); + } + + // A tribute to the "awesome hack by Dean Edwards" + // Android Browser returns percentage for some values, + // but width seems to be reliably pixels. + // This is against the CSSOM draft spec: + // https://drafts.csswg.org/cssom/#resolved-values + if ( !support.pixelBoxStyles() && rnumnonpx.test( ret ) && rboxStyle.test( name ) ) { + + // Remember the original values + width = style.width; + minWidth = style.minWidth; + maxWidth = style.maxWidth; + + // Put in the new values to get a computed value out + style.minWidth = style.maxWidth = style.width = ret; + ret = computed.width; + + // Revert the changed values + style.width = width; + style.minWidth = minWidth; + style.maxWidth = maxWidth; + } + } + + return ret !== undefined ? + + // Support: IE <=9 - 11 only + // IE returns zIndex value as an integer. + ret + "" : + ret; +} + + +function addGetHookIf( conditionFn, hookFn ) { + + // Define the hook, we'll check on the first run if it's really needed. + return { + get: function() { + if ( conditionFn() ) { + + // Hook not needed (or it's not possible to use it due + // to missing dependency), remove it. + delete this.get; + return; + } + + // Hook needed; redefine it so that the support test is not executed again. + return ( this.get = hookFn ).apply( this, arguments ); + } + }; +} + + +var cssPrefixes = [ "Webkit", "Moz", "ms" ], + emptyStyle = document.createElement( "div" ).style, + vendorProps = {}; + +// Return a vendor-prefixed property or undefined +function vendorPropName( name ) { + + // Check for vendor prefixed names + var capName = name[ 0 ].toUpperCase() + name.slice( 1 ), + i = cssPrefixes.length; + + while ( i-- ) { + name = cssPrefixes[ i ] + capName; + if ( name in emptyStyle ) { + return name; + } + } +} + +// Return a potentially-mapped jQuery.cssProps or vendor prefixed property +function finalPropName( name ) { + var final = jQuery.cssProps[ name ] || vendorProps[ name ]; + + if ( final ) { + return final; + } + if ( name in emptyStyle ) { + return name; + } + return vendorProps[ name ] = vendorPropName( name ) || name; +} + + +var + + // Swappable if display is none or starts with table + // except "table", "table-cell", or "table-caption" + // See here for display values: https://developer.mozilla.org/en-US/docs/CSS/display + rdisplayswap = /^(none|table(?!-c[ea]).+)/, + rcustomProp = /^--/, + cssShow = { position: "absolute", visibility: "hidden", display: "block" }, + cssNormalTransform = { + letterSpacing: "0", + fontWeight: "400" + }; + +function setPositiveNumber( _elem, value, subtract ) { + + // Any relative (+/-) values have already been + // normalized at this point + var matches = rcssNum.exec( value ); + return matches ? + + // Guard against undefined "subtract", e.g., when used as in cssHooks + Math.max( 0, matches[ 2 ] - ( subtract || 0 ) ) + ( matches[ 3 ] || "px" ) : + value; +} + +function boxModelAdjustment( elem, dimension, box, isBorderBox, styles, computedVal ) { + var i = dimension === "width" ? 1 : 0, + extra = 0, + delta = 0; + + // Adjustment may not be necessary + if ( box === ( isBorderBox ? "border" : "content" ) ) { + return 0; + } + + for ( ; i < 4; i += 2 ) { + + // Both box models exclude margin + if ( box === "margin" ) { + delta += jQuery.css( elem, box + cssExpand[ i ], true, styles ); + } + + // If we get here with a content-box, we're seeking "padding" or "border" or "margin" + if ( !isBorderBox ) { + + // Add padding + delta += jQuery.css( elem, "padding" + cssExpand[ i ], true, styles ); + + // For "border" or "margin", add border + if ( box !== "padding" ) { + delta += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); + + // But still keep track of it otherwise + } else { + extra += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); + } + + // If we get here with a border-box (content + padding + border), we're seeking "content" or + // "padding" or "margin" + } else { + + // For "content", subtract padding + if ( box === "content" ) { + delta -= jQuery.css( elem, "padding" + cssExpand[ i ], true, styles ); + } + + // For "content" or "padding", subtract border + if ( box !== "margin" ) { + delta -= jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); + } + } + } + + // Account for positive content-box scroll gutter when requested by providing computedVal + if ( !isBorderBox && computedVal >= 0 ) { + + // offsetWidth/offsetHeight is a rounded sum of content, padding, scroll gutter, and border + // Assuming integer scroll gutter, subtract the rest and round down + delta += Math.max( 0, Math.ceil( + elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] - + computedVal - + delta - + extra - + 0.5 + + // If offsetWidth/offsetHeight is unknown, then we can't determine content-box scroll gutter + // Use an explicit zero to avoid NaN (gh-3964) + ) ) || 0; + } + + return delta; +} + +function getWidthOrHeight( elem, dimension, extra ) { + + // Start with computed style + var styles = getStyles( elem ), + + // To avoid forcing a reflow, only fetch boxSizing if we need it (gh-4322). + // Fake content-box until we know it's needed to know the true value. + boxSizingNeeded = !support.boxSizingReliable() || extra, + isBorderBox = boxSizingNeeded && + jQuery.css( elem, "boxSizing", false, styles ) === "border-box", + valueIsBorderBox = isBorderBox, + + val = curCSS( elem, dimension, styles ), + offsetProp = "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ); + + // Support: Firefox <=54 + // Return a confounding non-pixel value or feign ignorance, as appropriate. + if ( rnumnonpx.test( val ) ) { + if ( !extra ) { + return val; + } + val = "auto"; + } + + + // Support: IE 9 - 11 only + // Use offsetWidth/offsetHeight for when box sizing is unreliable. + // In those cases, the computed value can be trusted to be border-box. + if ( ( !support.boxSizingReliable() && isBorderBox || + + // Support: IE 10 - 11+, Edge 15 - 18+ + // IE/Edge misreport `getComputedStyle` of table rows with width/height + // set in CSS while `offset*` properties report correct values. + // Interestingly, in some cases IE 9 doesn't suffer from this issue. + !support.reliableTrDimensions() && nodeName( elem, "tr" ) || + + // Fall back to offsetWidth/offsetHeight when value is "auto" + // This happens for inline elements with no explicit setting (gh-3571) + val === "auto" || + + // Support: Android <=4.1 - 4.3 only + // Also use offsetWidth/offsetHeight for misreported inline dimensions (gh-3602) + !parseFloat( val ) && jQuery.css( elem, "display", false, styles ) === "inline" ) && + + // Make sure the element is visible & connected + elem.getClientRects().length ) { + + isBorderBox = jQuery.css( elem, "boxSizing", false, styles ) === "border-box"; + + // Where available, offsetWidth/offsetHeight approximate border box dimensions. + // Where not available (e.g., SVG), assume unreliable box-sizing and interpret the + // retrieved value as a content box dimension. + valueIsBorderBox = offsetProp in elem; + if ( valueIsBorderBox ) { + val = elem[ offsetProp ]; + } + } + + // Normalize "" and auto + val = parseFloat( val ) || 0; + + // Adjust for the element's box model + return ( val + + boxModelAdjustment( + elem, + dimension, + extra || ( isBorderBox ? "border" : "content" ), + valueIsBorderBox, + styles, + + // Provide the current computed size to request scroll gutter calculation (gh-3589) + val + ) + ) + "px"; +} + +jQuery.extend( { + + // Add in style property hooks for overriding the default + // behavior of getting and setting a style property + cssHooks: { + opacity: { + get: function( elem, computed ) { + if ( computed ) { + + // We should always get a number back from opacity + var ret = curCSS( elem, "opacity" ); + return ret === "" ? "1" : ret; + } + } + } + }, + + // Don't automatically add "px" to these possibly-unitless properties + cssNumber: { + "animationIterationCount": true, + "columnCount": true, + "fillOpacity": true, + "flexGrow": true, + "flexShrink": true, + "fontWeight": true, + "gridArea": true, + "gridColumn": true, + "gridColumnEnd": true, + "gridColumnStart": true, + "gridRow": true, + "gridRowEnd": true, + "gridRowStart": true, + "lineHeight": true, + "opacity": true, + "order": true, + "orphans": true, + "widows": true, + "zIndex": true, + "zoom": true + }, + + // Add in properties whose names you wish to fix before + // setting or getting the value + cssProps: {}, + + // Get and set the style property on a DOM Node + style: function( elem, name, value, extra ) { + + // Don't set styles on text and comment nodes + if ( !elem || elem.nodeType === 3 || elem.nodeType === 8 || !elem.style ) { + return; + } + + // Make sure that we're working with the right name + var ret, type, hooks, + origName = camelCase( name ), + isCustomProp = rcustomProp.test( name ), + style = elem.style; + + // Make sure that we're working with the right name. We don't + // want to query the value if it is a CSS custom property + // since they are user-defined. + if ( !isCustomProp ) { + name = finalPropName( origName ); + } + + // Gets hook for the prefixed version, then unprefixed version + hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ]; + + // Check if we're setting a value + if ( value !== undefined ) { + type = typeof value; + + // Convert "+=" or "-=" to relative numbers (#7345) + if ( type === "string" && ( ret = rcssNum.exec( value ) ) && ret[ 1 ] ) { + value = adjustCSS( elem, name, ret ); + + // Fixes bug #9237 + type = "number"; + } + + // Make sure that null and NaN values aren't set (#7116) + if ( value == null || value !== value ) { + return; + } + + // If a number was passed in, add the unit (except for certain CSS properties) + // The isCustomProp check can be removed in jQuery 4.0 when we only auto-append + // "px" to a few hardcoded values. + if ( type === "number" && !isCustomProp ) { + value += ret && ret[ 3 ] || ( jQuery.cssNumber[ origName ] ? "" : "px" ); + } + + // background-* props affect original clone's values + if ( !support.clearCloneStyle && value === "" && name.indexOf( "background" ) === 0 ) { + style[ name ] = "inherit"; + } + + // If a hook was provided, use that value, otherwise just set the specified value + if ( !hooks || !( "set" in hooks ) || + ( value = hooks.set( elem, value, extra ) ) !== undefined ) { + + if ( isCustomProp ) { + style.setProperty( name, value ); + } else { + style[ name ] = value; + } + } + + } else { + + // If a hook was provided get the non-computed value from there + if ( hooks && "get" in hooks && + ( ret = hooks.get( elem, false, extra ) ) !== undefined ) { + + return ret; + } + + // Otherwise just get the value from the style object + return style[ name ]; + } + }, + + css: function( elem, name, extra, styles ) { + var val, num, hooks, + origName = camelCase( name ), + isCustomProp = rcustomProp.test( name ); + + // Make sure that we're working with the right name. We don't + // want to modify the value if it is a CSS custom property + // since they are user-defined. + if ( !isCustomProp ) { + name = finalPropName( origName ); + } + + // Try prefixed name followed by the unprefixed name + hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ]; + + // If a hook was provided get the computed value from there + if ( hooks && "get" in hooks ) { + val = hooks.get( elem, true, extra ); + } + + // Otherwise, if a way to get the computed value exists, use that + if ( val === undefined ) { + val = curCSS( elem, name, styles ); + } + + // Convert "normal" to computed value + if ( val === "normal" && name in cssNormalTransform ) { + val = cssNormalTransform[ name ]; + } + + // Make numeric if forced or a qualifier was provided and val looks numeric + if ( extra === "" || extra ) { + num = parseFloat( val ); + return extra === true || isFinite( num ) ? num || 0 : val; + } + + return val; + } +} ); + +jQuery.each( [ "height", "width" ], function( _i, dimension ) { + jQuery.cssHooks[ dimension ] = { + get: function( elem, computed, extra ) { + if ( computed ) { + + // Certain elements can have dimension info if we invisibly show them + // but it must have a current display style that would benefit + return rdisplayswap.test( jQuery.css( elem, "display" ) ) && + + // Support: Safari 8+ + // Table columns in Safari have non-zero offsetWidth & zero + // getBoundingClientRect().width unless display is changed. + // Support: IE <=11 only + // Running getBoundingClientRect on a disconnected node + // in IE throws an error. + ( !elem.getClientRects().length || !elem.getBoundingClientRect().width ) ? + swap( elem, cssShow, function() { + return getWidthOrHeight( elem, dimension, extra ); + } ) : + getWidthOrHeight( elem, dimension, extra ); + } + }, + + set: function( elem, value, extra ) { + var matches, + styles = getStyles( elem ), + + // Only read styles.position if the test has a chance to fail + // to avoid forcing a reflow. + scrollboxSizeBuggy = !support.scrollboxSize() && + styles.position === "absolute", + + // To avoid forcing a reflow, only fetch boxSizing if we need it (gh-3991) + boxSizingNeeded = scrollboxSizeBuggy || extra, + isBorderBox = boxSizingNeeded && + jQuery.css( elem, "boxSizing", false, styles ) === "border-box", + subtract = extra ? + boxModelAdjustment( + elem, + dimension, + extra, + isBorderBox, + styles + ) : + 0; + + // Account for unreliable border-box dimensions by comparing offset* to computed and + // faking a content-box to get border and padding (gh-3699) + if ( isBorderBox && scrollboxSizeBuggy ) { + subtract -= Math.ceil( + elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] - + parseFloat( styles[ dimension ] ) - + boxModelAdjustment( elem, dimension, "border", false, styles ) - + 0.5 + ); + } + + // Convert to pixels if value adjustment is needed + if ( subtract && ( matches = rcssNum.exec( value ) ) && + ( matches[ 3 ] || "px" ) !== "px" ) { + + elem.style[ dimension ] = value; + value = jQuery.css( elem, dimension ); + } + + return setPositiveNumber( elem, value, subtract ); + } + }; +} ); + +jQuery.cssHooks.marginLeft = addGetHookIf( support.reliableMarginLeft, + function( elem, computed ) { + if ( computed ) { + return ( parseFloat( curCSS( elem, "marginLeft" ) ) || + elem.getBoundingClientRect().left - + swap( elem, { marginLeft: 0 }, function() { + return elem.getBoundingClientRect().left; + } ) + ) + "px"; + } + } +); + +// These hooks are used by animate to expand properties +jQuery.each( { + margin: "", + padding: "", + border: "Width" +}, function( prefix, suffix ) { + jQuery.cssHooks[ prefix + suffix ] = { + expand: function( value ) { + var i = 0, + expanded = {}, + + // Assumes a single number if not a string + parts = typeof value === "string" ? value.split( " " ) : [ value ]; + + for ( ; i < 4; i++ ) { + expanded[ prefix + cssExpand[ i ] + suffix ] = + parts[ i ] || parts[ i - 2 ] || parts[ 0 ]; + } + + return expanded; + } + }; + + if ( prefix !== "margin" ) { + jQuery.cssHooks[ prefix + suffix ].set = setPositiveNumber; + } +} ); + +jQuery.fn.extend( { + css: function( name, value ) { + return access( this, function( elem, name, value ) { + var styles, len, + map = {}, + i = 0; + + if ( Array.isArray( name ) ) { + styles = getStyles( elem ); + len = name.length; + + for ( ; i < len; i++ ) { + map[ name[ i ] ] = jQuery.css( elem, name[ i ], false, styles ); + } + + return map; + } + + return value !== undefined ? + jQuery.style( elem, name, value ) : + jQuery.css( elem, name ); + }, name, value, arguments.length > 1 ); + } +} ); + + +function Tween( elem, options, prop, end, easing ) { + return new Tween.prototype.init( elem, options, prop, end, easing ); +} +jQuery.Tween = Tween; + +Tween.prototype = { + constructor: Tween, + init: function( elem, options, prop, end, easing, unit ) { + this.elem = elem; + this.prop = prop; + this.easing = easing || jQuery.easing._default; + this.options = options; + this.start = this.now = this.cur(); + this.end = end; + this.unit = unit || ( jQuery.cssNumber[ prop ] ? "" : "px" ); + }, + cur: function() { + var hooks = Tween.propHooks[ this.prop ]; + + return hooks && hooks.get ? + hooks.get( this ) : + Tween.propHooks._default.get( this ); + }, + run: function( percent ) { + var eased, + hooks = Tween.propHooks[ this.prop ]; + + if ( this.options.duration ) { + this.pos = eased = jQuery.easing[ this.easing ]( + percent, this.options.duration * percent, 0, 1, this.options.duration + ); + } else { + this.pos = eased = percent; + } + this.now = ( this.end - this.start ) * eased + this.start; + + if ( this.options.step ) { + this.options.step.call( this.elem, this.now, this ); + } + + if ( hooks && hooks.set ) { + hooks.set( this ); + } else { + Tween.propHooks._default.set( this ); + } + return this; + } +}; + +Tween.prototype.init.prototype = Tween.prototype; + +Tween.propHooks = { + _default: { + get: function( tween ) { + var result; + + // Use a property on the element directly when it is not a DOM element, + // or when there is no matching style property that exists. + if ( tween.elem.nodeType !== 1 || + tween.elem[ tween.prop ] != null && tween.elem.style[ tween.prop ] == null ) { + return tween.elem[ tween.prop ]; + } + + // Passing an empty string as a 3rd parameter to .css will automatically + // attempt a parseFloat and fallback to a string if the parse fails. + // Simple values such as "10px" are parsed to Float; + // complex values such as "rotate(1rad)" are returned as-is. + result = jQuery.css( tween.elem, tween.prop, "" ); + + // Empty strings, null, undefined and "auto" are converted to 0. + return !result || result === "auto" ? 0 : result; + }, + set: function( tween ) { + + // Use step hook for back compat. + // Use cssHook if its there. + // Use .style if available and use plain properties where available. + if ( jQuery.fx.step[ tween.prop ] ) { + jQuery.fx.step[ tween.prop ]( tween ); + } else if ( tween.elem.nodeType === 1 && ( + jQuery.cssHooks[ tween.prop ] || + tween.elem.style[ finalPropName( tween.prop ) ] != null ) ) { + jQuery.style( tween.elem, tween.prop, tween.now + tween.unit ); + } else { + tween.elem[ tween.prop ] = tween.now; + } + } + } +}; + +// Support: IE <=9 only +// Panic based approach to setting things on disconnected nodes +Tween.propHooks.scrollTop = Tween.propHooks.scrollLeft = { + set: function( tween ) { + if ( tween.elem.nodeType && tween.elem.parentNode ) { + tween.elem[ tween.prop ] = tween.now; + } + } +}; + +jQuery.easing = { + linear: function( p ) { + return p; + }, + swing: function( p ) { + return 0.5 - Math.cos( p * Math.PI ) / 2; + }, + _default: "swing" +}; + +jQuery.fx = Tween.prototype.init; + +// Back compat <1.8 extension point +jQuery.fx.step = {}; + + + + +var + fxNow, inProgress, + rfxtypes = /^(?:toggle|show|hide)$/, + rrun = /queueHooks$/; + +function schedule() { + if ( inProgress ) { + if ( document.hidden === false && window.requestAnimationFrame ) { + window.requestAnimationFrame( schedule ); + } else { + window.setTimeout( schedule, jQuery.fx.interval ); + } + + jQuery.fx.tick(); + } +} + +// Animations created synchronously will run synchronously +function createFxNow() { + window.setTimeout( function() { + fxNow = undefined; + } ); + return ( fxNow = Date.now() ); +} + +// Generate parameters to create a standard animation +function genFx( type, includeWidth ) { + var which, + i = 0, + attrs = { height: type }; + + // If we include width, step value is 1 to do all cssExpand values, + // otherwise step value is 2 to skip over Left and Right + includeWidth = includeWidth ? 1 : 0; + for ( ; i < 4; i += 2 - includeWidth ) { + which = cssExpand[ i ]; + attrs[ "margin" + which ] = attrs[ "padding" + which ] = type; + } + + if ( includeWidth ) { + attrs.opacity = attrs.width = type; + } + + return attrs; +} + +function createTween( value, prop, animation ) { + var tween, + collection = ( Animation.tweeners[ prop ] || [] ).concat( Animation.tweeners[ "*" ] ), + index = 0, + length = collection.length; + for ( ; index < length; index++ ) { + if ( ( tween = collection[ index ].call( animation, prop, value ) ) ) { + + // We're done with this property + return tween; + } + } +} + +function defaultPrefilter( elem, props, opts ) { + var prop, value, toggle, hooks, oldfire, propTween, restoreDisplay, display, + isBox = "width" in props || "height" in props, + anim = this, + orig = {}, + style = elem.style, + hidden = elem.nodeType && isHiddenWithinTree( elem ), + dataShow = dataPriv.get( elem, "fxshow" ); + + // Queue-skipping animations hijack the fx hooks + if ( !opts.queue ) { + hooks = jQuery._queueHooks( elem, "fx" ); + if ( hooks.unqueued == null ) { + hooks.unqueued = 0; + oldfire = hooks.empty.fire; + hooks.empty.fire = function() { + if ( !hooks.unqueued ) { + oldfire(); + } + }; + } + hooks.unqueued++; + + anim.always( function() { + + // Ensure the complete handler is called before this completes + anim.always( function() { + hooks.unqueued--; + if ( !jQuery.queue( elem, "fx" ).length ) { + hooks.empty.fire(); + } + } ); + } ); + } + + // Detect show/hide animations + for ( prop in props ) { + value = props[ prop ]; + if ( rfxtypes.test( value ) ) { + delete props[ prop ]; + toggle = toggle || value === "toggle"; + if ( value === ( hidden ? "hide" : "show" ) ) { + + // Pretend to be hidden if this is a "show" and + // there is still data from a stopped show/hide + if ( value === "show" && dataShow && dataShow[ prop ] !== undefined ) { + hidden = true; + + // Ignore all other no-op show/hide data + } else { + continue; + } + } + orig[ prop ] = dataShow && dataShow[ prop ] || jQuery.style( elem, prop ); + } + } + + // Bail out if this is a no-op like .hide().hide() + propTween = !jQuery.isEmptyObject( props ); + if ( !propTween && jQuery.isEmptyObject( orig ) ) { + return; + } + + // Restrict "overflow" and "display" styles during box animations + if ( isBox && elem.nodeType === 1 ) { + + // Support: IE <=9 - 11, Edge 12 - 15 + // Record all 3 overflow attributes because IE does not infer the shorthand + // from identically-valued overflowX and overflowY and Edge just mirrors + // the overflowX value there. + opts.overflow = [ style.overflow, style.overflowX, style.overflowY ]; + + // Identify a display type, preferring old show/hide data over the CSS cascade + restoreDisplay = dataShow && dataShow.display; + if ( restoreDisplay == null ) { + restoreDisplay = dataPriv.get( elem, "display" ); + } + display = jQuery.css( elem, "display" ); + if ( display === "none" ) { + if ( restoreDisplay ) { + display = restoreDisplay; + } else { + + // Get nonempty value(s) by temporarily forcing visibility + showHide( [ elem ], true ); + restoreDisplay = elem.style.display || restoreDisplay; + display = jQuery.css( elem, "display" ); + showHide( [ elem ] ); + } + } + + // Animate inline elements as inline-block + if ( display === "inline" || display === "inline-block" && restoreDisplay != null ) { + if ( jQuery.css( elem, "float" ) === "none" ) { + + // Restore the original display value at the end of pure show/hide animations + if ( !propTween ) { + anim.done( function() { + style.display = restoreDisplay; + } ); + if ( restoreDisplay == null ) { + display = style.display; + restoreDisplay = display === "none" ? "" : display; + } + } + style.display = "inline-block"; + } + } + } + + if ( opts.overflow ) { + style.overflow = "hidden"; + anim.always( function() { + style.overflow = opts.overflow[ 0 ]; + style.overflowX = opts.overflow[ 1 ]; + style.overflowY = opts.overflow[ 2 ]; + } ); + } + + // Implement show/hide animations + propTween = false; + for ( prop in orig ) { + + // General show/hide setup for this element animation + if ( !propTween ) { + if ( dataShow ) { + if ( "hidden" in dataShow ) { + hidden = dataShow.hidden; + } + } else { + dataShow = dataPriv.access( elem, "fxshow", { display: restoreDisplay } ); + } + + // Store hidden/visible for toggle so `.stop().toggle()` "reverses" + if ( toggle ) { + dataShow.hidden = !hidden; + } + + // Show elements before animating them + if ( hidden ) { + showHide( [ elem ], true ); + } + + /* eslint-disable no-loop-func */ + + anim.done( function() { + + /* eslint-enable no-loop-func */ + + // The final step of a "hide" animation is actually hiding the element + if ( !hidden ) { + showHide( [ elem ] ); + } + dataPriv.remove( elem, "fxshow" ); + for ( prop in orig ) { + jQuery.style( elem, prop, orig[ prop ] ); + } + } ); + } + + // Per-property setup + propTween = createTween( hidden ? dataShow[ prop ] : 0, prop, anim ); + if ( !( prop in dataShow ) ) { + dataShow[ prop ] = propTween.start; + if ( hidden ) { + propTween.end = propTween.start; + propTween.start = 0; + } + } + } +} + +function propFilter( props, specialEasing ) { + var index, name, easing, value, hooks; + + // camelCase, specialEasing and expand cssHook pass + for ( index in props ) { + name = camelCase( index ); + easing = specialEasing[ name ]; + value = props[ index ]; + if ( Array.isArray( value ) ) { + easing = value[ 1 ]; + value = props[ index ] = value[ 0 ]; + } + + if ( index !== name ) { + props[ name ] = value; + delete props[ index ]; + } + + hooks = jQuery.cssHooks[ name ]; + if ( hooks && "expand" in hooks ) { + value = hooks.expand( value ); + delete props[ name ]; + + // Not quite $.extend, this won't overwrite existing keys. + // Reusing 'index' because we have the correct "name" + for ( index in value ) { + if ( !( index in props ) ) { + props[ index ] = value[ index ]; + specialEasing[ index ] = easing; + } + } + } else { + specialEasing[ name ] = easing; + } + } +} + +function Animation( elem, properties, options ) { + var result, + stopped, + index = 0, + length = Animation.prefilters.length, + deferred = jQuery.Deferred().always( function() { + + // Don't match elem in the :animated selector + delete tick.elem; + } ), + tick = function() { + if ( stopped ) { + return false; + } + var currentTime = fxNow || createFxNow(), + remaining = Math.max( 0, animation.startTime + animation.duration - currentTime ), + + // Support: Android 2.3 only + // Archaic crash bug won't allow us to use `1 - ( 0.5 || 0 )` (#12497) + temp = remaining / animation.duration || 0, + percent = 1 - temp, + index = 0, + length = animation.tweens.length; + + for ( ; index < length; index++ ) { + animation.tweens[ index ].run( percent ); + } + + deferred.notifyWith( elem, [ animation, percent, remaining ] ); + + // If there's more to do, yield + if ( percent < 1 && length ) { + return remaining; + } + + // If this was an empty animation, synthesize a final progress notification + if ( !length ) { + deferred.notifyWith( elem, [ animation, 1, 0 ] ); + } + + // Resolve the animation and report its conclusion + deferred.resolveWith( elem, [ animation ] ); + return false; + }, + animation = deferred.promise( { + elem: elem, + props: jQuery.extend( {}, properties ), + opts: jQuery.extend( true, { + specialEasing: {}, + easing: jQuery.easing._default + }, options ), + originalProperties: properties, + originalOptions: options, + startTime: fxNow || createFxNow(), + duration: options.duration, + tweens: [], + createTween: function( prop, end ) { + var tween = jQuery.Tween( elem, animation.opts, prop, end, + animation.opts.specialEasing[ prop ] || animation.opts.easing ); + animation.tweens.push( tween ); + return tween; + }, + stop: function( gotoEnd ) { + var index = 0, + + // If we are going to the end, we want to run all the tweens + // otherwise we skip this part + length = gotoEnd ? animation.tweens.length : 0; + if ( stopped ) { + return this; + } + stopped = true; + for ( ; index < length; index++ ) { + animation.tweens[ index ].run( 1 ); + } + + // Resolve when we played the last frame; otherwise, reject + if ( gotoEnd ) { + deferred.notifyWith( elem, [ animation, 1, 0 ] ); + deferred.resolveWith( elem, [ animation, gotoEnd ] ); + } else { + deferred.rejectWith( elem, [ animation, gotoEnd ] ); + } + return this; + } + } ), + props = animation.props; + + propFilter( props, animation.opts.specialEasing ); + + for ( ; index < length; index++ ) { + result = Animation.prefilters[ index ].call( animation, elem, props, animation.opts ); + if ( result ) { + if ( isFunction( result.stop ) ) { + jQuery._queueHooks( animation.elem, animation.opts.queue ).stop = + result.stop.bind( result ); + } + return result; + } + } + + jQuery.map( props, createTween, animation ); + + if ( isFunction( animation.opts.start ) ) { + animation.opts.start.call( elem, animation ); + } + + // Attach callbacks from options + animation + .progress( animation.opts.progress ) + .done( animation.opts.done, animation.opts.complete ) + .fail( animation.opts.fail ) + .always( animation.opts.always ); + + jQuery.fx.timer( + jQuery.extend( tick, { + elem: elem, + anim: animation, + queue: animation.opts.queue + } ) + ); + + return animation; +} + +jQuery.Animation = jQuery.extend( Animation, { + + tweeners: { + "*": [ function( prop, value ) { + var tween = this.createTween( prop, value ); + adjustCSS( tween.elem, prop, rcssNum.exec( value ), tween ); + return tween; + } ] + }, + + tweener: function( props, callback ) { + if ( isFunction( props ) ) { + callback = props; + props = [ "*" ]; + } else { + props = props.match( rnothtmlwhite ); + } + + var prop, + index = 0, + length = props.length; + + for ( ; index < length; index++ ) { + prop = props[ index ]; + Animation.tweeners[ prop ] = Animation.tweeners[ prop ] || []; + Animation.tweeners[ prop ].unshift( callback ); + } + }, + + prefilters: [ defaultPrefilter ], + + prefilter: function( callback, prepend ) { + if ( prepend ) { + Animation.prefilters.unshift( callback ); + } else { + Animation.prefilters.push( callback ); + } + } +} ); + +jQuery.speed = function( speed, easing, fn ) { + var opt = speed && typeof speed === "object" ? jQuery.extend( {}, speed ) : { + complete: fn || !fn && easing || + isFunction( speed ) && speed, + duration: speed, + easing: fn && easing || easing && !isFunction( easing ) && easing + }; + + // Go to the end state if fx are off + if ( jQuery.fx.off ) { + opt.duration = 0; + + } else { + if ( typeof opt.duration !== "number" ) { + if ( opt.duration in jQuery.fx.speeds ) { + opt.duration = jQuery.fx.speeds[ opt.duration ]; + + } else { + opt.duration = jQuery.fx.speeds._default; + } + } + } + + // Normalize opt.queue - true/undefined/null -> "fx" + if ( opt.queue == null || opt.queue === true ) { + opt.queue = "fx"; + } + + // Queueing + opt.old = opt.complete; + + opt.complete = function() { + if ( isFunction( opt.old ) ) { + opt.old.call( this ); + } + + if ( opt.queue ) { + jQuery.dequeue( this, opt.queue ); + } + }; + + return opt; +}; + +jQuery.fn.extend( { + fadeTo: function( speed, to, easing, callback ) { + + // Show any hidden elements after setting opacity to 0 + return this.filter( isHiddenWithinTree ).css( "opacity", 0 ).show() + + // Animate to the value specified + .end().animate( { opacity: to }, speed, easing, callback ); + }, + animate: function( prop, speed, easing, callback ) { + var empty = jQuery.isEmptyObject( prop ), + optall = jQuery.speed( speed, easing, callback ), + doAnimation = function() { + + // Operate on a copy of prop so per-property easing won't be lost + var anim = Animation( this, jQuery.extend( {}, prop ), optall ); + + // Empty animations, or finishing resolves immediately + if ( empty || dataPriv.get( this, "finish" ) ) { + anim.stop( true ); + } + }; + doAnimation.finish = doAnimation; + + return empty || optall.queue === false ? + this.each( doAnimation ) : + this.queue( optall.queue, doAnimation ); + }, + stop: function( type, clearQueue, gotoEnd ) { + var stopQueue = function( hooks ) { + var stop = hooks.stop; + delete hooks.stop; + stop( gotoEnd ); + }; + + if ( typeof type !== "string" ) { + gotoEnd = clearQueue; + clearQueue = type; + type = undefined; + } + if ( clearQueue ) { + this.queue( type || "fx", [] ); + } + + return this.each( function() { + var dequeue = true, + index = type != null && type + "queueHooks", + timers = jQuery.timers, + data = dataPriv.get( this ); + + if ( index ) { + if ( data[ index ] && data[ index ].stop ) { + stopQueue( data[ index ] ); + } + } else { + for ( index in data ) { + if ( data[ index ] && data[ index ].stop && rrun.test( index ) ) { + stopQueue( data[ index ] ); + } + } + } + + for ( index = timers.length; index--; ) { + if ( timers[ index ].elem === this && + ( type == null || timers[ index ].queue === type ) ) { + + timers[ index ].anim.stop( gotoEnd ); + dequeue = false; + timers.splice( index, 1 ); + } + } + + // Start the next in the queue if the last step wasn't forced. + // Timers currently will call their complete callbacks, which + // will dequeue but only if they were gotoEnd. + if ( dequeue || !gotoEnd ) { + jQuery.dequeue( this, type ); + } + } ); + }, + finish: function( type ) { + if ( type !== false ) { + type = type || "fx"; + } + return this.each( function() { + var index, + data = dataPriv.get( this ), + queue = data[ type + "queue" ], + hooks = data[ type + "queueHooks" ], + timers = jQuery.timers, + length = queue ? queue.length : 0; + + // Enable finishing flag on private data + data.finish = true; + + // Empty the queue first + jQuery.queue( this, type, [] ); + + if ( hooks && hooks.stop ) { + hooks.stop.call( this, true ); + } + + // Look for any active animations, and finish them + for ( index = timers.length; index--; ) { + if ( timers[ index ].elem === this && timers[ index ].queue === type ) { + timers[ index ].anim.stop( true ); + timers.splice( index, 1 ); + } + } + + // Look for any animations in the old queue and finish them + for ( index = 0; index < length; index++ ) { + if ( queue[ index ] && queue[ index ].finish ) { + queue[ index ].finish.call( this ); + } + } + + // Turn off finishing flag + delete data.finish; + } ); + } +} ); + +jQuery.each( [ "toggle", "show", "hide" ], function( _i, name ) { + var cssFn = jQuery.fn[ name ]; + jQuery.fn[ name ] = function( speed, easing, callback ) { + return speed == null || typeof speed === "boolean" ? + cssFn.apply( this, arguments ) : + this.animate( genFx( name, true ), speed, easing, callback ); + }; +} ); + +// Generate shortcuts for custom animations +jQuery.each( { + slideDown: genFx( "show" ), + slideUp: genFx( "hide" ), + slideToggle: genFx( "toggle" ), + fadeIn: { opacity: "show" }, + fadeOut: { opacity: "hide" }, + fadeToggle: { opacity: "toggle" } +}, function( name, props ) { + jQuery.fn[ name ] = function( speed, easing, callback ) { + return this.animate( props, speed, easing, callback ); + }; +} ); + +jQuery.timers = []; +jQuery.fx.tick = function() { + var timer, + i = 0, + timers = jQuery.timers; + + fxNow = Date.now(); + + for ( ; i < timers.length; i++ ) { + timer = timers[ i ]; + + // Run the timer and safely remove it when done (allowing for external removal) + if ( !timer() && timers[ i ] === timer ) { + timers.splice( i--, 1 ); + } + } + + if ( !timers.length ) { + jQuery.fx.stop(); + } + fxNow = undefined; +}; + +jQuery.fx.timer = function( timer ) { + jQuery.timers.push( timer ); + jQuery.fx.start(); +}; + +jQuery.fx.interval = 13; +jQuery.fx.start = function() { + if ( inProgress ) { + return; + } + + inProgress = true; + schedule(); +}; + +jQuery.fx.stop = function() { + inProgress = null; +}; + +jQuery.fx.speeds = { + slow: 600, + fast: 200, + + // Default speed + _default: 400 +}; + + +// Based off of the plugin by Clint Helfers, with permission. +// https://web.archive.org/web/20100324014747/http://blindsignals.com/index.php/2009/07/jquery-delay/ +jQuery.fn.delay = function( time, type ) { + time = jQuery.fx ? jQuery.fx.speeds[ time ] || time : time; + type = type || "fx"; + + return this.queue( type, function( next, hooks ) { + var timeout = window.setTimeout( next, time ); + hooks.stop = function() { + window.clearTimeout( timeout ); + }; + } ); +}; + + +( function() { + var input = document.createElement( "input" ), + select = document.createElement( "select" ), + opt = select.appendChild( document.createElement( "option" ) ); + + input.type = "checkbox"; + + // Support: Android <=4.3 only + // Default value for a checkbox should be "on" + support.checkOn = input.value !== ""; + + // Support: IE <=11 only + // Must access selectedIndex to make default options select + support.optSelected = opt.selected; + + // Support: IE <=11 only + // An input loses its value after becoming a radio + input = document.createElement( "input" ); + input.value = "t"; + input.type = "radio"; + support.radioValue = input.value === "t"; +} )(); + + +var boolHook, + attrHandle = jQuery.expr.attrHandle; + +jQuery.fn.extend( { + attr: function( name, value ) { + return access( this, jQuery.attr, name, value, arguments.length > 1 ); + }, + + removeAttr: function( name ) { + return this.each( function() { + jQuery.removeAttr( this, name ); + } ); + } +} ); + +jQuery.extend( { + attr: function( elem, name, value ) { + var ret, hooks, + nType = elem.nodeType; + + // Don't get/set attributes on text, comment and attribute nodes + if ( nType === 3 || nType === 8 || nType === 2 ) { + return; + } + + // Fallback to prop when attributes are not supported + if ( typeof elem.getAttribute === "undefined" ) { + return jQuery.prop( elem, name, value ); + } + + // Attribute hooks are determined by the lowercase version + // Grab necessary hook if one is defined + if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) { + hooks = jQuery.attrHooks[ name.toLowerCase() ] || + ( jQuery.expr.match.bool.test( name ) ? boolHook : undefined ); + } + + if ( value !== undefined ) { + if ( value === null ) { + jQuery.removeAttr( elem, name ); + return; + } + + if ( hooks && "set" in hooks && + ( ret = hooks.set( elem, value, name ) ) !== undefined ) { + return ret; + } + + elem.setAttribute( name, value + "" ); + return value; + } + + if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) { + return ret; + } + + ret = jQuery.find.attr( elem, name ); + + // Non-existent attributes return null, we normalize to undefined + return ret == null ? undefined : ret; + }, + + attrHooks: { + type: { + set: function( elem, value ) { + if ( !support.radioValue && value === "radio" && + nodeName( elem, "input" ) ) { + var val = elem.value; + elem.setAttribute( "type", value ); + if ( val ) { + elem.value = val; + } + return value; + } + } + } + }, + + removeAttr: function( elem, value ) { + var name, + i = 0, + + // Attribute names can contain non-HTML whitespace characters + // https://html.spec.whatwg.org/multipage/syntax.html#attributes-2 + attrNames = value && value.match( rnothtmlwhite ); + + if ( attrNames && elem.nodeType === 1 ) { + while ( ( name = attrNames[ i++ ] ) ) { + elem.removeAttribute( name ); + } + } + } +} ); + +// Hooks for boolean attributes +boolHook = { + set: function( elem, value, name ) { + if ( value === false ) { + + // Remove boolean attributes when set to false + jQuery.removeAttr( elem, name ); + } else { + elem.setAttribute( name, name ); + } + return name; + } +}; + +jQuery.each( jQuery.expr.match.bool.source.match( /\w+/g ), function( _i, name ) { + var getter = attrHandle[ name ] || jQuery.find.attr; + + attrHandle[ name ] = function( elem, name, isXML ) { + var ret, handle, + lowercaseName = name.toLowerCase(); + + if ( !isXML ) { + + // Avoid an infinite loop by temporarily removing this function from the getter + handle = attrHandle[ lowercaseName ]; + attrHandle[ lowercaseName ] = ret; + ret = getter( elem, name, isXML ) != null ? + lowercaseName : + null; + attrHandle[ lowercaseName ] = handle; + } + return ret; + }; +} ); + + + + +var rfocusable = /^(?:input|select|textarea|button)$/i, + rclickable = /^(?:a|area)$/i; + +jQuery.fn.extend( { + prop: function( name, value ) { + return access( this, jQuery.prop, name, value, arguments.length > 1 ); + }, + + removeProp: function( name ) { + return this.each( function() { + delete this[ jQuery.propFix[ name ] || name ]; + } ); + } +} ); + +jQuery.extend( { + prop: function( elem, name, value ) { + var ret, hooks, + nType = elem.nodeType; + + // Don't get/set properties on text, comment and attribute nodes + if ( nType === 3 || nType === 8 || nType === 2 ) { + return; + } + + if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) { + + // Fix name and attach hooks + name = jQuery.propFix[ name ] || name; + hooks = jQuery.propHooks[ name ]; + } + + if ( value !== undefined ) { + if ( hooks && "set" in hooks && + ( ret = hooks.set( elem, value, name ) ) !== undefined ) { + return ret; + } + + return ( elem[ name ] = value ); + } + + if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) { + return ret; + } + + return elem[ name ]; + }, + + propHooks: { + tabIndex: { + get: function( elem ) { + + // Support: IE <=9 - 11 only + // elem.tabIndex doesn't always return the + // correct value when it hasn't been explicitly set + // https://web.archive.org/web/20141116233347/http://fluidproject.org/blog/2008/01/09/getting-setting-and-removing-tabindex-values-with-javascript/ + // Use proper attribute retrieval(#12072) + var tabindex = jQuery.find.attr( elem, "tabindex" ); + + if ( tabindex ) { + return parseInt( tabindex, 10 ); + } + + if ( + rfocusable.test( elem.nodeName ) || + rclickable.test( elem.nodeName ) && + elem.href + ) { + return 0; + } + + return -1; + } + } + }, + + propFix: { + "for": "htmlFor", + "class": "className" + } +} ); + +// Support: IE <=11 only +// Accessing the selectedIndex property +// forces the browser to respect setting selected +// on the option +// The getter ensures a default option is selected +// when in an optgroup +// eslint rule "no-unused-expressions" is disabled for this code +// since it considers such accessions noop +if ( !support.optSelected ) { + jQuery.propHooks.selected = { + get: function( elem ) { + + /* eslint no-unused-expressions: "off" */ + + var parent = elem.parentNode; + if ( parent && parent.parentNode ) { + parent.parentNode.selectedIndex; + } + return null; + }, + set: function( elem ) { + + /* eslint no-unused-expressions: "off" */ + + var parent = elem.parentNode; + if ( parent ) { + parent.selectedIndex; + + if ( parent.parentNode ) { + parent.parentNode.selectedIndex; + } + } + } + }; +} + +jQuery.each( [ + "tabIndex", + "readOnly", + "maxLength", + "cellSpacing", + "cellPadding", + "rowSpan", + "colSpan", + "useMap", + "frameBorder", + "contentEditable" +], function() { + jQuery.propFix[ this.toLowerCase() ] = this; +} ); + + + + + // Strip and collapse whitespace according to HTML spec + // https://infra.spec.whatwg.org/#strip-and-collapse-ascii-whitespace + function stripAndCollapse( value ) { + var tokens = value.match( rnothtmlwhite ) || []; + return tokens.join( " " ); + } + + +function getClass( elem ) { + return elem.getAttribute && elem.getAttribute( "class" ) || ""; +} + +function classesToArray( value ) { + if ( Array.isArray( value ) ) { + return value; + } + if ( typeof value === "string" ) { + return value.match( rnothtmlwhite ) || []; + } + return []; +} + +jQuery.fn.extend( { + addClass: function( value ) { + var classes, elem, cur, curValue, clazz, j, finalValue, + i = 0; + + if ( isFunction( value ) ) { + return this.each( function( j ) { + jQuery( this ).addClass( value.call( this, j, getClass( this ) ) ); + } ); + } + + classes = classesToArray( value ); + + if ( classes.length ) { + while ( ( elem = this[ i++ ] ) ) { + curValue = getClass( elem ); + cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " ); + + if ( cur ) { + j = 0; + while ( ( clazz = classes[ j++ ] ) ) { + if ( cur.indexOf( " " + clazz + " " ) < 0 ) { + cur += clazz + " "; + } + } + + // Only assign if different to avoid unneeded rendering. + finalValue = stripAndCollapse( cur ); + if ( curValue !== finalValue ) { + elem.setAttribute( "class", finalValue ); + } + } + } + } + + return this; + }, + + removeClass: function( value ) { + var classes, elem, cur, curValue, clazz, j, finalValue, + i = 0; + + if ( isFunction( value ) ) { + return this.each( function( j ) { + jQuery( this ).removeClass( value.call( this, j, getClass( this ) ) ); + } ); + } + + if ( !arguments.length ) { + return this.attr( "class", "" ); + } + + classes = classesToArray( value ); + + if ( classes.length ) { + while ( ( elem = this[ i++ ] ) ) { + curValue = getClass( elem ); + + // This expression is here for better compressibility (see addClass) + cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " ); + + if ( cur ) { + j = 0; + while ( ( clazz = classes[ j++ ] ) ) { + + // Remove *all* instances + while ( cur.indexOf( " " + clazz + " " ) > -1 ) { + cur = cur.replace( " " + clazz + " ", " " ); + } + } + + // Only assign if different to avoid unneeded rendering. + finalValue = stripAndCollapse( cur ); + if ( curValue !== finalValue ) { + elem.setAttribute( "class", finalValue ); + } + } + } + } + + return this; + }, + + toggleClass: function( value, stateVal ) { + var type = typeof value, + isValidValue = type === "string" || Array.isArray( value ); + + if ( typeof stateVal === "boolean" && isValidValue ) { + return stateVal ? this.addClass( value ) : this.removeClass( value ); + } + + if ( isFunction( value ) ) { + return this.each( function( i ) { + jQuery( this ).toggleClass( + value.call( this, i, getClass( this ), stateVal ), + stateVal + ); + } ); + } + + return this.each( function() { + var className, i, self, classNames; + + if ( isValidValue ) { + + // Toggle individual class names + i = 0; + self = jQuery( this ); + classNames = classesToArray( value ); + + while ( ( className = classNames[ i++ ] ) ) { + + // Check each className given, space separated list + if ( self.hasClass( className ) ) { + self.removeClass( className ); + } else { + self.addClass( className ); + } + } + + // Toggle whole class name + } else if ( value === undefined || type === "boolean" ) { + className = getClass( this ); + if ( className ) { + + // Store className if set + dataPriv.set( this, "__className__", className ); + } + + // If the element has a class name or if we're passed `false`, + // then remove the whole classname (if there was one, the above saved it). + // Otherwise bring back whatever was previously saved (if anything), + // falling back to the empty string if nothing was stored. + if ( this.setAttribute ) { + this.setAttribute( "class", + className || value === false ? + "" : + dataPriv.get( this, "__className__" ) || "" + ); + } + } + } ); + }, + + hasClass: function( selector ) { + var className, elem, + i = 0; + + className = " " + selector + " "; + while ( ( elem = this[ i++ ] ) ) { + if ( elem.nodeType === 1 && + ( " " + stripAndCollapse( getClass( elem ) ) + " " ).indexOf( className ) > -1 ) { + return true; + } + } + + return false; + } +} ); + + + + +var rreturn = /\r/g; + +jQuery.fn.extend( { + val: function( value ) { + var hooks, ret, valueIsFunction, + elem = this[ 0 ]; + + if ( !arguments.length ) { + if ( elem ) { + hooks = jQuery.valHooks[ elem.type ] || + jQuery.valHooks[ elem.nodeName.toLowerCase() ]; + + if ( hooks && + "get" in hooks && + ( ret = hooks.get( elem, "value" ) ) !== undefined + ) { + return ret; + } + + ret = elem.value; + + // Handle most common string cases + if ( typeof ret === "string" ) { + return ret.replace( rreturn, "" ); + } + + // Handle cases where value is null/undef or number + return ret == null ? "" : ret; + } + + return; + } + + valueIsFunction = isFunction( value ); + + return this.each( function( i ) { + var val; + + if ( this.nodeType !== 1 ) { + return; + } + + if ( valueIsFunction ) { + val = value.call( this, i, jQuery( this ).val() ); + } else { + val = value; + } + + // Treat null/undefined as ""; convert numbers to string + if ( val == null ) { + val = ""; + + } else if ( typeof val === "number" ) { + val += ""; + + } else if ( Array.isArray( val ) ) { + val = jQuery.map( val, function( value ) { + return value == null ? "" : value + ""; + } ); + } + + hooks = jQuery.valHooks[ this.type ] || jQuery.valHooks[ this.nodeName.toLowerCase() ]; + + // If set returns undefined, fall back to normal setting + if ( !hooks || !( "set" in hooks ) || hooks.set( this, val, "value" ) === undefined ) { + this.value = val; + } + } ); + } +} ); + +jQuery.extend( { + valHooks: { + option: { + get: function( elem ) { + + var val = jQuery.find.attr( elem, "value" ); + return val != null ? + val : + + // Support: IE <=10 - 11 only + // option.text throws exceptions (#14686, #14858) + // Strip and collapse whitespace + // https://html.spec.whatwg.org/#strip-and-collapse-whitespace + stripAndCollapse( jQuery.text( elem ) ); + } + }, + select: { + get: function( elem ) { + var value, option, i, + options = elem.options, + index = elem.selectedIndex, + one = elem.type === "select-one", + values = one ? null : [], + max = one ? index + 1 : options.length; + + if ( index < 0 ) { + i = max; + + } else { + i = one ? index : 0; + } + + // Loop through all the selected options + for ( ; i < max; i++ ) { + option = options[ i ]; + + // Support: IE <=9 only + // IE8-9 doesn't update selected after form reset (#2551) + if ( ( option.selected || i === index ) && + + // Don't return options that are disabled or in a disabled optgroup + !option.disabled && + ( !option.parentNode.disabled || + !nodeName( option.parentNode, "optgroup" ) ) ) { + + // Get the specific value for the option + value = jQuery( option ).val(); + + // We don't need an array for one selects + if ( one ) { + return value; + } + + // Multi-Selects return an array + values.push( value ); + } + } + + return values; + }, + + set: function( elem, value ) { + var optionSet, option, + options = elem.options, + values = jQuery.makeArray( value ), + i = options.length; + + while ( i-- ) { + option = options[ i ]; + + /* eslint-disable no-cond-assign */ + + if ( option.selected = + jQuery.inArray( jQuery.valHooks.option.get( option ), values ) > -1 + ) { + optionSet = true; + } + + /* eslint-enable no-cond-assign */ + } + + // Force browsers to behave consistently when non-matching value is set + if ( !optionSet ) { + elem.selectedIndex = -1; + } + return values; + } + } + } +} ); + +// Radios and checkboxes getter/setter +jQuery.each( [ "radio", "checkbox" ], function() { + jQuery.valHooks[ this ] = { + set: function( elem, value ) { + if ( Array.isArray( value ) ) { + return ( elem.checked = jQuery.inArray( jQuery( elem ).val(), value ) > -1 ); + } + } + }; + if ( !support.checkOn ) { + jQuery.valHooks[ this ].get = function( elem ) { + return elem.getAttribute( "value" ) === null ? "on" : elem.value; + }; + } +} ); + + + + +// Return jQuery for attributes-only inclusion + + +support.focusin = "onfocusin" in window; + + +var rfocusMorph = /^(?:focusinfocus|focusoutblur)$/, + stopPropagationCallback = function( e ) { + e.stopPropagation(); + }; + +jQuery.extend( jQuery.event, { + + trigger: function( event, data, elem, onlyHandlers ) { + + var i, cur, tmp, bubbleType, ontype, handle, special, lastElement, + eventPath = [ elem || document ], + type = hasOwn.call( event, "type" ) ? event.type : event, + namespaces = hasOwn.call( event, "namespace" ) ? event.namespace.split( "." ) : []; + + cur = lastElement = tmp = elem = elem || document; + + // Don't do events on text and comment nodes + if ( elem.nodeType === 3 || elem.nodeType === 8 ) { + return; + } + + // focus/blur morphs to focusin/out; ensure we're not firing them right now + if ( rfocusMorph.test( type + jQuery.event.triggered ) ) { + return; + } + + if ( type.indexOf( "." ) > -1 ) { + + // Namespaced trigger; create a regexp to match event type in handle() + namespaces = type.split( "." ); + type = namespaces.shift(); + namespaces.sort(); + } + ontype = type.indexOf( ":" ) < 0 && "on" + type; + + // Caller can pass in a jQuery.Event object, Object, or just an event type string + event = event[ jQuery.expando ] ? + event : + new jQuery.Event( type, typeof event === "object" && event ); + + // Trigger bitmask: & 1 for native handlers; & 2 for jQuery (always true) + event.isTrigger = onlyHandlers ? 2 : 3; + event.namespace = namespaces.join( "." ); + event.rnamespace = event.namespace ? + new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ) : + null; + + // Clean up the event in case it is being reused + event.result = undefined; + if ( !event.target ) { + event.target = elem; + } + + // Clone any incoming data and prepend the event, creating the handler arg list + data = data == null ? + [ event ] : + jQuery.makeArray( data, [ event ] ); + + // Allow special events to draw outside the lines + special = jQuery.event.special[ type ] || {}; + if ( !onlyHandlers && special.trigger && special.trigger.apply( elem, data ) === false ) { + return; + } + + // Determine event propagation path in advance, per W3C events spec (#9951) + // Bubble up to document, then to window; watch for a global ownerDocument var (#9724) + if ( !onlyHandlers && !special.noBubble && !isWindow( elem ) ) { + + bubbleType = special.delegateType || type; + if ( !rfocusMorph.test( bubbleType + type ) ) { + cur = cur.parentNode; + } + for ( ; cur; cur = cur.parentNode ) { + eventPath.push( cur ); + tmp = cur; + } + + // Only add window if we got to document (e.g., not plain obj or detached DOM) + if ( tmp === ( elem.ownerDocument || document ) ) { + eventPath.push( tmp.defaultView || tmp.parentWindow || window ); + } + } + + // Fire handlers on the event path + i = 0; + while ( ( cur = eventPath[ i++ ] ) && !event.isPropagationStopped() ) { + lastElement = cur; + event.type = i > 1 ? + bubbleType : + special.bindType || type; + + // jQuery handler + handle = ( + dataPriv.get( cur, "events" ) || Object.create( null ) + )[ event.type ] && + dataPriv.get( cur, "handle" ); + if ( handle ) { + handle.apply( cur, data ); + } + + // Native handler + handle = ontype && cur[ ontype ]; + if ( handle && handle.apply && acceptData( cur ) ) { + event.result = handle.apply( cur, data ); + if ( event.result === false ) { + event.preventDefault(); + } + } + } + event.type = type; + + // If nobody prevented the default action, do it now + if ( !onlyHandlers && !event.isDefaultPrevented() ) { + + if ( ( !special._default || + special._default.apply( eventPath.pop(), data ) === false ) && + acceptData( elem ) ) { + + // Call a native DOM method on the target with the same name as the event. + // Don't do default actions on window, that's where global variables be (#6170) + if ( ontype && isFunction( elem[ type ] ) && !isWindow( elem ) ) { + + // Don't re-trigger an onFOO event when we call its FOO() method + tmp = elem[ ontype ]; + + if ( tmp ) { + elem[ ontype ] = null; + } + + // Prevent re-triggering of the same event, since we already bubbled it above + jQuery.event.triggered = type; + + if ( event.isPropagationStopped() ) { + lastElement.addEventListener( type, stopPropagationCallback ); + } + + elem[ type ](); + + if ( event.isPropagationStopped() ) { + lastElement.removeEventListener( type, stopPropagationCallback ); + } + + jQuery.event.triggered = undefined; + + if ( tmp ) { + elem[ ontype ] = tmp; + } + } + } + } + + return event.result; + }, + + // Piggyback on a donor event to simulate a different one + // Used only for `focus(in | out)` events + simulate: function( type, elem, event ) { + var e = jQuery.extend( + new jQuery.Event(), + event, + { + type: type, + isSimulated: true + } + ); + + jQuery.event.trigger( e, null, elem ); + } + +} ); + +jQuery.fn.extend( { + + trigger: function( type, data ) { + return this.each( function() { + jQuery.event.trigger( type, data, this ); + } ); + }, + triggerHandler: function( type, data ) { + var elem = this[ 0 ]; + if ( elem ) { + return jQuery.event.trigger( type, data, elem, true ); + } + } +} ); + + +// Support: Firefox <=44 +// Firefox doesn't have focus(in | out) events +// Related ticket - https://bugzilla.mozilla.org/show_bug.cgi?id=687787 +// +// Support: Chrome <=48 - 49, Safari <=9.0 - 9.1 +// focus(in | out) events fire after focus & blur events, +// which is spec violation - http://www.w3.org/TR/DOM-Level-3-Events/#events-focusevent-event-order +// Related ticket - https://bugs.chromium.org/p/chromium/issues/detail?id=449857 +if ( !support.focusin ) { + jQuery.each( { focus: "focusin", blur: "focusout" }, function( orig, fix ) { + + // Attach a single capturing handler on the document while someone wants focusin/focusout + var handler = function( event ) { + jQuery.event.simulate( fix, event.target, jQuery.event.fix( event ) ); + }; + + jQuery.event.special[ fix ] = { + setup: function() { + + // Handle: regular nodes (via `this.ownerDocument`), window + // (via `this.document`) & document (via `this`). + var doc = this.ownerDocument || this.document || this, + attaches = dataPriv.access( doc, fix ); + + if ( !attaches ) { + doc.addEventListener( orig, handler, true ); + } + dataPriv.access( doc, fix, ( attaches || 0 ) + 1 ); + }, + teardown: function() { + var doc = this.ownerDocument || this.document || this, + attaches = dataPriv.access( doc, fix ) - 1; + + if ( !attaches ) { + doc.removeEventListener( orig, handler, true ); + dataPriv.remove( doc, fix ); + + } else { + dataPriv.access( doc, fix, attaches ); + } + } + }; + } ); +} +var location = window.location; + +var nonce = { guid: Date.now() }; + +var rquery = ( /\?/ ); + + + +// Cross-browser xml parsing +jQuery.parseXML = function( data ) { + var xml; + if ( !data || typeof data !== "string" ) { + return null; + } + + // Support: IE 9 - 11 only + // IE throws on parseFromString with invalid input. + try { + xml = ( new window.DOMParser() ).parseFromString( data, "text/xml" ); + } catch ( e ) { + xml = undefined; + } + + if ( !xml || xml.getElementsByTagName( "parsererror" ).length ) { + jQuery.error( "Invalid XML: " + data ); + } + return xml; +}; + + +var + rbracket = /\[\]$/, + rCRLF = /\r?\n/g, + rsubmitterTypes = /^(?:submit|button|image|reset|file)$/i, + rsubmittable = /^(?:input|select|textarea|keygen)/i; + +function buildParams( prefix, obj, traditional, add ) { + var name; + + if ( Array.isArray( obj ) ) { + + // Serialize array item. + jQuery.each( obj, function( i, v ) { + if ( traditional || rbracket.test( prefix ) ) { + + // Treat each array item as a scalar. + add( prefix, v ); + + } else { + + // Item is non-scalar (array or object), encode its numeric index. + buildParams( + prefix + "[" + ( typeof v === "object" && v != null ? i : "" ) + "]", + v, + traditional, + add + ); + } + } ); + + } else if ( !traditional && toType( obj ) === "object" ) { + + // Serialize object item. + for ( name in obj ) { + buildParams( prefix + "[" + name + "]", obj[ name ], traditional, add ); + } + + } else { + + // Serialize scalar item. + add( prefix, obj ); + } +} + +// Serialize an array of form elements or a set of +// key/values into a query string +jQuery.param = function( a, traditional ) { + var prefix, + s = [], + add = function( key, valueOrFunction ) { + + // If value is a function, invoke it and use its return value + var value = isFunction( valueOrFunction ) ? + valueOrFunction() : + valueOrFunction; + + s[ s.length ] = encodeURIComponent( key ) + "=" + + encodeURIComponent( value == null ? "" : value ); + }; + + if ( a == null ) { + return ""; + } + + // If an array was passed in, assume that it is an array of form elements. + if ( Array.isArray( a ) || ( a.jquery && !jQuery.isPlainObject( a ) ) ) { + + // Serialize the form elements + jQuery.each( a, function() { + add( this.name, this.value ); + } ); + + } else { + + // If traditional, encode the "old" way (the way 1.3.2 or older + // did it), otherwise encode params recursively. + for ( prefix in a ) { + buildParams( prefix, a[ prefix ], traditional, add ); + } + } + + // Return the resulting serialization + return s.join( "&" ); +}; + +jQuery.fn.extend( { + serialize: function() { + return jQuery.param( this.serializeArray() ); + }, + serializeArray: function() { + return this.map( function() { + + // Can add propHook for "elements" to filter or add form elements + var elements = jQuery.prop( this, "elements" ); + return elements ? jQuery.makeArray( elements ) : this; + } ) + .filter( function() { + var type = this.type; + + // Use .is( ":disabled" ) so that fieldset[disabled] works + return this.name && !jQuery( this ).is( ":disabled" ) && + rsubmittable.test( this.nodeName ) && !rsubmitterTypes.test( type ) && + ( this.checked || !rcheckableType.test( type ) ); + } ) + .map( function( _i, elem ) { + var val = jQuery( this ).val(); + + if ( val == null ) { + return null; + } + + if ( Array.isArray( val ) ) { + return jQuery.map( val, function( val ) { + return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) }; + } ); + } + + return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) }; + } ).get(); + } +} ); + + +var + r20 = /%20/g, + rhash = /#.*$/, + rantiCache = /([?&])_=[^&]*/, + rheaders = /^(.*?):[ \t]*([^\r\n]*)$/mg, + + // #7653, #8125, #8152: local protocol detection + rlocalProtocol = /^(?:about|app|app-storage|.+-extension|file|res|widget):$/, + rnoContent = /^(?:GET|HEAD)$/, + rprotocol = /^\/\//, + + /* Prefilters + * 1) They are useful to introduce custom dataTypes (see ajax/jsonp.js for an example) + * 2) These are called: + * - BEFORE asking for a transport + * - AFTER param serialization (s.data is a string if s.processData is true) + * 3) key is the dataType + * 4) the catchall symbol "*" can be used + * 5) execution will start with transport dataType and THEN continue down to "*" if needed + */ + prefilters = {}, + + /* Transports bindings + * 1) key is the dataType + * 2) the catchall symbol "*" can be used + * 3) selection will start with transport dataType and THEN go to "*" if needed + */ + transports = {}, + + // Avoid comment-prolog char sequence (#10098); must appease lint and evade compression + allTypes = "*/".concat( "*" ), + + // Anchor tag for parsing the document origin + originAnchor = document.createElement( "a" ); + originAnchor.href = location.href; + +// Base "constructor" for jQuery.ajaxPrefilter and jQuery.ajaxTransport +function addToPrefiltersOrTransports( structure ) { + + // dataTypeExpression is optional and defaults to "*" + return function( dataTypeExpression, func ) { + + if ( typeof dataTypeExpression !== "string" ) { + func = dataTypeExpression; + dataTypeExpression = "*"; + } + + var dataType, + i = 0, + dataTypes = dataTypeExpression.toLowerCase().match( rnothtmlwhite ) || []; + + if ( isFunction( func ) ) { + + // For each dataType in the dataTypeExpression + while ( ( dataType = dataTypes[ i++ ] ) ) { + + // Prepend if requested + if ( dataType[ 0 ] === "+" ) { + dataType = dataType.slice( 1 ) || "*"; + ( structure[ dataType ] = structure[ dataType ] || [] ).unshift( func ); + + // Otherwise append + } else { + ( structure[ dataType ] = structure[ dataType ] || [] ).push( func ); + } + } + } + }; +} + +// Base inspection function for prefilters and transports +function inspectPrefiltersOrTransports( structure, options, originalOptions, jqXHR ) { + + var inspected = {}, + seekingTransport = ( structure === transports ); + + function inspect( dataType ) { + var selected; + inspected[ dataType ] = true; + jQuery.each( structure[ dataType ] || [], function( _, prefilterOrFactory ) { + var dataTypeOrTransport = prefilterOrFactory( options, originalOptions, jqXHR ); + if ( typeof dataTypeOrTransport === "string" && + !seekingTransport && !inspected[ dataTypeOrTransport ] ) { + + options.dataTypes.unshift( dataTypeOrTransport ); + inspect( dataTypeOrTransport ); + return false; + } else if ( seekingTransport ) { + return !( selected = dataTypeOrTransport ); + } + } ); + return selected; + } + + return inspect( options.dataTypes[ 0 ] ) || !inspected[ "*" ] && inspect( "*" ); +} + +// A special extend for ajax options +// that takes "flat" options (not to be deep extended) +// Fixes #9887 +function ajaxExtend( target, src ) { + var key, deep, + flatOptions = jQuery.ajaxSettings.flatOptions || {}; + + for ( key in src ) { + if ( src[ key ] !== undefined ) { + ( flatOptions[ key ] ? target : ( deep || ( deep = {} ) ) )[ key ] = src[ key ]; + } + } + if ( deep ) { + jQuery.extend( true, target, deep ); + } + + return target; +} + +/* Handles responses to an ajax request: + * - finds the right dataType (mediates between content-type and expected dataType) + * - returns the corresponding response + */ +function ajaxHandleResponses( s, jqXHR, responses ) { + + var ct, type, finalDataType, firstDataType, + contents = s.contents, + dataTypes = s.dataTypes; + + // Remove auto dataType and get content-type in the process + while ( dataTypes[ 0 ] === "*" ) { + dataTypes.shift(); + if ( ct === undefined ) { + ct = s.mimeType || jqXHR.getResponseHeader( "Content-Type" ); + } + } + + // Check if we're dealing with a known content-type + if ( ct ) { + for ( type in contents ) { + if ( contents[ type ] && contents[ type ].test( ct ) ) { + dataTypes.unshift( type ); + break; + } + } + } + + // Check to see if we have a response for the expected dataType + if ( dataTypes[ 0 ] in responses ) { + finalDataType = dataTypes[ 0 ]; + } else { + + // Try convertible dataTypes + for ( type in responses ) { + if ( !dataTypes[ 0 ] || s.converters[ type + " " + dataTypes[ 0 ] ] ) { + finalDataType = type; + break; + } + if ( !firstDataType ) { + firstDataType = type; + } + } + + // Or just use first one + finalDataType = finalDataType || firstDataType; + } + + // If we found a dataType + // We add the dataType to the list if needed + // and return the corresponding response + if ( finalDataType ) { + if ( finalDataType !== dataTypes[ 0 ] ) { + dataTypes.unshift( finalDataType ); + } + return responses[ finalDataType ]; + } +} + +/* Chain conversions given the request and the original response + * Also sets the responseXXX fields on the jqXHR instance + */ +function ajaxConvert( s, response, jqXHR, isSuccess ) { + var conv2, current, conv, tmp, prev, + converters = {}, + + // Work with a copy of dataTypes in case we need to modify it for conversion + dataTypes = s.dataTypes.slice(); + + // Create converters map with lowercased keys + if ( dataTypes[ 1 ] ) { + for ( conv in s.converters ) { + converters[ conv.toLowerCase() ] = s.converters[ conv ]; + } + } + + current = dataTypes.shift(); + + // Convert to each sequential dataType + while ( current ) { + + if ( s.responseFields[ current ] ) { + jqXHR[ s.responseFields[ current ] ] = response; + } + + // Apply the dataFilter if provided + if ( !prev && isSuccess && s.dataFilter ) { + response = s.dataFilter( response, s.dataType ); + } + + prev = current; + current = dataTypes.shift(); + + if ( current ) { + + // There's only work to do if current dataType is non-auto + if ( current === "*" ) { + + current = prev; + + // Convert response if prev dataType is non-auto and differs from current + } else if ( prev !== "*" && prev !== current ) { + + // Seek a direct converter + conv = converters[ prev + " " + current ] || converters[ "* " + current ]; + + // If none found, seek a pair + if ( !conv ) { + for ( conv2 in converters ) { + + // If conv2 outputs current + tmp = conv2.split( " " ); + if ( tmp[ 1 ] === current ) { + + // If prev can be converted to accepted input + conv = converters[ prev + " " + tmp[ 0 ] ] || + converters[ "* " + tmp[ 0 ] ]; + if ( conv ) { + + // Condense equivalence converters + if ( conv === true ) { + conv = converters[ conv2 ]; + + // Otherwise, insert the intermediate dataType + } else if ( converters[ conv2 ] !== true ) { + current = tmp[ 0 ]; + dataTypes.unshift( tmp[ 1 ] ); + } + break; + } + } + } + } + + // Apply converter (if not an equivalence) + if ( conv !== true ) { + + // Unless errors are allowed to bubble, catch and return them + if ( conv && s.throws ) { + response = conv( response ); + } else { + try { + response = conv( response ); + } catch ( e ) { + return { + state: "parsererror", + error: conv ? e : "No conversion from " + prev + " to " + current + }; + } + } + } + } + } + } + + return { state: "success", data: response }; +} + +jQuery.extend( { + + // Counter for holding the number of active queries + active: 0, + + // Last-Modified header cache for next request + lastModified: {}, + etag: {}, + + ajaxSettings: { + url: location.href, + type: "GET", + isLocal: rlocalProtocol.test( location.protocol ), + global: true, + processData: true, + async: true, + contentType: "application/x-www-form-urlencoded; charset=UTF-8", + + /* + timeout: 0, + data: null, + dataType: null, + username: null, + password: null, + cache: null, + throws: false, + traditional: false, + headers: {}, + */ + + accepts: { + "*": allTypes, + text: "text/plain", + html: "text/html", + xml: "application/xml, text/xml", + json: "application/json, text/javascript" + }, + + contents: { + xml: /\bxml\b/, + html: /\bhtml/, + json: /\bjson\b/ + }, + + responseFields: { + xml: "responseXML", + text: "responseText", + json: "responseJSON" + }, + + // Data converters + // Keys separate source (or catchall "*") and destination types with a single space + converters: { + + // Convert anything to text + "* text": String, + + // Text to html (true = no transformation) + "text html": true, + + // Evaluate text as a json expression + "text json": JSON.parse, + + // Parse text as xml + "text xml": jQuery.parseXML + }, + + // For options that shouldn't be deep extended: + // you can add your own custom options here if + // and when you create one that shouldn't be + // deep extended (see ajaxExtend) + flatOptions: { + url: true, + context: true + } + }, + + // Creates a full fledged settings object into target + // with both ajaxSettings and settings fields. + // If target is omitted, writes into ajaxSettings. + ajaxSetup: function( target, settings ) { + return settings ? + + // Building a settings object + ajaxExtend( ajaxExtend( target, jQuery.ajaxSettings ), settings ) : + + // Extending ajaxSettings + ajaxExtend( jQuery.ajaxSettings, target ); + }, + + ajaxPrefilter: addToPrefiltersOrTransports( prefilters ), + ajaxTransport: addToPrefiltersOrTransports( transports ), + + // Main method + ajax: function( url, options ) { + + // If url is an object, simulate pre-1.5 signature + if ( typeof url === "object" ) { + options = url; + url = undefined; + } + + // Force options to be an object + options = options || {}; + + var transport, + + // URL without anti-cache param + cacheURL, + + // Response headers + responseHeadersString, + responseHeaders, + + // timeout handle + timeoutTimer, + + // Url cleanup var + urlAnchor, + + // Request state (becomes false upon send and true upon completion) + completed, + + // To know if global events are to be dispatched + fireGlobals, + + // Loop variable + i, + + // uncached part of the url + uncached, + + // Create the final options object + s = jQuery.ajaxSetup( {}, options ), + + // Callbacks context + callbackContext = s.context || s, + + // Context for global events is callbackContext if it is a DOM node or jQuery collection + globalEventContext = s.context && + ( callbackContext.nodeType || callbackContext.jquery ) ? + jQuery( callbackContext ) : + jQuery.event, + + // Deferreds + deferred = jQuery.Deferred(), + completeDeferred = jQuery.Callbacks( "once memory" ), + + // Status-dependent callbacks + statusCode = s.statusCode || {}, + + // Headers (they are sent all at once) + requestHeaders = {}, + requestHeadersNames = {}, + + // Default abort message + strAbort = "canceled", + + // Fake xhr + jqXHR = { + readyState: 0, + + // Builds headers hashtable if needed + getResponseHeader: function( key ) { + var match; + if ( completed ) { + if ( !responseHeaders ) { + responseHeaders = {}; + while ( ( match = rheaders.exec( responseHeadersString ) ) ) { + responseHeaders[ match[ 1 ].toLowerCase() + " " ] = + ( responseHeaders[ match[ 1 ].toLowerCase() + " " ] || [] ) + .concat( match[ 2 ] ); + } + } + match = responseHeaders[ key.toLowerCase() + " " ]; + } + return match == null ? null : match.join( ", " ); + }, + + // Raw string + getAllResponseHeaders: function() { + return completed ? responseHeadersString : null; + }, + + // Caches the header + setRequestHeader: function( name, value ) { + if ( completed == null ) { + name = requestHeadersNames[ name.toLowerCase() ] = + requestHeadersNames[ name.toLowerCase() ] || name; + requestHeaders[ name ] = value; + } + return this; + }, + + // Overrides response content-type header + overrideMimeType: function( type ) { + if ( completed == null ) { + s.mimeType = type; + } + return this; + }, + + // Status-dependent callbacks + statusCode: function( map ) { + var code; + if ( map ) { + if ( completed ) { + + // Execute the appropriate callbacks + jqXHR.always( map[ jqXHR.status ] ); + } else { + + // Lazy-add the new callbacks in a way that preserves old ones + for ( code in map ) { + statusCode[ code ] = [ statusCode[ code ], map[ code ] ]; + } + } + } + return this; + }, + + // Cancel the request + abort: function( statusText ) { + var finalText = statusText || strAbort; + if ( transport ) { + transport.abort( finalText ); + } + done( 0, finalText ); + return this; + } + }; + + // Attach deferreds + deferred.promise( jqXHR ); + + // Add protocol if not provided (prefilters might expect it) + // Handle falsy url in the settings object (#10093: consistency with old signature) + // We also use the url parameter if available + s.url = ( ( url || s.url || location.href ) + "" ) + .replace( rprotocol, location.protocol + "//" ); + + // Alias method option to type as per ticket #12004 + s.type = options.method || options.type || s.method || s.type; + + // Extract dataTypes list + s.dataTypes = ( s.dataType || "*" ).toLowerCase().match( rnothtmlwhite ) || [ "" ]; + + // A cross-domain request is in order when the origin doesn't match the current origin. + if ( s.crossDomain == null ) { + urlAnchor = document.createElement( "a" ); + + // Support: IE <=8 - 11, Edge 12 - 15 + // IE throws exception on accessing the href property if url is malformed, + // e.g. http://example.com:80x/ + try { + urlAnchor.href = s.url; + + // Support: IE <=8 - 11 only + // Anchor's host property isn't correctly set when s.url is relative + urlAnchor.href = urlAnchor.href; + s.crossDomain = originAnchor.protocol + "//" + originAnchor.host !== + urlAnchor.protocol + "//" + urlAnchor.host; + } catch ( e ) { + + // If there is an error parsing the URL, assume it is crossDomain, + // it can be rejected by the transport if it is invalid + s.crossDomain = true; + } + } + + // Convert data if not already a string + if ( s.data && s.processData && typeof s.data !== "string" ) { + s.data = jQuery.param( s.data, s.traditional ); + } + + // Apply prefilters + inspectPrefiltersOrTransports( prefilters, s, options, jqXHR ); + + // If request was aborted inside a prefilter, stop there + if ( completed ) { + return jqXHR; + } + + // We can fire global events as of now if asked to + // Don't fire events if jQuery.event is undefined in an AMD-usage scenario (#15118) + fireGlobals = jQuery.event && s.global; + + // Watch for a new set of requests + if ( fireGlobals && jQuery.active++ === 0 ) { + jQuery.event.trigger( "ajaxStart" ); + } + + // Uppercase the type + s.type = s.type.toUpperCase(); + + // Determine if request has content + s.hasContent = !rnoContent.test( s.type ); + + // Save the URL in case we're toying with the If-Modified-Since + // and/or If-None-Match header later on + // Remove hash to simplify url manipulation + cacheURL = s.url.replace( rhash, "" ); + + // More options handling for requests with no content + if ( !s.hasContent ) { + + // Remember the hash so we can put it back + uncached = s.url.slice( cacheURL.length ); + + // If data is available and should be processed, append data to url + if ( s.data && ( s.processData || typeof s.data === "string" ) ) { + cacheURL += ( rquery.test( cacheURL ) ? "&" : "?" ) + s.data; + + // #9682: remove data so that it's not used in an eventual retry + delete s.data; + } + + // Add or update anti-cache param if needed + if ( s.cache === false ) { + cacheURL = cacheURL.replace( rantiCache, "$1" ); + uncached = ( rquery.test( cacheURL ) ? "&" : "?" ) + "_=" + ( nonce.guid++ ) + + uncached; + } + + // Put hash and anti-cache on the URL that will be requested (gh-1732) + s.url = cacheURL + uncached; + + // Change '%20' to '+' if this is encoded form body content (gh-2658) + } else if ( s.data && s.processData && + ( s.contentType || "" ).indexOf( "application/x-www-form-urlencoded" ) === 0 ) { + s.data = s.data.replace( r20, "+" ); + } + + // Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode. + if ( s.ifModified ) { + if ( jQuery.lastModified[ cacheURL ] ) { + jqXHR.setRequestHeader( "If-Modified-Since", jQuery.lastModified[ cacheURL ] ); + } + if ( jQuery.etag[ cacheURL ] ) { + jqXHR.setRequestHeader( "If-None-Match", jQuery.etag[ cacheURL ] ); + } + } + + // Set the correct header, if data is being sent + if ( s.data && s.hasContent && s.contentType !== false || options.contentType ) { + jqXHR.setRequestHeader( "Content-Type", s.contentType ); + } + + // Set the Accepts header for the server, depending on the dataType + jqXHR.setRequestHeader( + "Accept", + s.dataTypes[ 0 ] && s.accepts[ s.dataTypes[ 0 ] ] ? + s.accepts[ s.dataTypes[ 0 ] ] + + ( s.dataTypes[ 0 ] !== "*" ? ", " + allTypes + "; q=0.01" : "" ) : + s.accepts[ "*" ] + ); + + // Check for headers option + for ( i in s.headers ) { + jqXHR.setRequestHeader( i, s.headers[ i ] ); + } + + // Allow custom headers/mimetypes and early abort + if ( s.beforeSend && + ( s.beforeSend.call( callbackContext, jqXHR, s ) === false || completed ) ) { + + // Abort if not done already and return + return jqXHR.abort(); + } + + // Aborting is no longer a cancellation + strAbort = "abort"; + + // Install callbacks on deferreds + completeDeferred.add( s.complete ); + jqXHR.done( s.success ); + jqXHR.fail( s.error ); + + // Get transport + transport = inspectPrefiltersOrTransports( transports, s, options, jqXHR ); + + // If no transport, we auto-abort + if ( !transport ) { + done( -1, "No Transport" ); + } else { + jqXHR.readyState = 1; + + // Send global event + if ( fireGlobals ) { + globalEventContext.trigger( "ajaxSend", [ jqXHR, s ] ); + } + + // If request was aborted inside ajaxSend, stop there + if ( completed ) { + return jqXHR; + } + + // Timeout + if ( s.async && s.timeout > 0 ) { + timeoutTimer = window.setTimeout( function() { + jqXHR.abort( "timeout" ); + }, s.timeout ); + } + + try { + completed = false; + transport.send( requestHeaders, done ); + } catch ( e ) { + + // Rethrow post-completion exceptions + if ( completed ) { + throw e; + } + + // Propagate others as results + done( -1, e ); + } + } + + // Callback for when everything is done + function done( status, nativeStatusText, responses, headers ) { + var isSuccess, success, error, response, modified, + statusText = nativeStatusText; + + // Ignore repeat invocations + if ( completed ) { + return; + } + + completed = true; + + // Clear timeout if it exists + if ( timeoutTimer ) { + window.clearTimeout( timeoutTimer ); + } + + // Dereference transport for early garbage collection + // (no matter how long the jqXHR object will be used) + transport = undefined; + + // Cache response headers + responseHeadersString = headers || ""; + + // Set readyState + jqXHR.readyState = status > 0 ? 4 : 0; + + // Determine if successful + isSuccess = status >= 200 && status < 300 || status === 304; + + // Get response data + if ( responses ) { + response = ajaxHandleResponses( s, jqXHR, responses ); + } + + // Use a noop converter for missing script + if ( !isSuccess && jQuery.inArray( "script", s.dataTypes ) > -1 ) { + s.converters[ "text script" ] = function() {}; + } + + // Convert no matter what (that way responseXXX fields are always set) + response = ajaxConvert( s, response, jqXHR, isSuccess ); + + // If successful, handle type chaining + if ( isSuccess ) { + + // Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode. + if ( s.ifModified ) { + modified = jqXHR.getResponseHeader( "Last-Modified" ); + if ( modified ) { + jQuery.lastModified[ cacheURL ] = modified; + } + modified = jqXHR.getResponseHeader( "etag" ); + if ( modified ) { + jQuery.etag[ cacheURL ] = modified; + } + } + + // if no content + if ( status === 204 || s.type === "HEAD" ) { + statusText = "nocontent"; + + // if not modified + } else if ( status === 304 ) { + statusText = "notmodified"; + + // If we have data, let's convert it + } else { + statusText = response.state; + success = response.data; + error = response.error; + isSuccess = !error; + } + } else { + + // Extract error from statusText and normalize for non-aborts + error = statusText; + if ( status || !statusText ) { + statusText = "error"; + if ( status < 0 ) { + status = 0; + } + } + } + + // Set data for the fake xhr object + jqXHR.status = status; + jqXHR.statusText = ( nativeStatusText || statusText ) + ""; + + // Success/Error + if ( isSuccess ) { + deferred.resolveWith( callbackContext, [ success, statusText, jqXHR ] ); + } else { + deferred.rejectWith( callbackContext, [ jqXHR, statusText, error ] ); + } + + // Status-dependent callbacks + jqXHR.statusCode( statusCode ); + statusCode = undefined; + + if ( fireGlobals ) { + globalEventContext.trigger( isSuccess ? "ajaxSuccess" : "ajaxError", + [ jqXHR, s, isSuccess ? success : error ] ); + } + + // Complete + completeDeferred.fireWith( callbackContext, [ jqXHR, statusText ] ); + + if ( fireGlobals ) { + globalEventContext.trigger( "ajaxComplete", [ jqXHR, s ] ); + + // Handle the global AJAX counter + if ( !( --jQuery.active ) ) { + jQuery.event.trigger( "ajaxStop" ); + } + } + } + + return jqXHR; + }, + + getJSON: function( url, data, callback ) { + return jQuery.get( url, data, callback, "json" ); + }, + + getScript: function( url, callback ) { + return jQuery.get( url, undefined, callback, "script" ); + } +} ); + +jQuery.each( [ "get", "post" ], function( _i, method ) { + jQuery[ method ] = function( url, data, callback, type ) { + + // Shift arguments if data argument was omitted + if ( isFunction( data ) ) { + type = type || callback; + callback = data; + data = undefined; + } + + // The url can be an options object (which then must have .url) + return jQuery.ajax( jQuery.extend( { + url: url, + type: method, + dataType: type, + data: data, + success: callback + }, jQuery.isPlainObject( url ) && url ) ); + }; +} ); + +jQuery.ajaxPrefilter( function( s ) { + var i; + for ( i in s.headers ) { + if ( i.toLowerCase() === "content-type" ) { + s.contentType = s.headers[ i ] || ""; + } + } +} ); + + +jQuery._evalUrl = function( url, options, doc ) { + return jQuery.ajax( { + url: url, + + // Make this explicit, since user can override this through ajaxSetup (#11264) + type: "GET", + dataType: "script", + cache: true, + async: false, + global: false, + + // Only evaluate the response if it is successful (gh-4126) + // dataFilter is not invoked for failure responses, so using it instead + // of the default converter is kludgy but it works. + converters: { + "text script": function() {} + }, + dataFilter: function( response ) { + jQuery.globalEval( response, options, doc ); + } + } ); +}; + + +jQuery.fn.extend( { + wrapAll: function( html ) { + var wrap; + + if ( this[ 0 ] ) { + if ( isFunction( html ) ) { + html = html.call( this[ 0 ] ); + } + + // The elements to wrap the target around + wrap = jQuery( html, this[ 0 ].ownerDocument ).eq( 0 ).clone( true ); + + if ( this[ 0 ].parentNode ) { + wrap.insertBefore( this[ 0 ] ); + } + + wrap.map( function() { + var elem = this; + + while ( elem.firstElementChild ) { + elem = elem.firstElementChild; + } + + return elem; + } ).append( this ); + } + + return this; + }, + + wrapInner: function( html ) { + if ( isFunction( html ) ) { + return this.each( function( i ) { + jQuery( this ).wrapInner( html.call( this, i ) ); + } ); + } + + return this.each( function() { + var self = jQuery( this ), + contents = self.contents(); + + if ( contents.length ) { + contents.wrapAll( html ); + + } else { + self.append( html ); + } + } ); + }, + + wrap: function( html ) { + var htmlIsFunction = isFunction( html ); + + return this.each( function( i ) { + jQuery( this ).wrapAll( htmlIsFunction ? html.call( this, i ) : html ); + } ); + }, + + unwrap: function( selector ) { + this.parent( selector ).not( "body" ).each( function() { + jQuery( this ).replaceWith( this.childNodes ); + } ); + return this; + } +} ); + + +jQuery.expr.pseudos.hidden = function( elem ) { + return !jQuery.expr.pseudos.visible( elem ); +}; +jQuery.expr.pseudos.visible = function( elem ) { + return !!( elem.offsetWidth || elem.offsetHeight || elem.getClientRects().length ); +}; + + + + +jQuery.ajaxSettings.xhr = function() { + try { + return new window.XMLHttpRequest(); + } catch ( e ) {} +}; + +var xhrSuccessStatus = { + + // File protocol always yields status code 0, assume 200 + 0: 200, + + // Support: IE <=9 only + // #1450: sometimes IE returns 1223 when it should be 204 + 1223: 204 + }, + xhrSupported = jQuery.ajaxSettings.xhr(); + +support.cors = !!xhrSupported && ( "withCredentials" in xhrSupported ); +support.ajax = xhrSupported = !!xhrSupported; + +jQuery.ajaxTransport( function( options ) { + var callback, errorCallback; + + // Cross domain only allowed if supported through XMLHttpRequest + if ( support.cors || xhrSupported && !options.crossDomain ) { + return { + send: function( headers, complete ) { + var i, + xhr = options.xhr(); + + xhr.open( + options.type, + options.url, + options.async, + options.username, + options.password + ); + + // Apply custom fields if provided + if ( options.xhrFields ) { + for ( i in options.xhrFields ) { + xhr[ i ] = options.xhrFields[ i ]; + } + } + + // Override mime type if needed + if ( options.mimeType && xhr.overrideMimeType ) { + xhr.overrideMimeType( options.mimeType ); + } + + // X-Requested-With header + // For cross-domain requests, seeing as conditions for a preflight are + // akin to a jigsaw puzzle, we simply never set it to be sure. + // (it can always be set on a per-request basis or even using ajaxSetup) + // For same-domain requests, won't change header if already provided. + if ( !options.crossDomain && !headers[ "X-Requested-With" ] ) { + headers[ "X-Requested-With" ] = "XMLHttpRequest"; + } + + // Set headers + for ( i in headers ) { + xhr.setRequestHeader( i, headers[ i ] ); + } + + // Callback + callback = function( type ) { + return function() { + if ( callback ) { + callback = errorCallback = xhr.onload = + xhr.onerror = xhr.onabort = xhr.ontimeout = + xhr.onreadystatechange = null; + + if ( type === "abort" ) { + xhr.abort(); + } else if ( type === "error" ) { + + // Support: IE <=9 only + // On a manual native abort, IE9 throws + // errors on any property access that is not readyState + if ( typeof xhr.status !== "number" ) { + complete( 0, "error" ); + } else { + complete( + + // File: protocol always yields status 0; see #8605, #14207 + xhr.status, + xhr.statusText + ); + } + } else { + complete( + xhrSuccessStatus[ xhr.status ] || xhr.status, + xhr.statusText, + + // Support: IE <=9 only + // IE9 has no XHR2 but throws on binary (trac-11426) + // For XHR2 non-text, let the caller handle it (gh-2498) + ( xhr.responseType || "text" ) !== "text" || + typeof xhr.responseText !== "string" ? + { binary: xhr.response } : + { text: xhr.responseText }, + xhr.getAllResponseHeaders() + ); + } + } + }; + }; + + // Listen to events + xhr.onload = callback(); + errorCallback = xhr.onerror = xhr.ontimeout = callback( "error" ); + + // Support: IE 9 only + // Use onreadystatechange to replace onabort + // to handle uncaught aborts + if ( xhr.onabort !== undefined ) { + xhr.onabort = errorCallback; + } else { + xhr.onreadystatechange = function() { + + // Check readyState before timeout as it changes + if ( xhr.readyState === 4 ) { + + // Allow onerror to be called first, + // but that will not handle a native abort + // Also, save errorCallback to a variable + // as xhr.onerror cannot be accessed + window.setTimeout( function() { + if ( callback ) { + errorCallback(); + } + } ); + } + }; + } + + // Create the abort callback + callback = callback( "abort" ); + + try { + + // Do send the request (this may raise an exception) + xhr.send( options.hasContent && options.data || null ); + } catch ( e ) { + + // #14683: Only rethrow if this hasn't been notified as an error yet + if ( callback ) { + throw e; + } + } + }, + + abort: function() { + if ( callback ) { + callback(); + } + } + }; + } +} ); + + + + +// Prevent auto-execution of scripts when no explicit dataType was provided (See gh-2432) +jQuery.ajaxPrefilter( function( s ) { + if ( s.crossDomain ) { + s.contents.script = false; + } +} ); + +// Install script dataType +jQuery.ajaxSetup( { + accepts: { + script: "text/javascript, application/javascript, " + + "application/ecmascript, application/x-ecmascript" + }, + contents: { + script: /\b(?:java|ecma)script\b/ + }, + converters: { + "text script": function( text ) { + jQuery.globalEval( text ); + return text; + } + } +} ); + +// Handle cache's special case and crossDomain +jQuery.ajaxPrefilter( "script", function( s ) { + if ( s.cache === undefined ) { + s.cache = false; + } + if ( s.crossDomain ) { + s.type = "GET"; + } +} ); + +// Bind script tag hack transport +jQuery.ajaxTransport( "script", function( s ) { + + // This transport only deals with cross domain or forced-by-attrs requests + if ( s.crossDomain || s.scriptAttrs ) { + var script, callback; + return { + send: function( _, complete ) { + script = jQuery( " + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Index
  • + + +
  • + + + +
  • + +
+ + +
+
+
+
+ + +

Index

+ +
+ A + | B + | C + | D + | E + | F + | G + | H + | I + | L + | M + | N + | P + | Q + | R + | S + | T + | U + | V + | W + | X + +
+

A

+ + + +
+ +

B

+ + +
+ +

C

+ + + +
+ +

D

+ + + +
+ +

E

+ + + +
+ +

F

+ + + +
+ +

G

+ + + +
+ +

H

+ + + +
+ +

I

+ + + +
+ +

L

+ + + +
    +
  • + libfmp.b + +
  • +
  • + libfmp.b.b_annotation + +
  • +
  • + libfmp.b.b_audio + +
  • +
  • + libfmp.b.b_layout + +
  • +
  • + libfmp.b.b_plot + +
  • +
  • + libfmp.b.b_sonification + +
  • +
  • + libfmp.b.b_test_module + +
  • +
  • + libfmp.c1 + +
  • +
  • + libfmp.c1.c1s1_sheet_music + +
  • +
  • + libfmp.c1.c1s2_symbolic_rep + +
  • +
  • + libfmp.c1.c1s3_audio_rep + +
  • +
  • + libfmp.c2 + +
  • +
  • + libfmp.c2.c2_complex + +
  • +
  • + libfmp.c2.c2_digitization + +
  • +
  • + libfmp.c2.c2_fourier + +
  • +
  • + libfmp.c2.c2_interference + +
  • +
  • + libfmp.c2.c2_interpolation + +
  • +
  • + libfmp.c3 + +
  • +
  • + libfmp.c3.c3s1_audio_feature + +
  • +
  • + libfmp.c3.c3s1_post_processing + +
  • +
  • + libfmp.c3.c3s1_transposition_tuning + +
  • +
  • + libfmp.c3.c3s2_dtw + +
  • +
  • + libfmp.c3.c3s2_dtw_plot + +
  • +
  • + libfmp.c3.c3s3_tempo_curve + +
  • +
  • + libfmp.c4 + +
  • +
  • + libfmp.c4.c4s1_annotation + +
  • +
  • + libfmp.c4.c4s2_ssm + +
  • +
+ +

M

+ + + +
+ +

N

+ + + +
+ +

P

+ + + +
+ +

Q

+ + + +
+ +

R

+ + + +
+ +

S

+ + + +
+ +

T

+ + + +
+ +

U

+ + +
+ +

V

+ + + +
+ +

W

+ + + +
+ +

X

+ + +
+ + + +
+ +
+
+ +
+ +
+

+ © Copyright 2021, Meinard Müller and Frank Zalkow. + +

+
+ + + + Built with Sphinx using a + + theme + + provided by Read the Docs. + +
+
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/getting_started.html b/docs/build/html/getting_started.html new file mode 100644 index 0000000..682e3b1 --- /dev/null +++ b/docs/build/html/getting_started.html @@ -0,0 +1,244 @@ + + + + + + + + + + Getting Started — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ + + + +
+
+
+
+ +
+

Getting Started

+

You can install libfmp using the Python package manager pip:

+
pip install libfmp
+
+
+

Beyond the API documentation of this webpage, you find extensive explanations of libfmp’s functionality in the FMP Notebooks:

+

https://www.audiolabs-erlangen.de/FMP

+

In particular, there are dedicated notebooks on how to get started with FMP and on libfmp.

+

https://www.audiolabs-erlangen.de/resources/MIR/FMP/B/B_GetStarted.html +https://www.audiolabs-erlangen.de/resources/MIR/FMP/B/B_libfmp.html

+
+ + +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/index.html b/docs/build/html/index.html new file mode 100644 index 0000000..64f8158 --- /dev/null +++ b/docs/build/html/index.html @@ -0,0 +1,251 @@ + + + + + + + + + + Libfmp API Documentation — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ + + + +
+
+
+
+ +
+

Libfmp API Documentation

+

This webpage contains the API documentation for the Python package libfmp. +This package goes hand in hand with the FMP Notebooks, a collection of educational material for teaching and learning Fundamentals of Music Processing (FMP) with a particular focus on the audio domain. +For detailed explanations and example applications of the libfmp-functions, we refer to the FMP Notebooks:

+

http://audiolabs-erlangen.de/FMP

+

The source code for the package libfmp is hosted at GitHub:

+

https://github.com/meinardmueller/libfmp

+

If you use libfmp in a scholarly work, please consider citing the FMP article. 1

+
+
1
+

Meinard Müller and Frank Zalkow. FMP Notebooks: Educational Material for Teaching and Learning Fundamentals of Music Processing. Proceedings of the International Conference on Music Information Retrieval (ISMIR), pp. 573-580, Delft, The Netherlands, 2019.

+
+
+
+
+
+
+
+
+
+ + +
+ +
+
+ + +
+ +
+

+ © Copyright 2021, Meinard Müller and Frank Zalkow. + +

+
+ + + + Built with Sphinx using a + + theme + + provided by Read the Docs. + +
+
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/index_b.html b/docs/build/html/index_b.html new file mode 100644 index 0000000..f8f65f7 --- /dev/null +++ b/docs/build/html/index_b.html @@ -0,0 +1,894 @@ + + + + + + + + + + Basics (libfmp.b) — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ + + + +
+
+
+
+ +
+

Basics (libfmp.b)

+

The FMP notebooks provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL:

+

https://www.audiolabs-erlangen.de/resources/MIR/FMP/B/B.html

+
+
+libfmp.b.b_annotation.cut_audio(fn_in, fn_out, start_sec, end_sec, normalize=True, write=True, Fs=22050)[source]
+

Cuts an audio file

+
+
Parameters
+
    +
  • fn_in (str) – Filename and path for input audio file

  • +
  • fn_out (str) – Filename and path for input audio file

  • +
  • start_sec (float) – Start time position (in seconds) of cut

  • +
  • end_sec (float) – End time position (in seconds) of cut

  • +
  • normalize (bool) – If True, then normalize audio (with max norm) (Default value = True)

  • +
  • write (bool) – If True, then write audio (Default value = True)

  • +
  • Fs (scalar) – Sampling rate of audio (Default value = 22050)

  • +
+
+
Returns
+

x_cut (np.ndarray) – Cut audio

+
+
+
+ +
+
+libfmp.b.b_annotation.cut_csv_file(fn_in, fn_out, start_sec, end_sec, write=True)[source]
+

Cuts csv annotation file

+
+
Parameters
+
    +
  • fn_in (str) – Filename and path for input audio file

  • +
  • fn_out (str) – Filename and path for input audio file

  • +
  • start_sec (float) – Start time position (in seconds) of cut

  • +
  • end_sec (float) – End time position (in seconds) of cut

  • +
  • write (bool) – If True, then write audio (Default value = True)

  • +
+
+
Returns
+

ann_cut (list) – Cut annotation file

+
+
+
+ +
+
+libfmp.b.b_annotation.read_csv(fn, header=True, add_label=False)[source]
+

Reads a CSV file

+
+
Parameters
+
    +
  • fn (str) – Filename

  • +
  • header (bool) – Boolean (Default value = True)

  • +
  • add_label (bool) – Add column with constant value of add_label (Default value = False)

  • +
+
+
Returns
+

df (pd.DataFrame) – Pandas DataFrame

+
+
+
+ +
+
+libfmp.b.b_annotation.write_csv(df, fn, header=True)[source]
+

Writes a CSV file

+
+
Parameters
+
    +
  • df (pd.DataFrame) – Pandas DataFrame

  • +
  • fn (str) – Filename

  • +
  • header (bool) – Boolean (Default value = True)

  • +
+
+
+
+ +
+
+libfmp.b.b_audio.audio_player_list(signals, rates, width=270, height=40, columns=None, column_align='center')[source]
+

Generates list of audio players

+

Notebook: B/B_PythonAudio.ipynb

+
+
Parameters
+
    +
  • signals (list) – List of audio signals

  • +
  • rates (list) – List of sample rates

  • +
  • width (int) – Width of player (either number or list) (Default value = 270)

  • +
  • height (int) – Height of player (either number or list) (Default value = 40)

  • +
  • columns (list) – Column headings (Default value = None)

  • +
  • column_align (str) – Left, center, right (Default value = ‘center’)

  • +
+
+
+
+ +
+
+libfmp.b.b_audio.read_audio(path, Fs=None, mono=False)[source]
+

Reads an audio file

+
+
Parameters
+
    +
  • path (str) – Path to audio file

  • +
  • Fs (scalar) – Resample audio to given sampling rate. Use native sampling rate if None. (Default value = None)

  • +
  • mono (bool) – Convert multi-channel file to mono. (Default value = False)

  • +
+
+
Returns
+
    +
  • x (np.ndarray) – Waveform signal

  • +
  • Fs (scalar) – Sampling rate

  • +
+
+
+
+ +
+
+libfmp.b.b_audio.write_audio(path, x, Fs)[source]
+

Writes an audio file

+
+
Parameters
+
    +
  • path (str) – Path to audio file

  • +
  • x (np.ndarray) – Waveform signal

  • +
  • Fs (scalar) – Sampling rate

  • +
+
+
+
+ +
+
+class libfmp.b.b_layout.FloatingBox(align='middle')[source]
+

Inspired by https://stackoverflow.com/a/49566213/2812618

+

Floating box for matplotlib plots. The added figures are part of a floating box.

+
+
Attributes
+

html – The HTML string

+
+
+
+
+add_fig(fig)[source]
+

Saves a PNG representation of a matplotlib figure

+
+
Parameters
+

fig – A matplotlib figure

+
+
+
+ +
+
+add_html(html)[source]
+

Add HTML to floating box

+
+
Parameters
+

html – HTML string

+
+
+
+ +
+
+show()[source]
+

Display the accumulated HTML

+
+ +
+ +
+
+class libfmp.b.b_plot.MultiplePlotsWithColorbar(num_plots, figsize=(8, 4), dpi=72, cbar_ratio=0.1, height_ratios=None)[source]
+

Two-column layout plot, where the first column is for user-given plots and the second column +is for colorbars if the corresponding row needs a colorbar.

+
+
Attributes
+
    +
  • axes – A list of axes for the first column.

  • +
  • cbar_axes – A list of axes for the second column.

  • +
  • num_plots – Number of rows, as given to init method.

  • +
+
+
+
+
+make_colorbars()[source]
+

Creates colorbars if the corresponding row needs a colorbar, or hides the axis in other cases.

+
+ +
+ +
+
+libfmp.b.b_plot.check_line_annotations(annot, default_label='')[source]
+

Checks line annotation. If label is missing, adds an default label.

+
+
Parameters
+
    +
  • annot – A List of the form of [(time_position, label), ...], or [(time_position, ), ...], +or [time_position, ...]

  • +
  • default_label – The default label used if label is missing

  • +
+
+
Returns
+

annot – A List of tuples in the form of [(time_position, label), ...]

+
+
+
+ +
+
+libfmp.b.b_plot.check_segment_annotations(annot, default_label='')[source]
+

Checks segment annotation. If label is missing, adds an default label.

+
+
Parameters
+
    +
  • annot – A List of the form of [(start_position, end_position, label), ...], or +[(start_position, end_position), ...]

  • +
  • default_label – The default label used if label is missing

  • +
+
+
Returns
+

annot – A List of tuples in the form of [(start_position, end_position, label), ...]

+
+
+
+ +
+
+libfmp.b.b_plot.color_argument_to_dict(colors, labels_set, default='gray')[source]
+

Creates a color dictionary

+
+
Parameters
+
    +
  • colors – Several options: 1. string of FMP_COLORMAPS, 2. string of matplotlib colormap, +3. list or np.ndarray of matplotlib color specifications, 4. dict that assigns labels to colors

  • +
  • labels_set – List of all labels

  • +
  • default – Default color, used for labels that are in labels_set, but not in colors

  • +
+
+
Returns
+

color_dict – Dictionary that maps labels to colors

+
+
+
+ +
+
+libfmp.b.b_plot.compressed_gray_cmap(alpha=5, N=256, reverse=False)[source]
+

Creates a logarithmically or exponentially compressed grayscale colormap

+
+
Parameters
+
    +
  • alpha (float) – The compression factor. If alpha > 0, it performs log compression (enhancing black colors). +If alpha < 0, it performs exp compression (enhancing white colors). +Raises an error if alpha = 0. (Default value = 5)

  • +
  • N (int) – The number of rgb quantization levels (usually 256 in matplotlib) (Default value = 256)

  • +
  • reverse (bool) – If False then “white to black”, if True then “black to white” (Default value = False)

  • +
+
+
Returns
+

color_wb (mpl.colors.LinearSegmentedColormap) – The colormap

+
+
+
+ +
+
+libfmp.b.b_plot.plot_annotation_line(annot, ax=None, label_keys={}, colors='FMP_1', figsize=(6, 1), direction='horizontal', time_min=None, time_max=None, time_axis=True, nontime_axis=False, swap_time_ticks=False, axis_off=False, dpi=72)[source]
+

Creates a line plot for annotation data

+
+
Parameters
+
    +
  • annot – A List of tuples in the form of [(time_position, label), ...]

  • +
  • ax – The Axes instance to plot on. If None, will create a figure and axes. (Default value = None)

  • +
  • label_keys – A dict, where the keys are the labels used in annot. The values are dicts, which are used as +keyword arguments for matplotlib.pyplot.axvline or matplotlib.pyplot.axhline. (Default value = {})

  • +
  • colors – Several options: 1. string of FMP_COLORMAPS, 2. string of matplotlib colormap, 3. list or +np.ndarray of matplotlib color specifications, 4. dict that assigns labels to colors +(Default value = ‘FMP_1’)

  • +
  • figsize – Width, height in inches (Default value = (6, 1)

  • +
  • direction – ‘vertical’ or ‘horizontal’ (Default value = ‘horizontal’)

  • +
  • time_min – Minimal limit for time axis. If None, will be min annotation. (Default value = None)

  • +
  • time_max – Maximal limit for time axis. If None, will be max from annotation. (Default value = None)

  • +
  • time_axis – Display time axis ticks or not (Default value = True)

  • +
  • nontime_axis – Display non-time axis ticks or not (Default value = False)

  • +
  • swap_time_ticks – For horizontal: xticks up; for vertical: yticks left (Default value = False)

  • +
  • axis_off – Calls ax.axis(‘off’) (Default value = False)

  • +
  • dpi – Dots per inch (Default value = 72)

  • +
+
+
Returns
+
    +
  • fig – The created matplotlib figure or None if ax was given.

  • +
  • ax – The used axes.

  • +
+
+
+
+ +
+
+libfmp.b.b_plot.plot_annotation_line_overlay(*args, **kwargs)[source]
+

Plot segment annotations as overlay

+

See libfmp.b.b_plot.plot_annotation_line() for parameters and return values.

+
+ +
+
+libfmp.b.b_plot.plot_annotation_multiline(annot, ax=None, label_keys={}, colors='FMP_1', figsize=(6, 1.5), direction='horizontal', sort_labels=None, time_min=None, time_max=None, time_axis=True, swap_time_ticks=False, axis_off=False, dpi=72)[source]
+

Creates a multi-line plot for annotation data

+
+
Parameters
+
    +
  • annot – A List of tuples in the form of [(time_position, label), ...]

  • +
  • ax – The Axes instance to plot on. If None, will create a figure and axes. (Default value = None)

  • +
  • label_keys – A dict, where the keys are the labels used in annot. The values are dicts, which are used as +keyword arguments for matplotlib.pyplot.axvline or matplotlib.pyplot.axhline. (Default value = {})

  • +
  • colors – Several options: 1. string of FMP_COLORMAPS, 2. string of matplotlib colormap, 3. list or np.ndarray +of matplotlib color specifications, 4. dict that assigns labels to colors (Default value = ‘FMP_1’)

  • +
  • figsize – Width, height in inches (Default value = (6, 1.5)

  • +
  • direction – ‘vertical’ or ‘horizontal’ (Default value = ‘horizontal’)

  • +
  • sort_labels – List of labels used for sorting the line plots (Default value = None)

  • +
  • time_min – Minimal limit for time axis. If None, will be min annotation. (Default value = None)

  • +
  • time_max – Maximal limit for time axis. If None, will be max from annotation. (Default value = None)

  • +
  • time_axis – Display time axis ticks or not (Default value = True)

  • +
  • swap_time_ticks – For horizontal: xticks up; for vertical: yticks left (Default value = False)

  • +
  • axis_off – Calls ax.axis(‘off’) (Default value = False)

  • +
  • dpi – Dots per inch (Default value = 72)

  • +
+
+
Returns
+
    +
  • fig – The created matplotlib figure or None if ax was given.

  • +
  • ax – The used axes.

  • +
+
+
+
+ +
+
+libfmp.b.b_plot.plot_chromagram(*args, chroma_yticks=np.arange(12), **kwargs)[source]
+

Calls libfmp.b.plot_matrix and sets chroma labels

+

See libfmp.b.b_plot.plot_matrix() for parameters and return values.

+
+ +
+
+libfmp.b.b_plot.plot_matrix(X, Fs=1, Fs_F=1, T_coef=None, F_coef=None, xlabel='Time (seconds)', ylabel='Frequency (Hz)', xlim=None, ylim=None, clim=None, title='', dpi=72, colorbar=True, colorbar_aspect=20.0, cbar_label='', ax=None, figsize=(6, 3), **kwargs)[source]
+

Plot a matrix, e.g. a spectrogram or a tempogram

+
+
Parameters
+
    +
  • X – The matrix

  • +
  • Fs – Sample rate for axis 1 (Default value = 1)

  • +
  • Fs_F – Sample rate for axis 0 (Default value = 1)

  • +
  • T_coef – Time coeffients. If None, will be computed, based on Fs. (Default value = None)

  • +
  • F_coef – Frequency coeffients. If None, will be computed, based on Fs_F. (Default value = None)

  • +
  • xlabel – Label for x-axis (Default value = ‘Time (seconds)’)

  • +
  • ylabel – Label for y-axis (Default value = ‘Frequency (Hz)’)

  • +
  • xlim – Limits for x-axis (Default value = None)

  • +
  • ylim – Limits for y-axis (Default value = None)

  • +
  • clim – Color limits (Default value = None)

  • +
  • title – Title for plot (Default value = ‘’)

  • +
  • dpi – Dots per inch (Default value = 72)

  • +
  • colorbar – Create a colorbar. (Default value = True)

  • +
  • colorbar_aspect – Aspect used for colorbar, in case only a single axes is used. (Default value = 20.0)

  • +
  • cbar_label – Label for colorbar (Default value = ‘’)

  • +
  • ax – Either (1.) a list of two axes (first used for matrix, second for colorbar), or (2.) a list with a single +axes (used for matrix), or (3.) None (an axes will be created). (Default value = None)

  • +
  • figsize – Width, height in inches (Default value = (6, 3))

  • +
  • **kwargs – Keyword arguments for matplotlib.pyplot.imshow

  • +
+
+
Returns
+
    +
  • fig – The created matplotlib figure or None if ax was given.

  • +
  • ax – The used axes.

  • +
  • im – The image plot

  • +
+
+
+
+ +
+
+libfmp.b.b_plot.plot_segments(annot, ax=None, figsize=(6, 1), direction='horizontal', colors='FMP_1', time_min=None, time_max=None, nontime_min=0, nontime_max=1, time_axis=True, nontime_axis=False, time_label=None, swap_time_ticks=False, edgecolor='k', axis_off=False, dpi=72, adjust_time_axislim=True, adjust_nontime_axislim=True, alpha=None, print_labels=True, label_ticks=False, **kwargs)[source]
+

Creates a multi-line plot for annotation data

+
+
Parameters
+
    +
  • annot – A List of tuples in the form of [(start_position, end_position, label), ...]

  • +
  • ax – The Axes instance to plot on. If None, will create a figure and axes. (Default value = None)

  • +
  • figsize – Width, height in inches (Default value = (6, 1)

  • +
  • direction – ‘vertical’ or ‘horizontal’ (Default value = ‘horizontal’)

  • +
  • colors – Several options: 1. string of FMP_COLORMAPS, 2. string of matplotlib colormap, 3. list or np.ndarray +of matplotlib color specifications, 4. dict that assigns labels to colors (Default value = ‘FMP_1’)

  • +
  • time_min – Minimal limit for time axis. If None, will be min annotation. (Default value = None)

  • +
  • time_max – Maximal limit for time axis. If None, will be max from annotation. (Default value = None)

  • +
  • nontime_min – Minimal limit for non-time axis. (Default value = 0)

  • +
  • nontime_max – Maximal limit for non-time axis. (Default value = 1)

  • +
  • time_axis – Display time axis ticks or not (Default value = True)

  • +
  • nontime_axis – Display non-time axis ticks or not (Default value = False)

  • +
  • time_label – Label for time axes (Default value = None)

  • +
  • swap_time_ticks – For horizontal: xticks up; for vertical: yticks left (Default value = False)

  • +
  • edgecolor – Color for edgelines of segment box (Default value = ‘k’)

  • +
  • axis_off – Calls ax.axis(‘off’) (Default value = False)

  • +
  • dpi – Dots per inch (Default value = 72)

  • +
  • adjust_time_axislim – Adjust time-axis. Usually True for plotting on standalone axes and False for +overlay plotting (Default value = True)

  • +
  • adjust_nontime_axislim – Adjust non-time-axis. Usually True for plotting on standalone axes and False for +overlay plotting (Default value = True)

  • +
  • alpha – Alpha value for rectangle (Default value = None)

  • +
  • print_labels – Print labels inside Rectangles (Default value = True)

  • +
  • label_ticks – Print labels as ticks (Default value = False)

  • +
  • **kwargs

  • +
+
+
Returns
+
    +
  • fig – The created matplotlib figure or None if ax was given.

  • +
  • ax – The used axes.

  • +
+
+
+
+ +
+
+libfmp.b.b_plot.plot_segments_overlay(*args, **kwargs)[source]
+

Plot segment annotations as overlay

+

See libfmp.b.b_plot.plot_segments() for parameters and return values.

+
+ +
+
+libfmp.b.b_plot.plot_signal(x, Fs=1, T_coef=None, ax=None, figsize=(6, 2), xlabel='Time (seconds)', ylabel='', title='', dpi=72, ylim=True, **kwargs)[source]
+

Plot a signal, e.g. a waveform or a novelty function

+
+
Parameters
+
    +
  • x – Input signal

  • +
  • Fs – Sample rate (Default value = 1)

  • +
  • T_coef – Time coeffients. If None, will be computed, based on Fs. (Default value = None)

  • +
  • ax – The Axes instance to plot on. If None, will create a figure and axes. (Default value = None)

  • +
  • figsize – Width, height in inches (Default value = (6, 2))

  • +
  • xlabel – Label for x axis (Default value = ‘Time (seconds)’)

  • +
  • ylabel – Label for y axis (Default value = ‘’)

  • +
  • title – Title for plot (Default value = ‘’)

  • +
  • dpi – Dots per inch (Default value = 72)

  • +
  • ylim – True or False (auto adjust ylim or nnot) or tuple with actual ylim (Default value = True)

  • +
  • **kwargs – Keyword arguments for matplotlib.pyplot.plot

  • +
+
+
Returns
+
    +
  • fig – The created matplotlib figure or None if ax was given.

  • +
  • ax – The used axes.

  • +
  • line – The line plot

  • +
+
+
+
+ +
+
+libfmp.b.b_sonification.generate_shepard_tone(chromaNum, Fs, N, weight=1, Fc=440, sigma=15, phase=0)[source]
+

Generates shepard tone

+
+
Parameters
+
    +
  • chromaNum (int) – 1=C,…

  • +
  • Fs (scalar) – Sampling frequency

  • +
  • N (int) – Desired length (in samples)

  • +
  • weight (float) – Scaling factor [0:1] (Default value = 1)

  • +
  • Fc (float) – Frequency for A4 (Default value = 440)

  • +
  • sigma (float) – Parameter for envelope of Shepard tone (Default value = 15)

  • +
  • phase (float) – Phase of sine (Default value = 0)

  • +
+
+
Returns
+

tone (np.ndarray) – Shepard tone

+
+
+
+ +
+
+libfmp.b.b_sonification.list_to_chromagram(note_list, num_frames, frame_rate)[source]
+

Create a chromagram matrix from a list of note events

+
+
Parameters
+
    +
  • note_list (list) – A list of note events (e.g. gathered from a CSV file by +libfmp.c1.c1s2_symbolic_rep.csv_to_list())

  • +
  • num_frames (int) – Desired number of frames for the matrix

  • +
  • frame_rate (float) – Frame rate for C (in Hz)

  • +
+
+
Returns
+

C (np.ndarray) – Chromagram matrix

+
+
+
+ +
+
+libfmp.b.b_sonification.list_to_pitch_activations(note_list, num_frames, frame_rate)[source]
+

Create a pitch activation matrix from a list of note events

+
+
Parameters
+
    +
  • note_list (list) – A list of note events (e.g., gathered from a CSV file by +libfmp.c1.c1s2_symbolic_rep.csv_to_list())

  • +
  • num_frames (int) – Desired number of frames for the matrix

  • +
  • frame_rate (float) – Frame rate for P (in Hz)

  • +
+
+
Returns
+
    +
  • P (np.ndarray) – Pitch activation matrix (first axis: Indexed by [0:127], encoding MIDI pitches [1:128])

  • +
  • F_coef_MIDI (np.ndarray) – MIDI pitch axis

  • +
+
+
+
+ +
+
+libfmp.b.b_sonification.sonify_chromagram(chroma_data, N, frame_rate, Fs, fading_msec=5)[source]
+

Sonify the chroma features from a chromagram

+
+
Parameters
+
    +
  • chroma_data (np.ndarray) – A chromagram (e.g., gathered from a list of note events by +libfmp.b.b_sonification.list_to_chromagram())

  • +
  • N (int) – Length of the sonification (in samples)

  • +
  • frame_rate (float) – Frame rate for P (in Hz)

  • +
  • Fs (float) – Sampling frequency (in Hz)

  • +
  • fading_msec (float) – The length of the fade in and fade out for sonified tones (in msec) +(Default value = 5)

  • +
+
+
Returns
+

chroma_son (np.ndarray) – Sonification of the chromagram

+
+
+
+ +
+
+libfmp.b.b_sonification.sonify_chromagram_with_signal(chroma_data, x, frame_rate, Fs, fading_msec=5, stereo=True)[source]
+

Sonify the chroma features from a chromagram together with a corresponding signal

+
+
Parameters
+
    +
  • chroma_data (np.ndarray) – A chromagram (e.g., gathered from a list of note events by +libfmp.b.b_sonification.list_to_chromagram())

  • +
  • x (np.ndarray) – Original signal

  • +
  • frame_rate (float) – Frame rate for P (in Hz)

  • +
  • Fs (float) – Sampling frequency (in Hz)

  • +
  • fading_msec (float) – The length of the fade in and fade out for sonified tones (in msec) +(Default value = 5)

  • +
  • stereo (bool) – Decision between stereo and mono sonification (Default value = True)

  • +
+
+
Returns
+
    +
  • chroma_son (np.ndarray) – Sonification of the chromagram

  • +
  • out (np.ndarray) – Sonification combined with the original signal

  • +
+
+
+
+ +
+
+libfmp.b.b_sonification.sonify_pitch_activations(P, N, frame_rate, Fs, min_pitch=1, Fc=440, harmonics_weights=[1], fading_msec=5)[source]
+

Sonify the pitches from a pitch activation matrix

+
+
Parameters
+
    +
  • P (np.ndarray) – A pitch activation matrix (e.g., gathered from a list of note events by +libfmp.b.b_sonification.list_to_pitch_activations()). First axis: Indexed by [0:127], +encoding MIDI pitches [1:128]

  • +
  • N (int) – Length of the sonification (in samples)

  • +
  • frame_rate (float) – Frame rate for P (in Hz)

  • +
  • Fs (float) – Sampling frequency (in Hz)

  • +
  • min_pitch (int) – Lowest MIDI pitch in P (Default value = 1)

  • +
  • Fc (float) – Tuning frequency (in Hz) (Default value = 440)

  • +
  • harmonics_weights (list) – A list of weights for the harmonics of the tones to be sonified +(Default value = [1])

  • +
  • fading_msec (float) – The length of the fade in and fade out for sonified tones (in msec) +(Default value = 5)

  • +
+
+
Returns
+

pitch_son (np.ndarray) – Sonification of the pitch activation matrix

+
+
+
+ +
+
+libfmp.b.b_sonification.sonify_pitch_activations_with_signal(P, x, frame_rate, Fs, min_pitch=1, Fc=440, harmonics_weights=[1], fading_msec=5, stereo=True)[source]
+

Sonify the pitches from a pitch activation matrix together with a corresponding signal

+
+
Parameters
+
    +
  • P (np.ndarray) – A pitch activation matrix (e.g., gathered from a list of note events by +libfmp.b.b_sonification.list_to_pitch_activations())

  • +
  • x (np.ndarray) – Original signal

  • +
  • frame_rate (float) – Frame rate for P (in Hz)

  • +
  • Fs (float) – Sampling frequency (in Hz)

  • +
  • min_pitch (int) – Lowest MIDI pitch in P (Default value = 1)

  • +
  • Fc (float) – Tuning frequency (in Hz) (Default value = 440)

  • +
  • harmonics_weights (list) – A list of weights for the harmonics of the tones to be sonified +(Default value = [1])

  • +
  • fading_msec (float) – The length of the fade in and fade out for sonified tones (in msec) +(Default value = 5)

  • +
  • stereo (bool) – Decision between stereo and mono sonification (Default value = True)

  • +
+
+
Returns
+
    +
  • pitch_son (np.ndarray) – Sonification of the pitch activation matrix

  • +
  • out (np.ndarray) – Sonification combined with the original signal

  • +
+
+
+
+ +
+
+libfmp.b.b_test_module.add(a, b=0, c=0)[source]
+

Function to add three numbers

+
+
Notebook: B/B_libfmp.ipynb and
+ +
+
+
Parameters
+
    +
  • a (float) – First number

  • +
  • b (float) – Second number (default: 0)

  • +
  • c (float) – Third number (default: 0)

  • +
+
+
Returns
+

d (float) – Sum

+
+
+
+ +
+ + +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/index_c1.html b/docs/build/html/index_c1.html new file mode 100644 index 0000000..7168f07 --- /dev/null +++ b/docs/build/html/index_c1.html @@ -0,0 +1,726 @@ + + + + + + + + + + Music Representations (libfmp.c1) — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Music Representations (libfmp.c1)
  • + + +
  • + + + View page source + + +
  • + +
+ + +
+
+
+
+ +
+

Music Representations (libfmp.c1)

+

The FMP notebooks provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL:

+

https://www.audiolabs-erlangen.de/resources/MIR/FMP/C1/C1.html

+
+
+libfmp.c1.c1s1_sheet_music.generate_chirp_exp_octave(freq_start=440, dur=8, Fs=44100, amp=1)[source]
+

Generate one octave of a chirp with exponential frequency increase

+

Notebook: C1/C1S1_ChromaShepard.ipynb

+
+
Parameters
+
    +
  • freq_start (float) – Start frequency of chirp (Default value = 440)

  • +
  • dur (float) – Duration (in seconds) (Default value = 8)

  • +
  • Fs (scalar) – Sampling rate (Default value = 44100)

  • +
  • amp (float) – Amplitude of generated signal (Default value = 1)

  • +
+
+
Returns
+
    +
  • x (np.ndarray) – Chirp signal

  • +
  • t (np.ndarray) – Time axis (in seconds)

  • +
+
+
+
+ +
+
+libfmp.c1.c1s1_sheet_music.generate_shepard_glissando(num_octaves=3, dur_octave=8, Fs=44100)[source]
+

Generate several ocatves of a Shepared glissando

+

Notebook: C1/C1S1_ChromaShepard.ipynb

+
+
Parameters
+
    +
  • num_octaves (int) – Number of octaves (Default value = 3)

  • +
  • dur_octave (int) – Duration (in seconds) per octave (Default value = 8)

  • +
  • Fs (scalar) – Sampling rate (Default value = 44100)

  • +
+
+
Returns
+
    +
  • x (np.ndarray) – Shepared glissando

  • +
  • t (np.ndarray) – Time axis (in seconds)

  • +
+
+
+
+ +
+
+libfmp.c1.c1s1_sheet_music.generate_shepard_tone(freq=440, dur=0.5, Fs=44100, amp=1)[source]
+

Generate Shepard tone

+

Notebook: C1/C1S1_ChromaShepard.ipynb

+
+
Parameters
+
    +
  • freq (float) – Frequency of Shepard tone (Default value = 440)

  • +
  • dur (float) – Duration (in seconds) (Default value = 0.5)

  • +
  • Fs (scalar) – Sampling rate (Default value = 44100)

  • +
  • amp (float) – Amplitude of generated signal (Default value = 1)

  • +
+
+
Returns
+
    +
  • x (np.ndarray) – Shepard tone

  • +
  • t (np.ndarray) – Time axis (in seconds)

  • +
+
+
+
+ +
+
+libfmp.c1.c1s1_sheet_music.generate_sinusoid_pitches(pitches=[69], dur=0.5, Fs=4000, amp=1)[source]
+

Generation of sinusoids for a given list of MIDI pitches

+

Notebook: C1/C1S1_MusicalNotesPitches.ipynb

+
+
Parameters
+
    +
  • pitches (list) – List of MIDI pitches (Default value = [69])

  • +
  • dur (float) – Duration (in seconds) of each sinusoid (Default value = 0.5)

  • +
  • Fs (scalar) – Sampling rate (Default value = 4000)

  • +
  • amp (float) – Amplitude of generated signal (Default value = 1)

  • +
+
+
Returns
+
    +
  • x (np.ndarray) – Signal

  • +
  • t (np.ndarray) – Time axis (in seconds)

  • +
+
+
+
+ +
+
+libfmp.c1.c1s2_symbolic_rep.csv_to_list(csv)[source]
+

Convert a csv score file to a list of note events

+

Notebook: C1/C1S2_CSV.ipynb

+
+
Parameters
+

csv (str or pd.DataFrame) – Either a path to a csv file or a data frame

+
+
Returns
+

score (list) – A list of note events where each note is specified as +[start, duration, pitch, velocity, label]

+
+
+
+ +
+
+libfmp.c1.c1s2_symbolic_rep.list_to_csv(score, fn_out)[source]
+

Convert a list of note events to a csv file

+
+
Parameters
+
    +
  • score (list) – List of note events

  • +
  • fn_out (str) – The path of the csv file to be created

  • +
+
+
+
+ +
+
+libfmp.c1.c1s2_symbolic_rep.midi_to_list(midi)[source]
+

Convert a midi file to a list of note events

+

Notebook: C1/C1S2_MIDI.ipynb

+
+
Parameters
+

midi (str or pretty_midi.pretty_midi.PrettyMIDI) – Either a path to a midi file or PrettyMIDI object

+
+
Returns
+

score (list) – A list of note events where each note is specified as +[start, duration, pitch, velocity, label]

+
+
+
+ +
+
+libfmp.c1.c1s2_symbolic_rep.visualize_piano_roll(score, xlabel='Time (seconds)', ylabel='Pitch', colors='FMP_1', velocity_alpha=False, figsize=(12, 4), ax=None, dpi=72)[source]
+

Plot a pianoroll visualization

+

Notebook: C1/C1S2_CSV.ipynb

+
+
Parameters
+
    +
  • score – List of note events

  • +
  • xlabel – Label for x axis (Default value = ‘Time (seconds)’)

  • +
  • ylabel – Label for y axis (Default value = ‘Pitch’)

  • +
  • colors – Several options: 1. string of FMP_COLORMAPS, 2. string of matplotlib colormap, +3. list or np.ndarray of matplotlib color specifications, +4. dict that assigns labels to colors (Default value = ‘FMP_1’)

  • +
  • velocity_alpha – Use the velocity value for the alpha value of the corresponding rectangle +(Default value = False)

  • +
  • figsize – Width, height in inches (Default value = (12)

  • +
  • ax – The Axes instance to plot on (Default value = None)

  • +
  • dpi – Dots per inch (Default value = 72)

  • +
+
+
Returns
+
    +
  • fig – The created matplotlib figure or None if ax was given.

  • +
  • ax – The used axes

  • +
+
+
+
+ +
+
+libfmp.c1.c1s2_symbolic_rep.xml_to_list(xml)[source]
+

Convert a music xml file to a list of note events

+

Notebook: C1/C1S2_MusicXML.ipynb

+
+
Parameters
+

xml (str or music21.stream.Score) – Either a path to a music xml file or a music21.stream.Score

+
+
Returns
+

score (list) – A list of note events where each note is specified as +[start, duration, pitch, velocity, label]

+
+
+
+ +
+
+libfmp.c1.c1s3_audio_rep.compute_adsr(len_A=10, len_D=10, len_S=60, len_R=10, height_A=1.0, height_S=0.5)[source]
+

Computation of idealized ADSR model

+

Notebook: C1/C1S3_Timbre.ipynb

+
+
Parameters
+
    +
  • len_A (int) – Length (samples) of A phase (Default value = 10)

  • +
  • len_D (int) – Length (samples) of D phase (Default value = 10)

  • +
  • len_S (int) – Length (samples) of S phase (Default value = 60)

  • +
  • len_R (int) – Length (samples) of R phase (Default value = 10)

  • +
  • height_A (float) – Height of A phase (Default value = 1.0)

  • +
  • height_S (float) – Height of S phase (Default value = 0.5)

  • +
+
+
Returns
+

curve_ADSR (np.ndarray) – ADSR model

+
+
+
+ +
+
+libfmp.c1.c1s3_audio_rep.compute_envelope(x, win_len_sec=0.01, Fs=4000)[source]
+

Computation of a signal’s envelopes

+

Notebook: C1/C1S3_Timbre.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Signal (waveform) to be analyzed

  • +
  • win_len_sec (float) – Length (seconds) of the window (Default value = 0.01)

  • +
  • Fs (scalar) – Sampling rate (Default value = 4000)

  • +
+
+
Returns
+
    +
  • env (np.ndarray) – Magnitude envelope

  • +
  • env_upper (np.ndarray) – Upper envelope

  • +
  • env_lower (np.ndarray) – Lower envelope

  • +
+
+
+
+ +
+
+libfmp.c1.c1s3_audio_rep.compute_equal_loudness_contour(freq_min=30, freq_max=15000, num_points=100)[source]
+

Computation of the equal loudness contour

+

Notebook: C1/C1S3_Dynamics.ipynb

+
+
Parameters
+
    +
  • freq_min (float) – Lowest frequency to be evaluated (Default value = 30)

  • +
  • freq_max (float) – Highest frequency to be evaluated (Default value = 15000)

  • +
  • num_points (int) – Number of evaluation points (Default value = 100)

  • +
+
+
Returns
+
    +
  • equal_loudness_contour (np.ndarray) – Equal loudness contour (in dB)

  • +
  • freq_range (np.ndarray) – Evaluated frequency points

  • +
+
+
+
+ +
+
+libfmp.c1.c1s3_audio_rep.compute_plot_envelope(x, win_len_sec, Fs, figsize=(6, 3), title='')[source]
+

Computation and subsequent plotting of a signal’s envelope

+

Notebook: C1/C1S3_Timbre.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Signal (waveform) to be analyzed

  • +
  • win_len_sec (float) – Length (seconds) of the window

  • +
  • Fs (scalar) – Sampling rate

  • +
  • figsize (tuple) – Size of the figure (Default value = (6, 3))

  • +
  • title (str) – Title of the figure (Default value = ‘’)

  • +
+
+
Returns
+

fig (mpl.figure.Figure) – Generated figure

+
+
+
+ +
+
+libfmp.c1.c1s3_audio_rep.compute_power_db(x, Fs, win_len_sec=0.1, power_ref=10 ** - 12)[source]
+

Computation of the signal power in dB

+

Notebook: C1/C1S3_Dynamics.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Signal (waveform) to be analyzed

  • +
  • Fs (scalar) – Sampling rate

  • +
  • win_len_sec (float) – Length (seconds) of the window (Default value = 0.1)

  • +
  • power_ref (float) – Reference power level (0 dB) (Default value = 10**(-12))

  • +
+
+
Returns
+

power_db (np.ndarray) – Signal power in dB

+
+
+
+ +
+
+libfmp.c1.c1s3_audio_rep.difference_cents(freq_1, freq_2)[source]
+

Difference between two frequency values specified in cents

+

Notebook: C1/C1S3_FrequencyPitch.ipynb

+
+
Parameters
+
    +
  • freq_1 (float) – First frequency

  • +
  • freq_2 (float) – Second frequency

  • +
+
+
Returns
+

delta (float) – Difference in cents

+
+
+
+ +
+
+libfmp.c1.c1s3_audio_rep.f_pitch(p)[source]
+

Compute center frequency for (single or array of) MIDI note numbers

+

Notebook: C1/C1S3_FrequencyPitch.ipynb

+
+
Parameters
+

p (float or np.ndarray) – MIDI note numbers

+
+
Returns
+

freq_center (float or np.ndarray) – Center frequency

+
+
+
+ +
+
+libfmp.c1.c1s3_audio_rep.generate_chirp_exp(dur, freq_start, freq_end, Fs=22050)[source]
+

Generation chirp with exponential frequency increase

+

Notebook: C1/C1S3_Dynamics.ipynb

+
+
Parameters
+
    +
  • dur (float) – Length (seconds) of the signal

  • +
  • freq_start (float) – Start frequency of the chirp

  • +
  • freq_end (float) – End frequency of the chirp

  • +
  • Fs (scalar) – Sampling rate (Default value = 22050)

  • +
+
+
Returns
+
    +
  • x (np.ndarray) – Generated chirp signal

  • +
  • t (np.ndarray) – Time axis (in seconds)

  • +
  • freq (np.ndarray) – Instant frequency (in Hz)

  • +
+
+
+
+ +
+
+libfmp.c1.c1s3_audio_rep.generate_chirp_exp_equal_loudness(dur, freq_start, freq_end, Fs=22050)[source]
+

Generation chirp with exponential frequency increase and equal loudness

+

Notebook: C1/C1S3_Dynamics.ipynb

+
+
Parameters
+
    +
  • dur (float) – Length (seconds) of the signal

  • +
  • freq_start (float) – Starting frequency of the chirp

  • +
  • freq_end (float) – End frequency of the chirp

  • +
  • Fs (scalar) – Sampling rate (Default value = 22050)

  • +
+
+
Returns
+
    +
  • x (np.ndarray) – Generated chirp signal

  • +
  • t (np.ndarray) – Time axis (in seconds)

  • +
  • freq (np.ndarray) – Instant frequency (in Hz)

  • +
  • intensity (np.ndarray) – Instant intensity of the signal

  • +
+
+
+
+ +
+
+libfmp.c1.c1s3_audio_rep.generate_sinusoid(dur=5, Fs=1000, amp=1, freq=1, phase=0)[source]
+

Generation of sinusoid

+

Notebook: C1/C1S3_FrequencyPitch.ipynb

+
+
Parameters
+
    +
  • dur (float) – Duration (in seconds) (Default value = 5)

  • +
  • Fs (scalar) – Sampling rate (Default value = 1000)

  • +
  • amp (float) – Amplitude of sinusoid (Default value = 1)

  • +
  • freq (float) – Frequency of sinusoid (Default value = 1)

  • +
  • phase (float) – Phase of sinusoid (Default value = 0)

  • +
+
+
Returns
+
    +
  • x (np.ndarray) – Signal

  • +
  • t (np.ndarray) – Time axis (in seconds)

  • +
+
+
+
+ +
+
+libfmp.c1.c1s3_audio_rep.generate_sinusoid_tremolo(dur=5, Fs=1000, amp=0.5, freq=440, trem_amp=0.1, trem_rate=5)[source]
+

Generation of a sinusoid signal with tremolo

+

Notebook: C1/C1S3_Timbre.ipynb

+
+
Parameters
+
    +
  • dur (float) – Duration (in seconds) (Default value = 5)

  • +
  • Fs (scalar) – Sampling rate (Default value = 1000)

  • +
  • amp (float) – Amplitude of sinusoid (Default value = 0.5)

  • +
  • freq (float) – Frequency (Hz) of sinusoid (Default value = 440)

  • +
  • trem_amp (float) – Amplitude of the amplitude oscillation (Default value = 0.1)

  • +
  • trem_rate (float) – Rate (Hz) of the amplitude oscillation (Default value = 5)

  • +
+
+
Returns
+
    +
  • x (np.ndarray) – Generated signal

  • +
  • t (np.ndarray) – Time axis (in seconds)

  • +
+
+
+
+ +
+
+libfmp.c1.c1s3_audio_rep.generate_sinusoid_vibrato(dur=5, Fs=1000, amp=0.5, freq=440, vib_amp=1, vib_rate=5)[source]
+

Generation of a sinusoid signal with vibrato

+

Notebook: C1/C1S3_Timbre.ipynb

+
+
Parameters
+
    +
  • dur (float) – Duration (in seconds) (Default value = 5)

  • +
  • Fs (scalar) – Sampling rate (Default value = 1000)

  • +
  • amp (float) – Amplitude of sinusoid (Default value = 0.5)

  • +
  • freq (float) – Frequency (Hz) of sinusoid (Default value = 440)

  • +
  • vib_amp (float) – Amplitude (Hz) of the frequency oscillation (Default value = 1)

  • +
  • vib_rate (float) – Rate (Hz) of the frequency oscillation (Default value = 5)

  • +
+
+
Returns
+
    +
  • x (np.ndarray) – Generated signal

  • +
  • t (np.ndarray) – Time axis (in seconds)

  • +
+
+
+
+ +
+
+libfmp.c1.c1s3_audio_rep.generate_tone(p=60, weight_harmonic=np.ones([16, 1]), Fs=11025, dur=2)[source]
+

Generation of a tone with harmonics

+

Notebook: C1/C1S3_Timbre.ipynb

+
+
Parameters
+
    +
  • p (float) – MIDI pitch of the tone (Default value = 60)

  • +
  • weight_harmonic (np.ndarray) – Weights for the different harmonics (Default value = np.ones([16, 1])

  • +
  • Fs (scalar) – Sampling frequency (Default value = 11025)

  • +
  • dur (float) – Duration (seconds) of the signal (Default value = 2)

  • +
+
+
Returns
+
    +
  • x (np.ndarray) – Generated signal

  • +
  • t (np.ndarray) – Time axis (in seconds)

  • +
+
+
+
+ +
+
+libfmp.c1.c1s3_audio_rep.plot_spectrogram(x, Fs=11025, N=4096, H=2048, figsize=(4, 2))[source]
+

Computation and subsequent plotting of the spectrogram of a signal

+

Notebook: C1/C1S3_Timbre.ipynb

+
+
Parameters
+
    +
  • x – Signal (waveform) to be analyzed

  • +
  • Fs – Sampling rate (Default value = 11025)

  • +
  • N – FFT length (Default value = 4096)

  • +
  • H – Hopsize (Default value = 2048)

  • +
  • figsize – Size of the figure (Default value = (4, 2))

  • +
+
+
+
+ +
+ + +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/index_c2.html b/docs/build/html/index_c2.html new file mode 100644 index 0000000..2c881e0 --- /dev/null +++ b/docs/build/html/index_c2.html @@ -0,0 +1,817 @@ + + + + + + + + + + Fourier Analysis of Signals (libfmp.c2) — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Fourier Analysis of Signals (libfmp.c2)
  • + + +
  • + + + View page source + + +
  • + +
+ + +
+
+
+
+ +
+

Fourier Analysis of Signals (libfmp.c2)

+

The FMP notebooks provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL:

+

https://www.audiolabs-erlangen.de/resources/MIR/FMP/C2/C2.html

+
+
+libfmp.c2.c2_complex.generate_figure(figsize=(2, 2), xlim=[0, 1], ylim=[0, 1])[source]
+

Generate figure for plotting complex numbers

+

Notebook: C2/C2_ComplexNumbers.ipynb

+
+
Parameters
+
    +
  • figsize – Figure size (Default value = (2, 2))

  • +
  • xlim – Limits of x-axis (Default value = [0, 1])

  • +
  • ylim – Limits of y-axis (Default value = [0, 1])

  • +
+
+
+
+ +
+
+libfmp.c2.c2_complex.plot_vector(c, color='k', start=0, linestyle='-')[source]
+

Plot arrow corresponding to difference of two complex numbers

+

Notebook: C2/C2_ComplexNumbers.ipynb

+
+
Parameters
+
    +
  • c – Complex number

  • +
  • color – Color of arrow (Default value = ‘k’)

  • +
  • start – Complex number encoding the start position (Default value = 0)

  • +
  • linestyle – Linestyle of arrow (Default value = ‘-‘)

  • +
+
+
Returns
+

arrow (matplotlib.patches.FancyArrow) – Arrow

+
+
+
+ +
+
+libfmp.c2.c2_digitization.decoding_mu_law(v, mu=255.0)[source]
+

mu-law decoding

+

Notebook: C2/C2S2_DigitalSignalQuantization.ipynb

+
+
Parameters
+
    +
  • v (float) – Value between -1 and 1

  • +
  • mu (float) – Dencoding parameter (Default value = 255.0)

  • +
+
+
Returns
+

v_decode (float) – Decoded value

+
+
+
+ +
+
+libfmp.c2.c2_digitization.encoding_mu_law(v, mu=255.0)[source]
+

mu-law encoding

+

Notebook: C2/C2S2_DigitalSignalQuantization.ipynb

+
+
Parameters
+
    +
  • v (float) – Value between -1 and 1

  • +
  • mu (float) – Encoding parameter (Default value = 255.0)

  • +
+
+
Returns
+

v_encode (float) – Encoded value

+
+
+
+ +
+
+libfmp.c2.c2_digitization.generate_function(Fs, dur=1)[source]
+

Generate example function

+

Notebook: C2/C2S2_DigitalSignalSampling.ipynb

+
+
Parameters
+
    +
  • Fs (scalar) – Sampling rate

  • +
  • dur (float) – Duration (in seconds) of signal to be generated (Default value = 1)

  • +
+
+
Returns
+
    +
  • x (np.ndarray) – Signal

  • +
  • t (np.ndarray) – Time axis (in seconds)

  • +
+
+
+
+ +
+
+libfmp.c2.c2_digitization.plot_graph_quant_function(ax, quant_min=- 1.0, quant_max=1.0, quant_level=256, mu=255.0, quant='uniform')[source]
+

Helper function for plotting a graph of quantization function and quantization error

+

Notebook: C2/C2S2_DigitalSignalQuantization.ipynb

+
+
Parameters
+
    +
  • ax (mpl.axes.Axes) – Axis

  • +
  • quant_min (float) – Minimum quantization level (Default value = -1.0)

  • +
  • quant_max (float) – Maximum quantization level (Default value = 1.0)

  • +
  • quant_level (int) – Number of quantization levels (Default value = 256)

  • +
  • mu (float) – Encoding parameter (Default value = 255.0)

  • +
  • quant (str) – Type of quantization (Default value = ‘uniform’)

  • +
+
+
+
+ +
+
+libfmp.c2.c2_digitization.plot_mu_law(mu=255.0, figsize=(8.5, 4))[source]
+

Helper function for plotting a signal and its quantized version

+

Notebook: C2/C2S2_DigitalSignalQuantization.ipynb

+
+
Parameters
+
    +
  • mu (float) – Dencoding parameter (Default value = 255.0)

  • +
  • figsize (tuple) – Figure size (Default value = (8.5, 2))

  • +
+
+
+
+ +
+
+libfmp.c2.c2_digitization.plot_signal_quant(x, t, x_quant, figsize=(8, 2), xlim=None, ylim=None, title='')[source]
+

Helper function for plotting a signal and its quantized version

+

Notebook: C2/C2S2_DigitalSignalQuantization.ipynb

+
+
Parameters
+
    +
  • x – Original Signal

  • +
  • t – Time

  • +
  • x_quant – Quantized signal

  • +
  • figsize – Figure size (Default value = (8, 2))

  • +
  • xlim – Limits for x-axis (Default value = None)

  • +
  • ylim – Limits for y-axis (Default value = None)

  • +
  • title – Title of figure (Default value = ‘’)

  • +
+
+
+
+ +
+
+libfmp.c2.c2_digitization.quantize_nonuniform_mu(x, mu=255.0, quant_level=256)[source]
+

Nonuniform quantization approach using mu-encoding

+

Notebook: C2/C2S2_DigitalSignalQuantization.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Original signal

  • +
  • mu (float) – Encoding parameter (Default value = 255.0)

  • +
  • quant_level (int) – Number of quantization levels (Default value = 256)

  • +
+
+
Returns
+

x_quant (np.ndarray) – Quantized signal

+
+
+
+ +
+
+libfmp.c2.c2_digitization.quantize_uniform(x, quant_min=- 1.0, quant_max=1.0, quant_level=5)[source]
+

Uniform quantization approach

+

Notebook: C2/C2S2_DigitalSignalQuantization.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Original signal

  • +
  • quant_min (float) – Minimum quantization level (Default value = -1.0)

  • +
  • quant_max (float) – Maximum quantization level (Default value = 1.0)

  • +
  • quant_level (int) – Number of quantization levels (Default value = 5)

  • +
+
+
Returns
+

x_quant (np.ndarray) – Quantized signal

+
+
+
+ +
+
+libfmp.c2.c2_digitization.reconstruction_sinc(x, t, t_sinc)[source]
+

Reconstruction from sampled signal using sinc-functions

+

Notebook: C2/C2S2_DigitalSignalSampling.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Sampled signal

  • +
  • t (np.ndarray) – Equidistant discrete time axis (in seconds) of x

  • +
  • t_sinc (np.ndarray) – Equidistant discrete time axis (in seconds) of signal to be reconstructed

  • +
+
+
Returns
+

x_sinc (np.ndarray) – Reconstructed signal having time axis t_sinc

+
+
+
+ +
+
+libfmp.c2.c2_digitization.sampling_equidistant(x_1, t_1, Fs_2, dur=None)[source]
+

Equidistant sampling of interpolated signal

+

Notebook: C2/C2S2_DigitalSignalSampling.ipynb

+
+
Parameters
+
    +
  • x_1 (np.ndarray) – Signal to be interpolated and sampled

  • +
  • t_1 (np.ndarray) – Time axis (in seconds) of x_1

  • +
  • Fs_2 (scalar) – Sampling rate used for equidistant sampling

  • +
  • dur (float) – Duration (in seconds) of sampled signal (Default value = None)

  • +
+
+
Returns
+
    +
  • x (np.ndarray) – Sampled signal

  • +
  • t (np.ndarray) – Time axis (in seconds) of sampled signal

  • +
+
+
+
+ +
+
+libfmp.c2.c2_fourier.dft(x)[source]
+

Compute the disrcete Fourier transfrom (DFT)

+

Notebook: C2/C2_DFT-FFT.ipynb

+
+
Parameters
+

x (np.ndarray) – Signal to be transformed

+
+
Returns
+

X (np.ndarray) – Fourier transform of x

+
+
+
+ +
+
+libfmp.c2.c2_fourier.fft(x)[source]
+

Compute the fast Fourier transform (FFT)

+

Notebook: C2/C2_DFT-FFT.ipynb

+
+
Parameters
+

x (np.ndarray) – Signal to be transformed

+
+
Returns
+

X (np.ndarray) – Fourier transform of x

+
+
+
+ +
+
+libfmp.c2.c2_fourier.generate_matrix_dft(N, K)[source]
+

Generates a DFT (discrete Fourier transfrom) matrix

+

Notebook: C2/C2_DFT-FFT.ipynb

+
+
Parameters
+
    +
  • N (int) – Number of samples

  • +
  • K (int) – Number of frequency bins

  • +
+
+
Returns
+

dft (np.ndarray) – The DFT matrix

+
+
+
+ +
+
+libfmp.c2.c2_fourier.generate_matrix_dft_inv(N, K)[source]
+

Generates an IDFT (inverse discrete Fourier transfrom) matrix

+

Notebook: C2/C2_STFT-Inverse.ipynb

+
+
Parameters
+
    +
  • N (int) – Number of samples

  • +
  • K (int) – Number of frequency bins

  • +
+
+
Returns
+

dft (np.ndarray) – The IDFT matrix

+
+
+
+ +
+
+libfmp.c2.c2_fourier.idft(X)[source]
+

Compute the inverse discrete Fourier transfrom (IDFT)

+
+
Parameters
+

X (np.ndarray) – Signal to be transformed

+
+
Returns
+

x (np.ndarray) – Inverse Fourier transform of X

+
+
+
+ +
+
+libfmp.c2.c2_fourier.ifft(X)[source]
+

Compute the inverse fast Fourier transform (IFFT)

+
+
Parameters
+

X (np.ndarray) – Fourier transform of x

+
+
Returns
+

x (np.ndarray) – Inverse Fourier transform of X

+
+
+
+ +
+
+libfmp.c2.c2_fourier.ifft_noscale(X)[source]
+

Compute the inverse fast Fourier transform (IFFT) without the final scaling factor of 1/N

+
+
Parameters
+

X (np.ndarray) – Fourier transform of x

+
+
Returns
+

x (np.ndarray) – Inverse Fourier transform of X

+
+
+
+ +
+
+libfmp.c2.c2_fourier.istft(X, w, H, L, zero_padding=0)[source]
+

Compute the inverse discrete short-time Fourier transform (ISTFT)

+
+
Parameters
+
    +
  • X (np.ndarray) – The discrete short-time Fourier transform

  • +
  • w (np.ndarray) – Window function

  • +
  • H (int) – Hopsize

  • +
  • L (int) – Length of time signal

  • +
  • zero_padding (bool) – Number of zeros to be padded after windowing and before the Fourier transform of a frame +(Default value = 0)

  • +
+
+
Returns
+

x (np.ndarray) – Reconstructed time signal

+
+
+
+ +
+
+libfmp.c2.c2_fourier.istft_basic(X, w, H, L)[source]
+

Compute the inverse of the basic discrete short-time Fourier transform (ISTFT)

+

Notebook: C2/C2_STFT-Inverse.ipynb

+
+
Parameters
+
    +
  • X (np.ndarray) – The discrete short-time Fourier transform

  • +
  • w (np.ndarray) – Window function

  • +
  • H (int) – Hopsize

  • +
  • L (int) – Length of time signal

  • +
+
+
Returns
+

x (np.ndarray) – Time signal

+
+
+
+ +
+
+libfmp.c2.c2_fourier.stft(x, w, H=512, zero_padding=0, only_positive_frequencies=False)[source]
+

Compute the discrete short-time Fourier transform (STFT)

+
+
Parameters
+
    +
  • x (np.ndarray) – Signal to be transformed

  • +
  • w (np.ndarray) – Window function

  • +
  • H (int) – Hopsize (Default value = 512)

  • +
  • zero_padding (bool) – Number of zeros to be padded after windowing and before the Fourier transform of a frame +(Note: The purpose of this step is to increase the frequency sampling.) (Default value = 0)

  • +
  • only_positive_frequencies (bool) – Return only positive frequency part of spectrum (non-invertible) +(Default value = False)

  • +
+
+
Returns
+

X (np.ndarray) – The discrete short-time Fourier transform

+
+
+
+ +
+
+libfmp.c2.c2_fourier.stft_basic(x, w, H=8, only_positive_frequencies=False)[source]
+

Compute a basic version of the discrete short-time Fourier transform (STFT)

+

Notebook: C2/C2_STFT-Basic.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Signal to be transformed

  • +
  • w (np.ndarray) – Window function

  • +
  • H (int) – Hopsize (Default value = 8)

  • +
  • only_positive_frequencies (bool) – Return only positive frequency part of spectrum (non-invertible) +(Default value = False)

  • +
+
+
Returns
+

X (np.ndarray) – The discrete short-time Fourier transform

+
+
+
+ +
+
+libfmp.c2.c2_fourier.stft_convention_fmp(x, Fs, N, H, pad_mode='constant', center=True, mag=False, gamma=0)[source]
+

Compute the discrete short-time Fourier transform (STFT)

+

Notebook: C2/C2_STFT-FreqGridInterpol.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Signal to be transformed

  • +
  • Fs (scalar) – Sampling rate

  • +
  • N (int) – Window size

  • +
  • H (int) – Hopsize

  • +
  • pad_mode (str) – Padding strategy is used in librosa (Default value = ‘constant’)

  • +
  • center (bool) – Centric view as used in librosa (Default value = True)

  • +
  • mag (bool) – Computes magnitude STFT if mag==True (Default value = False)

  • +
  • gamma (float) – Constant for logarithmic compression (only applied when mag==True) (Default value = 0)

  • +
+
+
Returns
+

X (np.ndarray) – Discrete (magnitude) short-time Fourier transform

+
+
+
+ +
+
+libfmp.c2.c2_fourier.twiddle(N)[source]
+

Generate the twiddle factors used in the computation of the fast Fourier transform (FFT)

+

Notebook: C2/C2_DFT-FFT.ipynb

+
+
Parameters
+

N (int) – Number of samples

+
+
Returns
+

sigma (np.ndarray) – The twiddle factors

+
+
+
+ +
+
+libfmp.c2.c2_fourier.twiddle_inv(N)[source]
+

Generate the twiddle factors used in the computation of the Inverse fast Fourier transform (IFFT)

+
+
Parameters
+

N (int) – Number of samples

+
+
Returns
+

sigma (np.ndarray) – The twiddle factors

+
+
+
+ +
+
+libfmp.c2.c2_interference.generate_chirp_linear(dur, freq_start, freq_end, amp=1.0, Fs=22050)[source]
+

Generation chirp with linear frequency increase

+

Notebook: C2/C2S3_InterferenceBeating.ipynb

+
+
Parameters
+
    +
  • dur (float) – Duration (seconds) of the signal

  • +
  • freq_start (float) – Start frequency of the chirp

  • +
  • freq_end (float) – End frequency of the chirp

  • +
  • amp (float) – Amplitude of chirp (Default value = 1.0)

  • +
  • Fs (scalar) – Sampling rate (Default value = 22050)

  • +
+
+
Returns
+
    +
  • x (np.ndarray) – Generated chirp signal

  • +
  • t (np.ndarray) – Time axis (in seconds)

  • +
  • freq (np.ndarray) – Instant frequency (in Hz)

  • +
+
+
+
+ +
+
+libfmp.c2.c2_interference.plot_interference(x1, x2, t, figsize=(8, 2), xlim=None, ylim=None, title='')[source]
+

Helper function for plotting two signals and its superposition

+

Notebook: C2/C2S3_InterferenceBeating.ipynb

+
+
Parameters
+
    +
  • x1 – Signal 1

  • +
  • x2 – Signal 2

  • +
  • t – Time

  • +
  • figsize – figure size (Default value = (8, 2))

  • +
  • xlim – x limits (Default value = None)

  • +
  • ylim – y limits (Default value = None)

  • +
  • title – figure title (Default value = ‘’)

  • +
+
+
+
+ +
+
+libfmp.c2.c2_interpolation.compute_f_coef_linear(N, Fs, rho=1)[source]
+

Refines the frequency vector by factor of rho

+

Notebook: C2/C2_STFT-FreqGridInterpol.ipynb

+
+
Parameters
+
    +
  • N (int) – Window size

  • +
  • Fs (scalar) – Sampling rate

  • +
  • rho (int) – Factor for refinement (Default value = 1)

  • +
+
+
Returns
+

F_coef_new (np.ndarray) – Refined frequency vector

+
+
+
+ +
+
+libfmp.c2.c2_interpolation.compute_f_coef_log(R, F_min, F_max)[source]
+

Adapts the frequency vector in a logarithmic fashion

+

Notebook: C2/C2_STFT-FreqGridInterpol.ipynb

+
+
Parameters
+
    +
  • R (scalar) – Resolution (cents)

  • +
  • F_min (float) – Minimum frequency

  • +
  • F_max (float) – Maximum frequency (not included)

  • +
+
+
Returns
+
    +
  • F_coef_log (np.ndarray) – Refined frequency vector with values given in Hz)

  • +
  • F_coef_cents (np.ndarray) – Refined frequency vector with values given in cents. +Note: F_min serves as reference (0 cents)

  • +
+
+
+
+ +
+
+libfmp.c2.c2_interpolation.interpolate_freq_stft(Y, F_coef, F_coef_new)[source]
+

Interpolation of STFT along frequency axis

+

Notebook: C2/C2_STFT-FreqGridInterpol.ipynb

+
+
Parameters
+
    +
  • Y (np.ndarray) – Magnitude STFT

  • +
  • F_coef (np.ndarray) – Vector of frequency values

  • +
  • F_coef_new (np.ndarray) – Vector of new frequency values

  • +
+
+
Returns
+

Y_interpol (np.ndarray) – Interploated magnitude STFT

+
+
+
+ +
+ + +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/index_c3.html b/docs/build/html/index_c3.html new file mode 100644 index 0000000..8b1792e --- /dev/null +++ b/docs/build/html/index_c3.html @@ -0,0 +1,786 @@ + + + + + + + + + + Music Synchronization (libfmp.c3) — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Music Synchronization (libfmp.c3)
  • + + +
  • + + + View page source + + +
  • + +
+ + +
+
+
+
+ +
+

Music Synchronization (libfmp.c3)

+

The FMP notebooks provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL:

+

https://www.audiolabs-erlangen.de/resources/MIR/FMP/C3/C3.html

+
+
+libfmp.c3.c3s1_audio_feature.compute_chromagram(Y_LF)[source]
+

Computes a chromagram

+

Notebook: C3/C3S1_SpecLogFreq-Chromagram.ipynb

+
+
Parameters
+

Y_LF (np.ndarray) – Log-frequency spectrogram

+
+
Returns
+

C (np.ndarray) – Chromagram

+
+
+
+ +
+
+libfmp.c3.c3s1_audio_feature.compute_spec_log_freq(Y, Fs, N)[source]
+

Computes a log-frequency spectrogram

+

Notebook: C3/C3S1_SpecLogFreq-Chromagram.ipynb

+
+
Parameters
+
    +
  • Y (np.ndarray) – Magnitude or power spectrogram

  • +
  • Fs (scalar) – Sampling rate

  • +
  • N (int) – Window size of Fourier fransform

  • +
+
+
Returns
+
    +
  • Y_LF (np.ndarray) – Log-frequency spectrogram

  • +
  • F_coef_pitch (np.ndarray) – Pitch values

  • +
+
+
+
+ +
+
+libfmp.c3.c3s1_audio_feature.f_pitch(p, pitch_ref=69, freq_ref=440.0)[source]
+

Computes the center frequency/ies of a MIDI pitch

+

Notebook: C3/C3S1_SpecLogFreq-Chromagram.ipynb

+
+
Parameters
+
    +
  • p (float) – MIDI pitch value(s)

  • +
  • pitch_ref (float) – Reference pitch (default: 69)

  • +
  • freq_ref (float) – Frequency of reference pitch (default: 440.0)

  • +
+
+
Returns
+

freqs (float) – Frequency value(s)

+
+
+
+ +
+
+libfmp.c3.c3s1_audio_feature.note_name(p)[source]
+

Returns note name of pitch

+

Notebook: C3/C3S1_SpecLogFreq-Chromagram.ipynb

+
+
Parameters
+

p (int) – Pitch value

+
+
Returns
+

name (str) – Note name

+
+
+
+ +
+
+libfmp.c3.c3s1_audio_feature.pool_pitch(p, Fs, N, pitch_ref=69, freq_ref=440.0)[source]
+

Computes the set of frequency indices that are assigned to a given pitch

+

Notebook: C3/C3S1_SpecLogFreq-Chromagram.ipynb

+
+
Parameters
+
    +
  • p (float) – MIDI pitch value

  • +
  • Fs (scalar) – Sampling rate

  • +
  • N (int) – Window size of Fourier fransform

  • +
  • pitch_ref (float) – Reference pitch (default: 69)

  • +
  • freq_ref (float) – Frequency of reference pitch (default: 440.0)

  • +
+
+
Returns
+

k (np.ndarray) – Set of frequency indices

+
+
+
+ +
+
+libfmp.c3.c3s1_post_processing.log_compression(v, gamma=1.0)[source]
+

Logarithmically compresses a value or array

+

Notebook: C3/C3S1_LogCompression.ipynb

+
+
Parameters
+
    +
  • v (float or np.ndarray) – Value or array

  • +
  • gamma (float) – Compression factor (Default value = 1.0)

  • +
+
+
Returns
+

v_compressed (float or np.ndarray) – Compressed value or array

+
+
+
+ +
+
+libfmp.c3.c3s1_post_processing.median_downsample_feature_sequence(X, Fs, filt_len=41, down_sampling=10)[source]
+

Smoothes and downsamples a feature sequence. Smoothing is achieved by median filtering

+

Notebook: C3/C3S1_FeatureSmoothing.ipynb

+
+
Parameters
+
    +
  • X (np.ndarray) – Feature sequence

  • +
  • Fs (scalar) – Frame rate of X

  • +
  • filt_len (int) – Length of smoothing filter (Default value = 41)

  • +
  • down_sampling (int) – Downsampling factor (Default value = 10)

  • +
+
+
Returns
+
    +
  • X_smooth (np.ndarray) – Smoothed and downsampled feature sequence

  • +
  • Fs_feature (scalar) – Frame rate of X_smooth

  • +
+
+
+
+ +
+
+libfmp.c3.c3s1_post_processing.normalize_feature_sequence(X, norm='2', threshold=0.0001, v=None)[source]
+

Normalizes the columns of a feature sequence

+

Notebook: C3/C3S1_FeatureNormalization.ipynb

+
+
Parameters
+
    +
  • X (np.ndarray) – Feature sequence

  • +
  • norm (str) – The norm to be applied. ‘1’, ‘2’, ‘max’ or ‘z’ (Default value = ‘2’)

  • +
  • threshold (float) – An threshold below which the vector v used instead of normalization +(Default value = 0.0001)

  • +
  • v (float) – Used instead of normalization below threshold. If None, uses unit vector for given norm +(Default value = None)

  • +
+
+
Returns
+

X_norm (np.ndarray) – Normalized feature sequence

+
+
+
+ +
+
+libfmp.c3.c3s1_post_processing.smooth_downsample_feature_sequence(X, Fs, filt_len=41, down_sampling=10, w_type='boxcar')[source]
+

Smoothes and downsamples a feature sequence. Smoothing is achieved by convolution with a filter kernel

+

Notebook: C3/C3S1_FeatureSmoothing.ipynb

+
+
Parameters
+
    +
  • X (np.ndarray) – Feature sequence

  • +
  • Fs (scalar) – Frame rate of X

  • +
  • filt_len (int) – Length of smoothing filter (Default value = 41)

  • +
  • down_sampling (int) – Downsampling factor (Default value = 10)

  • +
  • w_type (str) – Window type of smoothing filter (Default value = ‘boxcar’)

  • +
+
+
Returns
+
    +
  • X_smooth (np.ndarray) – Smoothed and downsampled feature sequence

  • +
  • Fs_feature (scalar) – Frame rate of X_smooth

  • +
+
+
+
+ +
+
+libfmp.c3.c3s1_transposition_tuning.compute_freq_distribution(x, Fs, N=16384, gamma=100.0, local=True, filt=True, filt_len=101)[source]
+

Compute an overall frequency distribution

+

Notebook: C3/C3S1_TranspositionTuning.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Signal

  • +
  • Fs (scalar) – Sampling rate

  • +
  • N (int) – Window size (Default value = 16384)

  • +
  • gamma (float) – Constant for logarithmic compression (Default value = 100.0)

  • +
  • local (bool) – Computes STFT and averages; otherwise computes global DFT (Default value = True)

  • +
  • filt (bool) – Applies local frequency averaging and by rectification (Default value = True)

  • +
  • filt_len (int) – Filter length for local frequency averaging (length given in cents) (Default value = 101)

  • +
+
+
Returns
+
    +
  • v (np.ndarray) – Vector representing an overall frequency distribution

  • +
  • F_coef_cents (np.ndarray) – Frequency axis (given in cents)

  • +
+
+
+
+ +
+
+libfmp.c3.c3s1_transposition_tuning.cyclic_shift(C, shift=1)[source]
+

Cyclically shift a chromagram

+

Notebook: C3/C3S1_TranspositionTuning.ipynb

+
+
Parameters
+
    +
  • C (np.ndarray) – Chromagram

  • +
  • shift (int) – Tranposition shift (Default value = 1)

  • +
+
+
Returns
+

C_shift (np.ndarray) – Cyclically shifted chromagram

+
+
+
+ +
+
+libfmp.c3.c3s1_transposition_tuning.plot_freq_vector_template(v, F_coef_cents, template_max, theta_max, ax=None, title=None, figsize=(8, 3))[source]
+

Plots frequency distribution and similarity-maximizing template

+

Notebook: C3/C3S1_TranspositionTuning.ipynb

+
+
Parameters
+
    +
  • v – Vector representing an overall frequency distribution

  • +
  • F_coef_cents – Frequency axis

  • +
  • template_max – Similarity-maximizing template

  • +
  • theta_max – Maximizing tuning parameter

  • +
  • ax – Axis (in case of ax=None, figure is generated) (Default value = None)

  • +
  • title – Title of figure (or subplot) (Default value = None)

  • +
  • figsize – Size of figure (only used when ax=None) (Default value = (8, 3))

  • +
+
+
Returns
+
    +
  • fig – Handle for figure

  • +
  • ax – Handle for axes

  • +
  • line – handle for line plot

  • +
+
+
+
+ +
+
+libfmp.c3.c3s1_transposition_tuning.plot_tuning_similarity(sim, theta_axis, theta_max, ax=None, title=None, figsize=(4, 3))[source]
+

Plots tuning similarity

+

Notebook: C3/C3S1_TranspositionTuning.ipynb

+
+
Parameters
+
    +
  • sim – Similarity values

  • +
  • theta_axis – Axis consisting of cent values [-50:49]

  • +
  • theta_max – Maximizing tuning parameter

  • +
  • ax – Axis (in case of ax=None, figure is generated) (Default value = None)

  • +
  • title – Title of figure (or subplot) (Default value = None)

  • +
  • figsize – Size of figure (only used when ax=None) (Default value = (4, 3))

  • +
+
+
Returns
+
    +
  • fig – Handle for figure

  • +
  • ax – Handle for axes

  • +
  • line – handle for line plot

  • +
+
+
+
+ +
+
+libfmp.c3.c3s1_transposition_tuning.template_comb(M, theta=0)[source]
+

Compute a comb template on a pitch axis

+

Notebook: C3/C3S1_TranspositionTuning.ipynb

+
+
Parameters
+
    +
  • M (int) – Length template (given in cents)

  • +
  • theta (int) – Shift parameter (given in cents); -50 <= theta < 50 (Default value = 0)

  • +
+
+
Returns
+

template (np.ndarray) – Comb template shifted by theta

+
+
+
+ +
+
+libfmp.c3.c3s1_transposition_tuning.tuning_similarity(v)[source]
+

Compute tuning similarity

+

Notebook: C3/C3S1_TranspositionTuning.ipynb

+
+
Parameters
+

v (np.ndarray) – Vector representing an overall frequency distribution

+
+
Returns
+
    +
  • theta_axis (np.ndarray) – Axis consisting of all tuning parameters -50 <= theta < 50

  • +
  • sim (np.ndarray) – Similarity values for all tuning parameters

  • +
  • ind_max (int) – Maximizing index

  • +
  • theta_max (int) – Maximizing tuning parameter

  • +
  • template_max (np.ndarray) – Similiarty-maximizing comb template

  • +
+
+
+
+ +
+
+libfmp.c3.c3s2_dtw.compute_accumulated_cost_matrix(C)[source]
+

Compute the accumulated cost matrix given the cost matrix

+

Notebook: C3/C3S2_DTWbasic.ipynb

+
+
Parameters
+

C (np.ndarray) – Cost matrix

+
+
Returns
+

D (np.ndarray) – Accumulated cost matrix

+
+
+
+ +
+
+libfmp.c3.c3s2_dtw.compute_accumulated_cost_matrix_21(C)[source]
+

Compute the accumulated cost matrix given the cost matrix

+

Notebook: C3/C3S2_DTWvariants.ipynb

+
+
Parameters
+

C (np.ndarray) – Cost matrix

+
+
Returns
+

D (np.ndarray) – Accumulated cost matrix

+
+
+
+ +
+
+libfmp.c3.c3s2_dtw.compute_cost_matrix(X, Y, metric='euclidean')[source]
+

Compute the cost matrix of two feature sequences

+

Notebook: C3/C3S2_DTWbasic.ipynb

+
+
Parameters
+
    +
  • X (np.ndarray) – Sequence 1

  • +
  • Y (np.ndarray) – Sequence 2

  • +
  • metric (str) – Cost metric, a valid strings for scipy.spatial.distance.cdist (Default value = ‘euclidean’)

  • +
+
+
Returns
+

C (np.ndarray) – Cost matrix

+
+
+
+ +
+
+libfmp.c3.c3s2_dtw.compute_optimal_warping_path(D)[source]
+

Compute the warping path given an accumulated cost matrix

+

Notebook: C3/C3S2_DTWbasic.ipynb

+
+
Parameters
+

D (np.ndarray) – Accumulated cost matrix

+
+
Returns
+

P (np.ndarray) – Optimal warping path

+
+
+
+ +
+
+libfmp.c3.c3s2_dtw.compute_optimal_warping_path_21(D)[source]
+

Compute the warping path given an accumulated cost matrix

+

Notebook: C3/C3S2_DTWvariants.ipynb

+
+
Parameters
+

D (np.ndarray) – Accumulated cost matrix

+
+
Returns
+

P (np.ndarray) – Optimal warping path

+
+
+
+ +
+
+libfmp.c3.c3s2_dtw_plot.plot_matrix_with_points(C, P=np.empty((0, 2)), color='r', marker='o', linestyle='', **kwargs)[source]
+

Compute the cost matrix of two feature sequences

+
+
Parameters
+
+
+
Returns
+
    +
  • fig – Handle for figure

  • +
  • im – Handle for imshow

  • +
  • line – handle for line plot

  • +
+
+
+
+ +
+
+libfmp.c3.c3s3_tempo_curve.compute_score_chromagram(score, Fs_beat)[source]
+

Compute chromagram from score representation

+

Notebook: C3/C3S3_MusicAppTempoCurve.ipynb

+
+
Parameters
+
    +
  • score (list) – Score representation

  • +
  • Fs_beat (scalar) – Sampling rate for beat axis

  • +
+
+
Returns
+
    +
  • X_score (np.ndarray) – Chromagram representation X_score

  • +
  • t_beat (np.ndarray) – Time axis t_beat (given in beats)

  • +
+
+
+
+ +
+
+libfmp.c3.c3s3_tempo_curve.compute_strict_alignment_path(P)[source]
+

Compute strict alignment path from a warping path

+

Notebook: C3/C3S3_MusicAppTempoCurve.ipynb

+
+
Parameters
+

P (list or np.ndarray) – Warping path

+
+
Returns
+

P_mod (list or np.ndarray) – Strict alignment path

+
+
+
+ +
+
+libfmp.c3.c3s3_tempo_curve.compute_strict_alignment_path_mask(P)[source]
+

Compute strict alignment path from a warping path

+

Notebook: C3/C3S3_MusicAppTempoCurve.ipynb

+
+
Parameters
+

P (list or np.ndarray) – Wapring path

+
+
Returns
+

P_mod (list or np.ndarray) – Strict alignment path

+
+
+
+ +
+
+libfmp.c3.c3s3_tempo_curve.compute_tempo_curve(score, x, Fs=22050, Fs_beat=10, N=4410, H=2205, shift=0, sigma=np.array([[1, 0], [0, 1], [2, 1], [1, 2], [1, 1]]), win_len_beat=4)[source]
+

Compute a tempo curve

+

Notebook: C3/C3S3_MusicAppTempoCurve.ipynb

+
+
Parameters
+
    +
  • score (list) – Score representation

  • +
  • x (np.ndarray) – Audio signal

  • +
  • Fs (scalar) – Samping rate of audio signal (Default value = 22050)

  • +
  • Fs_beat (scalar) – Sampling rate for beat axis (Default value = 10)

  • +
  • N (int) – Window size for computing audio chromagram (Default value = 4410)

  • +
  • H (int) – Hope size for computing audio chromagram (Default value = 2205)

  • +
  • shift (int) – Cyclic chroma shift applied to audio chromagram (Default value = 0)

  • +
  • sigma (np.ndarray) – Step size set used for DTW +(Default value = np.array([[1, 0], [0, 1], [2, 1], [1, 2], [1, 1]]))

  • +
  • win_len_beat (float) – Window length (given in beats) used for smoothing tempo curve (Default value = 4)

  • +
+
+
Returns
+
    +
  • f_tempo (np.ndarray) – Tempo curve

  • +
  • t_beat (np.ndarray) – Time axis (given in beats)

  • +
+
+
+
+ +
+
+libfmp.c3.c3s3_tempo_curve.plot_measure(ax, measure_pos)[source]
+

Plot measure positions

+

Notebook: C3/C3S3_MusicAppTempoCurve.ipynb

+
+
Parameters
+
    +
  • ax (mpl.axes.Axes) – Figure axis

  • +
  • measure_pos (list or np.ndarray) – Array containing measure positions

  • +
+
+
+
+ +
+
+libfmp.c3.c3s3_tempo_curve.plot_tempo_curve(f_tempo, t_beat, ax=None, figsize=(8, 2), color='k', logscale=False, xlabel='Time (beats)', ylabel='Temp (BPM)', xlim=None, ylim=None, label='', measure_pos=[])[source]
+

Plot a tempo curve

+

Notebook: C3/C3S3_MusicAppTempoCurve.ipynb

+
+
Parameters
+
    +
  • f_tempo – Tempo curve

  • +
  • t_beat – Time axis of tempo curve (given as sampled beat axis)

  • +
  • ax – Plot either as figure (ax==None) or into axis (ax==True) (Default value = None)

  • +
  • figsize – Size of figure (Default value = (8, 2))

  • +
  • color – Color of tempo curve (Default value = ‘k’)

  • +
  • logscale – Use linear (logscale==False) or logartihmic (logscale==True) tempo axis (Default value = False)

  • +
  • xlabel – Label for x-axis (Default value = ‘Time (beats)’)

  • +
  • ylabel – Label for y-axis (Default value = ‘Temp (BPM)’)

  • +
  • xlim – Limits for x-axis (Default value = None)

  • +
  • ylim – Limits for x-axis (Default value = None)

  • +
  • label – Figure labels when plotting into axis (ax==True) (Default value = ‘’)

  • +
  • measure_pos – Plot measure positions as spefified (Default value = [])

  • +
+
+
Returns
+
    +
  • fig – figure handle

  • +
  • ax – axes handle

  • +
+
+
+
+ +
+ + +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/index_c4.html b/docs/build/html/index_c4.html new file mode 100644 index 0000000..f8f893e --- /dev/null +++ b/docs/build/html/index_c4.html @@ -0,0 +1,1266 @@ + + + + + + + + + + Music Structure Analysis (libfmp.c4) — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Music Structure Analysis (libfmp.c4)
  • + + +
  • + + + View page source + + +
  • + +
+ + +
+
+
+
+ +
+

Music Structure Analysis (libfmp.c4)

+

The FMP notebooks provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL:

+

https://www.audiolabs-erlangen.de/resources/MIR/FMP/C4/C4.html

+
+
+libfmp.c4.c4s1_annotation.convert_structure_annotation(ann, Fs=1, remove_digits=False, index=False)[source]
+

Convert structure annotations

+

Notebook: C4/C4S1_MusicStructureGeneral.ipynb

+
+
Parameters
+
    +
  • ann (list) – Structure annotions

  • +
  • Fs (scalar) – Sampling rate (Default value = 1)

  • +
  • remove_digits (bool) – Remove digits from labels (Default value = False)

  • +
  • index (bool) – Round to nearest integer (Default value = False)

  • +
+
+
Returns
+

ann_converted (list) – Converted annotation

+
+
+
+ +
+
+libfmp.c4.c4s1_annotation.get_color_for_annotation_file(filename)[source]
+

Gets color dict for annotation file

+
+
Parameters
+

filename (str) – Annotation file

+
+
Returns
+

color_ann (dict) – Dictionary encoding color scheme

+
+
+
+ +
+
+libfmp.c4.c4s1_annotation.read_structure_annotation(fn_ann, fn_ann_color='', Fs=1, remove_digits=False, index=False)[source]
+

Read and convert structure annotation and colors

+

Notebook: C4/C4S1_MusicStructureGeneral.ipynb

+
+
Parameters
+
    +
  • fn_ann (str) – Path and filename for structure annotions

  • +
  • fn_ann_color (str) – Filename used to identify colors (Default value = ‘’)

  • +
  • Fs (scalar) – Sampling rate (Default value = 1)

  • +
  • remove_digits (bool) – Remove digits from labels (Default value = False)

  • +
  • index (bool) – Round to nearest integer (Default value = False)

  • +
+
+
Returns
+
    +
  • ann (list) – Annotations

  • +
  • color_ann (dict) – Color scheme

  • +
+
+
+
+ +
+
+libfmp.c4.c4s2_ssm.compute_sm_dot(X, Y)[source]
+

Computes similarty matrix from feature sequences using dot (inner) product

+

Notebook: C4/C4S2_SSM.ipynb

+
+
Parameters
+
    +
  • X (np.ndarray) – First sequence

  • +
  • Y (np.ndarray) – Second Sequence

  • +
+
+
Returns
+

S (float) – Dot product

+
+
+
+ +
+
+libfmp.c4.c4s2_ssm.compute_sm_from_filename(fn_wav, L=21, H=5, L_smooth=16, tempo_rel_set=np.array([1]), shift_set=np.array([0]), strategy='relative', scale=True, thresh=0.15, penalty=0.0, binarize=False)[source]
+

Compute an SSM

+

Notebook: C4/C4S2_SSM-Thresholding.ipynb

+
+
Parameters
+
    +
  • fn_wav (str) – Path and filename of wav file

  • +
  • L (int) – Length of smoothing filter (Default value = 21)

  • +
  • H (int) – Downsampling factor (Default value = 5)

  • +
  • L_smooth (int) – Length of filter (Default value = 16)

  • +
  • tempo_rel_set (np.ndarray) – Set of relative tempo values (Default value = np.array([1]))

  • +
  • shift_set (np.ndarray) – Set of shift indices (Default value = np.array([0]))

  • +
  • strategy (str) – Thresholding strategy (see libfmp.c4.c4s2_ssm.compute_sm_ti()) +(Default value = ‘relative’)

  • +
  • scale (bool) – If scale=True, then scaling of positive values to range [0,1] (Default value = True)

  • +
  • thresh (float) – Treshold (meaning depends on strategy) (Default value = 0.15)

  • +
  • penalty (float) – Set values below treshold to value specified (Default value = 0.0)

  • +
  • binarize (bool) – Binarizes final matrix (positive: 1; otherwise: 0) (Default value = False)

  • +
+
+
Returns
+
    +
  • x (np.ndarray) – Audio signal

  • +
  • x_duration (float) – Duration of audio signal (seconds)

  • +
  • X (np.ndarray) – Feature sequence

  • +
  • Fs_feature (scalar) – Feature rate

  • +
  • S_thresh (np.ndarray) – SSM

  • +
  • I (np.ndarray) – Index matrix

  • +
+
+
+
+ +
+
+libfmp.c4.c4s2_ssm.compute_sm_ti(X, Y, L=1, tempo_rel_set=np.asarray([1]), shift_set=np.asarray([0]), direction=2)[source]
+

Compute enhanced similaity matrix by applying path smoothing and transpositions

+

Notebook: C4/C4S2_SSM-TranspositionInvariance.ipynb

+
+
Parameters
+
    +
  • X (np.ndarray) – First feature sequence

  • +
  • Y (np.ndarray) – Second feature sequence

  • +
  • L (int) – Length of filter (Default value = 1)

  • +
  • tempo_rel_set (np.ndarray) – Set of relative tempo values (Default value = np.asarray([1]))

  • +
  • shift_set (np.ndarray) – Set of shift indices (Default value = np.asarray([0]))

  • +
  • direction (int) – Direction of smoothing (0: forward; 1: backward; 2: both directions) (Default value = 2)

  • +
+
+
Returns
+
    +
  • S_TI (np.ndarray) – Transposition-invariant SM

  • +
  • I_TI (np.ndarray) – Transposition index matrix

  • +
+
+
+
+ +
+
+libfmp.c4.c4s2_ssm.compute_tempo_rel_set(tempo_rel_min, tempo_rel_max, num)[source]
+

Compute logarithmically spaced relative tempo values

+

Notebook: C4/C4S2_SSM-PathEnhancement.ipynb

+
+
Parameters
+
    +
  • tempo_rel_min (float) – Minimum relative tempo

  • +
  • tempo_rel_max (float) – Maximum relative tempo

  • +
  • num (int) – Number of relative tempo values (inlcuding the min and max)

  • +
+
+
Returns
+

tempo_rel_set (np.ndarray) – Set of relative tempo values

+
+
+
+ +
+
+libfmp.c4.c4s2_ssm.filter_diag_mult_sm(S, L=1, tempo_rel_set=np.asarray([1]), direction=0)[source]
+

Path smoothing of similarity matrix by filtering in forward or backward direction +along various directions around main diagonal. +Note: Directions are simulated by resampling one axis using relative tempo values

+

Notebook: C4/C4S2_SSM-PathEnhancement.ipynb

+
+
Parameters
+
    +
  • S (np.ndarray) – Self-similarity matrix (SSM)

  • +
  • L (int) – Length of filter (Default value = 1)

  • +
  • tempo_rel_set (np.ndarray) – Set of relative tempo values (Default value = np.asarray([1]))

  • +
  • direction (int) – Direction of smoothing (0: forward; 1: backward) (Default value = 0)

  • +
+
+
Returns
+

S_L_final (np.ndarray) – Smoothed SM

+
+
+
+ +
+
+libfmp.c4.c4s2_ssm.filter_diag_sm(S, L)[source]
+

Path smoothing of similarity matrix by forward filtering along main diagonal

+

Notebook: C4/C4S2_SSM-PathEnhancement.ipynb

+
+
Parameters
+
    +
  • S (np.ndarray) – Similarity matrix (SM)

  • +
  • L (int) – Length of filter

  • +
+
+
Returns
+

S_L (np.ndarray) – Smoothed SM

+
+
+
+ +
+
+libfmp.c4.c4s2_ssm.plot_feature_ssm(X, Fs_X, S, Fs_S, ann, duration, color_ann=None, title='', label='Time (seconds)', time=True, figsize=(5, 6), fontsize=10, clim_X=None, clim=None)[source]
+

Plot SSM along with feature representation and annotations (standard setting is time in seconds)

+

Notebook: C4/C4S2_SSM.ipynb

+
+
Parameters
+
    +
  • X – Feature representation

  • +
  • Fs_X – Feature rate of X

  • +
  • S – Similarity matrix (SM)

  • +
  • Fs_S – Feature rate of S

  • +
  • ann – Annotaions

  • +
  • duration – Duration

  • +
  • color_ann – Color annotations (see libfmp.b.b_plot.plot_segments()) (Default value = None)

  • +
  • title – Figure title (Default value = ‘’)

  • +
  • label – Label for time axes (Default value = ‘Time (seconds)’)

  • +
  • time – Display time axis ticks or not (Default value = True)

  • +
  • figsize – Figure size (Default value = (5, 6))

  • +
  • fontsize – Font size (Default value = 10)

  • +
  • clim_X – Color limits for matrix X (Default value = None)

  • +
  • clim – Color limits for matrix S (Default value = None)

  • +
+
+
Returns
+
    +
  • fig – Handle for figure

  • +
  • ax – Handle for axes

  • +
+
+
+
+ +
+
+libfmp.c4.c4s2_ssm.shift_cyc_matrix(X, shift=0)[source]
+

Cyclic shift of features matrix along first dimension

+

Notebook: C4/C4S2_SSM-TranspositionInvariance.ipynb

+
+
Parameters
+
    +
  • X (np.ndarray) – Feature respresentation

  • +
  • shift (int) – Number of bins to be shifted (Default value = 0)

  • +
+
+
Returns
+

X_cyc (np.ndarray) – Cyclically shifted feature matrix

+
+
+
+ +
+
+libfmp.c4.c4s2_ssm.subplot_matrix_colorbar(S, fig, ax, title='', Fs=1, xlabel='Time (seconds)', ylabel='Time (seconds)', clim=None, xlim=None, ylim=None, cmap=None)[source]
+

Visualization function for showing zoomed sections of matrices

+

Notebook: C4/C4S2_SSM-PathEnhancement.ipynb

+
+
Parameters
+
    +
  • S – Similarity matrix (SM)

  • +
  • fig – Figure handle

  • +
  • ax – Axes handle

  • +
  • title – Title for figure (Default value = ‘’)

  • +
  • Fs – Feature rate (Default value = 1)

  • +
  • xlabel – Label for x-axis (Default value = ‘Time (seconds)’)

  • +
  • ylabel – Label for y-axis (Default value = ‘Time (seconds)’)

  • +
  • clim – Color limits (Default value = None)

  • +
  • xlim – Limits for x-axis (Default value = None)

  • +
  • ylim – Limits for x-axis (Default value = None)

  • +
  • cmap – Colormap for imshow (Default value = None)

  • +
+
+
Returns
+

im – Imshow handle

+
+
+
+ +
+
+libfmp.c4.c4s2_ssm.subplot_matrix_ti_colorbar(S, fig, ax, title='', Fs=1, xlabel='Time (seconds)', ylabel='Time (seconds)', clim=None, xlim=None, ylim=None, cmap=None, alpha=1, ind_zero=False)[source]
+

Visualization function for showing transposition index matrix

+

Notebook: C4/C4S2_SSM-TranspositionInvariance.ipynb

+
+
Parameters
+
    +
  • S – Self-similarity matrix (SSM)

  • +
  • fig – Figure handle

  • +
  • ax – Axes handle

  • +
  • title – Title for figure (Default value = ‘’)

  • +
  • Fs – Feature rate (Default value = 1)

  • +
  • xlabel – Label for x-axis (Default value = ‘Time (seconds)’)

  • +
  • ylabel – Label for y-axis (Default value = ‘Time (seconds)’)

  • +
  • clim – Color limits (Default value = None)

  • +
  • xlim – Limits for x-axis (Default value = None)

  • +
  • ylim – Limits for y-axis (Default value = None)

  • +
  • cmap – Color map (Default value = None)

  • +
  • alpha – Alpha value for imsow (Default value = 1)

  • +
  • ind_zero – Use white (True) or black (False) color for index zero (Default value = False)

  • +
+
+
Returns
+

im – Imshow handle

+
+
+
+ +
+
+libfmp.c4.c4s2_synthetic_ssm.generate_ssm_from_annotation(ann, label_ann=None, score_path=1.0, score_block=0.5, main_diagonal=True, smooth_sigma=0.0, noise_power=0.0)[source]
+

Generation of a SSM

+

Notebook: C4/C4S2_SSM-Synthetic.ipynb

+
+
Parameters
+
    +
  • ann (list) – Description of sections (see explanation above)

  • +
  • label_ann (dict) – Specification of property (path, block relation) (Default value = None)

  • +
  • score_path (float) – SSM values for occurring paths (Default value = 1.0)

  • +
  • score_block (float) – SSM values of blocks covering the same labels (Default value = 0.5)

  • +
  • main_diagonal (bool) – True if a filled main diagonal should be enforced (Default value = True)

  • +
  • smooth_sigma (float) – Standard deviation of a Gaussian smoothing filter. +filter length is 4*smooth_sigma (Default value = 0.0)

  • +
  • noise_power (float) – Variance of additive white Gaussian noise (Default value = 0.0)

  • +
+
+
Returns
+

S (np.ndarray) – Generated SSM

+
+
+
+ +
+
+libfmp.c4.c4s2_threshold.threshold_matrix(S, thresh, strategy='absolute', scale=False, penalty=0.0, binarize=False)[source]
+

Treshold matrix in a relative fashion

+

Notebook: C4/C4S2_SSM-Thresholding.ipynb

+
+
Parameters
+
    +
  • S (np.ndarray) – Input matrix

  • +
  • thresh (float) – Treshold (meaning depends on strategy)

  • +
  • strategy (str) – Thresholding strategy (‘absolute’, ‘relative’, ‘local’) (Default value = ‘absolute’)

  • +
  • scale (bool) – If scale=True, then scaling of positive values to range [0,1] (Default value = False)

  • +
  • penalty (float) – Set values below treshold to value specified (Default value = 0.0)

  • +
  • binarize (bool) – Binarizes final matrix (positive: 1; otherwise: 0) (Default value = False)

  • +
+
+
Returns
+

S_thresh (np.ndarray) – Thresholded matrix

+
+
+
+ +
+
+libfmp.c4.c4s2_threshold.threshold_matrix_relative(S, thresh_rel=0.2, details=False)[source]
+

Treshold matrix in a relative fashion

+

Notebook: C4/C4S2_SSM-Thresholding.ipynb

+
+
Parameters
+
    +
  • S (np.ndarray) – Input matrix

  • +
  • thresh_rel (float) – Relative treshold (Default value = 0.2)

  • +
  • details (bool) – Print details on thresholding procedure (Default value = False)

  • +
+
+
Returns
+
    +
  • S_thresh (np.ndarray) – Thresholded matrix

  • +
  • thresh_abs (float) – Absolute threshold used for thresholding

  • +
+
+
+
+ +
+
+libfmp.c4.c4s3_thumbnail.check_segment(seg, S)[source]
+

Prints properties of segments with regard to SSM S

+

Notebook: C4/C4S3_ScapePlot.ipynb

+
+
Parameters
+
    +
  • seg (tuple) – Segment (start_index, end_index)

  • +
  • S (np.ndarray) – Self-similarity matrix

  • +
+
+
Returns
+

path_family (list) – Optimal path family

+
+
+
+ +
+
+libfmp.c4.c4s3_thumbnail.colormap_penalty(penalty=- 2, cmap=libfmp.b.compressed_gray_cmap(alpha=5))[source]
+

Extend colormap with white color between the penalty value and zero

+

Notebook: C4/C4S3_AudioThumbnailing.ipynb

+
+
Parameters
+
    +
  • penalty (float) – Negative number (Default value = -2.0)

  • +
  • cmap (mpl.colors.Colormap) – Original colormap (Default value = libfmp.b.compressed_gray_cmap(alpha=5))

  • +
+
+
Returns
+

cmap_penalty (mpl.colors.Colormap) – Extended colormap

+
+
+
+ +
+
+libfmp.c4.c4s3_thumbnail.compute_accumulated_score_matrix(S_seg)[source]
+

Compute the accumulated score matrix

+

Notebook: C4/C4S3_AudioThumbnailing.ipynb

+
+
Parameters
+

S_seg (np.ndarray) – Submatrix of an enhanced and normalized SSM S. +Note: S must satisfy S(n,m) <= 1 and S(n,n) = 1

+
+
Returns
+
    +
  • D (np.ndarray) – Accumulated score matrix

  • +
  • score (float) – Score of optimal path family

  • +
+
+
+
+ +
+
+libfmp.c4.c4s3_thumbnail.compute_fitness(path_family, score, N)[source]
+

Compute fitness measure and other metrics from path family

+

Notebook: C4/C4S3_AudioThumbnailing.ipynb

+
+
Parameters
+
    +
  • path_family (list) – Path family

  • +
  • score (float) – Score

  • +
  • N (int) – Length of feature sequence

  • +
+
+
Returns
+
    +
  • fitness (float) – Fitness

  • +
  • score (float) – Score

  • +
  • score_n (float) – Normalized score

  • +
  • coverage (float) – Coverage

  • +
  • coverage_n (float) – Normalized coverage

  • +
  • path_family_length (int) – Length of path family (total number of cells)

  • +
+
+
+
+ +
+
+libfmp.c4.c4s3_thumbnail.compute_fitness_scape_plot(S)[source]
+

Compute scape plot for fitness and other measures

+

Notebook: C4/C4S3_ScapePlot.ipynb

+
+
Parameters
+

S (np.ndarray) – Self-similarity matrix

+
+
Returns
+

SP_all (np.ndarray) – Vector containing five different scape plots for five measures +(fitness, score, normalized score, coverage, normlized coverage)

+
+
+
+ +
+
+libfmp.c4.c4s3_thumbnail.compute_induced_segment_family_coverage(path_family)[source]
+

Compute induced segment family and coverage from path family

+

Notebook: C4/C4S3_AudioThumbnailing.ipynb

+
+
Parameters
+

path_family (list) – Path family

+
+
Returns
+
    +
  • segment_family (np.ndarray) – Induced segment family

  • +
  • coverage (float) – Coverage of path family

  • +
+
+
+
+ +
+
+libfmp.c4.c4s3_thumbnail.compute_optimal_path_family(D)[source]
+

Compute an optimal path family given an accumulated score matrix

+

Notebook: C4/C4S3_AudioThumbnailing.ipynb

+
+
Parameters
+

D (np.ndarray) – Accumulated score matrix

+
+
Returns
+

path_family (list) – Optimal path family consisting of list of paths +(each path being a list of index pairs)

+
+
+
+ +
+
+libfmp.c4.c4s3_thumbnail.normalization_properties_ssm(S)[source]
+

Normalizes self-similartiy matrix to fulfill S(n,n)=1. +Yields a warning if max(S)<=1 is not fulfilled

+

Notebook: C4/C4S3_AudioThumbnailing.ipynb

+
+
Parameters
+

S (np.ndarray) – Self-similarity matrix (SSM)

+
+
Returns
+

S_normalized (np.ndarray) – Normalized self-similarity matrix

+
+
+
+ +
+
+libfmp.c4.c4s3_thumbnail.plot_path_family(ax, path_family, Fs=1, x_offset=0, y_offset=0, proj_x=True, w_x=7, proj_y=True, w_y=7)[source]
+

Plot path family into a given axis

+

Notebook: C4/C4S3_AudioThumbnailing.ipynb

+
+
Parameters
+
    +
  • ax – Axis of plot

  • +
  • path_family – Path family

  • +
  • Fs – Feature rate of path_family (Default value = 1)

  • +
  • x_offset – Offset x-axis (Default value = 0)

  • +
  • y_offset – Yffset x-axis (Default value = 0)

  • +
  • proj_x – Display projection on x-axis (Default value = True)

  • +
  • w_x – Width used for projection on x-axis (Default value = 7)

  • +
  • proj_y – Display projection on y-axis (Default value = True)

  • +
  • w_y – Width used for projection on y-axis (Default value = 7)

  • +
+
+
+
+ +
+
+libfmp.c4.c4s3_thumbnail.plot_seg_in_sp(ax, seg, S=None, Fs=1)[source]
+

Plot segment and induced segements as points in SP visualization

+

Notebook: C4/C4S3_ScapePlot.ipynb

+
+
Parameters
+
    +
  • ax – Axis for image

  • +
  • seg – Segment (start_index, end_index)

  • +
  • S – Self-similarity matrix (Default value = None)

  • +
  • Fs – Sampling rate (Default value = 1)

  • +
+
+
+
+ +
+
+libfmp.c4.c4s3_thumbnail.plot_sp_ssm(SP, seg, S, ann, color_ann=[], title='', figsize=(5, 4))[source]
+

Visulization of SP and SSM

+

Notebook: C4/C4S3_ScapePlot.ipynb

+
+
Parameters
+
    +
  • SP – Scape plot

  • +
  • seg – Segment (start_index, end_index)

  • +
  • S – Self-similarity matrix

  • +
  • ann – Annotation

  • +
  • color_ann – color scheme used for annotations (Default value = [])

  • +
  • title – Title of figure (Default value = ‘’)

  • +
  • figsize – Figure size (Default value = (5, 4))

  • +
+
+
+
+ +
+
+libfmp.c4.c4s3_thumbnail.plot_ssm_ann(S, ann, Fs=1, cmap='gray_r', color_ann=[], ann_x=True, ann_y=True, fontsize=12, figsize=(5, 4.5), xlabel='', ylabel='', title='')[source]
+

Plot SSM and annotations (horizontal and vertical as overlay)

+

Notebook: C4/C4S3_AudioThumbnailing.ipynb

+
+
Parameters
+
    +
  • S – Self-similarity matrix

  • +
  • ann – Annotations

  • +
  • Fs – Feature rate of path_family (Default value = 1)

  • +
  • cmap – Color map for S (Default value = ‘gray_r’)

  • +
  • color_ann – color scheme used for annotations (see libfmp.b.b_plot.plot_segments()) +(Default value = [])

  • +
  • ann_x – Plot annotations on x-axis (Default value = True)

  • +
  • ann_y – Plot annotations on y-axis (Default value = True)

  • +
  • fontsize – Font size used for annotation labels (Default value = 12)

  • +
  • figsize – Size of figure (Default value = (5, 4.5))

  • +
  • xlabel – Label for x-axis (Default value = ‘’)

  • +
  • ylabel – Label for y-axis (Default value = ‘’)

  • +
  • title – Figure size (Default value = ‘’)

  • +
+
+
Returns
+
    +
  • fig – Handle for figure

  • +
  • ax – Handle for axes

  • +
  • im – Handle for imshow

  • +
+
+
+
+ +
+
+libfmp.c4.c4s3_thumbnail.plot_ssm_ann_optimal_path_family(S, ann, seg, Fs=1, cmap='gray_r', color_ann=[], fontsize=12, figsize=(5, 4.5), xlabel='', ylabel='')[source]
+

Plot SSM, annotations, and computed optimal path family

+

Notebook: C4/C4S3_AudioThumbnailing.ipynb

+
+
Parameters
+
    +
  • S – Self-similarity matrix

  • +
  • ann – Annotations

  • +
  • seg – Segment for computing the optimal path family

  • +
  • Fs – Feature rate of path_family (Default value = 1)

  • +
  • cmap – Color map for S (Default value = ‘gray_r’)

  • +
  • color_ann – color scheme used for annotations (see libfmp.b.b_plot.plot_segments()) +(Default value = [])

  • +
  • fontsize – Font size used for annotation labels (Default value = 12)

  • +
  • figsize – Size of figure (Default value = (5, 4.5))

  • +
  • xlabel – Label for x-axis (Default value = ‘’)

  • +
  • ylabel – Label for y-axis (Default value = ‘’)

  • +
+
+
Returns
+
    +
  • fig – Handle for figure

  • +
  • ax – Handle for axes

  • +
  • im – Handle for imshow

  • +
+
+
+
+ +
+
+libfmp.c4.c4s3_thumbnail.seg_max_sp(SP)[source]
+

Return segment with maximal value in SP

+

Notebook: C4/C4S3_ScapePlot.ipynb

+
+
Parameters
+

SP (np.ndarray) – Scape plot

+
+
Returns
+

seg (tuple) – Segment (start_index, end_index)

+
+
+
+ +
+
+libfmp.c4.c4s3_thumbnail.visualize_scape_plot(SP, Fs=1, ax=None, figsize=(4, 3), title='', xlabel='Center (seconds)', ylabel='Length (seconds)')[source]
+

Visualize scape plot

+

Notebook: C4/C4S3_ScapePlot.ipynb

+
+
Parameters
+
    +
  • SP – Scape plot data (encodes as start-duration matrix)

  • +
  • Fs – Sampling rate (Default value = 1)

  • +
  • ax – Used axes (Default value = None)

  • +
  • figsize – Figure size (Default value = (4, 3))

  • +
  • title – Title of figure (Default value = ‘’)

  • +
  • xlabel – Label for x-axis (Default value = ‘Center (seconds)’)

  • +
  • ylabel – Label for y-axis (Default value = ‘Length (seconds)’)

  • +
+
+
Returns
+
    +
  • fig – Handle for figure

  • +
  • ax – Handle for axes

  • +
  • im – Handle for imshow

  • +
+
+
+
+ +
+
+libfmp.c4.c4s4_novelty_kernel.compute_kernel_checkerboard_box(L)[source]
+

Compute box-like checkerboard kernel [FMP, Section 4.4.1]

+

Notebook: C4/C4S4_NoveltySegmentation.ipynb

+
+
Parameters
+

L (int) – Parameter specifying the kernel size 2*L+1

+
+
Returns
+

kernel (np.ndarray) – Kernel matrix of size (2*L+1) x (2*L+1)

+
+
+
+ +
+
+libfmp.c4.c4s4_novelty_kernel.compute_kernel_checkerboard_gaussian(L, var=1.0, normalize=True)[source]
+

Compute Guassian-like checkerboard kernel [FMP, Section 4.4.1]. +See also: https://scipython.com/blog/visualizing-the-bivariate-gaussian-distribution/

+

Notebook: C4/C4S4_NoveltySegmentation.ipynb

+
+
Parameters
+
    +
  • L (int) – Parameter specifying the kernel size M=2*L+1

  • +
  • var (float) – Variance parameter determing the tapering (epsilon) (Default value = 1.0)

  • +
  • normalize (bool) – Normalize kernel (Default value = True)

  • +
+
+
Returns
+

kernel (np.ndarray) – Kernel matrix of size M x M

+
+
+
+ +
+
+libfmp.c4.c4s4_novelty_kernel.compute_novelty_ssm(S, kernel=None, L=10, var=0.5, exclude=False)[source]
+

Compute novelty function from SSM [FMP, Section 4.4.1]

+

Notebook: C4/C4S4_NoveltySegmentation.ipynb

+
+
Parameters
+
    +
  • S (np.ndarray) – SSM

  • +
  • kernel (np.ndarray) – Checkerboard kernel (if kernel==None, it will be computed) (Default value = None)

  • +
  • L (int) – Parameter specifying the kernel size M=2*L+1 (Default value = 10)

  • +
  • var (float) – Variance parameter determing the tapering (epsilon) (Default value = 0.5)

  • +
  • exclude (bool) – Sets the first L and last L values of novelty function to zero (Default value = False)

  • +
+
+
Returns
+

nov (np.ndarray) – Novelty function

+
+
+
+ +
+
+libfmp.c4.c4s4_structure_feature.compute_time_lag_representation(S, circular=True)[source]
+

Computation of (circular) time-lag representation

+

Notebook: C4/C4S4_StructureFeature.ipynb

+
+
Parameters
+
    +
  • S (np.ndarray) – Self-similarity matrix

  • +
  • circular (bool) – Computes circular version (Default value = True)

  • +
+
+
Returns
+

L (np.ndarray) – (Circular) time-lag representation of S

+
+
+
+ +
+
+libfmp.c4.c4s4_structure_feature.novelty_structure_feature(L, padding=True)[source]
+

Computation of the novelty function from a circular time-lag representation

+

Notebook: C4/C4S4_StructureFeature.ipynb

+
+
Parameters
+
    +
  • L (np.ndarray) – Circular time-lag representation

  • +
  • padding (bool) – Padding the result with the value zero (Default value = True)

  • +
+
+
Returns
+

nov (np.ndarray) – Novelty function

+
+
+
+ +
+
+libfmp.c4.c4s4_structure_feature.plot_ssm_structure_feature_nov(S, L, nov, Fs=1, figsize=(10, 3), ann=[], color_ann=[])[source]
+

Plotting an SSM, structure features, and a novelty function

+

Notebook: C4/C4S4_StructureFeature.ipynb

+
+
Parameters
+
    +
  • S – SSM

  • +
  • L – Circular time-lag representation

  • +
  • nov – Novelty function

  • +
  • Fs – Feature rate (indicated in title of SSM) (Default value = 1)

  • +
  • figsize – Figure size (Default value = (10, 3))

  • +
  • ann – Annotations (Default value = [])

  • +
  • color_ann – Colors used for annotations (see libfmp.b.b_plot.plot_segments()) (Default value = [])

  • +
+
+
Returns
+
    +
  • ax1 – First subplot

  • +
  • ax2 – Second subplot

  • +
  • ax3 – Third subplot

  • +
+
+
+
+ +
+
+libfmp.c4.c4s5_evaluation.compare_pairwise(X)[source]
+

Compute set of positive items from label sequence [FMP, Section 4.5.3]

+

Notebook: C4/C4S5_Evaluation.ipynb

+
+
Parameters
+

X (list or np.ndarray) – Label sequence

+
+
Returns
+

I_pos (np.ndarray) – Set of positive items

+
+
+
+ +
+
+libfmp.c4.c4s5_evaluation.convert_ann_to_seq_label(ann)[source]
+

Convert structure annotation with integer time positions (given in indices) +into label sequence

+

Notebook: C4/C4S5_Evaluation.ipynb

+
+
Parameters
+

ann (list) – Annotation (list [[s, t, 'label'], ...], with s, t being integers)

+
+
Returns
+

X (list) – Sequencs of labels

+
+
+
+ +
+
+libfmp.c4.c4s5_evaluation.evaluate_boundary(B_ref, B_est, tau)[source]
+

Compute boundary evaluation measures [FMP, Section 4.5.4]

+

Notebook: C4/C4S5_Evaluation.ipynb

+
+
Parameters
+
    +
  • B_ref (np.ndarray) – Reference boundary annotations

  • +
  • B_est (np.ndarray) – Estimated boundary annotations

  • +
  • tau (int) – Tolerance parameter. +Note: Condition |b_{k+1}-b_k|>2tau should be fulfilled [FMP, Eq. 4.58]

  • +
+
+
Returns
+
    +
  • P (float) – Precision

  • +
  • R (float) – Recall

  • +
  • F (float) – F-measure

  • +
  • num_TP (int) – Number of true positives

  • +
  • num_FN (int) – Number of false negatives

  • +
  • num_FP (int) – Number of false positives

  • +
  • B_tol (np.ndarray) – Data structure encoding B_ref with tolerance

  • +
  • I_eval (np.ndarray) – Data structure encoding TP, FN, FP

  • +
+
+
+
+ +
+
+libfmp.c4.c4s5_evaluation.evaluate_pairwise(I_ref_pos, I_est_pos)[source]
+

Compute pairwise evaluation measures [FMP, Section 4.5.3]

+

Notebook: C4/C4S5_Evaluation.ipynb

+
+
Parameters
+
    +
  • I_ref_pos (np.ndarray) – Referenence set of positive items

  • +
  • I_est_pos (np.ndarray) – Set of items being estimated as positive

  • +
+
+
Returns
+
    +
  • P (float) – Precision

  • +
  • R (float) – Recall

  • +
  • F (float) – F-measure

  • +
  • num_TP (int) – Number of true positives

  • +
  • num_FN (int) – Number of false negatives

  • +
  • num_FP (int) – Number of false positives

  • +
  • I_eval (np.ndarray) – Data structure encoding TP, FN, FP

  • +
+
+
+
+ +
+
+libfmp.c4.c4s5_evaluation.measure_prf(num_TP, num_FN, num_FP)[source]
+

Compute P, R, and F from size of TP, FN, and FP [FMP, Section 4.5.1]

+

Notebook: C4/C4S5_Evaluation.ipynb

+
+
Parameters
+
    +
  • num_TP (int) – True positives

  • +
  • num_FN (int) – False negative

  • +
  • num_FP (int) – False positives

  • +
+
+
Returns
+
    +
  • P (float) – Precision

  • +
  • R (float) – Recall

  • +
  • F (float) – F-measure

  • +
+
+
+
+ +
+
+libfmp.c4.c4s5_evaluation.measure_prf_sets(I, I_ref_pos, I_est_pos, details=False)[source]
+

Compute P, R, and F from sets I, I_ref_pos, I_est_pos [FMP, Section 4.5.1]

+

Notebook: C4/C4S5_Evaluation.ipynb

+
+
Parameters
+
    +
  • I – Set of items

  • +
  • I_ref_pos – Reference set of positive items

  • +
  • I_est_pos – Set of items being estimated as positive

  • +
  • details – Print details (Default value = False)

  • +
+
+
Returns
+
    +
  • P (float) – Precision

  • +
  • R (float) – Recall

  • +
  • F (float) – F-measure

  • +
+
+
+
+ +
+
+libfmp.c4.c4s5_evaluation.plot_boundary_measures(B_ref, B_est, tau, figsize=(8, 2.5))[source]
+

Plot B_ref and B_est (see libfmp.c4.c4s5_evaluation.evaluate_boundary())

+

Notebook: C4/C4S5_Evaluation.ipynb

+
+
Parameters
+
    +
  • B_ref – Reference boundary annotations

  • +
  • B_est – Estimated boundary annotations

  • +
  • tau – Tolerance parameter

  • +
  • figsize – Figure size (Default value = (8, 2.5))

  • +
+
+
Returns
+
    +
  • fig – Handle for figure

  • +
  • ax – Handle for axes

  • +
+
+
+
+ +
+
+libfmp.c4.c4s5_evaluation.plot_matrix_label(M, X, color_label=None, figsize=(3, 3), cmap='gray_r', fontsize=8, print_labels=True)[source]
+

Plot matrix and label sequence

+

Notebook: C4/C4S5_Evaluation.ipynb

+
+
Parameters
+
    +
  • M – Matrix

  • +
  • X – Label sequence

  • +
  • color_label – List of colors for labels (Default value = None)

  • +
  • figsize – Figure size (Default value = (3, 3))

  • +
  • cmap – Colormap for imshow (Default value = ‘gray_r’)

  • +
  • fontsize – Font size (Default value = 8)

  • +
  • print_labels – Display labels inside Rectangles (Default value = True)

  • +
+
+
Returns
+
    +
  • fig – Handle for figure

  • +
  • ax – Handle for axes

  • +
+
+
+
+ +
+
+libfmp.c4.c4s5_evaluation.plot_matrix_pairwise(I_eval, figsize=(3, 2.5))[source]
+

Plot matrix I_eval encoding TP, FN, FP (see libfmp.c4.c4s5_evaluation.evaluate_pairwise())

+

Notebook: C4/C4S5_Evaluation.ipynb

+
+
Parameters
+
    +
  • I_eval – Data structure encoding TP, FN, FP

  • +
  • figsize – Figure size (Default value = (3, 2.5))

  • +
+
+
Returns
+
    +
  • fig – Handle for figure

  • +
  • im – Handle for imshow

  • +
+
+
+
+ +
+
+libfmp.c4.c4s5_evaluation.plot_seq_label(ax, X, Fs=1, color_label=[], direction='horizontal', fontsize=10, time_axis=False, print_labels=True)[source]
+

Plot label sequence in the style of annotations

+

Notebook: C4/C4S5_Evaluation.ipynb

+
+
Parameters
+
+
+
Returns
+

ann_X – Structure annotation for label sequence

+
+
+
+ +
+ + +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/index_c5.html b/docs/build/html/index_c5.html new file mode 100644 index 0000000..0e9ac4f --- /dev/null +++ b/docs/build/html/index_c5.html @@ -0,0 +1,728 @@ + + + + + + + + + + Chord Recognition (libfmp.c5) — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ + + + +
+
+
+
+ +
+

Chord Recognition (libfmp.c5)

+

The FMP notebooks provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL:

+

https://www.audiolabs-erlangen.de/resources/MIR/FMP/C5/C5.html

+
+
+libfmp.c5.c5s1_basic_theory_harmony.generate_sinusoid_chord(pitches=[69], duration=1, Fs=4000, amplitude_max=0.5)[source]
+

Generate synthetic sound of chord using sinusoids

+

Notebook: C5/C5S1_Chords.ipynb

+
+
Parameters
+
    +
  • pitches (list) – List of pitches (MIDI note numbers) (Default value = [69])

  • +
  • duration (float) – Duration (seconds) (Default value = 1)

  • +
  • Fs (scalar) – Sampling rate (Default value = 4000)

  • +
  • amplitude_max (float) – Amplitude (Default value = 0.5)

  • +
+
+
Returns
+

x (np.ndarray) – Synthesized signal

+
+
+
+ +
+
+libfmp.c5.c5s1_basic_theory_harmony.generate_sinusoid_scale(pitches=[69], duration=0.5, Fs=4000, amplitude_max=0.5)[source]
+

Generate synthetic sound of scale using sinusoids

+

Notebook: C5/C5S1_Scales_CircleFifth.ipynb

+
+
Parameters
+
    +
  • pitches (list) – List of pitchs (MIDI note numbers) (Default value = [69])

  • +
  • duration (float) – Duration (seconds) (Default value = 0.5)

  • +
  • Fs (scalar) – Sampling rate (Default value = 4000)

  • +
  • amplitude_max (float) – Amplitude (Default value = 0.5)

  • +
+
+
Returns
+

x (np.ndarray) – Synthesized signal

+
+
+
+ +
+
+libfmp.c5.c5s2_chord_rec_template.chord_recognition_template(X, norm_sim='1', nonchord=False)[source]
+

Conducts template-based chord recognition +with major and minor triads (and possibly nonchord)

+

Notebook: C5/C5S2_ChordRec_Templates.ipynb

+
+
Parameters
+
    +
  • X (np.ndarray) – Chromagram

  • +
  • norm_sim (str) – Specifies norm used for normalizing chord similarity matrix (Default value = ‘1’)

  • +
  • nonchord (bool) – If “True” then add nonchord template (Default value = False)

  • +
+
+
Returns
+
    +
  • chord_sim (np.ndarray) – Chord similarity matrix

  • +
  • chord_max (np.ndarray) – Binarized chord similarity matrix only containing maximizing chord

  • +
+
+
+
+ +
+
+libfmp.c5.c5s2_chord_rec_template.compute_chromagram_from_filename(fn_wav, Fs=22050, N=4096, H=2048, gamma=None, version='STFT', norm='2')[source]
+

Compute chromagram for WAV file specified by filename

+

Notebook: C5/C5S2_ChordRec_Templates.ipynb

+
+
Parameters
+
    +
  • fn_wav (str) – Filenname of WAV

  • +
  • Fs (scalar) – Sampling rate (Default value = 22050)

  • +
  • N (int) – Window size (Default value = 4096)

  • +
  • H (int) – Hop size (Default value = 2048)

  • +
  • gamma (float) – Constant for logarithmic compression (Default value = None)

  • +
  • version (str) – Technique used for front-end decomposition (‘STFT’, ‘IIS’, ‘CQT’) (Default value = ‘STFT’)

  • +
  • norm (str) – If not ‘None’, chroma vectors are normalized by norm as specified (‘1’, ‘2’, ‘max’) +(Default value = ‘2’)

  • +
+
+
Returns
+
    +
  • X (np.ndarray) – Chromagram

  • +
  • Fs_X (scalar) – Feature reate of chromagram

  • +
  • x (np.ndarray) – Audio signal

  • +
  • Fs (scalar) – Sampling rate of audio signal

  • +
  • x_dur (float) – Duration (seconds) of audio signal

  • +
+
+
+
+ +
+
+libfmp.c5.c5s2_chord_rec_template.compute_eval_measures(I_ref, I_est)[source]
+

Compute evaluation measures including precision, recall, and F-measure

+

Notebook: C5/C5S2_ChordRec_Eval.ipynb

+
+
Parameters
+
    +
  • I_ref (np.ndarray) – Reference set of items

  • +
  • I_est (np.ndarray) – Set of estimated items

  • +
+
+
Returns
+
    +
  • P (float) – Precision

  • +
  • R (float) – Recall

  • +
  • F (float) – F-measure

  • +
  • num_TP (int) – Number of true positives

  • +
  • num_FN (int) – Number of false negatives

  • +
  • num_FP (int) – Number of false positives

  • +
+
+
+
+ +
+
+libfmp.c5.c5s2_chord_rec_template.convert_chord_ann_matrix(fn_ann, chord_labels, Fs=1, N=None, last=False)[source]
+

Convert segment-based chord annotation into various formats

+

Notebook: C5/C5S2_ChordRec_Eval.ipynb

+
+
Parameters
+
    +
  • fn_ann (str) – Filename of segment-based chord annotation

  • +
  • chord_labels (list) – List of chord labels

  • +
  • Fs (scalar) – Feature rate (Default value = 1)

  • +
  • N (int) – Number of frames to be generated (by cutting or extending). +Only enforced for ann_matrix, ann_frame, ann_seg_frame (Default value = None)

  • +
  • last (bool) – If ‘True’ uses for extension last chord label, otherwise uses nonchord label ‘N’ +(Default value = False)

  • +
+
+
Returns
+
    +
  • ann_matrix (np.ndarray) – Encoding of label sequence in form of a binary time-chord representation

  • +
  • ann_frame (list) – Label sequence (specified on the frame level)

  • +
  • ann_seg_frame (list) – Encoding of label sequence as segment-based annotation (given in indices)

  • +
  • ann_seg_ind (list) – Segment-based annotation with segments (given in indices)

  • +
  • ann_seg_sec (list) – Segment-based annotation with segments (given in seconds)

  • +
+
+
+
+ +
+
+libfmp.c5.c5s2_chord_rec_template.convert_chord_label(ann)[source]
+

Replace for segment-based annotation in each chord label the string ‘:min’ by ‘m’ +and convert flat chords into sharp chords using enharmonic equivalence

+

Notebook: C5/C5S2_ChordRec_Eval.ipynb

+
+
Parameters
+

ann (list) – Segment-based annotation with chord labels

+
+
Returns
+

ann_conv (list) – Converted segment-based annotation with chord labels

+
+
+
+ +
+
+libfmp.c5.c5s2_chord_rec_template.convert_sequence_ann(seq, Fs=1)[source]
+

Convert label sequence into segment-based annotation

+

Notebook: C5/C5S2_ChordRec_Eval.ipynb

+
+
Parameters
+
    +
  • seq (list) – Label sequence

  • +
  • Fs (scalar) – Feature rate (Default value = 1)

  • +
+
+
Returns
+

ann (list) – Segment-based annotation for label sequence

+
+
+
+ +
+
+libfmp.c5.c5s2_chord_rec_template.generate_chord_templates(nonchord=False)[source]
+

Generate chord templates of major and minor triads (and possibly nonchord)

+

Notebook: C5/C5S2_ChordRec_Templates.ipynb

+
+
Parameters
+

nonchord (bool) – If “True” then add nonchord template (Default value = False)

+
+
Returns
+

chord_templates (np.ndarray) – Matrix containing chord_templates as columns

+
+
+
+ +
+
+libfmp.c5.c5s2_chord_rec_template.get_chord_labels(ext_minor='m', nonchord=False)[source]
+

Generate chord labels for major and minor triads (and possibly nonchord label)

+

Notebook: C5/C5S2_ChordRec_Templates.ipynb

+
+
Parameters
+
    +
  • ext_minor (str) – Extension for minor chords (Default value = ‘m’)

  • +
  • nonchord (bool) – If “True” then add nonchord label (Default value = False)

  • +
+
+
Returns
+

chord_labels (list) – List of chord labels

+
+
+
+ +
+
+libfmp.c5.c5s2_chord_rec_template.plot_chromagram_annotation(ax, X, Fs_X, ann, color_ann, x_dur, cmap='gray_r', title='')[source]
+

Plot chromagram and annotation

+

Notebook: C5/C5S2_ChordRec_Templates.ipynb

+
+
Parameters
+
    +
  • ax – Axes handle

  • +
  • X – Feature representation

  • +
  • Fs_X – Feature rate

  • +
  • ann – Annotations

  • +
  • color_ann – Color for annotations

  • +
  • x_dur – Duration of feature representation

  • +
  • cmap – Color map for imshow (Default value = ‘gray_r’)

  • +
  • title – Title for figure (Default value = ‘’)

  • +
+
+
+
+ +
+
+libfmp.c5.c5s2_chord_rec_template.plot_matrix_chord_eval(I_ref, I_est, Fs=1, xlabel='Time (seconds)', ylabel='Chord', title='', chord_labels=None, ax=None, grid=True, figsize=(9, 3.5))[source]
+

Plots TP-, FP-, and FN-items in a color-coded form in time–chord grid

+

Notebook: C5/C5S2_ChordRec_Eval.ipynb

+
+
Parameters
+
    +
  • I_ref – Reference set of items

  • +
  • I_est – Set of estimated items

  • +
  • Fs – Feature rate (Default value = 1)

  • +
  • xlabel – Label for x-axis (Default value = ‘Time (seconds)’)

  • +
  • ylabel – Label for y-axis (Default value = ‘Chord’)

  • +
  • title – Title of figure (Default value = ‘’)

  • +
  • chord_labels – List of chord labels used for vertical axis (Default value = None)

  • +
  • ax – Array of axes (Default value = None)

  • +
  • grid – If “True” the plot grid (Default value = True)

  • +
  • figsize – Size of figure (if axes are not specified) (Default value = (9, 3.5))

  • +
+
+
Returns
+
    +
  • fig – The created matplotlib figure or None if ax was given.

  • +
  • ax – The used axes

  • +
  • im – The image plot

  • +
+
+
+
+ +
+
+libfmp.c5.c5s3_chord_rec_hmm.chord_recognition_all(X, ann_matrix, p=0.15, filt_len=None, filt_type='mean')[source]
+

Conduct template- and HMM-based chord recognition and evaluates the approaches

+

Notebook: C5/C5S3_ChordRec_Beatles.ipynb

+
+
Parameters
+
    +
  • X (np.ndarray) – Chromagram

  • +
  • ann_matrix (np.ndarray) – Reference annotation as given as time-chord binary matrix

  • +
  • p (float) – Self-transition probability used for HMM (Default value = 0.15)

  • +
  • filt_len (int) – Filter length used for prefilitering (Default value = None)

  • +
  • filt_type (str) – Filter type used for prefilitering (Default value = ‘mean’)

  • +
+
+
Returns
+
    +
  • result_Tem (tuple) – Chord recogntion evaluation results ([P, R, F, TP, FP, FN]) for template-based approach

  • +
  • result_HMM (tuple) – Chord recogntion evaluation results ([P, R, F, TP, FP, FN]) for HMM-based approach

  • +
  • chord_Tem (np.ndarray) – Template-based chord recogntion result given as binary matrix

  • +
  • chord_HMM (np.ndarray) – HMM-based chord recogntion result given as binary matrix

  • +
  • chord_sim (np.ndarray) – Chord similarity matrix

  • +
+
+
+
+ +
+
+libfmp.c5.c5s3_chord_rec_hmm.estimate_hmm_from_o_s(O, S, I, K)[source]
+

Estimate the state transition and output probability matrices from +a given observation and state sequence

+

Notebook: C5/C5S3_HiddenMarkovModel.ipynb

+
+
Parameters
+
    +
  • O (np.ndarray) – Observation sequence of length N

  • +
  • S (np.ndarray) – State sequence of length N

  • +
  • I (int) – Number of states

  • +
  • K (int) – Number of observation symbols

  • +
+
+
Returns
+
    +
  • A_est (np.ndarray) – State transition probability matrix of dimension I x I

  • +
  • B_est (np.ndarray) – Output probability matrix of dimension I x K

  • +
+
+
+
+ +
+
+libfmp.c5.c5s3_chord_rec_hmm.generate_sequence_hmm(N, A, C, B, details=False)[source]
+

Generate observation and state sequence from given HMM

+

Notebook: C5/C5S3_HiddenMarkovModel.ipynb

+
+
Parameters
+
    +
  • N (int) – Number of observations to be generated

  • +
  • A (np.ndarray) – State transition probability matrix of dimension I x I

  • +
  • C (np.ndarray) – Initial state distribution of dimension I

  • +
  • B (np.ndarray) – Output probability matrix of dimension I x K

  • +
  • details (bool) – If “True” then shows details (Default value = False)

  • +
+
+
Returns
+
    +
  • O (np.ndarray) – Observation sequence of length N

  • +
  • S (np.ndarray) – State sequence of length N

  • +
+
+
+
+ +
+
+libfmp.c5.c5s3_chord_rec_hmm.matrix_chord24_trans_inv(A)[source]
+

Computes transposition-invariant matrix for transition matrix +based 12 major chords and 12 minor chords

+

Notebook: C5/C5S3_ChordRec_HMM.ipynb

+
+
Parameters
+

A (np.ndarray) – Input transition matrix

+
+
Returns
+

A_ti (np.ndarray) – Output transition matrix

+
+
+
+ +
+
+libfmp.c5.c5s3_chord_rec_hmm.matrix_circular_mean(A)[source]
+

Computes circulant matrix with mean diagonal sums

+

Notebook: C5/C5S3_ChordRec_HMM.ipynb

+
+
Parameters
+

A (np.ndarray) – Square matrix

+
+
Returns
+

A_mean (np.ndarray) – Circulant output matrix

+
+
+
+ +
+
+libfmp.c5.c5s3_chord_rec_hmm.plot_transition_matrix(A, log=True, ax=None, figsize=(6, 5), title='', xlabel='State (chord label)', ylabel='State (chord label)', cmap='gray_r', quadrant=False)[source]
+

Plot a transition matrix for 24 chord models (12 major and 12 minor triads)

+

Notebook: C5/C5S3_ChordRec_HMM.ipynb

+
+
Parameters
+
    +
  • A – Transition matrix

  • +
  • log – Show log probabilities (Default value = True)

  • +
  • ax – Axis (Default value = None)

  • +
  • figsize – Width, height in inches (only used when ax=None) (Default value = (6, 5))

  • +
  • title – Title for plot (Default value = ‘’)

  • +
  • xlabel – Label for x-axis (Default value = ‘State (chord label)’)

  • +
  • ylabel – Label for y-axis (Default value = ‘State (chord label)’)

  • +
  • cmap – Color map (Default value = ‘gray_r’)

  • +
  • quadrant – Plots additional lines for C-major and C-minor quadrants (Default value = False)

  • +
+
+
Returns
+
    +
  • fig – The created matplotlib figure or None if ax was given.

  • +
  • ax – The used axes.

  • +
  • im – The image plot

  • +
+
+
+
+ +
+
+libfmp.c5.c5s3_chord_rec_hmm.uniform_transition_matrix(p=0.01, N=24)[source]
+

Computes uniform transition matrix

+

Notebook: C5/C5S3_ChordRec_HMM.ipynb

+
+
Parameters
+
    +
  • p (float) – Self transition probability (Default value = 0.01)

  • +
  • N (int) – Column and row dimension (Default value = 24)

  • +
+
+
Returns
+

A (np.ndarray) – Output transition matrix

+
+
+
+ +
+
+libfmp.c5.c5s3_chord_rec_hmm.viterbi(A, C, B, O)[source]
+

Viterbi algorithm for solving the uncovering problem

+

Notebook: C5/C5S3_Viterbi.ipynb

+
+
Parameters
+
    +
  • A (np.ndarray) – State transition probability matrix of dimension I x I

  • +
  • C (np.ndarray) – Initial state distribution of dimension I

  • +
  • B (np.ndarray) – Output probability matrix of dimension I x K

  • +
  • O (np.ndarray) – Observation sequence of length N

  • +
+
+
Returns
+
    +
  • S_opt (np.ndarray) – Optimal state sequence of length N

  • +
  • D (np.ndarray) – Accumulated probability matrix

  • +
  • E (np.ndarray) – Backtracking matrix

  • +
+
+
+
+ +
+
+libfmp.c5.c5s3_chord_rec_hmm.viterbi_log(A, C, B, O)[source]
+

Viterbi algorithm (log variant) for solving the uncovering problem

+

Notebook: C5/C5S3_Viterbi.ipynb

+
+
Parameters
+
    +
  • A (np.ndarray) – State transition probability matrix of dimension I x I

  • +
  • C (np.ndarray) – Initial state distribution of dimension I

  • +
  • B (np.ndarray) – Output probability matrix of dimension I x K

  • +
  • O (np.ndarray) – Observation sequence of length N

  • +
+
+
Returns
+
    +
  • S_opt (np.ndarray) – Optimal state sequence of length N

  • +
  • D_log (np.ndarray) – Accumulated log probability matrix

  • +
  • E (np.ndarray) – Backtracking matrix

  • +
+
+
+
+ +
+
+libfmp.c5.c5s3_chord_rec_hmm.viterbi_log_likelihood(A, C, B_O)[source]
+

Viterbi algorithm (log variant) for solving the uncovering problem

+

Notebook: C5/C5S3_Viterbi.ipynb

+
+
Parameters
+
    +
  • A (np.ndarray) – State transition probability matrix of dimension I x I

  • +
  • C (np.ndarray) – Initial state distribution of dimension I

  • +
  • B_O (np.ndarray) – Likelihood matrix of dimension I x N

  • +
+
+
Returns
+
    +
  • S_opt (np.ndarray) – Optimal state sequence of length N

  • +
  • S_mat (np.ndarray) – Binary matrix representation of optimal state sequence

  • +
  • D_log (np.ndarray) – Accumulated log probability matrix

  • +
  • E (np.ndarray) – Backtracking matrix

  • +
+
+
+
+ +
+ + +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/index_c6.html b/docs/build/html/index_c6.html new file mode 100644 index 0000000..852f6d0 --- /dev/null +++ b/docs/build/html/index_c6.html @@ -0,0 +1,965 @@ + + + + + + + + + + Tempo and Beat Tracking (libfmp.c6) — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Tempo and Beat Tracking (libfmp.c6)
  • + + +
  • + + + View page source + + +
  • + +
+ + +
+
+
+
+ +
+

Tempo and Beat Tracking (libfmp.c6)

+

The FMP notebooks provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL:

+

https://www.audiolabs-erlangen.de/resources/MIR/FMP/C6/C6.html

+
+
+libfmp.c6.c6s1_onset_detection.average_nov_dic(nov_dic, time_max_sec, Fs_out=100, norm=True, sigma=None)[source]
+

Average respamples set of novelty functions

+

Notebook: C6/C6S1_NoveltyComparison.ipynb

+
+
Parameters
+
    +
  • nov_dic (dict) – Dictionary of novelty functions

  • +
  • time_max_sec (float) – Duration of output signals (given in seconds)

  • +
  • Fs_out (scalar) – Sampling rate of output signal (Default value = 100)

  • +
  • norm (bool) – Apply max norm (if norm==True) (Default value = True)

  • +
  • sigma (float) – Standard deviation for smoothing Gaussian kernel (Default value = None)

  • +
+
+
Returns
+
    +
  • nov_matrix (np.ndarray) – Matrix containing resampled output signal (last one is average)

  • +
  • Fs_out (scalar) – Sampling rate of output signals

  • +
+
+
+
+ +
+
+libfmp.c6.c6s1_onset_detection.compute_local_average(x, M)[source]
+

Compute local average of signal

+

Notebook: C6/C6S1_NoveltySpectral.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Signal

  • +
  • M (int) – Determines size (2M+1) in samples of centric window used for local average

  • +
+
+
Returns
+

local_average (np.ndarray) – Local average signal

+
+
+
+ +
+
+libfmp.c6.c6s1_onset_detection.compute_novelty_complex(x, Fs=1, N=1024, H=64, gamma=10.0, M=40, norm=True)[source]
+

Compute complex-domain novelty function

+

Notebook: C6/C6S1_NoveltyComplex.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Signal

  • +
  • Fs (scalar) – Sampling rate (Default value = 1)

  • +
  • N (int) – Window size (Default value = 1024)

  • +
  • H (int) – Hop size (Default value = 64)

  • +
  • gamma (float) – Parameter for logarithmic compression (Default value = 10.0)

  • +
  • M (int) – Determines size (2M+1) in samples of centric window used for local average (Default value = 40)

  • +
  • norm (bool) – Apply max norm (if norm==True) (Default value = True)

  • +
+
+
Returns
+
    +
  • novelty_complex (np.ndarray) – Energy-based novelty function

  • +
  • Fs_feature (scalar) – Feature rate

  • +
+
+
+
+ +
+
+libfmp.c6.c6s1_onset_detection.compute_novelty_energy(x, Fs=1, N=2048, H=128, gamma=10.0, norm=True)[source]
+

Compute energy-based novelty function

+

Notebook: C6/C6S1_NoveltyEnergy.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Signal

  • +
  • Fs (scalar) – Sampling rate (Default value = 1)

  • +
  • N (int) – Window size (Default value = 2048)

  • +
  • H (int) – Hope size (Default value = 128)

  • +
  • gamma (float) – Parameter for logarithmic compression (Default value = 10.0)

  • +
  • norm (bool) – Apply max norm (if norm==True) (Default value = True)

  • +
+
+
Returns
+
    +
  • novelty_energy (np.ndarray) – Energy-based novelty function

  • +
  • Fs_feature (scalar) – Feature rate

  • +
+
+
+
+ +
+
+libfmp.c6.c6s1_onset_detection.compute_novelty_phase(x, Fs=1, N=1024, H=64, M=40, norm=True)[source]
+

Compute phase-based novelty function

+

Notebook: C6/C6S1_NoveltyPhase.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Signal

  • +
  • Fs (scalar) – Sampling rate (Default value = 1)

  • +
  • N (int) – Window size (Default value = 1024)

  • +
  • H (int) – Hop size (Default value = 64)

  • +
  • M (int) – Determines size (2M+1) in samples of centric window used for local average (Default value = 40)

  • +
  • norm (bool) – Apply max norm (if norm==True) (Default value = True)

  • +
+
+
Returns
+
    +
  • novelty_phase (np.ndarray) – Energy-based novelty function

  • +
  • Fs_feature (scalar) – Feature rate

  • +
+
+
+
+ +
+
+libfmp.c6.c6s1_onset_detection.compute_novelty_spectrum(x, Fs=1, N=1024, H=256, gamma=100.0, M=10, norm=True)[source]
+

Compute spectral-based novelty function

+

Notebook: C6/C6S1_NoveltySpectral.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Signal

  • +
  • Fs (scalar) – Sampling rate (Default value = 1)

  • +
  • N (int) – Window size (Default value = 1024)

  • +
  • H (int) – Hope size (Default value = 256)

  • +
  • gamma (float) – Parameter for logarithmic compression (Default value = 100.0)

  • +
  • M (int) – Size (frames) of local average (Default value = 10)

  • +
  • norm (bool) – Apply max norm (if norm==True) (Default value = True)

  • +
+
+
Returns
+
    +
  • novelty_spectrum (np.ndarray) – Energy-based novelty function

  • +
  • Fs_feature (scalar) – Feature rate

  • +
+
+
+
+ +
+
+libfmp.c6.c6s1_onset_detection.principal_argument(v)[source]
+

Principal argument function

+ +
+
Parameters
+

v (float or np.ndarray) – Value (or vector of values)

+
+
Returns
+

w (float or np.ndarray) – Principle value of v

+
+
+
+ +
+
+libfmp.c6.c6s1_onset_detection.read_annotation_pos(fn_ann, label='', header=True, print_table=False)[source]
+

Read and convert file containing either list of pairs (number,label) or list of (number)

+

Notebook: C6/C6S1_OnsetDetection.ipynb

+
+
Parameters
+
    +
  • fn_ann (str) – Name of file

  • +
  • label (str) – Name of label (Default value = ‘’)

  • +
  • header (bool) – Assumes header (True) or not (False) (Default value = True)

  • +
  • print_table (bool) – Prints table if True (Default value = False)

  • +
+
+
Returns
+
    +
  • ann (list) – List of annotations

  • +
  • label_keys (dict) – Dictionaries specifying color and line style used for labels

  • +
+
+
+
+ +
+
+libfmp.c6.c6s1_onset_detection.resample_signal(x_in, Fs_in, Fs_out=100, norm=True, time_max_sec=None, sigma=None)[source]
+

Resample and smooth signal

+

Notebook: C6/C6S1_NoveltyComparison.ipynb

+
+
Parameters
+
    +
  • x_in (np.ndarray) – Input signal

  • +
  • Fs_in (scalar) – Sampling rate of input signal

  • +
  • Fs_out (scalar) – Sampling rate of output signal (Default value = 100)

  • +
  • norm (bool) – Apply max norm (if norm==True) (Default value = True)

  • +
  • time_max_sec (float) – Duration of output signal (given in seconds) (Default value = None)

  • +
  • sigma (float) – Standard deviation for smoothing Gaussian kernel (Default value = None)

  • +
+
+
Returns
+
    +
  • x_out (np.ndarray) – Output signal

  • +
  • Fs_out (scalar) – Feature rate of output signal

  • +
+
+
+
+ +
+
+libfmp.c6.c6s1_peak_picking.peak_picking_MSAF(x, median_len=16, offset_rel=0.05, sigma=4.0)[source]
+

Peak picking strategy following MSFA using an adaptive threshold (https://github.com/urinieto/msaf)

+

Notebook: C6/C6S1_PeakPicking.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Input function

  • +
  • median_len (int) – Length of media filter used for adaptive thresholding (Default value = 16)

  • +
  • offset_rel (float) – Additional offset used for adaptive thresholding (Default value = 0.05)

  • +
  • sigma (float) – Variance for Gaussian kernel used for smoothing the novelty function (Default value = 4.0)

  • +
+
+
Returns
+
    +
  • peaks (np.ndarray) – Peak positions

  • +
  • x (np.ndarray) – Local threshold

  • +
  • threshold_local (np.ndarray) – Filtered novelty curve

  • +
+
+
+
+ +
+
+libfmp.c6.c6s1_peak_picking.peak_picking_boeck(activations, threshold=0.5, fps=100, include_scores=False, combine=False, pre_avg=12, post_avg=6, pre_max=6, post_max=6)[source]
+

Detects peaks.

+
+
Implements the peak-picking method described in:
+
“Evaluating the Online Capabilities of Onset Detection Methods”
+
Sebastian Boeck, Florian Krebs and Markus Schedl
+
Proceedings of the 13th International Society for Music Information Retrieval Conference (ISMIR), 2012
+
+

Modified by Jan Schlueter, 2014-04-24

+
+
Parameters
+
    +
  • activations (np.nadarray) – Vector of activations to process

  • +
  • threshold (float) – Threshold for peak-picking (Default value = 0.5)

  • +
  • fps (scalar) – Frame rate of onset activation function in Hz (Default value = 100)

  • +
  • include_scores (bool) – Include activation for each returned peak (Default value = False)

  • +
  • combine (bool) – Only report 1 onset for N seconds (Default value = False)

  • +
  • pre_avg (float) – Use N past seconds for moving average (Default value = 12)

  • +
  • post_avg (float) – Use N future seconds for moving average (Default value = 6)

  • +
  • pre_max (float) – Use N past seconds for moving maximum (Default value = 6)

  • +
  • post_max (float) – Use N future seconds for moving maximum (Default value = 6)

  • +
+
+
Returns
+

peaks (np.ndarray) – Peak positions

+
+
+
+ +
+
+libfmp.c6.c6s1_peak_picking.peak_picking_roeder(x, direction=None, abs_thresh=None, rel_thresh=None, descent_thresh=None, tmin=None, tmax=None)[source]
+
+
Computes the positive peaks of the input vector x
+
Python adaption from the Matlab Roeder_Peak_Picking script peaks.m from the internal Sync Toolbox
+
reckjn 2017
+
+
+
Parameters
+
    +
  • x (np.nadarray) – Signal to be searched for (positive) peaks

  • +
  • direction (int) – +1 for forward peak searching, -1 for backward peak searching. +default is dir == -1. (Default value = None)

  • +
  • abs_thresh (float) – Absolute threshold signal, i.e. only peaks +satisfying x(i)>=abs_thresh(i) will be reported. +abs_thresh must have the same number of samples as x. +a sensible choice for this parameter would be a global or local +average or median of the signal x. +If omitted, half the median of x will be used. (Default value = None)

  • +
  • rel_thresh (float) – Relative threshold signal. Only peak positions i with an +uninterrupted positive ascent before position i of at least +rel_thresh(i) and a possibly interrupted (see parameter descent_thresh) +descent of at least rel_thresh(i) will be reported. +rel_thresh must have the same number of samples as x. +A sensible choice would be some measure related to the +global or local variance of the signal x. +if omitted, half the standard deviation of W will be used.

  • +
  • descent_thresh (float) – Descent threshold. during peak candidate verfication, if a slope change +from negative to positive slope occurs at sample i BEFORE the descent has +exceeded rel_thresh(i), and if descent_thresh(i) has not been exceeded yet, +the current peak candidate will be dropped. +this situation corresponds to a secondary peak +occuring shortly after the current candidate peak (which might lead +to a higher peak value)! +| +| The value descent_thresh(i) must not be larger than rel_thresh(i). +| +| descent_thresh must have the same number of samples as x. +a sensible choice would be some measure related to the +global or local variance of the signal x. +if omitted, 0.5*rel_thresh will be used. (Default value = None)

  • +
  • tmin (int) – Index of start sample. peak search will begin at x(tmin). (Default value = None)

  • +
  • tmax (int) – Index of end sample. peak search will end at x(tmax). (Default value = None)

  • +
+
+
Returns
+

peaks (np.nadarray) – Array of peak positions

+
+
+
+ +
+
+libfmp.c6.c6s1_peak_picking.peak_picking_simple(x, threshold=None)[source]
+

Peak picking strategy looking for positions with increase followed by descrease

+

Notebook: C6/C6S1_PeakPicking.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Input function

  • +
  • threshold (float) – Lower threshold for peak to survive

  • +
+
+
Returns
+

peaks (np.ndarray) – Array containing peak positions

+
+
+
+ +
+
+libfmp.c6.c6s2_tempo_analysis.compute_autocorrelation_local(x, Fs, N, H, norm_sum=True)[source]
+

Compute local autocorrelation [FMP, Section 6.2.3]

+

Notebook: C6/C6S2_TempogramAutocorrelation.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Input signal

  • +
  • Fs (scalar) – Sampling rate

  • +
  • N (int) – Window length

  • +
  • H (int) – Hop size

  • +
  • norm_sum (bool) – Normalizes by the number of summands in local autocorrelation (Default value = True)

  • +
+
+
Returns
+
    +
  • A (np.ndarray) – Time-lag representation

  • +
  • T_coef (np.ndarray) – Time axis (seconds)

  • +
  • F_coef_lag (np.ndarray) – Lag axis

  • +
+
+
+
+ +
+
+libfmp.c6.c6s2_tempo_analysis.compute_cyclic_tempogram(tempogram, F_coef_BPM, tempo_ref=30, octave_bin=40, octave_num=4)[source]
+

Compute cyclic tempogram

+

Notebook: C6/C6S2_TempogramCyclic.ipynb

+
+
Parameters
+
    +
  • tempogram (np.ndarray) – Input tempogram

  • +
  • F_coef_BPM (np.ndarray) – Tempo axis (BPM)

  • +
  • tempo_ref (float) – Reference tempo (BPM) (Default value = 30)

  • +
  • octave_bin (int) – Number of bins per tempo octave (Default value = 40)

  • +
  • octave_num (int) – Number of tempo octaves to be considered (Default value = 4)

  • +
+
+
Returns
+
    +
  • tempogram_cyclic (np.ndarray) – Cyclic tempogram tempogram_cyclic

  • +
  • F_coef_scale (np.ndarray) – Tempo axis with regard to scaling parameter

  • +
  • tempogram_log (np.ndarray) – Tempogram with logarithmic tempo axis

  • +
  • F_coef_BPM_log (np.ndarray) – Logarithmic tempo axis (BPM)

  • +
+
+
+
+ +
+
+libfmp.c6.c6s2_tempo_analysis.compute_plot_tempogram_plp(fn_wav, Fs=22050, N=500, H=10, Theta=np.arange(30, 601), title='', figsize=(8, 4), plot_maxtempo=False)[source]
+

Compute and plot Fourier-based tempogram and PLP function

+

Notebook: C6/C6S3_PredominantLocalPulse.ipynb

+
+
Parameters
+
    +
  • fn_wav – Filename of audio file

  • +
  • Fs – Sample rate (Default value = 22050)

  • +
  • N – Window size (Default value = 500)

  • +
  • H – Hop size (Default value = 10)

  • +
  • Theta – Set of tempi (given in BPM) (Default value = np.arange(30, 601))

  • +
  • title – Title of figure (Default value = ‘’)

  • +
  • figsize – Figure size (Default value = (8, 4))

  • +
  • plot_maxtempo – Visualize tempo with greatest coefficients in tempogram (Default value = False)

  • +
+
+
+
+ +
+
+libfmp.c6.c6s2_tempo_analysis.compute_plp(X, Fs, L, N, H, Theta)[source]
+

Compute windowed sinusoid with optimal phase

+

Notebook: C6/C6S3_PredominantLocalPulse.ipynb

+
+
Parameters
+
    +
  • X (np.ndarray) – Fourier-based (complex-valued) tempogram

  • +
  • Fs (scalar) – Sampling rate

  • +
  • L (int) – Length of novelty curve

  • +
  • N (int) – Window length

  • +
  • H (int) – Hop size

  • +
  • Theta (np.ndarray) – Set of tempi (given in BPM)

  • +
+
+
Returns
+

nov_PLP (np.ndarray) – PLP function

+
+
+
+ +
+
+libfmp.c6.c6s2_tempo_analysis.compute_sinusoid_optimal(c, tempo, n, Fs, N, H)[source]
+

Compute windowed sinusoid with optimal phase

+

Notebook: C6/C6S2_TempogramFourier.ipynb

+
+
Parameters
+
    +
  • c (complex) – Coefficient of tempogram (c=X(k,n))

  • +
  • tempo (float) – Tempo parameter corresponding to c (tempo=F_coef_BPM[k])

  • +
  • n (int) – Frame parameter of c

  • +
  • Fs (scalar) – Sampling rate

  • +
  • N (int) – Window length

  • +
  • H (int) – Hop size

  • +
+
+
Returns
+
    +
  • kernel (np.ndarray) – Windowed sinusoid

  • +
  • t_kernel (np.ndarray) – Time axis (samples) of kernel

  • +
  • t_kernel_sec (np.ndarray) – Time axis (seconds) of kernel

  • +
+
+
+
+ +
+
+libfmp.c6.c6s2_tempo_analysis.compute_tempogram_autocorr(x, Fs, N, H, norm_sum=False, Theta=np.arange(30, 601))[source]
+

Compute autocorrelation-based tempogram

+

Notebook: C6/C6S2_TempogramAutocorrelation.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Input signal

  • +
  • Fs (scalar) – Sampling rate

  • +
  • N (int) – Window length

  • +
  • H (int) – Hop size

  • +
  • norm_sum (bool) – Normalizes by the number of summands in local autocorrelation (Default value = False)

  • +
  • Theta (np.ndarray) – Set of tempi (given in BPM) (Default value = np.arange(30, 601))

  • +
+
+
Returns
+
    +
  • tempogram (np.ndarray) – Tempogram tempogram

  • +
  • T_coef (np.ndarray) – Time axis T_coef (seconds)

  • +
  • F_coef_BPM (np.ndarray) – Tempo axis F_coef_BPM (BPM)

  • +
  • A_cut (np.ndarray) – Time-lag representation A_cut (cut according to Theta)

  • +
  • F_coef_lag_cut (np.ndarray) – Lag axis F_coef_lag_cut

  • +
+
+
+
+ +
+
+libfmp.c6.c6s2_tempo_analysis.compute_tempogram_fourier(x, Fs, N, H, Theta=np.arange(30, 601, 1))[source]
+

Compute Fourier-based tempogram [FMP, Section 6.2.2]

+

Notebook: C6/C6S2_TempogramFourier.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Input signal

  • +
  • Fs (scalar) – Sampling rate

  • +
  • N (int) – Window length

  • +
  • H (int) – Hop size

  • +
  • Theta (np.ndarray) – Set of tempi (given in BPM) (Default value = np.arange(30, 601, 1))

  • +
+
+
Returns
+
    +
  • X (np.ndarray) – Tempogram

  • +
  • T_coef (np.ndarray) – Time axis (seconds)

  • +
  • F_coef_BPM (np.ndarray) – Tempo axis (BPM)

  • +
+
+
+
+ +
+
+libfmp.c6.c6s2_tempo_analysis.plot_signal_kernel(x, t_x, kernel, t_kernel, xlim=None, figsize=(8, 2), title=None)[source]
+

Visualize signal and local kernel

+

Notebook: C6/C6S2_TempogramFourier.ipynb

+
+
Parameters
+
    +
  • x – Signal

  • +
  • t_x – Time axis of x (given in seconds)

  • +
  • kernel – Local kernel

  • +
  • t_kernel – Time axis of kernel (given in seconds)

  • +
  • xlim – Limits for x-axis (Default value = None)

  • +
  • figsize – Figure size (Default value = (8, 2))

  • +
  • title – Title of figure (Default value = None)

  • +
+
+
Returns
+

fig – Matplotlib figure handle

+
+
+
+ +
+
+libfmp.c6.c6s2_tempo_analysis.plot_signal_local_lag(x, t_x, local_lag, t_local_lag, lag, xlim=None, figsize=(8, 1.5), title='')[source]
+

Visualize signal and local lag [FMP, Figure 6.14]

+

Notebook: C6/C6S2_TempogramAutocorrelation.ipynb

+
+
Parameters
+
    +
  • x – Signal

  • +
  • t_x – Time axis of x (given in seconds)

  • +
  • local_lag – Local lag

  • +
  • t_local_lag – Time axis of kernel (given in seconds)

  • +
  • lag – Lag (given in seconds)

  • +
  • xlim – Limits for x-axis (Default value = None)

  • +
  • figsize – Figure size (Default value = (8, 1.5))

  • +
  • title – Title of figure (Default value = ‘’)

  • +
+
+
Returns
+

fig – Matplotlib figure handle

+
+
+
+ +
+
+libfmp.c6.c6s2_tempo_analysis.set_yticks_tempogram_cyclic(ax, octave_bin, F_coef_scale, num_tick=5)[source]
+

Set yticks with regard to scaling parmater

+

Notebook: C6/C6S2_TempogramCyclic.ipynb

+
+
Parameters
+
    +
  • ax (mpl.axes.Axes) – Figure axis

  • +
  • octave_bin (int) – Number of bins per tempo octave

  • +
  • F_coef_scale (np.ndarra) – Tempo axis with regard to scaling parameter

  • +
  • num_tick (int) – Number of yticks (Default value = 5)

  • +
+
+
+
+ +
+
+libfmp.c6.c6s3_adaptive_windowing.adaptive_windowing(X, B, neigborhood=1, add_start=False, add_end=False)[source]
+

Apply adaptive windowing [FMP, Section 6.3.3]

+

Notebook: C6/C6S3_AdaptiveWindowing.ipynb

+
+
Parameters
+
    +
  • X (np.ndarray) – Feature sequence

  • +
  • B (np.ndarray) – Beat sequence (spefied in frames)

  • +
  • neigborhood (float) – Parameter specifying relative range considered for windowing (Default value = 1)

  • +
  • add_start (bool) – Add first index of X to beat sequence (if not existent) (Default value = False)

  • +
  • add_end (bool) – Add last index of X to beat sequence (if not existent) (Default value = False)

  • +
+
+
Returns
+
    +
  • X_adapt (np.ndarray) – Feature sequence adapted to beat sequence

  • +
  • B_s (np.ndarray) – Sequence specifying start (in frames) of window sections

  • +
  • B_t (np.ndarray) – Sequence specifying end (in frames) of window sections

  • +
+
+
+
+ +
+
+libfmp.c6.c6s3_adaptive_windowing.compute_plot_adaptive_windowing(x, Fs, H, X, B, neigborhood=1, add_start=False, add_end=False)[source]
+

Compute and plot process for adaptive windowing [FMP, Section 6.3.3]

+

Notebook: C6/C6S3_AdaptiveWindowing.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Signal

  • +
  • Fs (scalar) – Sample Rate

  • +
  • H (int) – Hop size

  • +
  • X (int) – Feature sequence

  • +
  • B (np.ndarray) – Beat sequence (spefied in frames)

  • +
  • neigborhood (float) – Parameter specifying relative range considered for windowing (Default value = 1)

  • +
  • add_start (bool) – Add first index of X to beat sequence (if not existent) (Default value = False)

  • +
  • add_end (bool) – Add last index of X to beat sequence (if not existent) (Default value = False)

  • +
+
+
Returns
+

X_adapt (np.ndarray) – Feature sequence adapted to beat sequence

+
+
+
+ +
+
+libfmp.c6.c6s3_adaptive_windowing.plot_beat_grid(B_sec, ax, color='r', linestyle=':', linewidth=1)[source]
+

Plot beat grid (given in seconds) into axis

+

Notebook: C6/C6S3_AdaptiveWindowing.ipynb

+
+
Parameters
+
    +
  • B_sec – Beat grid

  • +
  • ax – Axes for plotting

  • +
  • color – Color of lines (Default value = ‘r’)

  • +
  • linestyle – Style of lines (Default value = ‘:’)

  • +
  • linewidth – Width of lines (Default value = 1)

  • +
+
+
+
+ +
+
+libfmp.c6.c6s3_beat_tracking.beat_period_to_tempo(beat, Fs)[source]
+

Convert beat period (samples) to tempo (BPM) [FMP, Section 6.3.2]

+

Notebook: C6/C6S3_BeatTracking.ipynb

+
+
Parameters
+
    +
  • beat (int) – Beat period (samples)

  • +
  • Fs (scalar) – Sample rate

  • +
+
+
Returns
+

tempo (float) – Tempo (BPM)

+
+
+
+ +
+
+libfmp.c6.c6s3_beat_tracking.compute_beat_sequence(novelty, beat_ref, penalty=None, factor=1.0, return_all=False)[source]
+
+
Compute beat sequence using dynamic programming [FMP, Section 6.3.2]
+
Note: Concatenation of ‘0’ because of Python indexing conventions
+
+

Notebook: C6/C6S3_BeatTracking.ipynb

+
+
Parameters
+
    +
  • novelty (np.ndarray) – Novelty function

  • +
  • beat_ref (int) – Reference beat period

  • +
  • penalty (np.ndarray) – Penalty function (Default value = None)

  • +
  • factor (float) – Weight parameter for adjusting the penalty (Default value = 1.0)

  • +
  • return_all (bool) – Return details (Default value = False)

  • +
+
+
Returns
+
    +
  • B (np.ndarray) – Optimal beat sequence

  • +
  • D (np.ndarray) – Accumulated score

  • +
  • P (np.ndarray) – Maximization information

  • +
+
+
+
+ +
+
+libfmp.c6.c6s3_beat_tracking.compute_penalty(N, beat_ref)[source]
+
+
Compute penalty funtion used for beat tracking [FMP, Section 6.3.2]
+
Note: Concatenation of ‘0’ because of Python indexing conventions
+
+

Notebook: C6/C6S3_BeatTracking.ipynb

+
+
Parameters
+
    +
  • N (int) – Length of vector representing penalty function

  • +
  • beat_ref (int) – Reference beat period (given in samples)

  • +
+
+
Returns
+

penalty (np.ndarray) – Penalty function

+
+
+
+ +
+
+libfmp.c6.c6s3_beat_tracking.compute_plot_sonify_beat(x, Fs, nov, Fs_nov, beat_ref, factor, title=None, figsize=(6, 2))[source]
+

Compute, plot, and sonfy beat sequence from novelty function [FMP, Section 6.3.2]

+

Notebook: C6/C6S3_BeatTracking.ipynb

+
+
Parameters
+
    +
  • x – Novelty function

  • +
  • Fs – Sample rate

  • +
  • nov – Novelty function

  • +
  • Fs_nov – Rate of novelty function

  • +
  • beat_ref – Reference beat period

  • +
  • factor – Weight parameter for adjusting the penalty

  • +
  • title – Title of figure (Default value = None)

  • +
  • figsize – Size of figure (Default value = (6, 2))

  • +
+
+
+
+ +
+ + +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/index_c7.html b/docs/build/html/index_c7.html new file mode 100644 index 0000000..cb43111 --- /dev/null +++ b/docs/build/html/index_c7.html @@ -0,0 +1,852 @@ + + + + + + + + + + Content-Based Audio Retrieval (libfmp.c7) — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Content-Based Audio Retrieval (libfmp.c7)
  • + + +
  • + + + View page source + + +
  • + +
+ + +
+
+
+
+ +
+

Content-Based Audio Retrieval (libfmp.c7)

+

The FMP notebooks provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL:

+

https://www.audiolabs-erlangen.de/resources/MIR/FMP/C7/C7.html

+
+
+libfmp.c7.c7s1_audio_id.compute_constellation_map(Y, dist_freq=7, dist_time=7, thresh=0.01)[source]
+

Compute constellation map (implementation using image processing)

+

Notebook: C7/C7S1_AudioIdentification.ipynb

+
+
Parameters
+
    +
  • Y (np.ndarray) – Spectrogram (magnitude)

  • +
  • dist_freq (int) – Neighborhood parameter for frequency direction (kappa) (Default value = 7)

  • +
  • dist_time (int) – Neighborhood parameter for time direction (tau) (Default value = 7)

  • +
  • thresh (float) – Threshold parameter for minimal peak magnitude (Default value = 0.01)

  • +
+
+
Returns
+

Cmap (np.ndarray) – Boolean mask for peak structure (same size as Y)

+
+
+
+ +
+
+libfmp.c7.c7s1_audio_id.compute_constellation_map_naive(Y, dist_freq=7, dist_time=7, thresh=0.01)[source]
+

Compute constellation map (naive implementation)

+

Notebook: C7/C7S1_AudioIdentification.ipynb

+
+
Parameters
+
    +
  • Y (np.ndarray) – Spectrogram (magnitude)

  • +
  • dist_freq (int) – Neighborhood parameter for frequency direction (kappa) (Default value = 7)

  • +
  • dist_time (int) – Neighborhood parameter for time direction (tau) (Default value = 7)

  • +
  • thresh (float) – Threshold parameter for minimal peak magnitude (Default value = 0.01)

  • +
+
+
Returns
+

Cmap (np.ndarray) – Boolean mask for peak structure (same size as Y)

+
+
+
+ +
+
+libfmp.c7.c7s1_audio_id.compute_matching_function(C_D, C_Q, tol_freq=1, tol_time=1)[source]
+

Computes matching function for constellation maps

+

Notebook: C7/C7S1_AudioIdentification.ipynb

+
+
Parameters
+
    +
  • C_D (np.ndarray) – Binary matrix used as dababase document

  • +
  • C_Q (np.ndarray) – Binary matrix used as query document

  • +
  • tol_freq (int) – Tolerance in frequency direction (vertical) (Default value = 1)

  • +
  • tol_time (int) – Tolerance in time direction (horizontal) (Default value = 1)

  • +
+
+
Returns
+
    +
  • Delta (np.ndarray) – Matching function

  • +
  • shift_max (int) – Optimal shift position maximizing Delta

  • +
+
+
+
+ +
+
+libfmp.c7.c7s1_audio_id.match_binary_matrices_tol(C_ref, C_est, tol_freq=0, tol_time=0)[source]
+
+
Compare binary matrices with tolerance
+
Note: The tolerance parameters should be smaller than the minimum distance of +peaks (1-entries in C_ref ad C_est) to obtain meaningful TP, FN, FP values
+
+

Notebook: C7/C7S1_AudioIdentification.ipynb

+
+
Parameters
+
    +
  • C_ref (np.ndarray) – Binary matrix used as reference

  • +
  • C_est (np.ndarray) – Binary matrix used as estimation

  • +
  • tol_freq (int) – Tolerance in frequency direction (vertical) (Default value = 0)

  • +
  • tol_time (int) – Tolerance in time direction (horizontal) (Default value = 0)

  • +
+
+
Returns
+
    +
  • TP (int) – True positives

  • +
  • FN (int) – False negatives

  • +
  • FP (int) – False positives

  • +
  • C_AND (np.ndarray) – Boolean mask of AND of C_ref and C_est (with tolerance)

  • +
+
+
+
+ +
+
+libfmp.c7.c7s1_audio_id.plot_constellation_map(Cmap, Y=None, xlim=None, ylim=None, title='', xlabel='Time (sample)', ylabel='Frequency (bins)', s=5, color='r', marker='o', figsize=(7, 3), dpi=72)[source]
+

Plot constellation map

+

Notebook: C7/C7S1_AudioIdentification.ipynb

+
+
Parameters
+
    +
  • Cmap – Constellation map given as boolean mask for peak structure

  • +
  • Y – Spectrogram representation (Default value = None)

  • +
  • xlim – Limits for x-axis (Default value = None)

  • +
  • ylim – Limits for y-axis (Default value = None)

  • +
  • title – Title for plot (Default value = ‘’)

  • +
  • xlabel – Label for x-axis (Default value = ‘Time (sample)’)

  • +
  • ylabel – Label for y-axis (Default value = ‘Frequency (bins)’)

  • +
  • s – Size of dots in scatter plot (Default value = 5)

  • +
  • color – Color used for scatter plot (Default value = ‘r’)

  • +
  • marker – Marker for peaks (Default value = ‘o’)

  • +
  • figsize – Width, height in inches (Default value = (7, 3))

  • +
  • dpi – Dots per inch (Default value = 72)

  • +
+
+
Returns
+
    +
  • fig – The created matplotlib figure

  • +
  • ax – The used axes.

  • +
  • im – The image plot

  • +
+
+
+
+ +
+
+libfmp.c7.c7s2_audio_matching.compute_accumulated_cost_matrix_subsequence_dtw(C)[source]
+

Given the cost matrix, compute the accumulated cost matrix for +subsequence dynamic time warping with step sizes {(1, 0), (0, 1), (1, 1)}

+

Notebook: C7/C7S2_SubsequenceDTW.ipynb

+
+
Parameters
+

C (np.ndarray) – Cost matrix

+
+
Returns
+

D (np.ndarray) – Accumulated cost matrix

+
+
+
+ +
+
+libfmp.c7.c7s2_audio_matching.compute_accumulated_cost_matrix_subsequence_dtw_21(C)[source]
+

Given the cost matrix, compute the accumulated cost matrix for +subsequence dynamic time warping with step sizes {(1, 1), (2, 1), (1, 2)}

+

Notebook: C7/C7S2_SubsequenceDTW.ipynb

+
+
Parameters
+

C (np.ndarray) – Cost matrix

+
+
Returns
+

D (np.ndarray) – Accumulated cost matrix

+
+
+
+ +
+
+libfmp.c7.c7s2_audio_matching.compute_cens_from_chromagram(C, Fs=1, ell=41, d=10, quant=True)[source]
+

Compute CENS features from chromagram

+

Notebook: C7/C7S2_CENS.ipynb

+
+
Parameters
+
    +
  • C (np.ndarray) – Input chromagram

  • +
  • Fs (scalar) – Feature rate of chromagram (Default value = 1)

  • +
  • ell (int) – Smoothing length (Default value = 41)

  • +
  • d (int) – Downsampling factor (Default value = 10)

  • +
  • quant (bool) – Apply quantization (Default value = True)

  • +
+
+
Returns
+
    +
  • C_CENS (np.ndarray) – CENS features

  • +
  • Fs_CENS (scalar) – Feature rate of CENS features

  • +
+
+
+
+ +
+
+libfmp.c7.c7s2_audio_matching.compute_cens_from_file(fn_wav, Fs=22050, N=4410, H=2205, ell=21, d=5)[source]
+

Compute CENS features from file

+

Notebook: C7/C7S2_AudioMatching.ipynb

+
+
Parameters
+
    +
  • fn_wav (str) – Filename of wav file

  • +
  • Fs (scalar) – Feature rate of wav file (Default value = 22050)

  • +
  • N (int) – Window size for STFT (Default value = 4410)

  • +
  • H (int) – Hope size for STFT (Default value = 2205)

  • +
  • ell (int) – Smoothing length (Default value = 21)

  • +
  • d (int) – Downsampling factor (Default value = 5)

  • +
+
+
Returns
+
    +
  • X_CENS (np.ndarray) – CENS features

  • +
  • L (int) – Length of CENS feature sequence

  • +
  • Fs_CENS (scalar) – Feature rate of CENS features

  • +
  • x_duration (float) – Duration (seconds) of wav file

  • +
+
+
+
+ +
+
+libfmp.c7.c7s2_audio_matching.compute_matching_function_dtw(X, Y, stepsize=2)[source]
+

Compute CENS features from file

+

Notebook: C7/C7S2_AudioMatching.ipynb

+
+
Parameters
+
    +
  • X (np.ndarray) – Query feature sequence (given as K x N matrix)

  • +
  • Y (np.ndarray) – Database feature sequence (given as K x M matrix)

  • +
  • stepsize (int) – Parameter for step size condition (1 or 2) (Default value = 2)

  • +
+
+
Returns
+
    +
  • Delta (np.ndarray) – DTW-based matching function

  • +
  • C (np.ndarray) – Cost matrix

  • +
  • D (np.ndarray) – Accumulated cost matrix

  • +
+
+
+
+ +
+
+libfmp.c7.c7s2_audio_matching.compute_matching_function_dtw_ti(X, Y, cyc=np.arange(12), stepsize=2)[source]
+

Compute transposition-invariant matching function

+

Notebook: C7/C7S2_AudioMatching.ipynb

+
+
Parameters
+
    +
  • X (np.ndarray) – Query feature sequence (given as K x N matrix)

  • +
  • Y (np.ndarray) – Database feature sequence (given as K x M matrix)

  • +
  • cyc (np.nda(rray) – Set of cyclic shift indices to be considered (Default value = np.arange(12))

  • +
  • stepsize (int) – Parameter for step size condition (1 or 2) (Default value = 2)

  • +
+
+
Returns
+
    +
  • Delta_TI (np.ndarray) – Transposition-invariant matching function

  • +
  • Delta_ind (np.ndarray) – Cost-minimizing indices

  • +
  • Delta_cyc (np.ndarray) – Array containing all matching functions

  • +
+
+
+
+ +
+
+libfmp.c7.c7s2_audio_matching.compute_optimal_warping_path_subsequence_dtw(D, m=- 1)[source]
+

Given an accumulated cost matrix, compute the warping path for +subsequence dynamic time warping with step sizes {(1, 0), (0, 1), (1, 1)}

+

Notebook: C7/C7S2_SubsequenceDTW.ipynb

+
+
Parameters
+
    +
  • D (np.ndarray) – Accumulated cost matrix

  • +
  • m (int) – Index to start back tracking; if set to -1, optimal m is used (Default value = -1)

  • +
+
+
Returns
+

P (np.ndarray) – Optimal warping path (array of index pairs)

+
+
+
+ +
+
+libfmp.c7.c7s2_audio_matching.compute_optimal_warping_path_subsequence_dtw_21(D, m=- 1)[source]
+

Given an accumulated cost matrix, compute the warping path for +subsequence dynamic time warping with step sizes {(1, 1), (2, 1), (1, 2)}

+

Notebook: C7/C7S2_SubsequenceDTW.ipynb

+
+
Parameters
+
    +
  • D (np.ndarray) – Accumulated cost matrix

  • +
  • m (int) – Index to start back tracking; if set to -1, optimal m is used (Default value = -1)

  • +
+
+
Returns
+

P (np.ndarray) – Optimal warping path (array of index pairs)

+
+
+
+ +
+
+libfmp.c7.c7s2_audio_matching.cost_matrix_dot(X, Y)[source]
+

Computes cost matrix via dot product

+

Notebook: C7/C7S2_DiagonalMatching.ipynb

+
+
Parameters
+
    +
  • X (np.ndarray) – First sequence (K x N matrix)

  • +
  • Y (np.ndarray) – Second sequence (K x M matrix)

  • +
+
+
Returns
+

C (np.ndarray) – Cost matrix

+
+
+
+ +
+
+libfmp.c7.c7s2_audio_matching.matches_diag(pos, Delta_N)[source]
+

Derives matches from positions in the case of diagonal matching

+

Notebook: C7/C7S2_DiagonalMatching.ipynb

+
+
Parameters
+
    +
  • pos (np.ndarray or list) – Starting positions of matches

  • +
  • Delta_N (int or np.ndarray or list) – Length of match (a single number or a list of same length as Delta)

  • +
+
+
Returns
+

matches (np.ndarray) – Array containing matches (start, end)

+
+
+
+ +
+
+libfmp.c7.c7s2_audio_matching.matches_dtw(pos, D, stepsize=2)[source]
+

Derives matches from positions for DTW-based strategy

+

Notebook: C7/C7S2_AudioMatching.ipynb

+
+
Parameters
+
    +
  • pos (np.ndarray) – End positions of matches

  • +
  • D (np.ndarray) – Accumulated cost matrix

  • +
  • stepsize (int) – Parameter for step size condition (1 or 2) (Default value = 2)

  • +
+
+
Returns
+

matches (np.ndarray) – Array containing matches (start, end)

+
+
+
+ +
+
+libfmp.c7.c7s2_audio_matching.matching_function_diag(C, cyclic=False)[source]
+

Computes diagonal matching function

+

Notebook: C7/C7S2_DiagonalMatching.ipynb

+
+
Parameters
+
    +
  • C (np.ndarray) – Cost matrix

  • +
  • cyclic (bool) – If “True” then matching is done cyclically (Default value = False)

  • +
+
+
Returns
+

Delta (np.ndarray) – Matching function

+
+
+
+ +
+
+libfmp.c7.c7s2_audio_matching.matching_function_diag_multiple(X, Y, tempo_rel_set=[1], cyclic=False)[source]
+

Computes diagonal matching function using multiple query strategy

+

Notebook: C7/C7S2_DiagonalMatching.ipynb

+
+
Parameters
+
    +
  • X (np.ndarray) – First sequence (K x N matrix)

  • +
  • Y (np.ndarray) – Second sequence (K x M matrix)

  • +
  • tempo_rel_set (np.ndarray) – Set of relative tempo values (scaling) (Default value = [1])

  • +
  • cyclic (bool) – If “True” then matching is done cyclically (Default value = False)

  • +
+
+
Returns
+
    +
  • Delta_min (np.ndarray) – Matching function (obtained by from minimizing over several matching functions)

  • +
  • Delta_N (np.ndarray) – Query length of best match for each time position

  • +
  • Delta_scale (np.ndarray) – Set of matching functions (for each of the scaled versions of the query)

  • +
+
+
+
+ +
+
+libfmp.c7.c7s2_audio_matching.mininma_from_matching_function(Delta, rho=2, tau=0.2, num=None)[source]
+

Derives local minima positions of matching function in an iterative fashion

+

Notebook: C7/C7S2_DiagonalMatching.ipynb

+
+
Parameters
+
    +
  • Delta (np.ndarray) – Matching function

  • +
  • rho (int) – Parameter to exclude neighborhood of a matching position for subsequent matches (Default value = 2)

  • +
  • tau (float) – Threshold for maximum Delta value allowed for matches (Default value = 0.2)

  • +
  • num (int) – Maximum number of matches (Default value = None)

  • +
+
+
Returns
+

pos (np.ndarray) – Array of local minima

+
+
+
+ +
+
+libfmp.c7.c7s2_audio_matching.plot_matches(ax, matches, Delta, Fs=1, alpha=0.2, color='r', s_marker='o', t_marker='')[source]
+

Plots matches into existing axis

+

Notebook: C7/C7S2_DiagonalMatching.ipynb

+
+
Parameters
+
    +
  • ax – Axis

  • +
  • matches – Array of matches (start, end)

  • +
  • Delta – Matching function

  • +
  • Fs – Feature rate (Default value = 1)

  • +
  • alpha – Transparency pramaeter for match visualization (Default value = 0.2)

  • +
  • color – Color used to indicated matches (Default value = ‘r’)

  • +
  • s_marker – Marker used to indicate start of matches (Default value = ‘o’)

  • +
  • t_marker – Marker used to indicate end of matches (Default value = ‘’)

  • +
+
+
+
+ +
+
+libfmp.c7.c7s2_audio_matching.quantize_matrix(C, quant_fct=None)[source]
+

Quantize matrix values in a logarithmic manner (as done for CENS features)

+

Notebook: C7/C7S2_CENS.ipynb

+
+
Parameters
+
    +
  • C (np.ndarray) – Input matrix

  • +
  • quant_fct (list) – List specifying the quantization function (Default value = None)

  • +
+
+
Returns
+

C_quant (np.ndarray) – Output matrix

+
+
+
+ +
+
+libfmp.c7.c7s2_audio_matching.scale_tempo_sequence(X, factor=1)[source]
+

Scales a sequence (given as feature matrix) along time (second dimension)

+

Notebook: C7/C7S2_DiagonalMatching.ipynb

+
+
Parameters
+
    +
  • X (np.ndarray) – Feature sequences (given as K x N matrix)

  • +
  • factor (float) – Scaling factor (resulting in length “round(factor * N)””) (Default value = 1)

  • +
+
+
Returns
+
    +
  • X_new (np.ndarray) – Scaled feature sequence

  • +
  • N_new (int) – Length of scaled feature sequence

  • +
+
+
+
+ +
+
+libfmp.c7.c7s3_version_id.compute_accumulated_score_matrix_common_subsequence(S)[source]
+

Given the score matrix, compute the accumulated score matrix +for common subsequence matching with step sizes {(1, 0), (0, 1), (1, 1)}

+

Notebook: C7/C7S3_CommonSubsequence.ipynb

+
+
Parameters
+

S (np.ndarray) – Score matrix

+
+
Returns
+

D (np.ndarray) – Accumulated score matrix

+
+
+
+ +
+
+libfmp.c7.c7s3_version_id.compute_optimal_path_common_subsequence(D, cellmax=True, n=0, m=0)[source]
+

Given an accumulated score matrix, compute the score-maximizing path +for common subsequence matching with step sizes {(1, 0), (0, 1), (1, 1)}

+

Notebook: C7/C7S3_CommonSubsequence.ipynb

+
+
Parameters
+
    +
  • D (np.ndarray) – Accumulated score matrix

  • +
  • cellmax (bool) – If “True”, score-maximizing cell will be computed (Default value = True)

  • +
  • n (int) – Index (first axis) of cell for backtracking start; only used when cellmax=False (Default value = 0)

  • +
  • m (int) – Index (second axis) of cell for backtracking start; only used when cellmax=False (Default value = 0)

  • +
+
+
Returns
+

P (np.ndarray) – Score-maximizing path (array of index pairs)

+
+
+
+ +
+
+libfmp.c7.c7s3_version_id.compute_partial_matching(S)[source]
+

Given the score matrix, compute the accumulated score matrix +for partial matching

+

Notebook: C7/C7S3_CommonSubsequence.ipynb

+
+
Parameters
+

S (np.ndarray) – Score matrix

+
+
Returns
+
    +
  • D (np.ndarray) – Accumulated score matrix

  • +
  • P (np.ndarray) – Partial match (array of index pairs)

  • +
+
+
+
+ +
+
+libfmp.c7.c7s3_version_id.compute_prf_metrics(I, score, I_Q)[source]
+

Compute precision, recall, F-measures and other +evaluation metrics for document-level retrieval

+

Notebook: C7/C7S3_Evaluation.ipynb

+
+
Parameters
+
    +
  • I (np.ndarray) – Array of items

  • +
  • score (np.ndarray) – Array containing the score values of the times

  • +
  • I_Q (np.ndarray) – Array of relevant (positive) items

  • +
+
+
Returns
+
    +
  • P_Q (float) – Precision

  • +
  • R_Q (float) – Recall

  • +
  • F_Q (float) – F-measures sorted by rank

  • +
  • BEP (float) – Break-even point

  • +
  • F_max (float) – Maximal F-measure

  • +
  • P_average (float) – Mean average

  • +
  • X_Q (np.ndarray) – Relevance function

  • +
  • rank (np.ndarray) – Array of rank values

  • +
  • I_sorted (np.ndarray) – Array of items sorted by rank

  • +
  • rank_sorted (np.ndarray) – Array of rank values sorted by rank

  • +
+
+
+
+ +
+
+libfmp.c7.c7s3_version_id.compute_sm_from_wav(x1, x2, Fs, N=4410, H=2205, ell=21, d=5, L_smooth=12, tempo_rel_set=np.array([0.66, 0.81, 1, 1.22, 1.5]), shift_set=np.array([0]), strategy='relative', scale=True, thresh=0.15, penalty=- 2.0, binarize=False)[source]
+

Compute a similarity matrix (SM)

+

Notebook: C7/C7S3_VersionIdentification.ipynb

+
+
Parameters
+
    +
  • x1 (np.ndarray) – First signal

  • +
  • x2 (np.ndarray) – Second signal

  • +
  • Fs (scalar) – Sampling rate of WAV files

  • +
  • N (int) – Window size for computing STFT-based chroma features (Default value = 4410)

  • +
  • H (int) – Hop size for computing STFT-based chroma features (Default value = 2205)

  • +
  • ell (int) – Smoothing length for computing CENS features (Default value = 21)

  • +
  • d (int) – Downsampling factor for computing CENS features (Default value = 5)

  • +
  • L_smooth (int) – Length of filter for enhancing SM (Default value = 12)

  • +
  • tempo_rel_set (np.ndarray) – Set of relative tempo values for enhancing SM +(Default value = np.array([0.66, 0.81, 1, 1.22, 1.5]))

  • +
  • shift_set (np.ndarray) – Set of shift indices for enhancing SM (Default value = np.array([0]))

  • +
  • strategy (str) – Thresholding strategy for thresholding SM (‘absolute’, ‘relative’, ‘local’) +(Default value = ‘relative’)

  • +
  • scale (bool) – If scale=True, then scaling of positive values to range [0,1] for thresholding SM +(Default value = True)

  • +
  • thresh (float) – Treshold (meaning depends on strategy) (Default value = 0.15)

  • +
  • penalty (float) – Set values below treshold to value specified (Default value = -2.0)

  • +
  • binarize (bool) – Binarizes final matrix (positive: 1; otherwise: 0) (Default value = False)

  • +
+
+
Returns
+
    +
  • X (np.ndarray) – CENS feature sequence for first signal

  • +
  • Y (np.ndarray) – CENS feature sequence for second signal

  • +
  • Fs_feature (scalar) – Feature rate

  • +
  • S_thresh (np.ndarray) – Similarity matrix

  • +
  • I (np.ndarray) – Index matrix

  • +
+
+
+
+ +
+
+libfmp.c7.c7s3_version_id.get_induced_segments(P)[source]
+

Given a path, compute the induces segments

+

Notebook: C7/C7S3_CommonSubsequence.ipynb

+
+
Parameters
+

P (np.ndarray) – Path (list of index pairs)

+
+
Returns
+
    +
  • seg_X (np.ndarray) – Induced segment of first sequence

  • +
  • seg_Y (np.ndarray) – Induced segment of second sequence

  • +
+
+
+
+ +
+ + +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/index_c8.html b/docs/build/html/index_c8.html new file mode 100644 index 0000000..066b0e6 --- /dev/null +++ b/docs/build/html/index_c8.html @@ -0,0 +1,1155 @@ + + + + + + + + + + Musically Informed Audio Decomposition (libfmp.c8) — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Musically Informed Audio Decomposition (libfmp.c8)
  • + + +
  • + + + View page source + + +
  • + +
+ + +
+
+
+
+ +
+

Musically Informed Audio Decomposition (libfmp.c8)

+

The FMP notebooks provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL:

+

https://www.audiolabs-erlangen.de/resources/MIR/FMP/C8/C8.html

+
+
+libfmp.c8.c8s1_hps.convert_l_hertz_to_bins(L_p_Hz, Fs=22050, N=1024, H=512)[source]
+

Convert filter length parameter from Hertz to frequency bins

+

Notebook: C8/C8S1_HPS.ipynb

+
+
Parameters
+
    +
  • L_p_Hz (float) – Filter length (in Hertz)

  • +
  • Fs (scalar) – Sample rate (Default value = 22050)

  • +
  • N (int) – Window size (Default value = 1024)

  • +
  • H (int) – Hop size (Default value = 512)

  • +
+
+
Returns
+

L_p (int) – Filter length (in frequency bins)

+
+
+
+ +
+
+libfmp.c8.c8s1_hps.convert_l_sec_to_frames(L_h_sec, Fs=22050, N=1024, H=512)[source]
+

Convert filter length parameter from seconds to frame indices

+

Notebook: C8/C8S1_HPS.ipynb

+
+
Parameters
+
    +
  • L_h_sec (float) – Filter length (in seconds)

  • +
  • Fs (scalar) – Sample rate (Default value = 22050)

  • +
  • N (int) – Window size (Default value = 1024)

  • +
  • H (int) – Hop size (Default value = 512)

  • +
+
+
Returns
+

L_h (int) – Filter length (in samples)

+
+
+
+ +
+
+libfmp.c8.c8s1_hps.experiment_hps_parameter(fn_wav, param_list)[source]
+

Script for running an HPS experiment over a parameter list, such as [[1024, 256, 0.1, 100], ...]

+

Notebook: C8/C8S1_HPS.ipynb

+
+
Parameters
+
    +
  • fn_wav (str) – Path to wave file

  • +
  • param_list (list) – List of parameters

  • +
+
+
+
+ +
+
+libfmp.c8.c8s1_hps.experiment_hrps_parameter(fn_wav, param_list)[source]
+

Script for running an HRPS experiment over a parameter list, such as [[1024, 256, 0.1, 100], ...]

+
+
Parameters
+
    +
  • fn_wav (str) – Path to wave file

  • +
  • param_list (list) – List of parameters

  • +
+
+
+
+ +
+
+libfmp.c8.c8s1_hps.generate_audio_tag_html_list(list_x, Fs, width='150', height='40')[source]
+

Generates audio tag for html needed to be shown in table

+

Notebook: C8/C8S1_HPS.ipynb

+
+
Parameters
+
    +
  • list_x (list) – List of waveforms

  • +
  • Fs (scalar) – Sample rate

  • +
  • width (str) – Width in px (Default value = ‘150’)

  • +
  • height (str) – Height in px (Default value = ‘40’)

  • +
+
+
Returns
+

audio_tag_html_list (list) – List of HTML strings with audio tags

+
+
+
+ +
+
+libfmp.c8.c8s1_hps.hps(x, Fs, N, H, L_h, L_p, L_unit='physical', mask='binary', eps=0.001, detail=False)[source]
+

Harmonic-percussive separation (HPS) algorithm

+

Notebook: C8/C8S1_HPS.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Input signal

  • +
  • Fs (scalar) – Sampling rate of x

  • +
  • N (int) – Frame length

  • +
  • H (int) – Hopsize

  • +
  • L_h (float) – Horizontal median filter length given in seconds or frames

  • +
  • L_p (float) – Percussive median filter length given in Hertz or bins

  • +
  • L_unit (str) – Adjusts unit, either ‘pyhsical’ or ‘indices’ (Default value = ‘physical’)

  • +
  • mask (str) – Either ‘binary’ or ‘soft’ (Default value = ‘binary’)

  • +
  • eps (float) – Parameter used in soft maskig (Default value = 0.001)

  • +
  • detail (bool) – Returns detailed information (Default value = False)

  • +
+
+
Returns
+
    +
  • x_h (np.ndarray) – Harmonic signal

  • +
  • x_p (np.ndarray) – Percussive signal

  • +
  • details (dict) – Dictionary containing detailed information; returned if detail=True

  • +
+
+
+
+ +
+
+libfmp.c8.c8s1_hps.hrps(x, Fs, N, H, L_h, L_p, beta=2.0, L_unit='physical', detail=False)[source]
+

Harmonic-residual-percussive separation (HRPS) algorithm

+

Notebook: C8/C8S1_HRPS.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Input signal

  • +
  • Fs (scalar) – Sampling rate of x

  • +
  • N (int) – Frame length

  • +
  • H (int) – Hopsize

  • +
  • L_h (float) – Horizontal median filter length given in seconds or frames

  • +
  • L_p (float) – Percussive median filter length given in Hertz or bins

  • +
  • beta (float) – Separation factor (Default value = 2.0)

  • +
  • L_unit (str) – Adjusts unit, either ‘pyhsical’ or ‘indices’ (Default value = ‘physical’)

  • +
  • detail (bool) – Returns detailed information (Default value = False)

  • +
+
+
Returns
+
    +
  • x_h (np.ndarray) – Harmonic signal

  • +
  • x_p (np.ndarray) – Percussive signal

  • +
  • x_r (np.ndarray) – Residual signal

  • +
  • details (dict) – Dictionary containing detailed information; returned if “detail=True”

  • +
+
+
+
+ +
+
+libfmp.c8.c8s1_hps.make_integer_odd(n)[source]
+

Convert integer into odd integer

+

Notebook: C8/C8S1_HPS.ipynb

+
+
Parameters
+

n (int) – Integer

+
+
Returns
+

n (int) – Odd integer

+
+
+
+ +
+
+libfmp.c8.c8s1_hps.median_filter_horizontal(x, filter_len)[source]
+

Apply median filter in horizontal direction

+

Notebook: C8/C8S1_HPS.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Input matrix

  • +
  • filter_len (int) – Filter length

  • +
+
+
Returns
+

x_h (np.ndarray) – Filtered matrix

+
+
+
+ +
+
+libfmp.c8.c8s1_hps.median_filter_vertical(x, filter_len)[source]
+

Apply median filter in vertical direction

+

Notebook: C8/C8S1_HPS.ipynb

+
+
Parameters
+
    +
  • x – Input matrix

  • +
  • filter_len (int) – Filter length

  • +
+
+
Returns
+

x_p (np.ndarray) – Filtered matrix

+
+
+
+ +
+
+libfmp.c8.c8s2_f0.cents_to_hz(F_cent, F_ref=55.0)[source]
+

Converts frequency in cents to Hz

+

Notebook: C8/C8S2_FundFreqTracking.ipynb

+
+
Parameters
+
    +
  • F_cent (float or np.ndarray) – Frequency in cents

  • +
  • F_ref (float) – Reference frequency in Hz (Default value = 55.0)

  • +
+
+
Returns
+

F (float or np.ndarray) – Frequency in Hz

+
+
+
+ +
+
+libfmp.c8.c8s2_f0.compute_traj_from_audio(x, Fs=22050, N=1024, H=128, R=10.0, F_min=55.0, F_max=1760.0, num_harm=10, freq_smooth_len=11, alpha=0.9, gamma=0.0, constraint_region=None, tol=5, score_low=0.01, score_high=1.0)[source]
+

Compute F0 contour from audio signal

+

Notebook: C8/C8S2_FundFreqTracking.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Audio signal

  • +
  • Fs (scalar) – Sampling frequency (Default value = 22050)

  • +
  • N (int) – Window length in samples (Default value = 1024)

  • +
  • H (int) – Hopsize in samples (Default value = 128)

  • +
  • R (float) – Frequency resolution in cents (Default value = 10.0)

  • +
  • F_min (float) – Lower frequency bound (reference frequency) (Default value = 55.0)

  • +
  • F_max (float) – Upper frequency bound (Default value = 1760.0)

  • +
  • num_harm (int) – Number of harmonics (Default value = 10)

  • +
  • freq_smooth_len (int) – Filter length for vertical smoothing (Default value = 11)

  • +
  • alpha (float) – Weighting parameter for harmonics (Default value = 0.9)

  • +
  • gamma (float) – Logarithmic compression factor (Default value = 0.0)

  • +
  • constraint_region (np.ndarray) – Constraint regions, row-format: (t_start_sec, t_end_sec, f_start_hz, f_end,hz) +(Default value = None)

  • +
  • tol (int) – Tolerance parameter for transition matrix (Default value = 5)

  • +
  • score_low (float) – Score (low) for transition matrix (Default value = 0.01)

  • +
  • score_high (float) – Score (high) for transition matrix (Default value = 1.0)

  • +
+
+
Returns
+
    +
  • traj (np.ndarray) – F0 contour, time in seconds in 1st column, frequency in Hz in 2nd column

  • +
  • Z (np.ndarray) – Salience representation

  • +
  • T_coef (np.ndarray) – Time axis

  • +
  • F_coef_hertz (np.ndarray) – Frequency axis in Hz

  • +
  • F_coef_cents (np.ndarray) – Frequency axis in cents

  • +
+
+
+
+ +
+
+libfmp.c8.c8s2_f0.compute_trajectory_cr(Z, T_coef, F_coef_hertz, constraint_region=None, tol=5, score_low=0.01, score_high=1.0)[source]
+

Trajectory tracking with constraint regions

+

Notebook: C8/C8S2_FundFreqTracking.ipynb

+
+
Parameters
+
    +
  • Z (np.ndarray) – Salience representation

  • +
  • T_coef (np.ndarray) – Time axis

  • +
  • F_coef_hertz (np.ndarray) – Frequency axis in Hz

  • +
  • constraint_region (np.ndarray) – Constraint regions, row-format: (t_start_sec, t_end_sec, f_start_hz, f_end_hz) +(Default value = None)

  • +
  • tol (int) – Tolerance parameter for transition matrix (Default value = 5)

  • +
  • score_low (float) – Score (low) for transition matrix (Default value = 0.01)

  • +
  • score_high (float) – Score (high) for transition matrix (Default value = 1.0)

  • +
+
+
Returns
+

eta (np.ndarray) – Trajectory indices, unvoiced frames are indicated with -1

+
+
+
+ +
+
+libfmp.c8.c8s2_f0.compute_trajectory_dp(Z, T)[source]
+

Trajectory tracking using dynamic programming

+

Notebook: C8/C8S2_FundFreqTracking.ipynb

+
+
Parameters
+
    +
  • Z – Salience representation

  • +
  • T – Transisition matrix

  • +
+
+
Returns
+

eta_DP (np.ndarray) – Trajectory indices

+
+
+
+ +
+
+libfmp.c8.c8s2_f0.convert_ann_to_constraint_region(ann, tol_freq_cents=300.0)[source]
+

Convert score annotations to constraint regions

+

Notebook: C8/C8S2_FundFreqTracking.ipynb

+
+
Parameters
+
    +
  • ann (list) – Score annotations [[start_time, end_time, MIDI_pitch], …

  • +
  • tol_freq_cents (float) – Tolerance in pitch directions specified in cents (Default value = 300.0)

  • +
+
+
Returns
+

constraint_region (np.ndarray) – Constraint regions

+
+
+
+ +
+
+libfmp.c8.c8s2_f0.convert_trajectory_to_mask_bin(traj, F_coef, n_harmonics=1, tol_bin=0)[source]
+

Computes binary mask from F0 trajectory

+

Notebook: C8/C8S2_MelodyExtractSep.ipynb

+
+
Parameters
+
    +
  • traj (np.ndarray) – F0 trajectory (time in seconds in 1st column, frequency in Hz in 2nd column)

  • +
  • F_coef (np.ndarray) – Frequency axis

  • +
  • n_harmonics (int) – Number of harmonics (Default value = 1)

  • +
  • tol_bin (int) – Tolerance in frequency bins (Default value = 0)

  • +
+
+
Returns
+

mask (np.ndarray) – Binary mask

+
+
+
+ +
+
+libfmp.c8.c8s2_f0.convert_trajectory_to_mask_cent(traj, F_coef, n_harmonics=1, tol_cent=0.0)[source]
+

Computes binary mask from F0 trajectory

+

Notebook: C8/C8S2_MelodyExtractSep.ipynb

+
+
Parameters
+
    +
  • traj (np.ndarray) – F0 trajectory (time in seconds in 1st column, frequency in Hz in 2nd column)

  • +
  • F_coef (np.ndarray) – Frequency axis

  • +
  • n_harmonics (int) – Number of harmonics (Default value = 1)

  • +
  • tol_cent (float) – Tolerance in cents (Default value = 0.0)

  • +
+
+
Returns
+

mask (np.ndarray) – Binary mask

+
+
+
+ +
+
+libfmp.c8.c8s2_f0.define_transition_matrix(B, tol=0, score_low=0.01, score_high=1.0)[source]
+

Generate transition matrix

+

Notebook: C8/C8S2_FundFreqTracking.ipynb

+
+
Parameters
+
    +
  • B (int) – Number of bins

  • +
  • tol (int) – Tolerance parameter for transition matrix (Default value = 0)

  • +
  • score_low (float) – Score (low) for transition matrix (Default value = 0.01)

  • +
  • score_high (float) – Score (high) for transition matrix (Default value = 1.0)

  • +
+
+
Returns
+

T (np.ndarray) – Transition matrix

+
+
+
+ +
+
+libfmp.c8.c8s2_f0.hz_to_cents(F, F_ref=55.0)[source]
+

Converts frequency in Hz to cents

+

Notebook: C8/C8S2_FundFreqTracking.ipynb

+
+
Parameters
+
    +
  • F (float or np.ndarray) – Frequency value in Hz

  • +
  • F_ref (float) – Reference frequency in Hz (Default value = 55.0)

  • +
+
+
Returns
+

F_cent (float or np.ndarray) – Frequency in cents

+
+
+
+ +
+
+libfmp.c8.c8s2_f0.separate_melody_accompaniment(x, Fs, N, H, traj, n_harmonics=10, tol_cent=50.0)[source]
+

F0-based melody-accompaniement separation

+

Notebook: C8/C8S2_MelodyExtractSep.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Audio signal

  • +
  • Fs (scalar) – Sampling frequency

  • +
  • N (int) – Window size in samples

  • +
  • H (int) – Hopsize in samples

  • +
  • traj (np.ndarray) – F0 traj (time in seconds in 1st column, frequency in Hz in 2nd column)

  • +
  • n_harmonics (int) – Number of harmonics (Default value = 10)

  • +
  • tol_cent (float) – Tolerance in cents (Default value = 50.0)

  • +
+
+
Returns
+
    +
  • x_mel (np.ndarray) – Reconstructed audio signal for melody

  • +
  • x_acc (np.ndarray) – Reconstructed audio signal for accompaniement

  • +
+
+
+
+ +
+
+libfmp.c8.c8s2_f0.sonify_trajectory_with_sinusoid(traj, audio_len, Fs=22050, amplitude=0.3, smooth_len=11)[source]
+

Sonification of trajectory with sinusoidal

+

Notebook: C8/C8S2_FundFreqTracking.ipynb

+
+
Parameters
+
    +
  • traj (np.ndarray) – F0 trajectory (time in seconds, frequency in Hz)

  • +
  • audio_len (int) – Desired audio length in samples

  • +
  • Fs (scalar) – Sampling rate (Default value = 22050)

  • +
  • amplitude (float) – Amplitude (Default value = 0.3)

  • +
  • smooth_len (int) – Length of amplitude smoothing filter (Default value = 11)

  • +
+
+
Returns
+

x_soni (np.ndarray) – Sonification

+
+
+
+ +
+
+libfmp.c8.c8s2_f0.visualize_salience_traj_constraints(Z, T_coef, F_coef_cents, F_ref=55.0, colorbar=True, cmap='gray_r', figsize=(7, 4), traj=None, constraint_region=None, ax=None)[source]
+

Visualize salience representation with optional F0-trajectory and constraint regions

+

Notebook: C8/C8S2_FundFreqTracking.ipynb

+
+
Parameters
+
    +
  • Z – Salience representation

  • +
  • T_coef – Time axis

  • +
  • F_coef_cents – Frequency axis in cents

  • +
  • F_ref – Reference frequency (Default value = 55.0)

  • +
  • colorbar – Show or hide colorbar (Default value = True)

  • +
  • cmap – Color map (Default value = ‘gray_r’)

  • +
  • figsize – Figure size (Default value = (7, 4))

  • +
  • traj – F0 trajectory (time in seconds, frequency in Hz) (Default value = None)

  • +
  • constraint_region – Constraint regions, row-format: (t_start_sec, t_end_sec, f_start_hz, f_end,hz) +(Default value = None)

  • +
  • ax – Handle to existing axis (Default value = None)

  • +
+
+
Returns
+
    +
  • fig – Handle to figure

  • +
  • ax – Handle to cent axis

  • +
  • ax_f – Handle to frequency axis

  • +
+
+
+
+ +
+
+libfmp.c8.c8s2_salience.compute_if(X, Fs, N, H)[source]
+

Instantenous frequency (IF) estamation

+ +
+
Parameters
+
    +
  • X (np.ndarray) – STFT

  • +
  • Fs (scalar) – Sampling rate

  • +
  • N (int) – Window size in samples

  • +
  • H (int) – Hop size in samples

  • +
+
+
Returns
+

F_coef_IF (np.ndarray) – Matrix of IF values

+
+
+
+ +
+
+libfmp.c8.c8s2_salience.compute_salience_rep(x, Fs, N, H, R, F_min=55.0, F_max=1760.0, num_harm=10, freq_smooth_len=11, alpha=1.0, gamma=0.0)[source]
+

Salience representation [FMP, Eq. (8.56)]

+

Notebook: C8/C8S2_SalienceRepresentation.ipynb

+
+
Parameters
+
    +
  • x (np.ndarray) – Audio signal

  • +
  • Fs (scalar) – Sampling frequency

  • +
  • N (int) – Window length in samples

  • +
  • H (int) – Hopsize in samples

  • +
  • R (float) – Frequency resolution in cents

  • +
  • F_min (float) – Lower frequency bound (reference frequency) (Default value = 55.0)

  • +
  • F_max (float) – Upper frequency bound (Default value = 1760.0)

  • +
  • num_harm (int) – Number of harmonics (Default value = 10)

  • +
  • freq_smooth_len (int) – Filter length for vertical smoothing (Default value = 11)

  • +
  • alpha (float) – Weighting parameter (Default value = 1.0)

  • +
  • gamma (float) – Logarithmic compression factor (Default value = 0.0)

  • +
+
+
Returns
+
    +
  • Z (np.ndarray) – Salience representation

  • +
  • F_coef_hertz (np.ndarray) – Frequency axis in Hz

  • +
  • F_coef_cents (np.ndarray) – Frequency axis in cents

  • +
+
+
+
+ +
+
+libfmp.c8.c8s2_salience.compute_y_lf_bin(Y, Fs, N, R=10.0, F_min=55.0, F_max=1760.0)[source]
+

Log-frequency Spectrogram with variable frequency resolution using binning

+

Notebook: C8/C8S2_SalienceRepresentation.ipynb

+
+
Parameters
+
    +
  • Y (np.ndarray) – Magnitude spectrogram

  • +
  • Fs (scalar) – Sampling rate in Hz

  • +
  • N (int) – Window length in samples

  • +
  • R (float) – Frequency resolution in cents (Default value = 10.0)

  • +
  • F_min (float) – Lower frequency bound (reference frequency) (Default value = 55.0)

  • +
  • F_max (float) – Upper frequency bound (is included) (Default value = 1760.0)

  • +
+
+
Returns
+
    +
  • Y_LF_bin (np.ndarray) – Binned log-frequency spectrogram

  • +
  • F_coef_hertz (np.ndarray) – Frequency axis in Hz

  • +
  • F_coef_cents (np.ndarray) – Frequency axis in cents

  • +
+
+
+
+ +
+
+libfmp.c8.c8s2_salience.compute_y_lf_if_bin(X, Fs, N, H, R=10, F_min=55.0, F_max=1760.0, gamma=0.0)[source]
+

Binned Log-frequency Spectrogram with variable frequency resolution based on instantaneous frequency

+

Notebook: C8/C8S2_SalienceRepresentation.ipynb

+
+
Parameters
+
    +
  • X (np.ndarray) – Complex spectrogram

  • +
  • Fs (scalar) – Sampling rate in Hz

  • +
  • N (int) – Window length in samples

  • +
  • H (int) – Hopsize in samples

  • +
  • R (float) – Frequency resolution in cents (Default value = 10)

  • +
  • F_min (float) – Lower frequency bound (reference frequency) (Default value = 55.0)

  • +
  • F_max (float) – Upper frequency bound (Default value = 1760.0)

  • +
  • gamma (float) – Logarithmic compression factor (Default value = 0.0)

  • +
+
+
Returns
+
    +
  • Y_LF_IF_bin (np.ndarray) – Binned log-frequency spectrogram using instantaneous frequency

  • +
  • F_coef_hertz (np.ndarray) – Frequency axis in Hz

  • +
  • F_coef_cents (np.ndarray) – Frequency axis in cents

  • +
+
+
+
+ +
+
+libfmp.c8.c8s2_salience.f_coef(k, Fs, N)[source]
+

STFT center frequency

+

Notebook: C8/C8S2_SalienceRepresentation.ipynb

+
+
Parameters
+
    +
  • k (int) – Coefficient number

  • +
  • Fs (scalar) – Sampling rate in Hz

  • +
  • N (int) – Window length in samples

  • +
+
+
Returns
+

freq (float) – STFT center frequency

+
+
+
+ +
+
+libfmp.c8.c8s2_salience.frequency_to_bin_index(F, R=10.0, F_ref=55.0)[source]
+
+
Binning function with variable frequency resolution
+
Note: Indexing starts with 0 (opposed to [FMP, Eq. (8.49)])
+
+

Notebook: C8/C8S2_SalienceRepresentation.ipynb

+
+
Parameters
+
    +
  • F (float) – Frequency in Hz

  • +
  • R (float) – Frequency resolution in cents (Default value = 10.0)

  • +
  • F_ref (float) – Reference frequency in Hz (Default value = 55.0)

  • +
+
+
Returns
+

bin_index (int) – Index for bin (starting with index 0)

+
+
+
+ +
+
+libfmp.c8.c8s2_salience.harmonic_summation(Y, num_harm=10, alpha=1.0)[source]
+

Harmonic summation for spectrogram [FMP, Eq. (8.54)]

+

Notebook: C8/C8S2_SalienceRepresentation.ipynb

+
+
Parameters
+
    +
  • Y (np.ndarray) – Magnitude spectrogram

  • +
  • num_harm (int) – Number of harmonics (Default value = 10)

  • +
  • alpha (float) – Weighting parameter (Default value = 1.0)

  • +
+
+
Returns
+

Y_HS (np.ndarray) – Spectrogram after harmonic summation

+
+
+
+ +
+
+libfmp.c8.c8s2_salience.harmonic_summation_lf(Y_LF_bin, R, num_harm=10, alpha=1.0)[source]
+

Harmonic summation for log-frequency spectrogram [FMP, Eq. (8.55)]

+

Notebook: C8/C8S2_SalienceRepresentation.ipynb

+
+
Parameters
+
    +
  • Y_LF_bin (np.ndarray) – Log-frequency spectrogram

  • +
  • R (float) – Frequency resolution in cents

  • +
  • num_harm (int) – Number of harmonics (Default value = 10)

  • +
  • alpha (float) – Weighting parameter (Default value = 1.0)

  • +
+
+
Returns
+

Y_LF_bin_HS (np.ndarray) – Log-frequency spectrogram after harmonic summation

+
+
+
+ +
+
+libfmp.c8.c8s2_salience.p_bin(b, freq, R=10.0, F_ref=55.0)[source]
+

Computes binning mask [FMP, Eq. (8.50)]

+

Notebook: C8/C8S2_SalienceRepresentation.ipynb

+
+
Parameters
+
    +
  • b (int) – Bin index

  • +
  • freq (float) – Center frequency

  • +
  • R (float) – Frequency resolution in cents (Default value = 10.0)

  • +
  • F_ref (float) – Reference frequency in Hz (Default value = 55.0)

  • +
+
+
Returns
+

mask (float) – Binning mask

+
+
+
+ +
+
+libfmp.c8.c8s2_salience.p_bin_if(b, F_coef_IF, R=10.0, F_ref=55.0)[source]
+

Computes binning mask for instantaneous frequency binning [FMP, Eq. (8.52)]

+

Notebook: C8/C8S2_SalienceRepresentation.ipynb

+
+
Parameters
+
    +
  • b (int) – Bin index

  • +
  • F_coef_IF (float) – Instantaneous frequencies

  • +
  • R (float) – Frequency resolution in cents (Default value = 10.0)

  • +
  • F_ref (float) – Reference frequency in Hz (Default value = 55.0)

  • +
+
+
Returns
+

mask (np.ndarray) – Binning mask

+
+
+
+ +
+
+libfmp.c8.c8s2_salience.principal_argument(v)[source]
+

Principal argument function

+ +
+
Parameters
+

v (float or np.ndarray) – Value (or vector of values)

+
+
Returns
+

w (float or np.ndarray) – Principle value of v

+
+
+
+ +
+
+libfmp.c8.c8s3_nmf.init_nmf_activation_score(N, annotation, frame_res, tol_note=[0.2, 0.5], pitch_set=None)[source]
+

Initializes activation matrix for given score annotations

+

Notebook: C8/C8S3_NMFSpecFac.ipynb

+
+
Parameters
+
    +
  • N (int) – Number of frames

  • +
  • annotation (list) – Annotation data

  • +
  • frame_res (time) – Time resolution

  • +
  • tol_note (list or np.ndarray) – Tolerance (seconds) for beginning and end of a note (Default value = [0.2, 0.5])

  • +
  • pitch_set (np.ndarray) – Set of occurring pitches (Default value = None)

  • +
+
+
Returns
+
    +
  • H (np.ndarray) – Nonnegative matrix of size R x N

  • +
  • pitch_set (np.ndarray) – Set of occurring pitches

  • +
+
+
+
+ +
+
+libfmp.c8.c8s3_nmf.init_nmf_activation_score_onset(N, annotation, frame_res, tol_note=[0.2, 0.5], tol_onset=[0.3, 0.1], pitch_set=None)[source]
+

Initializes activation matrix with onsets for given score annotations

+

Notebook: C8/C8S3_NMFSpecFac.ipynb

+
+
Parameters
+
    +
  • N (int) – Number of frames

  • +
  • annotation (list) – Annotation data

  • +
  • frame_res (float) – Time resolution

  • +
  • tol_note (list or np.ndarray) – Tolerance (seconds) for beginning and end of a note (Default value = [0.2, 0.5])

  • +
  • tol_onset (list or np.ndarray) – Tolerance (seconds) for beginning and end of an onset +(Default value = [0.3, 0.1])

  • +
  • pitch_set (np.ndarray) – Set of occurring pitches (Default value = None)

  • +
+
+
Returns
+
    +
  • H (np.ndarray) – Nonnegative matrix of size (2R) x N

  • +
  • pitch_set (np.ndarray) – Set of occurring pitches

  • +
  • label_pitch (np.ndarray) – Pitch labels for the templates

  • +
+
+
+
+ +
+
+libfmp.c8.c8s3_nmf.init_nmf_template_pitch(K, pitch_set, freq_res, tol_pitch=0.05)[source]
+

Initializes template matrix for a given set of pitches

+

Notebook: C8/C8S3_NMFSpecFac.ipynb

+
+
Parameters
+
    +
  • K (int) – Number of frequency points

  • +
  • pitch_set (np.ndarray) – Set of fundamental pitches

  • +
  • freq_res (float) – Frequency resolution

  • +
  • tol_pitch (float) – Relative frequency tolerance for the harmonics (Default value = 0.05)

  • +
+
+
Returns
+

W (np.ndarray) – Nonnegative matrix of size K x R with R = len(pitch_set)

+
+
+
+ +
+
+libfmp.c8.c8s3_nmf.init_nmf_template_pitch_onset(K, pitch_set, freq_res, tol_pitch=0.05)[source]
+

Initializes template matrix with onsets for a given set of pitches

+

Notebook: C8/C8S3_NMFSpecFac.ipynb

+
+
Parameters
+
    +
  • K (int) – Number of frequency points

  • +
  • pitch_set (np.ndarray) – Set of fundamental pitches

  • +
  • freq_res (float) – Frequency resolution

  • +
  • tol_pitch (float) – Relative frequency tolerance for the harmonics (Default value = 0.05)

  • +
+
+
Returns
+

W (np.ndarray) – Nonnegative matrix of size K x (2R) with R = len(pitch_set)

+
+
+
+ +
+
+libfmp.c8.c8s3_nmf.nmf(V, R, thresh=0.001, L=1000, W=None, H=None, norm=False, report=False)[source]
+

NMF algorithm with Euclidean distance

+

Notebook: C8/C8S3_NMFbasic.ipynb

+
+
Parameters
+
    +
  • V (np.ndarray) – Nonnegative matrix of size K x N

  • +
  • R (int) – Rank parameter

  • +
  • thresh (float) – Threshold used as stop criterion (Default value = 0.001)

  • +
  • L (int) – Maximal number of iteration (Default value = 1000)

  • +
  • W (np.ndarray) – Nonnegative matrix of size K x R used for initialization (Default value = None)

  • +
  • H (np.ndarray) – Nonnegative matrix of size R x N used for initialization (Default value = None)

  • +
  • norm (bool) – Applies max-normalization of columns of final W (Default value = False)

  • +
  • report (bool) – Reports errors during runtime (Default value = False)

  • +
+
+
Returns
+
    +
  • W (np.ndarray) – Nonnegative matrix of size K x R

  • +
  • H (np.ndarray) – Nonnegative matrix of size R x N

  • +
  • V_approx (np.ndarray) – Nonnegative matrix W*H of size K x N

  • +
  • V_approx_err (float) – Error between V and V_approx

  • +
  • H_W_error (np.ndarray) – History of errors of subsequent H and W matrices

  • +
+
+
+
+ +
+
+libfmp.c8.c8s3_nmf.pitch_from_annotation(annotation)[source]
+

Extract set of occurring pitches from annotation

+

Notebook: C8/C8S3_NMFSpecFac.ipynb

+
+
Parameters
+

annotation (list) – Annotation data

+
+
Returns
+

pitch_set (np.ndarray) – Set of occurring pitches

+
+
+
+ +
+
+libfmp.c8.c8s3_nmf.plot_nmf_factors(W, H, V, Fs, N_fft, H_fft, freq_max, label_pitch=None, title_W='W', title_H='H', title_V='V', figsize=(13, 3))[source]
+

Plots the factore of an NMF-based spectral decomposition

+

Notebook: C8/C8S3_NMFSpecFac.ipynb

+
+
Parameters
+
    +
  • W – Template matrix

  • +
  • H – Activation matrix

  • +
  • V – Reconstructed input matrix

  • +
  • Fs – Sampling frequency

  • +
  • N_fft – FFT length

  • +
  • H_fft – Hopsize

  • +
  • freq_max – Maximum frequency to be plotted

  • +
  • label_pitch – Labels for the different pitches (Default value = None)

  • +
  • title_W – Title for imshow of matrix W (Default value = ‘W’)

  • +
  • title_H – Title for imshow of matrix H (Default value = ‘H’)

  • +
  • title_V – Title for imshow of matrix V (Default value = ‘V’)

  • +
  • figsize – Size of the figure (Default value = (13, 3))

  • +
+
+
+
+ +
+
+libfmp.c8.c8s3_nmf.split_annotation_lh_rh(ann)[source]
+

Splitting of the annotation data in left and right hand

+

Notebook: C8/C8S3_NMFAudioDecomp.ipynb

+
+
Parameters
+

ann (list) – Annotation data

+
+
Returns
+
    +
  • ann_lh (list) – Annotation data for left hand

  • +
  • ann_rh (list) – Annotation data for right hand

  • +
+
+
+
+ +
+
+libfmp.c8.c8s3_nmf.template_pitch(K, pitch, freq_res, tol_pitch=0.05)[source]
+

Defines spectral template for a given pitch

+

Notebook: C8/C8S3_NMFSpecFac.ipynb

+
+
Parameters
+
    +
  • K (int) – Number of frequency points

  • +
  • pitch (float) – Fundamental pitch

  • +
  • freq_res (float) – Frequency resolution

  • +
  • tol_pitch (float) – Relative frequency tolerance for the harmonics (Default value = 0.05)

  • +
+
+
Returns
+

template (np.ndarray) – Nonnegative template vector of size K

+
+
+
+ +
+ + +
+ +
+ +
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/objects.inv b/docs/build/html/objects.inv new file mode 100644 index 0000000..b49ce45 Binary files /dev/null and b/docs/build/html/objects.inv differ diff --git a/docs/build/html/py-modindex.html b/docs/build/html/py-modindex.html new file mode 100644 index 0000000..a07aebd --- /dev/null +++ b/docs/build/html/py-modindex.html @@ -0,0 +1,505 @@ + + + + + + + + + + Python Module Index — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Python Module Index
  • + + +
  • + + + +
  • + +
+ + +
+
+
+
+ + +

Python Module Index

+ +
+ l +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
 
+ l
+ libfmp +
    + libfmp.b +
    + libfmp.b.b_annotation +
    + libfmp.b.b_audio +
    + libfmp.b.b_layout +
    + libfmp.b.b_plot +
    + libfmp.b.b_sonification +
    + libfmp.b.b_test_module +
    + libfmp.c1 +
    + libfmp.c1.c1s1_sheet_music +
    + libfmp.c1.c1s2_symbolic_rep +
    + libfmp.c1.c1s3_audio_rep +
    + libfmp.c2 +
    + libfmp.c2.c2_complex +
    + libfmp.c2.c2_digitization +
    + libfmp.c2.c2_fourier +
    + libfmp.c2.c2_interference +
    + libfmp.c2.c2_interpolation +
    + libfmp.c3 +
    + libfmp.c3.c3s1_audio_feature +
    + libfmp.c3.c3s1_post_processing +
    + libfmp.c3.c3s1_transposition_tuning +
    + libfmp.c3.c3s2_dtw +
    + libfmp.c3.c3s2_dtw_plot +
    + libfmp.c3.c3s3_tempo_curve +
    + libfmp.c4 +
    + libfmp.c4.c4s1_annotation +
    + libfmp.c4.c4s2_ssm +
    + libfmp.c4.c4s2_synthetic_ssm +
    + libfmp.c4.c4s2_threshold +
    + libfmp.c4.c4s3_thumbnail +
    + libfmp.c4.c4s4_novelty_kernel +
    + libfmp.c4.c4s4_structure_feature +
    + libfmp.c4.c4s5_evaluation +
    + libfmp.c5 +
    + libfmp.c5.c5s1_basic_theory_harmony +
    + libfmp.c5.c5s2_chord_rec_template +
    + libfmp.c5.c5s3_chord_rec_hmm +
    + libfmp.c6 +
    + libfmp.c6.c6s1_onset_detection +
    + libfmp.c6.c6s1_peak_picking +
    + libfmp.c6.c6s2_tempo_analysis +
    + libfmp.c6.c6s3_adaptive_windowing +
    + libfmp.c6.c6s3_beat_tracking +
    + libfmp.c7 +
    + libfmp.c7.c7s1_audio_id +
    + libfmp.c7.c7s2_audio_matching +
    + libfmp.c7.c7s3_version_id +
    + libfmp.c8 +
    + libfmp.c8.c8s1_hps +
    + libfmp.c8.c8s2_f0 +
    + libfmp.c8.c8s2_salience +
    + libfmp.c8.c8s3_nmf +
+ + +
+ +
+
+ +
+ +
+

+ © Copyright 2021, Meinard Müller and Frank Zalkow. + +

+
+ + + + Built with Sphinx using a + + theme + + provided by Read the Docs. + +
+
+
+ +
+ +
+ + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/search.html b/docs/build/html/search.html new file mode 100644 index 0000000..f162427 --- /dev/null +++ b/docs/build/html/search.html @@ -0,0 +1,243 @@ + + + + + + + + + + Search — libfmp 1.1.1 documentation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + +
+ +
+ + + + + + + + + + + + + + + + + + + +
+ +
    + +
  • »
  • + +
  • Search
  • + + +
  • + +
  • + +
+ + +
+
+
+
+ + + + +
+ +
+ +
+ +
+
+ +
+ +
+

+ © Copyright 2021, Meinard Müller and Frank Zalkow. + +

+
+ + + + Built with Sphinx using a + + theme + + provided by Read the Docs. + +
+
+
+ +
+ +
+ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/docs/build/html/searchindex.js b/docs/build/html/searchindex.js new file mode 100644 index 0000000..dcdda50 --- /dev/null +++ b/docs/build/html/searchindex.js @@ -0,0 +1 @@ +Search.setIndex({docnames:["genindex","getting_started","index","index_b","index_c1","index_c2","index_c3","index_c4","index_c5","index_c6","index_c7","index_c8","py-modindex"],envversion:{"sphinx.domains.c":2,"sphinx.domains.changeset":1,"sphinx.domains.citation":1,"sphinx.domains.cpp":3,"sphinx.domains.index":1,"sphinx.domains.javascript":2,"sphinx.domains.math":2,"sphinx.domains.python":3,"sphinx.domains.rst":2,"sphinx.domains.std":2,"sphinx.ext.intersphinx":1,"sphinx.ext.viewcode":1,sphinx:56},filenames:["genindex.rst","getting_started.rst","index.rst","index_b.rst","index_c1.rst","index_c2.rst","index_c3.rst","index_c4.rst","index_c5.rst","index_c6.rst","index_c7.rst","index_c8.rst","py-modindex.rst"],objects:{"libfmp.b":{b_annotation:[3,0,0,"-"],b_audio:[3,0,0,"-"],b_layout:[3,0,0,"-"],b_plot:[3,0,0,"-"],b_sonification:[3,0,0,"-"],b_test_module:[3,0,0,"-"]},"libfmp.b.b_annotation":{cut_audio:[3,1,1,""],cut_csv_file:[3,1,1,""],read_csv:[3,1,1,""],write_csv:[3,1,1,""]},"libfmp.b.b_audio":{audio_player_list:[3,1,1,""],read_audio:[3,1,1,""],write_audio:[3,1,1,""]},"libfmp.b.b_layout":{FloatingBox:[3,2,1,""]},"libfmp.b.b_layout.FloatingBox":{add_fig:[3,3,1,""],add_html:[3,3,1,""],show:[3,3,1,""]},"libfmp.b.b_plot":{MultiplePlotsWithColorbar:[3,2,1,""],check_line_annotations:[3,1,1,""],check_segment_annotations:[3,1,1,""],color_argument_to_dict:[3,1,1,""],compressed_gray_cmap:[3,1,1,""],plot_annotation_line:[3,1,1,""],plot_annotation_line_overlay:[3,1,1,""],plot_annotation_multiline:[3,1,1,""],plot_chromagram:[3,1,1,""],plot_matrix:[3,1,1,""],plot_segments:[3,1,1,""],plot_segments_overlay:[3,1,1,""],plot_signal:[3,1,1,""]},"libfmp.b.b_plot.MultiplePlotsWithColorbar":{make_colorbars:[3,3,1,""]},"libfmp.b.b_sonification":{generate_shepard_tone:[3,1,1,""],list_to_chromagram:[3,1,1,""],list_to_pitch_activations:[3,1,1,""],sonify_chromagram:[3,1,1,""],sonify_chromagram_with_signal:[3,1,1,""],sonify_pitch_activations:[3,1,1,""],sonify_pitch_activations_with_signal:[3,1,1,""]},"libfmp.b.b_test_module":{add:[3,1,1,""]},"libfmp.c1":{c1s1_sheet_music:[4,0,0,"-"],c1s2_symbolic_rep:[4,0,0,"-"],c1s3_audio_rep:[4,0,0,"-"]},"libfmp.c1.c1s1_sheet_music":{generate_chirp_exp_octave:[4,1,1,""],generate_shepard_glissando:[4,1,1,""],generate_shepard_tone:[4,1,1,""],generate_sinusoid_pitches:[4,1,1,""]},"libfmp.c1.c1s2_symbolic_rep":{csv_to_list:[4,1,1,""],list_to_csv:[4,1,1,""],midi_to_list:[4,1,1,""],visualize_piano_roll:[4,1,1,""],xml_to_list:[4,1,1,""]},"libfmp.c1.c1s3_audio_rep":{compute_adsr:[4,1,1,""],compute_envelope:[4,1,1,""],compute_equal_loudness_contour:[4,1,1,""],compute_plot_envelope:[4,1,1,""],compute_power_db:[4,1,1,""],difference_cents:[4,1,1,""],f_pitch:[4,1,1,""],generate_chirp_exp:[4,1,1,""],generate_chirp_exp_equal_loudness:[4,1,1,""],generate_sinusoid:[4,1,1,""],generate_sinusoid_tremolo:[4,1,1,""],generate_sinusoid_vibrato:[4,1,1,""],generate_tone:[4,1,1,""],plot_spectrogram:[4,1,1,""]},"libfmp.c2":{c2_complex:[5,0,0,"-"],c2_digitization:[5,0,0,"-"],c2_fourier:[5,0,0,"-"],c2_interference:[5,0,0,"-"],c2_interpolation:[5,0,0,"-"]},"libfmp.c2.c2_complex":{generate_figure:[5,1,1,""],plot_vector:[5,1,1,""]},"libfmp.c2.c2_digitization":{decoding_mu_law:[5,1,1,""],encoding_mu_law:[5,1,1,""],generate_function:[5,1,1,""],plot_graph_quant_function:[5,1,1,""],plot_mu_law:[5,1,1,""],plot_signal_quant:[5,1,1,""],quantize_nonuniform_mu:[5,1,1,""],quantize_uniform:[5,1,1,""],reconstruction_sinc:[5,1,1,""],sampling_equidistant:[5,1,1,""]},"libfmp.c2.c2_fourier":{dft:[5,1,1,""],fft:[5,1,1,""],generate_matrix_dft:[5,1,1,""],generate_matrix_dft_inv:[5,1,1,""],idft:[5,1,1,""],ifft:[5,1,1,""],ifft_noscale:[5,1,1,""],istft:[5,1,1,""],istft_basic:[5,1,1,""],stft:[5,1,1,""],stft_basic:[5,1,1,""],stft_convention_fmp:[5,1,1,""],twiddle:[5,1,1,""],twiddle_inv:[5,1,1,""]},"libfmp.c2.c2_interference":{generate_chirp_linear:[5,1,1,""],plot_interference:[5,1,1,""]},"libfmp.c2.c2_interpolation":{compute_f_coef_linear:[5,1,1,""],compute_f_coef_log:[5,1,1,""],interpolate_freq_stft:[5,1,1,""]},"libfmp.c3":{c3s1_audio_feature:[6,0,0,"-"],c3s1_post_processing:[6,0,0,"-"],c3s1_transposition_tuning:[6,0,0,"-"],c3s2_dtw:[6,0,0,"-"],c3s2_dtw_plot:[6,0,0,"-"],c3s3_tempo_curve:[6,0,0,"-"]},"libfmp.c3.c3s1_audio_feature":{compute_chromagram:[6,1,1,""],compute_spec_log_freq:[6,1,1,""],f_pitch:[6,1,1,""],note_name:[6,1,1,""],pool_pitch:[6,1,1,""]},"libfmp.c3.c3s1_post_processing":{log_compression:[6,1,1,""],median_downsample_feature_sequence:[6,1,1,""],normalize_feature_sequence:[6,1,1,""],smooth_downsample_feature_sequence:[6,1,1,""]},"libfmp.c3.c3s1_transposition_tuning":{compute_freq_distribution:[6,1,1,""],cyclic_shift:[6,1,1,""],plot_freq_vector_template:[6,1,1,""],plot_tuning_similarity:[6,1,1,""],template_comb:[6,1,1,""],tuning_similarity:[6,1,1,""]},"libfmp.c3.c3s2_dtw":{compute_accumulated_cost_matrix:[6,1,1,""],compute_accumulated_cost_matrix_21:[6,1,1,""],compute_cost_matrix:[6,1,1,""],compute_optimal_warping_path:[6,1,1,""],compute_optimal_warping_path_21:[6,1,1,""]},"libfmp.c3.c3s2_dtw_plot":{plot_matrix_with_points:[6,1,1,""]},"libfmp.c3.c3s3_tempo_curve":{compute_score_chromagram:[6,1,1,""],compute_strict_alignment_path:[6,1,1,""],compute_strict_alignment_path_mask:[6,1,1,""],compute_tempo_curve:[6,1,1,""],plot_measure:[6,1,1,""],plot_tempo_curve:[6,1,1,""]},"libfmp.c4":{c4s1_annotation:[7,0,0,"-"],c4s2_ssm:[7,0,0,"-"],c4s2_synthetic_ssm:[7,0,0,"-"],c4s2_threshold:[7,0,0,"-"],c4s3_thumbnail:[7,0,0,"-"],c4s4_novelty_kernel:[7,0,0,"-"],c4s4_structure_feature:[7,0,0,"-"],c4s5_evaluation:[7,0,0,"-"]},"libfmp.c4.c4s1_annotation":{convert_structure_annotation:[7,1,1,""],get_color_for_annotation_file:[7,1,1,""],read_structure_annotation:[7,1,1,""]},"libfmp.c4.c4s2_ssm":{compute_sm_dot:[7,1,1,""],compute_sm_from_filename:[7,1,1,""],compute_sm_ti:[7,1,1,""],compute_tempo_rel_set:[7,1,1,""],filter_diag_mult_sm:[7,1,1,""],filter_diag_sm:[7,1,1,""],plot_feature_ssm:[7,1,1,""],shift_cyc_matrix:[7,1,1,""],subplot_matrix_colorbar:[7,1,1,""],subplot_matrix_ti_colorbar:[7,1,1,""]},"libfmp.c4.c4s2_synthetic_ssm":{generate_ssm_from_annotation:[7,1,1,""]},"libfmp.c4.c4s2_threshold":{threshold_matrix:[7,1,1,""],threshold_matrix_relative:[7,1,1,""]},"libfmp.c4.c4s3_thumbnail":{check_segment:[7,1,1,""],colormap_penalty:[7,1,1,""],compute_accumulated_score_matrix:[7,1,1,""],compute_fitness:[7,1,1,""],compute_fitness_scape_plot:[7,1,1,""],compute_induced_segment_family_coverage:[7,1,1,""],compute_optimal_path_family:[7,1,1,""],normalization_properties_ssm:[7,1,1,""],plot_path_family:[7,1,1,""],plot_seg_in_sp:[7,1,1,""],plot_sp_ssm:[7,1,1,""],plot_ssm_ann:[7,1,1,""],plot_ssm_ann_optimal_path_family:[7,1,1,""],seg_max_sp:[7,1,1,""],visualize_scape_plot:[7,1,1,""]},"libfmp.c4.c4s4_novelty_kernel":{compute_kernel_checkerboard_box:[7,1,1,""],compute_kernel_checkerboard_gaussian:[7,1,1,""],compute_novelty_ssm:[7,1,1,""]},"libfmp.c4.c4s4_structure_feature":{compute_time_lag_representation:[7,1,1,""],novelty_structure_feature:[7,1,1,""],plot_ssm_structure_feature_nov:[7,1,1,""]},"libfmp.c4.c4s5_evaluation":{compare_pairwise:[7,1,1,""],convert_ann_to_seq_label:[7,1,1,""],evaluate_boundary:[7,1,1,""],evaluate_pairwise:[7,1,1,""],measure_prf:[7,1,1,""],measure_prf_sets:[7,1,1,""],plot_boundary_measures:[7,1,1,""],plot_matrix_label:[7,1,1,""],plot_matrix_pairwise:[7,1,1,""],plot_seq_label:[7,1,1,""]},"libfmp.c5":{c5s1_basic_theory_harmony:[8,0,0,"-"],c5s2_chord_rec_template:[8,0,0,"-"],c5s3_chord_rec_hmm:[8,0,0,"-"]},"libfmp.c5.c5s1_basic_theory_harmony":{generate_sinusoid_chord:[8,1,1,""],generate_sinusoid_scale:[8,1,1,""]},"libfmp.c5.c5s2_chord_rec_template":{chord_recognition_template:[8,1,1,""],compute_chromagram_from_filename:[8,1,1,""],compute_eval_measures:[8,1,1,""],convert_chord_ann_matrix:[8,1,1,""],convert_chord_label:[8,1,1,""],convert_sequence_ann:[8,1,1,""],generate_chord_templates:[8,1,1,""],get_chord_labels:[8,1,1,""],plot_chromagram_annotation:[8,1,1,""],plot_matrix_chord_eval:[8,1,1,""]},"libfmp.c5.c5s3_chord_rec_hmm":{chord_recognition_all:[8,1,1,""],estimate_hmm_from_o_s:[8,1,1,""],generate_sequence_hmm:[8,1,1,""],matrix_chord24_trans_inv:[8,1,1,""],matrix_circular_mean:[8,1,1,""],plot_transition_matrix:[8,1,1,""],uniform_transition_matrix:[8,1,1,""],viterbi:[8,1,1,""],viterbi_log:[8,1,1,""],viterbi_log_likelihood:[8,1,1,""]},"libfmp.c6":{c6s1_onset_detection:[9,0,0,"-"],c6s1_peak_picking:[9,0,0,"-"],c6s2_tempo_analysis:[9,0,0,"-"],c6s3_adaptive_windowing:[9,0,0,"-"],c6s3_beat_tracking:[9,0,0,"-"]},"libfmp.c6.c6s1_onset_detection":{average_nov_dic:[9,1,1,""],compute_local_average:[9,1,1,""],compute_novelty_complex:[9,1,1,""],compute_novelty_energy:[9,1,1,""],compute_novelty_phase:[9,1,1,""],compute_novelty_spectrum:[9,1,1,""],principal_argument:[9,1,1,""],read_annotation_pos:[9,1,1,""],resample_signal:[9,1,1,""]},"libfmp.c6.c6s1_peak_picking":{peak_picking_MSAF:[9,1,1,""],peak_picking_boeck:[9,1,1,""],peak_picking_roeder:[9,1,1,""],peak_picking_simple:[9,1,1,""]},"libfmp.c6.c6s2_tempo_analysis":{compute_autocorrelation_local:[9,1,1,""],compute_cyclic_tempogram:[9,1,1,""],compute_plot_tempogram_plp:[9,1,1,""],compute_plp:[9,1,1,""],compute_sinusoid_optimal:[9,1,1,""],compute_tempogram_autocorr:[9,1,1,""],compute_tempogram_fourier:[9,1,1,""],plot_signal_kernel:[9,1,1,""],plot_signal_local_lag:[9,1,1,""],set_yticks_tempogram_cyclic:[9,1,1,""]},"libfmp.c6.c6s3_adaptive_windowing":{adaptive_windowing:[9,1,1,""],compute_plot_adaptive_windowing:[9,1,1,""],plot_beat_grid:[9,1,1,""]},"libfmp.c6.c6s3_beat_tracking":{beat_period_to_tempo:[9,1,1,""],compute_beat_sequence:[9,1,1,""],compute_penalty:[9,1,1,""],compute_plot_sonify_beat:[9,1,1,""]},"libfmp.c7":{c7s1_audio_id:[10,0,0,"-"],c7s2_audio_matching:[10,0,0,"-"],c7s3_version_id:[10,0,0,"-"]},"libfmp.c7.c7s1_audio_id":{compute_constellation_map:[10,1,1,""],compute_constellation_map_naive:[10,1,1,""],compute_matching_function:[10,1,1,""],match_binary_matrices_tol:[10,1,1,""],plot_constellation_map:[10,1,1,""]},"libfmp.c7.c7s2_audio_matching":{compute_accumulated_cost_matrix_subsequence_dtw:[10,1,1,""],compute_accumulated_cost_matrix_subsequence_dtw_21:[10,1,1,""],compute_cens_from_chromagram:[10,1,1,""],compute_cens_from_file:[10,1,1,""],compute_matching_function_dtw:[10,1,1,""],compute_matching_function_dtw_ti:[10,1,1,""],compute_optimal_warping_path_subsequence_dtw:[10,1,1,""],compute_optimal_warping_path_subsequence_dtw_21:[10,1,1,""],cost_matrix_dot:[10,1,1,""],matches_diag:[10,1,1,""],matches_dtw:[10,1,1,""],matching_function_diag:[10,1,1,""],matching_function_diag_multiple:[10,1,1,""],mininma_from_matching_function:[10,1,1,""],plot_matches:[10,1,1,""],quantize_matrix:[10,1,1,""],scale_tempo_sequence:[10,1,1,""]},"libfmp.c7.c7s3_version_id":{compute_accumulated_score_matrix_common_subsequence:[10,1,1,""],compute_optimal_path_common_subsequence:[10,1,1,""],compute_partial_matching:[10,1,1,""],compute_prf_metrics:[10,1,1,""],compute_sm_from_wav:[10,1,1,""],get_induced_segments:[10,1,1,""]},"libfmp.c8":{c8s1_hps:[11,0,0,"-"],c8s2_f0:[11,0,0,"-"],c8s2_salience:[11,0,0,"-"],c8s3_nmf:[11,0,0,"-"]},"libfmp.c8.c8s1_hps":{convert_l_hertz_to_bins:[11,1,1,""],convert_l_sec_to_frames:[11,1,1,""],experiment_hps_parameter:[11,1,1,""],experiment_hrps_parameter:[11,1,1,""],generate_audio_tag_html_list:[11,1,1,""],hps:[11,1,1,""],hrps:[11,1,1,""],make_integer_odd:[11,1,1,""],median_filter_horizontal:[11,1,1,""],median_filter_vertical:[11,1,1,""]},"libfmp.c8.c8s2_f0":{cents_to_hz:[11,1,1,""],compute_traj_from_audio:[11,1,1,""],compute_trajectory_cr:[11,1,1,""],compute_trajectory_dp:[11,1,1,""],convert_ann_to_constraint_region:[11,1,1,""],convert_trajectory_to_mask_bin:[11,1,1,""],convert_trajectory_to_mask_cent:[11,1,1,""],define_transition_matrix:[11,1,1,""],hz_to_cents:[11,1,1,""],separate_melody_accompaniment:[11,1,1,""],sonify_trajectory_with_sinusoid:[11,1,1,""],visualize_salience_traj_constraints:[11,1,1,""]},"libfmp.c8.c8s2_salience":{compute_if:[11,1,1,""],compute_salience_rep:[11,1,1,""],compute_y_lf_bin:[11,1,1,""],compute_y_lf_if_bin:[11,1,1,""],f_coef:[11,1,1,""],frequency_to_bin_index:[11,1,1,""],harmonic_summation:[11,1,1,""],harmonic_summation_lf:[11,1,1,""],p_bin:[11,1,1,""],p_bin_if:[11,1,1,""],principal_argument:[11,1,1,""]},"libfmp.c8.c8s3_nmf":{init_nmf_activation_score:[11,1,1,""],init_nmf_activation_score_onset:[11,1,1,""],init_nmf_template_pitch:[11,1,1,""],init_nmf_template_pitch_onset:[11,1,1,""],nmf:[11,1,1,""],pitch_from_annotation:[11,1,1,""],plot_nmf_factors:[11,1,1,""],split_annotation_lh_rh:[11,1,1,""],template_pitch:[11,1,1,""]},libfmp:{b:[3,0,0,"-"],c1:[4,0,0,"-"],c2:[5,0,0,"-"],c3:[6,0,0,"-"],c4:[7,0,0,"-"],c5:[8,0,0,"-"],c6:[9,0,0,"-"],c7:[10,0,0,"-"],c8:[11,0,0,"-"]}},objnames:{"0":["py","module","Python module"],"1":["py","function","Python function"],"2":["py","class","Python class"],"3":["py","method","Python method"]},objtypes:{"0":"py:module","1":"py:function","2":"py:class","3":"py:method"},terms:{"0":[3,4,5,6,7,8,9,10,11],"0001":6,"001":11,"01":[4,8,10,11],"04":9,"05":[9,11],"1":[2,3,4,5,6,7,8,9,10,11],"10":[4,6,7,9,10,11],"100":[4,6,9,11],"1000":[4,11],"101":6,"1024":[9,11],"11":11,"11025":4,"12":[3,4,7,8,9,10],"127":3,"128":[3,9,11],"13":11,"13th":9,"14":9,"15":[3,7,8,10],"150":11,"15000":4,"16":[4,7,9],"16384":6,"1760":11,"1st":11,"2":[3,4,5,6,7,8,9,10,11],"20":3,"2012":9,"2014":9,"2017":9,"2019":2,"2048":[4,8,9],"21":[7,10],"22":10,"2205":[6,10],"22050":[3,4,5,6,8,9,10,11],"24":[8,9],"255":5,"256":[3,5,9,11],"270":3,"2812618":3,"2m":9,"2nd":11,"2r":11,"2tau":7,"3":[3,4,6,7,8,9,10,11],"30":[4,9],"300":11,"4":[3,4,5,6,7,9,11],"40":[3,9,11],"4000":[4,8],"4096":[4,8],"41":[6,10],"440":[3,4,6],"4410":[6,10],"44100":4,"49":[6,11],"49566213":3,"5":[3,4,5,7,8,9,10,11],"50":[6,11],"500":9,"512":[5,11],"52":11,"54":11,"55":11,"56":11,"573":2,"58":7,"580":2,"6":[3,4,7,8,9],"60":4,"601":9,"64":9,"66":10,"69":[4,6,8],"7":[7,10,11],"72":[3,4,10],"8":[3,4,5,6,7,9,11],"81":10,"9":[8,11],"boolean":[3,10],"break":10,"case":[3,6,10],"class":3,"default":[3,4,5,6,7,8,9,10,11],"final":[5,7,10,11],"float":[3,4,5,6,7,8,9,10,11],"function":[1,2,3,5,7,9,10,11],"int":[3,4,5,6,7,8,9,10,11],"m\u00fcller":2,"new":5,"return":[3,4,5,6,7,8,9,10,11],"short":5,"true":[3,5,6,7,8,9,10,11],"var":7,A:[3,4,8,9],AND:10,For:[2,3],IF:11,If:[2,3,6,7,8,9,10],In:1,The:[2,3,4,5,6,7,8,9,10,11],a4:3,a_cut:9,a_est:8,a_mean:8,a_ti:8,abov:7,abs_thresh:9,absolut:[7,9,10],accompani:11,accord:9,accumul:[3,6,7,8,9,10],achiev:6,activ:[3,9,11],actual:3,ad:[3,10],adapt:[5,9],adaptive_window:9,add:[3,8,9],add_end:9,add_fig:3,add_html:3,add_label:3,add_start:9,addit:[7,8,9],adjust:[3,9,11],adjust_nontime_axislim:3,adjust_time_axislim:3,adsr:4,after:[5,9,11],algorithm:[3,4,5,6,7,8,9,10,11],align:[3,6],all:[3,6,10],allow:10,along:[5,7,10],alpha:[3,4,7,10,11],also:[7,9,11],amp:[4,5],amplitud:[4,5,8,11],amplitude_max:8,an:[3,5,6,7,9,10,11],analyz:4,ann:[7,8,9,11],ann_conv:8,ann_convert:7,ann_cut:3,ann_fram:8,ann_i:7,ann_lh:11,ann_matrix:8,ann_rh:11,ann_seg_fram:8,ann_seg_ind:8,ann_seg_sec:8,ann_x:7,annot:[3,7,8,9,11],annotaion:7,api:[1,6],appli:[5,6,7,9,10,11],applic:2,approach:[5,8],ar:[1,3,6,7,8,11],arang:[3,9,10],arg:3,argument:[3,6,9,11],around:7,arrai:[4,6,7,8,9,10],arrow:5,articl:2,asarrai:7,ascent:9,aspect:3,assign:[3,4,6],assum:9,attribut:3,audio:[2,3,6,7,8,9],audio_len:11,audio_player_list:3,audio_tag_html_list:11,audiolab:[1,2,3,4,5,6,7,8,9,10,11],auto:3,autocorrel:9,avail:[3,4,5,6,7,8,9,10,11],averag:[6,9,10],average_nov_d:9,ax1:7,ax2:7,ax3:7,ax:[3,4,5,6,7,8,9,10,11],ax_f:11,axhlin:3,axi:[3,4,5,6,7,8,9,10,11],axis_off:3,axvlin:3,b:[1,6,7,8,9,11],b_:[7,9],b_annot:3,b_audio:3,b_est:[7,8],b_getstart:1,b_k:7,b_layout:3,b_libfmp:[1,3],b_o:8,b_plot:[3,6,7],b_pythonaudio:3,b_pythonbas:3,b_ref:7,b_sec:9,b_sonif:3,b_t:9,b_test_modul:3,b_tol:7,back:10,backtrack:[8,10],backward:[7,9],base:[3,8,9,11],basic:5,beat:6,beat_period_to_tempo:9,beat_ref:9,becaus:9,been:9,befor:[5,9],begin:[9,11],being:7,below:[6,7,10],bep:10,best:10,beta:11,between:[3,4,5,7,11],beyond:1,bin:[5,7,9,10,11],bin_index:11,binar:[7,8,10],binari:[8,10,11],bivari:7,black:[3,7],block:7,blog:7,boeck:9,bool:[3,5,6,7,8,9,10,11],both:7,bound:11,boundari:7,box:[3,7],boxcar:6,bpm:[6,9],c1:3,c1s1_chromashepard:4,c1s1_musicalnotespitch:4,c1s1_sheet_mus:4,c1s2_csv:4,c1s2_midi:4,c1s2_musicxml:4,c1s2_symbolic_rep:[3,4],c1s3_audio_rep:4,c1s3_dynam:4,c1s3_frequencypitch:4,c1s3_timbr:4,c2_complex:5,c2_complexnumb:5,c2_dft:5,c2_digit:5,c2_fourier:5,c2_interfer:5,c2_interpol:5,c2_stft:5,c2s2_digitalsignalquant:5,c2s2_digitalsignalsampl:5,c2s3_interferenceb:5,c3s1_audio_featur:6,c3s1_featurenorm:6,c3s1_featuresmooth:6,c3s1_logcompress:6,c3s1_post_process:6,c3s1_speclogfreq:6,c3s1_transposition_tun:6,c3s1_transpositiontun:6,c3s2_dtw:6,c3s2_dtw_plot:6,c3s2_dtwbasic:6,c3s2_dtwvariant:6,c3s3_musicapptempocurv:6,c3s3_tempo_curv:6,c4s1_annot:7,c4s1_musicstructuregener:7,c4s2_ssm:7,c4s2_synthetic_ssm:7,c4s2_threshold:7,c4s3_audiothumbnail:7,c4s3_scapeplot:7,c4s3_thumbnail:7,c4s4_novelty_kernel:7,c4s4_noveltysegment:7,c4s4_structure_featur:7,c4s4_structurefeatur:7,c4s5_evalu:7,c5s1_basic_theory_harmoni:8,c5s1_chord:8,c5s1_scales_circlefifth:8,c5s2_chord_rec_templ:8,c5s2_chordrec_ev:8,c5s2_chordrec_templ:8,c5s3_chord_rec_hmm:8,c5s3_chordrec_beatl:8,c5s3_chordrec_hmm:8,c5s3_hiddenmarkovmodel:8,c5s3_viterbi:8,c6:11,c6s1_noveltycomparison:9,c6s1_noveltycomplex:9,c6s1_noveltyenergi:9,c6s1_noveltyphas:[9,11],c6s1_noveltyspectr:9,c6s1_onset_detect:9,c6s1_onsetdetect:9,c6s1_peak_pick:9,c6s1_peakpick:9,c6s2_tempo_analysi:9,c6s2_tempogramautocorrel:9,c6s2_tempogramcycl:9,c6s2_tempogramfouri:9,c6s3_adaptive_window:9,c6s3_adaptivewindow:9,c6s3_beat_track:9,c6s3_beattrack:9,c6s3_predominantlocalpuls:9,c7s1_audio_id:10,c7s1_audioidentif:10,c7s2_audio_match:10,c7s2_audiomatch:10,c7s2_cen:10,c7s2_diagonalmatch:10,c7s2_subsequencedtw:10,c7s3_commonsubsequ:10,c7s3_evalu:10,c7s3_version_id:10,c7s3_versionidentif:10,c8:9,c8s1_hp:11,c8s1_hrp:11,c8s2_f0:11,c8s2_fundfreqtrack:11,c8s2_instantfreqestim:[9,11],c8s2_melodyextractsep:11,c8s2_salienc:11,c8s2_saliencerepresent:11,c8s3_nmf:11,c8s3_nmfaudiodecomp:11,c8s3_nmfbasic:11,c8s3_nmfspecfac:11,c:[3,5,6,8,9,10],c_and:10,c_cen:10,c_d:10,c_est:10,c_q:10,c_quant:10,c_ref:10,c_shift:6,call:3,can:1,candid:9,capabl:9,cbar_ax:3,cbar_label:3,cbar_ratio:3,cdist:6,cell:[7,10],cellmax:10,cen:10,cent:[4,5,6,11],center:[3,4,5,6,7,11],central:[3,4,5,6,7,8,9,10,11],centric:[5,9],cents_to_hz:11,chang:9,channel:3,check:3,check_line_annot:3,check_seg:7,check_segment_annot:3,checkerboard:7,chirp:[4,5],choic:9,chord_hmm:8,chord_label:8,chord_max:8,chord_recognition_al:8,chord_recognition_templ:8,chord_sim:8,chord_tem:8,chord_templ:8,chroma:[3,6,8,10],chroma_data:3,chroma_son:3,chroma_ytick:3,chromagram:[3,6,8,10],chromanum:3,circul:8,circular:7,cite:2,clim:[3,7],clim_x:7,cmap:[7,8,10,11],cmap_penalti:7,code:[2,8],coeffici:[9,11],coeffient:3,collect:2,color:[3,4,5,6,7,8,9,10,11],color_ann:[7,8],color_argument_to_dict:3,color_dict:3,color_label:7,color_wb:3,colorbar:[3,11],colorbar_aspect:3,colormap:[3,4,7],colormap_penalti:7,column:[3,6,8,11],column_align:3,com:[2,3,7,9],comb:6,combin:[3,9],common:10,compar:10,compare_pairwis:7,complex:[5,9,11],compress:[3,5,6,8,9,11],compressed_gray_cmap:[3,7],comput:[3,4,5,6,7,8,9,10,11],compute_accumulated_cost_matrix:6,compute_accumulated_cost_matrix_21:6,compute_accumulated_cost_matrix_subsequence_dtw:10,compute_accumulated_cost_matrix_subsequence_dtw_21:10,compute_accumulated_score_matrix:7,compute_accumulated_score_matrix_common_subsequ:10,compute_adsr:4,compute_autocorrelation_loc:9,compute_beat_sequ:9,compute_cens_from_chromagram:10,compute_cens_from_fil:10,compute_chromagram:6,compute_chromagram_from_filenam:8,compute_constellation_map:10,compute_constellation_map_na:10,compute_cost_matrix:6,compute_cyclic_tempogram:9,compute_envelop:4,compute_equal_loudness_contour:4,compute_eval_measur:8,compute_f_coef_linear:5,compute_f_coef_log:5,compute_fit:7,compute_fitness_scape_plot:7,compute_freq_distribut:6,compute_if:11,compute_induced_segment_family_coverag:7,compute_kernel_checkerboard_box:7,compute_kernel_checkerboard_gaussian:7,compute_local_averag:9,compute_matching_funct:10,compute_matching_function_dtw:10,compute_matching_function_dtw_ti:10,compute_novelty_complex:9,compute_novelty_energi:9,compute_novelty_phas:9,compute_novelty_spectrum:9,compute_novelty_ssm:7,compute_optimal_path_common_subsequ:10,compute_optimal_path_famili:7,compute_optimal_warping_path:6,compute_optimal_warping_path_21:6,compute_optimal_warping_path_subsequence_dtw:10,compute_optimal_warping_path_subsequence_dtw_21:10,compute_partial_match:10,compute_penalti:9,compute_plot_adaptive_window:9,compute_plot_envelop:4,compute_plot_sonify_beat:9,compute_plot_tempogram_plp:9,compute_plp:9,compute_power_db:4,compute_prf_metr:10,compute_salience_rep:11,compute_score_chromagram:6,compute_sinusoid_optim:9,compute_sm_dot:7,compute_sm_from_filenam:7,compute_sm_from_wav:10,compute_sm_ti:7,compute_spec_log_freq:6,compute_strict_alignment_path:6,compute_strict_alignment_path_mask:6,compute_tempo_curv:6,compute_tempo_rel_set:7,compute_tempogram_autocorr:9,compute_tempogram_fouri:9,compute_time_lag_represent:7,compute_traj_from_audio:11,compute_trajectory_cr:11,compute_trajectory_dp:11,compute_y_lf_bin:11,compute_y_lf_if_bin:11,concaten:9,condit:[7,10],conduct:8,confer:[2,9],consid:[2,9,10],consist:[6,7],constant:[3,5,6,8],constel:10,constraint:11,constraint_region:11,contain:[2,6,7,8,9,10,11],contour:[4,11],convent:9,convert:[3,4,7,8,9,11],convert_ann_to_constraint_region:11,convert_ann_to_seq_label:7,convert_chord_ann_matrix:8,convert_chord_label:8,convert_l_hertz_to_bin:11,convert_l_sec_to_fram:11,convert_sequence_ann:8,convert_structure_annot:7,convert_trajectory_to_mask_bin:11,convert_trajectory_to_mask_c:11,convolut:6,correspond:[3,4,5,9],cost:[6,10],cost_matrix_dot:10,cover:7,coverag:7,coverage_n:7,cqt:8,creat:[3,4,8,10],criterion:11,csv:[3,4],csv_to_list:[3,4],current:9,curv:[6,9],curve_adsr:4,cut:[3,8,9],cut_audio:3,cut_csv_fil:3,cyc:10,cyclic:[6,7,9,10],cyclic_shift:6,d:[3,4,6,7,8,9,10],d_log:8,dababas:10,data:[3,4,7,11],databas:10,datafram:[3,4],db:4,de:[1,2,3,4,5,6,7,8,9,10,11],decis:3,decod:5,decoding_mu_law:5,decomposit:8,dedic:1,default_label:3,defin:11,define_transition_matrix:11,delft:2,delta:[4,10],delta_cyc:10,delta_ind:10,delta_min:10,delta_n:10,delta_scal:10,delta_ti:10,dencod:5,depend:[7,10],deriv:10,descent:9,descent_thresh:9,descreas:9,describ:9,descript:7,desir:[3,11],detail:[2,3,4,5,6,7,8,9,10,11],detect:9,determ:7,determin:9,deviat:[7,9],df:3,dft:[5,6],diagon:[7,8,10],dict:[3,4,7,9,11],dictionari:[3,7,9,11],differ:[4,5,7,11],difference_c:4,digit:7,dimens:[7,8,10],dir:9,direct:[3,7,9,10,11],discret:5,displai:[3,7],disrcet:5,dist_freq:10,dist_tim:10,distanc:[6,10,11],distribut:[6,7,8],document:[1,10],domain:[2,9],done:10,dot:[3,4,7,10],down_sampl:6,downsampl:[6,7,10],dpi:[3,4,10],drop:9,dtw:[6,10],dur:[4,5],dur_octav:4,durat:[4,5,7,8,9,10],dure:[9,11],dynam:[9,10,11],e:[3,8,9],each:[4,7,8,9,10],edgecolor:3,edgelin:3,educ:2,either:[3,4,6,9,11],ell:10,empti:6,encod:[3,5,7,8],encoding_mu_law:5,end:[3,4,5,8,9,10,11],end_index:7,end_posit:3,end_sec:3,end_tim:11,energi:9,enforc:[7,8],enhanc:[3,7,10],enharmon:8,entri:10,env:4,env_low:4,env_upp:4,envelop:[3,4],ep:11,epsilon:7,eq:[7,11],equal:4,equal_loudness_contour:4,equidist:5,equival:8,erlangen:[1,2,3,4,5,6,7,8,9,10,11],error:[3,5,11],estam:11,estim:[7,8,10],estimate_hmm_from_o_:8,eta:11,eta_dp:11,euclidean:[6,11],evalu:[4,7,8,9,10],evaluate_boundari:7,evaluate_pairwis:7,even:10,event:[3,4],exampl:[2,5],exceed:9,exclud:[7,10],exist:[9,10,11],exp:3,experi:11,experiment_hps_paramet:11,experiment_hrps_paramet:11,explan:[1,2,3,4,5,6,7,8,9,10,11],exponenti:[3,4],ext_minor:8,extend:[7,8],extens:[1,8],extract:11,f0:11,f:[7,8,10,11],f_cent:11,f_coef:[3,5,11],f_coef_bpm:9,f_coef_bpm_log:9,f_coef_cent:[5,6,11],f_coef_hertz:11,f_coef_if:11,f_coef_lag:9,f_coef_lag_cut:9,f_coef_log:5,f_coef_midi:3,f_coef_new:5,f_coef_pitch:6,f_coef_scal:9,f_end:11,f_end_hz:11,f_max:[5,10,11],f_min:[5,11],f_pitch:[4,6],f_q:10,f_ref:11,f_start_hz:11,f_tempo:6,factor:[3,5,6,7,9,10,11],fade:3,fading_msec:3,fals:[3,4,5,6,7,8,9,10,11],famili:7,fancyarrow:5,fashion:[5,7,10],fast:5,fc:3,featur:[3,6,7,8,9,10],fft:[4,5,11],fig:[3,4,6,7,8,9,10,11],figsiz:[3,4,5,6,7,8,9,10,11],figur:[3,4,5,6,7,8,9,10,11],file:[3,4,7,8,9,10,11],filenam:[3,7,8,9,10],filennam:8,fill:7,filt:6,filt_len:[6,8],filt_typ:8,filter:[6,7,8,9,10,11],filter_diag_mult_sm:7,filter_diag_sm:7,filter_len:11,find:1,first:[3,4,7,9,10],fit:7,five:7,flat:8,floatingbox:3,florian:9,fmp:[1,2,3,4,5,6,7,8,9,10,11],fmp_1:[3,4],fmp_colormap:[3,4],fn:[3,7,8,10],fn_ann:[7,8,9],fn_ann_color:7,fn_in:3,fn_out:[3,4],fn_wav:[7,8,9,10,11],focu:2,follow:[3,4,5,6,7,8,9,10,11],font:7,fontsiz:7,form:[3,8],format:[8,11],forward:[7,9],fourier:[6,9],fp:[7,8,9,10],frame:[3,4,5,6,8,9,11],frame_r:[3,11],frank:2,fransform:6,freq:[4,5,6,11],freq_1:4,freq_2:4,freq_cent:4,freq_end:[4,5],freq_max:[4,11],freq_min:4,freq_r:11,freq_rang:4,freq_ref:6,freq_smooth_len:11,freq_start:[4,5],freqgridinterpol:5,frequenc:[3,4,5,6,10,11],frequency_to_bin_index:11,from:[3,5,6,7,8,9,10,11],front:8,fs:[3,4,5,6,7,8,9,10,11],fs_2:5,fs_:7,fs_beat:6,fs_cen:10,fs_f:3,fs_featur:[6,7,9,10],fs_in:9,fs_nov:9,fs_out:9,fs_x:[7,8],fulfil:7,fundament:[2,11],funtion:9,futur:9,g:3,galleri:6,gamma:[5,6,8,9,11],gather:3,gaussian:[7,9],gener:[3,4,5,6,7,8,11],generate_audio_tag_html_list:11,generate_chirp_exp:4,generate_chirp_exp_equal_loud:4,generate_chirp_exp_octav:4,generate_chirp_linear:5,generate_chord_templ:8,generate_figur:5,generate_funct:5,generate_matrix_dft:5,generate_matrix_dft_inv:5,generate_sequence_hmm:8,generate_shepard_glissando:4,generate_shepard_ton:[3,4],generate_sinusoid:4,generate_sinusoid_chord:8,generate_sinusoid_pitch:4,generate_sinusoid_scal:8,generate_sinusoid_tremolo:4,generate_sinusoid_vibrato:4,generate_ssm_from_annot:7,generate_ton:4,get:7,get_chord_label:8,get_color_for_annotation_fil:7,get_induced_seg:10,github:[2,9],given:[3,4,5,6,7,8,9,10,11],glissando:4,global:[6,9],goe:2,grai:3,graph:5,gray_r:[7,8,11],grayscal:3,greatest:9,grid:[8,9],guassian:7,h:[4,5,6,7,8,9,10,11],h_fft:11,h_w_error:11,ha:9,half:9,hand:[2,11],handl:[6,7,8,9,11],harmon:[3,4,11],harmonic_summ:11,harmonic_summation_lf:11,harmonics_weight:3,have:[5,9],head:3,header:[3,9],height:[3,4,8,10,11],height_:4,height_a:4,height_ratio:3,helper:5,hertz:11,hide:[3,11],high:11,higher:9,highest:4,histori:11,hmm:8,hop:[8,9,10,11],hope:[6,9,10],hopsiz:[4,5,11],horizont:[3,7,10,11],host:2,how:1,hp:11,hrp:11,html:[1,3,4,5,6,7,8,9,10,11],http:[1,2,3,4,5,6,7,8,9,10,11],hz:[3,4,5,9,11],hz_to_cent:11,i:[6,7,8,9,10],i_est:8,i_est_po:7,i_ev:7,i_po:7,i_q:10,i_ref:8,i_ref_po:7,i_sort:10,i_ti:7,ideal:4,identifi:7,idft:5,ifft:5,ifft_noscal:5,ii:8,im:[3,6,7,8,10],imag:[3,7,8,10],implement:[3,4,5,6,7,8,9,10,11],imshow:[3,6,7,8,11],imsow:7,inch:[3,4,8,10],includ:[5,8,9,11],include_scor:9,increas:[4,5,9],ind_max:6,ind_zero:7,index:[3,6,7,9,10,11],indic:[6,7,8,10,11],induc:[7,10],inform:[2,9],init:3,init_nmf_activation_scor:11,init_nmf_activation_score_onset:11,init_nmf_template_pitch:11,init_nmf_template_pitch_onset:11,initi:[8,11],inlcud:7,inner:7,input:[3,7,8,9,10,11],insid:[3,7],inspir:3,instal:1,instanc:[3,4],instant:[4,5],instantan:11,instanten:11,instead:6,integ:[7,11],intens:4,intern:[2,9],interplo:5,interpol:5,interpolate_freq_stft:5,interrupt:9,invari:[7,8,10],invers:5,invert:5,ipynb:[3,4,5,6,7,8,9,10,11],ismir:[2,9],istft:5,istft_bas:5,item:[7,8,10],iter:[10,11],its:5,jan:9,k:[3,5,6,7,8,9,10,11],kappa:10,kei:3,kernel:[6,7,9],keyword:[3,6],kreb:9,kwarg:[3,6],l:[5,7,9,10,11],l_h:11,l_h_sec:11,l_p:11,l_p_hz:11,l_smooth:[7,10],l_unit:11,label:[3,4,6,7,8,9,10,11],label_ann:7,label_kei:[3,9],label_pitch:11,label_tick:3,labels_set:3,lag:[7,9],larger:9,last:[7,8,9],law:5,layout:3,lead:9,learn:2,least:9,left:[3,11],len:11,len_:4,len_a:4,len_d:4,len_r:4,length:[3,4,5,6,7,8,9,10,11],level:[3,4,5,8,10],libfmp:1,librosa:5,like:[3,4,5,6,7,8,9,10,11],likelihood:8,limit:[3,5,6,7,9,10],line:[3,6,8,9],line_styles_refer:6,linear:[5,6],linearsegmentedcolormap:3,lines_bars_and_mark:6,linestyl:[5,6,9],linewidth:9,list:[3,4,6,7,8,9,10,11],list_to_chromagram:3,list_to_csv:4,list_to_pitch_activ:3,list_x:11,local:[6,7,9,10],local_averag:9,local_lag:9,log:[3,6,8,11],log_compress:6,logarithm:[3,5,6,7,8,9,10,11],logartihm:6,logscal:6,look:9,loud:4,low:11,lower:[4,9,11],lowest:[3,4],m:[6,7,8,9,10],mag:5,magnitud:[4,5,6,10,11],main:7,main_diagon:7,major:8,make_colorbar:3,make_integer_odd:11,manag:1,manner:10,map:[3,7,8,10,11],marker:[6,10],markers_api:6,marku:9,mask:[10,11],maskig:11,match:10,match_binary_matrices_tol:10,matches_diag:10,matches_dtw:10,matching_function_diag:10,matching_function_diag_multipl:10,materi:2,matlab:9,matplotlib:[3,4,5,6,8,9,10],matric:[7,8,10,11],matrix:[3,5,6,7,8,9,10,11],matrix_chord24_trans_inv:8,matrix_circular_mean:8,max:[3,6,7,8,9,11],maxim:[3,6,7,8,9,10,11],maximum:[5,7,9,10,11],mean:[7,8,10],meaning:10,measur:[6,7,8,9,10],measure_po:6,measure_prf:7,measure_prf_set:7,media:9,median:[6,9,11],median_downsample_feature_sequ:6,median_filter_horizont:11,median_filter_vert:11,median_len:9,meinard:2,meinardmuel:2,melodi:11,method:[3,9],metric:[6,7,10],middl:3,midi:[3,4,6,8],midi_pitch:11,midi_to_list:4,might:9,min:[3,7,8],min_pitch:3,minim:[3,10],minima:10,minimum:[5,7,10],mininma_from_matching_funct:10,minor:8,mir:[1,3,4,5,6,7,8,9,10,11],miss:3,model:[4,8],modifi:9,modul:[3,4,5,6,7,8,9,10,11],mono:3,move:9,mpl:[3,4,5,6,7,9],msaf:9,msec:3,msfa:9,mu:5,multi:3,multipl:10,multipleplotswithcolorbar:3,music21:4,music:[2,9],must:[7,9],n:[3,4,5,6,7,8,9,10,11],n_fft:11,n_harmon:11,n_new:10,nadarrai:9,naiv:10,name:[6,9],nativ:3,nda:10,ndarra:9,ndarrai:[3,4,5,6,7,8,9,10,11],nearest:7,need:[3,11],neg:[7,8,9,10],neigborhood:9,neighborhood:10,netherland:2,nmf:11,nnot:3,nois:7,noise_pow:7,non:[3,5],nonchord:8,none:[3,4,5,6,7,8,9,10,11],nonneg:11,nontime_axi:3,nontime_max:3,nontime_min:3,nonuniform:5,norm:[3,6,8,9,11],norm_sim:8,norm_sum:9,normal:[3,6,7,8,9,11],normalization_properties_ssm:7,normalize_feature_sequ:6,normliz:7,note:[3,4,5,6,7,8,9,10,11],note_list:3,note_nam:6,notebook:[1,2,3,4,5,6,7,8,9,10,11],notebookb:[],notebookc1:[],notebookc2:[],notebookc2s2_digitalsignalquant:[],notebookc3:[],notebookc4:[],notebookc4s2_ssm:[],notebookc5:[],notebookc6:[],notebookc6s3_adaptivewindow:[],notebookc7:[],notebookc8:[],nov:[7,9],nov_dic:9,nov_matrix:9,nov_plp:9,novelti:[3,7,9],novelty_complex:9,novelty_energi:9,novelty_phas:9,novelty_spectrum:9,novelty_structure_featur:7,np:[3,4,5,6,7,8,9,10,11],num:[7,10],num_fn:[7,8],num_fp:[7,8],num_fram:3,num_harm:11,num_octav:4,num_plot:3,num_point:4,num_tick:9,num_tp:[7,8],number:[3,4,5,7,8,9,10,11],o:[6,8,10],object:4,observ:8,obtain:10,ocatv:4,occur:[7,9,11],octav:[4,9],octave_bin:9,octave_num:9,odd:11,off:3,offset:[7,9],offset_rel:9,omit:9,one:[4,7,9],ones:4,onli:[3,5,6,8,9,10],onlin:9,only_positive_frequ:5,onset:[9,11],oppos:11,optim:[6,7,8,9,10],option:[3,4,11],org:6,origin:[3,5,7],oscil:4,other:[3,7,10],otherwis:[6,7,8,10],out:3,output:[8,9,10],over:[10,11],overal:6,overlai:[3,7],p:[3,4,6,7,8,9,10],p_averag:10,p_bin:11,p_bin_if:11,p_mod:6,p_q:10,packag:[1,2],pad:[5,7],pad_mod:5,pair:[6,7,9,10],pairwis:7,panda:3,param_list:11,paramet:[3,4,5,6,7,8,9,10,11],parmat:9,part:[3,4,5,6,7,8,9,10,11],partial:10,particular:[1,2],past:9,patch:5,path:[3,4,6,7,10,11],path_famili:7,path_family_length:7,pathenhanc:7,pd:[3,4],peak:[9,10],peak_picking_boeck:9,peak_picking_msaf:9,peak_picking_roed:9,peak_picking_simpl:9,penalti:[7,9,10],per:[3,4,9,10],percuss:11,perform:3,period:9,phase:[3,4,9],physic:11,pianorol:4,pick:9,pip:1,pitch:[3,4,6,8,11],pitch_from_annot:11,pitch_ref:6,pitch_set:11,pitch_son:3,player:3,pleas:2,plot:[3,4,5,6,7,8,9,10,11],plot_annotation_lin:3,plot_annotation_line_overlai:3,plot_annotation_multilin:3,plot_beat_grid:9,plot_boundary_measur:7,plot_chromagram:3,plot_chromagram_annot:8,plot_constellation_map:10,plot_feature_ssm:7,plot_freq_vector_templ:6,plot_graph_quant_funct:5,plot_interfer:5,plot_match:10,plot_matrix:[3,6],plot_matrix_chord_ev:8,plot_matrix_label:7,plot_matrix_pairwis:7,plot_matrix_with_point:6,plot_maxtempo:9,plot_measur:6,plot_mu_law:5,plot_nmf_factor:11,plot_path_famili:7,plot_seg:[3,7],plot_seg_in_sp:7,plot_segments_overlai:3,plot_seq_label:7,plot_sign:3,plot_signal_kernel:9,plot_signal_local_lag:9,plot_signal_qu:5,plot_sp_ssm:7,plot_spectrogram:4,plot_ssm_ann:7,plot_ssm_ann_optimal_path_famili:7,plot_ssm_structure_feature_nov:7,plot_tempo_curv:6,plot_transition_matrix:8,plot_tuning_similar:6,plot_vector:5,plp:9,png:3,po:10,point:[4,7,10,11],pool_pitch:6,posit:[3,5,6,7,8,9,10],possibl:[8,9],post_avg:9,post_max:9,power:[4,6],power_db:4,power_ref:4,pp:2,pramaet:10,pre_avg:9,pre_max:9,precis:[7,8,10],prefilit:8,pretty_midi:4,prettymidi:4,princip:[9,11],principal_argu:[9,11],principl:[9,11],print:[3,7,9],print_label:[3,7],print_tabl:9,probabl:8,problem:8,procedur:7,proceed:[2,9],process:[2,9,10],product:[7,10],program:[9,11],proj_i:7,proj_x:7,project:7,properti:7,provid:[3,4,5,6,7,8,9,10,11],purpos:5,px:11,pyhsic:11,pyplot:3,python:[1,2,9],quadrant:8,quant:[5,10],quant_fct:10,quant_level:5,quant_max:5,quant_min:5,quantiz:[3,5,10],quantize_matrix:10,quantize_nonuniform_mu:5,quantize_uniform:5,queri:10,r:[4,5,6,7,8,9,10,11],r_q:10,rais:3,rang:[7,9,10],rank:[10,11],rank_sort:10,rate:[3,4,5,6,7,8,9,10,11],read:[3,7,9],read_annotation_po:9,read_audio:3,read_csv:3,read_structure_annot:7,reat:8,recal:[7,8,10],reckjn:9,recognt:8,reconstruct:[5,11],reconstruction_sinc:5,rectangl:[3,4,7],rectif:6,refer:[2,4,5,6,7,8,9,10,11],referen:7,refin:5,regard:[7,9],region:11,rel:[7,9,10,11],rel_thresh:9,relat:[3,4,5,6,7,8,9,10,11],relev:10,remov:7,remove_digit:7,replac:8,report:[9,11],repres:[6,9],represent:[3,6,7,8,9,10,11],resampl:[3,7,9],resample_sign:9,residu:11,resolut:[5,11],resourc:[1,3,4,5,6,7,8,9,10,11],respampl:9,respresent:7,result:[7,8,10],result_hmm:8,result_tem:8,retriev:[2,9],return_al:9,revers:3,rgb:3,rho:[5,10],right:[3,11],roeder_peak_pick:9,round:[7,10],row:[3,8,11],rrai:10,run:11,runtim:11,s:[1,4,6,7,8,10],s_l:7,s_l_final:7,s_marker:10,s_mat:8,s_normal:7,s_opt:8,s_seg:7,s_thresh:[7,10],s_ti:7,salienc:11,same:[7,9,10],samp:6,sampl:[3,4,5,6,7,8,9,10,11],sampling_equidist:5,satisfi:[7,9],save:3,scalar:[3,4,5,6,7,8,9,10,11],scale:[3,5,7,8,9,10],scale_tempo_sequ:10,scape:7,scatter:10,schedl:9,scheme:7,schlueter:9,scholarli:2,scipi:6,scipython:7,score:[4,6,7,9,10,11],score_block:7,score_high:11,score_low:11,score_n:7,score_path:7,script:[9,11],search:9,sebastian:9,second:[3,4,5,7,8,9,10,11],secondari:9,section:[7,9],see:[3,6,7,9,11],seg:7,seg_i:10,seg_max_sp:7,seg_x:10,segement:7,segment:[3,7,8,10],segment_famili:7,self:[7,8],sensibl:9,separ:11,separate_melody_accompani:11,seq:8,sequenc:[6,7,8,9,10],serv:5,set:[3,6,7,8,9,10,11],set_yticks_tempogram_cycl:9,sever:[3,4,10],sharp:8,shepar:4,shepard:[3,4],shift:[6,7,10],shift_cyc_matrix:7,shift_max:10,shift_set:[7,10],shortli:9,should:[7,10],show:[3,7,8,11],shown:11,sigma:[3,5,6,9],signal:[3,4,6,7,8,9,10,11],sim:6,simila:7,similar:[6,7,8,10],similarti:7,similartii:7,similiarti:6,simul:7,sinc:5,sine:3,singl:[3,4,10],sinusoid:[4,8,9,11],situat:9,size:[4,5,6,7,8,9,10,11],slope:9,sm:[7,10],smaller:10,smooth:[6,7,9,10,11],smooth_downsample_feature_sequ:6,smooth_len:11,smooth_sigma:7,societi:9,soft:11,solv:8,some:9,sonfi:9,sonif:[3,11],sonifi:3,sonify_chromagram:3,sonify_chromagram_with_sign:3,sonify_pitch_activ:3,sonify_pitch_activations_with_sign:3,sonify_trajectory_with_sinusoid:11,sort:[3,10],sort_label:3,sound:8,sourc:[2,3,4,5,6,7,8,9,10,11],sp:7,sp_all:7,space:7,spatial:6,specif:[3,4,7],specifi:[4,7,8,9,10,11],spectral:[9,11],spectrogram:[3,4,6,10,11],spectrum:5,spefi:9,spefifi:6,split:11,split_annotation_lh_rh:11,squar:8,ssm:7,stackoverflow:3,standalon:3,standard:[7,9],start:[3,4,5,7,9,10,11],start_index:7,start_posit:3,start_sec:3,start_tim:11,state:8,step:[5,6,10],stepsiz:10,stereo:3,stft:[5,6,8,10,11],stft_basic:5,stft_convention_fmp:5,stop:11,str:[3,4,5,6,7,8,9,10,11],strategi:[5,7,9,10],stream:4,strict:6,string:[3,4,6,8,11],structur:10,style:[6,7,9],submatrix:7,subplot:[6,7],subplot_matrix_colorbar:7,subplot_matrix_ti_colorbar:7,subsequ:[4,10,11],sum:[3,8],summand:9,summat:11,superposit:5,surviv:9,swap_time_tick:3,symbol:8,sync:9,synthes:8,synthet:[7,8],t:[4,5,7,11],t_1:5,t_beat:6,t_coef:[3,9,11],t_end_sec:11,t_kernel:9,t_kernel_sec:9,t_local_lag:9,t_marker:10,t_sinc:5,t_start_sec:11,t_x:9,tabl:[9,11],tag:11,taper:7,tau:[7,10],teach:2,techniqu:[3,4,5,6,7,8,9,10,11],temp:6,tempi:9,templat:[6,8,11],template_comb:6,template_max:6,template_pitch:11,tempo:[6,7,10],tempo_ref:9,tempo_rel_max:7,tempo_rel_min:7,tempo_rel_set:[7,10],tempogram:[3,9],tempogram_cycl:9,tempogram_log:9,textbook:[3,4,5,6,7,8,9,10,11],than:[9,10],theta:[6,9],theta_axi:6,theta_max:6,thi:[1,2,3,4,5,6,7,8,9,10,11],third:[3,7],three:3,thresh:[7,10,11],thresh_ab:7,thresh_rel:7,threshold:[6,7,9,10,11],threshold_loc:9,threshold_matrix:7,threshold_matrix_rel:7,tick:[3,7],time:[3,4,5,6,7,8,9,10,11],time_axi:[3,7],time_label:3,time_max:3,time_max_sec:9,time_min:3,time_posit:3,titl:[3,4,5,6,7,8,9,10,11],title_h:11,title_v:11,title_w:11,tmax:9,tmin:9,togeth:3,tol:11,tol_bin:11,tol_cent:11,tol_freq:10,tol_freq_c:11,tol_not:11,tol_onset:11,tol_pitch:11,tol_tim:10,toler:[7,10,11],tone:[3,4],toolbox:9,total:7,tp:[7,8,10],track:[10,11],traj:11,trajectori:11,tranposit:6,transform:5,transfrom:5,transisit:11,transit:[8,11],transpar:10,transposit:[7,8,10],transpositioninvari:7,trem_amp:4,trem_rat:4,tremolo:4,treshold:[7,10],triad:8,tune:[3,6],tuning_similar:6,tupl:[3,4,5,7,8],twiddl:5,twiddle_inv:5,two:[3,4,5,6],type:[5,6,8],uncov:8,uniform:[5,8],uniform_transition_matrix:8,uninterrupt:9,unit:[6,11],unvoic:11,up:3,upper:[4,11],urinieto:9,url:[3,4,5,6,7,8,9,10,11],us:[1,2,3,4,5,6,7,8,9,10,11],user:[3,6],usual:3,v:[5,6,9,11],v_approx:11,v_approx_err:11,v_compress:6,v_decod:5,v_encod:5,valid:6,valu:[3,4,5,6,7,8,9,10,11],variabl:11,varianc:[7,9],variant:8,variou:[7,8],vector:[5,6,7,8,9,11],veloc:4,velocity_alpha:4,verfic:9,version:[5,7,8,10],vertic:[3,7,8,10,11],via:10,vib_amp:4,vib_rat:4,vibrato:4,view:5,visual:[4,6,7,9,10,11],visualize_piano_rol:4,visualize_salience_traj_constraint:11,visualize_scape_plot:7,visul:7,viterbi:8,viterbi_log:8,viterbi_log_likelihood:8,w:[5,9,11],w_type:6,w_x:7,w_y:7,wa:[3,4,8],wapr:6,warn:7,warp:[6,10],wav:[7,8,10],wave:11,waveform:[3,4,11],we:2,webpag:[1,2],weight:[3,4,9,11],weight_harmon:4,when:[5,6,8,10],where:[3,4],which:[3,6,9],white:[3,7],width:[3,4,7,8,9,10,11],win_len_beat:6,win_len_sec:4,window:[4,5,6,8,9,10,11],without:5,work:2,would:9,write:3,write_audio:3,write_csv:3,www:[1,3,4,5,6,7,8,9,10,11],x1:[5,10],x2:[5,10],x:[3,4,5,6,7,8,9,10,11],x_1:5,x_acc:11,x_adapt:9,x_cen:10,x_cut:3,x_cyc:7,x_dur:8,x_durat:[7,10],x_h:11,x_in:9,x_mel:11,x_new:10,x_norm:6,x_offset:7,x_out:9,x_p:11,x_q:10,x_quant:5,x_r:11,x_score:6,x_sinc:5,x_smooth:6,x_soni:11,xlabel:[3,4,6,7,8,10],xlim:[3,5,6,7,9,10],xml:4,xml_to_list:4,xtick:3,y:[3,4,5,6,7,8,10,11],y_h:11,y_interpol:5,y_lf:6,y_lf_bin:11,y_lf_bin_h:11,y_lf_if_bin:11,y_offset:7,yet:9,yffset:7,yield:7,ylabel:[3,4,6,7,8,10],ylim:[3,5,6,7,10],you:[1,2],ytick:[3,9],z:[6,11],zalkow:2,zero:[5,7],zero_pad:5,zoom:7},titles:["Index","Getting Started","Libfmp API Documentation","Basics (libfmp.b)","Music Representations (libfmp.c1)","Fourier Analysis of Signals (libfmp.c2)","Music Synchronization (libfmp.c3)","Music Structure Analysis (libfmp.c4)","Chord Recognition (libfmp.c5)","Tempo and Beat Tracking (libfmp.c6)","Content-Based Audio Retrieval (libfmp.c7)","Musically Informed Audio Decomposition (libfmp.c8)","Module Index"],titleterms:{analysi:[5,7],api:2,audio:[10,11],b:3,base:10,basic:3,beat:9,c1:4,c2:5,c3:6,c4:7,c5:8,c6:9,c7:10,c8:11,chord:8,content:10,decomposit:11,document:2,fourier:5,get:1,index:[0,12],inform:11,libfmp:[2,3,4,5,6,7,8,9,10,11],modul:12,music:[4,6,7,11],recognit:8,represent:4,retriev:10,signal:5,start:1,structur:7,synchron:6,tempo:9,track:9}}) \ No newline at end of file diff --git a/docs/environment.yml b/docs/environment.yml new file mode 100644 index 0000000..bed33f9 --- /dev/null +++ b/docs/environment.yml @@ -0,0 +1,8 @@ +name: libfmp_docs +dependencies: + - python==3.7.* + - pip: + # - libfmp # using a freshly downloaded version of libfmp in the ci script + # - sphinx==3.5.* # we need features from version 4 (autodoc_preserve_defaults) + - git+git://github.com/sphinx-doc/sphinx.git@v4.0.0b1#egg=sphinx + - sphinx_rtd_theme==0.5.* diff --git a/docs/index.html b/docs/index.html new file mode 100644 index 0000000..0707108 --- /dev/null +++ b/docs/index.html @@ -0,0 +1 @@ + diff --git a/docs/make.bat b/docs/make.bat new file mode 100644 index 0000000..9534b01 --- /dev/null +++ b/docs/make.bat @@ -0,0 +1,35 @@ +@ECHO OFF + +pushd %~dp0 + +REM Command file for Sphinx documentation + +if "%SPHINXBUILD%" == "" ( + set SPHINXBUILD=sphinx-build +) +set SOURCEDIR=source +set BUILDDIR=build + +if "%1" == "" goto help + +%SPHINXBUILD% >NUL 2>NUL +if errorlevel 9009 ( + echo. + echo.The 'sphinx-build' command was not found. Make sure you have Sphinx + echo.installed, then set the SPHINXBUILD environment variable to point + echo.to the full path of the 'sphinx-build' executable. Alternatively you + echo.may add the Sphinx directory to PATH. + echo. + echo.If you don't have Sphinx installed, grab it from + echo.http://sphinx-doc.org/ + exit /b 1 +) + +%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O% +goto end + +:help +%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O% + +:end +popd diff --git a/docs/source/_static/Logo_libfmp.png b/docs/source/_static/Logo_libfmp.png new file mode 100644 index 0000000..ba7177a Binary files /dev/null and b/docs/source/_static/Logo_libfmp.png differ diff --git a/docs/source/_templates/.gitkeep b/docs/source/_templates/.gitkeep new file mode 100644 index 0000000..e69de29 diff --git a/docs/source/conf.py b/docs/source/conf.py new file mode 100644 index 0000000..f333ab7 --- /dev/null +++ b/docs/source/conf.py @@ -0,0 +1,136 @@ +# Configuration file for the Sphinx documentation builder. +# +# This file only contains a selection of the most common options. For a full +# list see the documentation: +# https://www.sphinx-doc.org/en/master/usage/configuration.html + +# -- Path setup -------------------------------------------------------------- + +# If extensions (or modules to document with autodoc) are in another directory, +# add these directories to sys.path here. If the directory is relative to the +# documentation root, use os.path.abspath to make it absolute, like shown here. +# +import re +import os + +# using local version of libfmp +import sys +FMP_DIR = os.path.abspath(os.path.join(os.path.dirname(__file__), '..', '..')) +assert os.path.exists(os.path.join(FMP_DIR, 'libfmp')) +sys.path.insert(0, FMP_DIR) + +import libfmp # noqa +import libfmp.b # noqa +import libfmp.c1 # noqa +import libfmp.c2 # noqa +import libfmp.c3 # noqa +import libfmp.c4 # noqa +import libfmp.c5 # noqa +import libfmp.c6 # noqa +import libfmp.c7 # noqa +import libfmp.c8 # noqa + +assert libfmp.__path__[0].startswith(FMP_DIR) + +# -- Project information ----------------------------------------------------- + +project = 'libfmp' +copyright = '2021, Meinard Müller and Frank Zalkow' +author = 'Meinard Müller and Frank Zalkow' + +# The version info for the project you're documenting, acts as replacement for +# |version| and |release|, also used in various other places throughout the +# built documents. + +import pkg_resources # noqa + +libfmp_version = pkg_resources.require('libfmp')[0].version +version = libfmp_version +release = libfmp_version + + +# -- General configuration --------------------------------------------------- + +# Add any Sphinx extension module names here, as strings. They can be +# extensions coming with Sphinx (named 'sphinx.ext.*') or your custom +# ones. +extensions = [ + 'sphinx.ext.autodoc', # documentation based on docstrings + 'sphinx.ext.napoleon', # for having google/numpy style docstrings + 'sphinx.ext.viewcode', # link source code + 'sphinx.ext.intersphinx', + 'sphinx.ext.autosummary', + 'sphinx.ext.extlinks' +] + +# Add any paths that contain templates here, relative to this directory. +templates_path = ['_templates'] + +# List of patterns, relative to source directory, that match files and +# directories to ignore when looking for source files. +# This pattern also affects html_static_path and html_extra_path. +exclude_patterns = [] + +# The name of the Pygments (syntax highlighting) style to use. +pygments_style = 'sphinx' + +# -- Options for HTML output ------------------------------------------------- + +# The theme to use for HTML and HTML Help pages. See the documentation for +# a list of builtin themes. +# +# html_theme = 'alabaster' +import sphinx_rtd_theme # noqa + +html_theme = "sphinx_rtd_theme" +html_theme_path = [sphinx_rtd_theme.get_html_theme_path()] + +# Add any paths that contain custom static files (such as style sheets) here, +# relative to this directory. They are copied after the builtin static files, +# so a file named "default.css" will overwrite the builtin "default.css". +html_static_path = ['_static'] + +html_use_index = True +html_use_modindex = True + +html_logo = os.path.join(html_static_path[0], 'Logo_libfmp.png') + +html_theme_options = {'logo_only': True} + +# do not evaluate keyword default values +# useful, e.g., for libfmp.c6.c6s2_tempo_analysis.compute_plot_tempogram_plp), where np.arange(30, 601) is a default +autodoc_preserve_defaults = True + +# Interpret "Returns" section as "Args" section +napoleon_custom_sections = [('Returns', 'params_style'), ('Attributes', 'params_style')] + +extlinks = {'fmpbook': ('https://www.audiolabs-erlangen.de/fau/professor/mueller/bookFMP', 'FMP'), + 'fmpnotebook': ('https://www.audiolabs-erlangen.de/resources/MIR/FMP/%s.html', '%s.ipynb')} + + +# -- Customn pre-processing of docstrings ------------------------------------ + +def link_notebook(app, what, name, obj, options, lines): + for i, line in enumerate(lines): + if 'Notebook:' in line: + match = re.search('Notebook: (.*?)\.ipynb', line) + if match: + link = match.group(1) + lines[i] = lines[i].replace(f'{link}.ipynb', f':fmpnotebook:`{link}`') + + +def link_book(app, what, name, obj, options, lines): + for i, line in enumerate(lines): + if '[FMP' in line: + lines[i] = lines[i].replace('[FMP', '[:fmpbook:`\ `') + + +def remove_module_docstring(app, what, name, obj, options, lines): + if what == 'module': + del lines[:] + + +def setup(app): + app.connect('autodoc-process-docstring', link_notebook) + app.connect('autodoc-process-docstring', link_book) + app.connect('autodoc-process-docstring', remove_module_docstring) diff --git a/docs/source/genindex.rst b/docs/source/genindex.rst new file mode 100644 index 0000000..9e530fa --- /dev/null +++ b/docs/source/genindex.rst @@ -0,0 +1,2 @@ +Index +===== diff --git a/docs/source/getting_started.rst b/docs/source/getting_started.rst new file mode 100644 index 0000000..a58d828 --- /dev/null +++ b/docs/source/getting_started.rst @@ -0,0 +1,17 @@ +Getting Started +=============== + +You can install libfmp using the Python package manager pip: + +.. code-block:: bash + + pip install libfmp + +Beyond the API documentation of this webpage, you find extensive explanations of libfmp's functionality in the FMP Notebooks: + +https://www.audiolabs-erlangen.de/FMP + +In particular, there are dedicated notebooks on how to get started with FMP and on libfmp. + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/B/B_GetStarted.html +https://www.audiolabs-erlangen.de/resources/MIR/FMP/B/B_libfmp.html diff --git a/docs/source/index.rst b/docs/source/index.rst new file mode 100644 index 0000000..7766a9c --- /dev/null +++ b/docs/source/index.rst @@ -0,0 +1,45 @@ +Libfmp API Documentation +======================== + +This webpage contains the API documentation for the Python package libfmp. +This package goes hand in hand with the FMP Notebooks, a collection of educational material for teaching and learning Fundamentals of Music Processing (FMP) with a particular focus on the audio domain. +For detailed explanations and example applications of the libfmp-functions, we refer to the FMP Notebooks: + +http://audiolabs-erlangen.de/FMP + +The source code for the package libfmp is hosted at GitHub: + +https://github.com/meinardmueller/libfmp + +If you use libfmp in a scholarly work, please consider citing the FMP article. [#]_ + +.. [#] Meinard Müller and Frank Zalkow. FMP Notebooks: Educational Material for Teaching and Learning Fundamentals of Music Processing. Proceedings of the International Conference on Music Information Retrieval (ISMIR), pp. 573-580, Delft, The Netherlands, 2019. + +.. toctree:: + :hidden: + + getting_started + + +.. toctree:: + :caption: API Documentation + :maxdepth: 1 + :hidden: + + index_b + index_c1 + index_c2 + index_c3 + index_c4 + index_c5 + index_c6 + index_c7 + index_c8 + +.. toctree:: + :caption: Reference + :maxdepth: 1 + :hidden: + + genindex + py-modindex diff --git a/docs/source/index_b.rst b/docs/source/index_b.rst new file mode 100644 index 0000000..a540f3a --- /dev/null +++ b/docs/source/index_b.rst @@ -0,0 +1,29 @@ +Basics (libfmp.b) +================= + +The `FMP notebooks `_ provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL: + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/B/B.html + +.. automodule:: libfmp.b + :members: + :undoc-members: +.. automodule:: libfmp.b.b_annotation + :members: + :undoc-members: +.. automodule:: libfmp.b.b_audio + :members: + :undoc-members: +.. automodule:: libfmp.b.b_layout + :members: + :undoc-members: +.. automodule:: libfmp.b.b_plot + :members: + :undoc-members: +.. automodule:: libfmp.b.b_sonification + :members: + :undoc-members: +.. automodule:: libfmp.b.b_test_module + :members: + :undoc-members: diff --git a/docs/source/index_c1.rst b/docs/source/index_c1.rst new file mode 100644 index 0000000..e27347e --- /dev/null +++ b/docs/source/index_c1.rst @@ -0,0 +1,20 @@ +Music Representations (libfmp.c1) +================================= + +The `FMP notebooks `_ provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL: + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/C1/C1.html + +.. automodule:: libfmp.c1 + :members: + :undoc-members: +.. automodule:: libfmp.c1.c1s1_sheet_music + :members: + :undoc-members: +.. automodule:: libfmp.c1.c1s2_symbolic_rep + :members: + :undoc-members: +.. automodule:: libfmp.c1.c1s3_audio_rep + :members: + :undoc-members: diff --git a/docs/source/index_c2.rst b/docs/source/index_c2.rst new file mode 100644 index 0000000..703613c --- /dev/null +++ b/docs/source/index_c2.rst @@ -0,0 +1,26 @@ +Fourier Analysis of Signals (libfmp.c2) +======================================= + +The `FMP notebooks `_ provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL: + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/C2/C2.html + +.. automodule:: libfmp.c2 + :members: + :undoc-members: +.. automodule:: libfmp.c2.c2_complex + :members: + :undoc-members: +.. automodule:: libfmp.c2.c2_digitization + :members: + :undoc-members: +.. automodule:: libfmp.c2.c2_fourier + :members: + :undoc-members: +.. automodule:: libfmp.c2.c2_interference + :members: + :undoc-members: +.. automodule:: libfmp.c2.c2_interpolation + :members: + :undoc-members: diff --git a/docs/source/index_c3.rst b/docs/source/index_c3.rst new file mode 100644 index 0000000..0bcba4a --- /dev/null +++ b/docs/source/index_c3.rst @@ -0,0 +1,29 @@ +Music Synchronization (libfmp.c3) +================================= + +The `FMP notebooks `_ provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL: + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/C3/C3.html + +.. automodule:: libfmp.c3 + :members: + :undoc-members: +.. automodule:: libfmp.c3.c3s1_audio_feature + :members: + :undoc-members: +.. automodule:: libfmp.c3.c3s1_post_processing + :members: + :undoc-members: +.. automodule:: libfmp.c3.c3s1_transposition_tuning + :members: + :undoc-members: +.. automodule:: libfmp.c3.c3s2_dtw + :members: + :undoc-members: +.. automodule:: libfmp.c3.c3s2_dtw_plot + :members: + :undoc-members: +.. automodule:: libfmp.c3.c3s3_tempo_curve + :members: + :undoc-members: diff --git a/docs/source/index_c4.rst b/docs/source/index_c4.rst new file mode 100644 index 0000000..6b1421d --- /dev/null +++ b/docs/source/index_c4.rst @@ -0,0 +1,35 @@ +Music Structure Analysis (libfmp.c4) +==================================== + +The `FMP notebooks `_ provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL: + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/C4/C4.html + +.. automodule:: libfmp.c4 + :members: + :undoc-members: +.. automodule:: libfmp.c4.c4s1_annotation + :members: + :undoc-members: +.. automodule:: libfmp.c4.c4s2_ssm + :members: + :undoc-members: +.. automodule:: libfmp.c4.c4s2_synthetic_ssm + :members: + :undoc-members: +.. automodule:: libfmp.c4.c4s2_threshold + :members: + :undoc-members: +.. automodule:: libfmp.c4.c4s3_thumbnail + :members: + :undoc-members: +.. automodule:: libfmp.c4.c4s4_novelty_kernel + :members: + :undoc-members: +.. automodule:: libfmp.c4.c4s4_structure_feature + :members: + :undoc-members: +.. automodule:: libfmp.c4.c4s5_evaluation + :members: + :undoc-members: diff --git a/docs/source/index_c5.rst b/docs/source/index_c5.rst new file mode 100644 index 0000000..ce3e73c --- /dev/null +++ b/docs/source/index_c5.rst @@ -0,0 +1,20 @@ +Chord Recognition (libfmp.c5) +============================= + +The `FMP notebooks `_ provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL: + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/C5/C5.html + +.. automodule:: libfmp.c5 + :members: + :undoc-members: +.. automodule:: libfmp.c5.c5s1_basic_theory_harmony + :members: + :undoc-members: +.. automodule:: libfmp.c5.c5s2_chord_rec_template + :members: + :undoc-members: +.. automodule:: libfmp.c5.c5s3_chord_rec_hmm + :members: + :undoc-members: diff --git a/docs/source/index_c6.rst b/docs/source/index_c6.rst new file mode 100644 index 0000000..a3ff5fb --- /dev/null +++ b/docs/source/index_c6.rst @@ -0,0 +1,26 @@ +Tempo and Beat Tracking (libfmp.c6) +=================================== + +The `FMP notebooks `_ provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL: + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/C6/C6.html + +.. automodule:: libfmp.c6 + :members: + :undoc-members: +.. automodule:: libfmp.c6.c6s1_onset_detection + :members: + :undoc-members: +.. automodule:: libfmp.c6.c6s1_peak_picking + :members: + :undoc-members: +.. automodule:: libfmp.c6.c6s2_tempo_analysis + :members: + :undoc-members: +.. automodule:: libfmp.c6.c6s3_adaptive_windowing + :members: + :undoc-members: +.. automodule:: libfmp.c6.c6s3_beat_tracking + :members: + :undoc-members: diff --git a/docs/source/index_c7.rst b/docs/source/index_c7.rst new file mode 100644 index 0000000..1497c02 --- /dev/null +++ b/docs/source/index_c7.rst @@ -0,0 +1,20 @@ +Content-Based Audio Retrieval (libfmp.c7) +========================================= + +The `FMP notebooks `_ provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL: + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/C7/C7.html + +.. automodule:: libfmp.c7 + :members: + :undoc-members: +.. automodule:: libfmp.c7.c7s1_audio_id + :members: + :undoc-members: +.. automodule:: libfmp.c7.c7s2_audio_matching + :members: + :undoc-members: +.. automodule:: libfmp.c7.c7s3_version_id + :members: + :undoc-members: diff --git a/docs/source/index_c8.rst b/docs/source/index_c8.rst new file mode 100644 index 0000000..82b007e --- /dev/null +++ b/docs/source/index_c8.rst @@ -0,0 +1,23 @@ +Musically Informed Audio Decomposition (libfmp.c8) +================================================== + +The `FMP notebooks `_ provide detailed textbook-like explanations of central techniques and algorithms implemented in the libfmp. +The part of FMP related to this module is available at the following URL: + +https://www.audiolabs-erlangen.de/resources/MIR/FMP/C8/C8.html + +.. automodule:: libfmp.c8 + :members: + :undoc-members: +.. automodule:: libfmp.c8.c8s1_hps + :members: + :undoc-members: +.. automodule:: libfmp.c8.c8s2_f0 + :members: + :undoc-members: +.. automodule:: libfmp.c8.c8s2_salience + :members: + :undoc-members: +.. automodule:: libfmp.c8.c8s3_nmf + :members: + :undoc-members: diff --git a/docs/source/py-modindex.rst b/docs/source/py-modindex.rst new file mode 100644 index 0000000..f6c180c --- /dev/null +++ b/docs/source/py-modindex.rst @@ -0,0 +1,2 @@ +Module Index +============