rest':82 [in ImpParser]
rest':84 [in ImpParser]
rest':86 [in ImpParser]
rest:100 [in ImpParser]
rest:102 [in ImpParser]
rest:104 [in ImpParser]
rest:108 [in ImpParser]
rest:115 [in ImpParser]
rest:130 [in ImpParser]
rest:132 [in ImpParser]
rest:139 [in ImpParser]
rest:145 [in ImpParser]
rest:150 [in ImpParser]
rest:65 [in ImpParser]
rest:67 [in ImpParser]
rest:69 [in ImpParser]
rest:74 [in ImpParser]
rest:79 [in ImpParser]
rest:98 [in ImpParser]
re':197 [in IndProp]
re':317 [in IndProp]
re0:293 [in IndProp]
re0:299 [in IndProp]
re0:304 [in IndProp]
re1:134 [in IndProp]
re1:140 [in IndProp]
re1:143 [in IndProp]
re1:166 [in IndProp]
re1:294 [in IndProp]
re1:300 [in IndProp]
re1:305 [in IndProp]
re2:136 [in IndProp]
re2:141 [in IndProp]
re2:145 [in IndProp]
re2:167 [in IndProp]
re:13 [in AltAuto]
re:147 [in IndProp]
re:150 [in IndProp]
re:16 [in AltAuto]
re:161 [in IndProp]
re:170 [in IndProp]
re:176 [in IndProp]
re:181 [in IndProp]
re:184 [in IndProp]
re:187 [in IndProp]
re:19 [in AltAuto]
re:192 [in IndProp]
re:196 [in IndProp]
re:2 [in AltAuto]
re:201 [in IndProp]
re:204 [in IndProp]
re:208 [in IndProp]
re:212 [in IndProp]
re:214 [in IndProp]
re:228 [in IndProp]
re:23 [in AltAuto]
re:230 [in IndProp]
re:237 [in IndProp]
re:26 [in AltAuto]
re:308 [in IndProp]
re:312 [in IndProp]
re:313 [in IndProp]
re:315 [in IndProp]
re:321 [in IndProp]
re:323 [in IndProp]
re:327 [in IndProp]
re:329 [in IndProp]
re:6 [in AltAuto]
re:66 [in AltAuto]
re:73 [in AltAuto]
r1:124 [in IndProp]
r1:126 [in IndProp]
r2:125 [in IndProp]
r2:127 [in IndProp]
R:10 [in Auto]
R:11 [in Rel]
r:12 [in Tactics]
r:128 [in IndProp]
R:13 [in Auto]
R:19 [in Auto]
R:21 [in Rel]
R:25 [in Rel]
R:25 [in Auto]
R:29 [in ProofObjects]
R:3 [in Rel]
R:31 [in Logic]
R:32 [in Rel]
R:34 [in Rel]
R:35 [in AltAuto]
R:36 [in Rel]
R:38 [in Rel]
R:38 [in AltAuto]
R:41 [in AltAuto]
R:43 [in ProofObjects]
R:46 [in ProofObjects]
R:47 [in AltAuto]
R:53 [in ProofObjects]
R:53 [in Rel]
R:53 [in AltAuto]
R:61 [in Logic]
R:62 [in Rel]
R:64 [in Logic]
R:66 [in Rel]
R:69 [in Logic]
R:7 [in Auto]
R:71 [in Rel]
R:8 [in Rel]
S
ss:169 [in IndProp]ss:205 [in IndProp]
stack:257 [in Imp]
stack:265 [in Imp]
stack:268 [in Imp]
steps:123 [in ImpParser]
steps:125 [in ImpParser]
steps:35 [in ImpParser]
steps:41 [in ImpParser]
steps:55 [in ImpParser]
steps:57 [in ImpParser]
steps:59 [in ImpParser]
steps:91 [in ImpParser]
steps:93 [in ImpParser]
str:154 [in ImpParser]
st'':108 [in Auto]
st'':218 [in Imp]
st'':234 [in Imp]
st'':304 [in Imp]
st'':83 [in Auto]
st'':99 [in Auto]
st':103 [in Auto]
st':107 [in Auto]
st':12 [in ImpCEvalFun]
st':13 [in ImpCEvalFun]
st':206 [in Imp]
st':217 [in Imp]
st':220 [in Imp]
st':225 [in Imp]
st':233 [in Imp]
st':243 [in Imp]
st':245 [in Imp]
st':26 [in ImpCEvalFun]
st':27 [in ImpCEvalFun]
st':289 [in Imp]
st':294 [in Imp]
st':299 [in Imp]
st':303 [in Imp]
st':32 [in ImpCEvalFun]
st':37 [in ImpCEvalFun]
st':41 [in ImpCEvalFun]
st':45 [in ImpCEvalFun]
st':5 [in ImpCEvalFun]
st':82 [in Auto]
st':85 [in Auto]
st':90 [in Auto]
st':98 [in Auto]
st1:113 [in Auto]
st1:117 [in Auto]
st1:239 [in Imp]
st1:3 [in Auto]
st1:307 [in Imp]
st1:39 [in Auto]
st1:43 [in Auto]
st1:47 [in Auto]
st1:49 [in ImpCEvalFun]
st1:51 [in Auto]
st1:57 [in Auto]
st2:114 [in Auto]
st2:118 [in Auto]
st2:240 [in Imp]
st2:308 [in Imp]
st2:4 [in Auto]
st2:40 [in Auto]
st2:44 [in Auto]
st2:48 [in Auto]
st2:50 [in ImpCEvalFun]
st2:52 [in Auto]
st2:58 [in Auto]
st:1 [in ImpCEvalFun]
st:102 [in Auto]
st:106 [in Auto]
st:112 [in Auto]
st:116 [in Auto]
st:14 [in ImpCEvalFun]
st:183 [in Imp]
st:187 [in Imp]
st:2 [in Auto]
st:20 [in ImpCEvalFun]
st:202 [in Imp]
st:209 [in Imp]
st:210 [in Imp]
st:216 [in Imp]
st:219 [in Imp]
st:224 [in Imp]
st:230 [in Imp]
st:232 [in Imp]
st:238 [in Imp]
st:241 [in Imp]
st:244 [in Imp]
st:256 [in Imp]
st:262 [in Imp]
st:266 [in Imp]
st:269 [in Imp]
st:28 [in ImpCEvalFun]
st:286 [in Imp]
st:288 [in Imp]
st:293 [in Imp]
st:298 [in Imp]
st:302 [in Imp]
st:306 [in Imp]
st:31 [in ImpCEvalFun]
st:36 [in ImpCEvalFun]
st:38 [in Auto]
st:40 [in ImpCEvalFun]
st:42 [in Auto]
st:44 [in ImpCEvalFun]
st:46 [in Auto]
st:48 [in ImpCEvalFun]
st:50 [in Auto]
st:56 [in Auto]
st:6 [in ImpCEvalFun]
st:74 [in Auto]
st:75 [in Auto]
st:81 [in Auto]
st:84 [in Auto]
st:89 [in Auto]
st:95 [in Auto]
st:97 [in Auto]
s':119 [in Auto]
s':206 [in IndProp]
s0:295 [in IndProp]
s0:301 [in IndProp]
s0:309 [in IndProp]
s1:133 [in IndProp]
s1:139 [in IndProp]
s1:148 [in IndProp]
s1:173 [in IndProp]
s1:190 [in IndProp]
s1:194 [in IndProp]
s1:199 [in IndProp]
s1:226 [in IndProp]
s1:232 [in IndProp]
s1:239 [in IndProp]
s1:296 [in IndProp]
s1:302 [in IndProp]
s1:309 [in Imp]
s1:310 [in IndProp]
s1:62 [in Lists]
s1:68 [in AltAuto]
s1:75 [in AltAuto]
s2:135 [in IndProp]
s2:144 [in IndProp]
s2:149 [in IndProp]
s2:174 [in IndProp]
s2:191 [in IndProp]
s2:195 [in IndProp]
s2:200 [in IndProp]
s2:227 [in IndProp]
s2:233 [in IndProp]
s2:240 [in IndProp]
s2:310 [in Imp]
s2:63 [in Lists]
s2:69 [in AltAuto]
s2:76 [in AltAuto]
s3:234 [in IndProp]
s3:241 [in IndProp]
s3:70 [in AltAuto]
s3:77 [in AltAuto]
s:12 [in ImpParser]
s:121 [in ImpParser]
S:14 [in Auto]
s:14 [in AltAuto]
s:154 [in IndProp]
s:160 [in IndProp]
s:163 [in IndProp]
s:165 [in IndProp]
s:17 [in AltAuto]
s:171 [in IndProp]
s:180 [in IndProp]
s:188 [in IndProp]
S:20 [in Auto]
s:203 [in IndProp]
s:231 [in IndProp]
s:238 [in IndProp]
s:24 [in AltAuto]
s:25 [in ImpParser]
s:27 [in AltAuto]
s:283 [in IndProp]
s:284 [in IndProp]
s:286 [in IndProp]
s:289 [in IndProp]
s:290 [in Imp]
s:291 [in IndProp]
s:292 [in IndProp]
s:295 [in Imp]
s:298 [in IndProp]
s:3 [in Maps]
s:30 [in ImpParser]
s:303 [in IndProp]
s:307 [in IndProp]
s:318 [in IndProp]
s:326 [in IndProp]
s:328 [in IndProp]
S:42 [in AltAuto]
S:48 [in AltAuto]
s:50 [in Lists]
s:53 [in Lists]
s:55 [in Lists]
s:57 [in Lists]
s:60 [in Lists]
s:67 [in AltAuto]
s:7 [in AltAuto]
s:74 [in AltAuto]
s:91 [in Lists]
s:93 [in Lists]
T
term:89 [in ImpParser]test:119 [in Poly]
test:130 [in Tactics]
test:130 [in Poly]
test:135 [in Tactics]
test:139 [in Tactics]
test:143 [in Tactics]
test:146 [in Tactics]
test:201 [in Logic]
test:206 [in Logic]
tk:21 [in ImpParser]
tokens:155 [in ImpParser]
t1:32 [in IndPrinciples]
t1:40 [in IndPrinciples]
t2:33 [in IndPrinciples]
t2:41 [in IndPrinciples]
T:1 [in AltAuto]
T:112 [in Logic]
T:116 [in Logic]
T:12 [in AltAuto]
T:120 [in IndProp]
t:122 [in ImpParser]
t:123 [in IndProp]
T:129 [in IndProp]
T:15 [in Auto]
T:15 [in AltAuto]
T:153 [in IndProp]
T:155 [in IndProp]
T:159 [in IndProp]
T:162 [in IndProp]
T:164 [in IndProp]
T:168 [in IndProp]
T:172 [in IndProp]
T:175 [in IndProp]
T:179 [in IndProp]
T:18 [in AltAuto]
T:183 [in IndProp]
T:186 [in IndProp]
T:189 [in IndProp]
T:193 [in IndProp]
T:198 [in IndProp]
T:202 [in IndProp]
T:207 [in IndProp]
T:21 [in Auto]
T:211 [in IndProp]
T:213 [in IndProp]
T:215 [in IndProp]
T:22 [in AltAuto]
T:220 [in IndProp]
T:224 [in IndProp]
T:229 [in IndProp]
T:236 [in IndProp]
T:25 [in AltAuto]
T:31 [in ImpParser]
T:32 [in ImpParser]
T:39 [in ImpParser]
T:42 [in ImpParser]
t:43 [in ImpParser]
T:43 [in AltAuto]
t:47 [in ImpParser]
T:49 [in AltAuto]
T:5 [in AltAuto]
T:65 [in AltAuto]
T:72 [in AltAuto]
t:9 [in IndPrinciples]
U
u:101 [in ImpParser]u:107 [in ImpParser]
u:131 [in ImpParser]
u:144 [in ImpParser]
U:16 [in Auto]
U:22 [in Auto]
U:44 [in AltAuto]
U:50 [in AltAuto]
u:72 [in ImpParser]
u:99 [in ImpParser]
V
value:134 [in Lists]vx:87 [in Maps]
v1:33 [in Maps]
v1:42 [in Maps]
v1:66 [in Maps]
v1:76 [in Maps]
v2:34 [in Maps]
v2:43 [in Maps]
v2:67 [in Maps]
v2:77 [in Maps]
v:12 [in Maps]
v:130 [in Lists]
v:141 [in Lists]
v:16 [in Maps]
v:20 [in Maps]
v:24 [in Maps]
v:29 [in Maps]
v:49 [in Lists]
v:51 [in Maps]
v:52 [in Lists]
v:54 [in Lists]
v:56 [in Lists]
v:57 [in Maps]
v:59 [in Lists]
v:62 [in Maps]
v:71 [in Maps]
v:82 [in Maps]
X
xo:154 [in Poly]xs:124 [in ImpParser]
xs:126 [in ImpParser]
xs:15 [in ImpParser]
xs:18 [in ImpParser]
xs:36 [in ImpParser]
xs:45 [in ImpParser]
xs:48 [in ImpParser]
xs:49 [in ImpParser]
xs:51 [in ImpParser]
xs:56 [in ImpParser]
xs:58 [in ImpParser]
xs:60 [in ImpParser]
xs:81 [in ImpParser]
xs:92 [in ImpParser]
xs:94 [in ImpParser]
x':17 [in Maps]
x1:122 [in Lists]
x1:27 [in Maps]
x1:44 [in Maps]
x1:60 [in Maps]
x1:74 [in Maps]
x2:123 [in Lists]
x2:28 [in Maps]
x2:45 [in Maps]
x2:61 [in Maps]
x2:75 [in Maps]
X:1 [in Rel]
x:1 [in Maps]
X:10 [in Rel]
X:10 [in Poly]
x:100 [in Tactics]
x:101 [in Logic]
X:101 [in Poly]
x:102 [in Tactics]
x:104 [in Poly]
X:105 [in Poly]
x:107 [in Logic]
X:109 [in Tactics]
X:11 [in Poly]
X:111 [in Poly]
X:113 [in Poly]
X:114 [in Tactics]
X:114 [in Poly]
X:117 [in Poly]
X:118 [in Poly]
x:119 [in Logic]
X:119 [in ImpParser]
X:12 [in Poly]
x:120 [in Basics]
x:122 [in Auto]
X:123 [in Poly]
x:124 [in Auto]
x:126 [in Lists]
x:128 [in Auto]
X:129 [in Tactics]
X:129 [in Poly]
x:13 [in Poly]
x:131 [in Tactics]
x:132 [in Poly]
x:132 [in IndProp]
x:133 [in Lists]
x:133 [in Auto]
x:133 [in Logic]
X:133 [in Poly]
X:134 [in Tactics]
x:135 [in Lists]
x:136 [in Logic]
X:138 [in Tactics]
x:138 [in Auto]
x:139 [in Logic]
x:139 [in Poly]
x:140 [in Lists]
X:141 [in Poly]
X:142 [in Tactics]
x:143 [in Lists]
x:143 [in Auto]
x:143 [in Logic]
X:145 [in Tactics]
X:145 [in Poly]
x:148 [in Lists]
x:15 [in Maps]
X:151 [in Poly]
x:153 [in Logic]
x:154 [in Logic]
x:155 [in Logic]
x:156 [in Logic]
X:156 [in Poly]
X:157 [in Logic]
x:161 [in Logic]
x:163 [in Logic]
X:163 [in Poly]
x:164 [in Logic]
x:164 [in Poly]
X:165 [in Logic]
X:166 [in Poly]
x:167 [in Imp]
X:169 [in Poly]
X:170 [in Logic]
X:171 [in Poly]
X:172 [in Logic]
X:175 [in Poly]
x:179 [in Poly]
X:181 [in Poly]
x:182 [in IndProp]
X:186 [in Poly]
x:187 [in Logic]
x:19 [in Poly]
x:19 [in Maps]
x:190 [in Poly]
X:192 [in Poly]
x:193 [in Imp]
X:197 [in Poly]
X:198 [in Poly]
X:2 [in Rel]
X:20 [in Rel]
X:200 [in Logic]
x:200 [in Poly]
X:201 [in Poly]
x:203 [in Poly]
X:204 [in Poly]
X:205 [in Logic]
x:206 [in Poly]
x:208 [in Logic]
X:21 [in Poly]
x:213 [in Imp]
X:215 [in Logic]
x:217 [in Logic]
x:218 [in Logic]
X:23 [in Tactics]
x:23 [in Maps]
X:24 [in Rel]
x:245 [in IndProp]
x:25 [in Poly]
x:255 [in Imp]
x:259 [in IndProp]
X:26 [in ImpParser]
X:26 [in Poly]
X:266 [in IndProp]
X:269 [in IndProp]
x:27 [in Poly]
x:270 [in IndProp]
x:273 [in Imp]
X:274 [in IndProp]
X:277 [in IndProp]
x:280 [in IndProp]
x:29 [in ImpParser]
X:31 [in Rel]
X:31 [in Poly]
X:32 [in Poly]
x:32 [in Maps]
X:33 [in Rel]
X:33 [in Poly]
x:34 [in Auto]
x:34 [in Poly]
X:35 [in Rel]
x:35 [in Auto]
x:35 [in Maps]
x:36 [in Auto]
X:36 [in IndPrinciples]
X:38 [in Poly]
x:39 [in Poly]
x:39 [in IndPrinciples]
x:39 [in Maps]
x:4 [in Rel]
x:4 [in Maps]
x:41 [in Rel]
X:42 [in IndPrinciples]
X:43 [in Poly]
x:44 [in Rel]
x:45 [in Rel]
x:46 [in Poly]
X:48 [in Poly]
X:5 [in Poly]
x:50 [in Maps]
X:53 [in Tactics]
x:53 [in Auto]
X:53 [in Poly]
x:53 [in Maps]
x:54 [in Rel]
x:54 [in Tactics]
x:54 [in Auto]
x:56 [in Maps]
X:57 [in Poly]
x:6 [in Maps]
x:60 [in ProofObjects]
x:61 [in ProofObjects]
X:61 [in Rel]
x:61 [in Auto]
X:61 [in Poly]
X:62 [in Poly]
x:62 [in AltAuto]
x:63 [in Rel]
X:63 [in Tactics]
x:63 [in AltAuto]
x:64 [in Tactics]
x:64 [in AltAuto]
X:65 [in Rel]
x:65 [in Maps]
x:67 [in Rel]
X:68 [in Poly]
X:7 [in Rel]
X:70 [in Rel]
x:70 [in Maps]
X:71 [in Poly]
x:72 [in Rel]
x:72 [in Tactics]
X:73 [in ProofObjects]
X:74 [in Poly]
x:75 [in Logic]
x:76 [in ProofObjects]
X:76 [in Poly]
X:77 [in ProofObjects]
x:78 [in ProofObjects]
x:78 [in Auto]
X:79 [in ProofObjects]
x:8 [in Logic]
x:8 [in Poly]
x:8 [in Maps]
x:80 [in ProofObjects]
X:80 [in Logic]
x:80 [in Poly]
X:81 [in ProofObjects]
x:81 [in Maps]
x:82 [in ProofObjects]
x:82 [in Logic]
X:82 [in Poly]
x:83 [in Logic]
X:84 [in Logic]
X:85 [in ProofObjects]
x:86 [in ProofObjects]
X:86 [in Poly]
x:86 [in Maps]
x:87 [in Logic]
x:88 [in Logic]
x:89 [in Logic]
X:90 [in Poly]
x:91 [in Logic]
X:95 [in ProofObjects]
X:95 [in Tactics]
X:97 [in Poly]
Y
y1:5 [in Rel]y2:6 [in Rel]
y:106 [in Logic]
Y:110 [in Tactics]
Y:115 [in Tactics]
y:123 [in Auto]
y:125 [in Auto]
y:129 [in Auto]
y:130 [in Auto]
y:134 [in Auto]
y:134 [in Logic]
Y:134 [in Poly]
y:135 [in Auto]
y:137 [in Logic]
y:139 [in Auto]
y:140 [in Auto]
y:140 [in Logic]
Y:142 [in Poly]
y:144 [in Lists]
y:144 [in Auto]
y:145 [in Auto]
Y:146 [in Poly]
y:149 [in Lists]
Y:152 [in Poly]
Y:157 [in Poly]
Y:158 [in Logic]
Y:172 [in Poly]
Y:176 [in Poly]
y:180 [in Poly]
Y:182 [in Poly]
Y:187 [in Poly]
y:188 [in Logic]
y:191 [in Poly]
Y:193 [in Poly]
y:2 [in Maps]
y:20 [in Poly]
y:36 [in Maps]
y:42 [in Rel]
y:46 [in Rel]
y:5 [in Maps]
y:55 [in Tactics]
y:57 [in Rel]
y:64 [in Rel]
y:65 [in Tactics]
y:68 [in Rel]
y:7 [in Maps]
y:73 [in Rel]
y:73 [in Tactics]
Y:77 [in Poly]
y:81 [in Poly]
y:83 [in ProofObjects]
Y:83 [in Poly]
y:87 [in ProofObjects]
Y:87 [in Poly]
y:9 [in Logic]
y:9 [in Maps]
Y:91 [in Poly]
Y:98 [in Poly]
Z
z:135 [in Logic]z:138 [in Logic]
z:141 [in Logic]
Z:177 [in Poly]
Z:183 [in Poly]
Z:188 [in Poly]
Z:194 [in Poly]
z:47 [in Rel]
z:56 [in Tactics]
z:58 [in Rel]
z:66 [in Tactics]
z:69 [in Rel]
Module Index
A
aevalR_extended [in Imp]aevalR_division [in Imp]
AExp [in Imp]
AExp.aevalR_first_try.HypothesisNames [in Imp]
AExp.aevalR_first_try [in Imp]
B
BreakImp [in Imp]E
Exercises [in Poly]Exercises.Church [in Poly]
M
MumbleGrumble [in Poly]MyEquality [in ProofObjects]
MyIff [in Logic]
MyNot [in Logic]
N
NatList [in Lists]NatPlayground [in Basics]
NatPlayground2 [in Basics]
O
OptionPlayground [in Poly]P
PartialMap [in Lists]Playground [in Basics]
Playground [in IndProp]
Props [in ProofObjects]
Props.And [in ProofObjects]
Props.Ex [in ProofObjects]
Props.Or [in ProofObjects]
Pumping [in IndProp]
R
R [in IndProp]Repeat [in Auto]
T
TuplePlayground [in Basics]Library Index
A
AltAutoAuto
B
BasicsBib
E
ExtractionI
ImpImpCEvalFun
ImpParser
IndPrinciples
IndProp
Induction
L
ListsLogic
M
MapsP
PolyPostscript
Preface
ProofObjects
R
RelT
TacticsLemma Index
A
add_le_cases [in IndProp]AExp.aeval_iff_aevalR' [in Imp]
AExp.aeval_iff_aevalR [in Imp]
AExp.beval_iff_bevalR [in Imp]
AExp.foo [in Imp]
AExp.foo' [in Imp]
AExp.In10 [in Imp]
AExp.In10' [in Imp]
AExp.optimize_0plus_b_sound [in Imp]
AExp.optimize_0plus_sound'' [in Imp]
AExp.optimize_0plus_sound' [in Imp]
AExp.optimize_0plus_sound [in Imp]
AExp.repeat_loop [in Imp]
AExp.silly1 [in Imp]
AExp.silly2 [in Imp]
All_In [in Logic]
all3_spec [in Induction]
andb_eq_orb [in Basics]
andb_commutative'' [in Basics]
andb_true_elim2 [in Basics]
andb_commutative' [in Basics]
andb_commutative [in Basics]
andb_true_iff [in Logic]
andb_false_r [in Induction]
andb3_exchange [in Basics]
and_assoc [in Logic]
and_commut [in Logic]
and_example3 [in Logic]
and_example2'' [in Logic]
and_example2' [in Logic]
and_example2 [in Logic]
and_intro [in Logic]
apply_iff_example [in Logic]
apply_empty [in Maps]
app_length [in Poly]
app_assoc [in Poly]
app_nil_r [in Poly]
app_ne [in IndProp]
app_exists [in IndProp]
B
bool_fn_applied_thrice [in Tactics]BreakImp.break_ignore [in Imp]
BreakImp.ceval_deterministic [in Imp]
BreakImp.while_break_true [in Imp]
BreakImp.while_stops_on_break [in Imp]
BreakImp.while_continue [in Imp]
C
ceval_deterministic [in Imp]ceval_deterministic''''' [in Auto]
ceval_deterministic''' [in Auto]
ceval_deterministic'' [in Auto]
ceval_deterministic'_alt [in Auto]
ceval_deterministic' [in Auto]
ceval_deterministic [in Auto]
ceval_deterministic' [in ImpCEvalFun]
ceval_and_ceval_step_coincide [in ImpCEvalFun]
ceval__ceval_step [in ImpCEvalFun]
ceval_step_more [in ImpCEvalFun]
ceval_step__ceval [in ImpCEvalFun]
char_eps_suffix [in IndProp]
char_nomatch_char [in IndProp]
combine_split [in Tactics]
combine_odd_even_elim_even [in Logic]
combine_odd_even_elim_odd [in Logic]
combine_odd_even_intro [in Logic]
contradiction_implies_anything [in Logic]
contrapositive [in Logic]
D
derive_corr [in IndProp]discriminate_ex2 [in Tactics]
discriminate_ex1 [in Tactics]
dist_exists_or [in Logic]
dist_not_exists [in Logic]
double_injective_take2 [in Tactics]
double_injective_take2_FAILED [in Tactics]
double_injective [in Tactics]
double_injective_FAILED [in Tactics]
double_neg [in Logic]
double_plus [in Induction]
E
empty_nomatch_ne [in IndProp]empty_matches_eps [in IndProp]
empty_is_empty [in IndProp]
eqbP [in IndProp]
eqbP_practice [in IndProp]
eqb_id_refl [in Lists]
eqb_trans [in Tactics]
eqb_sym [in Tactics]
eqb_true [in Tactics]
eqb_0_l [in Tactics]
eqb_list_true_iff [in Logic]
eqb_neq [in Logic]
eqb_eq [in Logic]
eqb_refl [in Induction]
eqb_stringP [in Maps]
eqb_string_false_iff [in Maps]
eqb_string_true_iff [in Maps]
eqb_string_refl [in Maps]
eq_implies_succ_equal' [in Tactics]
eq_implies_succ_equal [in Tactics]
eq_mult_0 [in Logic]
evenb_double_conv [in Logic]
evenb_double [in Logic]
evenb_S [in Induction]
evenb_ev [in IndPrinciples]
evenb_ev [in IndPrinciples]
even_bool_prop [in Logic]
evSS_ev' [in IndProp]
evSS_ev [in IndProp]
evSS_ev_remember [in IndProp]
evSS_ev [in IndProp]
ev_plus4 [in ProofObjects]
ev_8 [in ProofObjects]
ev_4'' [in ProofObjects]
ev_4' [in ProofObjects]
ev_4 [in ProofObjects]
ev_plus_plus [in IndProp]
ev_ev__ev [in IndProp]
ev_sum [in IndProp]
ev_even_iff [in IndProp]
ev_even [in IndProp]
ev_even_firsttry [in IndProp]
ev_minus2 [in IndProp]
ev_inversion [in IndProp]
ev_double [in IndProp]
ev_plus4 [in IndProp]
ev_4' [in IndProp]
ev_4 [in IndProp]
ev'_ev [in IndProp]
ev''_ev' [in IndPrinciples]
ev5_nonsense [in IndProp]
excluded_middle_irrefutable [in Logic]
execute_app [in Imp]
Exercises.curry_uncurry [in Poly]
Exercises.fold_length_correct [in Poly]
Exercises.uncurry_curry [in Poly]
existsb_existsb' [in Tactics]
exists_example_2 [in Logic]
ex_falso_quodlibet [in Logic]
F
false_eqb_string [in Maps]filter_exercise [in Tactics]
filter_not_empty_In' [in IndProp]
filter_not_empty_In [in IndProp]
foo [in AltAuto]
foo' [in AltAuto]
forallb_true_iff [in Logic]
four_is_even [in Logic]
f_equal [in Tactics]
I
identity_fn_applied_twice [in Basics]iff_trans [in Logic]
iff_refl [in Logic]
iff_sym [in Logic]
iff_reflect [in IndProp]
inclusion_update [in Maps]
injection_ex2 [in Tactics]
injection_ex1 [in Tactics]
inversion_ex2 [in IndProp]
inversion_ex1 [in IndProp]
in_not_nil_42_take5 [in Logic]
in_not_nil_42_take4 [in Logic]
in_not_nil_42_take3 [in Logic]
in_not_nil_42_take2 [in Logic]
in_not_nil_42 [in Logic]
in_not_nil [in Logic]
In_app_iff [in Logic]
In_map_iff [in Logic]
In_map [in Logic]
in_split [in IndProp]
in_re_match [in IndProp]
In10 [in AltAuto]
In10' [in AltAuto]
L
leb_refl [in Induction]leb_iff [in IndProp]
leb_true_trans [in IndProp]
leb_correct [in IndProp]
leb_complete [in IndProp]
le_order [in Rel]
le_step [in Rel]
le_antisymmetric [in Rel]
le_not_symmetric [in Rel]
le_Sn_n [in Rel]
le_S_n [in Rel]
le_Sn_le [in Rel]
le_trans [in Rel]
le_reflexive [in Rel]
le_not_a_partial_function [in Rel]
le_antisym [in Auto]
le_plus_l [in IndProp]
le_trans [in IndProp]
le_antisym [in AltAuto]
loop_never_stops [in Imp]
lt_trans'' [in Rel]
lt_trans' [in Rel]
lt_trans [in Rel]
lt_S [in IndProp]
M
map_rev [in Poly]match_eps_refl [in IndProp]
minus_n_n [in Induction]
MStar' [in IndProp]
MStar'' [in IndProp]
MStar1 [in IndProp]
mult_n_1 [in Basics]
mult_n_0_m_0 [in Basics]
mult_0_l [in Basics]
mult_0_3 [in Logic]
mult_0 [in Logic]
mult_eq_0 [in Logic]
mult_assoc [in Induction]
mult_plus_distr_r [in Induction]
mult_1_l [in Induction]
mult_comm [in Induction]
mult_0_plus' [in Induction]
mult_0_r [in Induction]
mult_0_r'' [in IndPrinciples]
mult_0_r' [in IndPrinciples]
MUnion' [in IndProp]
MyEquality.equality__leibniz_equality [in ProofObjects]
MyEquality.four [in ProofObjects]
MyEquality.leibniz_equality__equality [in ProofObjects]
N
NatList.app_assoc4 [in Lists]NatList.app_nil_r [in Lists]
NatList.app_length [in Lists]
NatList.app_assoc [in Lists]
NatList.count_member_nonzero [in Lists]
NatList.eqblist_refl [in Lists]
NatList.fst_swap_is_snd [in Lists]
NatList.leb_n_Sn [in Lists]
NatList.nil_app [in Lists]
NatList.nonzeros_app [in Lists]
NatList.option_elim_hd [in Lists]
NatList.remove_does_not_increase_count [in Lists]
NatList.rev_injective [in Lists]
NatList.rev_involutive [in Lists]
NatList.rev_app_distr [in Lists]
NatList.rev_length [in Lists]
NatList.rev_length_firsttry [in Lists]
NatList.snd_fst_is_swap [in Lists]
NatList.surjective_pairing [in Lists]
NatList.surjective_pairing_stuck [in Lists]
NatList.surjective_pairing' [in Lists]
NatList.tl_length_pred [in Lists]
nat_bin_nat [in Induction]
negb_involutive [in Basics]
next_nat_closure_is_le [in Rel]
next_nat_partial_function [in Rel]
not_exists_dist [in Logic]
not_true_iff_false [in Logic]
not_true_is_false' [in Logic]
not_true_is_false [in Logic]
not_both_true_and_false [in Logic]
not_False [in Logic]
not_implies_our_not [in Logic]
not_equiv_false [in IndProp]
no_whiles_eqv [in Imp]
nth_error_after_last [in Tactics]
null_matches_none [in IndProp]
n_le_m__Sn_le_Sm [in IndProp]
O
one_not_even' [in IndProp]one_not_even [in IndProp]
orb_true_iff [in Logic]
or_assoc [in Logic]
or_distributes_over_and [in Logic]
or_commut [in Logic]
or_intro_l [in Logic]
O_le_n [in IndProp]
P
PartialMap.update_neq [in Lists]PartialMap.update_eq [in Lists]
pigeonhole_principle [in IndProp]
Playground.test_le3 [in IndProp]
Playground.test_le2 [in IndProp]
Playground.test_le1 [in IndProp]
plus_n_n_injective [in Tactics]
plus_1_neq_0' [in Basics]
plus_1_neq_0 [in Basics]
plus_1_neq_0_firsttry [in Basics]
plus_id_exercise [in Basics]
plus_id_example [in Basics]
plus_1_l [in Basics]
plus_O_n'' [in Basics]
plus_O_n' [in Basics]
plus_O_n [in Basics]
plus_eqb_example [in Logic]
plus_comm3_take3 [in Logic]
plus_comm3_take2 [in Logic]
plus_comm3 [in Logic]
plus_claim_is_true [in Logic]
plus_2_2_is_4 [in Logic]
plus_swap' [in Induction]
plus_ble_compat_l [in Induction]
plus_swap [in Induction]
plus_assoc'' [in Induction]
plus_assoc' [in Induction]
plus_rearrange [in Induction]
plus_rearrange_firsttry [in Induction]
plus_assoc [in Induction]
plus_comm [in Induction]
plus_n_Sm [in Induction]
plus_n_O [in Induction]
plus_n_O_secondtry [in Induction]
plus_n_O_firsttry [in Induction]
plus_comm'' [in IndPrinciples]
plus_comm' [in IndPrinciples]
plus_assoc' [in IndPrinciples]
plus_one_r' [in IndPrinciples]
plus_lt [in IndProp]
plus_le [in IndProp]
plus2_spec [in Imp]
proj1 [in Logic]
proj2 [in Logic]
Props.And.and_comm [in ProofObjects]
Props.And.proj1' [in ProofObjects]
Props.Or.inj_l' [in ProofObjects]
Props.Or.or_elim' [in ProofObjects]
provable_equiv_true [in IndProp]
pumping [in AltAuto]
Pumping.napp_star [in IndProp]
Pumping.napp_plus [in IndProp]
Pumping.pumping [in IndProp]
Pumping.pumping_constant_0_false [in IndProp]
Pumping.pumping_constant_ge_1 [in IndProp]
Pumping.weak_pumping [in IndProp]
pup_to_2_ceval [in Imp]
Q
quiz [in IndProp]R
reflect_iff [in IndProp]regex_refl [in IndProp]
reg_exp_of_list_spec [in IndProp]
Repeat.ceval_deterministic' [in Auto]
Repeat.ceval_deterministic [in Auto]
restricted_excluded_middle_eq [in Logic]
restricted_excluded_middle [in Logic]
rev_exercise1 [in Tactics]
rev_involutive [in Poly]
rev_app_distr [in Poly]
re_not_empty_correct [in IndProp]
re_opt_match' [in AltAuto]
re_opt_match [in AltAuto]
re_opt_e_match'' [in AltAuto]
re_opt_e_match' [in AltAuto]
re_opt_e_match [in AltAuto]
rsc_trans [in Rel]
rsc_R [in Rel]
rtc_rsc_coincide [in Rel]
R.R_equiv_fR [in IndProp]
S
sillyfun_false [in Tactics]sillyfun1_odd [in Tactics]
sillyfun1_odd_FAILED [in Tactics]
silly_fact_2' [in Tactics]
silly_fact_2 [in Tactics]
silly_fact_2_FAILED [in Tactics]
silly_fact_1 [in Tactics]
silly_ex [in Tactics]
silly1 [in Tactics]
silly1 [in Auto]
silly1 [in AltAuto]
silly2 [in Tactics]
silly2 [in Auto]
silly2 [in AltAuto]
silly2a [in Tactics]
silly2_eauto [in Auto]
silly2_eassumption [in Auto]
silly2_fixed [in Auto]
silly3_firsttry [in Tactics]
silly3' [in Tactics]
Sn_le_Sm__n_le_m [in IndProp]
split_combine [in Tactics]
square_mult [in Tactics]
SSSSev__even [in IndProp]
star_ne [in IndProp]
star_app [in IndProp]
star_app [in IndProp]
star_app [in IndProp]
subseq_trans [in IndProp]
subseq_app [in IndProp]
subseq_refl [in IndProp]
succ_inj [in Logic]
S_inj [in Tactics]
S_injective' [in Tactics]
S_injective [in Tactics]
s_compile_correct [in Imp]
s_compile_correct_aux [in Imp]
S_nbeq_0 [in Induction]
T
trans_eq [in Tactics]True_is_true [in Logic]
tr_rev_correct [in Logic]
t_update_permute [in Maps]
t_update_same [in Maps]
t_update_shadow [in Maps]
t_update_neq [in Maps]
t_update_eq [in Maps]
t_apply_empty [in Maps]
U
union_disj [in IndProp]update_permute [in Maps]
update_same [in Maps]
update_shadow [in Maps]
update_neq [in Maps]
update_eq [in Maps]
W
weak_pumping [in AltAuto]Z
zero_nbeq_plus_1 [in Basics]zero_not_one [in Logic]
zero_or_succ [in Logic]
zero_nbeq_S [in Induction]
Constructor Index
A
aevalR_extended.E_AMult [in Imp]aevalR_extended.E_AMinus [in Imp]
aevalR_extended.E_APlus [in Imp]
aevalR_extended.E_ANum [in Imp]
aevalR_extended.E_Any [in Imp]
aevalR_extended.AMult [in Imp]
aevalR_extended.AMinus [in Imp]
aevalR_extended.APlus [in Imp]
aevalR_extended.ANum [in Imp]
aevalR_extended.AAny [in Imp]
aevalR_division.E_ADiv [in Imp]
aevalR_division.E_AMult [in Imp]
aevalR_division.E_AMinus [in Imp]
aevalR_division.E_APlus [in Imp]
aevalR_division.E_ANum [in Imp]
aevalR_division.ADiv [in Imp]
aevalR_division.AMult [in Imp]
aevalR_division.AMinus [in Imp]
aevalR_division.APlus [in Imp]
aevalR_division.ANum [in Imp]
AExp.aevalR_first_try.HypothesisNames.E_AMult [in Imp]
AExp.aevalR_first_try.HypothesisNames.E_AMinus [in Imp]
AExp.aevalR_first_try.HypothesisNames.E_APlus [in Imp]
AExp.aevalR_first_try.HypothesisNames.E_ANum [in Imp]
AExp.aevalR_first_try.E_AMult [in Imp]
AExp.aevalR_first_try.E_AMinus [in Imp]
AExp.aevalR_first_try.E_APlus [in Imp]
AExp.aevalR_first_try.E_ANum [in Imp]
AExp.AMinus [in Imp]
AExp.AMult [in Imp]
AExp.ANum [in Imp]
AExp.APlus [in Imp]
AExp.BAnd [in Imp]
AExp.BEq [in Imp]
AExp.BFalse [in Imp]
AExp.BLe [in Imp]
AExp.BNot [in Imp]
AExp.BTrue [in Imp]
AExp.E_AMult [in Imp]
AExp.E_AMinus [in Imp]
AExp.E_APlus [in Imp]
AExp.E_ANum [in Imp]
AId [in Imp]
alpha [in ImpParser]
AMinus [in Imp]
AMult [in Imp]
ANum [in Imp]
APlus [in Imp]
App [in IndProp]
B
BAnd [in Imp]Baz1 [in Lists]
Baz2 [in Lists]
BEq [in Imp]
BFalse [in Imp]
black [in Basics]
BLe [in Imp]
blue [in Basics]
blue [in IndPrinciples]
BNot [in Imp]
bool_cons [in Poly]
bool_nil [in Poly]
BreakImp.CAss [in Imp]
BreakImp.CBreak [in Imp]
BreakImp.CIf [in Imp]
BreakImp.CSeq [in Imp]
BreakImp.CSkip [in Imp]
BreakImp.CWhile [in Imp]
BreakImp.E_Skip [in Imp]
BreakImp.SBreak [in Imp]
BreakImp.SContinue [in Imp]
BTrue [in Imp]
bt_branch [in IndPrinciples]
bt_leaf [in IndPrinciples]
bt_empty [in IndPrinciples]
B0 [in Basics]
B1 [in Basics]
C
CAss [in Imp]Char [in IndProp]
CIf [in Imp]
cons [in Poly]
cons' [in Poly]
CSeq [in Imp]
CSkip [in Imp]
CWhile [in Imp]
C1 [in IndPrinciples]
C2 [in IndPrinciples]
D
day [in IndPrinciples]digit [in ImpParser]
E
EmptySet [in IndProp]EmptyStr [in IndProp]
ev_SS [in IndPrinciples]
ev_0 [in IndPrinciples]
ev_SS [in IndProp]
ev_0 [in IndProp]
ev'_sum [in IndPrinciples]
ev'_2 [in IndPrinciples]
ev'_0 [in IndPrinciples]
ev'_sum [in IndProp]
ev'_2 [in IndProp]
ev'_0 [in IndProp]
E_WhileTrue [in Imp]
E_WhileFalse [in Imp]
E_IfFalse [in Imp]
E_IfTrue [in Imp]
E_Seq [in Imp]
E_Ass [in Imp]
E_Skip [in Imp]
F
false [in Basics]friday [in Basics]
G
green [in Basics]green [in IndPrinciples]
I
Id [in Lists]L
leaf [in IndPrinciples]le1_S [in IndPrinciples]
le1_n [in IndPrinciples]
le2_S [in IndPrinciples]
le2_n [in IndPrinciples]
M
MApp [in IndProp]MChar [in IndProp]
MEmpty [in IndProp]
monday [in Basics]
MStarApp [in IndProp]
MStar0 [in IndProp]
MumbleGrumble.a [in Poly]
MumbleGrumble.b [in Poly]
MumbleGrumble.c [in Poly]
MumbleGrumble.d [in Poly]
MumbleGrumble.e [in Poly]
MUnionL [in IndProp]
MUnionR [in IndProp]
MyEquality.eq_refl [in ProofObjects]
N
NatList.cons [in Lists]NatList.nil [in Lists]
NatList.None [in Lists]
NatList.pair [in Lists]
NatList.Some [in Lists]
NatPlayground.O [in Basics]
NatPlayground.S [in Basics]
NatPlayground.stop [in Basics]
NatPlayground.tick [in Basics]
ncons [in IndPrinciples]
ne_2 [in IndProp]
ne_1 [in IndProp]
night [in IndPrinciples]
nil [in Poly]
nil' [in Poly]
nn [in IndProp]
nnil [in IndPrinciples]
nnil' [in IndPrinciples]
node [in IndPrinciples]
NoneE [in ImpParser]
nsnoc [in IndPrinciples]
O
OptionPlayground.None [in Poly]OptionPlayground.Some [in Poly]
other [in ImpParser]
P
pair [in Poly]PartialMap.empty [in Lists]
PartialMap.record [in Lists]
Playground.le_S [in IndProp]
Playground.le_n [in IndProp]
primary [in Basics]
Props.And.conj [in ProofObjects]
Props.Ex.ex_intro [in ProofObjects]
Props.I [in ProofObjects]
Props.Or.or_intror [in ProofObjects]
Props.Or.or_introl [in ProofObjects]
R
red [in Basics]red [in IndPrinciples]
ReflectF [in IndProp]
ReflectT [in IndProp]
Repeat.CAss [in Auto]
Repeat.CIf [in Auto]
Repeat.CRepeat [in Auto]
Repeat.CSeq [in Auto]
Repeat.CSkip [in Auto]
Repeat.CWhile [in Auto]
Repeat.E_RepeatLoop [in Auto]
Repeat.E_RepeatEnd [in Auto]
Repeat.E_WhileTrue [in Auto]
Repeat.E_WhileFalse [in Auto]
Repeat.E_IfFalse [in Auto]
Repeat.E_IfTrue [in Auto]
Repeat.E_Seq [in Auto]
Repeat.E_Ass [in Auto]
Repeat.E_Skip [in Auto]
rt_trans [in Rel]
rt_refl [in Rel]
rt_step [in Rel]
rt1n_trans [in Rel]
rt1n_refl [in Rel]
R.c1 [in IndProp]
R.c2 [in IndProp]
R.c3 [in IndProp]
R.c4 [in IndProp]
R.c5 [in IndProp]
S
saturday [in Basics]SLoad [in Imp]
SMinus [in Imp]
SMult [in Imp]
SomeE [in ImpParser]
SPlus [in Imp]
SPush [in Imp]
sq [in IndProp]
Star [in IndProp]
sunday [in Basics]
T
thursday [in Basics]true [in Basics]
tuesday [in Basics]
TuplePlayground.bits [in Basics]
TuplePlayground.B0 [in Basics]
TuplePlayground.B1 [in Basics]
U
Union [in IndProp]W
wednesday [in Basics]white [in Basics]
white [in ImpParser]
wrong_ev_SS [in IndProp]
wrong_ev_0 [in IndProp]
Z
Z [in Basics]Axiom Index
F
functional_extensionality [in Logic]Inductive Index
A
aevalR_extended.aevalR [in Imp]aevalR_extended.aexp [in Imp]
aevalR_division.aevalR [in Imp]
aevalR_division.aexp [in Imp]
aexp [in Imp]
AExp.aevalR [in Imp]
AExp.aevalR_first_try.HypothesisNames.aevalR [in Imp]
AExp.aevalR_first_try.aevalR [in Imp]
AExp.aexp [in Imp]
AExp.bevalR [in Imp]
AExp.bexp [in Imp]
B
baz [in Lists]bexp [in Imp]
bin [in Basics]
bool [in Basics]
boollist [in Poly]
booltree [in IndPrinciples]
BreakImp.ceval [in Imp]
BreakImp.com [in Imp]
BreakImp.result [in Imp]
C
ceval [in Imp]chartype [in ImpParser]
clos_refl_trans_1n [in Rel]
clos_refl_trans [in Rel]
color [in Basics]
com [in Imp]
D
day [in Basics]E
ev [in IndProp]ev' [in IndPrinciples]
ev' [in IndProp]
ev'' [in IndPrinciples]
exp_match [in IndProp]
F
foo' [in IndPrinciples]I
id [in Lists]L
le1 [in IndPrinciples]le2 [in IndPrinciples]
list [in Poly]
list' [in Poly]
M
MumbleGrumble.grumble [in Poly]MumbleGrumble.mumble [in Poly]
MyEquality.eq [in ProofObjects]
N
natlist [in IndPrinciples]natlist' [in IndPrinciples]
NatList.natlist [in Lists]
NatList.natoption [in Lists]
NatList.natprod [in Lists]
NatPlayground.nat [in Basics]
NatPlayground.nat' [in Basics]
next_ev [in IndProp]
next_nat [in IndProp]
nostutter [in IndProp]
no_whilesR [in Imp]
O
optionE [in ImpParser]OptionPlayground.option [in Poly]
P
PartialMap.partial_map [in Lists]Playground.le [in IndProp]
prod [in Poly]
Props.And.and [in ProofObjects]
Props.Ex.ex [in ProofObjects]
Props.False [in ProofObjects]
Props.Or.or [in ProofObjects]
Props.True [in ProofObjects]
R
reflect [in IndProp]reg_exp [in IndProp]
repeats [in IndProp]
Repeat.ceval [in Auto]
Repeat.com [in Auto]
rgb [in Basics]
rgb [in IndPrinciples]
R.R [in IndProp]
S
sinstr [in Imp]square_of [in IndProp]
subseq [in IndProp]
T
time [in IndPrinciples]Toy [in IndPrinciples]
tree [in IndPrinciples]
TuplePlayground.bit [in Basics]
TuplePlayground.nybble [in Basics]
W
wrong_ev [in IndProp]Definition Index
A
add1 [in ProofObjects]aeval [in Imp]
AExp.aeval [in Imp]
AExp.beval [in Imp]
AExp.manual_grade_for_beval_rules [in Imp]
AExp.optimize_0plus_b [in Imp]
AExp.optimize_0plus [in Imp]
AExp.plus_assoc__omega [in Imp]
AExp.plus_comm__omega [in Imp]
AExp.silly_presburger_example [in Imp]
AExp.test_optimize_0plus [in Imp]
AExp.test_aeval1 [in Imp]
aexp1 [in Imp]
All [in Logic]
andb [in Basics]
andb3 [in Basics]
and_exercise [in Logic]
and_example' [in Logic]
and_example [in Logic]
antisymmetric [in Rel]
app [in Poly]
auto_example_7' [in Auto]
auto_example_7 [in Auto]
auto_example_6' [in Auto]
auto_example_6 [in Auto]
auto_example_5 [in Auto]
auto_example_4 [in Auto]
auto_example_3 [in Auto]
auto_example_2 [in Auto]
auto_example_1' [in Auto]
auto_example_1 [in Auto]
auto_example_7' [in AltAuto]
auto_example_7 [in AltAuto]
auto_example_6' [in AltAuto]
auto_example_6 [in AltAuto]
auto_example_5 [in AltAuto]
auto_example_4 [in AltAuto]
auto_example_3 [in AltAuto]
auto_example_2 [in AltAuto]
auto_example_1' [in AltAuto]
auto_example_1 [in AltAuto]
B
b [in Basics]bar [in Tactics]
beval [in Imp]
bexp1 [in Imp]
bignumber [in ImpParser]
bin_to_nat [in Basics]
build_proof [in IndPrinciples]
C
c [in IndProp]ceval_example2 [in Imp]
ceval_example1 [in Imp]
ceval_fun_no_while [in Imp]
ceval_example1 [in Auto]
ceval_step [in ImpCEvalFun]
ceval_step3 [in ImpCEvalFun]
ceval_step2 [in ImpCEvalFun]
ceval_step1 [in ImpCEvalFun]
ceval'_example1 [in Auto]
classifyChar [in ImpParser]
combine [in Poly]
combine_odd_even [in Logic]
constfun [in Poly]
constfun_example2 [in Poly]
constfun_example1 [in Poly]
constructor_example [in AltAuto]
count [in IndProp]
countoddmembers' [in Poly]
D
d [in IndProp]derive [in IndProp]
derives [in IndProp]
de_morgan_not_and_not [in Logic]
discriminate_ex3 [in Tactics]
doit3times [in Poly]
double [in Induction]
double_negation_elimination [in Logic]
E
eauto_example [in Auto]eg1 [in ImpParser]
eg2 [in ImpParser]
empty [in Maps]
empty_st [in Imp]
eqb [in Basics]
eqb_id [in Lists]
eqb_list [in Logic]
eqb_string [in Maps]
equivalence [in Rel]
even [in Logic]
evenb [in Basics]
even_1000'' [in Logic]
even_1000' [in Logic]
even_1000 [in Logic]
even_42_prop [in Logic]
even_42_bool [in Logic]
ev_plus2'' [in ProofObjects]
ev_plus2' [in ProofObjects]
ev_plus2 [in ProofObjects]
ev_plus4'' [in ProofObjects]
ev_plus4' [in ProofObjects]
ev_8' [in ProofObjects]
ev_4''' [in ProofObjects]
examplemap [in Maps]
examplemap' [in Maps]
examplepmap [in Maps]
example_bexp [in Imp]
example_aexp [in Imp]
example_empty [in Maps]
excluded_middle [in Logic]
Exercises.Church.cnat [in Poly]
Exercises.Church.exp [in Poly]
Exercises.Church.exp_3 [in Poly]
Exercises.Church.exp_2 [in Poly]
Exercises.Church.exp_1 [in Poly]
Exercises.Church.mult [in Poly]
Exercises.Church.mult_3 [in Poly]
Exercises.Church.mult_2 [in Poly]
Exercises.Church.mult_1 [in Poly]
Exercises.Church.one [in Poly]
Exercises.Church.plus [in Poly]
Exercises.Church.plus_3 [in Poly]
Exercises.Church.plus_2 [in Poly]
Exercises.Church.plus_1 [in Poly]
Exercises.Church.succ [in Poly]
Exercises.Church.succ_3 [in Poly]
Exercises.Church.succ_2 [in Poly]
Exercises.Church.succ_1 [in Poly]
Exercises.Church.three [in Poly]
Exercises.Church.two [in Poly]
Exercises.Church.zero [in Poly]
Exercises.fold_map [in Poly]
Exercises.fold_length [in Poly]
Exercises.manual_grade_for_informal_proof [in Poly]
Exercises.manual_grade_for_fold_map [in Poly]
Exercises.prod_uncurry [in Poly]
Exercises.prod_curry [in Poly]
Exercises.test_map1' [in Poly]
Exercises.test_fold_length1 [in Poly]
existsb [in Tactics]
existsb' [in Tactics]
exp [in Basics]
expect [in ImpParser]
F
factorial [in Basics]fact_in_coq [in Imp]
falso [in ProofObjects]
filter [in Poly]
filter_even_gt7 [in Poly]
firstExpect [in ImpParser]
flat_map [in Poly]
fold [in Poly]
fold_example3 [in Poly]
fold_example2 [in Poly]
fold_example1 [in Poly]
foo [in Tactics]
forallb [in Tactics]
forallb [in Logic]
fst [in Poly]
ftrue [in Poly]
function_equality_ex2 [in Logic]
function_equality_ex2 [in Logic]
function_equality_ex1 [in Logic]
H
hd_error [in Poly]I
implies_to_or [in Logic]In [in Logic]
inclusion [in Maps]
incr [in Basics]
infinite_loop [in ProofObjects]
injection_ex3 [in Tactics]
injective [in Logic]
In_example_2 [in Logic]
In_example_1 [in Logic]
isAlpha [in ImpParser]
isDigit [in ImpParser]
isLowerAlpha [in ImpParser]
isred [in Basics]
isWhite [in ImpParser]
is_fortytwo [in Auto]
is_even_prime [in Logic]
is_three [in Logic]
is_der [in IndProp]
is_fortytwo [in AltAuto]
L
leb [in Basics]lemma_application_ex [in Logic]
length [in Poly]
length_is_1 [in Poly]
list_of_string [in ImpParser]
list123 [in Poly]
list123' [in Poly]
list123'' [in Poly]
list123''' [in Poly]
loop [in Imp]
ltb [in Basics]
M
manual_grade_for_baz_num_elts [in Lists]manual_grade_for_split_combine [in Tactics]
manual_grade_for_informal_proof [in Tactics]
manual_grade_for_no_whiles_terminating [in Imp]
manual_grade_for_XtimesYinZ_spec [in Imp]
manual_grade_for_negation_fn_applied_twice [in Basics]
manual_grade_for_informal_not_PNP [in Logic]
manual_grade_for_double_neg_inf [in Logic]
manual_grade_for_fold_types_different [in Poly]
manual_grade_for_mumble_grumble [in Poly]
manual_grade_for_binary_inverse_c [in Induction]
manual_grade_for_binary_inverse_b [in Induction]
manual_grade_for_binary_inverse_a [in Induction]
manual_grade_for_binary_commute [in Induction]
manual_grade_for_plus_comm_informal [in Induction]
manual_grade_for_destruct_induction [in Induction]
manual_grade_for_ceval_step__ceval_inf [in ImpCEvalFun]
manual_grade_for_toy_ind [in IndPrinciples]
manual_grade_for_booltree_ind [in IndPrinciples]
manual_grade_for_check_repeats [in IndProp]
manual_grade_for_NoDup_disjoint_etc [in IndProp]
manual_grade_for_pal_pal_app_rev_pal_rev [in IndProp]
manual_grade_for_filter_challenge [in IndProp]
manual_grade_for_nostutter [in IndProp]
manual_grade_for_pumping_redux_strong [in AltAuto]
manual_grade_for_pumping_redux [in AltAuto]
manual_grade_for_re_opt [in AltAuto]
many [in ImpParser]
many_helper [in ImpParser]
map [in Poly]
matches_regex [in IndProp]
match_eps [in IndProp]
minustwo [in Basics]
monochrome [in Basics]
MyEquality.four' [in ProofObjects]
MyEquality.singleton [in ProofObjects]
MyIff.iff [in Logic]
mynil [in Poly]
mynil [in Poly]
mynil' [in Poly]
MyNot.not [in Logic]
N
nandb [in Basics]NatList.add [in Lists]
NatList.alternate [in Lists]
NatList.app [in Lists]
NatList.bag [in Lists]
NatList.count [in Lists]
NatList.countoddmembers [in Lists]
NatList.eqblist [in Lists]
NatList.fst [in Lists]
NatList.fst' [in Lists]
NatList.hd [in Lists]
NatList.hd_error [in Lists]
NatList.length [in Lists]
NatList.manual_grade_for_add_inc_count [in Lists]
NatList.member [in Lists]
NatList.mylist [in Lists]
NatList.mylist1 [in Lists]
NatList.mylist2 [in Lists]
NatList.mylist3 [in Lists]
NatList.nonzeros [in Lists]
NatList.nth_error' [in Lists]
NatList.nth_error [in Lists]
NatList.nth_bad [in Lists]
NatList.oddmembers [in Lists]
NatList.option_elim [in Lists]
NatList.remove_all [in Lists]
NatList.remove_one [in Lists]
NatList.repeat [in Lists]
NatList.rev [in Lists]
NatList.snd [in Lists]
NatList.snd' [in Lists]
NatList.subset [in Lists]
NatList.sum [in Lists]
NatList.swap_pair [in Lists]
NatList.test_hd_error3 [in Lists]
NatList.test_hd_error2 [in Lists]
NatList.test_hd_error1 [in Lists]
NatList.test_nth_error3 [in Lists]
NatList.test_nth_error2 [in Lists]
NatList.test_nth_error1 [in Lists]
NatList.test_eqblist3 [in Lists]
NatList.test_eqblist2 [in Lists]
NatList.test_eqblist1 [in Lists]
NatList.test_rev2 [in Lists]
NatList.test_rev1 [in Lists]
NatList.test_subset2 [in Lists]
NatList.test_subset1 [in Lists]
NatList.test_remove_all4 [in Lists]
NatList.test_remove_all3 [in Lists]
NatList.test_remove_all2 [in Lists]
NatList.test_remove_all1 [in Lists]
NatList.test_remove_one4 [in Lists]
NatList.test_remove_one3 [in Lists]
NatList.test_remove_one2 [in Lists]
NatList.test_remove_one1 [in Lists]
NatList.test_member2 [in Lists]
NatList.test_member1 [in Lists]
NatList.test_add2 [in Lists]
NatList.test_add1 [in Lists]
NatList.test_sum1 [in Lists]
NatList.test_count2 [in Lists]
NatList.test_count1 [in Lists]
NatList.test_alternate4 [in Lists]
NatList.test_alternate3 [in Lists]
NatList.test_alternate2 [in Lists]
NatList.test_alternate1 [in Lists]
NatList.test_countoddmembers3 [in Lists]
NatList.test_countoddmembers2 [in Lists]
NatList.test_countoddmembers1 [in Lists]
NatList.test_oddmembers [in Lists]
NatList.test_nonzeros [in Lists]
NatList.test_tl [in Lists]
NatList.test_hd2 [in Lists]
NatList.test_hd1 [in Lists]
NatList.test_app3 [in Lists]
NatList.test_app2 [in Lists]
NatList.test_app1 [in Lists]
NatList.tl [in Lists]
NatPlayground.pred [in Basics]
NatPlayground2.minus [in Basics]
NatPlayground2.mult [in Basics]
NatPlayground2.plus [in Basics]
NatPlayground2.test_mult1 [in Basics]
nat_to_bin [in Induction]
nat_ind2 [in IndPrinciples]
nat_ind_tidy [in IndPrinciples]
negb [in Basics]
next_weekday [in Basics]
not_even_1001' [in Logic]
not_even_1001 [in Logic]
no_whiles [in Imp]
nth_error [in Poly]
O
oddb [in Basics]option_map [in Poly]
orb [in Basics]
order [in Rel]
or_bogus [in ProofObjects]
P
parse [in ImpParser]parseAExp [in ImpParser]
parseAtomicExp [in ImpParser]
parseBExp [in ImpParser]
parseConjunctionExp [in ImpParser]
parseIdentifier [in ImpParser]
parseNumber [in ImpParser]
parsePrimaryExp [in ImpParser]
parseProductExp [in ImpParser]
parser [in ImpParser]
parseSequencedCommand [in ImpParser]
parseSimpleCommand [in ImpParser]
parseSumExp [in ImpParser]
PartialMap.find [in Lists]
PartialMap.update [in Lists]
partial_function [in Rel]
partial_map [in Maps]
partition [in Poly]
peirce [in Logic]
Playground.b [in Basics]
Playground.lt [in IndProp]
plus_claim [in Logic]
plus' [in Basics]
plus2 [in Imp]
plus3 [in Poly]
preorder [in Rel]
Props.and_comm' [in ProofObjects]
Props.and_comm'_aux [in ProofObjects]
Props.conj_fact [in ProofObjects]
Props.contra [in ProofObjects]
Props.ex_falso_quodlibet' [in ProofObjects]
Props.ex_ev_Sn [in ProofObjects]
Props.false_implies_zero_eq_one [in ProofObjects]
Props.or_commut' [in ProofObjects]
Props.Or.inj_l [in ProofObjects]
Props.Or.or_elim [in ProofObjects]
Props.p_implies_true [in ProofObjects]
Props.some_nat_is_even [in ProofObjects]
Pumping.napp [in IndProp]
Pumping.pumping_constant [in IndProp]
pup_to_n [in Imp]
pup_to_n [in ImpCEvalFun]
P_m0r' [in IndPrinciples]
P_m0r [in IndPrinciples]
R
reflexive [in Rel]refl_matches_eps [in IndProp]
regex_match [in IndProp]
reg_exp_ex4 [in IndProp]
reg_exp_of_list [in IndProp]
reg_exp_ex3 [in IndProp]
reg_exp_ex2 [in IndProp]
reg_exp_ex1 [in IndProp]
relation [in Rel]
repeat [in Poly]
repeat' [in Poly]
repeat'' [in Poly]
repeat''' [in Poly]
rev [in Poly]
rev_append [in Logic]
re_not_empty [in IndProp]
re_chars [in IndProp]
re_opt [in AltAuto]
re_opt_e [in AltAuto]
R.fR [in IndProp]
R.manual_grade_for_R_provability [in IndProp]
S
sillyfun [in Tactics]sillyfun1 [in Tactics]
silly_presburger_example [in AltAuto]
snd [in Poly]
split [in Tactics]
split [in Poly]
split_combine_statement [in Tactics]
square [in Tactics]
state [in Imp]
string [in IndProp]
string_of_list [in ImpParser]
subtract_3_from_5_slowly [in Imp]
subtract_slowly [in Imp]
subtract_slowly_body [in Imp]
symmetric [in Rel]
s_compile1 [in Imp]
s_compile [in Imp]
s_execute2 [in Imp]
s_execute1 [in Imp]
s_execute [in Imp]
T
testParsing [in ImpParser]test_existsb_4 [in Tactics]
test_existsb_3 [in Tactics]
test_existsb_2 [in Tactics]
test_existsb_1 [in Tactics]
test_forallb_4 [in Tactics]
test_forallb_3 [in Tactics]
test_forallb_2 [in Tactics]
test_forallb_1 [in Tactics]
test_bin_incr6 [in Basics]
test_bin_incr5 [in Basics]
test_bin_incr4 [in Basics]
test_bin_incr3 [in Basics]
test_bin_incr2 [in Basics]
test_bin_incr1 [in Basics]
test_ltb3 [in Basics]
test_ltb2 [in Basics]
test_ltb1 [in Basics]
test_leb3' [in Basics]
test_leb3 [in Basics]
test_leb2 [in Basics]
test_leb1 [in Basics]
test_factorial2 [in Basics]
test_factorial1 [in Basics]
test_oddb2 [in Basics]
test_oddb1 [in Basics]
test_andb34 [in Basics]
test_andb33 [in Basics]
test_andb32 [in Basics]
test_andb31 [in Basics]
test_nandb4 [in Basics]
test_nandb3 [in Basics]
test_nandb2 [in Basics]
test_nandb1 [in Basics]
test_orb5 [in Basics]
test_orb4 [in Basics]
test_orb3 [in Basics]
test_orb2 [in Basics]
test_orb1 [in Basics]
test_next_weekday [in Basics]
test_plus3'' [in Poly]
test_plus3' [in Poly]
test_plus3 [in Poly]
test_flat_map1 [in Poly]
test_map3 [in Poly]
test_map2 [in Poly]
test_map1 [in Poly]
test_partition2 [in Poly]
test_partition1 [in Poly]
test_filter_even_gt7_2 [in Poly]
test_filter_even_gt7_1 [in Poly]
test_filter2' [in Poly]
test_anon_fun' [in Poly]
test_countoddmembers'3 [in Poly]
test_countoddmembers'2 [in Poly]
test_countoddmembers'1 [in Poly]
test_filter2 [in Poly]
test_filter1 [in Poly]
test_doit3times' [in Poly]
test_doit3times [in Poly]
test_hd_error2 [in Poly]
test_hd_error1 [in Poly]
test_nth_error3 [in Poly]
test_nth_error2 [in Poly]
test_nth_error1 [in Poly]
test_split [in Poly]
test_length1 [in Poly]
test_rev2 [in Poly]
test_rev1 [in Poly]
test_repeat2 [in Poly]
test_repeat1 [in Poly]
test_ceval [in ImpCEvalFun]
test_der7 [in IndProp]
test_der6 [in IndProp]
test_der5 [in IndProp]
test_der4 [in IndProp]
test_der3 [in IndProp]
test_der2 [in IndProp]
test_der1 [in IndProp]
test_der0 [in IndProp]
test_nostutter_4 [in IndProp]
test_nostutter_3 [in IndProp]
test_nostutter_2 [in IndProp]
test_nostutter_1 [in IndProp]
token [in ImpParser]
tokenize [in ImpParser]
tokenize_ex1 [in ImpParser]
tokenize_helper [in ImpParser]
total_map [in Maps]
transitive [in Rel]
trans_eq_exercise [in Tactics]
trans_eq_example'' [in Tactics]
trans_eq_example' [in Tactics]
trans_eq_example [in Tactics]
trans_example2 [in AltAuto]
trans_example1' [in AltAuto]
trans_example1 [in AltAuto]
tr_rev [in Logic]
TuplePlayground.all_zero [in Basics]
t_update [in Maps]
t_empty [in Maps]
U
update [in Maps]update_example4 [in Maps]
update_example3 [in Maps]
update_example2 [in Maps]
update_example1 [in Maps]
W
W [in Imp]X
X [in Imp]XtimesYinZ [in Imp]
Y
Y [in Imp]Z
Z [in Imp]| Global Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (3364 entries) |
| Notation Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (81 entries) |
| Binder Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (2018 entries) |
| Module Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (27 entries) |
| Library Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (20 entries) |
| Lemma Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (397 entries) |
| Constructor Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (218 entries) |
| Axiom Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (1 entry) |
| Inductive Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (79 entries) |
| Definition Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (523 entries) |
This page has been generated by coqdoc


Introduction |
Documentation |
Downloads |
Forum |
Credits |
Torch3 is not compatible with Torch2. The structure is similar, but a lot of things have been simplified. There is no script to convert your Torch2 code, but it should be easy to do it. You should use Torch3 because it's easier to code with it, and because we provide tutorials for a quick start.
Torch is pretty easy to install under Unix and Linux systems, including Mac OS X. Before asking questions,Note that xmake is a fast (and easy) python script designed for compiling Torch. Makefiles are not needed anymore.
- have a look here if you want to use xmake (recommended).
- have a look here if you want to use GNU Make.
For people using MS Windows, two solutions are possible:
Several tutorials are provided for the beginner in Torch.
- Tutorial on Torch written by myself.
- Tutorial on distributions written by Samy Bengio.
- Tutorial on convolutions written by myself.
- Manual of the speech decoder written by Darren Moore.
If you are looking for a class, check the class hierarchy.
If you want to see the documentation for all classes, go there.


Text protocol on top of TCP
Show in Wireshark
Show in browser
URL
Method
Query
Headers
Body
| Method | Req body | Res body | Safe | Idemp | Cached |
|---|---|---|---|---|---|
| GET | No | Yes | Yes | Yes | Yes |
| POST | Yes | Yes | No | No | Yes |
| PUT | Yes | Yes | No | Yes | No |
| DELETE | No | Yes | No | Yes | No |
| Method | Req body | Res body | Safe | Idemp | Cached |
|---|---|---|---|---|---|
| HEAD | No | No | Yes | Yes | Yes |
| CONNECT | Yes | Yes | No | No | No |
| OPTIONS | No | Yes | Yes | Yes | No |
| TRACE | No | Yes | Yes | Yes | No |
| PATCH | Yes | Yes | No | No | Yes |
curl -H "Content-Type: application/json" -X POST -d '{"text": "test2"}' localhost:3001/todo
curl -H "Content-Type: application/json" -X PUT -d '{"id": 1, "done": true}' localhost:3001/todo
curl -H "Content-Type: application/json" -X POST -d '{"ids": [1,2,3]}' localhost:3001/todos-delete
Integrate todolist with backend


--- layout: post title: Compensation Code date: 2009-04-21 01:23:59.000000000 -06:00 type: post published: true status: publish categories: [] tags: [] meta: _gcid: '81' _gcuser: Vladimir Gitlevich content_type: blog _bitly_trim: http://dddcommunity.org/?p=63 author: login: Vladimir Gitlevich email<EMAIL_ADDRESS>display_name: Vladimir Gitlevich first_name: Vladimir Gitlevich last_name: '' ---


Home
Previous Workouts
Choose Your Workout:
See Saved Workout
Abs
Arms
Back
Calves
Chest
Legs
Shoulders
Submit


PXL.js is a WebGL Engine. It is simple to use and has various functions for the most common processes you need to code when writing WebGL.
PXL.js has the following features:
You can clone from github, download using npm or by downloading the latest zip. Take a look at the documentation to get a feel for how PXLjs works. From there, you can take a look at the examples and their code to see how it fits together. There is also the API documentation that describes all the various functions.
An early version of PXL.js is used to render the Equatorie at Cambridge Unviersity.
The current version of PXL.js is 0.1.0. There are many more features I'd like to add including:


{% extends 'app/base.html' %} {% load static %} {% block content %} ASCII-Generator Upload an image file to convert it to ASCII art {# https://codepen.io/mmhuntsberry/pen/QowZwR #} UPLOAD IMAGE {% csrf_token %} DRAG FILE HERE OR BROWSE 12px 1 2 3 4 {% csrf_token %} Options: Columns Brightness % Contrast % ...or try the text to ASCII Type text to convert it to ASCII art {% csrf_token %} Multi-line mode ...or try the image to ASCII {% endblock %} {% block body_end %} {% endblock %}
UPLOAD IMAGE
Options:
...or try the text to ASCII
...or try the image to ASCII


Launch Group
The user can launch multiple applications at the same time or in sequential order. This is made possible by the launch configuration type: Launch Group.
Launches tab
The Launches tab lets you add and delete launch configurations to the group. It also allows you to temporarily disable, re-order and edit properties of the elements in the group.
| Component | Description |
|---|---|
| Name | Displays the name of the launch configuration and a checkbox for enabling or disabling the configuration. |
| Mode | Displays the mode the configuration will run in when the group is launched. |
| Action | Displays the optional action that will be carried after the configuration is launched. |
| Up | Move selected configuration(s) up |
| Down | Move selected configuration(s) down |
| Add... | Opens a dialog to add a new configuration. |
| Edit... | Opens a dialog to edit values for configuration(s). |
| Remove | Removes selected configuration(s) from the list. |
Common tab
The Common tab lets you select where the configuration is stored, see Common tab reference page for details.Add and Edit launch configuration Dialog
| Component | Description |
|---|---|
| Launch Mode | The Launch Mode combobox at the top of the dialog serves a dual purpose.
For example, when the 'debug' mode is selected, (1) only launch configurations that support being invoked in 'debug' mode appear. Also, (2) when the launch group is invoked, that particular child launch configuration will be invoked in 'debug' mode. |
| Filter input | Type in filter input to filter list of configurations by name |
| Configurations tree | Lists all available launch configurations for the selected Launch Mode, filtered by Filter input. |
| Use default mode when launching |
This checkbox acts as a sort of override to whatever mode is set in the Launch Mode
combobox. Checking this option indicates that the child launch configuration
should be launched in the mode used to initiate the launch group launch. This
needs some clarification. First, realize that a launch configuration can be
invoked from either the 'Debug' or the 'Run' actions (and some comparable
'profile' action in certain Eclipse configurations/products). That means, the
launch group itself can be launched either in debug or run mode. When you check
the Use default...checkbox, you're saying: launch this particular child configuration in the mode that the parent (launch group) is launched with.If you do not have that checkbox checked, then the child configurations will be invoked in whatever mode each individual child is configured with.
Note that |
| Post launch action |
There are several actions available that control what should be done after each launch:
|


{% macro displayNewsList(news_list) %} {% for news in news_list %}
{{news.description}}
Written by: {{news.author}}
Published On: {{news.publishedAt}}


Description: Remove a single class, multiple classes, or all classes from each element in the set of matched elements.
className: String One or more space-separated classes to be removed from the class attribute of each matched element.
function(index, class): Function() A function returning one or more space-separated class names to be removed. Receives the index position of the element in the set and the old class value as arguments.
If a class name is included as a parameter, then only that class will be removed from the set of matched elements. If no class names are specified in the parameter, all classes will be removed.
More than one class may be removed at a time, separated by a space, from the set of matched elements, like so:
$('p').removeClass('myClass yourClass')
This method is often used with .addClass()
to switch elements' classes from one to another, like so:
$('p').removeClass('myClass noClass').addClass('yourClass');
Here, the myClass
and noClass
classes are removed from all paragraphs, while yourClass
is added.
To replace all existing classes with another class, we can use .attr('class', 'newClass')
instead.
As of jQuery 1.4, the .removeClass()
method allows us to indicate the class to be removed by passing in a function.
$('li:last').removeClass(function() {
return $(this).prev().attr('class');
});
This example removes the class name of the penultimate

from the last

.
<!DOCTYPE html>

Hello

and

then

Goodbye

<!DOCTYPE html>

Hello

and

then

Goodbye

<!DOCTYPE html>

Hello

and

then

Goodbye


Btree bloat query - part 4
Thanks to the various PostgreSQL environments we have under monitoring at Dalibo, these Btree bloat estimation queries keeps challenging me occasionally because of statistics deviation…or bugs.
For people who visit this blog for the first time, don’t miss the three previous parts, stuffed with some interesting infos about these queries and BTree indexes: part 1, part 2 and part 3.
For people in a hurry, here are the links to the queries:
- for 7.4: https://gist.github.com/ioguix/dfa41eb0ef73e1cbd943
- for 8.0 and 8.1: https://gist.github.com/ioguix/5f60e24a77828078ff5f
- for 8.2 and more: https://gist.github.com/ioguix/c29d5790b8b93bf81c27
Columns has been ignored
In two different situations, some index fields were just ignored by the query:
- after renaming the field in the table
- if the index field was an expression
I cheated a bit for the first fix, looking at psql’s answer to this question
(thank you -E
).
The second one was an easy fix, but sadly only for version 8.0 and more. It seems to me there’s no solution for 7.4.
These bugs have the same results: very bad estimation. An index field is ignored in both cases, s the bloat sounds much bigger with the old version of the query. Here is a demo with an index on expression:
Most of this 65% bloat estimation are actually the data of the missing field. The result is much more coherent with the latest version of the query for a freshly created index, supposed to have around 10% of bloat as showed in the 2nd query:
Wrong estimation for varlena types
After fixing the query for indexes on expression, I noticed some negative bloat estimation for the biggest ones: the real index was smaller than the estimated one!
In this version of the query, I am computing and adding the headers length of varlena types (text, bytea, etc) to the statistics(see part 3). I was wrong.
Taking the “text” type as example, PostgreSQL adds a one byte header to the
value if it is not longer than 127, and a 4 bytes one for bigger ones. Looking
closer to the statistic values because of this negative bloat, I realized that
the headers was already added to them. As a demo, take a md5
string of 32
bytes long. In the following results, we can see the average length from
pg_stats
is 32+1
for one md5, and 4*32+4
for a string of 4 concatenated
md5, supposed to be 128 byte long:
After removing this part of the query, stats for test3_i_md5_idx
are much better:
This is a nice bug fix AND one complexity out of the query. Code simplification is always a good news :)
Adding a bit of Opaque Data
When studying the Btree layout, I forgot about one small non-data area in index pages: the “Special space”, aka. “Opaque Data” in code sources. The previous bug took me back on this doc page where I remembered I should probably pay attention to this space.
This is is a small space on each pages reserved to the access method so it can store whatever it needs for its own purpose. As instance, in the case of a Btree index, this “special space” is 16 bytes long and used (among other things) to reference both siblings of the page in the tree. Ordinary tables have no opaque data, so no special space (good, I ‘ll not have to fix this bug in my Table bloat estimation query).
This small bug is not as bad for stats than previous ones, but fixing it
definitely help the bloat estimation accuracy. Using the previous demo on
test3_i_md5_idx
, here is the comparison of real bloat, estimation without
considering the special space and estimation considering it:
This is only an approximative 5% difference for the estimated size of this particular index.
Conclusion
I never mentioned it before, but these queries are used in check_pgactivity (a nagios plugin for PostgreSQL), under the checks “table_bloat” and “btree_bloat”. The latest version of this tool already include these fixes. I might write an article about “check_pgactivity” at some point.
As it is not really convenient for most of you to follow the updates on my gists, I keep writing here about my work on these queries. I should probably add some version-ing on theses queries now and find a better way to communicate about them at some point.
As a first step, after a discussion with (one of?) the author of pgObserver during the latest pgconf.eu, I added these links to the following PostgreSQL wiki pages:
- https://wiki.postgresql.org/wiki/Index_Maintenance#New_query
- https://wiki.postgresql.org/wiki/Show_database_bloat
Cheers, happy monitoring, happy REINDEX-ing!
Comments Leave a comment by email or Disqus
Note: I only publish your name/pseudo, mail subject and content. I will NOT publish your email address.
Thanks a lot!
I’ve just updated PgObserver also to use the latest from “check_pgactivity” (https://github.com/zalando/PGObserver/commit/ac3de84e71d6593f8e64f68a4b5eaad9ceb85803).
Cheers,
Kaarel


Lorem ipsum dolor sit amet, consectetur adipisicing elit. Accusamus alias aliquid delectus, dolor doloremque enim eos est fugit inventore ipsam iure laudantium molestiae.
Address
Near Zuhu Chopati Mumbai, India
Phone Number
+91-9967500109
<EMAIL_ADDRESS>Let us know
We would love to hear from, please drop us a line if you have any query.


FOREX Aggregator
I want to exchange
USD
INR
EUR
AUD
GBP
to
INR
USD
EUR
AUD
GBP
Compare providers
Past Rates and Trends
Provider
Online Fees
Rate
Recived amount
Duration (HH:MM:SS)
Please Select a Combination


Great service is really about being ‘Easy to do business with’. That’s how we see it. It’s about removing headaches and hassles. Doing the simple things well and being prepared to go even further than the competition.
You can manage your account, search products, request quotes and pay invoices online at. Text messages notify you when your stock is ready for pick up to help you with time management.
We can source non stock or standard products specific to the customers’ requirements.
Lorem ipsum dolor sit amet, consectetur adipisicing elit. Reprehenderit maiores nam, aperiam minima assumenda voluptate velit.
Lorem ipsum dolor sit amet, consectetur adipisicing elit. Reprehenderit maiores nam, aperiam minima assumenda voluptate velit.
Some of the world's best brands can only be found at Reece. This is a reflection of Reece's international reputation for professionalism, quality and marketing ability. Reece has achieved outstanding results with a range of exclusive products in the retail, trade and specialised markets.
We Work for you
checkout our latest projects
Who we are and what we do
Contact Us and stick together


WARNING: Do not ever try this at home. The following process can lead to serious damages, injuries, or even death. I will not be responsible for any losses, injuries, or damages resulting from not following this message. You have been warned.


flixel.util.FlxColorUtil
- type
- class
Class containing a set of functions for color manipulation and color harmony.
Static Methods
- parameters
Color
The color to get the String representation for
- returns
- A string of length 10 characters in the format 0xAARRGGBB
- parameters
Color
The Color to convert
- returns
- The color without its alpha component
- parameters
Color
The color to get the String representation for
- returns
- A string of length 10 characters in the format 0xAARRGGBB
- parameters
H
Hue degree, between 0 and 359
S
Saturation, between 0.0 (grey) and 1.0
V
Value, between 0.0 (black) and 1.0
Alpha
Alpha value to set per color (between 0 and 255)
- returns
- 32-bit ARGB color value (0xAARRGGBB)
- parameters
Color
The color in format 0xRRGGBB
- returns
- Object with the properties hue (from 0 to 360), saturation (from 0 to 1.0) and lightness (from 0 to 1.0, also available under .value)
- parameters
Color
Color in the format 0xAARRGGBB
Factor
The higher, the lighter! Number from 0.0 to 1.0.
- returns
- The lightened color
- parameters
Color
The color channel to get the hex value for, must be a value between 0 and 255)
- returns
- A string of length 2 characters, i.e. 255 = FF, 0 = 00
- parameters
Color
Color in the format 0xAARRGGBB
Factor
The higher, the darker! Number from 0 to 1.0.
- returns
- The darkened color
- parameters
Color
The color you want to break into components.
Results
An optional parameter, allows you to use an ARGB that already exists in memory to store the result.
- returns
- An ARGB object containing the Red, Green, Blue and Alpha values of the given color.
- parameters
Color
In the format 0xAARRGGBB
- returns
- The Alpha component of the color, will be between 0 and 255 (0 being no Alpha, 255 full Alpha)
- parameters
Color
In the format 0xAARRGGBB
- returns
- The Alpha component of the color, will be between 0 and 1 (0 being no Alpha (opaque), 1 full Alpha (transparent))
- parameters
color
The color to base the harmony on
threshold
Control how adjacent the colors will be (default +- 30 degrees)
- returns
- Object containing 3 properties: color1 (the original color), color2 (the warmer analogous color) and color3 (the colder analogous color)
- parameters
Color
In the format 0xAARRGGBB
- returns
- The Blue component of the color, will be between 0 and 255 (0 being no color, 255 full Blue)
- parameters
Red
The Red channel value (between 0 and 255)
Green
The Green channel value (between 0 and 255)
Blue
The Blue channel value (between 0 and 255)
- returns
- A native color value integer (format: 0xRRGGBB)
- parameters
Alpha
The Alpha value (between 0 and 255)
Red
The Red channel value (between 0 and 255)
Green
The Green channel value (between 0 and 255)
Blue
The Blue channel value (between 0 and 255)
- returns
- A native color value integer (format: 0xAARRGGBB)
- parameters
Color
A color value in the format 0xAARRGGBB
- returns
- String containing the 3 lines of information
- parameters
Color
The color to base the harmony on
- returns
- 0xAARRGGBB format color value
- parameters
Color
In the format 0xAARRGGBB
- returns
- The Green component of the color, will be between 0 and 255 (0 being no color, 255 full Green)
- parameters
Color
The color you want to break into components.
Results
An optional parameter, allows you to use an array that already exists in memory to store the result.
- returns
- An HSBA object containing the Red, Green, Blue and Alpha values of the given color.
- parameters
Alpha
Alpha value for each color of the color wheel, between 0 (transparent) and 255 (opaque)
- returns
- HSV color wheel as Array of Ints
- parameters
Min
The lowest value to use for each channel.
Max
The highest value to use for each channel.
Alpha
The alpha value of the returning color (default 255 = fully opaque).
- returns
- A color value in hex ARGB format.
- parameters
Color
In the format 0xAARRGGBB
- returns
- The Red component of the color, will be between 0 and 255 (0 being no color, 255 full Red)
- parameters
Color
The color to base the harmony on
Threshold
Control how adjacent the colors will be to the Complement (default +- 30 degrees)
- returns
- Object containing 3 properties: color1 (the original color), color2 (the warmer analogous color) and color3 (the colder analogous color)
- parameters
Color
The color to base the harmony on
- returns
- Object containing 3 properties: color1 (the original color), color2 and color3 (the equidistant colors)
- parameters
Color1
The first color
Color2
The second color
Steps
The amount of total steps
CurrentStep
The step the interpolated color should be on
Alpha
The alpha value you want the interpolated color to have
- returns
- The interpolated color
- parameters
Color
The first color
R2
The red value of the second color
G2
The green value of the second color
B2
The blue value of the second color
Steps
The amount of total steps
CurrentStep
The step the interpolated color should be on
Alpha
The alpha value you want the interpolated color to have
- returns
- The interpolated color
- parameters
R1
The red value of the first color
G1
The green value of the first color
B1
The blue value of the first color
R2
The red value of the second color
G2
The green value of the second color
B2
The blue value of the second color
Steps
The amount of total steps
CurrentStep
The step the interpolated color should be on
Alpha
The alpha value you want the interpolated color to have
- returns
- The interpolated color
- parameters
Alpha
How opaque the color should be, either between 0 and 1 or 0 and 255.
Red
The red component, between 0 and 255.
Green
The green component, between 0 and 255.
Blue
The blue component, between 0 and 255.
- returns
- The color as an integer
- parameters
Hue
A number between 0 and 360, indicating position on a color strip or wheel.
Saturation
A number between 0 and 1, indicating how colorful or gray the color should be. 0 is gray, 1 is vibrant.
Brightness
A number between 0 and 1, indicating how bright the color should be. 0 is black, 1 is full bright.
Alpha
How opaque the color should be, either between 0 and 1 or 0 and 255.
- returns
- The color as an integer


Arcadeacon is a flash game website unlike others. There's no signups, ads1 or anything distracting you from just playing games. We are constantly adding games, and we even have some games exclusive to this site! If you like this site, tell your friends! If you have any suggestions or game requests please contact us at<EMAIL_ADDRESS>We will add most games.


{% extends "organizing_hub_layout.html" %} {% load bootstrap3 django_bootstrap_breadcrumbs organizing_hub_tags %} {% block page_title %}Our Revolution - Request Password Reset{% endblock %} {% block breadcrumbs %} {{ block.super }} {% breadcrumb "Request Password Reset" "password_reset_done" %} {% endblock %} {% block content_heading %}Request Password Reset{% endblock %} {% block content %} {% with center_header=True %} {{ block.super }} {% endwith%}
We emailed you instructions for resetting your password, if an account exists with the email you entered. You should receive it shortly.
If you don't receive an email, please make sure you entered the correct email address and check your spam folder.


|
TCC Structure from Motion
1.0.0
Senior project on Structure from Motion for scene and camera trajectory reconstruction from monocular video
|
Classes | |
| class | ErrorMetric |
Functions | |
| def | write_to_viz_file (camera_matrix, Rs, Ts, points) |
| def | call_viz () |
| def | visualize (camera_matrix, Rs, Ts, points) |
| def | compose_rts (rel_R, rel_T, comp_R, comp_T) |
| def | translate_points_to_base_frame (comp_R, comp_T, points) |
| def | get_nan_bool_mask (input_array) |
| def | get_nan_index_mask (input_array) |
| def | get_not_nan_index_mask (input_array) |
| def | invert_reference_frame (R, T) |
| def | init_rt () |
| def | get_intersection_mask (a, b) |
| def | get_last_track_pair (tracks, masks) |
| def | points_to_cloud (points, indexes) |
| def | add_points_to_cloud (cloud, points, index_mask) |
| def | generator_copier (generator, num_copies, num_elements=None) |
Variables | |
| int | TYPE_CALIBRATION_MATRIX = 0 |
| int | TYPE_CAMERA = 1 |
| int | TYPE_POINT = 2 |
| def pipeline.utils.add_points_to_cloud | ( | cloud, | |
| points, | |||
| index_mask | |||
| ) |
Adds new points from 'points' to the cloud :param cloud: point cloud with N points as a ndarray with shape Nx3 :param points: calculated 3D points from a given set of frames :param index_mask: vector with corresponding indexes for each point in points :return:
| def pipeline.utils.call_viz | ( | ) |
Call visualizes with default csv file location
| def pipeline.utils.compose_rts | ( | rel_R, | |
| rel_T, | |||
| comp_R, | |||
| comp_T | |||
| ) |
Porperly composes two sets of rotation matrices and translation vectors :param rel_R: rotation matrix of new camera :param rel_T: translation vector of new camera :param comp_R: rotation matrix of previous camera :param comp_T: translation vector of previous camera :return: composed rotation matrix and translation vector
| def pipeline.utils.generator_copier | ( | generator, | |
| num_copies, | |||
num_elements = None |
|||
| ) |
Copies a generator multiple times up to a certain point or until it's end, whichever comes first. The generator evaluation is eager, meaning that if an infinite generator is passed without a number of elements to be copied the code will hang. :param generator: generator to be copied :param num_copies: number of copies to be generated :param num_elements: number of elements to be copied :return: list with original generator and copies
| def pipeline.utils.get_intersection_mask | ( | a, | |
| b | |||
| ) |
Calculates the intersection of two index returning only those that are present in both vectors a nd b :param a: index vector a :param b: index vector b :return: intesection between a and b
| def pipeline.utils.get_last_track_pair | ( | tracks, | |
| masks | |||
| ) |
Forms a track pair with the last two track slices. This formed pair consists of all the features that are present in both traacks. :param tracks: list of 2D feature vectors. Each vector has the shape Dx2 :param masks: list of index masks for each feature vector. Indexes refer to the position of the item in the cloud :return: track pair and pair index mask in the same structure as tracks and masks
| def pipeline.utils.get_nan_bool_mask | ( | input_array | ) |
Creates mask of booleans indicating which values are Nan/None :param input_array: feature track or point cloud :return: bool mask
| def pipeline.utils.get_nan_index_mask | ( | input_array | ) |
Creates mask with the indexes of elements that are Nan/None. :param input_array: feature track or point cloud :return: index mask
| def pipeline.utils.get_not_nan_index_mask | ( | input_array | ) |
Creates mask with the indexes of elements that are not Nan/None. :param input_array: feature track or point cloud :return: index mask
| def pipeline.utils.init_rt | ( | ) |
Creates initial rotation matrix and translation vector :return: 3x3 identity matix and vector of zeros of shape 3x1
| def pipeline.utils.invert_reference_frame | ( | R, | |
| T | |||
| ) |
Inverts rotation matrix and translation vector :param R: rotation matrix :param T: translation vector :return: inverted R and T
| def pipeline.utils.points_to_cloud | ( | points, | |
| indexes | |||
| ) |
Creates a cloud of points from a set of sparse 3D points and indexes :param points: point cloud with N points as a ndarray with shape Nx3 :param indexes: list of index masks for each feature vector. Indexes refer to the position of the item in the cloud :return: point cloud
| def pipeline.utils.translate_points_to_base_frame | ( | comp_R, | |
| comp_T, | |||
| points | |||
| ) |
Convert point from local reference frame to global's :param comp_R: camera's rotation matrix in the global reference frame :param comp_T: camera's translation vector in the global reference frame :param points: points to be converted :return: point coordinates in the global reference frame
| def pipeline.utils.visualize | ( | camera_matrix, | |
| Rs, | |||
| Ts, | |||
| points | |||
| ) |
Bundles together visualization file creation and visualizer call :param camera_matrix: calibration matrix :param Rs: list of R matrices :param Ts: list of T vectors :param points: point cloud with N points as a ndarray with shape Nx3
| def pipeline.utils.write_to_viz_file | ( | camera_matrix, | |
| Rs, | |||
| Ts, | |||
| points | |||
| ) |
Writes input information as a properly formatted csv file for visualization :param camera_matrix: calibration matrix :param Rs: list of R matrices :param Ts: list of T vectors :param points: point cloud with N points as a ndarray with shape Nx3
| int pipeline.utils.TYPE_CALIBRATION_MATRIX = 0 |
| int pipeline.utils.TYPE_CAMERA = 1 |
| int pipeline.utils.TYPE_POINT = 2 |


MIS Portfolios
{% for group in site.data.members %}
{{ group[0] }}
{% assign members_group = group[1] | sort_natural %} {% for member_json_bio in members_group %} {% include portfolio-card.html member_json_bio=member_json_bio %} {% endfor %}
{% endfor %}


Placement Details
Dell
About
Dell Inc., which operates under the brand name Dell, is an American multinational computer technology company that develops, sells, repairs, and supports computers and related products and services. Named after its founder, Michael Dell, the company is one of the largest technological corporations in the world, employing more than 145,000 people in the U.S. and around the world (Annual report 2018).
Prerequisites
70 percent or above in B.Tech, Class X and XII.
No backlogs at the time of interview
Written Round :
The Written round consists of three major sections namely General Aptitude, Verbal Ability and Programming section. General Aptitude Test, has mathematical reasoning and logical reasoning questions. Programming section contains questions from C/C++, Networks, Operating System, DBMS, Software Engineering
Our Services
- Mail
- Cloud
- Maps
- Search
- Books
- Art Project


Esther 5:13
Yet all this availeth me nothing, so long as I see Mordecai the Jew sitting at the king's gate.


We're sorry but skeleton-simple doesn't work properly without JavaScript enabled. Please enable it to continue.


A report from the International Labour Organization: 'Small Matters: Global evidence on the contribution to employment by the self-employed, micro-enterprises and SMEs', states that in high-income countries 58 per cent of total employment is from small businesses. Forbes states that, in the European Union, micro-businesses make up half of small businesses.
Kavneet Sahni, a women entrepreneur who is passionate about food, had a vision to the start her own micro enterprise. However, her journey was a bumpy ride since banks refused to give her loans. But ,she didn’t give up and pursued her dream and now clocks a turnover of over Rs. 1 crore.
Mridula Jain, born in a conservative family was asked to prioritise marriage over studies. However, she defied all odds and studied after marriage.Later, she realised that she had bigger aspirations and went on to make shawls with patterns called phulkari.She is clocking a turnover of Rs 100 crore and has over 100 retail stores across india.
Shahnaaz Hussain,the founder of world famous brand of Shahnaaz Herbals,was married and had a daughter by the age of 16.But as we say, tougher times make you tougher. She beat all the odds and went on to become world famous and was even awarded the Padma shri award.
So ladies, what are you waiting for? Be inspired and start inspiring others just like these women.With us by your side, you are twice as stronger.Let's get your business up and running!


 Package name (<vendor>/<name>) [vendor_name/project_name]: vendor_name/project_name Description []: Personal Tasks Manager Author [Username Lastname<EMAIL_ADDRESS>n to skip]: Minimum Stability []: Package Type (e.g. library, project, metapackage, composer-plugin) []: project License []: MIT Define your dependencies. Would you like to define your dependencies (require) interactively [yes]? Search for a package: autoload Found 15 packages matching autoload [0] composer/composer [1] nette/robot-loader [2] laminas/laminas-zendframework-bridge [3] classpreloader/classpreloader [4] hoa/consistency [5] typo3/class-alias-loader [6] laminas/laminas-loader [7] zendframework/zend-loader [8] roots/bedrock-autoloader [9] automattic/jetpack-autoloader [10] funkjedi/composer-include-files [11] infection/include-interceptor [12] theseer/autoload [13] aura/autoload [14] indigophp/doctrine-annotation-autoload Enter package # to add, or the complete package name if it is not listed: 0 Enter the version constraint to require (or leave blank to use the latest version): Using version ^2.1 for composer/composer Search for a package: Would you like to define your dev dependencies (require-dev) interactively [yes]? n Add PSR-4 autoload mapping? Maps namespace "VendorName\ProjectName" to the entered relative path. [src/, n to skip]: { "name": "vendor_name/project_name", "description": "Description to project", "type": "project", "require": { "composer/composer": "^2.1" }, "license": "MIT", "autoload": { "psr-4": { "VendorName\\ProjectName\\": "src/" } }, "authors": [ { "name": "Username Lastname", "email"<EMAIL_ADDRESS>} ] } Do you confirm generation [yes]? Would you like to install dependencies now [yes]? Loading composer repositories with package information Updating dependencies Lock file operations: 25 installs, 0 updates, 0 removals - Locking composer/ca-bundle (1.2.10) - Locking composer/composer (2.1.5) - Locking composer/metadata-minifier (1.0.0) - Locking composer/semver (3.2.5) - Locking composer/spdx-licenses (1.5.5) - Locking composer/xdebug-handler (2.0.2) - Locking justinrainbow/json-schema (5.2.11) - Locking psr/container (1.1.1) - Locking psr/log (1.1.4) - Locking react/promise (v2.8.0) - Locking seld/jsonlint (1.8.3) - Locking seld/phar-utils (1.1.1) - Locking symfony/console (v5.3.6) - Locking symfony/deprecation-contracts (v2.4.0) - Locking symfony/filesystem (v5.3.4) - Locking symfony/finder (v5.3.4) - Locking symfony/polyfill-ctype (v1.23.0) - Locking symfony/polyfill-intl-grapheme (v1.23.1) - Locking symfony/polyfill-intl-normalizer (v1.23.0) - Locking symfony/polyfill-mbstring (v1.23.1) - Locking symfony/polyfill-php73 (v1.23.0) - Locking symfony/polyfill-php80 (v1.23.1) - Locking symfony/process (v5.3.4) - Locking symfony/service-contracts (v2.4.0) - Locking symfony/string (v5.3.3) Writing lock file Installing dependencies from lock file (including require-dev) Package operations: 25 installs, 0 updates, 0 removals - Downloading symfony/polyfill-php80 (v1.23.1) - Downloading symfony/process (v5.3.4) - Downloading symfony/finder (v5.3.4) - Downloading symfony/polyfill-ctype (v1.23.0) - Downloading symfony/filesystem (v5.3.4) - Downloading symfony/polyfill-mbstring (v1.23.1) - Downloading symfony/polyfill-intl-normalizer (v1.23.0) - Downloading symfony/polyfill-intl-grapheme (v1.23.1) - Downloading symfony/string (v5.3.3) - Downloading symfony/service-contracts (v2.4.0) - Downloading symfony/polyfill-php73 (v1.23.0) - Downloading symfony/deprecation-contracts (v2.4.0) - Downloading symfony/console (v5.3.6) - Downloading seld/phar-utils (1.1.1) - Downloading seld/jsonlint (1.8.3) - Downloading react/promise (v2.8.0) - Downloading psr/log (1.1.4) - Downloading justinrainbow/json-schema (5.2.11) - Downloading composer/xdebug-handler (2.0.2) - Downloading composer/spdx-licenses (1.5.5) - Downloading composer/semver (3.2.5) - Downloading composer/metadata-minifier (1.0.0) - Downloading composer/ca-bundle (1.2.10) - Downloading composer/composer (2.1.5) - Installing symfony/polyfill-php80 (v1.23.1): Extracting archive - Installing symfony/process (v5.3.4): Extracting archive - Installing symfony/finder (v5.3.4): Extracting archive - Installing symfony/polyfill-ctype (v1.23.0): Extracting archive - Installing symfony/filesystem (v5.3.4): Extracting archive - Installing symfony/polyfill-mbstring (v1.23.1): Extracting archive - Installing symfony/polyfill-intl-normalizer (v1.23.0): Extracting archive - Installing symfony/polyfill-intl-grapheme (v1.23.1): Extracting archive - Installing symfony/string (v5.3.3): Extracting archive - Installing psr/container (1.1.1): Extracting archive - Installing symfony/service-contracts (v2.4.0): Extracting archive - Installing symfony/polyfill-php73 (v1.23.0): Extracting archive - Installing symfony/deprecation-contracts (v2.4.0): Extracting archive - Installing symfony/console (v5.3.6): Extracting archive - Installing seld/phar-utils (1.1.1): Extracting archive - Installing seld/jsonlint (1.8.3): Extracting archive - Installing react/promise (v2.8.0): Extracting archive - Installing psr/log (1.1.4): Extracting archive - Installing justinrainbow/json-schema (5.2.11): Extracting archive - Installing composer/xdebug-handler (2.0.2): Extracting archive - Installing composer/spdx-licenses (1.5.5): Extracting archive - Installing composer/semver (3.2.5): Extracting archive - Installing composer/metadata-minifier (1.0.0): Extracting archive - Installing composer/ca-bundle (1.2.10): Extracting archive - Installing composer/composer (2.1.5): Extracting archive 6 package suggestions were added by new dependencies, use `composer suggest` to see details. Generating autoload files 20 packages you are using are looking for funding. Use the `composer fund` command to find out more! PSR-4 autoloading configured. Use "namespace VendorName\ProjectName;" in src/ Include the Composer autoloader with: require 'vendor/autoload.php';
Para recarregar/atualizar o ambiente com o composer é preciso editar corretamente o arquivo composer.json obedecendo a seguinte estrutura para definição de namespace:
"{{{VENDOR}}}\\{{{NAMESPACE}}}\\": "src/"
"{{{VENDOR}}}\\Controllers\\": "controllers/"
Um modelo de configuração para autoload no arquivo composer.json pode ser visto a seguir::
"autoload": { "psr-4": { "{{{VENDOR}}}\\Controllers\\": "controllers/", "{{{VENDOR}}}\\Interfaces\\": "controllers/interfaces/", "{{{VENDOR}}}\\Services\\": "services/", "{{{VENDOR}}}\\Models\\": "models/", "{{{VENDOR}}}\\Models\\Interfaces\\": "models/interfaces/", "{{{VENDOR}}}\\Libraries\\": "libraries/" } },
Para atualizar o autoload com os namespace inseridos no composer.json, use:
composer dump-autoload
<?php namespace HunterCodexs\Controllers; class HunterCodexsController { public function __construct() { //Code Here ... } }


{% extends 'base.html' %} {% load static %} {% block body_part %}
The provincial budget portal contains the province level budget allocation and spending data published by the provincial government. The portal aims to create an effective use of public information to demand accountability, geared for institutional improvement, efficient services delivery, and an equitable society.


Installation
To install the plugin, execute the following command in your terminal:
cordova plugin add https://github.com/ourcodeworld/cordova-ourcodeworld-filebrowser.git
After the installation, the object OurCodeWorld.Filebrowser
will be available in your window. This object offers a file picker, folder picker, mixed folder and file picker and the file creation dialog.
Features
This plugin is a Cordova implementation for Android of the NoNonsense-FilePicker, a file/directory-picker for android.
- Can select multiple items
- Select directories or files, or both
- Create new directories in the picker
- Material theme with AppCompaqt
1. Filepicker
The filepicker property (OurCodeWorld.Filebrowser.filePicker
) is an object that contains the methods related to the filepicker.
| Property | Type | Description |
|---|---|---|
| single | Function | Start the single file picker. |
| multi | Function | Start the multi file picker. |
Single filepicker
This method (OurCodeWorld.Filebrowser.filePicker.single
) starts a native filepicker that allow you to select only 1 file.
The single method expects an object as first parameter with the following properties:
success
: a function that handles the success cordova result. The function receives as first and unique parameter an array with the paths of the selected file.error
: a function that handles the error cordova result. The function receives as first and unique parameter a string with the error description.startupPath
: [optional] a string (default value"default"
) with a predetermined start up directory. If providen, the filebrowser will start from that location (file://emulated/0/a-custom-start-path
)
The following code will initialize a single filepicker:
// Single file selector
window.OurCodeWorld.Filebrowser.filePicker.single({
success: function(data){
if(!data.length){
// No file selected
return;
}
console.log(data);
// Array with the file path
// ["file:///storage/emulated/0/360/security/file.txt"]
},
// Start in a custom directory
//startupPath:"/emulated/0/",
error: function(err){
console.log(err);
}
});
Multi filepicker
This method starts a native filepicker that allow you to select multiple files.
The multi method expects an object as first parameter with the following properties:
success
: a function that handles the success cordova result. The function receives as first and unique parameter an array with the paths of the selected files.error
: a function that handles the error cordova result. The function receives as first and unique parameter a string with the error description.startupPath
: [optional] a string (default value"default"
)with a predetermined start up directory. If providen, the filebrowser will start from that location (file://emulated/0/a-custom-start-path
)
The following code will initialize a multiple filepicker:
// Multi file picker
window.OurCodeWorld.Filebrowser.filePicker.multi({
success: function(data){
if(!data.length){
// No file selected
return;
}
console.log(data);
// Array with filepaths
// ["file:///storage/emulated/0/360/security/file.txt", "file:///storage/emulated/0/360/security/another-file.txt"]
},
// Start in a custom directory
//startupPath:"/emulated/0/",
error: function(err){
console.log(err);
}
});
2. Folderpicker
The Folderpicker property (OurCodeWorld.Filebrowser.folderPicker
) is an object that contains the methods related to the Folderpicker.
| Property | Type | Description |
|---|---|---|
| single | Function | Start the single folder picker. |
| multi | Function | Start the multi folder picker. |
Single folderpicker
This method starts a native folder browser that allow you to select only 1 folder.
The single method expects an object as first parameter with the following properties:
success
: a function that handles the success cordova result. The function receives as first and unique parameter an array with the paths of the selected folders.error
: a function that handles the error cordova result. The function receives as first and unique parameter a string with the error description.startupPath
: [optional] a string (default value"default"
)with a predetermined start up directory. If providen, the filebrowser will start from that location (file://emulated/0/a-custom-start-path
)
The following code will initialize a multiple filepicker:
// Single folder picker
window.OurCodeWorld.Filebrowser.folderPicker.single({
success: function(data){
if(!data.length){
// No folder selected
return;
}
console.log(data);
// Array with the folder path
// ["file:///storage/emulated/0/360/security"]
},
// Start in a custom directory
//startupPath:"/emulated/0/",
error: function(err){
console.log(err);
}
});
Remember that in all the methods, you can change the start location (address) of the dialog by changing the startupPath
(in case you want to set the default startup path omit the property or set the value to "default"
):
Multiple folderpicker
This method starts a native folder browser that allow you to select multiple folders.
The single method expects an object as first parameter with the following properties:
success
: a function that handles the success cordova result. The function receives as first and unique parameter an array with the paths of the selected folders.error
: a function that handles the error cordova result. The function receives as first and unique parameter a string with the error description.startupPath
: [optional] a string (default value"default"
)with a predetermined start up directory. If providen, the filebrowser will start from that location (file://emulated/0/a-custom-start-path
)
The following code will initialize a multiple filepicker:
// Multi folder selector
window.OurCodeWorld.Filebrowser.folderPicker.multi({
// Start in the Download folder of the device,
// Note that this parameter can be provide only if you're sure that the folder exists
startupPath:"/storage/emulated/0/Download",
success: function(data){
if(!data.length){
// No folder selected
return;
}
console.log(data);
// Array with filepaths
// ["file:///storage/emulated/0/360/security/file.txt", "file:///storage/emulated/0/360/security/another-file.txt"]
},
error: function(err){
console.log(err);
}
});
3. Mixed picker
The mixedPicker property OurCodeWorld.Filebrowser.mixedPicker
is a function that starts a mixed file and folder picker (allow you to choose files and folders at time).
The config argument (first argument) is an object that can have the following properties:
success
: a function that handles the success cordova result. The function receives as first and unique parameter an array with the selected files and folders.error
: a function that handles the error cordova result. The function receives as first and unique parameter a string with the error description.startupPath
: [optional] a string (default value"default"
)with a predetermined start up directory. If providen, the filebrowser will start from that location (file://emulated/0/a-custom-start-path
)
// Start mixed picker
OurCodeWorld.Filebrowser.mixedPicker({
success: function(data) {
if(!data.length){
// No folder or files selected
return;
}
console.log(data);
// Array with the selected files and folders
// ["file:///storage/emulated/0/myfile.txt","file:///storage/emulated/0/folder", "file:///storage/emulated/0/other-file.txt"]
},
error: function(e) {
console.error("Error calling Hello Plugin",e);
}
});
4. Create file dialog
The create file dialog provides an easy native view to create a file in the storage of the device.
The config argument (first argument) is an object that can have the following properties:
success
: a function that handles the success cordova result. The function receives as first and unique parameter an array with the "full path of the created file"error
: a function that handles the error cordova result. The function receives as first and unique parameter a string with the error description.startupPath
: [optional] a string (default value"default"
)with a predetermined start up directory. If providen, the filebrowser will start from that location (file://emulated/0/a-custom-start-path
)
OurCodeWorld.Filebrowser.createFileDialog({
success: function(data) {
if(!data.length){
// No file was created
return;
}
console.log(data);
// Array with the imaginary created file (is up to you how to create it)
// ["file:///storage/emulated/0/myfile.txt"]
},
error: function(e) {
console.error("Error calling Hello Plugin",e);
}
});


NRGY
Sign out
Dashboard
Missions
Regions
Saved reports
Payment History
Regions
Time Span
Week
Month
Year
Share
Export


Exception : Java.net.UnknownHostException using httpGet on Android
String requestTpServer = "www.google.com"; HttpClient client = new DefaultHttpClient(); HttpResponse response = null ; try { HttpGet get = new HttpGet(requestToServer); response = client.execute(getm); ///Problem here } catch (ClientProtocolException e) { e.printStackTrace(); } catch (IOException e) { e.printStackTrace(); } String res = response.toString(); I have already set <uses-permission android:name="android.permission.INTERNET" /> and also run String requestTpServer = "www.google.com"; in android emulater browser thanks -- You received this message because you are subscribed to the Google Groups "Android Developers" group. To post to this group, send email to<EMAIL_ADDRESS>To unsubscribe from this group, send email to<EMAIL_ADDRESS>For more options, visit this group at http://groups.google.com/group/android-developers?hl=en


The most sophisticated airline sim ever made.
Track pax movement throughout your network,
join an alliance and become the Ultimate airline!
100% free and open source! The most sophisticated airline sim ever made.
Track pax movement throughout your network,
join an alliance and become the Ultimate airline!
100% free and open source!
Track pax movement throughout your network,
join an alliance and become the Ultimate airline!
100% free and open source! The most sophisticated airline sim ever made.
Track pax movement throughout your network,
join an alliance and become the Ultimate airline!
100% free and open source!
- General
Lock
0
- {{msg}}
- {{msg}}
- World
- Routes
- Country
- Airplane
- Office
- Bank
- Oil
- Rivals
- Ranking
- Alliance
- Log
Current Details
From:
To:
Flight Code:
Distance:
Airplane:
Price:
Overall Quality:
Overall quality is determined by:
- Fleet Age per Route
- Service Star level per route
- Company wide Service Quality
- Fleet Age per Route
- Service Star level per route
- Company wide Service Quality
Capacity (Y/J/F):
()
Edit
Cancel
History
Price:
Capacity (Y/J/F):
Load Factor:
Profit:
Revenue:
Fuel Cost:
Crew Cost:
Airport Fees:
Depreciation:
Compensation:
Lounge Cost:
Service Supplies:
Maintenance:
Flight Delays:
Flight Cancellation:
View Passenger Map
Direct Competitions
Price
Capacity
Quality
Freq.
Plan Route Details
From:
To:
Flight Code:
Mutual Relationship:
Distance:
Direct Demand (Y/J/F):
Direct Competitions:
Airline
Price
Capacity
Quality
Freq.
Setup Cost:
Airplane Model (available):
Flight Duration:
Price (Y/J/F):
Available Airplanes:
Purchase airplane Or assign airplane to this airport
Flight Frequency:
Increase/decrease the flight frequency by selecting/deselecting the airplane icons.
Take note that the max frequency is limited by airplanes assigned and time slots allocated by both the departure and destination airports.
Once flight service is established, airports will eventually open up more slots. Check regularly to increase flight frequency
Take note that the max frequency is limited by airplanes assigned and time slots allocated by both the departure and destination airports.
Once flight service is established, airports will eventually open up more slots. Check regularly to increase flight frequency
Airplane
Seats Config
Flight Frequency
Total flight(s) per week (EXCEEDS LIMIT)
Max Flight Freuency is determined by the lowest number below:
General max frequency allowed per Route
Current slots by Departing Airport
Current slots by Destination Airport
General max frequency allowed per Route
Current slots by Departing Airport
Current slots by Destination Airport
Capacity (Y/J/F):
()
Service Level:
Create
Update
Delete
Cancel
Airplane Model Details
Model:
Max Capacity:
Max Flying Range:
Fuel Burn:
Category:
Req. Airport Scale:
Speed:
Max Lifespan:
Country:
Purchase Price:
Delivery Time:
Purchase
Inventory
Config


Industrial Engineer
Knoxville, USA
<EMAIL_ADDRESS>+1<PHONE_NUMBER>
Skills
Excel
Solid Works
CAD
C++
Languages
English
Portuguese
Spanish
German
Assigned the task of developing a Kan-Ban system from scratch. Designed and ordered all the components and with the assistance of technicians and my supervisors, was able to impact the efficiency of the production line in a short period of time.
Part of a team of engineers and technicians that were responsible for expending the production line. My role was to improve previous welding tables designs (spot-welding, door and parts table) and to create a new design for the support of the welding machines. Result: All new production lines will utilize the redesigned welding table along with the welding support that is now compatible to every welding machine used in the plant.
Warehouse asssitant, Waiter, English tutor, Construction and Valet.
Bachelor Degree - Industrial Engineering
Industrial Engineering Page University PageCommunity College - Science/Math
High School