@langchain/core 0.0.10 → 0.0.11-rc.1

package/dist/documents/transformers.cjs

@@ -1,6 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.BaseDocumentTransformer = void 0;
+exports.MappingDocumentTransformer = exports.BaseDocumentTransformer = void 0;
 const base_js_1 = require("../runnables/base.cjs");
 /**
  * Abstract base class for document transformation systems.
@@ -34,3 +34,18 @@ class BaseDocumentTransformer extends base_js_1.Runnable {
     }
 }
 exports.BaseDocumentTransformer = BaseDocumentTransformer;
+/**
+ * Class for document transformers that return exactly one transformed document
+ * for each input document.
+ */
+class MappingDocumentTransformer extends BaseDocumentTransformer {
+    async transformDocuments(documents) {
+        const newDocuments = [];
+        for (const document of documents) {
+            const transformedDocument = await this._transformDocument(document);
+            newDocuments.push(transformedDocument);
+        }
+        return newDocuments;
+    }
+}
+exports.MappingDocumentTransformer = MappingDocumentTransformer;

package/dist/documents/transformers.d.ts

@@ -28,3 +28,11 @@ export declare abstract class BaseDocumentTransformer<RunInput extends Document[
      */
     invoke(input: RunInput, _options: BaseCallbackConfig): Promise<RunOutput>;
 }
+/**
+ * Class for document transformers that return exactly one transformed document
+ * for each input document.
+ */
+export declare abstract class MappingDocumentTransformer extends BaseDocumentTransformer {
+    transformDocuments(documents: Document[]): Promise<Document[]>;
+    abstract _transformDocument(document: Document): Promise<Document>;
+}

package/dist/documents/transformers.js

@@ -30,3 +30,17 @@ export class BaseDocumentTransformer extends Runnable {
         return this.transformDocuments(input);
     }
 }
+/**
+ * Class for document transformers that return exactly one transformed document
+ * for each input document.
+ */
+export class MappingDocumentTransformer extends BaseDocumentTransformer {
+    async transformDocuments(documents) {
+        const newDocuments = [];
+        for (const document of documents) {
+            const transformedDocument = await this._transformDocument(document);
+            newDocuments.push(transformedDocument);
+        }
+        return newDocuments;
+    }
+}

package/dist/load/import_map.cjs

