-
... wslib backups every move you make AutoBackup creates a folder called "_Backup" inside your "~/scwork" folder. A copy of every open document is saved there and saved again after a key is pressed. This will save your work whenever SC crashes ...
-
... an-Samples Like Dirt-Samples, but cleaned up, with clear provenance and license info (generally a permissive creative commons licence but check the metadata for specifics). The [bin/meta.py](bin/meta.py) python script is a reference impleme ...
-
// AlgaLib: SuperCollider implementation of Alga, an interpolating live coding environment. // Copyright (C) 2020-2022 Francesco Cameli. // This program is free software: you can redistribute it and/or modify // it under the terms of the GN ...
-
UGlobalControlKeySpec : Spec { *new { ^super.newCopyArgs(); } map { |in| ^in } unmap { |in| ^in } constrain { |key| key = key.asSymbol; if( key.notNil && { UGlobalControl.current.keys.any({ |item| item == key }).not }) { UGlobalControl.curr ...
-
# NTMI_AI_sc - A project folder for SuperCollider This repository contains the full setup for the Nontrivial Music Instrument (NTMI) by Airborne Instruments. You can code is all in SuperCollider, and can be loaded from the SuperCollider IDE ...
-
UGlobalControlKeySpec : Spec { *new { ^super.newCopyArgs(); } map { |in| ^in } unmap { |in| ^in } constrain { |key| key = key.asSymbol; if( key.notNil && { UGlobalControl.current.keys.any({ |item| item == key }).not }) { UGlobalControl.curr ...
-
HS with VarGui using HS / HSpar with VarGui Part of: miSCellaneous See also: Working with HS and HSpar , VarGui , VarGui shortcut builds , Event patterns and LFOs , Event patterns and Functions It is recommended to get familiar with the con ...
-
... a structure for efficient spatial search A k d-tree is a data structure for storing points in a Euclidean space. It is not optimised for data that changes (insertions/deletions) but is very efficient at spatial queries such as nearest-neigh ...
-
... a structure for efficient spatial search A k d-tree is a data structure for storing points in a Euclidean space. It is not optimised for data that changes (insertions/deletions) but is very efficient at spatial queries such as nearest-neigh ...
-
>> blkset 1 freq hpch == radpost == Ndef('mod1', {arg in=1, mul=1, add=0, minFreq=60, maxFreq=4000, ampThreshold=0.01, median=1, lag=0; var sig, chain, freq, hasFreq; sig = SoundIn.ar( (in-1).max(0) ); # freq, hasFreq = Pitch.kr(sig, minFre ...