Extract river discharges from the supplied river positions for the FVCOM grid in Mobj. get_FVCOM_rivers(Mobj, dist_thresh) DESCRIPTION: For the positions in Mobj.rivers.positions, find the nearest unstructured grid node and extract the river discharge from Mobj.rivers.discharge. If dist_thresh is specified, the river positions must fall within the specified distance. If multiple rivers are assigned to the same node, their discharges are summed. The resulting river name is generated from the contributing rives, separated by a hyphen. INPUT: Mobj - MATLAB mesh object containing: * have_lonlat - boolean to check for spherical coordinates. * lon, lat - positions for the unstructured grid. * tri - triangulation table for the unstructured grid. * nVerts - number of nodes in the grid. * read_obc_nodes - open boundary node IDs. * rivers - river data struct with the following fields: - year - start year of the river data time series. - positions - river positions in lon, lat. - names - list of river names (whose order must match the positions in xy). - discharge - river discharge data (again, order of columns must match the positions in Mobj.rivers.positions). dist_thresh - [optional] maximum distance away from a river node beyond which the search for an FVCOM node is abandoned. Units in degrees. OUTPUT: Mobj.river_flux - volume flux at the nodes within the model domain. Mobj.river_nodes - node IDs for the rivers. At the moment, these are point sources only. Eventually, some rivers may have to be split over several nodes. Mobj.river_names - river names which fall within the model domain. For rivers where the discharge has been summed, the name is compoud, with each contributing name separated by a hyphen (-). Mobj.river_time - time series for the river discharge data EXAMPLE USAGE: Mobj = get_FVCOM_rivers(Mobj, 0.025) Author(s): Pierre Cazenave (Plymouth Marine Laboratory) Karen Amoudry (National Oceanography Centre, Liverpool) Revision history: 2013-03-27 - First version. 2013-04-15 - Removed the code to load the positions and discharge data into separate functions so that this function can be purely about finding the closest locations and the summing of discharges (if necessary). The downside is the order of the discharges (columns) must match the position arrays. 2013-05-21 - Add check to avoid setting nodes as river nodes when that node is part of only one element. If this is not added, then the model fills up the element without moving the water out of that element, eventually leading to a crash, which is obviously not ideal. The fix searches for another node in the element which is part of at least two elements, thereby avoiding the "element filling" issue. Also updated the help to list all the required fields in the Mobj. 2013-12-10 - Change the unique call to preserve the order by replacing 'first' with 'stable'. This requires a relatively modern MATLAB (post-2011b). 2014-05-20 Set boolean flag to true to indicate rivers and add number of fields to the Mobj. ==========================================================================
0001 function Mobj = get_FVCOM_rivers(Mobj, dist_thresh) 0002 % Extract river discharges from the supplied river positions for the FVCOM 0003 % grid in Mobj. 0004 % 0005 % get_FVCOM_rivers(Mobj, dist_thresh) 0006 % 0007 % DESCRIPTION: 0008 % For the positions in Mobj.rivers.positions, find the nearest 0009 % unstructured grid node and extract the river discharge from 0010 % Mobj.rivers.discharge. If dist_thresh is specified, the river positions 0011 % must fall within the specified distance. If multiple rivers are 0012 % assigned to the same node, their discharges are summed. The resulting 0013 % river name is generated from the contributing rives, separated by a 0014 % hyphen. 0015 % 0016 % INPUT: 0017 % Mobj - MATLAB mesh object containing: 0018 % * have_lonlat - boolean to check for spherical coordinates. 0019 % * lon, lat - positions for the unstructured grid. 0020 % * tri - triangulation table for the unstructured grid. 0021 % * nVerts - number of nodes in the grid. 0022 % * read_obc_nodes - open boundary node IDs. 0023 % * rivers - river data struct with the following fields: 0024 % - year - start year of the river data time series. 0025 % - positions - river positions in lon, lat. 0026 % - names - list of river names (whose order must match the 0027 % positions in xy). 0028 % - discharge - river discharge data (again, order of columns 0029 % must match the positions in Mobj.rivers.positions). 0030 % dist_thresh - [optional] maximum distance away from a river node beyond 0031 % which the search for an FVCOM node is abandoned. Units in degrees. 0032 % 0033 % OUTPUT: 0034 % Mobj.river_flux - volume flux at the nodes within the model domain. 0035 % Mobj.river_nodes - node IDs for the rivers. At the moment, these are 0036 % point sources only. Eventually, some rivers may have to be split 0037 % over several nodes. 0038 % Mobj.river_names - river names which fall within the model domain. For 0039 % rivers where the discharge has been summed, the name is compoud, 0040 % with each contributing name separated by a hyphen (-). 0041 % Mobj.river_time - time series for the river discharge data 0042 % 0043 % EXAMPLE USAGE: 0044 % Mobj = get_FVCOM_rivers(Mobj, 0.025) 0045 % 0046 % Author(s): 0047 % Pierre Cazenave (Plymouth Marine Laboratory) 0048 % Karen Amoudry (National Oceanography Centre, Liverpool) 0049 % 0050 % Revision history: 0051 % 2013-03-27 - First version. 0052 % 2013-04-15 - Removed the code to load the positions and discharge data 0053 % into separate functions so that this function can be purely about 0054 % finding the closest locations and the summing of discharges (if 0055 % necessary). The downside is the order of the discharges (columns) must 0056 % match the position arrays. 0057 % 2013-05-21 - Add check to avoid setting nodes as river nodes when that 0058 % node is part of only one element. If this is not added, then the model 0059 % fills up the element without moving the water out of that element, 0060 % eventually leading to a crash, which is obviously not ideal. The fix 0061 % searches for another node in the element which is part of at least two 0062 % elements, thereby avoiding the "element filling" issue. Also updated 0063 % the help to list all the required fields in the Mobj. 0064 % 2013-12-10 - Change the unique call to preserve the order by replacing 0065 % 'first' with 'stable'. This requires a relatively modern MATLAB 0066 % (post-2011b). 0067 % 2014-05-20 Set boolean flag to true to indicate rivers and add number 0068 % of fields to the Mobj. 0069 % 0070 %========================================================================== 0071 0072 subname = 'get_FVCOM_rivers'; 0073 0074 global ftbverbose 0075 if ftbverbose 0076 fprintf('\nbegin : %s \n', subname) 0077 end 0078 0079 % Check inputs 0080 if ~Mobj.have_lonlat 0081 error('Require unstructured grid positions in lon/lat format to compare against supplied river positions.') 0082 end 0083 0084 % Separate the inputs into separate arrays. 0085 fvcom_name = Mobj.rivers.names; 0086 fvcom_xy = Mobj.rivers.positions; 0087 polcoms_flow = Mobj.rivers.discharge; 0088 0089 % We have to be careful because POLCOMS has duplicate river names. 0090 % 0091 % "This has made a lot of people very angry and has been widely regarded 0092 % as a bad move." 0093 % 0094 % For duplicates, we need, therefore, to work out a way to handle them 0095 % elegantly. We will assume that rivers with the same name are close to one 0096 % another. As such, we'll sum their discharges. 0097 [~, di] = unique(fvcom_name, 'stable'); % stable preserves order. 0098 fv_dupes = 1:length(fvcom_name); 0099 fv_dupes(di) = []; % index of duplicates (does this work with more than two?) 0100 0101 % Iterate through the list of duplicates and clear them out in the names, 0102 % positions and discharge. We have to ensure that the order of the 0103 % deduplicated positions and discharge are the same, otherwise we'll end up 0104 % with the wrong discharge for a given river position, which would be bad. 0105 for i = 1:length(fv_dupes) 0106 dup_name = fvcom_name(fv_dupes(i)); 0107 didx = strmatch(dup_name, fvcom_name, 'exact'); 0108 0109 % Sum the duplicate rivers' data. 0110 dup_discharge = sum(polcoms_flow(:, didx), 2); 0111 0112 % Remove the original values and put the summed data at the end. 0113 polcoms_flow(:, didx) = []; 0114 polcoms_flow = [polcoms_flow, dup_discharge]; 0115 0116 % Now remove the duplicates from the FVCOM data. 0117 fvcom_name{length(fvcom_name) + 1} = fvcom_name{fv_dupes(i)}; 0118 fvcom_name(didx) = []; 0119 fvcom_xy = [fvcom_xy; fvcom_xy(fv_dupes(i), :)]; 0120 fvcom_xy(didx, :) = []; 0121 end 0122 0123 % Get number of times and rivers from the deduplicated data. 0124 fv_nr = length(fvcom_name); 0125 [pc_nt, ~] = size(polcoms_flow); 0126 0127 clear didx dup_discharge 0128 0129 0130 % Check each location in the FVCOM rivers file against the grid in Mobj and 0131 % for the indices within the dist_thresh, extract the relevant time series 0132 % data. 0133 0134 vc = 0; % valid FVCOM boundary node counter 0135 0136 % We need to find the unstructured grid boundary nodes and exclude the open 0137 % boundary nodes from them. This will be our list of potential candidates 0138 % for the river nodes (i.e. the land coastline). 0139 [~, ~, ~, bnd] = connectivity([Mobj.lon, Mobj.lat], Mobj.tri); 0140 boundary_nodes = 1:Mobj.nVerts; 0141 boundary_nodes = boundary_nodes(bnd); 0142 coast_nodes = boundary_nodes(~ismember(boundary_nodes, [Mobj.read_obc_nodes{:}])); 0143 tlon = Mobj.lon(coast_nodes); 0144 tlat = Mobj.lat(coast_nodes); 0145 0146 fv_obc = nan; 0147 fvcom_names = cell(0); 0148 fv_riv_idx = nan; 0149 0150 for ff = 1:fv_nr 0151 % Find the open boundary node closest to this river. 0152 fv_dist = sqrt( ... 0153 (fvcom_xy(ff, 1) - Mobj.lon(coast_nodes)).^2 + ... 0154 (fvcom_xy(ff, 2) - Mobj.lat(coast_nodes)).^2); 0155 [c, idx] = min(fv_dist); 0156 if c > dist_thresh && dist_thresh ~= -1 % -1 is for no distance check 0157 if ftbverbose 0158 fprintf('\tskipping river %s (%f, %f)\n', fvcom_name{ff}, fvcom_xy(ff, 1), fvcom_xy(ff, 2)) 0159 end 0160 continue 0161 else 0162 if ftbverbose 0163 fprintf('candidate river %s found (%f, %f)... ', fvcom_name{ff}, fvcom_xy(ff, 1), fvcom_xy(ff, 2)) 0164 end 0165 end 0166 0167 vc = vc + 1; 0168 0169 % We need to make sure the element in which this node occurs does not 0170 % have two land boundaries (otherwise the model sometimes just fills up 0171 % that element without releasing the water into the adjacent element). 0172 0173 % Find the other nodes which are joined to the node we've just found. 0174 % We don't need the column to get the other nodes in the element, only 0175 % the row is required. 0176 [row, ~] = find(Mobj.tri == coast_nodes(idx)); 0177 0178 if length(row) == 1 0179 % This is a bad node because it is a part of only one element. The 0180 % rivers need two adjacent elements to work reliably (?). So, we 0181 % need to repeat the process above until we find a node that's 0182 % connected to two elements. We'll try the other nodes in the 0183 % current element before searching the rest of the coastline (which 0184 % is computationally expensive). 0185 0186 % Remove the current node index from the list of candidates (i.e. 0187 % leave only the two other nodes in the element). 0188 mask = Mobj.tri(row, :) ~= coast_nodes(idx); 0189 n_tri = Mobj.tri(row, mask); 0190 0191 % Remove values which aren't coastline values (we don't want to set 0192 % the river node to an open water node). 0193 n_tri = intersect(n_tri, coast_nodes); 0194 0195 % Of the remaining nodes in the element, find the closest one to 0196 % the original river location (in fvcom_xy). 0197 [~, n_idx] = sort(sqrt( ... 0198 (fvcom_xy(ff, 1) - Mobj.lon(n_tri)).^2 ... 0199 + (fvcom_xy(ff, 2) - Mobj.lon(n_tri)).^2)); 0200 0201 [row_2, ~] = find(Mobj.tri == n_tri(n_idx(1))); 0202 if length(n_idx) > 1 0203 [row_3, ~] = find(Mobj.tri == n_tri(n_idx(2))); 0204 end 0205 % Closest first 0206 if length(row_2) > 1 0207 idx = find(coast_nodes == n_tri(n_idx(1))); 0208 % The other one (only if we have more than one node to consider). 0209 elseif length(n_idx) > 1 && length(row_3) > 1 0210 idx = find(coast_nodes == n_tri(n_idx(2))); 0211 % OK, we need to search across all the other coastline nodes. 0212 else 0213 % TODO: Implement a search of all the other coastline nodes. 0214 % My testing indicates that we never get here (at least for the 0215 % grids I've tested). I'd be interested to see the mesh which 0216 % does get here... 0217 continue 0218 end 0219 0220 end 0221 0222 % Add it to the list of valid rivers 0223 fv_obc(vc) = coast_nodes(idx); 0224 0225 % We are assuming that the river discharge data array y-dimension is 0226 % ordered the same as the positions in fvcom_xy. If they are not, then 0227 % the discharges for the rivers will be incorrect (i.e. you might put 0228 % the Severn discharge somewhere in the Baltic). 0229 fvcom_names{vc} = fvcom_name{ff}; 0230 fv_riv_idx(vc) = ff; 0231 fv_flow(:, vc) = polcoms_flow(:, ff); 0232 if ftbverbose 0233 fprintf('added (%f, %f).\n', Mobj.lon(fv_obc(vc)), Mobj.lat(fv_obc(vc))) 0234 end 0235 end 0236 0237 % Now we've got a list and some of the nodes will be duplicates. Sum the 0238 % discharge values assigned to those nodes. 0239 fv_uniq_obc = unique(fv_obc); 0240 0241 fv_uniq_flow = nan(pc_nt, length(fv_uniq_obc)); 0242 fv_uniq_names = cell(length(fv_uniq_obc), 1); 0243 0244 fv_idx = 1:length(fvcom_names); 0245 for nn = 1:length(fv_uniq_obc) 0246 0247 dn = fv_idx(fv_obc == fv_uniq_obc(nn)); 0248 0249 fv_uniq_flow(:, nn) = sum(fv_flow(:, dn), 2); 0250 % Concatenate the river names so we know at least which rivers' 0251 % discharges have been summed. 0252 s = fvcom_names(dn); 0253 s = [sprintf('%s-', s{1:end-1}, s{end})]; 0254 fv_uniq_names{nn} = s(1:end-1); % lose the trailing -. 0255 0256 end 0257 0258 % Assign the relevant arrays to the Mobj. 0259 Mobj.river_nodes = fv_uniq_obc; 0260 Mobj.river_flux = fv_uniq_flow; 0261 Mobj.river_names = fv_uniq_names; 0262 Mobj.have_rivers = true; 0263 Mobj.nRivers = length(fv_uniq_obc); 0264 0265 % Create a Modified Julian Day time series starting at January 1st for the 0266 % year in Mobj.rivers.year. 0267 rtimes = datevec( ... 0268 datenum([Mobj.rivers.year, 1, 1, 0, 0, 0]): ... 0269 datenum([Mobj.rivers.year, 1, 1, 0, 0, 0]) + pc_nt - 1 ... 0270 ); 0271 Mobj.river_time = nan(pc_nt, 1); 0272 for tt = 1:pc_nt 0273 Mobj.river_time(tt) = greg2mjulian( ... 0274 rtimes(tt, 1), rtimes(tt, 2), rtimes(tt, 3), ... 0275 rtimes(tt, 4), rtimes(tt, 5), rtimes(tt, 6) ... 0276 ); 0277 end 0278 0279 % Figure to check what's going on with identifying river nodes 0280 % figure 0281 % plot(fvcom_xy(:, 1), fvcom_xy(:, 2), 'o', 'MarkerFaceColor', 'b') 0282 % hold on 0283 % plot(Mobj.lon(bnd), Mobj.lat(bnd), 'go', 'MarkerFaceColor', 'g') 0284 % axis('equal', 'tight') 0285 % plot(Mobj.lon(coast_nodes), Mobj.lat(coast_nodes), 'ro') 0286 % plot(Mobj.lon(Mobj.river_nodes), Mobj.lat(Mobj.river_nodes), 'ko', 'MarkerFaceColor', 'k') 0287 % text(Mobj.lon(Mobj.river_nodes) + 0.025, Mobj.lat(Mobj.river_nodes) + 0.025, Mobj.river_names) 0288 % axis([min(Mobj.lon), max(Mobj.lon), min(Mobj.lat), max(Mobj.lat)]) 0289 % legend('POLCOMS nodes', 'Grid boundary', 'Land nodes', 'Selected nodes', 'Location', 'NorthOutside', 'Orientation', 'Horizontal') 0290 % legend('BoxOff') 0291 0292 0293 if ftbverbose 0294 fprintf(['end : ' subname '\n']) 0295 end


