	.section	__TEXT,__text,regular,pure_instructions
	.build_version macos, 13, 0	sdk_version 13, 3
	.p2align	4, 0x90                         ## -- Begin function List_Description
_List_Description:                      ## @List_Description
	.cfi_startproc
## %bb.0:
	pushq	%rbp
	.cfi_def_cfa_offset 16
	.cfi_offset %rbp, -16
	movq	%rsp, %rbp
	.cfi_def_cfa_register %rbp
	leaq	L_.str(%rip), %rax
	popq	%rbp
	retq
	.cfi_endproc
                                        ## -- End function
	.section	__TEXT,__cstring,cstring_literals
L_.str:                                 ## @.str
	.asciz	"The `List` type is a linked list data structure. Elements can be added and removed from the list and their memory is allocated and deallocated by the structure. Additionally destructors will be called on objects once removed.\n\nElements are copied into the List using `assign` and will initially have zero'd memory.\n\nLists can provide fast insertion and removal at arbitrary locations although most other operations will be slow due to having to traverse the linked list data structure.\n\nThis is largely equivalent to the C++ construct [std::list](http://www.cplusplus.com/reference/list/list/)"

	.no_dead_strip	_List_Description
.subsections_via_symbols

	.section	__TEXT,__text,regular,pure_instructions
	.build_version macos, 13, 0	sdk_version 13, 3
	.p2align	2                               ; -- Begin function List_Description
_List_Description:                      ; @List_Description
	.cfi_startproc
; %bb.0:
Lloh0:
	adrp	x0, l_.str@PAGE
Lloh1:
	add	x0, x0, l_.str@PAGEOFF
	ret
	.loh AdrpAdd	Lloh0, Lloh1
	.cfi_endproc
                                        ; -- End function
	.section	__TEXT,__cstring,cstring_literals
l_.str:                                 ; @.str
	.asciz	"The `List` type is a linked list data structure. Elements can be added and removed from the list and their memory is allocated and deallocated by the structure. Additionally destructors will be called on objects once removed.\n\nElements are copied into the List using `assign` and will initially have zero'd memory.\n\nLists can provide fast insertion and removal at arbitrary locations although most other operations will be slow due to having to traverse the linked list data structure.\n\nThis is largely equivalent to the C++ construct [std::list](http://www.cplusplus.com/reference/list/list/)"

	.no_dead_strip	_List_Description
.subsections_via_symbols
