From b3361a282bc1858b02a8f4b6b48b4a2c46ec9b99 Mon Sep 17 00:00:00 2001 From: Ori Cohen <ori88c@gmail.com> Date: Sun, 27 Oct 2024 01:37:16 +0300 Subject: [PATCH] Bump version to v1.0.2: Documentation and README improvements --- package-lock.json | 4 ++-- package.json | 4 ++-- 2 files changed, 4 insertions(+), 4 deletions(-) diff --git a/package-lock.json b/package-lock.json index 0c0b936..2233600 100644 --- a/package-lock.json +++ b/package-lock.json @@ -1,12 +1,12 @@ { "name": "weighted-random-item-sampler", - "version": "1.0.1", + "version": "1.0.2", "lockfileVersion": 3, "requires": true, "packages": { "": { "name": "weighted-random-item-sampler", - "version": "1.0.1", + "version": "1.0.2", "license": "Apache-2.0", "devDependencies": { "@types/jest": "^29.5.12", diff --git a/package.json b/package.json index 438dc35..40d7188 100644 --- a/package.json +++ b/package.json @@ -1,7 +1,7 @@ { "name": "weighted-random-item-sampler", - "version": "1.0.1", - "description": "A weighted random item sampler (selector), where the probability of selecting an item is proportional to its weight. The sampling method utilizes a binary search optimization, making it suitable for performance-demanding applications where the set of items is large and the sampling frequency is high.", + "version": "1.0.2", + "description": "A weighted random item sampler (selector), where the probability of selecting an item is proportional to its weight, with replacement allowed between samples. In other words, an item can be sampled more than once. The sampling method utilizes a binary search optimization, making it suitable for performance-demanding applications where the set of items is large and the sampling frequency is high.", "repository": { "type": "git", "url": "git+https://github.com/ori88c/weighted-random-item-sampler.git"