Ensures consistent encoding and decoding of TC Signals for the iab. Transparency and Consent Framework (TCF). 

sevriugin

@iabtcf-preprod/core

Error

Ignore

Warn

License

Maintenance

Miscellaneous

Quality

Supply chain risk

Vulnerability

Admins only

Organization members

Dashboard

<upgradeLink>Upgrade</upgradeLink> to access this feature

About

Blog

Socket CLI

Customers

Socket Dependency Search

Docs

Socket for GitHub

Love

Impersonation Mode Active

Update your browser to the latest version for the best experience.

Your web browser is outdated

Use another browser for the best experience.

Your web browser is unsupported

{{count, number}} commits last two months

{{count, number}} critical severity alert

{{count, number}} critical severity alerts

{{count, number}} dependency vulnerability

{{count, number}} dependency vulnerabilities

{{count, number}} development dependencies

{{count, number}} transitive dependencies

{{count, number}} version published last month

{{count, number}} versions published last month

{{count, number}} version published in last two months

{{count, number}} versions published in last two months

{{count, number}} version published last week

{{count, number}} versions published last week

{{count, number}} version published last year

{{count, number}} versions published last year

Socket undergoes annual SOC2 Type II audits. Socket customers can request a copy of the full SOC2 Type II report.

Allows organization owners and admins to access detailed records of actions taken by members of their organization, complete with timestamps.

Prevent compromised packages from infiltrating your supply chain by monitoring for changes in real-time.

Join our Discord community to get help from Socket engineers and other Socket users.

Compare millions of open source packages on socket.dev

Detect malicious code and risky behavior (e.g. network) in your dependencies using "deep package inspection"

All data is encrypted in transit and at rest using industry standard encryption algorithms.

Get a dedicated Socket account manager and access to Socket’s Customer Success team.

Get dedicated support from Socket engineers via email and Slack.

"Shift left" with the Socket Chrome extension and give intervene early, before developers choose risky or low quality dependencies.

Catch developers using risky dependencies and give them a "speed bump" to encourage good behavior

Install the Socket GitHub app to receive real-time dependency scanning and reports with every pull request.

Integrate Socket into your GitHub SCM to prevent risky dependencies from being installed.

Socket scans for vulnerabilities in your dependencies, including CVEs, security advisories, and more.

Socket supports dependencies in many languages, with most popular ecosystems coming in 2024. We've got you covered no matter what languages you use.

Enforce license policies across your organization

Receive a Microsoft Teams message to the channel of your choice anytime Socket runs a new analysis, has a new finding, or a policy has changed.

Get help migrating from Socket's free plan to Socket's paid plans.

Run Socket on-premises or in your own cloud environment.

Query for any dependency (at any version) across your entire organization

Integrate Socket into your CI/CD pipeline to prevent risky dependencies from being deployed to production.

Analyze an entire project to find supply chain risks

Tag projects to organize and filter your projects

Restrict access based on the roles of individual users within an organization.

Receive a Slack message to the channel of your choice anytime Socket runs a new analysis, has a new finding, or a policy has changed.

Socket is SOC2 Type II compliant and undergoes annual audits.

The Socket CLI allows teams to prevent risky dependencies from being installed, and to get dependency insights from the command line.

Socket supports SAML SSO for single sign-on and identity management.

Integrate Socket into your VS Code IDE to prevent risky dependencies from being installed.

Get a POST request anytime Socket runs a new analysis, has a new finding, or a policy has changed.

Socket will analyzed your SBOMs up to a maximum number of dependencies.

API that allows you to analyze a project, lookup package scores and alerts, and more.

Create API tokens to authenticate with the Socket API and CLI.

The number of developers in your team. A developer is someone who made a commit to your organization's repositories scanned by Socket in the past month.

Use Socket to protect your private repositories.

Socket is always free for open source projects.

Socket retains all reporting data for 3 months, 1 year, or a custom term of your choice.

Access the threat feed that powers Socket.

Unlimited scale, self-hosting, and priority support for large teams.

For open-source projects, individuals, and small teams.

For growing teams with enhanced scale, security, and support.

