@fgv/ts-random 5.1.0-10

package/dist/generator-data/words/names.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"names.js","sourceRoot":"","sources":["../../../src/generator-data/words/names.ts"],"names":[],"mappings":"AAAA,kCAAkC;AAClC,EAAE;AACF,+EAA+E;AAC/E,gFAAgF;AAChF,+EAA+E;AAC/E,4EAA4E;AAC5E,wEAAwE;AACxE,2DAA2D;AAC3D,EAAE;AACF,iFAAiF;AACjF,kDAAkD;AAClD,EAAE;AACF,6EAA6E;AAC7E,2EAA2E;AAC3E,8EAA8E;AAC9E,yEAAyE;AACzE,gFAAgF;AAChF,gFAAgF;AAChF,YAAY;AAEZ;;;GAGG;AACH,MAAM,CAAC,MAAM,cAAc,GAA0B;IACnD,mBAAmB;IACnB,OAAO;IACP,MAAM;IACN,QAAQ;IACR,SAAS;IACT,SAAS;IACT,OAAO;IACP,SAAS;IACT,QAAQ;IACR,QAAQ;IACR,aAAa;IACb,yBAAyB;IACzB,QAAQ;IACR,QAAQ;IACR,MAAM;IACN,MAAM;IACN,MAAM;IACN,SAAS;IACT,WAAW;IACX,OAAO;IACP,WAAW;IACX,OAAO;IACP,SAAS;IACT,MAAM;IACN,QAAQ;IACR,OAAO;IACP,UAAU;IACV,SAAS;IACT,UAAU;IACV,QAAQ;IACR,OAAO;IACP,OAAO;IACP,SAAS;IACT,SAAS;IACT,MAAM;IACN,OAAO;IACP,UAAU;IACV,QAAQ;IACR,QAAQ;IACR,QAAQ;IACR,QAAQ;IACR,SAAS;IACT,QAAQ;IACR,UAAU;IACV,UAAU;IACV,OAAO;IACP,UAAU;IACV,UAAU;IACV,MAAM;IACN,WAAW;IACX,YAAY;IACZ,QAAQ;IACR,QAAQ;IACR,SAAS;IACT,SAAS;IACT,UAAU;IACV,MAAM;IACN,QAAQ;IACR,QAAQ;IACR,QAAQ;IACR,SAAS;IACT,SAAS;IACT,UAAU;IACV,QAAQ;IACR,OAAO;IACP,QAAQ;IACR,UAAU;IACV,KAAK;IACL,MAAM;IACN,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,KAAK;IACL,MAAM;IACN,KAAK;IACL,KAAK;IACL,WAAW;IACX,SAAS;IACT,SAAS;IACT,OAAO;IACP,MAAM;IACN,QAAQ;IACR,OAAO;IACP,SAAS;IACT,QAAQ;IACR,KAAK;IACL,OAAO;IACP,SAAS;IACT,OAAO;IACP,SAAS;IACT,QAAQ;IACR,QAAQ;IACR,UAAU;IACV,SAAS;IACT,UAAU;IACV,OAAO;IACP,SAAS;IACT,QAAQ;IACR,SAAS;IACT,KAAK;IACL,MAAM;IACN,QAAQ;IACR,OAAO;IACP,OAAO;IACP,QAAQ;IACR,MAAM;IACN,MAAM;IACN,QAAQ;IACR,QAAQ;IACR,wBAAwB;IACxB,UAAU;IACV,OAAO;IACP,KAAK;IACL,MAAM;IACN,QAAQ;IACR,OAAO;IACP,SAAS;IACT,QAAQ;IACR,OAAO;IACP,OAAO;IACP,QAAQ;IACR,OAAO;IACP,UAAU;IACV,QAAQ;IACR,QAAQ;IACR,SAAS;IACT,SAAS;IACT,UAAU;IACV,YAAY;IACZ,YAAY;IACZ,UAAU;IACV,SAAS;IACT,OAAO;IACP,WAAW;IACX,SAAS;IACT,QAAQ;IACR,OAAO;IACP,OAAO;IACP,OAAO;IACP,WAAW;IACX,UAAU;IACV,MAAM;IACN,QAAQ;IACR,MAAM;IACN,MAAM;IACN,SAAS;IACT,QAAQ;IACR,MAAM;IACN,OAAO;IACP,MAAM;IACN,QAAQ;IACR,SAAS;IACT,MAAM;IACN,eAAe;IACf,MAAM;IACN,MAAM;IACN,MAAM;IACN,QAAQ;IACR,MAAM;IACN,OAAO;IACP,QAAQ;IACR,QAAQ;IACR,MAAM;IACN,MAAM;IACN,uBAAuB;IACvB,MAAM;IACN,OAAO;IACP,OAAO;IACP,OAAO;IACP,OAAO;IACP,SAAS;IACT,QAAQ;IACR,QAAQ;IACR,QAAQ;IACR,SAAS;IACT,QAAQ;IACR,KAAK;IACL,QAAQ;IACR,QAAQ;IACR,SAAS;IACT,MAAM;IACN,UAAU;IACV,UAAU;IACV,QAAQ;IACR,OAAO;IACP,MAAM;IACN,OAAO;IACP,UAAU;IACV,QAAQ;IACR,SAAS;IACT,OAAO;IACP,MAAM;IACN,OAAO;IACP,OAAO;IACP,OAAO;IACP,OAAO;IACP,OAAO;IACP,QAAQ;IACR,iBAAiB;IACjB,OAAO;IACP,OAAO;IACP,OAAO;IACP,SAAS;IACT,QAAQ;IACR,MAAM;IACN,OAAO;IACP,MAAM;IACN,KAAK;IACL,KAAK;IACL,UAAU;IACV,OAAO;IACP,MAAM;IACN,OAAO;IACP,OAAO;IACP,WAAW;IACX,QAAQ;IACR,QAAQ;IACR,QAAQ;IACR,OAAO;IACP,OAAO;CACR,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAA0B;IACrD,mBAAmB;IACnB,MAAM;IACN,UAAU;IACV,UAAU;IACV,OAAO;IACP,WAAW;IACX,SAAS;IACT,OAAO;IACP,SAAS;IACT,OAAO;IACP,OAAO;IACP,OAAO;IACP,QAAQ;IACR,QAAQ;IACR,WAAW;IACX,QAAQ;IACR,SAAS;IACT,SAAS;IACT,OAAO;IACP,UAAU;IACV,UAAU;IACV,yBAAyB;IACzB,OAAO;IACP,QAAQ;IACR,MAAM;IACN,KAAK;IACL,QAAQ;IACR,OAAO;IACP,OAAO;IACP,OAAO;IACP,UAAU;IACV,WAAW;IACX,SAAS;IACT,OAAO;IACP,QAAQ;IACR,WAAW;IACX,SAAS;IACT,WAAW;IACX,UAAU;IACV,UAAU;IACV,QAAQ;IACR,SAAS;IACT,QAAQ;IACR,SAAS;IACT,MAAM;IACN,QAAQ;IACR,QAAQ;IACR,QAAQ;IACR,OAAO;IACP,QAAQ;IACR,OAAO;IACP,QAAQ;IACR,SAAS;IACT,MAAM;IACN,UAAU;IACV,QAAQ;IACR,WAAW;IACX,QAAQ;IACR,MAAM;IACN,WAAW;IACX,SAAS;IACT,UAAU;IACV,OAAO;IACP,SAAS;IACT,SAAS;IACT,UAAU;IACV,SAAS;IACT,MAAM;IACN,SAAS;IACT,UAAU;IACV,OAAO;IACP,WAAW;IACX,QAAQ;IACR,WAAW;IACX,QAAQ;IACR,SAAS;IACT,UAAU;IACV,KAAK;IACL,MAAM;IACN,KAAK;IACL,KAAK;IACL,MAAM;IACN,IAAI;IACJ,MAAM;IACN,KAAK;IACL,KAAK;IACL,KAAK;IACL,WAAW;IACX,MAAM;IACN,QAAQ;IACR,MAAM;IACN,MAAM;IACN,OAAO;IACP,MAAM;IACN,QAAQ;IACR,KAAK;IACL,OAAO;IACP,OAAO;IACP,SAAS;IACT,OAAO;IACP,QAAQ;IACR,OAAO;IACP,MAAM;IACN,OAAO;IACP,SAAS;IACT,OAAO;IACP,OAAO;IACP,WAAW;IACX,QAAQ;IACR,SAAS;IACT,OAAO;IACP,QAAQ;IACR,QAAQ;IACR,SAAS;IACT,QAAQ;IACR,QAAQ;IACR,OAAO;IACP,OAAO;IACP,MAAM;IACN,QAAQ;IACR,wBAAwB;IACxB,QAAQ;IACR,OAAO;IACP,OAAO;IACP,MAAM;IACN,QAAQ;IACR,OAAO;IACP,MAAM;IACN,MAAM;IACN,QAAQ;IACR,OAAO;IACP,QAAQ;IACR,OAAO;IACP,OAAO;IACP,UAAU;IACV,OAAO;IACP,SAAS;IACT,WAAW;IACX,SAAS;IACT,QAAQ;IACR,QAAQ;IACR,SAAS;IACT,SAAS;IACT,MAAM;IACN,OAAO;IACP,WAAW;IACX,YAAY;IACZ,WAAW;IACX,SAAS;IACT,KAAK;IACL,UAAU;IACV,OAAO;IACP,SAAS;IACT,QAAQ;IACR,SAAS;IACT,OAAO;IACP,OAAO;IACP,OAAO;IACP,SAAS;IACT,SAAS;IACT,QAAQ;IACR,OAAO;IACP,MAAM;IACN,OAAO;IACP,eAAe;IACf,QAAQ;IACR,QAAQ;IACR,OAAO;IACP,QAAQ;IACR,OAAO;IACP,OAAO;IACP,KAAK;IACL,MAAM;IACN,MAAM;IACN,MAAM;IACN,uBAAuB;IACvB,KAAK;IACL,SAAS;IACT,OAAO;IACP,UAAU;IACV,SAAS;IACT,SAAS;IACT,SAAS;IACT,UAAU;IACV,QAAQ;IACR,SAAS;IACT,QAAQ;IACR,MAAM;IACN,QAAQ;IACR,OAAO;IACP,KAAK;IACL,OAAO;IACP,OAAO;IACP,OAAO;IACP,SAAS;IACT,QAAQ;IACR,SAAS;IACT,UAAU;IACV,MAAM;IACN,OAAO;IACP,QAAQ;IACR,MAAM;IACN,OAAO;IACP,MAAM;IACN,OAAO;IACP,OAAO;IACP,OAAO;IACP,MAAM;IACN,iBAAiB;IACjB,QAAQ;IACR,MAAM;IACN,QAAQ;IACR,OAAO;IACP,OAAO;IACP,MAAM;IACN,KAAK;IACL,MAAM;IACN,OAAO;IACP,OAAO;IACP,UAAU;IACV,OAAO;IACP,MAAM;IACN,KAAK;IACL,OAAO;IACP,QAAQ;IACR,UAAU;IACV,UAAU;IACV,QAAQ;IACR,OAAO;IACP,QAAQ;CACT,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,UAAU,GAA0B,CAAC,GAAG,cAAc,EAAE,GAAG,gBAAgB,CAAC,CAAC;AAE1F;;;GAGG;AACH,MAAM,CAAC,MAAM,WAAW,GAA0B;IAChD,mBAAmB;IACnB,OAAO;IACP,SAAS;IACT,UAAU;IACV,OAAO;IACP,OAAO;IACP,QAAQ;IACR,OAAO;IACP,QAAQ;IACR,UAAU;IACV,QAAQ;IACR,yBAAyB;IACzB,QAAQ;IACR,WAAW;IACX,UAAU;IACV,OAAO;IACP,UAAU;IACV,WAAW;IACX,OAAO;IACP,SAAS;IACT,SAAS;IACT,QAAQ;IACR,SAAS;IACT,QAAQ;IACR,SAAS;IACT,QAAQ;IACR,QAAQ;IACR,QAAQ;IACR,SAAS;IACT,OAAO;IACP,QAAQ;IACR,OAAO;IACP,QAAQ;IACR,SAAS;IACT,QAAQ;IACR,SAAS;IACT,WAAW;IACX,SAAS;IACT,OAAO;IACP,OAAO;IACP,QAAQ;IACR,QAAQ;IACR,QAAQ;IACR,UAAU;IACV,UAAU;IACV,OAAO;IACP,OAAO;IACP,SAAS;IACT,UAAU;IACV,SAAS;IACT,QAAQ;IACR,SAAS;IACT,OAAO;IACP,QAAQ;IACR,OAAO;IACP,UAAU;IACV,QAAQ;IACR,SAAS;IACT,WAAW;IACX,OAAO;IACP,SAAS;IACT,SAAS;IACT,QAAQ;IACR,SAAS;IACT,SAAS;IACT,QAAQ;IACR,UAAU;IACV,MAAM;IACN,IAAI;IACJ,OAAO;IACP,KAAK;IACL,MAAM;IACN,MAAM;IACN,OAAO;IACP,MAAM;IACN,IAAI;IACJ,MAAM;IACN,WAAW;IACX,MAAM;IACN,QAAQ;IACR,WAAW;IACX,QAAQ;IACR,UAAU;IACV,KAAK;IACL,UAAU;IACV,UAAU;IACV,WAAW;IACX,MAAM;IACN,SAAS;IACT,KAAK;IACL,KAAK;IACL,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,SAAS;IACT,OAAO;IACP,QAAQ;IACR,OAAO;IACP,OAAO;IACP,OAAO;IACP,OAAO;IACP,MAAM;IACN,KAAK;IACL,OAAO;IACP,OAAO;IACP,wBAAwB;IACxB,UAAU;IACV,WAAW;IACX,QAAQ;IACR,SAAS;IACT,MAAM;IACN,OAAO;IACP,QAAQ;IACR,SAAS;IACT,QAAQ;IACR,QAAQ;IACR,QAAQ;IACR,cAAc;IACd,QAAQ;IACR,aAAa;IACb,QAAQ;IACR,UAAU;IACV,UAAU;IACV,cAAc;IACd,SAAS;IACT,WAAW;IACX,eAAe;IACf,SAAS;IACT,OAAO;IACP,UAAU;IACV,YAAY;IACZ,QAAQ;IACR,WAAW;IACX,UAAU;IACV,aAAa;IACb,WAAW;IACX,WAAW;IACX,SAAS;IACT,QAAQ;IACR,QAAQ;IACR,OAAO;IACP,UAAU;IACV,OAAO;IACP,OAAO;IACP,SAAS;IACT,OAAO;IACP,MAAM;IACN,UAAU;IACV,SAAS;IACT,eAAe;IACf,WAAW;IACX,WAAW;IACX,UAAU;IACV,SAAS;IACT,UAAU;IACV,SAAS;IACT,QAAQ;IACR,SAAS;IACT,UAAU;IACV,YAAY;IACZ,uBAAuB;IACvB,OAAO;IACP,QAAQ;IACR,UAAU;IACV,OAAO;IACP,WAAW;IACX,UAAU;IACV,OAAO;IACP,SAAS;IACT,MAAM;IACN,OAAO;IACP,QAAQ;IACR,SAAS;IACT,QAAQ;IACR,UAAU;IACV,cAAc;IACd,UAAU;IACV,QAAQ;IACR,SAAS;IACT,QAAQ;IACR,MAAM;IACN,QAAQ;IACR,UAAU;IACV,QAAQ;IACR,MAAM;IACN,OAAO;IACP,OAAO;IACP,OAAO;IACP,QAAQ;IACR,UAAU;IACV,QAAQ;IACR,OAAO;IACP,SAAS;IACT,iBAAiB;IACjB,OAAO;IACP,MAAM;IACN,SAAS;IACT,QAAQ;IACR,OAAO;IACP,OAAO;IACP,UAAU;IACV,UAAU;IACV,WAAW;IACX,SAAS;IACT,UAAU;IACV,SAAS;IACT,QAAQ;IACR,OAAO;IACP,QAAQ;IACR,QAAQ;IACR,MAAM;IACN,OAAO;IACP,OAAO;IACP,QAAQ;IACR,QAAQ;CACT,CAAC","sourcesContent":["// Copyright (c) 2026 Erik Fortune\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in all\n// copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n// SOFTWARE.\n\n/**\n * Male first names\n * @public\n */\nexport const FirstNamesMale: ReadonlyArray<string> = [\n  // American/English\n  'James',\n  'John',\n  'Robert',\n  'Michael',\n  'William',\n  'David',\n  'Richard',\n  'Joseph',\n  'Thomas',\n  'Christopher',\n  // Spanish/Latin American\n  'Carlos',\n  'Miguel',\n  'José',\n  'Juan',\n  'Luis',\n  'Antonio',\n  'Francisco',\n  'Diego',\n  'Alejandro',\n  'Pedro',\n  // French\n  'Jean',\n  'Pierre',\n  'Louis',\n  'François',\n  'Jacques',\n  'Philippe',\n  'Michel',\n  'André',\n  'Henri',\n  'Nicolas',\n  // German\n  'Hans',\n  'Klaus',\n  'Wolfgang',\n  'Dieter',\n  'Jürgen',\n  'Helmut',\n  'Günter',\n  'Manfred',\n  'Stefan',\n  'Matthias',\n  // Italian\n  'Marco',\n  'Giuseppe',\n  'Giovanni',\n  'Luca',\n  'Francesco',\n  'Alessandro',\n  'Andrea',\n  'Matteo',\n  'Lorenzo',\n  'Stefano',\n  // Russian\n  'Ivan',\n  'Dmitri',\n  'Alexei',\n  'Sergei',\n  'Nikolai',\n  'Mikhail',\n  'Vladimir',\n  'Andrei',\n  'Pavel',\n  'Viktor',\n  // Chinese\n  'Wei',\n  'Fang',\n  'Lei',\n  'Ming',\n  'Jian',\n  'Hui',\n  'Tao',\n  'Chen',\n  'Jun',\n  'Hao',\n  // Japanese\n  'Hiroshi',\n  'Takeshi',\n  'Kenji',\n  'Yuki',\n  'Haruki',\n  'Akira',\n  'Satoshi',\n  'Kazuki',\n  'Ryu',\n  'Daiki',\n  // Korean\n  'Minho',\n  'Jungwoo',\n  'Seojun',\n  'Jihoon',\n  'Donghyun',\n  'Hyunwoo',\n  'Taehyung',\n  'Jimin',\n  'Seungho',\n  'Woojin',\n  // Indian\n  'Raj',\n  'Amit',\n  'Vikram',\n  'Arjun',\n  'Rahul',\n  'Sanjay',\n  'Anil',\n  'Ravi',\n  'Suresh',\n  'Deepak',\n  // Arabic/Middle Eastern\n  'Mohammed',\n  'Ahmed',\n  'Ali',\n  'Omar',\n  'Hassan',\n  'Yusuf',\n  'Ibrahim',\n  'Khalid',\n  'Tariq',\n  'Samir',\n  // Greek\n  'Nikos',\n  'Dimitris',\n  'Kostas',\n  'Yannis',\n  'Giorgos',\n  'Stavros',\n  'Christos',\n  'Panagiotis',\n  'Alexandros',\n  'Vassilis',\n  // Polish\n  'Piotr',\n  'Krzysztof',\n  'Andrzej',\n  'Tomasz',\n  'Marek',\n  'Pawel',\n  'Jakub',\n  'Stanislaw',\n  'Wojciech',\n  'Adam',\n  // Irish\n  'Liam',\n  'Sean',\n  'Patrick',\n  'Connor',\n  'Cian',\n  'Oisin',\n  'Finn',\n  'Declan',\n  'Brendan',\n  'Eoin',\n  // Scandinavian\n  'Erik',\n  'Lars',\n  'Olaf',\n  'Magnus',\n  'Sven',\n  'Bjorn',\n  'Anders',\n  'Henrik',\n  'Nils',\n  'Leif',\n  // Portuguese/Brazilian\n  'João',\n  'Pedro',\n  'Paulo',\n  'Bruno',\n  'Lucas',\n  'Gustavo',\n  'Rafael',\n  'Thiago',\n  'Felipe',\n  'Matheus',\n  // Dutch\n  'Jan',\n  'Pieter',\n  'Willem',\n  'Hendrik',\n  'Dirk',\n  'Cornelis',\n  'Johannes',\n  'Gerrit',\n  'Arjan',\n  'Bram',\n  'Thijs',\n  // Turkish\n  'Mehmet',\n  'Mustafa',\n  'Ahmet',\n  'Emre',\n  'Burak',\n  'Osman',\n  'Hakan',\n  'Murat',\n  'Kemal',\n  'Serkan',\n  // Hebrew/Israeli\n  'David',\n  'Moshe',\n  'Yosef',\n  'Avraham',\n  'Yaakov',\n  'Noam',\n  'Eitan',\n  'Oren',\n  'Avi',\n  'Eli',\n  // African\n  'Kwame',\n  'Kofi',\n  'Amadi',\n  'Chidi',\n  'Oluwaseun',\n  'Jabari',\n  'Zuberi',\n  'Mandla',\n  'Thabo',\n  'Sipho'\n];\n\n/**\n * Female first names\n * @public\n */\nexport const FirstNamesFemale: ReadonlyArray<string> = [\n  // American/English\n  'Mary',\n  'Patricia',\n  'Jennifer',\n  'Linda',\n  'Elizabeth',\n  'Barbara',\n  'Susan',\n  'Jessica',\n  'Sarah',\n  'Karen',\n  'Emily',\n  'Ashley',\n  'Amanda',\n  'Stephanie',\n  'Nicole',\n  'Melissa',\n  'Rebecca',\n  'Laura',\n  'Michelle',\n  'Kimberly',\n  // Spanish/Latin American\n  'Maria',\n  'Carmen',\n  'Rosa',\n  'Ana',\n  'Isabel',\n  'Lucia',\n  'Elena',\n  'Sofia',\n  'Gabriela',\n  'Valentina',\n  // French\n  'Marie',\n  'Jeanne',\n  'Françoise',\n  'Monique',\n  'Catherine',\n  'Nathalie',\n  'Isabelle',\n  'Sylvie',\n  'Chantal',\n  'Céline',\n  // German\n  'Anna',\n  'Ursula',\n  'Ingrid',\n  'Monika',\n  'Karin',\n  'Sabine',\n  'Petra',\n  'Birgit',\n  'Claudia',\n  'Thea',\n  // Italian\n  'Giulia',\n  'Francesca',\n  'Chiara',\n  'Sara',\n  'Valentina',\n  'Alessia',\n  'Federica',\n  'Elisa',\n  'Martina',\n  'Giorgia',\n  // Russian\n  'Natasha',\n  'Olga',\n  'Tatiana',\n  'Svetlana',\n  'Irina',\n  'Ekaterina',\n  'Marina',\n  'Anastasia',\n  'Yelena',\n  'Ludmila',\n  // Chinese\n  'Mei',\n  'Ling',\n  'Xiu',\n  'Yan',\n  'Jing',\n  'Li',\n  'Fang',\n  'Hui',\n  'Xia',\n  'Yue',\n  // Japanese\n  'Yuki',\n  'Sakura',\n  'Hana',\n  'Aiko',\n  'Keiko',\n  'Yumi',\n  'Haruka',\n  'Emi',\n  'Akiko',\n  'Naomi',\n  // Korean\n  'Minji',\n  'Soyeon',\n  'Jihye',\n  'Yuna',\n  'Eunji',\n  'Seoyeon',\n  'Haeun',\n  'Jiwoo',\n  'Chaeyoung',\n  'Soojin',\n  // Indian\n  'Priya',\n  'Ananya',\n  'Deepna',\n  'Lakshmi',\n  'Sunita',\n  'Kavita',\n  'Meera',\n  'Pooja',\n  'Neha',\n  'Anjali',\n  // Arabic/Middle Eastern\n  'Fatima',\n  'Aisha',\n  'Layla',\n  'Noor',\n  'Yasmin',\n  'Amira',\n  'Hana',\n  'Zara',\n  'Mariam',\n  'Leila',\n  // Greek\n  'Eleni',\n  'Maria',\n  'Katerina',\n  'Sofia',\n  'Dimitra',\n  'Anastasia',\n  'Georgia',\n  'Ioanna',\n  'Athena',\n  'Despina',\n  // Polish\n  'Anna',\n  'Maria',\n  'Katarzyna',\n  'Malgorzata',\n  'Agnieszka',\n  'Barbara',\n  'Ewa',\n  'Krystyna',\n  'Zofia',\n  'Jadwiga',\n  // Irish\n  'Siobhan',\n  'Aoife',\n  'Ciara',\n  'Niamh',\n  'Saoirse',\n  'Aisling',\n  'Roisin',\n  'Maeve',\n  'Orla',\n  'Fiona',\n  // Scandinavian\n  'Ingrid',\n  'Astrid',\n  'Freya',\n  'Sigrid',\n  'Helga',\n  'Greta',\n  'Liv',\n  'Elin',\n  'Maja',\n  'Saga',\n  // Portuguese/Brazilian\n  'Ana',\n  'Beatriz',\n  'Carla',\n  'Fernanda',\n  'Juliana',\n  'Larissa',\n  'Mariana',\n  'Patricia',\n  'Renata',\n  'Vanessa',\n  // Dutch\n  'Emma',\n  'Sophie',\n  'Lotte',\n  'Eva',\n  'Fleur',\n  'Femke',\n  'Sanne',\n  'Marieke',\n  'Anneke',\n  'Danique',\n  // Turkish\n  'Ayse',\n  'Fatma',\n  'Zeynep',\n  'Elif',\n  'Merve',\n  'Esra',\n  'Selin',\n  'Derya',\n  'Tugba',\n  'Ebru',\n  // Hebrew/Israeli\n  'Miriam',\n  'Ruth',\n  'Esther',\n  'Rivka',\n  'Tamar',\n  'Yael',\n  'Noa',\n  'Maya',\n  'Shira',\n  'Talia',\n  // African\n  'Amara',\n  'Zuri',\n  'Nia',\n  'Imani',\n  'Adaeze',\n  'Chiamaka',\n  'Thandiwe',\n  'Naledi',\n  'Ayana',\n  'Makena'\n];\n\n/**\n * All first names\n * @public\n */\nexport const FirstNames: ReadonlyArray<string> = [...FirstNamesMale, ...FirstNamesFemale];\n\n/**\n * Family names / surnames\n * @public\n */\nexport const FamilyNames: ReadonlyArray<string> = [\n  // American/English\n  'Smith',\n  'Johnson',\n  'Williams',\n  'Brown',\n  'Jones',\n  'Miller',\n  'Davis',\n  'Wilson',\n  'Anderson',\n  'Taylor',\n  // Spanish/Latin American\n  'García',\n  'Rodríguez',\n  'Martínez',\n  'López',\n  'González',\n  'Hernández',\n  'Pérez',\n  'Sánchez',\n  'Ramírez',\n  'Torres',\n  // French\n  'Martin',\n  'Bernard',\n  'Dubois',\n  'Thomas',\n  'Robert',\n  'Richard',\n  'Petit',\n  'Durand',\n  'Leroy',\n  'Moreau',\n  // German\n  'Müller',\n  'Schmidt',\n  'Schneider',\n  'Fischer',\n  'Weber',\n  'Meyer',\n  'Wagner',\n  'Becker',\n  'Schulz',\n  'Hoffmann',\n  // Italian\n  'Rossi',\n  'Russo',\n  'Ferrari',\n  'Esposito',\n  'Bianchi',\n  'Romano',\n  'Colombo',\n  'Ricci',\n  'Marino',\n  'Greco',\n  // Russian\n  'Ivanov',\n  'Smirnov',\n  'Kuznetsov',\n  'Popov',\n  'Sokolov',\n  'Lebedev',\n  'Kozlov',\n  'Novikov',\n  'Morozov',\n  'Petrov',\n  // Chinese\n  'Wang',\n  'Li',\n  'Zhang',\n  'Liu',\n  'Chen',\n  'Yang',\n  'Huang',\n  'Zhao',\n  'Wu',\n  'Zhou',\n  // Japanese\n  'Sato',\n  'Suzuki',\n  'Takahashi',\n  'Tanaka',\n  'Watanabe',\n  'Ito',\n  'Yamamoto',\n  'Nakamura',\n  'Kobayashi',\n  'Kato',\n  // Korean\n  'Kim',\n  'Lee',\n  'Park',\n  'Choi',\n  'Jung',\n  'Kang',\n  'Cho',\n  'Yoon',\n  'Jang',\n  'Lim',\n  // Indian\n  'Patel',\n  'Sharma',\n  'Singh',\n  'Kumar',\n  'Gupta',\n  'Reddy',\n  'Nair',\n  'Rao',\n  'Mehta',\n  'Joshi',\n  // Arabic/Middle Eastern\n  'Al-Farsi',\n  'Al-Rashid',\n  'Hassan',\n  'Hussein',\n  'Khan',\n  'Malik',\n  'Nasser',\n  'Qureshi',\n  'Rahman',\n  'Sharif',\n  // Greek\n  'Papadopoulos',\n  'Pappas',\n  'Karagiannis',\n  'Vlahos',\n  'Nikolaou',\n  'Georgiou',\n  'Konstantinou',\n  'Alexiou',\n  'Dimitriou',\n  'Christodoulou',\n  // Polish\n  'Nowak',\n  'Kowalski',\n  'Wiśniewski',\n  'Wójcik',\n  'Kowalczyk',\n  'Kamiński',\n  'Lewandowski',\n  'Zieliński',\n  'Szymański',\n  'Woźniak',\n  // Irish\n  'Murphy',\n  'Kelly',\n  'Sullivan',\n  'Walsh',\n  'Smith',\n  \"O'Brien\",\n  'Byrne',\n  'Ryan',\n  \"O'Connor\",\n  \"O'Neill\",\n  // Scandinavian\n  'Johansson',\n  'Andersson',\n  'Karlsson',\n  'Nilsson',\n  'Eriksson',\n  'Larsson',\n  'Olsson',\n  'Persson',\n  'Svensson',\n  'Gustafsson',\n  // Portuguese/Brazilian\n  'Silva',\n  'Santos',\n  'Oliveira',\n  'Souza',\n  'Rodrigues',\n  'Ferreira',\n  'Alves',\n  'Pereira',\n  'Lima',\n  'Gomes',\n  // Dutch\n  'De Jong',\n  'Jansen',\n  'De Vries',\n  'Van den Berg',\n  'Van Dijk',\n  'Bakker',\n  'Janssen',\n  'Visser',\n  'Smit',\n  'Meijer',\n  // Turkish\n  'Yılmaz',\n  'Kaya',\n  'Demir',\n  'Çelik',\n  'Şahin',\n  'Yıldız',\n  'Yıldırım',\n  'Öztürk',\n  'Aydın',\n  'Özdemir',\n  // Hebrew/Israeli\n  'Cohen',\n  'Levi',\n  'Mizrahi',\n  'Peretz',\n  'Biton',\n  'Dahan',\n  'Friedman',\n  'Goldberg',\n  'Rosenberg',\n  'Shapiro',\n  // African\n  'Okonkwo',\n  'Mensah',\n  'Nkosi',\n  'Diallo',\n  'Traore',\n  'Osei',\n  'Mbeki',\n  'Kamau',\n  'Mwangi',\n  'Ndlovu'\n];\n"]}

