FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
matplotlib.github.com/3.7.1/_static/language_data.js at main · matplotlib/matplotlib.github.com · GitHub
matplotlib
/
matplotlib.github.com
Public
Notifications
You must be signed in to change notification settings
Fork
62
Star
29
Code
Issues
1
Pull requests
2
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
matplotlib.github.com
/
3.7.1
/
_static
/
language_data.js
Copy path
More file actions
More file actions
Latest commit
History
History
History
199 lines (177 loc) · 4.65 KB
Breadcrumbs
matplotlib.github.com
/
3.7.1
/
_static
/
language_data.js
Copy path
File metadata and controls
199 lines (177 loc) · 4.65 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
/*
* language_data.js
* ~~~~~~~~~~~~~~~~
*
* This script contains the language-specific data used by searchtools.js,
* namely the list of stopwords, stemmer, scorer and splitter.
*
* :copyright: Copyright 2007-2022 by the Sphinx team, see AUTHORS.
* :license: BSD, see LICENSE for details.
*
*/
var
stopwords
=
[
"a"
,
"and"
,
"are"
,
"as"
,
"at"
,
"be"
,
"but"
,
"by"
,
"for"
,
"if"
,
"in"
,
"into"
,
"is"
,
"it"
,
"near"
,
"no"
,
"not"
,
"of"
,
"on"
,
"or"
,
"such"
,
"that"
,
"the"
,
"their"
,
"then"
,
"there"
,
"these"
,
"they"
,
"this"
,
"to"
,
"was"
,
"will"
,
"with"
]
;
/* Non-minified version is copied as a separate JS file, is available */
/**
* Porter Stemmer
*/
var
Stemmer
=
function
(
)
{
var
step2list
=
{
ational
:
'ate'
,
tional
:
'tion'
,
enci
:
'ence'
,
anci
:
'ance'
,
izer
:
'ize'
,
bli
:
'ble'
,
alli
:
'al'
,
entli
:
'ent'
,
eli
:
'e'
,
ousli
:
'ous'
,
ization
:
'ize'
,
ation
:
'ate'
,
ator
:
'ate'
,
alism
:
'al'
,
iveness
:
'ive'
,
fulness
:
'ful'
,
ousness
:
'ous'
,
aliti
:
'al'
,
iviti
:
'ive'
,
biliti
:
'ble'
,
logi
:
'log'
}
;
var
step3list
=
{
icate
:
'ic'
,
ative
:
''
,
alize
:
'al'
,
iciti
:
'ic'
,
ical
:
'ic'
,
ful
:
''
,
ness
:
''
}
;
var
c
=
"[^aeiou]"
;
// consonant
var
v
=
"[aeiouy]"
;
// vowel
var
C
=
c
+
"[^aeiouy]*"
;
// consonant sequence
var
V
=
v
+
"[aeiou]*"
;
// vowel sequence
var
mgr0
=
"^("
+
C
+
")?"
+
V
+
C
;
// [C]VC... is m>0
var
meq1
=
"^("
+
C
+
")?"
+
V
+
C
+
"("
+
V
+
")?$"
;
// [C]VC[V] is m=1
var
mgr1
=
"^("
+
C
+
")?"
+
V
+
C
+
V
+
C
;
// [C]VCVC... is m>1
var
s_v
=
"^("
+
C
+
")?"
+
v
;
// vowel in stem
this
.
stemWord
=
function
(
w
)
{
var
stem
;
var
suffix
;
var
firstch
;
var
origword
=
w
;
if
(
w
.
length
<
3
)
return
w
;
var
re
;
var
re2
;
var
re3
;
var
re4
;
firstch
=
w
.
substr
(
0
,
1
)
;
if
(
firstch
==
"y"
)
w
=
firstch
.
toUpperCase
(
)
+
w
.
substr
(
1
)
;
// Step 1a
re
=
/
^
(
.
+
?
)
(
s
s
|
i
)
e
s
$
/
;
re2
=
/
^
(
.
+
?
)
(
[
^
s
]
)
s
$
/
;
if
(
re
.
test
(
w
)
)
w
=
w
.
replace
(
re
,
"$1$2"
)
;
else
if
(
re2
.
test
(
w
)
)
w
=
w
.
replace
(
re2
,
"$1$2"
)
;
// Step 1b
re
=
/
^
(
.
+
?
)
e
e
d
$
/
;
re2
=
/
^
(
.
+
?
)
(
e
d
|
i
n
g
)
$
/
;
if
(
re
.
test
(
w
)
)
{
var
fp
=
re
.
exec
(
w
)
;
re
=
new
RegExp
(
mgr0
)
;
if
(
re
.
test
(
fp
[
1
]
)
)
{
re
=
/
.
$
/
;
w
=
w
.
replace
(
re
,
""
)
;
}
}
else
if
(
re2
.
test
(
w
)
)
{
var
fp
=
re2
.
exec
(
w
)
;
stem
=
fp
[
1
]
;
re2
=
new
RegExp
(
s_v
)
;
if
(
re2
.
test
(
stem
)
)
{
w
=
stem
;
re2
=
/
(
a
t
|
b
l
|
i
z
)
$
/
;
re3
=
new
RegExp
(
"([^aeiouylsz])\\1$"
)
;
re4
=
new
RegExp
(
"^"
+
C
+
v
+
"[^aeiouwxy]$"
)
;
if
(
re2
.
test
(
w
)
)
w
=
w
+
"e"
;
else
if
(
re3
.
test
(
w
)
)
{
re
=
/
.
$
/
;
w
=
w
.
replace
(
re
,
""
)
;
}
else
if
(
re4
.
test
(
w
)
)
w
=
w
+
"e"
;
}
}
// Step 1c
re
=
/
^
(
.
+
?
)
y
$
/
;
if
(
re
.
test
(
w
)
)
{
var
fp
=
re
.
exec
(
w
)
;
stem
=
fp
[
1
]
;
re
=
new
RegExp
(
s_v
)
;
if
(
re
.
test
(
stem
)
)
w
=
stem
+
"i"
;
}
// Step 2
re
=
/
^
(
.
+
?
)
(
a
t
i
o
n
a
l
|
t
i
o
n
a
l
|
e
n
c
i
|
a
n
c
i
|
i
z
e
r
|
b
l
i
|
a
l
l
i
|
e
n
t
l
i
|
e
l
i
|
o
u
s
l
i
|
i
z
a
t
i
o
n
|
a
t
i
o
n
|
a
t
o
r
|
a
l
i
s
m
|
i
v
e
n
e
s
s
|
f
u
l
n
e
s
s
|
o
u
s
n
e
s
s
|
a
l
i
t
i
|
i
v
i
t
i
|
b
i
l
i
t
i
|
l
o
g
i
)
$
/
;
if
(
re
.
test
(
w
)
)
{
var
fp
=
re
.
exec
(
w
)
;
stem
=
fp
[
1
]
;
suffix
=
fp
[
2
]
;
re
=
new
RegExp
(
mgr0
)
;
if
(
re
.
test
(
stem
)
)
w
=
stem
+
step2list
[
suffix
]
;
}
// Step 3
re
=
/
^
(
.
+
?
)
(
i
c
a
t
e
|
a
t
i
v
e
|
a
l
i
z
e
|
i
c
i
t
i
|
i
c
a
l
|
f
u
l
|
n
e
s
s
)
$
/
;
if
(
re
.
test
(
w
)
)
{
var
fp
=
re
.
exec
(
w
)
;
stem
=
fp
[
1
]
;
suffix
=
fp
[
2
]
;
re
=
new
RegExp
(
mgr0
)
;
if
(
re
.
test
(
stem
)
)
w
=
stem
+
step3list
[
suffix
]
;
}
// Step 4
re
=
/
^
(
.
+
?
)
(
a
l
|
a
n
c
e
|
e
n
c
e
|
e
r
|
i
c
|
a
b
l
e
|
i
b
l
e
|
a
n
t
|
e
m
e
n
t
|
m
e
n
t
|
e
n
t
|
o
u
|
i
s
m
|
a
t
e
|
i
t
i
|
o
u
s
|
i
v
e
|
i
z
e
)
$
/
;
re2
=
/
^
(
.
+
?
)
(
s
|
t
)
(
i
o
n
)
$
/
;
if
(
re
.
test
(
w
)
)
{
var
fp
=
re
.
exec
(
w
)
;
stem
=
fp
[
1
]
;
re
=
new
RegExp
(
mgr1
)
;
if
(
re
.
test
(
stem
)
)
w
=
stem
;
}
else
if
(
re2
.
test
(
w
)
)
{
var
fp
=
re2
.
exec
(
w
)
;
stem
=
fp
[
1
]
+
fp
[
2
]
;
re2
=
new
RegExp
(
mgr1
)
;
if
(
re2
.
test
(
stem
)
)
w
=
stem
;
}
// Step 5
re
=
/
^
(
.
+
?
)
e
$
/
;
if
(
re
.
test
(
w
)
)
{
var
fp
=
re
.
exec
(
w
)
;
stem
=
fp
[
1
]
;
re
=
new
RegExp
(
mgr1
)
;
re2
=
new
RegExp
(
meq1
)
;
re3
=
new
RegExp
(
"^"
+
C
+
v
+
"[^aeiouwxy]$"
)
;
if
(
re
.
test
(
stem
)
||
(
re2
.
test
(
stem
)
&&
!
(
re3
.
test
(
stem
)
)
)
)
w
=
stem
;
}
re
=
/
l
l
$
/
;
re2
=
new
RegExp
(
mgr1
)
;
if
(
re
.
test
(
w
)
&&
re2
.
test
(
w
)
)
{
re
=
/
.
$
/
;
w
=
w
.
replace
(
re
,
""
)
;
}
// and turn initial Y back to y
if
(
firstch
==
"y"
)
w
=
firstch
.
toLowerCase
(
)
+
w
.
substr
(
1
)
;
return
w
;
}
}
Back
|
FazBrowse Home
|
New Git URL