language-servers/roc
1
0
Fork 0
mirror of https://github.com/roc-lang/roc.git synced 2025-09-30 23:31:12 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 6

call ListReplace and generate struct afterwards

Browse source
This commit is contained in:
Brendan Hansknecht 2022-02-24 22:33:12 -08:00
parent dc59ba97c2
commit aff962809b
2 changed files with 40 additions and 17 deletions
Download patch file Download diff file Expand all files Collapse all files

12
compiler/builtins/bitcode/src/list.zig
View file

@ -1257,12 +1257,12 @@ pub fn listConcat(list_a: RocList, list_b: RocList, alignment: u32, element_widt
}
pub fn listReplaceInPlace(
list: RocList
list: RocList,
index: usize,
element: Opaque,
element_width: usize,
out_element: ?[*]u8,
) callconv(.C) extern RocList {
) callconv(.C) RocList {
// INVARIANT: bounds checking happens on the roc side
//
// at the time of writing, the function is implemented roughly as
@ -1273,7 +1273,7 @@ pub fn listReplaceInPlace(
}
pub fn listReplace(
list: RocList
list: RocList,
alignment: u32,
index: usize,
element: Opaque,
@ -1286,16 +1286,16 @@ pub fn listReplace(
// `if inBounds then LowLevelListReplace input index item else input`
// so we don't do a bounds check here. Hence, the list is also non-empty,
// because inserting into an empty list is always out of bounds
listReplaceInPlaceHelp(list.makeUnique(alignment, element_width), index, element, element_width, out_element);
return listReplaceInPlaceHelp(list.makeUnique(alignment, element_width), index, element, element_width, out_element);
}
inline fn listReplaceInPlaceHelp(
list: RocList
list: RocList,
index: usize,
element: Opaque,
element_width: usize,
out_element: ?[*]u8,
) extern struct RocList {
) RocList {
// the element we will replace
var element_at_index = (list.bytes orelse undefined) + (index * element_width);