There is a package with a similar name that is downloaded much more often.

There are packages with similar names that are downloaded much more often.

This may not be the package you want!

Instance

Alert Locations

Package

The {{ecosystem}} package {{- packageName}} receives a total of <strong>{{numWeeklyDownloadCount, number}}</strong> weekly downloads. As such, {{- packageName}} popularity was classified as <strong>{{popularity}}</strong>.

Is {{- packageName}} popular?

Is {{- packageName}} safe to use?

Is {{- packageName}} well maintained?

What is {{- packageName}}?

{{packageDescription}}Version: {{versionString}} was published by {{publisherName}}. Start using Socket to analyze {{- packageName}} and its {{dependencyCount, number}} dependencies to secure your app from supply chain attacks.

Sorry, it seems this package was removed from the registry

Package was removed

This package version has been unpublished, mostly likely due to security reasons

Package version was removed

Provide a detailed description of the malware...

Socket fights vulnerabilities and provides visibility, defense-in-depth, and proactive supply chain protection for JavaScript, Python, and Go dependencies.

Socket - Secure your dependencies. Ship with confidence.

Compare versions

{{- packageName}} - npm Package Compare versions

import { Cloneable } from '../Cloneable.js';

declare type TreeNodeMaybe = TreeNode | null;

export declare class BinarySearchTree extends Cloneable<BinarySearchTree> {

     * performs Morris in-order traversal

    min(current?: TreeNodeMaybe): number;

    max(current?: TreeNodeMaybe): number;

    remove(value: number, current?: TreeNodeMaybe): void;

     * Build Binary Search Tree from the ordered number array.

     *  The depth of the tree will be the `log2` of the array length.

     * Build Binary Search Tree from the ordered number array

     * @param {number[]} values number array in ascending order

     * @return {BinarySearchTree} Binary Search Tree

    static build(values?: number[]): BinarySearchTree | null;

export class BinarySearchTree extends Cloneable {

        // if root is undefined or null then by definition this is empty

            // infinite loop, figure out where to put it

                // if the value is less than current value; go left