Move the Destinations from my home to yours, and see the shape below
Exemplifies why planes appear to travel in non-linear routes when covering long distances. Data and 3D sketch below.


Id: 344
Name: Tammy Guetermann
Status: Alive
Species: Human
Type:
Gender: Female
OriginName: Earth (Replacement Dimension)
OriginUrl: https://rickandmortyapi.com/api/location/20
LocationName: unknown
LocationUrl:
Image: https://rickandmortyapi.com/api/character/avatar/344.jpeg
Episode: ['https://rickandmortyapi.com/api/episode/11', 'https://rickandmortyapi.com/api/episode/16', 'https://rickandmortyapi.com/api/episode/21', 'https://rickandmortyapi.com/api/episode/22']
Url: https://rickandmortyapi.com/api/character/344
Created: 2018-01-10T17:31:54.889Z


com
.
johnsnowlabs
.
nlp
.
util
.
LruMap
KeyPriorityOrdering
Related Doc:
package LruMap
object
KeyPriorityOrdering
extends
Ordering
[
KeyPriority
]
Linear Supertypes
Ordering
[
KeyPriority
],
PartialOrdering
[
KeyPriority
],
Equiv
[
KeyPriority
],
Serializable
,
Serializable
,
Comparator
[
KeyPriority
],
AnyRef
,
Any
Ordering
Alphabetic
By Inheritance
Inherited
KeyPriorityOrdering
Ordering
PartialOrdering
Equiv
Serializable
Serializable
Comparator
AnyRef
Any
Hide All
Show All
Visibility
Public
All
Type Members
class
Ops
extends
AnyRef
Definition Classes
Ordering
Value Members
final
def
!=
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
final
def
##
()
:
Int
Definition Classes
AnyRef → Any
final
def
==
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
final
def
asInstanceOf
[
T0
]
:
T0
Definition Classes
Any
def
clone
()
:
AnyRef
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
...
)
def
compare
(
x:
KeyPriority
,
y:
KeyPriority
)
:
Int
Definition Classes
KeyPriorityOrdering
→ Ordering → Comparator
final
def
eq
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
def
equals
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
def
equiv
(
x:
KeyPriority
,
y:
KeyPriority
)
:
Boolean
Definition Classes
Ordering → PartialOrdering → Equiv
def
finalize
()
:
Unit
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
classOf[java.lang.Throwable]
)
final
def
getClass
()
:
Class
[_]
Definition Classes
AnyRef → Any
def
gt
(
x:
KeyPriority
,
y:
KeyPriority
)
:
Boolean
Definition Classes
Ordering → PartialOrdering
def
gteq
(
x:
KeyPriority
,
y:
KeyPriority
)
:
Boolean
Definition Classes
Ordering → PartialOrdering
def
hashCode
()
:
Int
Definition Classes
AnyRef → Any
final
def
isInstanceOf
[
T0
]
:
Boolean
Definition Classes
Any
def
lt
(
x:
KeyPriority
,
y:
KeyPriority
)
:
Boolean
Definition Classes
Ordering → PartialOrdering
def
lteq
(
x:
KeyPriority
,
y:
KeyPriority
)
:
Boolean
Definition Classes
Ordering → PartialOrdering
def
max
(
x:
KeyPriority
,
y:
KeyPriority
)
:
KeyPriority
Definition Classes
Ordering
def
min
(
x:
KeyPriority
,
y:
KeyPriority
)
:
KeyPriority
Definition Classes
Ordering
implicit
def
mkOrderingOps
(
lhs:
KeyPriority
)
:
Ops
Definition Classes
Ordering
final
def
ne
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
final
def
notify
()
:
Unit
Definition Classes
AnyRef
final
def
notifyAll
()
:
Unit
Definition Classes
AnyRef
def
on
[
U
]
(
f: (
U
) ⇒
KeyPriority
)
:
Ordering
[
U
]
Definition Classes
Ordering
def
reverse
:
Ordering
[
KeyPriority
]
Definition Classes
Ordering → PartialOrdering
def
reversed
()
:
Comparator
[
KeyPriority
]
Definition Classes
Comparator
final
def
synchronized
[
T0
]
(
arg0: ⇒
T0
)
:
T0
Definition Classes
AnyRef
def
thenComparing
[
U <:
Comparable
[_ >:
U
]
]
(
arg0:
Function
[_ >:
KeyPriority
, _ <:
U
]
)
:
Comparator
[
KeyPriority
]
Definition Classes
Comparator
def
thenComparing
[
U
]
(
arg0:
Function
[_ >:
KeyPriority
, _ <:
U
]
,
arg1:
Comparator
[_ >:
U
]
)
:
Comparator
[
KeyPriority
]
Definition Classes
Comparator
def
thenComparing
(
arg0:
Comparator
[_ >:
KeyPriority
]
)
:
Comparator
[
KeyPriority
]
Definition Classes
Comparator
def
thenComparingDouble
(
arg0:
ToDoubleFunction
[_ >:
KeyPriority
]
)
:
Comparator
[
KeyPriority
]
Definition Classes
Comparator
def
thenComparingInt
(
arg0:
ToIntFunction
[_ >:
KeyPriority
]
)
:
Comparator
[
KeyPriority
]
Definition Classes
Comparator
def
thenComparingLong
(
arg0:
ToLongFunction
[_ >:
KeyPriority
]
)
:
Comparator
[
KeyPriority
]
Definition Classes
Comparator
def
toString
()
:
String
Definition Classes
AnyRef → Any
def
tryCompare
(
x:
KeyPriority
,
y:
KeyPriority
)
:
Some
[
Int
]
Definition Classes
Ordering → PartialOrdering
final
def
wait
()
:
Unit
Definition Classes
AnyRef
Annotations
@throws
(
...
)
final
def
wait
(
arg0:
Long
,
arg1:
Int
)
:
Unit
Definition Classes
AnyRef
Annotations
@throws
(
...
)
final
def
wait
(
arg0:
Long
)
:
Unit
Definition Classes
AnyRef
Annotations
@throws
(
...
)
Inherited from
Ordering
[
KeyPriority
]
Inherited from
PartialOrdering
[
KeyPriority
]
Inherited from
Equiv
[
KeyPriority
]
Inherited from
Serializable
Inherited from
Serializable
Inherited from
Comparator
[
KeyPriority
]
Inherited from
AnyRef
Inherited from
Any
Ungrouped


