Open source alternative to Semrush and Ahrefs
TypeScript backlink-analysisgoogle-search-console-mcpkeyword-researchmcpseoseo-agentseo-auditseo-automationseo-skillsseo-toolssite-audit
import { describe, expect, it } from "vitest";
import { dataforseoPricing } from "@/server/lib/dataforseo/pricing";
import { creditsForProviderUsd } from "@/shared/billing";
import { estimateRankCheckCredits } from "@/shared/rank-tracking";
const location = { locationCode: 2840, languageCode: "en" };
describe("dataforseoPricing", () => {
it.each([
{
name: "Labs research, 500 rows with clickstream (incident shape)",
estimateUsd: dataforseoPricing.keywords.related({
keyword: "seo",
...location,
limit: 500,
includeClickstreamData: true,
}),
rawUsd: 0.144,
credits: 185,
},
{
name: "Labs research, default 150 rows",
estimateUsd: dataforseoPricing.keywords.suggestions({
keyword: "seo",
...location,
limit: 150,
}),
rawUsd: 0.03,
credits: 39,
},
{
name: "live SERP at the default depth (2 pages)",
estimateUsd: dataforseoPricing.serp.live({ keyword: "seo", ...location }),
rawUsd: 0.0035,
credits: 5,
},
{
name: "live SERP for a keyword with a search operator (billed 5x)",
estimateUsd: dataforseoPricing.serp.live({
keyword: "site:example.com seo",
...location,
}),
rawUsd: 0.0175,
credits: 23,
},
{
name: "Lighthouse run",
estimateUsd: dataforseoPricing.lighthouse.live({
url: "https://example.com",
strategy: "mobile",
}),
rawUsd: 0.005,
credits: 7,
},
{
name: "backlinks history over one year",
estimateUsd: dataforseoPricing.backlinks.history({
target: "example.com",
dateFrom: "2025-09-09",
dateTo: "2026-09-08",
}),
rawUsd: 0.024 + 365 * 0.000036,
credits: 48,
},
])("$name", ({ estimateUsd, rawUsd, credits }) => {
expect(estimateUsd).toBeCloseTo(rawUsd, 10);
expect(creditsForProviderUsd(estimateUsd)).toBe(credits);
});
it.each([
{ includeOtherSources: false, billedUsd: 0.00375 },
{ includeOtherSources: true, billedUsd: 0.01 },
])(
"holds at least the billed cost of a depth-20 reviews post (other sources: $includeOtherSources)",
({ includeOtherSources, billedUsd }) => {
const estimateUsd = dataforseoPricing.business.reviewsTaskPost({
cid: "123",
...location,
depth: 20,
sortBy: "newest",
includeOtherSources,
});
expect(creditsForProviderUsd(estimateUsd)).toBeGreaterThanOrEqual(
creditsForProviderUsd(billedUsd),
);
},
);
// Real bills read from DataForSEO's id_list, each above the earlier estimate.
const near = { locationCoordinate: "40.74,-73.98", languageCode: "en" };
it.each([
{
name: "Q&A at depth 10",
estimateUsd: dataforseoPricing.business.questionsAnswers({
keyword: "x",
...near,
depth: 10,
}),
billedUsd: 0.0054,
},
{
name: "Q&A at depth 30",
estimateUsd: dataforseoPricing.business.questionsAnswers({
keyword: "x",
...near,
depth: 30,
}),
billedUsd: 0.0108,
},
{
name: "Local Finder at depth 100",
estimateUsd: dataforseoPricing.serp.local({
keyword: "x",
...near,
searchType: "local_finder",
device: "mobile",
depth: 100,
}),
billedUsd: 0.02,
},
{
name: "Maps tasks queued at high priority",
estimateUsd: dataforseoPricing.serp.localTaskPost({
keyword: "x",
locationCoordinates: ["1,1,13z", "2,2,13z"],
languageCode: "en",
device: "mobile",
depth: 20,
}),
billedUsd: 0.0024,
},
{
name: "Claude response with web search",
estimateUsd: dataforseoPricing.aiSearch.llmResponse({
userPrompt: "x",
modelSlug: "claude",
modelName: "claude-sonnet-4-5",
webSearch: true,
}),
billedUsd: 0.142357,
},
])(
"holds at least the measured bill: $name",
({ estimateUsd, billedUsd }) => {
expect(estimateUsd).toBeGreaterThanOrEqual(billedUsd);
},
);
it("prices a queued task_post batch the way the rank check estimate does", () => {
// Operator keywords bill 5x, so approvals must see the same mix.
const keywords = Array.from({ length: 100 }, (_, i) =>
i % 10 === 0 ? `site:example.com kw ${i}` : `kw ${i}`,
);
const estimateUsd = dataforseoPricing.serp.rankCheckTaskPost({
tasks: keywords.map((keyword, i) => ({
keyword,
keywordId: `id-${i}`,
device: "desktop" as const,
})),
...location,
depth: 20,
targetDomain: "example.com",
});
// The estimate is the worst case: this post plus two queued retries.
expect(3 * creditsForProviderUsd(estimateUsd)).toBe(
estimateRankCheckCredits(keywords, "desktop", 20, "queued").costCredits,
);
});
it("prices a live operator rank check the way the rank check estimate does", () => {
const keyword = "site:example.com seo";
const liveUsd = dataforseoPricing.serp.rankCheck({
keyword,
keywordId: "id",
...location,
device: "desktop",
depth: 20,
targetDomain: "example.com",
});
const retryUsd = dataforseoPricing.serp.rankCheckTaskPost({
tasks: [{ keyword, keywordId: "id", device: "desktop" }],
...location,
depth: 20,
targetDomain: "example.com",
});
// The estimate is the worst case: the live call plus two queued retries.
expect(
creditsForProviderUsd(liveUsd) + 2 * creditsForProviderUsd(retryUsd),
).toBe(
estimateRankCheckCredits([keyword], "desktop", 20, "live").costCredits,
);
});
});