「程式是對複雜度的管理。」隨著模組增加,硬編碼依賴(在函式內直接 new Service())會導致:
依賴注入(DI)透過「反轉控制」,將建立依賴的責任移交給外部容器,達成低耦合、高可測試性。
// 依賴以參數形式傳入
function doSomething(service, router, other) {
const s = service();
const r = router();
}
doSomething(service, router, "Other");
缺點:呼叫端散落各處,若依賴變更需全域搜尋替換。
// 註冊依賴
const injector = {
dependencies: {},
register(key, value) { this.dependencies[key] = value; },
resolve(deps, func, scope) {
const args = deps.map(d => {
if (!this.dependencies[d]) throw new Error(`找不到依賴:${d}`);
return this.dependencies[d];
});
return function (...extraArgs) {
func.apply(scope || {}, [...args, ...extraArgs]);
};
}
};
injector.register("service", () => ({ name: "Service" }));
injector.register("router", () => ({ name: "Router" }));
const doSomething = injector.resolve(
["service", "router"],
function (service, router, other) {
console.log(service().name, router().name, other);
}
);
doSomething("Other");
優點:集中管理依賴。缺點:依賴名稱與參數順序必須一致,維護成本高。
利用 Function.prototype.toString() 取得原始碼,用正則擷取參數名:
const FN_ARGS = /^function\s*[^\(]*\(\s*([^\)]*)\)/m;
injector.resolve = function (func, scope) {
const deps = func.toString().match(FN_ARGS)[1]
.replace(/\s/g, "").split(",").filter(Boolean);
const args = deps.map(d => this.dependencies[d]);
return function (...extraArgs) {
func.apply(scope || {}, [...args, ...extraArgs]);
};
};
// 使用:參數順序可任意調換
const doSomething = injector.resolve(function (router, other, service) {
console.log(service().name, router().name, other);
});
doSomething("Other");
優點:語法極度簡潔,參數順序自由。致命缺點:壓縮混淆會將參數改名(如 service → a),導致注入失效。
injector.resolve = function (...args) {
let func, deps, scope;
if (typeof args[0] === "string") {
// ['service', 'router', fn] 寫法
deps = args[0].replace(/\s/g, "").split(",");
func = args[1];
scope = args[2];
} else {
// 反射寫法
func = args[0];
deps = func.toString().match(FN_ARGS)[1]
.replace(/\s/g, "").split(",").filter(Boolean);
scope = args[1];
}
const resolved = deps.map(d => this.dependencies[d]);
return function (...extra) {
func.apply(scope || {}, [...resolved, ...extra]);
};
};
// 壓縮安全寫法
const doSomething = injector.resolve(
"service,router",
function (service, router, other) { /* ... */ }
);
const injector = {
dependencies: {},
register(key, value) { this.dependencies[key] = value; },
resolve(...args) {
const self = this;
let func, deps, scope;
if (typeof args[0] === "string") {
deps = args[0].replace(/\s/g, "").split(",").filter(Boolean);
func = args[1];
scope = args[2];
} else {
func = args[0];
deps = func.toString().match(FN_ARGS)[1]
.replace(/\s/g, "").split(",").filter(Boolean);
scope = args[1];
}
const resolved = deps.map(d => {
if (!self.dependencies[d]) throw new Error(`無法解析依賴:${d}`);
return self.dependencies[d];
});
return function (...extra) {
func.apply(scope || {}, [...resolved, ...extra]);
};
}
};
import/export,打包工具自動樹搖動。依賴注入核心在於「依賴向上抽離、由容器統一管理」。從手動傳參 → 陣列宣告 → 反射自動解析 → 混合模式,每階段都在解決前一階段的痛點。理解演進歷程,有助於在現代框架中做出正確架構決策。