From 173527d6319752d1bc56db41ed33ab7904c9e13b Mon Sep 17 00:00:00 2001
From: gingerBill <bill@gingerbill.org>
Date: Wed, 13 Dec 2023 01:53:15 +0000
Subject: [PATCH] Remove random tag

---
 core/slice/slice.odin | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/core/slice/slice.odin b/core/slice/slice.odin
index d85756859..2a9e29d01 100644
--- a/core/slice/slice.odin
+++ b/core/slice/slice.odin
@@ -489,7 +489,7 @@ repeat :: proc(s: $S/[]$U, count: int, allocator := context.allocator) -> (b: S,
 // 'unique' replaces consecutive runs of equal elements with a single copy.
 // The procedures modifies the slice in-place and returns the modified slice.
 @(require_results)
-unique :: proc(s: $S/[]$T) -> S #optional_allocator_error where intrinsics.type_is_comparable(T) #no_bounds_check {
+unique :: proc(s: $S/[]$T) -> S where intrinsics.type_is_comparable(T) #no_bounds_check {
 	if len(s) < 2 {
 		return s
 	}
@@ -507,7 +507,7 @@ unique :: proc(s: $S/[]$T) -> S #optional_allocator_error where intrinsics.type_
 // 'unique_proc' replaces consecutive runs of equal elements with a single copy using a comparison procedure
 // The procedures modifies the slice in-place and returns the modified slice.
 @(require_results)
-unique_proc :: proc(s: $S/[]$T, eq: proc(T, T) -> bool) -> S #optional_allocator_error #no_bounds_check {
+unique_proc :: proc(s: $S/[]$T, eq: proc(T, T) -> bool) -> S #no_bounds_check {
 	if len(s) < 2 {
 		return s
 	}