This file is indexed.

/usr/share/gnu-smalltalk/kernel/LinkedList.st is in gnu-smalltalk-common 3.2.4-2.1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
"======================================================================
|
|   LinkedList Method Definitions
|
|
 ======================================================================"

"======================================================================
|
| Copyright 1988,92,94,95,99,2000,2001,2002
| Free Software Foundation, Inc.
| Written by Steve Byrne.
|
| This file is part of the GNU Smalltalk class library.
|
| The GNU Smalltalk class library is free software; you can redistribute it
| and/or modify it under the terms of the GNU Lesser General Public License
| as published by the Free Software Foundation; either version 2.1, or (at
| your option) any later version.
| 
| The GNU Smalltalk class library is distributed in the hope that it will be
| useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
| MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser
| General Public License for more details.
| 
| You should have received a copy of the GNU Lesser General Public License
| along with the GNU Smalltalk class library; see the file COPYING.LIB.
| If not, write to the Free Software Foundation, 59 Temple Place - Suite
| 330, Boston, MA 02110-1301, USA.  
|
 ======================================================================"



SequenceableCollection subclass: LinkedList [
    | firstLink lastLink |
    
    <category: 'Collections-Sequenceable'>
    <comment: 'I provide methods that access and manipulate linked lists.  I assume that 
the elements of the linked list are subclasses of Link, because I use 
the methods that class Link supplies to implement my methods.'>

    at: index [
	"Return the element that is index into the linked list."

	<category: 'accessing'>
	^firstLink at: index
    ]

    at: index put: object [
	<category: 'accessing'>
	self shouldNotImplement
    ]

    add: aLink [
	"Add aLink at the end of the list; return aLink."

	<category: 'adding'>
	self addLast: aLink.
	^aLink
    ]

    addFirst: aLink [
	"Add aLink at the head of the list; return aLink."

	<category: 'adding'>
	lastLink isNil ifTrue: [lastLink := aLink].
	aLink nextLink: firstLink.
	^firstLink := aLink
    ]

    addLast: aLink [
	"Add aLink at then end of the list; return aLink."

	<category: 'adding'>
	firstLink isNil ifTrue: [firstLink := aLink].
	lastLink notNil ifTrue: [lastLink nextLink: aLink].
	^lastLink := aLink
    ]

    removeFirst [
	"Remove the first element from the list and return it, or error if the
	 list is empty."

	<category: 'adding'>
	^self remove: firstLink
	    ifAbsent: [SystemExceptions.EmptyCollection signalOn: self]
    ]

    removeLast [
	"Remove the final element from the list and return it, or error if the
	 list is empty."

	<category: 'adding'>
	^self remove: lastLink
	    ifAbsent: [SystemExceptions.EmptyCollection signalOn: self]
    ]

    remove: aLink ifAbsent: aBlock [
	"Remove aLink from the list and return it, or invoke aBlock if it's not
	 found in the list."

	<category: 'adding'>
	| prev |
	aLink == firstLink 
	    ifTrue: 
		[firstLink isNil ifTrue: [^aBlock value].
		firstLink := firstLink nextLink.
		firstLink isNil ifTrue: [lastLink := nil].
		aLink nextLink: nil.
		^aLink].
	prev := firstLink.
	
	[prev isNil ifTrue: [^aBlock value].
	prev nextLink == aLink] 
		whileFalse: [prev := prev nextLink].
	prev nextLink: aLink nextLink.
	aLink == lastLink ifTrue: [lastLink := prev].
	aLink nextLink: nil.
	^aLink
    ]

    do: aBlock [
	"Enumerate each object in the list, passing it to aBlock (actual
	 behavior might depend on the subclass of Link that is being used)."

	<category: 'enumerating'>
	self isEmpty ifFalse: [firstLink do: aBlock]
    ]

    includes: anObject [
	"Answer whether we include anObject"

	"Blah, this is roughly the same implementation as in Collection."

	<category: 'enumerating'>
	self isEmpty ifTrue: [^false].
	firstLink do: [:element | anObject = element ifTrue: [^true]].
	^false
    ]

    identityIncludes: anObject [
	"Answer whether we include the anObject object"

	"Blah, this is roughly the same implementation as in Collection."

	<category: 'enumerating'>
	self isEmpty ifTrue: [^false].
	firstLink do: [:element | anObject == element ifTrue: [^true]].
	^false
    ]

    isEmpty [
	"Returns true if the list contains no members"

	<category: 'testing'>
	^firstLink isNil
    ]

    notEmpty [
	"Returns true if the list contains at least a member"

	<category: 'testing'>
	^firstLink notNil
    ]

    size [
	"Answer the number of elements in the list. Warning: this is O(n)"

	<category: 'testing'>
	^self isEmpty ifTrue: [0] ifFalse: [firstLink size]
    ]
]