                if (value < current.value) {

                    // if it's empty, we can insert

                    if (current.left === null) {

                        // insert on the left

                        current.left = node;

                        // our work is done here

                         * if there's something there already, we'll reset the pointer and

                         * wait for the next loop to do something ie. keep traversing

                        current = current.left;

                else if (value > current.value) {

                    // if the value is greater than our current value; go right

                    if (current.right === null) {

                        // there's nothing to the right, so put it here

                        current.right = node;

                        current = current.right;

                     * If it's neither greater than the right or less than the right then

                     * it is equal to the current nodes value.  In that case we won't do

                     * anything with it because we will only insert unique values.

                retr.push(current.value); // if there is no left child, visit current node

                current = current.right; // then we go the right branch

                // find the right most leaf of root.left node.

                // when pre.right == null, it means we go to the right most leaf

                // when pre.right == current, it means the right most leaf has been visited in the last round

                while (pre.right && pre.right != current) {

                // this means the pre.right has been set, it's time to go to current node

                if (pre.right == current) {

                    // means the current node is pointed by left right most child

                    // the left branch has been visited, it's time to push the current node

                    retr.push(current.value);

                    current = current.right;

                    // the fist time to visit the pre node, make its right child point to current node

        if (!values || values.length === 0) {

            const tree = new BinarySearchTree();

            const rootIndex = values.length >> 1;

                if (rootIndex + 1 < values.length) {

                    const rightTree = BinarySearchTree.build(values.slice(rootIndex + 1));

                    root.right = rightTree ? rightTree.getRoot() : null;

                    const leftTree = BinarySearchTree.build(values.slice(0, rootIndex - 1));

                    root.left = leftTree ? leftTree.getRoot() : null;

import { PurposeRestriction } from './PurposeRestriction.js';

import { BinarySearchTree } from './BinarySearchTree.js';

import { RestrictionType } from './RestrictionType.js';

export class PurposeRestrictionVector extends Cloneable {

     * if this originatd from an encoded string we'll need a place to store the

     * bit length; it can be set and got from here

     * a map indexed by a string which will be a 'hash' of the purpose and

     * Using a BST to keep vendors in a sorted order for encoding later

    isOkToHave(restrictionType, purposeId, vendorId) {

         * without a gvl set, there's no way to know... in that case we'll return

         * true but once the GVL is set later we'll go through these and clean up

            const vendor = this.gvl.vendors[vendorId];

                if (restrictionType === RestrictionType.NOT_ALLOWED) {

                     * if it's "not allowed" then flexible declaration is ignored but if

                     * if it isn't even listed as one of the purposes the vendor uses,

                     * then there is no reason to encode the value so check both arrays

                     * to see if it exists.  If it does then we can restrict it.

                    result = (vendor.legIntPurposes.includes(purposeId) || vendor.purposes.includes(purposeId));

                else if (vendor.flexiblePurposes.length) {

                    switch (restrictionType) {

                         * If the vendor has the purposeId in flexiblePurposes and it is

                         * listed as a legitimate interest purpose we can set the

                         * override to require consent.

                        case RestrictionType.REQUIRE_CONSENT:

                            result = (vendor.flexiblePurposes.includes(purposeId) && vendor.legIntPurposes.includes(purposeId));

                         * listed as a consent purpose we can set the

                         * override to require legitimate interest.

                        case RestrictionType.REQUIRE_LI:

                            result = (vendor.flexiblePurposes.includes(purposeId) && vendor.purposes.includes(purposeId));

                // this vendor doesn't exist

        // if the gvl isn't defined, we can't do anything until later

     * add - adds a given Vendor ID under a given Purpose Restriction

     * @param {PurposeRestriction} purposeRestriction

        if (this.isOkToHave(purposeRestriction.restrictionType, purposeRestriction.purposeId, vendorId)) {

            const hash = purposeRestriction.hash;

                this.map.set(hash, new BinarySearchTree());

             * Previously I had a check here to remove a duplicate value, but because

             * we're using a tree the value is guaranteed to be unique so there is no

		@@ -110,9 +110,6 @@ import { PurposeRestriction } from './PurposeRestriction.js';
		})();
		/**
		* Create an ordered array of vendor IDs from `1` (the minimum value for Vendor ID) to `lastEntry`
		*/
		const values = [...Array(lastEntry).keys()].map((i) => i + 1);
		for (let i = 1; i <= lastEntry; i++) {
		if (!this.has(hash)) {
		this.map.set(hash, BinarySearchTree.build(values)); // use static method `build` to create a `BST` from the ordered array of IDs
		this.map.set(hash, BinarySearchTree.build(values));
		this.bitLength = 0;
		@@ -119,0 +116,0 @@ }

		{
		"name": "@iabtcf-preprod/core",
		"version": "1.5.8",
		"version": "1.5.9",
		"description": "Ensures consistent encoding and decoding of TC Signals for the iab. Transparency and Consent Framework (TCF).",
		@@ -31,3 +31,3 @@ "author": "Chris Paterson <tcf@chrispaterson.io>",
		"devDependencies": {
		"@iabtcf-preprod/testing": "1.5.8",
		"@iabtcf-preprod/testing": "1.5.9",
		"@istanbuljs/nyc-config-typescript": "^0.1.3",
		@@ -34,0 +34,0 @@ "@types/sinon": "^10.0.11",

		@@ -23,4 +23,3 @@ import { Cloneable } from '../Cloneable.js';
		/**
		* Build Binary Search Tree from the ordered number array.
		* The depth of the tree will be the `log2` of the array length.
		* Build Binary Search Tree from the ordered number array
		* @param {number[]} values number array in ascending order
		@@ -27,0 +26,0 @@ * @return {BinarySearchTree} Binary Search Tree

		@@ -235,4 +235,3 @@ import { Cloneable } from '../Cloneable.js';
		/**
		* Build Binary Search Tree from the ordered number array.
		* The depth of the tree will be the `log2` of the array length.
		* Build Binary Search Tree from the ordered number array
		* @param {number[]} values number array in ascending order
		@@ -239,0 +238,0 @@ * @return {BinarySearchTree} Binary Search Tree

Worsened metrics