_id stringlengths 2 7 | text stringlengths 6 2.61k | title stringclasses 1
value |
|---|---|---|
c9100 | // MaxDuration sets the maximum length of the track in milliseconds | |
c9101 | // MinDuration sets the minimum length of the track in milliseconds | |
c9102 | // TargetDuration sets the target length of the track in milliseconds | |
c9103 | // MaxEnergy sets the maximum energy
// Energy is a measure from 0.0 to 1.0 and represents a perceptual mesaure
// of intensity and activity. Typically, energetic tracks feel fast, loud,
// and noisy. | |
c9104 | // MinEnergy sets the minimum energy
// Energy is a measure from 0.0 to 1.0 and represents a perceptual mesaure
// of intensity and activity. Typically, energetic tracks feel fast, loud,
// and noisy. | |
c9105 | // TargetEnergy sets the target energy
// Energy is a measure from 0.0 to 1.0 and represents a perceptual mesaure
// of intensity and activity. Typically, energetic tracks feel fast, loud,
// and noisy. | |
c9106 | // MaxInstrumentalness sets the maximum instrumentalness
// Instrumentalness predicts whether a track contains no vocals.
// "Ooh" and "aah" sounds are treated as instrumental in this context.
// Rap or spoken word tracks are clearly "vocal".
// The closer the instrumentalness value is to 1.0,
// the greater likelihood... | |
c9107 | // MinInstrumentalness sets the minimum instrumentalness
// Instrumentalness predicts whether a track contains no vocals.
// "Ooh" and "aah" sounds are treated as instrumental in this context.
// Rap or spoken word tracks are clearly "vocal".
// The closer the instrumentalness value is to 1.0,
// the greater likelihood... | |
c9108 | // TargetInstrumentalness sets the target instrumentalness
// Instrumentalness predicts whether a track contains no vocals.
// "Ooh" and "aah" sounds are treated as instrumental in this context.
// Rap or spoken word tracks are clearly "vocal".
// The closer the instrumentalness value is to 1.0,
// the greater likeliho... | |
c9109 | // MaxLiveness sets the maximum liveness
// Detects the presence of an audience in the recording. Higher liveness
// values represent an increased probability that the track was performed live.
// A value above 0.8 provides strong likelihook that the track is live. | |
c9110 | // MinLiveness sets the minimum liveness
// Detects the presence of an audience in the recording. Higher liveness
// values represent an increased probability that the track was performed live.
// A value above 0.8 provides strong likelihook that the track is live. | |
c9111 | // TargetLiveness sets the target liveness
// Detects the presence of an audience in the recording. Higher liveness
// values represent an increased probability that the track was performed live.
// A value above 0.8 provides strong likelihook that the track is live. | |
c9112 | // MaxSpeechiness sets the maximum speechiness.
// Speechiness detects the presence of spoken words in a track.
// The more exclusively speech-like the recording, the closer to 1.0
// the speechiness will be.
// Values above 0.66 describe tracks that are probably made entirely of
// spoken words. Values between 0.33 a... | |
c9113 | // MinSpeechiness sets the minimum speechiness.
// Speechiness detects the presence of spoken words in a track.
// The more exclusively speech-like the recording, the closer to 1.0
// the speechiness will be.
// Values above 0.66 describe tracks that are probably made entirely of
// spoken words. Values between 0.33 a... | |
c9114 | // TargetSpeechiness sets the target speechiness.
// Speechiness detects the presence of spoken words in a track.
// The more exclusively speech-like the recording, the closer to 1.0
// the speechiness will be.
// Values above 0.66 describe tracks that are probably made entirely of
// spoken words. Values between 0.33... | |
c9115 | // GetAudioAnalysis queries the Spotify web API for an audio analysis of a
// single track. | |
c9116 | // NextArtistResults loads the next page of artists into the specified search result. | |
c9117 | // PreviousArtistResults loads the previous page of artists into the specified search result. | |
c9118 | // NextAlbumResults loads the next page of albums into the specified search result. | |
c9119 | // PreviousAlbumResults loads the previous page of albums into the specified search result. | |
c9120 | // NextPlaylistResults loads the next page of playlists into the specified search result. | |
c9121 | // PreviousPlaylistResults loads the previous page of playlists into the specified search result. | |
c9122 | // PreviousTrackResults loads the previous page of tracks into the specified search result. | |
c9123 | // NextTrackResults loads the next page of tracks into the specified search result. | |
c9124 | // TimeDuration returns the track's duration as a time.Duration value. | |
c9125 | // GetTrack gets Spotify catalog information for
// a single track identified by its unique Spotify ID. | |
c9126 | // GetTracks gets Spotify catalog information for multiple tracks based on their
// Spotify IDs. It supports up to 50 tracks in a single call. Tracks are
// returned in the order requested. If a track is not found, that position in the
// result will be nil. Duplicate ids in the query will result in duplicate
// tr... | |
c9127 | // GetAudioFeatures queries the Spotify Web API for various
// high-level acoustic attributes of audio tracks.
// Objects are returned in the order requested. If an object
// is not found, a nil value is returned in the appropriate position. | |
c9128 | // count returns the total number of seeds contained in s | |
c9129 | // setSeedValues sets url values into v for each seed in seeds | |
c9130 | // setTrackAttributesValues sets track attributes values to the given url values | |
c9131 | // GetRecommendations returns a list of recommended tracks based on the given seeds.
// Recommendations are generated based on the available information for a given seed entity
// and matched against similar artists and tracks. If there is sufficient information
// about the provided seeds, a list of tracks will be ret... | |
c9132 | // GetAvailableGenreSeeds retrieves a list of available genres seed parameter values for
// recommendations. | |
c9133 | // Download downloads the image and writes its data to the specified io.Writer. | |
c9134 | // decodeError decodes an Error from an io.Reader. | |
c9135 | // shouldRetry determines whether the status code indicates that the
// previous operation should be retried at a later time | |
c9136 | // isFailure determines whether the code indicates failure | |
c9137 | // execute executes a non-GET request. `needsStatus` describes other HTTP status codes
// that can represent success. Note that in all current usages of this function,
// we need to still allow a 200 even if we'd also like to check for additional
// success codes. | |
c9138 | // NewReleasesOpt is like NewReleases, but it accepts optional parameters
// for filtering the results. | |
c9139 | // NewReleases gets a list of new album releases featured in Spotify.
// This call requires bearer authorization. | |
c9140 | // Check collects data about an Iterator. | |
c9141 | // Equal tells if g and h have the same number of vertices,
// and the same edges with the same costs. | |
c9142 | // Subgraph returns a subgraph of g that consists of the vertices in s
// and all edges whose endpoints are in s. | |
c9143 | // StrongComponents produces a partition of g's vertices into its
// strongly connected components.
//
// A component is strongly connected if all its vertices are reachable
// from every other vertex in the component.
// Each vertex of the graph appears in exactly one of the strongly
// connected components, and any v... | |
c9144 | // Make a depth-first search starting at v and append all strongly
// connected components of the visited subgraph to comps. | |
c9145 | // find returns the smallest n consecutive neighbors w, w+1, ..., w+n-1
// of v for which w >= a. | |
c9146 | // New constructs a new graph with n vertices, numbered from 0 to n-1, and no edges. | |
c9147 | // Copy returns a copy of g.
// If g is a multigraph, any duplicate edges in g will be lost. | |
c9148 | // Visit calls the do function for each neighbor w of v,
// with c equal to the cost of the edge from v to w.
// If do returns true, Visit returns immediately,
// skipping any remaining neighbors, and returns true.
//
// The iteration order is not specified and is not guaranteed
// to be the same every time.
// It is s... | |
c9149 | // Add inserts a directed edge from v to w with zero cost.
// It removes the previous cost if this edge already exists. | |
c9150 | // AddCost inserts a directed edge from v to w with cost c.
// It overwrites the previous cost if this edge already exists. | |
c9151 | // AddBoth inserts edges with zero cost between v and w.
// It removes the previous costs if these edges already exist. | |
c9152 | // AddBothCost inserts edges with cost c between v and w.
// It overwrites the previous costs if these edges already exist. | |
c9153 | // Delete removes an edge from v to w. | |
c9154 | // DeleteBoth removes all edges between v and w. | |
c9155 | // TopSort returns a topological ordering of the vertices in
// a directed acyclic graph; if the graph is not acyclic,
// no such ordering exists and ok is set to false.
//
// In a topological order v comes before w for every directed edge from v to w. | |
c9156 | // Acyclic tells if g has no cycles. | |
c9157 | // Kahn's algorithm | |
c9158 | // EulerDirected returns an Euler walk in a directed graph.
// If no such walk exists, it returns an empty walk and sets ok to false. | |
c9159 | // EulerUndirected returns an Euler walk following undirected edges
// in only one direction. If no such walk exists, it returns an empty walk
// and sets ok to false. | |
c9160 | // Add returns a graph containing all edges in g plus all edges in e.
// Any edges belonging to both g and e will retain their cost from g. | |
c9161 | // Delete returns a graph containing all edges in g except those also found in e. | |
c9162 | // Sort returns an immutable copy of g with a Visit method
// that returns its neighbors in increasing numerical order. | |
c9163 | // singleton returns a graph with one vertex. | |
c9164 | // generic returns a standard implementation; cost and edge can't be nil. | |
c9165 | // Specific returns a cached copy of g with constant time performance for
// all basic operations. It uses space proportional to the size of the graph.
//
// This function does not accept multigraphs and graphs with self-loops. | |
c9166 | // Empty returns a virtual graph with n vertices and no edges. | |
c9167 | // Kn returns a complete simple graph with n vertices. | |
c9168 | // Complement returns the complement graph of g.
// This graph has the same vertices as g,
// but its edge set consists of the edges not present in g.
// The edges of the complement graph will have zero cost. | |
c9169 | // AddCost returns a copy of g with a new cost assigned to all edges. | |
c9170 | // AddCostFunc returns a copy of g with a new cost function assigned. | |
c9171 | // Bipartition returns a subset U of g's vertices with the property
// that every edge of g connects a vertex in U to one outside of U.
// If g isn't bipartite, it returns an empty slice and sets ok to false. | |
c9172 | // update updates the index values. | |
c9173 | // size returns the number of elements in this set, or -1 for the universe. | |
c9174 | // rank returns the position of n in the set, or -1 if not available. | |
c9175 | // Contains tells if v is a member of the set. | |
c9176 | // AndNot returns the set of all vertices belonging to s1 but not to s2. | |
c9177 | // complement returns the set of all vertices not belonging to s. | |
c9178 | // And returns the set of all vertices belonging to both s1 and s2. | |
c9179 | // ServiceGoCode returns the o code for a characteristic file | |
c9180 | // NewBridge returns a bridge which implements model.Bridge. | |
c9181 | // NewSetupClientController returns a new setup client controller. | |
c9182 | // InitialPairingRequest returns the first request the client sends to an accessory to start the paring process.
// The request contains the sequence set to PairStepStartRequest. | |
c9183 | // NewTemperatureSensor returns a Thermometer which implements model.Thermometer. | |
c9184 | // GeneratePrivateKey returns random bytes. | |
c9185 | // PublicKey returns a Curve25519 public key derived from privateKey. | |
c9186 | // SharedSecret returns a Curve25519 shared secret derived from privateKey and otherPublicKey. | |
c9187 | // NewKeepAlive returns a new keep alive for a specific timeout. | |
c9188 | // Start starts sending keep alive messages. This method blocks until the context is canceled. | |
c9189 | // NewVerifyClientController returns a new verify client controller. | |
c9190 | // Handle processes a container to verify if an accessory is paired correctly. | |
c9191 | // InitialKeyVerifyRequest returns the first request the client sends to an accessory to start the paring verifcation process.
// The request contains the client public key and sequence set to VerifyStepStartRequest. | |
c9192 | // NewContextForSecuredDevice returns a new Context | |
c9193 | // Returns a list of active connections | |
c9194 | // noWritePerms returns true when permissions include no write permission | |
c9195 | // Equal returns true when receiver has the values as the argument. | |
c9196 | // New returns a new service. | |
c9197 | // GetCharacteristics returns the characteristics which represent the service. | |
c9198 | // Equal returns true when receiver has the same characteristics, service id and service type as the argument. | |
c9199 | // NewSecureSessionFromSharedKey returns a session from a shared private key. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.