Zig 0.17.0-dev (Split by item)

?

× Shortcut keys

?: Show these tips

S: Focus search field

Esc: Clear focus & close tips

U: Jump to source code

↑: Move up in search results

↓: Move down in search results

↵: Go to active search result

This is an example of documentation generated by ZigDoc, an alternative to Zig's built-in Auto Doc feature. See also examples in other modes/formats. The project being documented here (as the example) is the Zig standard library. Public Function

resolvePosix

Doc Source

Public Function

std.fs.path.resolvePosix

pub fn resolvePosix(gpa: Allocator, paths: []const []const u8) Allocator.Error![]u8

Simulates a series of relative directory changes on a virtual filesystem that has no symlinks.

"." and ".." are resolved but will not make relative paths absolute. ".." components remain in the resolved path when the resolved path is relative and there are not previous components to cancel out.

The result does not have a trailing path separator.

This function does not perform any syscalls. Executing this series of path lookups on an actual filesystem may produce different results due to symlinks.

Params

gpa: Allocator
paths: []const []const u8

File

fs/path.zig:1108

pub fn resolvePosix(gpa: Allocator, paths: []const []const u8) Allocator.Error![]u8 {
    assert(paths.len > 0);

    var result: std.ArrayList(u8) = .empty;
    defer result.deinit(gpa);

    var negative_count: usize = 0;
    var is_abs = false;

    for (paths) |p| {
        if (isAbsolutePosix(p)) {
            is_abs = true;
            negative_count = 0;
            result.clearRetainingCapacity();
        }
        var it = mem.tokenizeScalar(u8, p, '/');
        while (it.next()) |component| {
            if (mem.eql(u8, component, ".")) {
                continue;
            } else if (mem.eql(u8, component, "..")) {
                if (result.items.len == 0) {
                    negative_count += @intFromBool(!is_abs);
                    continue;
                }
                while (true) {
                    const ends_with_slash = result.items[result.items.len - 1] == '/';
                    result.items.len -= 1;
                    if (ends_with_slash or result.items.len == 0) break;
                }
            } else if (result.items.len > 0 or is_abs) {
                try result.ensureUnusedCapacity(gpa, 1 + component.len);
                result.appendAssumeCapacity('/');
                result.appendSliceAssumeCapacity(component);
            } else {
                try result.appendSlice(gpa, component);
            }
        }
    }

    if (result.items.len == 0) {
        if (is_abs) {
            return gpa.dupe(u8, "/");
        }
        if (negative_count == 0) {
            return gpa.dupe(u8, ".");
        } else {
            const real_result = try gpa.alloc(u8, 3 * negative_count - 1);
            var count = negative_count - 1;
            var i: usize = 0;
            while (count > 0) : (count -= 1) {
                real_result[i..][0..3].* = "../".*;
                i += 3;
            }
            real_result[i..][0..2].* = "..".*;
            return real_result;
        }
    }

    if (negative_count == 0) {
        return result.toOwnedSlice(gpa);
    } else {
        const real_result = try gpa.alloc(u8, 3 * negative_count + result.items.len);
        var count = negative_count;
        var i: usize = 0;
        while (count > 0) : (count -= 1) {
            real_result[i..][0..3].* = "../".*;
            i += 3;
        }
        @memcpy(real_result[i..][0..result.items.len], result.items);
        return real_result;
    }
}