Diff
checker
文本
文本
图像
文档
Excel
文件夹
Legal
Enterprise
桌面版
定价
登录
下载 Diffchecker 桌面版
比较文本
查找两个文本文件之间的差异
工具
历史
实时编辑器
隐藏空白更改
折叠未更改行
关闭换行
视图
拆分
统一
比对精度
智能
单词
字符
文本样式
更改外观
语法高亮
选择语法
忽略
文本转换
转到第一个差异
编辑输入
Diffchecker Desktop
运行Diffchecker最安全的方式。获取Diffchecker桌面应用:您的差异永远不会离开您的电脑!
获取桌面版
Untitled diff
创建于
去年
差异永不过期
清除
导出
分享
解释
19 删除
行
总计
删除
字符
总计
删除
要继续使用此功能,请升级到
Diff
checker
Pro
查看价格
54 行
全部复制
31 添加
行
总计
添加
字符
总计
添加
要继续使用此功能,请升级到
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 {
pub fn hash(_: @This(), key: u64) u64 {
return key;
}
pub fn eql(_: @This(), a: u64, b: u64) bool {
return a == b;
}
}, 80);
return struct {
return struct {
复制
已复制
复制
已复制
_inner:
std.
HashMap
(u64, return_type, struct {
_inner:
Inner
HashMap
,
fn hash(_: @This(), key: u64) u64 {
return key;
}
fn eql(_: @This(), a: u64, b: u64) bool {
return a == b;
}
}, 80),
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| {
return 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
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(); }
查找差异