Recuperation des metadonnees d'un livre a partir de son ISBN, cote serveur uniquement (aucune interface, aucune persistance). Cascade : BnF en ISBN-13, puis BnF en ISBN-10 converti, puis OpenLibrary. La conversion 13 -> 10 est indispensable et non optionnelle : la BnF indexe l'ISBN tel qu'imprime, les ouvrages d'avant 2007 ne portent qu'un ISBN-10 et sont introuvables par l'EAN-13 que lit le scanner. Toutes les notices trouvees sont remontees (jusqu'a 5) : un meme ISBN peut correspondre a plusieurs reeditions, le choix revient a l'utilisateur. Le double appel /isbn puis /authors d'OpenLibrary est bien fait, avec repli sur l'oeuvre quand l'edition ne porte aucun auteur : c'est le bug de BookLogr (titre rempli, auteur vide) qu'il ne faut pas reproduire. La couverture vient toujours d'OpenLibrary, avec ?default=false pour obtenir un 404 plutot qu'une image placeholder. 87 tests xUnit, sur fixtures enregistrees : aucune dependance au reseau. Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>
1 line
2.9 KiB
JSON
1 line
2.9 KiB
JSON
{"subjects": ["Algorithms", "Computer algorithms", "Computer programming", "open_syllabus_project", "Programming", "Algorithmes", "Programmation (Informatique)", "54.10 theoretical informatics", "Algorithmus", "Informatik", "Theoretische Informatik", "Algorithmentheorie", "COMPUTER PROGRAMS", "PROGRAMMING LANGUAGES", "FILE MAINTENANCE (COMPUTERS)", "SOFTWARE TOOLS", "Long Now Manual for Civilization", "COMPUTERS", "Open Source", "Software Development & Engineering", "Tools", "General", "Algorithmische Programmierung", "Algoritmen", "Datenstruktur", "Datoralgoritmer", "Datastrukturer", "\u041a\u043e\u043c\u043f\u044c\u044e\u0442\u0435\u0440\u044b//\u0410\u043b\u0433\u043e\u0440\u0438\u0442\u043c\u044b \u0438 \u0441\u0442\u0440\u0443\u043a\u0442\u0443\u0440\u044b \u0434\u0430\u043d\u043d\u044b\u0445", "\u041a\u043e\u043c\u043f\u044c\u044e\u0442\u0435\u0440\u044b", "\u0410\u043b\u0433\u043e\u0440\u0438\u0442\u043c\u044b \u0438 \u0441\u0442\u0440\u0443\u043a\u0442\u0443\u0440\u044b \u0434\u0430\u043d\u043d\u044b\u0445", "Algorithms and Data Structures", "Qa76.6 .c662 2009", "005.1", "54.10", "Qa76.6 .i5858 2001", "Electronic digital computers, programming"], "key": "/works/OL4781294W", "title": "Introduction to Algorithms", "authors": [{"author": {"key": "/authors/OL1004780A"}, "type": {"key": "/type/author_role"}}, {"author": {"key": "/authors/OL3328609A"}, "type": {"key": "/type/author_role"}}, {"author": {"key": "/authors/OL2682480A"}, "type": {"key": "/type/author_role"}}, {"author": {"key": "/authors/OL2633511A"}, "type": {"key": "/type/author_role"}}], "type": {"key": "/type/work"}, "covers": [2341462, 149636, 6959894, 53671, 8664679, 151333, 11115497], "description": {"type": "/type/text", "value": "This book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. We have tried to keep explanations elementary without sacrificing depth of coverage or mathematical rigor. Each chapter presents an algorithm, a design technique, an application area, or a related topic. Algorithms are described in English and in a \"pseudocode\" designed to be readable by anyone who has done a little programming. The book contains over 260 figrues illustrating how the algorithms work. Since we emphasize efficiency as a design criterion, we include careful analyses of the running times of all our algorithms. The text is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Because it discusses engineering issues in algorithm design, as well as mathematical aspects, it is equally well suited for self-study by technical professionals. --"}, "latest_revision": 17, "revision": 17, "created": {"type": "/type/datetime", "value": "2009-12-10T07:30:51.510609"}, "last_modified": {"type": "/type/datetime", "value": "2025-05-16T12:11:10.698473"}} |