Service Metrics
Now that this service is published to the gateway, it *may* be consumed by
API clients. Use this tab to view basic metrics/analytics for the service.
Show metrics data for the
Overall Usage
No data found.
Top App Usage
No data found.
Usage by Plan
No data found.


| 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 | : | _ | (344 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 | : | _ | (8 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 | _ | (15 entries) | |
| Variable 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 | _ | (1 entry) | |
| 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 | _ | (6 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 | _ | (71 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 | _ | (6 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 | _ | (16 entries) | |
| 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 | _ | (22 entries) | |
| Projection 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 | _ | (23 entries) | |
| Instance 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 | _ | (49 entries) | |
| Section 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 | _ | (2 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 | _ | (106 entries) | |
| Record 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 | _ | (19 entries) |
Global Index
A
All [definition, in QC.Typeclasses]ATOM [module, in QC.TImp]
Atom [module, in QC.TImp]
AtomMap [module, in QC.TImp]
ATOM.eq_dec [axiom, in QC.TImp]
Atom.eq_dec [definition, in QC.TImp]
ATOM.fresh [axiom, in QC.TImp]
Atom.fresh [definition, in QC.TImp]
Atom.max_elt [definition, in QC.TImp]
Atom.nat_of [definition, in QC.TImp]
ATOM.nat_of [axiom, in QC.TImp]
ATOM.t [axiom, in QC.TImp]
Atom.t [definition, in QC.TImp]
B
Bar [constructor, in QC.Typeclasses]bar [inductive, in QC.Typeclasses]
base [definition, in QC.TImp]
base' [definition, in QC.TImp]
Baz [constructor, in QC.Typeclasses]
baz [inductive, in QC.Typeclasses]
baz1 [instance, in QC.Typeclasses]
baz2 [instance, in QC.Typeclasses]
baz3 [instance, in QC.Typeclasses]
baz4 [instance, in QC.Typeclasses]
Bind [constructor, in QC.TImp]
bindGenOpt [definition, in QC.TImp]
bind_deterministic [lemma, in QC.TImp]
Blue [constructor, in QC.QC]
Blue [constructor, in QC.Typeclasses]
bound_to [inductive, in QC.TImp]
Build_LabeledPoint [constructor, in QC.Typeclasses]
Build_Point [constructor, in QC.Typeclasses]
C
CAss [constructor, in QC.TImp]ceval [definition, in QC.TImp]
CheckerPlayground1 [module, in QC.QC]
CheckerPlayground1.Checkable [record, in QC.QC]
CheckerPlayground1.checkableBool [instance, in QC.QC]
CheckerPlayground1.Checker [definition, in QC.QC]
CheckerPlayground1.checker [projection, in QC.QC]
CheckerPlayground1.Failure [constructor, in QC.QC]
CheckerPlayground1.Result [inductive, in QC.QC]
CheckerPlayground1.showResult [instance, in QC.QC]
CheckerPlayground1.Success [constructor, in QC.QC]
CheckerPlayground2 [module, in QC.QC]
CheckerPlayground2.checkableDec [instance, in QC.QC]
CheckerPlayground2.c1 [axiom, in QC.QC]
CheckerPlayground2.c2 [axiom, in QC.QC]
CheckerPlayground3 [module, in QC.QC]
CheckerPlayground3.forAll [definition, in QC.QC]
CheckerPlayground4 [module, in QC.QC]
CheckerPlayground4.Checkable [record, in QC.QC]
CheckerPlayground4.checkableBool [instance, in QC.QC]
CheckerPlayground4.checkableDec [instance, in QC.QC]
CheckerPlayground4.checker [projection, in QC.QC]
CheckerPlayground4.Checker [definition, in QC.QC]
CheckerPlayground4.Failure [constructor, in QC.QC]
CheckerPlayground4.forAll [definition, in QC.QC]
CheckerPlayground4.Result [inductive, in QC.QC]
CheckerPlayground4.showResult [instance, in QC.QC]
CheckerPlayground4.showUnit [instance, in QC.QC]
CheckerPlayground4.Success [constructor, in QC.QC]
CIf [constructor, in QC.TImp]
color [inductive, in QC.QC]
color [inductive, in QC.Typeclasses]
com [inductive, in QC.TImp]
commutativity_property [lemma, in QC.Typeclasses]
conditional_prop_example [axiom, in QC.TImp]
context [definition, in QC.TImp]
CSeq [constructor, in QC.TImp]
CSkip [constructor, in QC.TImp]
CWhile [constructor, in QC.TImp]
D
dec [projection, in QC.Typeclasses]Dec [record, in QC.Typeclasses]
dec_bound_to [instance, in QC.TImp]
dec_bound_to [instance, in QC.TImp]
Dec_conj [instance, in QC.Typeclasses]
dec_has_type [instance, in QC.TImp]
dec_has_type_value [instance, in QC.TImp]
dec_typed_state [instance, in QC.TImp]
dec_well_typed_com [instance, in QC.TImp]
DefineArbitrary [module, in QC.QC]
DefineArbitrary.Arbitrary [record, in QC.QC]
DefineG [module, in QC.QC]
DefineGen [module, in QC.QC]
DefineGenSized [module, in QC.QC]
DefineGenSized.arbitrarySized [projection, in QC.QC]
DefineGenSized.GenOfGenSized [instance, in QC.QC]
DefineGenSized.GenSized [record, in QC.QC]
DefineGen.arbitrary [projection, in QC.QC]
DefineGen.Gen [record, in QC.QC]
DefineG.G [inductive, in QC.QC]
DefineG.MkG [constructor, in QC.QC]
DefineSized [module, in QC.QC]
DefineSized.sized [definition, in QC.QC]
E
EAnd [constructor, in QC.TImp]EEq [constructor, in QC.TImp]
EFalse [constructor, in QC.TImp]
eg42 [definition, in QC.Typeclasses]
ELe [constructor, in QC.TImp]
EMinus [constructor, in QC.TImp]
EMult [constructor, in QC.TImp]
ENot [constructor, in QC.TImp]
ENum [constructor, in QC.TImp]
EPlus [constructor, in QC.TImp]
Eq [record, in QC.Typeclasses]
eqb [projection, in QC.Typeclasses]
eqbad [projection, in QC.Typeclasses]
eqBar [definition, in QC.Typeclasses]
eqBool [instance, in QC.Typeclasses]
eqb_eq [projection, in QC.Typeclasses]
eqb_fact [lemma, in QC.Typeclasses]
EqDec [record, in QC.Typeclasses]
eqdecBool' [instance, in QC.Typeclasses]
eqdecBool'' [instance, in QC.Typeclasses]
eqdecNat [instance, in QC.Typeclasses]
EqDec__Dec [instance, in QC.Typeclasses]
eqNat [instance, in QC.Typeclasses]
eqPair [instance, in QC.Typeclasses]
eq_dec_color [instance, in QC.QC]
eq_dec_ty [instance, in QC.TImp]
eq_tree [definition, in QC.QC]
ETrue [constructor, in QC.TImp]
eval [definition, in QC.TImp]
EVar [constructor, in QC.TImp]
every_color_is_red [axiom, in QC.QC]
exp [inductive, in QC.TImp]
expression_soundness [axiom, in QC.TImp]
expression_soundness_exec [definition, in QC.TImp]
expression_soundness_exec' [definition, in QC.TImp]
expression_soundness_exec_firstshrink [definition, in QC.TImp]
e1 [definition, in QC.Typeclasses]
e2 [definition, in QC.Typeclasses]
e3 [definition, in QC.Typeclasses]
e3 [definition, in QC.Typeclasses]
F
Fail [constructor, in QC.TImp]faultyMirrorP [definition, in QC.QC]
foo [definition, in QC.Typeclasses]
G
genColor [definition, in QC.QC]genColor' [definition, in QC.QC]
genSortedList [definition, in QC.QC]
GenSTPlayground [module, in QC.TImp]
GenSTPlayground.arbitrarySizeST [projection, in QC.TImp]
GenSTPlayground.arbitraryST [projection, in QC.TImp]
GenSTPlayground.GenSizedSuchThat [record, in QC.TImp]
GenSTPlayground.GenSuchThat [record, in QC.TImp]
GenSTPlayground.GenSuchThatOfBounded [instance, in QC.TImp]
GenSTPlayground.::'genST'_x [notation, in QC.TImp]
genTree [instance, in QC.QC]
genTreeSized [definition, in QC.QC]
genTreeSized' [definition, in QC.QC]
gen_color [instance, in QC.QC]
gen_context [definition, in QC.TImp]
gen_exp_typed_sized [definition, in QC.TImp]
gen_has_type_2 [definition, in QC.TImp]
gen_has_type_3 [definition, in QC.TImp]
gen_typed_atom_from_context [definition, in QC.TImp]
gen_typed_evar [definition, in QC.TImp]
gen_typed_has_type [definition, in QC.TImp]
gen_typed_state [definition, in QC.TImp]
gen_typed_value [definition, in QC.TImp]
get_fresh_atoms [definition, in QC.TImp]
gMonad [instance, in QC.QC]
GOpt [definition, in QC.TImp]
gOptMonad [instance, in QC.TImp]
Green [constructor, in QC.Typeclasses]
Green [constructor, in QC.QC]
H
has_type [inductive, in QC.TImp]has_type_deterministic [lemma, in QC.TImp]
has_type_value [inductive, in QC.TImp]
has_type_1 [inductive, in QC.TImp]
has_type_2 [inductive, in QC.TImp]
has_type_3 [inductive, in QC.TImp]
I
implicit_fun [definition, in QC.Typeclasses]implicit_fun1 [definition, in QC.Typeclasses]
insert [definition, in QC.Introduction]
insert [definition, in QC.QC]
insertBST [definition, in QC.QC]
insertBST' [definition, in QC.QC]
insertBST_spec [definition, in QC.QC]
insertBST_spec' [definition, in QC.QC]
insert_spec [definition, in QC.QC]
insert_spec' [definition, in QC.QC]
insert_spec_sorted [definition, in QC.QC]
Introduction [library]
isBST [definition, in QC.QC]
isFail [definition, in QC.TImp]
isNone [definition, in QC.TImp]
isRed [definition, in QC.QC]
L
label [projection, in QC.Typeclasses]LabeledPoint [record, in QC.Typeclasses]
le [projection, in QC.Typeclasses]
Leaf [constructor, in QC.QC]
lebad [projection, in QC.Typeclasses]
liftM [definition, in QC.Typeclasses]
liftM2 [definition, in QC.Typeclasses]
liftM3 [definition, in QC.Typeclasses]
lift_shrink [definition, in QC.TImp]
ListMap [module, in QC.TImp]
ListMap.dom [definition, in QC.TImp]
ListMap.empty [definition, in QC.TImp]
ListMap.get [definition, in QC.TImp]
ListMap.set [definition, in QC.TImp]
ListMap.t [definition, in QC.TImp]
ListMap.withv [section, in QC.TImp]
lt [definition, in QC.Typeclasses]
lx [projection, in QC.Typeclasses]
ly [projection, in QC.Typeclasses]
M
Map [module, in QC.TImp]Map.dom [axiom, in QC.TImp]
Map.empty [axiom, in QC.TImp]
Map.get [axiom, in QC.TImp]
Map.set [axiom, in QC.TImp]
Map.t [axiom, in QC.TImp]
Map.withv [section, in QC.TImp]
Map.withv.V [variable, in QC.TImp]
max [definition, in QC.Typeclasses]
max [definition, in QC.Typeclasses]
max1 [definition, in QC.Typeclasses]
mirror [definition, in QC.QC]
mirrorP [definition, in QC.QC]
MyMap [record, in QC.Typeclasses]
mymap [projection, in QC.Typeclasses]
MyMap1 [instance, in QC.Typeclasses]
MyMap2 [instance, in QC.Typeclasses]
MyMap_trans [instance, in QC.Typeclasses]
N
natOrd [instance, in QC.Typeclasses]Node [constructor, in QC.QC]
nth_opt [definition, in QC.Typeclasses]
O
optionMonad [instance, in QC.Typeclasses]Ord [record, in QC.Typeclasses]
OrdBad [record, in QC.Typeclasses]
ordBarList [definition, in QC.Typeclasses]
OutOfGas [constructor, in QC.TImp]
P
Point [record, in QC.Typeclasses]PostScript [library]
PreOrder [record, in QC.Typeclasses]
PreOrder_Reflexive [projection, in QC.Typeclasses]
PreOrder_Transitive [projection, in QC.Typeclasses]
px [projection, in QC.Typeclasses]
py [projection, in QC.Typeclasses]
Q
QC [library]R
r [definition, in QC.Typeclasses]Red [constructor, in QC.Typeclasses]
Red [constructor, in QC.QC]
Reflexive [record, in QC.Typeclasses]
reflexivity [projection, in QC.Typeclasses]
remove [definition, in QC.Introduction]
removeP [axiom, in QC.Introduction]
result [inductive, in QC.TImp]
S
show [projection, in QC.Typeclasses]Show [record, in QC.Typeclasses]
showBool [instance, in QC.Typeclasses]
showColor [instance, in QC.Typeclasses]
showList [instance, in QC.Typeclasses]
showListAux [definition, in QC.Typeclasses]
showNat [instance, in QC.Typeclasses]
showOne [definition, in QC.Typeclasses]
showOne1 [definition, in QC.Typeclasses]
showOne2 [definition, in QC.Typeclasses]
showOne3 [definition, in QC.Typeclasses]
showOne4 [definition, in QC.Typeclasses]
showPair [instance, in QC.Typeclasses]
showTree [instance, in QC.QC]
showTwo [definition, in QC.Typeclasses]
show_atom [instance, in QC.TImp]
show_color [instance, in QC.QC]
shrinkColor [instance, in QC.QC]
shrinkTree [instance, in QC.QC]
shrinkTreeAux [definition, in QC.QC]
shrink_atom [instance, in QC.TImp]
shrink_base [definition, in QC.TImp]
shrink_evar [definition, in QC.TImp]
shrink_exp_typed [definition, in QC.TImp]
shrink_rec [definition, in QC.TImp]
shrink_typed_has_type [definition, in QC.TImp]
silly_fun1 [definition, in QC.Typeclasses]
silly_fun2 [definition, in QC.Typeclasses]
size [definition, in QC.QC]
sorted [definition, in QC.QC]
state [definition, in QC.TImp]
string_of_nat [definition, in QC.Typeclasses]
string_of_nat_aux [definition, in QC.Typeclasses]
Success [constructor, in QC.TImp]
sum3 [definition, in QC.Typeclasses]
sum3opt [definition, in QC.Typeclasses]
sum3opt' [definition, in QC.Typeclasses]
T
TAss [constructor, in QC.TImp]TBool [constructor, in QC.TImp]
TernaryTree [inductive, in QC.QC]
tern_mirror [definition, in QC.QC]
tern_mirror_reverse [definition, in QC.QC]
tern_to_list [definition, in QC.QC]
TIf [constructor, in QC.TImp]
TImp [library]
TLeaf [constructor, in QC.QC]
TNat [constructor, in QC.TImp]
TNode [constructor, in QC.QC]
Transitive [record, in QC.Typeclasses]
transitivity [projection, in QC.Typeclasses]
trans3 [lemma, in QC.Typeclasses]
trans3_pre [lemma, in QC.Typeclasses]
Tree [inductive, in QC.QC]
treeProp [definition, in QC.QC]
TSeq [constructor, in QC.TImp]
TSkip [constructor, in QC.TImp]
TS_Elem [constructor, in QC.TImp]
TS_Empty [constructor, in QC.TImp]
TWhile [constructor, in QC.TImp]
ty [inductive, in QC.TImp]
Typeclasses [library]
typed_state [inductive, in QC.TImp]
TyVBool [constructor, in QC.TImp]
TyVNat [constructor, in QC.TImp]
Ty_And [constructor, in QC.TImp]
Ty_Eq [constructor, in QC.TImp]
Ty_False [constructor, in QC.TImp]
Ty_False2 [constructor, in QC.TImp]
Ty_Le [constructor, in QC.TImp]
Ty_Minus [constructor, in QC.TImp]
Ty_Mult [constructor, in QC.TImp]
Ty_Not [constructor, in QC.TImp]
Ty_Num [constructor, in QC.TImp]
Ty_Num2 [constructor, in QC.TImp]
Ty_Plus [constructor, in QC.TImp]
Ty_Plus3 [constructor, in QC.TImp]
Ty_True [constructor, in QC.TImp]
Ty_True2 [constructor, in QC.TImp]
Ty_Var [constructor, in QC.TImp]
Ty_Var1 [constructor, in QC.TImp]
Ty_Var2 [constructor, in QC.TImp]
Ty_Var3 [constructor, in QC.TImp]
V
value [inductive, in QC.TImp]VBool [constructor, in QC.TImp]
Vellvm [library]
VNat [constructor, in QC.TImp]
W
well_typed_com [inductive, in QC.TImp]well_typed_state_never_stuck [axiom, in QC.TImp]
Y
Yellow [constructor, in QC.QC]:
::x_'::='_x [notation, in QC.TImp]::x_';;;'_x [notation, in QC.TImp]
::x_'?' [notation, in QC.Typeclasses]
::x_'||-'_x_'\IN'_x [notation, in QC.TImp]
::'IFB'_x_'THEN'_x_'ELSE'_x_'FI' [notation, in QC.TImp]
::'SKIP' [notation, in QC.TImp]
::'WHILE'_x_'DO'_x_'END' [notation, in QC.TImp]
Notation Index
G
GenSTPlayground.::'genST'_x [in QC.TImp]:
::x_'::='_x [in QC.TImp]::x_';;;'_x [in QC.TImp]
::x_'?' [in QC.Typeclasses]
::x_'||-'_x_'\IN'_x [in QC.TImp]
::'IFB'_x_'THEN'_x_'ELSE'_x_'FI' [in QC.TImp]
::'SKIP' [in QC.TImp]
::'WHILE'_x_'DO'_x_'END' [in QC.TImp]
Module Index
A
ATOM [in QC.TImp]Atom [in QC.TImp]
AtomMap [in QC.TImp]
C
CheckerPlayground1 [in QC.QC]CheckerPlayground2 [in QC.QC]
CheckerPlayground3 [in QC.QC]
CheckerPlayground4 [in QC.QC]
D
DefineArbitrary [in QC.QC]DefineG [in QC.QC]
DefineGen [in QC.QC]
DefineGenSized [in QC.QC]
DefineSized [in QC.QC]
G
GenSTPlayground [in QC.TImp]L
ListMap [in QC.TImp]M
Map [in QC.TImp]Variable Index
M
Map.withv.V [in QC.TImp]Library Index
I
IntroductionP
PostScriptQ
QCT
TImpTypeclasses
V
VellvmConstructor Index
B
Bar [in QC.Typeclasses]Baz [in QC.Typeclasses]
Bind [in QC.TImp]
Blue [in QC.QC]
Blue [in QC.Typeclasses]
Build_LabeledPoint [in QC.Typeclasses]
Build_Point [in QC.Typeclasses]
C
CAss [in QC.TImp]CheckerPlayground1.Failure [in QC.QC]
CheckerPlayground1.Success [in QC.QC]
CheckerPlayground4.Failure [in QC.QC]
CheckerPlayground4.Success [in QC.QC]
CIf [in QC.TImp]
CSeq [in QC.TImp]
CSkip [in QC.TImp]
CWhile [in QC.TImp]
D
DefineG.MkG [in QC.QC]E
EAnd [in QC.TImp]EEq [in QC.TImp]
EFalse [in QC.TImp]
ELe [in QC.TImp]
EMinus [in QC.TImp]
EMult [in QC.TImp]
ENot [in QC.TImp]
ENum [in QC.TImp]
EPlus [in QC.TImp]
ETrue [in QC.TImp]
EVar [in QC.TImp]
F
Fail [in QC.TImp]G
Green [in QC.Typeclasses]Green [in QC.QC]
L
Leaf [in QC.QC]N
Node [in QC.QC]O
OutOfGas [in QC.TImp]R
Red [in QC.Typeclasses]Red [in QC.QC]
S
Success [in QC.TImp]T
TAss [in QC.TImp]TBool [in QC.TImp]
TIf [in QC.TImp]
TLeaf [in QC.QC]
TNat [in QC.TImp]
TNode [in QC.QC]
TSeq [in QC.TImp]
TSkip [in QC.TImp]
TS_Elem [in QC.TImp]
TS_Empty [in QC.TImp]
TWhile [in QC.TImp]
TyVBool [in QC.TImp]
TyVNat [in QC.TImp]
Ty_And [in QC.TImp]
Ty_Eq [in QC.TImp]
Ty_False [in QC.TImp]
Ty_False2 [in QC.TImp]
Ty_Le [in QC.TImp]
Ty_Minus [in QC.TImp]
Ty_Mult [in QC.TImp]
Ty_Not [in QC.TImp]
Ty_Num [in QC.TImp]
Ty_Num2 [in QC.TImp]
Ty_Plus [in QC.TImp]
Ty_Plus3 [in QC.TImp]
Ty_True [in QC.TImp]
Ty_True2 [in QC.TImp]
Ty_Var [in QC.TImp]
Ty_Var1 [in QC.TImp]
Ty_Var2 [in QC.TImp]
Ty_Var3 [in QC.TImp]
V
VBool [in QC.TImp]VNat [in QC.TImp]
Y
Yellow [in QC.QC]Lemma Index
B
bind_deterministic [in QC.TImp]C
commutativity_property [in QC.Typeclasses]E
eqb_fact [in QC.Typeclasses]H
has_type_deterministic [in QC.TImp]T
trans3 [in QC.Typeclasses]trans3_pre [in QC.Typeclasses]
Axiom Index
A
ATOM.eq_dec [in QC.TImp]ATOM.fresh [in QC.TImp]
ATOM.nat_of [in QC.TImp]
ATOM.t [in QC.TImp]
C
CheckerPlayground2.c1 [in QC.QC]CheckerPlayground2.c2 [in QC.QC]
conditional_prop_example [in QC.TImp]
E
every_color_is_red [in QC.QC]expression_soundness [in QC.TImp]
M
Map.dom [in QC.TImp]Map.empty [in QC.TImp]
Map.get [in QC.TImp]
Map.set [in QC.TImp]
Map.t [in QC.TImp]
R
removeP [in QC.Introduction]W
well_typed_state_never_stuck [in QC.TImp]Inductive Index
B
bar [in QC.Typeclasses]baz [in QC.Typeclasses]
bound_to [in QC.TImp]
C
CheckerPlayground1.Result [in QC.QC]CheckerPlayground4.Result [in QC.QC]
color [in QC.QC]
color [in QC.Typeclasses]
com [in QC.TImp]
D
DefineG.G [in QC.QC]E
exp [in QC.TImp]H
has_type [in QC.TImp]has_type_value [in QC.TImp]
has_type_1 [in QC.TImp]
has_type_2 [in QC.TImp]
has_type_3 [in QC.TImp]
R
result [in QC.TImp]T
TernaryTree [in QC.QC]Tree [in QC.QC]
ty [in QC.TImp]
typed_state [in QC.TImp]
V
value [in QC.TImp]W
well_typed_com [in QC.TImp]Projection Index
C
CheckerPlayground1.checker [in QC.QC]CheckerPlayground4.checker [in QC.QC]
D
dec [in QC.Typeclasses]DefineGenSized.arbitrarySized [in QC.QC]
DefineGen.arbitrary [in QC.QC]
E
eqb [in QC.Typeclasses]eqbad [in QC.Typeclasses]
eqb_eq [in QC.Typeclasses]
G
GenSTPlayground.arbitrarySizeST [in QC.TImp]GenSTPlayground.arbitraryST [in QC.TImp]
L
label [in QC.Typeclasses]le [in QC.Typeclasses]
lebad [in QC.Typeclasses]
lx [in QC.Typeclasses]
ly [in QC.Typeclasses]
M
mymap [in QC.Typeclasses]P
PreOrder_Reflexive [in QC.Typeclasses]PreOrder_Transitive [in QC.Typeclasses]
px [in QC.Typeclasses]
py [in QC.Typeclasses]
R
reflexivity [in QC.Typeclasses]S
show [in QC.Typeclasses]T
transitivity [in QC.Typeclasses]Instance Index
B
baz1 [in QC.Typeclasses]baz2 [in QC.Typeclasses]
baz3 [in QC.Typeclasses]
baz4 [in QC.Typeclasses]
C
CheckerPlayground1.checkableBool [in QC.QC]CheckerPlayground1.showResult [in QC.QC]
CheckerPlayground2.checkableDec [in QC.QC]
CheckerPlayground4.checkableBool [in QC.QC]
CheckerPlayground4.checkableDec [in QC.QC]
CheckerPlayground4.showResult [in QC.QC]
CheckerPlayground4.showUnit [in QC.QC]
D
dec_bound_to [in QC.TImp]dec_bound_to [in QC.TImp]
Dec_conj [in QC.Typeclasses]
dec_has_type [in QC.TImp]
dec_has_type_value [in QC.TImp]
dec_typed_state [in QC.TImp]
dec_well_typed_com [in QC.TImp]
DefineGenSized.GenOfGenSized [in QC.QC]
E
eqBool [in QC.Typeclasses]eqdecBool' [in QC.Typeclasses]
eqdecBool'' [in QC.Typeclasses]
eqdecNat [in QC.Typeclasses]
EqDec__Dec [in QC.Typeclasses]
eqNat [in QC.Typeclasses]
eqPair [in QC.Typeclasses]
eq_dec_color [in QC.QC]
eq_dec_ty [in QC.TImp]
G
GenSTPlayground.GenSuchThatOfBounded [in QC.TImp]genTree [in QC.QC]
gen_color [in QC.QC]
gMonad [in QC.QC]
gOptMonad [in QC.TImp]
M
MyMap1 [in QC.Typeclasses]MyMap2 [in QC.Typeclasses]
MyMap_trans [in QC.Typeclasses]
N
natOrd [in QC.Typeclasses]O
optionMonad [in QC.Typeclasses]S
showBool [in QC.Typeclasses]showColor [in QC.Typeclasses]
showList [in QC.Typeclasses]
showNat [in QC.Typeclasses]
showPair [in QC.Typeclasses]
showTree [in QC.QC]
show_atom [in QC.TImp]
show_color [in QC.QC]
shrinkColor [in QC.QC]
shrinkTree [in QC.QC]
shrink_atom [in QC.TImp]
Section Index
L
ListMap.withv [in QC.TImp]M
Map.withv [in QC.TImp]Definition Index
A
All [in QC.Typeclasses]Atom.eq_dec [in QC.TImp]
Atom.fresh [in QC.TImp]
Atom.max_elt [in QC.TImp]
Atom.nat_of [in QC.TImp]
Atom.t [in QC.TImp]
B
base [in QC.TImp]base' [in QC.TImp]
bindGenOpt [in QC.TImp]
C
ceval [in QC.TImp]CheckerPlayground1.Checker [in QC.QC]
CheckerPlayground3.forAll [in QC.QC]
CheckerPlayground4.Checker [in QC.QC]
CheckerPlayground4.forAll [in QC.QC]
context [in QC.TImp]
D
DefineSized.sized [in QC.QC]E
eg42 [in QC.Typeclasses]eqBar [in QC.Typeclasses]
eq_tree [in QC.QC]
eval [in QC.TImp]
expression_soundness_exec [in QC.TImp]
expression_soundness_exec' [in QC.TImp]
expression_soundness_exec_firstshrink [in QC.TImp]
e1 [in QC.Typeclasses]
e2 [in QC.Typeclasses]
e3 [in QC.Typeclasses]
e3 [in QC.Typeclasses]
F
faultyMirrorP [in QC.QC]foo [in QC.Typeclasses]
G
genColor [in QC.QC]genColor' [in QC.QC]
genSortedList [in QC.QC]
genTreeSized [in QC.QC]
genTreeSized' [in QC.QC]
gen_context [in QC.TImp]
gen_exp_typed_sized [in QC.TImp]
gen_has_type_2 [in QC.TImp]
gen_has_type_3 [in QC.TImp]
gen_typed_atom_from_context [in QC.TImp]
gen_typed_evar [in QC.TImp]
gen_typed_has_type [in QC.TImp]
gen_typed_state [in QC.TImp]
gen_typed_value [in QC.TImp]
get_fresh_atoms [in QC.TImp]
GOpt [in QC.TImp]
I
implicit_fun [in QC.Typeclasses]implicit_fun1 [in QC.Typeclasses]
insert [in QC.Introduction]
insert [in QC.QC]
insertBST [in QC.QC]
insertBST' [in QC.QC]
insertBST_spec [in QC.QC]
insertBST_spec' [in QC.QC]
insert_spec [in QC.QC]
insert_spec' [in QC.QC]
insert_spec_sorted [in QC.QC]
isBST [in QC.QC]
isFail [in QC.TImp]
isNone [in QC.TImp]
isRed [in QC.QC]
L
liftM [in QC.Typeclasses]liftM2 [in QC.Typeclasses]
liftM3 [in QC.Typeclasses]
lift_shrink [in QC.TImp]
ListMap.dom [in QC.TImp]
ListMap.empty [in QC.TImp]
ListMap.get [in QC.TImp]
ListMap.set [in QC.TImp]
ListMap.t [in QC.TImp]
lt [in QC.Typeclasses]
M
max [in QC.Typeclasses]max [in QC.Typeclasses]
max1 [in QC.Typeclasses]
mirror [in QC.QC]
mirrorP [in QC.QC]
N
nth_opt [in QC.Typeclasses]O
ordBarList [in QC.Typeclasses]R
r [in QC.Typeclasses]remove [in QC.Introduction]
S
showListAux [in QC.Typeclasses]showOne [in QC.Typeclasses]
showOne1 [in QC.Typeclasses]
showOne2 [in QC.Typeclasses]
showOne3 [in QC.Typeclasses]
showOne4 [in QC.Typeclasses]
showTwo [in QC.Typeclasses]
shrinkTreeAux [in QC.QC]
shrink_base [in QC.TImp]
shrink_evar [in QC.TImp]
shrink_exp_typed [in QC.TImp]
shrink_rec [in QC.TImp]
shrink_typed_has_type [in QC.TImp]
silly_fun1 [in QC.Typeclasses]
silly_fun2 [in QC.Typeclasses]
size [in QC.QC]
sorted [in QC.QC]
state [in QC.TImp]
string_of_nat [in QC.Typeclasses]
string_of_nat_aux [in QC.Typeclasses]
sum3 [in QC.Typeclasses]
sum3opt [in QC.Typeclasses]
sum3opt' [in QC.Typeclasses]
T
tern_mirror [in QC.QC]tern_mirror_reverse [in QC.QC]
tern_to_list [in QC.QC]
treeProp [in QC.QC]
Record Index
C
CheckerPlayground1.Checkable [in QC.QC]CheckerPlayground4.Checkable [in QC.QC]
D
Dec [in QC.Typeclasses]DefineArbitrary.Arbitrary [in QC.QC]
DefineGenSized.GenSized [in QC.QC]
DefineGen.Gen [in QC.QC]
E
Eq [in QC.Typeclasses]EqDec [in QC.Typeclasses]
G
GenSTPlayground.GenSizedSuchThat [in QC.TImp]GenSTPlayground.GenSuchThat [in QC.TImp]
L
LabeledPoint [in QC.Typeclasses]M
MyMap [in QC.Typeclasses]O
Ord [in QC.Typeclasses]OrdBad [in QC.Typeclasses]
P
Point [in QC.Typeclasses]PreOrder [in QC.Typeclasses]
R
Reflexive [in QC.Typeclasses]S
Show [in QC.Typeclasses]T
Transitive [in QC.Typeclasses]| 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 | : | _ | (344 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 | : | _ | (8 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 | _ | (15 entries) | |
| Variable 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 | _ | (1 entry) | |
| 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 | _ | (6 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 | _ | (71 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 | _ | (6 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 | _ | (16 entries) | |
| 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 | _ | (22 entries) | |
| Projection 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 | _ | (23 entries) | |
| Instance 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 | _ | (49 entries) | |
| Section 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 | _ | (2 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 | _ | (106 entries) | |
| Record 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 | _ | (19 entries) |


Washington State University Buildings and Landscapes documents WSU’s history of over 125 years as a land grant institution through hundreds of photographs, maps, documents, oral histories, and artwork on the Pullman campus. Most of the images and metadata derive from the holdings of the Manuscripts, Archives, and Special Collections (MASC) in Washington State University's Terrell Library. The buildings and landscapes included here are perhaps the most widely known, but there are several barns, sheds, and other buildings that we hope to add over time.
The Washington State University Pullman Campus is located on the ceded lands of the Nez Perce Tribe and the traditional homeland of the Palus Band of Indians. We acknowledge their presence here since time immemorial and recognize their continuing connection to the land, to the water, and to their ancestors.
Creator: Andrew Gillreath-Brown
Contributors: J. Philip Gruen, Mark O’English, Jeffrey Sanders, Anna-Maria Shannon, Historic Preservation Committee (WSU), Center for Digital Scholarship and Curation (WSU), and Manuscripts, Archives and Special Collections (WSU)
The initial publication of this site was funded by fellowships provided by the Center for Digital Scholarship and Curation (CDSC) and the Manuscripts, Archives, and Special Collections (MASC) of the Washington State University Libraries. Andrew Gillreath-Brown was awarded a 2018 CDSC Summer Fellowship and the Lawrence R. Stark Archives Graduate Fellowship from MASC, which was an endowment created in 2008 to honor former university archivist Larry Stark.


Join us for a wildly fun night in Houston!
7pm, Sunday, June 4, 2017
At The Last Concert Cafe
The Celebration is a social event, bringing together people from all over North America and the world! There will be live music, food, booze, and loads of fun! The event is open to the public, and all are welcome.
This is a FREE event! We will be accepting donations for the band.
Who we are is the possibility of being fun, expressed, and loving! And we are causing the experience of ourselves as a connected community, exploding with aliveness and possiblity. Come be a part of it!
Featuring performances by:
1403 Nance St.
Houston, TX. 77002
Are you planning to attend? We would love to hear from you! Also, if you would like to perform, or assist/cause this and/or future Celebrations, please fill out the form below.RSVP / Contact


_Dead_Man_on_Campus_ (R) * (out of ****)
While I am not fond of any writer's use of cheap, easy puns, I am not completely above using them myself when the situation merits it (witness my review of _Pecker_ from a couple of issues ago).
Strait-laced med student Josh (Tom Everett Scott, who manages to remain somewhat likable throughout)'s blemish-free academic record breaks out into Fs, thanks to the influence of his ever-partying roommate, Cooper (Mark-Paul Gosselaar), who introduces Josh to the sex- and booze-filled nights that come with university life. With the threat of losing an academic scholarship (Josh) and a life cleaning toilets for his dad looming (Cooper), what are two good-hearted slackers to do? Easy--look for a loophole, which they find in the form of an unbelievable rule in the school charter that states that if a student's (or students') roommate commits suicide, the surviving student(s) shall receive straight As. So instead of studying, Josh and Cooper attempt to seek out the most depressed student out there, move him into their dorm room, and drive him to suicide before the semester ends.
Director Alan Cohn and screenwriters Michael Traeger and Mike White (working from a story by Anthony Abrams and Adam Larson Broder) take their sweet time to build the head of steam that comes with Josh and Cooper's diabolical plot. Until then, the usual boring cliches of college life (booze, sex, more booze) fill the time, which is made to feel longer by _Saved_by_the_Bell_ alumnus Gosselaar's sitcom-bred mugging. That said, once Cohn and company do build some comic momentum, they mishandle it. The introduction of the manic, psychotic Cliff (Lochlyn Munro), a potential roommate for Josh and Cooper, brings some demented life to the uninspired proceedings before being hastily written out in favor of two less interesting candidates: paranoid nerd Buckley (Randy Pearlstein) and British death rocker Matt (Corey Page). One wishes that Cliff would reappear, but, as they say, be careful what you wish for. Not surprisingly, he does resurface, and it then becomes clear that this is a character that is best taken in a small dose; almost immediately, his extended boorish and sociopathic antics loses its novelty.
The same can be said about all of _Dead_Man_on_Campus_. Whatever morbid appeal the far-fetched premise has quickly evaporates, and the self-absorbed characters, especially Cooper, pretty much grate from the get-go. _Dead_Man_ doesn't grow tiresome; it already _is_ once the clever opening titles are through. As it slogs along to a cheesy, happy-for-all-parties conclusion, _Dead_Man_ lives up to its title and then some--not only does the movie grow even more tired and die, it still insists on going on... like a zombie.
Michael Dequina
<EMAIL_ADDRESS>|<EMAIL_ADDRESS>Mr. Brown's Movie Site: http://welcome.to/mrbrown
CompuServe Hollywood Hotline: http://www.HollywoodHotline.com
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Your order transaction is successfull.
You will be notified on your order updates. You can also track your order from the order page.
Track Order


Huddle re-imagines the way we build communities. You have a voice, but so does your audience. Create connectiom with your users as you engage in genuine discussion.


HTML, CSS, JavaScript and DOM
* An analogy to describe the differences between HTML and CSS
HTML is used to design the structure of websites, it contains various that hold
contents and section up the pages. Each of the has different values and attributes that can be defined by the CSS
(Cascading Style Sheet). The HTML contents are raw datas, they look plain and boring by default, Using CSS can provide the
appearnce and styling to the HTML contents. Here is an example of "GitHub Guide” website with and without CSS styling:
If you have ever made a cake or seen the process of making a cake, you can think of HTML
is the sponge cake base, you can use HTML to decide how many layers the cake is going to be and CSS is what gives the decorations
and flavours of the cake.
*Explain control flow and loops using an example process from everyday life, for example
'waking up' or 'brushing your teeth'.
Adding loops and conditons in different parts of the code script can control the way the
programe is run. To explain the concept, we can imagine that we are using the washing mechine to wash the clothes . To get the
clothes clean involves 3 cycles : wash – rinse – spin and it take a total of 60 minutes to finish the whole process. Let’s say it
takes 30 minutes for the wash cycle, 20 mins for the rinse cycle and 10 mins for the spin cycle. We can control this by using loops
and conditions:
| Functions |
Conditions |
| washCycle |
Time starts at 0mins and Time < 30mins |
| rinseCycle |
Time > =30mins and < 50mins |
| spinCycle |
Time > =50mins and < 60mins |
For (int time = 0; time < 60; time ++) {
If (time < 30) {
washCycle;
} else if{
(time >= 30 && time < 50){
rinseCycle;
}else{
spinCycle;
}
The above function will count from 0 to 60 minutes, each count is one loop. During the loop,
it will check if it is the time to move to the next cycle. If the current count is under 30 minutes, it falls in the wash cycle,
and so on.
* Describe what the DOM is and an example of how you might interact with it.
The Document Object Model (DOM) is and application programming interface for HTML documents. It
allows programs and scripts to dynamically access and update the contents, struture and styles of a document(eg. The webpage/html
document). As you would know from the first section of this blog, HTML are plained datas and CSS is the style settings , those are
static scripts. Imagine that you have set the hover style in CSS, how is it gonna show on the browser? How would it know the mouse is
on the hyper link? How would it know you have click on the link and is time to bring you to the linked page? DOM will do the job!
DOM enables scripts to access document elements and manipulate the datas. It acts like a glue that ties HTML, CSS , and java scripts
together.
DOM is a hierarchical model as shown below:
Every HTML element within the document is an object in the eyes of the DOM (eg. <head>,<body>,
<div> etc.) DOM basically describes how the objects are laid out in a tree fashion and each object is called the node. JavaScript
works with the objects, it can call methods on document objects thru DOM and interact with them, below is an example of getting
objects from DOM:
Document.getElementByTagName(title)
This gets the information from the <title> tag of the HTML element.
* Explain the difference between accessing data from arrays and objects.
Data in arrays is referenced by its position while data in an object is referenced by its
defined-properties.
As showing in the picture above, the data stored in an array is call element, each element has a refrenced position in regard to the array
length. To access the data within an array, we could use the bracket notation “[ ]” to specify the position of the data. For example
arrayName[3], this calls the 4th element inside the array. Note that numbering begins with 0 in programming world, therefore arrayName [n]
calls the n+1 th element in that array.
Unlike array, data stored in an object is not refrenced by position. When we create an object, we assign a name to each data set
and it is called the property. We use properties to reference data within an object. For example, see the picture above, the names
stored in JSobject are the properties, each of the property refers to a set of data. We can use JSobject[Extra Properties]
to access the array which contains property “c” and “d”. Or we can use JSobject.Elements
to access the array which contains property “0”, “1” & “2”. Generally we use bracket notation “[ ]” to access property has space
in its name. And dot notation “.” is use for normal cases. However there are other situations that bracket notation is required.
Further information please refer to freeCodeCamp.
* Explain what functions are and why they are useful.
Function or a method is a piece of code which performs some operations and optionally returns a value.
Functions are useful to break the codes up into smaller bits, so that it is more organised. Also, functions are reusable, it can be call
whenever you want without rewrite the code over and over again.


ComicBook Nation Episode 85: Frozen 2 Review & WWE Survivor Series Preview
In his episode we review new movies Frozen II and 21 Bridges; we discuss Marvel’s latest issues of X-Men Marauders and the Absolute Carnage finale; preview WWE Survivor Series; and talk about why DC Universe is officially dead now.
There are several ways you can listen to and enjoy ComicBook Nation, which are listed below:
- Listen via the media player embedded above.
- Subscribe to this RSS Feed: //feeds.megaphone.fm/comicbooknation
- Check us out on Spotify or Stitcher
- Subscribe on iTunes or iHeartRadio
- Tell any Amazon Alexa device to "Play ComicBook Nation Podcast"
- Or go to YouTube and watch any episode
Regular episodes consist of the "News Flash" where we quickly go over some of the major headlines that have hit the site before jumping into the "Deep Dive", where we unpack and discuss some of the bigger topics of discussion within the fandom.
New episodes are launched every Wednesday and Friday, so be sure to subscribe now so you don't miss out!
After every show we'll keep the discussion on Twitter with the #ComicBookNation hashtag, and you can also keep up with ComicBook.com and show hosts Kofi Outlaw and Matt Aguilar via the Twitter handles, listed below:
Have thoughts to share? Want us to cover something on the show? Let us know in the comments below!
To find previous episodes of ComicBook Nation - be sure to click this link.


Configure Filebeat to send data through your new Elasticsearch pipeline
instructions
At minimum you'll need to configure Filebeat's Elasticsearch output with a hostname, an index name, and a
paramaters
block. Your config should end up looking something like this:
output:
elasticsearch:
hosts: ["your-elasticsearch-host"]
index: "your-base-index-name"
parameters:
pipeline: "{{installStep.pipelineId}}"
NOTE: The Filebeat config takes a base index name and automatically rotates the target index by appending "-{date}"
to the end, so if your pattern was "filebeat-*" you would make the index name "filebeat" in filebeat.yml.


There are two versions of the Quick Start application:
The Quick Start Complete includes additional components on top of the base vanilla application of Quick Start (Minimal) and is more opinionated about the implementation and structure of your application, including the backend.


Coded by Joshua Davidson
Joke # from http://www.icndb.com/
"Chuck Norris" by Jason H. Smith
used under CC BY / Cropped & resized from original
Joke # from http://www.icndb.com/
"Chuck Norris" by Jason H. Smith
used under CC BY / Cropped & resized from original


I Still Know What You Did Last Summer (1998)
As reviewed by James Brundage
I was told, when I entered into the business of film criticism, that you have to find the bad in the good and the good in the bad. That your job is to be both pessimist and optimist, whatever the situation desires. But, you know, it's hard to be optimistic about a film where pretty much all of the theater groans at the end of it and is more fun making jokes about it than watching it. I suppose, though, that I can say this about ISKWYDLS (or I Still Know What You Did Last Summer, or ye movie with a title five words too long): it never once uttered the words "I'll be right back."
After all, it hit every other cliché in the book on its bad attempt at thrills in Paradise.
This time good old Captain Hook (aka Ben Willis) is alive and well (minus a hand) and on a tropical island enjoying himself... gutting people. Julie's there, of course, with her roommate (played by Brandy, my number one pick for people who should be gutted this year), Brandy's horny boyfriend Tyrell, and Julie's suitor, Will Benson. You have a psychotic bartender and an annoying hotel clerk and, by the way did I mention that Julie and co. are staying in the suites where murders occurred? Writers, can you say "trite"?
Now, as far as horror goes, I have nothing against cliché. Cliché is the trademark of horror. If it's not cliché, it's either Dark Comedy (Scream, Scream2) or Noir Horror (Lost Highway, Jacob's Ladder, Se7en). I watch horror because I'm a violence happy 80s freak, who loves to laugh at the dumb things or use them as an excuse for a date. Having no date the night I saw it and therefore being forced to endure this incredibly cheesy movie with no ability for comic element, and nothing laughable about it, I had to resort to my own cracks which my neighbors found very annoying because, of course, they had dates.
I liked the first one, but, Williamson (as said in Scream 2, ironically) is right.  And, compadres, especially this one.
http://fly.to/criticsheaven
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Issue 4553
: iframe should be content-primary
Steps to reproduce
Open Firebug
Switch to the Net panel and enable it
Reload the page
Expand the request for
issue4553.html
⇒ An
HTML
tab should be shown for the request
Select the HTML tab. At this moment alert dialog MUST NOT be displayed.


UX writing - OTT services are teaching my 4 year old to read. He asks us how certain shows are spelled, and then types them in via the search keyboards. The only UX problem seems to be creating a more obvious action so you can select a particular episode of a TV show.
Microcopy - There are times when microcopy is secondary in importance to placement. As an example, my 4 year old uses OTT services without being able to read. Instead, he's memorized the placement of the buttons he uses.
Personal Stuff
Personal stuff, updated 1/17/20
Building a piñata for Evan's Ghostbusters birthday party. As usual, the YouTubers make it look far too easy.
Thinking about sustainability and school supplies. Too many schools put an emphasis on parents buying new school supplies each year, which can be extremely wasteful. I already have too many barely-used crayons, for example.
Thinking there should be a way to make a public-facing link to your library's checked out items page. Might be neat to share with friends and generate interest in using libraries. Here's a screenshot for now.
I asked Annie to make a telephone icon for me. She decided to make a cell phone instead of a rotary phone. Makes total sense. Why do people still use an old school handset as their telephone icon?
Evan is starting to become more interested in drawing. This occasionally means houses, but more often means line drawings that he says are "plans."
Why?
All the nostalgia of a links page
I came across the now pageconcept just a few days after explaining the 1990's links page phenomenon to Annie. Links pages were the best.


Not enough data for these parameters.
This interactive charts the new {{selectedData.toLowerCase()}} of COVID-19 in the past week vs. the total {{selectedData.toLowerCase()}} to date. When plotted in this way, exponential growth is represented as a straight line that slopes upwards. Notice that almost all countries follow a very similar path of exponential growth.


Labour++
Connecting workers and Employers
all around.
100% freeWork from home
Find the right employee for your work
Huge network of freelancers
Grow your network
What is Labour++?
Labour++ is responsible for the right recruitment, solve unemployment and fills empty stomach. If you are a recruiter and need an employee, this app helps you to find the right employees for the right work. If you are an employee and need a work, it helps you find the right work matching your skills.


| Total net profit | -55.14 | Gross profit | 193.27 | Gross loss | -248.41 |
| Profit factor | 0.78 | Expected payoff | -0.55 | ||
| Absolute drawdown | -93.23 | Maximal drawdown (%) | 119.47 (455.3%) | ||
| Total trades | 100 | Profit trades (% of total) | 38 (38.0%) | Loss trades (% of total) | 62 (62.0%) |
| Long positions (won %) | 56 (41.07%) | Short positions (won %) | 44 (34.09%) | ||
| Largest | profit trade | 8.59 | loss trade | -10.79 | |
| Average | profit trade | 5.09 | loss trade | -4.01 | |
| Minimum | profit trade | 0.18 | loss trade | -0.58 | |
| Maximum | take profit in pips | 167.9 | stop loss in pips | -122.4 | |
| Average | take profit in pips | 139.5 | stop loss in pips | -99.5 | |
| Minimum | take profit in pips | 116.6 | stop loss in pips | -71.1 | |
| Maximum | Reward-Risk | 2.4 | Duration in minutes | 1596 | |
| Average | Reward-Risk | 1.4 | Duration in minutes | 371.8 | |
| Minimum | Reward-Risk | 0.9 | Duration in minutes | 0 | |
| Maximum | consecutive wins (profit in money) | 8.0 (31.37) | consecutive losses (loss in money) | 14.0 (-64.69) | |
| Average | consecutive wins | 4.0 | consecutive losses | 8.0 |
| Total net profit | -27.74 | Gross profit | 104.84 | Gross loss | -132.58 |
| Profit factor | 0.79 | Expected payoff | -0.5 | ||
| Absolute drawdown | -27.74 | Maximal drawdown (%) | 71.16 (163.89%) | ||
| Total trades | 56 | Profit trades (% of total) | 23 (41.07%) | Loss trades (% of total) | 33 (58.93%) |
| Largest | profit trade | 8.36 | loss trade | -10.79 | |
| Average | profit trade | 4.56 | loss trade | -4.02 | |
| Minimum | profit trade | 0.18 | loss trade | -0.58 | |
| Maximum | take profit in pips | 167.9 | stop loss in pips | -111.1 | |
| Average | take profit in pips | 141.1 | stop loss in pips | -97.9 | |
| Minimum | take profit in pips | 127.9 | stop loss in pips | -71.1 | |
| Maximum | Reward-Risk | 2.4 | Duration in minutes | 1596.0 | |
| Average | Reward-Risk | 1.5 | Duration in minutes | 457.4 | |
| Minimum | Reward-Risk | 1.1 | Duration in minutes | 0.0 | |
| Maximum | consecutive wins (profit in money) | 8.0 (31.37) | consecutive losses (loss in money) | 9.0 (-54.73) | |
| Average | consecutive wins | 4.0 | consecutive losses | 6.0 |
| Total net profit | -27.4 | Gross profit | 88.43 | Gross loss | -115.83 |
| Profit factor | 0.76 | Expected payoff | -0.62 | ||
| Absolute drawdown | -76.28 | Maximal drawdown (%) | 70.11 (-1136.3%) | ||
| Total trades | 44 | Profit trades (% of total) | 15 (34.09%) | Loss trades (% of total) | 29 (65.91%) |
| Largest | profit trade | 8.59 | loss trade | -6.17 | |
| Average | profit trade | 5.9 | loss trade | -3.99 | |
| Minimum | profit trade | 3.28 | loss trade | -2.75 | |
| Maximum | take profit in pips | 148.7 | stop loss in pips | -122.4 | |
| Average | take profit in pips | 137.4 | stop loss in pips | -101.6 | |
| Minimum | take profit in pips | 116.6 | stop loss in pips | -90.3 | |
| Maximum | Reward-Risk | 1.6 | Duration in minutes | 1092.0 | |
| Average | Reward-Risk | 1.4 | Duration in minutes | 262.8 | |
| Minimum | Reward-Risk | Duration in minutes | 0.0 | ||
| Maximum | consecutive wins (profit in money) | 7.0 (54.46) | consecutive losses (loss in money) | 13.0 (-57.09) | |
| Average | consecutive wins | 5.0 | consecutive losses | 9.0 |


Welcome to Epitheater! Enjoy our updated luxurious seating, complete with reclining, in theatres 10 and 11! We want your visit to be as comfortable as possible! To reserve your ticket to the hottest new movies, just fill out the form below!
Ordering your ticket is super easy! Just fill in the form below, select the movie and your showing, and proceed to checkout. We hope to see you in our theatres soon!
You did not input a valid age.


Edward H.
Adelson
|
My lab is part of the Perceptual Science Group in the Department of Brain and Cognitive Sciences at MIT, and focuses on topics in human and machine vision, including mid-level vision, material perception, image statistics, and motion analysis. |
|
|
|
|