-
-
Notifications
You must be signed in to change notification settings - Fork 84
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #68 from StringNick/simple-router
simple router with handler clojures support
- Loading branch information
Showing
6 changed files
with
191 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,108 @@ | ||
const std = @import("std"); | ||
const zap = @import("zap"); | ||
const Allocator = std.mem.Allocator; | ||
|
||
fn on_request_verbose(r: zap.Request) void { | ||
if (r.path) |the_path| { | ||
std.debug.print("PATH: {s}\n", .{the_path}); | ||
} | ||
|
||
if (r.query) |the_query| { | ||
std.debug.print("QUERY: {s}\n", .{the_query}); | ||
} | ||
r.sendBody("<html><body><h1>Hello from ZAP!!!</h1></body></html>") catch return; | ||
} | ||
|
||
pub const SomePackage = struct { | ||
const Self = @This(); | ||
|
||
allocator: Allocator, | ||
a: i8, | ||
b: i8, | ||
|
||
pub fn init(allocator: Allocator, a: i8, b: i8) Self { | ||
return .{ | ||
.allocator = allocator, | ||
.a = a, | ||
.b = b, | ||
}; | ||
} | ||
|
||
pub fn getA(self: *Self, req: zap.Request) void { | ||
std.log.warn("get_a_requested", .{}); | ||
|
||
const string = std.fmt.allocPrint( | ||
self.allocator, | ||
"A value is {d}\n", | ||
.{self.a}, | ||
) catch return; | ||
defer self.allocator.free(string); | ||
|
||
req.sendBody(string) catch return; | ||
} | ||
|
||
pub fn getB(self: *Self, req: zap.Request) void { | ||
std.log.warn("get_b_requested", .{}); | ||
|
||
const string = std.fmt.allocPrint( | ||
self.allocator, | ||
"B value is {d}\n", | ||
.{self.b}, | ||
) catch return; | ||
defer self.allocator.free(string); | ||
|
||
req.sendBody(string) catch return; | ||
} | ||
|
||
pub fn incrementA(self: *Self, req: zap.Request) void { | ||
std.log.warn("increment_a_requested", .{}); | ||
|
||
self.a += 1; | ||
|
||
req.sendBody("incremented A") catch return; | ||
} | ||
}; | ||
|
||
fn not_found(req: zap.Request) void { | ||
std.debug.print("not found handler", .{}); | ||
|
||
req.sendBody("Not found") catch return; | ||
} | ||
|
||
pub fn main() !void { | ||
var gpa = std.heap.GeneralPurposeAllocator(.{ | ||
.thread_safe = true, | ||
}){}; | ||
var allocator = gpa.allocator(); | ||
|
||
var simpleRouter = zap.Router.init(allocator, .{ | ||
.not_found = not_found, | ||
}); | ||
defer simpleRouter.deinit(); | ||
|
||
var somePackage = SomePackage.init(allocator, 1, 2); | ||
|
||
try simpleRouter.handle_func("/", on_request_verbose); | ||
|
||
try simpleRouter.handle_func("/geta", zap.RequestHandler(&somePackage, SomePackage.getA)); | ||
|
||
try simpleRouter.handle_func("/getb", zap.RequestHandler(&somePackage, SomePackage.getB)); | ||
|
||
try simpleRouter.handle_func("/inca", zap.RequestHandler(&somePackage, SomePackage.incrementA)); | ||
|
||
var listener = zap.HttpListener.init(.{ | ||
.port = 3000, | ||
.on_request = zap.RequestHandler(&simpleRouter, &zap.Router.serve), | ||
.log = true, | ||
.max_clients = 100000, | ||
}); | ||
try listener.listen(); | ||
|
||
std.debug.print("Listening on 0.0.0.0:3000\n", .{}); | ||
|
||
// start worker threads | ||
zap.start(.{ | ||
.threads = 2, | ||
.workers = 2, | ||
}); | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,60 @@ | ||
const std = @import("std"); | ||
const zap = @import("zap.zig"); | ||
|
||
const Allocator = std.mem.Allocator; | ||
const RouterError = error{ | ||
AlreadyExists, | ||
EmptyPath, | ||
}; | ||
|
||
const Self = @This(); | ||
|
||
pub const Options = struct { | ||
not_found: ?zap.HttpRequestFn = null, | ||
}; | ||
|
||
routes: std.StringHashMap(zap.HttpRequestFn), | ||
not_found: ?zap.HttpRequestFn, | ||
|
||
pub fn init(allocator: Allocator, options: Options) Self { | ||
return .{ | ||
.routes = std.StringHashMap(zap.HttpRequestFn).init(allocator), | ||
|
||
.not_found = options.not_found, | ||
}; | ||
} | ||
|
||
pub fn deinit(self: *Self) void { | ||
self.routes.deinit(); | ||
} | ||
|
||
pub fn handle_func(self: *Self, path: []const u8, h: zap.HttpRequestFn) !void { | ||
if (path.len == 0) { | ||
return RouterError.EmptyPath; | ||
} | ||
|
||
const route = self.routes.get(path); | ||
|
||
if (route != null) { | ||
return RouterError.AlreadyExists; | ||
} | ||
|
||
try self.routes.put(path, h); | ||
} | ||
|
||
pub fn serve(self: *Self, r: zap.Request) void { | ||
const path = if (r.path) |p| p else "/"; | ||
|
||
var route = self.routes.get(path); | ||
|
||
if (route) |handler| { | ||
handler(r); | ||
} else if (self.not_found) |handler| { | ||
// not found handler | ||
handler(r); | ||
} else { | ||
// default 404 output | ||
r.setStatus(.not_found); | ||
r.sendBody("404 Not Found") catch return; | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters