Features

• 🎯 Full TypeScript Support - Complete type definitions for all API responses
• 🔄 Automatic Pagination - Easy iteration through paginated results
• 🚦 Rate Limiting - Built-in handling of Deezer's rate limits
• 🔁 Automatic Retries - Smart retry logic for failed requests
• 📚 Rich Documentation - Comprehensive guides and API reference
• 🎵 Complete API Coverage - Support for all Deezer public API endpoints
• ⚡ Modern Async/Await - Promise-based API with async iterator support
• 🛡️ Error Handling - Detailed error types for better error management

Installation

# Using npm
npm install deezer-ts

# Using yarn
yarn add deezer-ts

# Using pnpm
pnpm add deezer-ts
Copy

Quick Start

import { Client } from 'deezer-ts';

// Create a client instance
const client = new Client();

// Basic usage
async function example() {
  // Get an artist
  const artist = await client.getArtist(27);  // Daft Punk
  console.log(artist.name);  // "Daft Punk"

  // Get artist's albums with pagination
  const albums = await artist.getAlbums();
  for await (const album of albums) {
    console.log(album.title);
  }

  // Search tracks with advanced parameters
  const tracks = await client.search("Discovery", true, "RANKING", {
    artist: "Daft Punk",
    album: "Discovery"
  });
}
Copy

Documentation

📚 Full Documentation

• Getting Started Guide
• Installation Guide
• Pagination Guide
• API Reference

Key Concepts

Pagination

const albums = await artist.getAlbums();

// Async iteration
for await (const album of albums) {
  console.log(album.title);
}

// Get specific items
const firstTen = await albums.slice(0, 10);
Copy

Error Handling

try {
  const artist = await client.getArtist(999999999);
} catch (error) {
  if (error instanceof DeezerNotFoundError) {
    console.log('Artist not found');
  } else if (error instanceof DeezerQuotaExceededError) {
    console.log('Rate limit exceeded, retry after 5 seconds');
  }
}
Copy

Requirements

• Node.js >= 16
• TypeScript >= 5.0 (if using TypeScript)

Contributing

Contributions are welcome! Please read our Contributing Guide for details.