package/dist/index.js

@@ -0,0 +1,7 @@
+/**
+ * @packageDocumentation
+ *
+ */
+export * as Generator from './generator';
+export * as GeneratorData from './generator-data';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,SAAS,MAAM,aAAa,CAAC;AACzC,OAAO,KAAK,aAAa,MAAM,kBAAkB,CAAC","sourcesContent":["/**\n * @packageDocumentation\n *\n */\n\nexport * as Generator from './generator';\nexport * as GeneratorData from './generator-data';\n"]}

package/dist/test/unit/generators.test.js

@@ -0,0 +1,596 @@
+import '@fgv/ts-utils-jest';
+import { PseudoRandomGenerator } from '../../generator';
+function createGenerator(seed = 42) {
+    return PseudoRandomGenerator.create({ seed }).orThrow();
+}
+describe('PseudoRandomGenerator', () => {
+    // Clean up global state between tests
+    afterEach(() => {
+        PseudoRandomGenerator.setGlobalRng(undefined);
+    });
+    describe('create', () => {
+        test('succeeds with no params', () => {
+            expect(PseudoRandomGenerator.create()).toSucceedAndSatisfy((gen) => {
+                expect(gen.rng).toBeDefined();
+                expect(gen.rng.counter).toBe(0);
+            });
+        });
+        test('succeeds with a seed', () => {
+            expect(PseudoRandomGenerator.create({ seed: 123 })).toSucceedAndSatisfy((gen) => {
+                expect(gen.rng.seed).toBe('123');
+            });
+        });
+        test('succeeds with a string seed', () => {
+            expect(PseudoRandomGenerator.create({ seed: 'hello' })).toSucceedAndSatisfy((gen) => {
+                expect(gen.rng.seed).toBe('hello');
+            });
+        });
+        test('same seed produces identical sequences', () => {
+            const gen1 = createGenerator('deterministic');
+            const gen2 = createGenerator('deterministic');
+            const values1 = Array.from({ length: 10 }, () => gen1.nextFloat());
+            const values2 = Array.from({ length: 10 }, () => gen2.nextFloat());
+            expect(values1).toEqual(values2);
+        });
+        test('different seeds produce different sequences', () => {
+            const gen1 = createGenerator('alpha');
+            const gen2 = createGenerator('beta');
+            const values1 = Array.from({ length: 4 }, () => gen1.nextFloat());
+            const values2 = Array.from({ length: 4 }, () => gen2.nextFloat());
+            expect(values1).not.toEqual(values2);
+        });
+        test('sets global rng when global is true', () => {
+            expect(PseudoRandomGenerator.getGlobalRng()).toBeUndefined();
+            expect(PseudoRandomGenerator.create({ seed: 1, global: true })).toSucceedAndSatisfy((gen) => {
+                expect(PseudoRandomGenerator.getGlobalRng()).toBe(gen);
+            });
+        });
+        test('does not set global rng when global is false', () => {
+            PseudoRandomGenerator.create({ seed: 1, global: false }).orThrow();
+            expect(PseudoRandomGenerator.getGlobalRng()).toBeUndefined();
+        });
+        test('does not set global rng when global is omitted', () => {
+            PseudoRandomGenerator.create({ seed: 1 }).orThrow();
+            expect(PseudoRandomGenerator.getGlobalRng()).toBeUndefined();
+        });
+    });
+    describe('clone', () => {
+        test('produces identical sequence from clone point', () => {
+            const gen = createGenerator(7);
+            gen.nextFloat();
+            gen.nextFloat();
+            const clone = gen.clone();
+            const original = Array.from({ length: 5 }, () => gen.nextFloat());
+            const cloned = Array.from({ length: 5 }, () => clone.nextFloat());
+            expect(original).toEqual(cloned);
+        });
+        test('clone is independent of parent', () => {
+            const gen = createGenerator(7);
+            const clone = gen.clone();
+            gen.nextFloat();
+            gen.nextFloat();
+            gen.nextFloat();
+            expect(gen.rng.counter).toBe(3);
+            expect(clone.rng.counter).toBe(0);
+        });
+    });
+    describe('createChild', () => {
+        test('child has independent state from parent', () => {
+            const gen = createGenerator(7);
+            gen.nextFloat();
+            const child = gen.createChild('branch');
+            expect(child.rng.counter).toBe(0);
+            expect(child.rng.lineage).toEqual(['1:branch']);
+        });
+        test('same label from same parent state produces identical child', () => {
+            const gen1 = createGenerator(7);
+            const gen2 = createGenerator(7);
+            gen1.nextFloat();
+            gen2.nextFloat();
+            const child1 = gen1.createChild('x');
+            const child2 = gen2.createChild('x');
+            const values1 = Array.from({ length: 5 }, () => child1.nextFloat());
+            const values2 = Array.from({ length: 5 }, () => child2.nextFloat());
+            expect(values1).toEqual(values2);
+        });
+        test('different labels produce different children', () => {
+            const gen = createGenerator(7);
+            gen.nextFloat();
+            const childA = gen.createChild('a');
+            const childB = gen.createChild('b');
+            const valuesA = Array.from({ length: 4 }, () => childA.nextFloat());
+            const valuesB = Array.from({ length: 4 }, () => childB.nextFloat());
+            expect(valuesA).not.toEqual(valuesB);
+        });
+    });
+    describe('nextFloat', () => {
+        test('returns values in [0, 1)', () => {
+            const gen = createGenerator(42);
+            for (let i = 0; i < 500; i++) {
+                const value = gen.nextFloat();
+                expect(value).toBeGreaterThanOrEqual(0);
+                expect(value).toBeLessThan(1);
+            }
+        });
+        test('advances the rng counter', () => {
+            const gen = createGenerator(1);
+            expect(gen.rng.counter).toBe(0);
+            gen.nextFloat();
+            expect(gen.rng.counter).toBe(1);
+            gen.nextFloat();
+            gen.nextFloat();
+            expect(gen.rng.counter).toBe(3);
+        });
+    });
+    describe('nextInt', () => {
+        test('returns non-negative integers less than extent', () => {
+            const gen = createGenerator(42);
+            for (let i = 0; i < 500; i++) {
+                const value = gen.nextInt(100);
+                expect(value).toBeGreaterThanOrEqual(0);
+                expect(value).toBeLessThan(100);
+                expect(Number.isInteger(value)).toBe(true);
+            }
+        });
+        test('returns large non-negative integer when extent is omitted', () => {
+            const gen = createGenerator(42);
+            const value = gen.nextInt();
+            expect(value).toBeGreaterThanOrEqual(0);
+            expect(value).toBeLessThan(Number.MAX_SAFE_INTEGER);
+            expect(Number.isInteger(value)).toBe(true);
+        });
+        test('returns 0 when extent is 0', () => {
+            const gen = createGenerator(42);
+            expect(gen.nextInt(0)).toBe(0);
+        });
+        test('extent of 0 still advances the rng', () => {
+            const gen1 = createGenerator(42);
+            const gen2 = createGenerator(42);
+            gen1.nextInt(0);
+            gen2.nextInt(10);
+            // Both advanced one step, so next values should match
+            expect(gen1.nextFloat()).toBe(gen2.nextFloat());
+        });
+        test('returns 0 when extent is 1', () => {
+            const gen = createGenerator(42);
+            for (let i = 0; i < 50; i++) {
+                expect(gen.nextInt(1)).toBe(0);
+            }
+        });
+        test('handles negative extent', () => {
+            const gen = createGenerator(42);
+            for (let i = 0; i < 500; i++) {
+                const value = gen.nextInt(-100);
+                expect(value).toBeLessThanOrEqual(0);
+                expect(value).toBeGreaterThan(-100);
+                expect(Number.isInteger(value)).toBe(true);
+            }
+        });
+        test('falls back to large range for Infinity extent', () => {
+            const gen = createGenerator(42);
+            const value = gen.nextInt(Infinity);
+            expect(value).toBeGreaterThanOrEqual(0);
+            expect(Number.isInteger(value)).toBe(true);
+        });
+        test('falls back to large range for NaN extent', () => {
+            const gen = createGenerator(42);
+            const value = gen.nextInt(NaN);
+            expect(value).toBeGreaterThanOrEqual(0);
+            expect(Number.isInteger(value)).toBe(true);
+        });
+        test('falls back to large range for -Infinity extent', () => {
+            const gen = createGenerator(42);
+            const value = gen.nextInt(-Infinity);
+            expect(value).toBeGreaterThanOrEqual(0);
+            expect(Number.isInteger(value)).toBe(true);
+        });
+    });
+    describe('nextInRange', () => {
+        test('returns values in [min, max] range', () => {
+            const gen = createGenerator(42);
+            for (let i = 0; i < 500; i++) {
+                const value = gen.nextInRange(10, 20);
+                expect(value).toBeGreaterThanOrEqual(10);
+                expect(value).toBeLessThanOrEqual(20);
+                expect(Number.isInteger(value)).toBe(true);
+            }
+        });
+        test('returns min when min equals max', () => {
+            const gen = createGenerator(42);
+            for (let i = 0; i < 20; i++) {
+                expect(gen.nextInRange(5, 5)).toBe(5);
+            }
+        });
+        test('handles swapped min and max', () => {
+            const gen = createGenerator(42);
+            for (let i = 0; i < 500; i++) {
+                const value = gen.nextInRange(20, 10);
+                expect(value).toBeGreaterThanOrEqual(10);
+                expect(value).toBeLessThanOrEqual(20);
+                expect(Number.isInteger(value)).toBe(true);
+            }
+        });
+        test('defaults min to 0 when undefined', () => {
+            const gen = createGenerator(42);
+            for (let i = 0; i < 200; i++) {
+                const value = gen.nextInRange(undefined, 10);
+                expect(value).toBeGreaterThanOrEqual(0);
+                expect(value).toBeLessThanOrEqual(10);
+            }
+        });
+        test('defaults max to MAX_SAFE_INTEGER when undefined', () => {
+            const gen = createGenerator(42);
+            const value = gen.nextInRange(0, undefined);
+            expect(value).toBeGreaterThanOrEqual(0);
+            expect(Number.isInteger(value)).toBe(true);
+        });
+        test('both min and max undefined gives full non-negative range', () => {
+            const gen = createGenerator(42);
+            const value = gen.nextInRange(undefined, undefined);
+            expect(value).toBeGreaterThanOrEqual(0);
+            expect(Number.isInteger(value)).toBe(true);
+        });
+        test('handles negative ranges', () => {
+            const gen = createGenerator(42);
+            for (let i = 0; i < 500; i++) {
+                const value = gen.nextInRange(-20, -10);
+                expect(value).toBeGreaterThanOrEqual(-20);
+                expect(value).toBeLessThanOrEqual(-10);
+                expect(Number.isInteger(value)).toBe(true);
+            }
+        });
+        test('handles range crossing zero', () => {
+            const gen = createGenerator(42);
+            for (let i = 0; i < 500; i++) {
+                const value = gen.nextInRange(-5, 5);
+                expect(value).toBeGreaterThanOrEqual(-5);
+                expect(value).toBeLessThanOrEqual(5);
+                expect(Number.isInteger(value)).toBe(true);
+            }
+        });
+    });
+    describe('nextBoolean', () => {
+        test('returns boolean values with default probability', () => {
+            const gen = createGenerator(42);
+            let trueCount = 0;
+            const trials = 1000;
+            for (let i = 0; i < trials; i++) {
+                if (gen.nextBoolean()) {
+                    trueCount++;
+                }
+            }
+            // With 0.5 probability over 1000 trials, should be roughly balanced
+            expect(trueCount).toBeGreaterThan(350);
+            expect(trueCount).toBeLessThan(650);
+        });
+        test('returns mostly true with high probability', () => {
+            const gen = createGenerator(42);
+            let trueCount = 0;
+            const trials = 1000;
+            for (let i = 0; i < trials; i++) {
+                if (gen.nextBoolean(0.95)) {
+                    trueCount++;
+                }
+            }
+            expect(trueCount).toBeGreaterThan(900);
+        });
+        test('returns mostly false with low probability', () => {
+            const gen = createGenerator(42);
+            let trueCount = 0;
+            const trials = 1000;
+            for (let i = 0; i < trials; i++) {
+                if (gen.nextBoolean(0.05)) {
+                    trueCount++;
+                }
+            }
+            expect(trueCount).toBeLessThan(100);
+        });
+        test('always returns false with probability 0', () => {
+            const gen = createGenerator(42);
+            for (let i = 0; i < 100; i++) {
+                expect(gen.nextBoolean(0)).toBe(false);
+            }
+        });
+        test('always returns true with probability 1', () => {
+            const gen = createGenerator(42);
+            for (let i = 0; i < 100; i++) {
+                expect(gen.nextBoolean(1)).toBe(true);
+            }
+        });
+    });
+    describe('nextString', () => {
+        test('returns string of requested length', () => {
+            const gen = createGenerator(42);
+            expect(gen.nextString(10)).toHaveLength(10);
+            expect(gen.nextString(0)).toHaveLength(0);
+            expect(gen.nextString(100)).toHaveLength(100);
+        });
+        test('uses default alphanumeric character set', () => {
+            const gen = createGenerator(42);
+            const str = gen.nextString(200);
+            expect(str).toMatch(/^[A-Za-z0-9]+$/);
+        });
+        test('uses custom character set', () => {
+            const gen = createGenerator(42);
+            const str = gen.nextString(100, 'abc');
+            expect(str).toMatch(/^[abc]+$/);
+        });
+        test('single character set produces uniform string', () => {
+            const gen = createGenerator(42);
+            const str = gen.nextString(20, 'X');
+            expect(str).toBe('X'.repeat(20));
+        });
+        test('same seed produces same string', () => {
+            const gen1 = createGenerator(42);
+            const gen2 = createGenerator(42);
+            expect(gen1.nextString(50)).toBe(gen2.nextString(50));
+        });
+        test('empty string length returns empty string', () => {
+            const gen = createGenerator(42);
+            expect(gen.nextString(0)).toBe('');
+        });
+    });
+    describe('pickNext', () => {
+        test('returns an item from the array', () => {
+            const gen = createGenerator(42);
+            const items = ['a', 'b', 'c', 'd', 'e'];
+            for (let i = 0; i < 100; i++) {
+                expect(items).toContain(gen.pickNext(items));
+            }
+        });
+        test('returns undefined for empty array', () => {
+            const gen = createGenerator(42);
+            expect(gen.pickNext([])).toBeUndefined();
+        });
+        test('returns undefined for undefined input', () => {
+            const gen = createGenerator(42);
+            expect(gen.pickNext(undefined)).toBeUndefined();
+        });
+        test('returns the only item for single-element array', () => {
+            const gen = createGenerator(42);
+            for (let i = 0; i < 20; i++) {
+                expect(gen.pickNext(['only'])).toBe('only');
+            }
+        });
+        test('is deterministic with same seed', () => {
+            const gen1 = createGenerator(42);
+            const gen2 = createGenerator(42);
+            const items = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
+            const picks1 = Array.from({ length: 20 }, () => gen1.pickNext(items));
+            const picks2 = Array.from({ length: 20 }, () => gen2.pickNext(items));
+            expect(picks1).toEqual(picks2);
+        });
+        test('works with typed arrays', () => {
+            const gen = createGenerator(42);
+            const numbers = [10, 20, 30];
+            const picked = gen.pickNext(numbers);
+            expect(picked).toBeDefined();
+            expect(numbers).toContain(picked);
+        });
+    });
+    describe('pickSequential', () => {
+        const dictA = ['a1', 'a2', 'a3'];
+        const dictB = ['b1', 'b2', 'b3'];
+        const dictC = ['c1', 'c2', 'c3'];
+        test('picks one item from each candidate dictionary in order', () => {
+            const gen = createGenerator(42);
+            const result = gen.pickSequential({
+                how: 'sequence',
+                candidates: [dictA, dictB, dictC]
+            });
+            expect(result).toHaveLength(3);
+            expect(dictA).toContain(result[0]);
+            expect(dictB).toContain(result[1]);
+            expect(dictC).toContain(result[2]);
+        });
+        test('defaults count to number of candidate dictionaries', () => {
+            const gen = createGenerator(42);
+            const result = gen.pickSequential({
+                how: 'sequence',
+                candidates: [dictA, dictB]
+            });
+            expect(result).toHaveLength(2);
+        });
+        test('wraps around dictionaries when count exceeds candidates', () => {
+            const gen = createGenerator(42);
+            const result = gen.pickSequential({
+                how: 'sequence',
+                count: 7,
+                candidates: [dictA, dictB, dictC]
+            });
+            expect(result).toHaveLength(7);
+            // Items 0, 3, 6 come from dictA; 1, 4 from dictB; 2, 5 from dictC
+            expect(dictA).toContain(result[0]);
+            expect(dictB).toContain(result[1]);
+            expect(dictC).toContain(result[2]);
+            expect(dictA).toContain(result[3]);
+            expect(dictB).toContain(result[4]);
+            expect(dictC).toContain(result[5]);
+            expect(dictA).toContain(result[6]);
+        });
+        test('count of 0 returns empty array', () => {
+            const gen = createGenerator(42);
+            const result = gen.pickSequential({
+                how: 'sequence',
+                count: 0,
+                candidates: [dictA, dictB]
+            });
+            expect(result).toEqual([]);
+        });
+        test('skips undefined picks from empty candidate dictionaries', () => {
+            const gen = createGenerator(42);
+            const result = gen.pickSequential({
+                how: 'sequence',
+                candidates: [dictA, [], dictC]
+            });
+            // The empty dictionary yields undefined which is skipped
+            expect(result).toHaveLength(2);
+            expect(dictA).toContain(result[0]);
+            expect(dictC).toContain(result[1]);
+        });
+        test('is deterministic with same seed', () => {
+            const gen1 = createGenerator(42);
+            const gen2 = createGenerator(42);
+            const params = {
+                how: 'sequence',
+                count: 10,
+                candidates: [dictA, dictB, dictC]
+            };
+            expect(gen1.pickSequential(params)).toEqual(gen2.pickSequential(params));
+        });
+    });
+    describe('pickRandom', () => {
+        const dictA = ['a1', 'a2', 'a3'];
+        const dictB = ['b1', 'b2', 'b3'];
+        const dictC = ['c1', 'c2', 'c3'];
+        test('picks count items from randomly selected dictionaries', () => {
+            const gen = createGenerator(42);
+            const result = gen.pickRandom({
+                how: 'random',
+                count: 10,
+                candidates: [dictA, dictB, dictC]
+            });
+            expect(result).toHaveLength(10);
+            const allItems = [...dictA, ...dictB, ...dictC];
+            for (const item of result) {
+                expect(allItems).toContain(item);
+            }
+        });
+        test('count of 0 returns empty array', () => {
+            const gen = createGenerator(42);
+            const result = gen.pickRandom({
+                how: 'random',
+                count: 0,
+                candidates: [dictA, dictB]
+            });
+            expect(result).toEqual([]);
+        });
+        test('single candidate dictionary picks only from that dictionary', () => {
+            const gen = createGenerator(42);
+            const result = gen.pickRandom({
+                how: 'random',
+                count: 20,
+                candidates: [dictA]
+            });
+            expect(result).toHaveLength(20);
+            for (const item of result) {
+                expect(dictA).toContain(item);
+            }
+        });
+        test('is deterministic with same seed', () => {
+            const gen1 = createGenerator(42);
+            const gen2 = createGenerator(42);
+            const params = {
+                how: 'random',
+                count: 10,
+                candidates: [dictA, dictB, dictC]
+            };
+            expect(gen1.pickRandom(params)).toEqual(gen2.pickRandom(params));
+        });
+        test('skips undefined picks from empty candidate dictionaries', () => {
+            const gen = createGenerator(42);
+            const result = gen.pickRandom({
+                how: 'random',
+                count: 20,
+                candidates: [dictA, [], dictC]
+            });
+            // Some picks land on the empty dictionary and are skipped
+            expect(result.length).toBeLessThanOrEqual(20);
+            expect(result.length).toBeGreaterThan(0);
+            const allItems = [...dictA, ...dictC];
+            for (const item of result) {
+                expect(allItems).toContain(item);
+            }
+        });
+    });
+    describe('pickSequence', () => {
+        const dictA = ['a1', 'a2'];
+        const dictB = ['b1', 'b2'];
+        test('dispatches to pickSequential for sequence mode', () => {
+            const gen = createGenerator(42);
+            const result = gen.pickSequence({
+                how: 'sequence',
+                candidates: [dictA, dictB]
+            });
+            expect(result).toHaveLength(2);
+            expect(dictA).toContain(result[0]);
+            expect(dictB).toContain(result[1]);
+        });
+        test('dispatches to pickRandom for random mode', () => {
+            const gen = createGenerator(42);
+            const result = gen.pickSequence({
+                how: 'random',
+                count: 5,
+                candidates: [dictA, dictB]
+            });
+            expect(result).toHaveLength(5);
+            const allItems = [...dictA, ...dictB];
+            for (const item of result) {
+                expect(allItems).toContain(item);
+            }
+        });
+        test('produces identical results to direct method calls', () => {
+            const gen1 = createGenerator(42);
+            const gen2 = createGenerator(42);
+            const seqResult = gen1.pickSequence({
+                how: 'sequence',
+                count: 4,
+                candidates: [dictA, dictB]
+            });
+            const directResult = gen2.pickSequential({
+                how: 'sequence',
+                count: 4,
+                candidates: [dictA, dictB]
+            });
+            expect(seqResult).toEqual(directResult);
+        });
+    });
+    describe('global RNG', () => {
+        test('setGlobalRng sets and returns the generator', () => {
+            const gen = createGenerator(42);
+            const result = PseudoRandomGenerator.setGlobalRng(gen);
+            expect(result).toBe(gen);
+            expect(PseudoRandomGenerator.getGlobalRng()).toBe(gen);
+        });
+        test('setGlobalRng with undefined clears the global', () => {
+            const gen = createGenerator(42);
+            PseudoRandomGenerator.setGlobalRng(gen);
+            expect(PseudoRandomGenerator.getGlobalRng()).toBe(gen);
+            PseudoRandomGenerator.setGlobalRng(undefined);
+            expect(PseudoRandomGenerator.getGlobalRng()).toBeUndefined();
+        });
+        test('getGlobalRng returns undefined when not set', () => {
+            expect(PseudoRandomGenerator.getGlobalRng()).toBeUndefined();
+        });
+    });
+    describe('ensureRng', () => {
+        test('returns the provided rng if given', () => {
+            const gen = createGenerator(42);
+            expect(PseudoRandomGenerator.ensureRng(gen)).toSucceedAndSatisfy((result) => {
+                expect(result).toBe(gen);
+            });
+        });
+        test('returns global rng when no rng is provided and global is set', () => {
+            const global = createGenerator(99);
+            PseudoRandomGenerator.setGlobalRng(global);
+            expect(PseudoRandomGenerator.ensureRng()).toSucceedAndSatisfy((result) => {
+                expect(result).toBe(global);
+            });
+        });
+        test('creates a new rng when none provided and no global is set', () => {
+            expect(PseudoRandomGenerator.ensureRng()).toSucceedAndSatisfy((result) => {
+                expect(result).toBeDefined();
+                expect(result.rng.counter).toBe(0);
+            });
+        });
+        test('prefers provided rng over global', () => {
+            const global = createGenerator(99);
+            const local = createGenerator(42);
+            PseudoRandomGenerator.setGlobalRng(global);
+            expect(PseudoRandomGenerator.ensureRng(local)).toSucceedAndSatisfy((result) => {
+                expect(result).toBe(local);
+            });
+        });
+    });
+});
+//# sourceMappingURL=generators.test.js.map