Diff
checker
文本
文本
圖像
文檔
Excel
文件夾
Legal
Enterprise
桌面版
定價
登入
下載 Diffchecker 桌面版
比較文本
尋找兩個文字檔案之間的差異
工具
歷史
顯示
檢視
拆分
統一
即時編輯器
隱藏空白變更
摺疊未變更行
關閉換行
比對精度
智能
語法
無
變更外觀
處理
忽略
文字轉換
前往第一個差異
編輯輸入
Diffchecker Desktop
執行Diffchecker最安全的方式。取得Diffchecker桌面應用程式:您的差異永遠不會離開您的電腦!
取得桌面版
Untitled diff
建立於
2 年前
差異永不過期
清除
匯出
分享
解釋
18 刪除
行
總計
刪除
字符
總計
刪除
要繼續使用此功能,請升級到
Diff
checker
Pro
查看價格
54 行
全部複製
26 新增
行
總計
新增
字符
總計
新增
要繼續使用此功能,請升級到
Diff
checker
Pro
查看價格
63 行
全部複製
const std = @import("std");
const std = @import("std");
// Cache requires a function (lambda) to be called when there's no cache hit and an other function(args_to_u64) that can compute args
// Cache requires a function (lambda) to be called when there's no cache hit and an other function(args_to_u64) that can compute args
// of the function to u64 that becomes the identifier to compare same arguments.
// of the function to u64 that becomes the identifier to compare same arguments.
pub fn Cache(lambda: anytype, args_to_u64: fn (anytype) u64) type {
pub fn Cache(lambda: anytype, args_to_u64: fn (anytype) u64) type {
const lambda_info = @typeInfo(@TypeOf(lambda));
const lambda_info = @typeInfo(@TypeOf(lambda));
複製
已複製
複製
已複製
@compileLog(lambda_info);
if (lambda_info != .
@"fn"
) {
if (lambda_info != .
Fn
) {
@compileError("lambda should be a function type");
@compileError("lambda should be a function type");
}
}
複製
已複製
複製
已複製
const return_type = lambda_info.
Fn
.return_type orelse @compileError("No return type");
const return_type = lambda_info.
@"fn"
.return_type orelse @compileError("No return type");
@compileLog(return_type);
const InnerHashMap =
std.HashMap(u64, return_type, struct {
return struct {
pub
fn hash(_: @This(), key: u64) u64 {
_inner:
std.HashMap(u64, return_type, struct {
fn hash(_: @This(), key: u64) u64 {
return key;
return key;
}
}
fn eql(_: @This(), a: u64, b: u64) bool {
pub
fn eql(_: @This(), a: u64, b: u64) bool {
return a == b;
return a == b;
}
}
}, 80)
,
}, 80)
;
return struct {
_inner: InnerHashMap
,
const Self = @This();
const Self = @This();
fn init(allocator: std.mem.Allocator) Cache(lambda, args_to_u64) {
fn init(allocator: std.mem.Allocator) Cache(lambda, args_to_u64) {
複製
已複製
複製
已複製
return Self{ ._inner =
std.StringHashMap(return_type)
.init(allocator) };
return Self{ ._inner =
InnerHashMap
.init(allocator) };
}
}
複製
已複製
複製
已複製
fn get(self: *Self, args: anytype)
return_type {
fn get(self: *Self, args: anytype)
!
return_type {
const key = args_to_u64(args);
const key = args_to_u64(args);
複製
已複製
複製
已複製
const value =
self._inner.get(key) orelse
@call(.
{}
, lambda, args);
if (self._inner.get(key)) |value| {
std.debug.print("Rertrieving from cache for the key: {d}\n", .{key});
return value;
} else {
std.debug.print("Computing function and storing in cache for the key: {d}\n", .{key});
const value =
@call(.
auto
, lambda, args);
try self._inner.put(key, value);
return value;
return value;
複製
已複製
複製
已複製
}
}
}
};
};
}
}
複製
已複製
複製
已複製
// Below tests
addition of two numbers
and cache
// Below tests
to cache
addition of two numbers
fn _add(a: u64, b: u64) u64 {
fn _add(a: u64, b: u64) u64 {
return a + b;
return a + b;
}
}
const HashAdd = struct {
const HashAdd = struct {
var allocator: std.mem.Allocator = undefined;
var allocator: std.mem.Allocator = undefined;
pub fn hash_add(args: anytype) u64 {
pub fn hash_add(args: anytype) u64 {
const temp = std.fmt.allocPrint(allocator, "{}:{}", .{ args[0], args[1] }) catch unreachable;
const temp = std.fmt.allocPrint(allocator, "{}:{}", .{ args[0], args[1] }) catch unreachable;
defer allocator.free(temp);
defer allocator.free(temp);
return std.hash_map.hashString(temp);
return std.hash_map.hashString(temp);
}
}
};
};
test "test_cache" {
test "test_cache" {
const allocator = std.testing.allocator;
const allocator = std.testing.allocator;
HashAdd.allocator = allocator;
HashAdd.allocator = allocator;
var cache = Cache(_add, HashAdd.hash_add).init(allocator);
var cache = Cache(_add, HashAdd.hash_add).init(allocator);
複製
已複製
複製
已複製
const value: u64 =
cache.get(.{ 1, 2 });
const value: u64 =
try
cache.get(.{ 1, 2 });
try std.testing.expectEqual(3, value);
try std.testing.expectEqual(3, value);
複製
已複製
複製
已複製
const cache_value: u64 = try cache.get(.{ 1, 2 });
try std.testing.expectEqual(3, cache_value);
cache._inner.deinit();
cache._inner.deinit();
}
}
複製
已複製
複製
已複製
已保存差異
原始文本
開啟檔案
const std = @import("std"); // Cache requires a function (lambda) to be called when there's no cache hit and an other function(args_to_u64) that can compute args // of the function to u64 that becomes the identifier to compare same arguments. pub fn Cache(lambda: anytype, args_to_u64: fn (anytype) u64) type { const lambda_info = @typeInfo(@TypeOf(lambda)); @compileLog(lambda_info); if (lambda_info != .Fn) { @compileError("lambda should be a function type"); } const return_type = lambda_info.Fn.return_type orelse @compileError("No return type"); @compileLog(return_type); return struct { _inner: std.HashMap(u64, return_type, struct { fn hash(_: @This(), key: u64) u64 { return key; } fn eql(_: @This(), a: u64, b: u64) bool { return a == b; } }, 80), const Self = @This(); fn init(allocator: std.mem.Allocator) Cache(lambda, args_to_u64) { return Self{ ._inner = std.StringHashMap(return_type).init(allocator) }; } fn get(self: *Self, args: anytype) return_type { const key = args_to_u64(args); const value = self._inner.get(key) orelse @call(.{}, lambda, args); return value; } }; } // Below tests addition of two numbers and cache fn _add(a: u64, b: u64) u64 { return a + b; } const HashAdd = struct { var allocator: std.mem.Allocator = undefined; pub fn hash_add(args: anytype) u64 { const temp = std.fmt.allocPrint(allocator, "{}:{}", .{ args[0], args[1] }) catch unreachable; defer allocator.free(temp); return std.hash_map.hashString(temp); } }; test "test_cache" { const allocator = std.testing.allocator; HashAdd.allocator = allocator; var cache = Cache(_add, HashAdd.hash_add).init(allocator); const value: u64 = cache.get(.{ 1, 2 }); try std.testing.expectEqual(3, value); cache._inner.deinit(); }
更改後文本
開啟檔案
const std = @import("std"); // Cache requires a function (lambda) to be called when there's no cache hit and an other function(args_to_u64) that can compute args // of the function to u64 that becomes the identifier to compare same arguments. pub fn Cache(lambda: anytype, args_to_u64: fn (anytype) u64) type { const lambda_info = @typeInfo(@TypeOf(lambda)); if (lambda_info != .@"fn") { @compileError("lambda should be a function type"); } const return_type = lambda_info.@"fn".return_type orelse @compileError("No return type"); const InnerHashMap = std.HashMap(u64, return_type, struct { pub fn hash(_: @This(), key: u64) u64 { return key; } pub fn eql(_: @This(), a: u64, b: u64) bool { return a == b; } }, 80); return struct { _inner: InnerHashMap, const Self = @This(); fn init(allocator: std.mem.Allocator) Cache(lambda, args_to_u64) { return Self{ ._inner = InnerHashMap.init(allocator) }; } fn get(self: *Self, args: anytype) !return_type { const key = args_to_u64(args); if (self._inner.get(key)) |value| { std.debug.print("Rertrieving from cache for the key: {d}\n", .{key}); return value; } else { std.debug.print("Computing function and storing in cache for the key: {d}\n", .{key}); const value = @call(.auto, lambda, args); try self._inner.put(key, value); return value; } } }; } // Below tests to cache addition of two numbers fn _add(a: u64, b: u64) u64 { return a + b; } const HashAdd = struct { var allocator: std.mem.Allocator = undefined; pub fn hash_add(args: anytype) u64 { const temp = std.fmt.allocPrint(allocator, "{}:{}", .{ args[0], args[1] }) catch unreachable; defer allocator.free(temp); return std.hash_map.hashString(temp); } }; test "test_cache" { const allocator = std.testing.allocator; HashAdd.allocator = allocator; var cache = Cache(_add, HashAdd.hash_add).init(allocator); const value: u64 = try cache.get(.{ 1, 2 }); try std.testing.expectEqual(3, value); const cache_value: u64 = try cache.get(.{ 1, 2 }); try std.testing.expectEqual(3, cache_value); cache._inner.deinit(); }
尋找差異