@@ -24,7 +24,7 @@ var __importStar = (this && this.__importStar) || function (mod) {
     return result;
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.vectorstores = exports.utils__types = exports.utils__tiktoken = exports.utils__testing = exports.utils__stream = exports.utils__json_schema = exports.utils__json_patch = exports.utils__hash = exports.utils__env = exports.utils__async_caller = exports.tracers__tracer_langchain = exports.tracers__tracer_langchain_v1 = exports.tracers__run_collector = exports.tracers__log_stream = exports.tracers__initialize = exports.tracers__console = exports.tracers__base = exports.tools = exports.stores = exports.retrievers = exports.runnables = exports.prompt_values = exports.prompts = exports.outputs = exports.output_parsers = exports.messages = exports.memory = exports.load__serializable = exports.language_models__llms = exports.language_models__chat_models = exports.language_models__base = exports.example_selectors = exports.embeddings = exports.documents = exports.chat_history = exports.callbacks__promises = exports.callbacks__manager = exports.callbacks__base = exports.caches = exports.agents = void 0;
+exports.vectorstores = exports.utils__types = exports.utils__tiktoken = exports.utils__testing = exports.utils__stream = exports.utils__math = exports.utils__json_schema = exports.utils__json_patch = exports.utils__hash = exports.utils__env = exports.utils__async_caller = exports.tracers__tracer_langchain = exports.tracers__tracer_langchain_v1 = exports.tracers__run_collector = exports.tracers__log_stream = exports.tracers__initialize = exports.tracers__console = exports.tracers__base = exports.tools = exports.stores = exports.retrievers = exports.runnables = exports.prompt_values = exports.prompts = exports.outputs = exports.output_parsers = exports.messages = exports.memory = exports.load__serializable = exports.language_models__llms = exports.language_models__chat_models = exports.language_models__base = exports.example_selectors = exports.embeddings = exports.documents = exports.chat_history = exports.callbacks__promises = exports.callbacks__manager = exports.callbacks__base = exports.caches = exports.agents = void 0;
 exports.agents = __importStar(require("../agents.cjs"));
 exports.caches = __importStar(require("../caches.cjs"));
 exports.callbacks__base = __importStar(require("../callbacks/base.cjs"));
@@ -60,6 +60,7 @@ exports.utils__env = __importStar(require("../utils/env.cjs"));
 exports.utils__hash = __importStar(require("../utils/hash.cjs"));
 exports.utils__json_patch = __importStar(require("../utils/json_patch.cjs"));
 exports.utils__json_schema = __importStar(require("../utils/json_schema.cjs"));
+exports.utils__math = __importStar(require("../utils/math.cjs"));
 exports.utils__stream = __importStar(require("../utils/stream.cjs"));
 exports.utils__testing = __importStar(require("../utils/testing/index.cjs"));
 exports.utils__tiktoken = __importStar(require("../utils/tiktoken.cjs"));

package/dist/load/import_map.d.ts

@@ -33,6 +33,7 @@ export * as utils__env from "../utils/env.js";
 export * as utils__hash from "../utils/hash.js";
 export * as utils__json_patch from "../utils/json_patch.js";
 export * as utils__json_schema from "../utils/json_schema.js";
+export * as utils__math from "../utils/math.js";
 export * as utils__stream from "../utils/stream.js";
 export * as utils__testing from "../utils/testing/index.js";
 export * as utils__tiktoken from "../utils/tiktoken.js";

package/dist/load/import_map.js

@@ -34,6 +34,7 @@ export * as utils__env from "../utils/env.js";
 export * as utils__hash from "../utils/hash.js";
 export * as utils__json_patch from "../utils/json_patch.js";
 export * as utils__json_schema from "../utils/json_schema.js";
+export * as utils__math from "../utils/math.js";
 export * as utils__stream from "../utils/stream.js";
 export * as utils__testing from "../utils/testing/index.js";
 export * as utils__tiktoken from "../utils/tiktoken.js";

package/dist/load/index.cjs

@@ -93,12 +93,17 @@ async function reviver(value) {
         const namespace = namespaceReverse.reverse();
         const finalImportMap = { ...defaultImportMap, ...importMap };
         let module = null;
+        const optionalImportNamespaceAliases = [namespace.join("/")];
+        if (namespace[0] === "langchain_community") {
+            optionalImportNamespaceAliases.push(["langchain", ...namespace.slice(1)].join("/"));
+        }
+        const matchingNamespaceAlias = optionalImportNamespaceAliases.find((alias) => alias in optionalImportsMap);
         if (import_constants_js_1.optionalImportEntrypoints
             .concat(optionalImportEntrypoints)
             .includes(namespace.join("/")) ||
-            namespace.join("/") in optionalImportsMap) {
-            if (namespace.join("/") in optionalImportsMap) {
-                module = await optionalImportsMap[namespace.join("/")];
+            matchingNamespaceAlias) {
+            if (matchingNamespaceAlias !== undefined) {
+                module = await optionalImportsMap[matchingNamespaceAlias];
             }
             else {
                 throw new Error(`Missing key "${namespace.join("/")}" for ${pathStr} in load(optionalImportsMap={})`);
@@ -108,6 +113,7 @@ async function reviver(value) {
             // Currently, we only support langchain imports.
             if (namespace[0] === "langchain" ||
                 namespace[0] === "langchain_core" ||
+                namespace[0] === "langchain_community" ||
                 namespace[0] === "langchain_anthropic" ||
                 namespace[0] === "langchain_openai") {
                 namespace.shift();

package/dist/load/index.js

@@ -67,12 +67,17 @@ async function reviver(value) {
         const namespace = namespaceReverse.reverse();
         const finalImportMap = { ...defaultImportMap, ...importMap };
         let module = null;
+        const optionalImportNamespaceAliases = [namespace.join("/")];
+        if (namespace[0] === "langchain_community") {
+            optionalImportNamespaceAliases.push(["langchain", ...namespace.slice(1)].join("/"));
+        }
+        const matchingNamespaceAlias = optionalImportNamespaceAliases.find((alias) => alias in optionalImportsMap);
         if (defaultOptionalImportEntrypoints
             .concat(optionalImportEntrypoints)
             .includes(namespace.join("/")) ||
-            namespace.join("/") in optionalImportsMap) {
-            if (namespace.join("/") in optionalImportsMap) {
-                module = await optionalImportsMap[namespace.join("/")];
+            matchingNamespaceAlias) {
+            if (matchingNamespaceAlias !== undefined) {
+                module = await optionalImportsMap[matchingNamespaceAlias];
             }
             else {
                 throw new Error(`Missing key "${namespace.join("/")}" for ${pathStr} in load(optionalImportsMap={})`);
@@ -82,6 +87,7 @@ async function reviver(value) {
             // Currently, we only support langchain imports.
             if (namespace[0] === "langchain" ||
                 namespace[0] === "langchain_core" ||
+                namespace[0] === "langchain_community" ||
                 namespace[0] === "langchain_anthropic" ||
                 namespace[0] === "langchain_openai") {
                 namespace.shift();

package/dist/messages/index.cjs

@@ -1,6 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.mapStoredMessageToChatMessage = exports.getBufferString = exports.ChatMessageChunk = exports.coerceMessageLikeToMessage = exports.isBaseMessageChunk = exports.isBaseMessage = exports.ChatMessage = exports.ToolMessageChunk = exports.ToolMessage = exports.FunctionMessageChunk = exports.FunctionMessage = exports.SystemMessageChunk = exports.SystemMessage = exports.AIMessageChunk = exports.AIMessage = exports.HumanMessageChunk = exports.HumanMessage = exports.BaseMessageChunk = exports.BaseMessage = void 0;
+exports.mapChatMessagesToStoredMessages = exports.mapStoredMessagesToChatMessages = exports.mapStoredMessageToChatMessage = exports.getBufferString = exports.ChatMessageChunk = exports.coerceMessageLikeToMessage = exports.isBaseMessageChunk = exports.isBaseMessage = exports.ChatMessage = exports.ToolMessageChunk = exports.ToolMessage = exports.FunctionMessageChunk = exports.FunctionMessage = exports.SystemMessageChunk = exports.SystemMessage = exports.AIMessageChunk = exports.AIMessage = exports.HumanMessageChunk = exports.HumanMessage = exports.BaseMessageChunk = exports.BaseMessage = void 0;
 const serializable_js_1 = require("../load/serializable.cjs");
 function mergeContent(firstContent, secondContent) {
     // If first content is a string
@@ -556,3 +556,25 @@ function mapStoredMessageToChatMessage(message) {
     }
 }
 exports.mapStoredMessageToChatMessage = mapStoredMessageToChatMessage;
+/**
+ * Transforms an array of `StoredMessage` instances into an array of
+ * `BaseMessage` instances. It uses the `mapV1MessageToStoredMessage`
+ * function to ensure all messages are in the `StoredMessage` format, then
+ * creates new instances of the appropriate `BaseMessage` subclass based
+ * on the type of each message. This function is used to prepare stored
+ * messages for use in a chat context.
+ */
+function mapStoredMessagesToChatMessages(messages) {
+    return messages.map(mapStoredMessageToChatMessage);
+}
+exports.mapStoredMessagesToChatMessages = mapStoredMessagesToChatMessages;
+/**
+ * Transforms an array of `BaseMessage` instances into an array of
+ * `StoredMessage` instances. It does this by calling the `toDict` method
+ * on each `BaseMessage`, which returns a `StoredMessage`. This function
+ * is used to prepare chat messages for storage.
+ */
+function mapChatMessagesToStoredMessages(messages) {
+    return messages.map((message) => message.toDict());
+}
+exports.mapChatMessagesToStoredMessages = mapChatMessagesToStoredMessages;

package/dist/messages/index.d.ts

@@ -234,3 +234,19 @@ export declare class ChatMessageChunk extends BaseMessageChunk {
  */
 export declare function getBufferString(messages: BaseMessage[], humanPrefix?: string, aiPrefix?: string): string;
 export declare function mapStoredMessageToChatMessage(message: StoredMessage): ChatMessage | HumanMessage | AIMessage | SystemMessage | FunctionMessage | ToolMessage;
+/**
+ * Transforms an array of `StoredMessage` instances into an array of
+ * `BaseMessage` instances. It uses the `mapV1MessageToStoredMessage`
+ * function to ensure all messages are in the `StoredMessage` format, then
+ * creates new instances of the appropriate `BaseMessage` subclass based
+ * on the type of each message. This function is used to prepare stored
+ * messages for use in a chat context.
+ */
+export declare function mapStoredMessagesToChatMessages(messages: StoredMessage[]): BaseMessage[];
+/**
+ * Transforms an array of `BaseMessage` instances into an array of
+ * `StoredMessage` instances. It does this by calling the `toDict` method
+ * on each `BaseMessage`, which returns a `StoredMessage`. This function
+ * is used to prepare chat messages for storage.
+ */
+export declare function mapChatMessagesToStoredMessages(messages: BaseMessage[]): StoredMessage[];

package/dist/messages/index.js

@@ -534,3 +534,23 @@ export function mapStoredMessageToChatMessage(message) {
             throw new Error(`Got unexpected type: ${storedMessage.type}`);
     }
 }
+/**
+ * Transforms an array of `StoredMessage` instances into an array of
+ * `BaseMessage` instances. It uses the `mapV1MessageToStoredMessage`
+ * function to ensure all messages are in the `StoredMessage` format, then
+ * creates new instances of the appropriate `BaseMessage` subclass based
+ * on the type of each message. This function is used to prepare stored
+ * messages for use in a chat context.
+ */
+export function mapStoredMessagesToChatMessages(messages) {
+    return messages.map(mapStoredMessageToChatMessage);
+}
+/**
+ * Transforms an array of `BaseMessage` instances into an array of
+ * `StoredMessage` instances. It does this by calling the `toDict` method
+ * on each `BaseMessage`, which returns a `StoredMessage`. This function
+ * is used to prepare chat messages for storage.
+ */
+export function mapChatMessagesToStoredMessages(messages) {
+    return messages.map((message) => message.toDict());
+}

package/dist/utils/math.cjs

@@ -0,0 +1,125 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.maximalMarginalRelevance = exports.euclideanDistance = exports.innerProduct = exports.cosineSimilarity = exports.normalize = exports.matrixFunc = void 0;
+const ml_distance_1 = require("ml-distance");
+/**
+ * Apply a row-wise function between two matrices with the same number of columns.
+ *
+ * @param {number[][]} X - The first matrix.
+ * @param {number[][]} Y - The second matrix.
+ * @param {VectorFunction} func - The function to apply.
+ *
+ * @throws {Error} If the number of columns in X and Y are not the same.
+ *
+ * @returns {number[][] | [[]]} A matrix where each row represents the result of applying the function between the corresponding rows of X and Y.
+ */
+function matrixFunc(X, Y, func) {
+    if (X.length === 0 ||
+        X[0].length === 0 ||
+        Y.length === 0 ||
+        Y[0].length === 0) {
+        return [[]];
+    }
+    if (X[0].length !== Y[0].length) {
+        throw new Error(`Number of columns in X and Y must be the same. X has shape ${[
+            X.length,
+            X[0].length,
+        ]} and Y has shape ${[Y.length, Y[0].length]}.`);
+    }
+    return X.map((xVector) => Y.map((yVector) => func(xVector, yVector)).map((similarity) => Number.isNaN(similarity) ? 0 : similarity));
+}
+exports.matrixFunc = matrixFunc;
+function normalize(M, similarity = false) {
+    const max = matrixMaxVal(M);
+    return M.map((row) => row.map((val) => (similarity ? 1 - val / max : val / max)));
+}
+exports.normalize = normalize;
+/**
+ * This function calculates the row-wise cosine similarity between two matrices with the same number of columns.
+ *
+ * @param {number[][]} X - The first matrix.
+ * @param {number[][]} Y - The second matrix.
+ *
+ * @throws {Error} If the number of columns in X and Y are not the same.
+ *
+ * @returns {number[][] | [[]]} A matrix where each row represents the cosine similarity values between the corresponding rows of X and Y.
+ */
+function cosineSimilarity(X, Y) {
+    return matrixFunc(X, Y, ml_distance_1.similarity.cosine);
+}
+exports.cosineSimilarity = cosineSimilarity;
+function innerProduct(X, Y) {
+    return matrixFunc(X, Y, ml_distance_1.distance.innerProduct);
+}
+exports.innerProduct = innerProduct;
+function euclideanDistance(X, Y) {
+    return matrixFunc(X, Y, ml_distance_1.distance.euclidean);
+}
+exports.euclideanDistance = euclideanDistance;
+/**
+ * This function implements the Maximal Marginal Relevance algorithm
+ * to select a set of embeddings that maximizes the diversity and relevance to a query embedding.
+ *
+ * @param {number[]|number[][]} queryEmbedding - The query embedding.
+ * @param {number[][]} embeddingList - The list of embeddings to select from.
+ * @param {number} [lambda=0.5] - The trade-off parameter between relevance and diversity.
+ * @param {number} [k=4] - The maximum number of embeddings to select.
+ *
+ * @returns {number[]} The indexes of the selected embeddings in the embeddingList.
+ */
+function maximalMarginalRelevance(queryEmbedding, embeddingList, lambda = 0.5, k = 4) {
+    if (Math.min(k, embeddingList.length) <= 0) {
+        return [];
+    }
+    const queryEmbeddingExpanded = (Array.isArray(queryEmbedding[0]) ? queryEmbedding : [queryEmbedding]);
+    const similarityToQuery = cosineSimilarity(queryEmbeddingExpanded, embeddingList)[0];
+    const mostSimilarEmbeddingIndex = argMax(similarityToQuery).maxIndex;
+    const selectedEmbeddings = [embeddingList[mostSimilarEmbeddingIndex]];
+    const selectedEmbeddingsIndexes = [mostSimilarEmbeddingIndex];
+    while (selectedEmbeddingsIndexes.length < Math.min(k, embeddingList.length)) {
+        let bestScore = -Infinity;
+        let bestIndex = -1;
+        const similarityToSelected = cosineSimilarity(embeddingList, selectedEmbeddings);
+        similarityToQuery.forEach((queryScore, queryScoreIndex) => {
+            if (selectedEmbeddingsIndexes.includes(queryScoreIndex)) {
+                return;
+            }
+            const maxSimilarityToSelected = Math.max(...similarityToSelected[queryScoreIndex]);
+            const score = lambda * queryScore - (1 - lambda) * maxSimilarityToSelected;
+            if (score > bestScore) {
+                bestScore = score;
+                bestIndex = queryScoreIndex;
+            }
+        });
+        selectedEmbeddings.push(embeddingList[bestIndex]);
+        selectedEmbeddingsIndexes.push(bestIndex);
+    }
+    return selectedEmbeddingsIndexes;
+}
+exports.maximalMarginalRelevance = maximalMarginalRelevance;
+/**
+ * Finds the index of the maximum value in the given array.
+ * @param {number[]} array - The input array.
+ *
+ * @returns {number} The index of the maximum value in the array. If the array is empty, returns -1.
+ */
+function argMax(array) {
+    if (array.length === 0) {
+        return {
+            maxIndex: -1,
+            maxValue: NaN,
+        };
+    }
+    let maxValue = array[0];
+    let maxIndex = 0;
+    for (let i = 1; i < array.length; i += 1) {
+        if (array[i] > maxValue) {
+            maxIndex = i;
+            maxValue = array[i];
+        }
+    }
+    return { maxIndex, maxValue };
+}
+function matrixMaxVal(arrays) {
+    return arrays.reduce((acc, array) => Math.max(acc, argMax(array).maxValue), 0);
+}

package/dist/utils/math.d.ts

@@ -0,0 +1,40 @@
+type VectorFunction = (xVector: number[], yVector: number[]) => number;
+/**
+ * Apply a row-wise function between two matrices with the same number of columns.
+ *
+ * @param {number[][]} X - The first matrix.
+ * @param {number[][]} Y - The second matrix.
+ * @param {VectorFunction} func - The function to apply.
+ *
+ * @throws {Error} If the number of columns in X and Y are not the same.
+ *
+ * @returns {number[][] | [[]]} A matrix where each row represents the result of applying the function between the corresponding rows of X and Y.
+ */
+export declare function matrixFunc(X: number[][], Y: number[][], func: VectorFunction): number[][];
+export declare function normalize(M: number[][], similarity?: boolean): number[][];
+/**
+ * This function calculates the row-wise cosine similarity between two matrices with the same number of columns.
+ *
+ * @param {number[][]} X - The first matrix.
+ * @param {number[][]} Y - The second matrix.
+ *
+ * @throws {Error} If the number of columns in X and Y are not the same.
+ *
+ * @returns {number[][] | [[]]} A matrix where each row represents the cosine similarity values between the corresponding rows of X and Y.
+ */
+export declare function cosineSimilarity(X: number[][], Y: number[][]): number[][];
+export declare function innerProduct(X: number[][], Y: number[][]): number[][];
+export declare function euclideanDistance(X: number[][], Y: number[][]): number[][];
+/**
+ * This function implements the Maximal Marginal Relevance algorithm
+ * to select a set of embeddings that maximizes the diversity and relevance to a query embedding.
+ *
+ * @param {number[]|number[][]} queryEmbedding - The query embedding.
+ * @param {number[][]} embeddingList - The list of embeddings to select from.
+ * @param {number} [lambda=0.5] - The trade-off parameter between relevance and diversity.
+ * @param {number} [k=4] - The maximum number of embeddings to select.
+ *
+ * @returns {number[]} The indexes of the selected embeddings in the embeddingList.
+ */
+export declare function maximalMarginalRelevance(queryEmbedding: number[] | number[][], embeddingList: number[][], lambda?: number, k?: number): number[];
+export {};

package/dist/utils/math.js

@@ -0,0 +1,116 @@
+import { similarity as ml_distance_similarity, distance as ml_distance, } from "ml-distance";
+/**
+ * Apply a row-wise function between two matrices with the same number of columns.
+ *
+ * @param {number[][]} X - The first matrix.
+ * @param {number[][]} Y - The second matrix.
+ * @param {VectorFunction} func - The function to apply.
+ *
+ * @throws {Error} If the number of columns in X and Y are not the same.
+ *
+ * @returns {number[][] | [[]]} A matrix where each row represents the result of applying the function between the corresponding rows of X and Y.
+ */
+export function matrixFunc(X, Y, func) {
+    if (X.length === 0 ||
+        X[0].length === 0 ||
+        Y.length === 0 ||
+        Y[0].length === 0) {
+        return [[]];
+    }
+    if (X[0].length !== Y[0].length) {
+        throw new Error(`Number of columns in X and Y must be the same. X has shape ${[
+            X.length,
+            X[0].length,
+        ]} and Y has shape ${[Y.length, Y[0].length]}.`);
+    }
+    return X.map((xVector) => Y.map((yVector) => func(xVector, yVector)).map((similarity) => Number.isNaN(similarity) ? 0 : similarity));
+}
+export function normalize(M, similarity = false) {
+    const max = matrixMaxVal(M);
+    return M.map((row) => row.map((val) => (similarity ? 1 - val / max : val / max)));
+}
+/**
+ * This function calculates the row-wise cosine similarity between two matrices with the same number of columns.
+ *
+ * @param {number[][]} X - The first matrix.
+ * @param {number[][]} Y - The second matrix.
+ *
+ * @throws {Error} If the number of columns in X and Y are not the same.
+ *
+ * @returns {number[][] | [[]]} A matrix where each row represents the cosine similarity values between the corresponding rows of X and Y.
+ */
+export function cosineSimilarity(X, Y) {
+    return matrixFunc(X, Y, ml_distance_similarity.cosine);
+}
+export function innerProduct(X, Y) {
+    return matrixFunc(X, Y, ml_distance.innerProduct);
+}
+export function euclideanDistance(X, Y) {
+    return matrixFunc(X, Y, ml_distance.euclidean);
+}
+/**
+ * This function implements the Maximal Marginal Relevance algorithm
+ * to select a set of embeddings that maximizes the diversity and relevance to a query embedding.
+ *
+ * @param {number[]|number[][]} queryEmbedding - The query embedding.
+ * @param {number[][]} embeddingList - The list of embeddings to select from.
+ * @param {number} [lambda=0.5] - The trade-off parameter between relevance and diversity.
+ * @param {number} [k=4] - The maximum number of embeddings to select.
+ *
+ * @returns {number[]} The indexes of the selected embeddings in the embeddingList.
+ */
+export function maximalMarginalRelevance(queryEmbedding, embeddingList, lambda = 0.5, k = 4) {
+    if (Math.min(k, embeddingList.length) <= 0) {
+        return [];
+    }
+    const queryEmbeddingExpanded = (Array.isArray(queryEmbedding[0]) ? queryEmbedding : [queryEmbedding]);
+    const similarityToQuery = cosineSimilarity(queryEmbeddingExpanded, embeddingList)[0];
+    const mostSimilarEmbeddingIndex = argMax(similarityToQuery).maxIndex;
+    const selectedEmbeddings = [embeddingList[mostSimilarEmbeddingIndex]];
+    const selectedEmbeddingsIndexes = [mostSimilarEmbeddingIndex];
+    while (selectedEmbeddingsIndexes.length < Math.min(k, embeddingList.length)) {
+        let bestScore = -Infinity;
+        let bestIndex = -1;
+        const similarityToSelected = cosineSimilarity(embeddingList, selectedEmbeddings);
+        similarityToQuery.forEach((queryScore, queryScoreIndex) => {
+            if (selectedEmbeddingsIndexes.includes(queryScoreIndex)) {
+                return;
+            }
+            const maxSimilarityToSelected = Math.max(...similarityToSelected[queryScoreIndex]);
+            const score = lambda * queryScore - (1 - lambda) * maxSimilarityToSelected;
+            if (score > bestScore) {
+                bestScore = score;
+                bestIndex = queryScoreIndex;
+            }
+        });
+        selectedEmbeddings.push(embeddingList[bestIndex]);
+        selectedEmbeddingsIndexes.push(bestIndex);
+    }
+    return selectedEmbeddingsIndexes;
+}
+/**
+ * Finds the index of the maximum value in the given array.
+ * @param {number[]} array - The input array.
+ *
+ * @returns {number} The index of the maximum value in the array. If the array is empty, returns -1.
+ */
+function argMax(array) {
+    if (array.length === 0) {
+        return {
+            maxIndex: -1,
+            maxValue: NaN,
+        };
+    }
+    let maxValue = array[0];
+    let maxIndex = 0;
+    for (let i = 1; i < array.length; i += 1) {
+        if (array[i] > maxValue) {
+            maxIndex = i;
+            maxValue = array[i];
+        }
+    }
+    return { maxIndex, maxValue };
+}
+function matrixMaxVal(arrays) {
+    return arrays.reduce((acc, array) => Math.max(acc, argMax(array).maxValue), 0);
+}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@langchain/core",
-  "version": "0.0.10",
+  "version": "0.0.11-rc.1",
   "description": "Core LangChain.js abstractions and schemas",
   "type": "module",
   "engines": {
@@ -40,6 +40,7 @@
     "decamelize": "1.2.0",
     "js-tiktoken": "^1.0.8",
     "langsmith": "~0.0.48",
+    "ml-distance": "^4.0.0",
     "p-queue": "^6.6.2",
     "p-retry": "4",
     "uuid": "^9.0.0",
@@ -59,6 +60,7 @@
     "eslint-plugin-prettier": "^4.2.1",
     "jest": "^29.5.0",
     "jest-environment-node": "^29.6.4",
+    "ml-matrix": "^6.10.4",
     "prettier": "^2.8.3",
     "release-it": "^15.10.1",
     "rimraf": "^5.0.1",
@@ -263,6 +265,11 @@
       "import": "./utils/json_schema.js",
       "require": "./utils/json_schema.cjs"
     },
+    "./utils/math": {
+      "types": "./utils/math.d.ts",
+      "import": "./utils/math.js",
+      "require": "./utils/math.cjs"
+    },
     "./utils/stream": {
       "types": "./utils/stream.d.ts",
       "import": "./utils/stream.js",
@@ -400,6 +407,9 @@
     "utils/json_schema.cjs",
     "utils/json_schema.js",
     "utils/json_schema.d.ts",
+    "utils/math.cjs",
+    "utils/math.js",
+    "utils/math.d.ts",
     "utils/stream.cjs",
     "utils/stream.js",
     "utils/stream.d.ts",

package/utils/math.cjs

@@ -0,0 +1 @@
+module.exports = require('../dist/utils/math.cjs');

package/utils/math.d.ts

@@ -0,0 +1 @@
+export * from '../dist/utils/math.js'

package/utils/math.js

@@ -0,0 +1 @@
+export * from '../dist/utils/math.js'