# Copyright (C) 2004-2018 by
# Aric Hagberg<EMAIL_ADDRESS># Dan Schult<EMAIL_ADDRESS># Pieter Swart<EMAIL_ADDRESS># All rights reserved.
# BSD license.
#
# Authors: Aric Hagberg<EMAIL_ADDRESS># Dan Schult<EMAIL_ADDRESS># Pieter Swart<EMAIL_ADDRESS>"""Base class for MultiDiGraph."""
from copy import deepcopy
import networkx as nx
from networkx.classes.graph import Graph # for doctests
from networkx.classes.digraph import DiGraph
from networkx.classes.multigraph import MultiGraph
from networkx.classes.coreviews import MultiAdjacencyView
from networkx.classes.reportviews import OutMultiEdgeView, InMultiEdgeView, \
DiMultiDegreeView, OutMultiDegreeView, InMultiDegreeView
from networkx.exception import NetworkXError
[docs]class MultiDiGraph(MultiGraph, DiGraph):
"""A directed graph class that can store multiedges.
Multiedges are multiple edges between two nodes. Each edge
can hold optional data or attributes.
A MultiDiGraph holds directed edges. Self loops are allowed.
Nodes can be arbitrary (hashable) Python objects with optional
key/value attributes. By convention `None` is not used as a node.
Edges are represented as links between nodes with optional
key/value attributes.
Parameters
----------
incoming_graph_data : input graph (optional, default: None)
Data to initialize graph. If None (default) an empty
graph is created. The data can be any format that is supported
by the to_networkx_graph() function, currently including edge list,
dict of dicts, dict of lists, NetworkX graph, NumPy matrix
or 2d ndarray, SciPy sparse matrix, or PyGraphviz graph.
attr : keyword arguments, optional (default= no attributes)
Attributes to add to graph as key=value pairs.
See Also
--------
Graph
DiGraph
MultiGraph
OrderedMultiDiGraph
Examples
--------
Create an empty graph structure (a "null graph") with no nodes and
no edges.
>>> G = nx.MultiDiGraph()
G can be grown in several ways.
**Nodes:**
Add one node at a time:
>>> G.add_node(1)
Add the nodes from any container (a list, dict, set or
even the lines from a file or the nodes from another graph).
>>> G.add_nodes_from([2, 3])
>>> G.add_nodes_from(range(100, 110))
>>> H = nx.path_graph(10)
>>> G.add_nodes_from(H)
In addition to strings and integers any hashable Python object
(except None) can represent a node, e.g. a customized node object,
or even another Graph.
>>> G.add_node(H)
**Edges:**
G can also be grown by adding edges.
Add one edge,
>>> key = G.add_edge(1, 2)
a list of edges,
>>> keys = G.add_edges_from([(1, 2), (1, 3)])
or a collection of edges,
>>> keys = G.add_edges_from(H.edges)
If some edges connect nodes not yet in the graph, the nodes
are added automatically. If an edge already exists, an additional
edge is created and stored using a key to identify the edge.
By default the key is the lowest unused integer.
>>> keys = G.add_edges_from([(4,5,dict(route=282)), (4,5,dict(route=37))])
>>> G[4]
AdjacencyView({5: {0: {}, 1: {'route': 282}, 2: {'route': 37}}})
**Attributes:**
Each graph, node, and edge can hold key/value attribute pairs
in an associated attribute dictionary (the keys must be hashable).
By default these are empty, but can be added or changed using
add_edge, add_node or direct manipulation of the attribute
dictionaries named graph, node and edge respectively.
>>> G = nx.MultiDiGraph(day="Friday")
>>> G.graph
{'day': 'Friday'}
Add node attributes using add_node(), add_nodes_from() or G.nodes
>>> G.add_node(1, time='5pm')
>>> G.add_nodes_from([3], time='2pm')
>>> G.nodes[1]
{'time': '5pm'}
>>> G.nodes[1]['room'] = 714
>>> del G.nodes[1]['room'] # remove attribute
>>> list(G.nodes(data=True))
[(1, {'time': '5pm'}), (3, {'time': '2pm'})]
Add edge attributes using add_edge(), add_edges_from(), subscript
notation, or G.edges.
>>> key = G.add_edge(1, 2, weight=4.7 )
>>> keys = G.add_edges_from([(3, 4), (4, 5)], color='red')
>>> keys = G.add_edges_from([(1,2,{'color':'blue'}), (2,3,{'weight':8})])
>>> G[1][2][0]['weight'] = 4.7
>>> G.edges[1, 2, 0]['weight'] = 4
Warning: we protect the graph data structure by making `G.edges[1, 2]` a
read-only dict-like structure. However, you can assign to attributes
in e.g. `G.edges[1, 2]`. Thus, use 2 sets of brackets to add/change
data attributes: `G.edges[1, 2]['weight'] = 4`
(For multigraphs: `MG.edges[u, v, key][name] = value`).
**Shortcuts:**
Many common graph features allow python syntax to speed reporting.
>>> 1 in G # check if node in graph
True
>>> [n for n in G if n<3] # iterate through nodes
[1, 2]
>>> len(G) # number of nodes in graph
5
>>> G[1] # adjacency dict-like view keyed by neighbor to edge attributes
AdjacencyView({2: {0: {'weight': 4}, 1: {'color': 'blue'}}})
Often the best way to traverse all edges of a graph is via the neighbors.
The neighbors are available as an adjacency-view `G.adj` object or via
the method `G.adjacency()`.
>>> for n, nbrsdict in G.adjacency():
... for nbr, keydict in nbrsdict.items():
... for key, eattr in keydict.items():
... if 'weight' in eattr:
... # Do something useful with the edges
... pass
But the edges() method is often more convenient:
>>> for u, v, keys, weight in G.edges(data='weight', keys=True):
... if weight is not None:
... # Do something useful with the edges
... pass
**Reporting:**
Simple graph information is obtained using methods and object-attributes.
Reporting usually provides views instead of containers to reduce memory
usage. The views update as the graph is updated similarly to dict-views.
The objects `nodes, `edges` and `adj` provide access to data attributes
via lookup (e.g. `nodes[n], `edges[u, v]`, `adj[u][v]`) and iteration
(e.g. `nodes.items()`, `nodes.data('color')`,
`nodes.data('color', default='blue')` and similarly for `edges`)
Views exist for `nodes`, `edges`, `neighbors()`/`adj` and `degree`.
For details on these and other miscellaneous methods, see below.
**Subclasses (Advanced):**
The MultiDiGraph class uses a dict-of-dict-of-dict-of-dict structure.
The outer dict (node_dict) holds adjacency information keyed by node.
The next dict (adjlist_dict) represents the adjacency information and holds
edge_key dicts keyed by neighbor. The edge_key dict holds each edge_attr
dict keyed by edge key. The inner dict (edge_attr_dict) represents
the edge data and holds edge attribute values keyed by attribute names.
Each of these four dicts in the dict-of-dict-of-dict-of-dict
structure can be replaced by a user defined dict-like object.
In general, the dict-like features should be maintained but
extra features can be added. To replace one of the dicts create
a new graph class by changing the class(!) variable holding the
factory for that dict-like structure. The variable names are
node_dict_factory, adjlist_inner_dict_factory, adjlist_outer_dict_factory,
and edge_attr_dict_factory.
node_dict_factory : function, (default: dict)
Factory function to be used to create the dict containing node
attributes, keyed by node id.
It should require no arguments and return a dict-like object
adjlist_outer_dict_factory : function, (default: dict)
Factory function to be used to create the outer-most dict
in the data structure that holds adjacency info keyed by node.
It should require no arguments and return a dict-like object.
adjlist_inner_dict_factory : function, (default: dict)
Factory function to be used to create the adjacency list
dict which holds multiedge key dicts keyed by neighbor.
It should require no arguments and return a dict-like object.
edge_key_dict_factory : function, (default: dict)
Factory function to be used to create the edge key dict
which holds edge data keyed by edge key.
It should require no arguments and return a dict-like object.
edge_attr_dict_factory : function, (default: dict)
Factory function to be used to create the edge attribute
dict which holds attrbute values keyed by attribute name.
It should require no arguments and return a dict-like object.
Typically, if your extension doesn't impact the data structure all
methods will inherited without issue except: `to_directed/to_undirected`.
By default these methods create a DiGraph/Graph class and you probably
want them to create your extension of a DiGraph/Graph. To facilitate
this we define two class variables that you can set in your subclass.
to_directed_class : callable, (default: DiGraph or MultiDiGraph)
Class to create a new graph structure in the `to_directed` method.
If `None`, a NetworkX class (DiGraph or MultiDiGraph) is used.
to_undirected_class : callable, (default: Graph or MultiGraph)
Class to create a new graph structure in the `to_undirected` method.
If `None`, a NetworkX class (Graph or MultiGraph) is used.
Examples
--------
Please see :mod:`~networkx.classes.ordered` for examples of
creating graph subclasses by overwriting the base class `dict` with
a dictionary-like object.
"""
# node_dict_factory = dict # already assigned in Graph
# adjlist_outer_dict_factory = dict
# adjlist_inner_dict_factory = dict
edge_key_dict_factory = dict
# edge_attr_dict_factory = dict
[docs] def __init__(self, incoming_graph_data=None, **attr):
"""Initialize a graph with edges, name, or graph attributes.
Parameters
----------
incoming_graph_data : input graph
Data to initialize graph. If incoming_graph_data=None (default)
an empty graph is created. The data can be an edge list, or any
NetworkX graph object. If the corresponding optional Python
packages are installed the data can also be a NumPy matrix
or 2d ndarray, a SciPy sparse matrix, or a PyGraphviz graph.
attr : keyword arguments, optional (default= no attributes)
Attributes to add to graph as key=value pairs.
See Also
--------
convert
Examples
--------
>>> G = nx.Graph() # or DiGraph, MultiGraph, MultiDiGraph, etc
>>> G = nx.Graph(name='my graph')
>>> e = [(1, 2), (2, 3), (3, 4)] # list of edges
>>> G = nx.Graph(e)
Arbitrary graph attribute pairs (key=value) may be assigned
>>> G = nx.Graph(e, day="Friday")
>>> G.graph
{'day': 'Friday'}
"""
self.edge_key_dict_factory = self.edge_key_dict_factory
DiGraph.__init__(self, incoming_graph_data, **attr)
@property
def adj(self):
"""Graph adjacency object holding the neighbors of each node.
This object is a read-only dict-like structure with node keys
and neighbor-dict values. The neighbor-dict is keyed by neighbor
to the edgekey-dict. So `G.adj[3][2][0]['color'] = 'blue'` sets
the color of the edge `(3, 2, 0)` to `"blue"`.
Iterating over G.adj behaves like a dict. Useful idioms include
`for nbr, datadict in G.adj[n].items():`.
The neighbor information is also provided by subscripting the graph.
So `for nbr, foovalue in G[node].data('foo', default=1):` works.
For directed graphs, `G.adj` holds outgoing (successor) info.
"""
return MultiAdjacencyView(self._succ)
@property
def succ(self):
"""Graph adjacency object holding the successors of each node.
This object is a read-only dict-like structure with node keys
and neighbor-dict values. The neighbor-dict is keyed by neighbor
to the edgekey-dict. So `G.adj[3][2][0]['color'] = 'blue'` sets
the color of the edge `(3, 2, 0)` to `"blue"`.
Iterating over G.adj behaves like a dict. Useful idioms include
`for nbr, datadict in G.adj[n].items():`.
The neighbor information is also provided by subscripting the graph.
So `for nbr, foovalue in G[node].data('foo', default=1):` works.
For directed graphs, `G.succ` is identical to `G.adj`.
"""
return MultiAdjacencyView(self._succ)
@property
def pred(self):
"""Graph adjacency object holding the predecessors of each node.
This object is a read-only dict-like structure with node keys
and neighbor-dict values. The neighbor-dict is keyed by neighbor
to the edgekey-dict. So `G.adj[3][2][0]['color'] = 'blue'` sets
the color of the edge `(3, 2, 0)` to `"blue"`.
Iterating over G.adj behaves like a dict. Useful idioms include
`for nbr, datadict in G.adj[n].items():`.
"""
return MultiAdjacencyView(self._pred)
[docs] def add_edge(self, u_for_edge, v_for_edge, key=None, **attr):
"""Add an edge between u and v.
The nodes u and v will be automatically added if they are
not already in the graph.
Edge attributes can be specified with keywords or by directly
accessing the edge's attribute dictionary. See examples below.
Parameters
----------
u_for_edge, v_for_edge : nodes
Nodes can be, for example, strings or numbers.
Nodes must be hashable (and not None) Python objects.
key : hashable identifier, optional (default=lowest unused integer)
Used to distinguish multiedges between a pair of nodes.
attr_dict : dictionary, optional (default= no attributes)
Dictionary of edge attributes. Key/value pairs will
update existing data associated with the edge.
attr : keyword arguments, optional
Edge data (or labels or objects) can be assigned using
keyword arguments.
Returns
-------
The edge key assigned to the edge.
See Also
--------
add_edges_from : add a collection of edges
Notes
-----
To replace/update edge data, use the optional key argument
to identify a unique edge. Otherwise a new edge will be created.
NetworkX algorithms designed for weighted graphs cannot use
multigraphs directly because it is not clear how to handle
multiedge weights. Convert to Graph using edge attribute
'weight' to enable weighted graph algorithms.
Default keys are generated using the method `new_edge_key()`.
This method can be overridden by subclassing the base class and
providing a custom `new_edge_key()` method.
Examples
--------
The following all add the edge e=(1, 2) to graph G:
>>> G = nx.MultiDiGraph()
>>> e = (1, 2)
>>> key = G.add_edge(1, 2) # explicit two-node form
>>> G.add_edge(*e) # single edge as tuple of two nodes
1
>>> G.add_edges_from( [(1, 2)] ) # add edges from iterable container
[2]
Associate data to edges using keywords:
>>> key = G.add_edge(1, 2, weight=3)
>>> key = G.add_edge(1, 2, key=0, weight=4) # update data for key=0
>>> key = G.add_edge(1, 3, weight=7, capacity=15, length=342.7)
For non-string attribute keys, use subscript notation.
>>> ekey = G.add_edge(1, 2)
>>> G[1][2][0].update({0: 5})
>>> G.edges[1, 2, 0].update({0: 5})
"""
u, v = u_for_edge, v_for_edge
# add nodes
if u not in self._succ:
self._succ[u] = self.adjlist_inner_dict_factory()
self._pred[u] = self.adjlist_inner_dict_factory()
self._node[u] = {}
if v not in self._succ:
self._succ[v] = self.adjlist_inner_dict_factory()
self._pred[v] = self.adjlist_inner_dict_factory()
self._node[v] = {}
if key is None:
key = self.new_edge_key(u, v)
if v in self._succ[u]:
keydict = self._adj[u][v]
datadict = keydict.get(key, self.edge_key_dict_factory())
datadict.update(attr)
keydict[key] = datadict
else:
# selfloops work this way without special treatment
datadict = self.edge_attr_dict_factory()
datadict.update(attr)
keydict = self.edge_key_dict_factory()
keydict[key] = datadict
self._succ[u][v] = keydict
self._pred[v][u] = keydict
return key
[docs] def remove_edge(self, u, v, key=None):
"""Remove an edge between u and v.
Parameters
----------
u, v : nodes
Remove an edge between nodes u and v.
key : hashable identifier, optional (default=None)
Used to distinguish multiple edges between a pair of nodes.
If None remove a single (arbitrary) edge between u and v.
Raises
------
NetworkXError
If there is not an edge between u and v, or
if there is no edge with the specified key.
See Also
--------
remove_edges_from : remove a collection of edges
Examples
--------
>>> G = nx.MultiDiGraph()
>>> nx.add_path(G, [0, 1, 2, 3])
>>> G.remove_edge(0, 1)
>>> e = (1, 2)
>>> G.remove_edge(*e) # unpacks e from an edge tuple
For multiple edges
>>> G = nx.MultiDiGraph()
>>> G.add_edges_from([(1, 2), (1, 2), (1, 2)]) # key_list returned
[0, 1, 2]
>>> G.remove_edge(1, 2) # remove a single (arbitrary) edge
For edges with keys
>>> G = nx.MultiDiGraph()
>>> G.add_edge(1, 2, key='first')
'first'
>>> G.add_edge(1, 2, key='second')
'second'
>>> G.remove_edge(1, 2, key='second')
"""
try:
d = self._adj[u][v]
except KeyError:
raise NetworkXError(
"The edge %s-%s is not in the graph." % (u, v))
# remove the edge with specified data
if key is None:
d.popitem()
else:
try:
del d[key]
except KeyError:
msg = "The edge %s-%s with key %s is not in the graph."
raise NetworkXError(msg % (u, v, key))
if len(d) == 0:
# remove the key entries if last edge
del self._succ[u][v]
del self._pred[v][u]
@property
def edges(self):
"""An OutMultiEdgeView of the Graph as G.edges or G.edges().
edges(self, nbunch=None, data=False, keys=False, default=None)
The OutMultiEdgeView provides set-like operations on the edge-tuples
as well as edge attribute lookup. When called, it also provides
an EdgeDataView object which allows control of access to edge
attributes (but does not provide set-like operations).
Hence, `G.edges[u, v]['color']` provides the value of the color
attribute for edge `(u, v)` while
`for (u, v, c) in G.edges(data='color', default='red'):`
iterates through all the edges yielding the color attribute
with default `'red'` if no color attribute exists.
Edges are returned as tuples with optional data and keys
in the order (node, neighbor, key, data).
Parameters
----------
nbunch : single node, container, or all nodes (default= all nodes)
The view will only report edges incident to these nodes.
data : string or bool, optional (default=False)
The edge attribute returned in 3-tuple (u, v, ddict[data]).
If True, return edge attribute dict in 3-tuple (u, v, ddict).
If False, return 2-tuple (u, v).
keys : bool, optional (default=False)
If True, return edge keys with each edge.
default : value, optional (default=None)
Value used for edges that don't have the requested attribute.
Only relevant if data is not True or False.
Returns
-------
edges : EdgeView
A view of edge attributes, usually it iterates over (u, v)
(u, v, k) or (u, v, k, d) tuples of edges, but can also be
used for attribute lookup as `edges[u, v, k]['foo']`.
Notes
-----
Nodes in nbunch that are not in the graph will be (quietly) ignored.
For directed graphs this returns the out-edges.
Examples
--------
>>> G = nx.MultiDiGraph()
>>> nx.add_path(G, [0, 1, 2])
>>> key = G.add_edge(2, 3, weight=5)
>>> [e for e in G.edges()]
[(0, 1), (1, 2), (2, 3)]
>>> list(G.edges(data=True)) # default data is {} (empty dict)
[(0, 1, {}), (1, 2, {}), (2, 3, {'weight': 5})]
>>> list(G.edges(data='weight', default=1))
[(0, 1, 1), (1, 2, 1), (2, 3, 5)]
>>> list(G.edges(keys=True)) # default keys are integers
[(0, 1, 0), (1, 2, 0), (2, 3, 0)]
>>> list(G.edges(data=True, keys=True))
[(0, 1, 0, {}), (1, 2, 0, {}), (2, 3, 0, {'weight': 5})]
>>> list(G.edges(data='weight', default=1, keys=True))
[(0, 1, 0, 1), (1, 2, 0, 1), (2, 3, 0, 5)]
>>> list(G.edges([0, 2]))
[(0, 1), (2, 3)]
>>> list(G.edges(0))
[(0, 1)]
See Also
--------
in_edges, out_edges
"""
return OutMultiEdgeView(self)
# alias out_edges to edges
out_edges = edges
@property
def in_edges(self):
"""An InMultiEdgeView of the Graph as G.in_edges or G.in_edges().
in_edges(self, nbunch=None, data=False, keys=False, default=None)
Parameters
----------
nbunch : single node, container, or all nodes (default= all nodes)
The view will only report edges incident to these nodes.
data : string or bool, optional (default=False)
The edge attribute returned in 3-tuple (u, v, ddict[data]).
If True, return edge attribute dict in 3-tuple (u, v, ddict).
If False, return 2-tuple (u, v).
keys : bool, optional (default=False)
If True, return edge keys with each edge.
default : value, optional (default=None)
Value used for edges that don't have the requested attribute.
Only relevant if data is not True or False.
Returns
-------
in_edges : InMultiEdgeView
A view of edge attributes, usually it iterates over (u, v)
or (u, v, k) or (u, v, k, d) tuples of edges, but can also be
used for attribute lookup as `edges[u, v, k]['foo']`.
See Also
--------
edges
"""
return InMultiEdgeView(self)
@property
def degree(self):
"""A DegreeView for the Graph as G.degree or G.degree().
The node degree is the number of edges adjacent to the node.
The weighted node degree is the sum of the edge weights for
edges incident to that node.
This object provides an iterator for (node, degree) as well as
lookup for the degree for a single node.
Parameters
----------
nbunch : single node, container, or all nodes (default= all nodes)
The view will only report edges incident to these nodes.
weight : string or None, optional (default=None)
The name of an edge attribute that holds the numerical value used
as a weight. If None, then each edge has weight 1.
The degree is the sum of the edge weights adjacent to the node.
Returns
-------
If a single nodes is requested
deg : int
Degree of the node
OR if multiple nodes are requested
nd_iter : iterator
The iterator returns two-tuples of (node, degree).
See Also
--------
out_degree, in_degree
Examples
--------
>>> G = nx.MultiDiGraph()
>>> nx.add_path(G, [0, 1, 2, 3])
>>> G.degree(0) # node 0 with degree 1
1
>>> list(G.degree([0, 1, 2]))
[(0, 1), (1, 2), (2, 2)]
"""
return DiMultiDegreeView(self)
@property
def in_degree(self):
"""A DegreeView for (node, in_degree) or in_degree for single node.
The node in-degree is the number of edges pointing in to the node.
The weighted node degree is the sum of the edge weights for
edges incident to that node.
This object provides an iterator for (node, degree) as well as
lookup for the degree for a single node.
Parameters
----------
nbunch : single node, container, or all nodes (default= all nodes)
The view will only report edges incident to these nodes.
weight : string or None, optional (default=None)
The edge attribute that holds the numerical value used
as a weight. If None, then each edge has weight 1.
The degree is the sum of the edge weights adjacent to the node.
Returns
-------
If a single node is requested
deg : int
Degree of the node
OR if multiple nodes are requested
nd_iter : iterator
The iterator returns two-tuples of (node, in-degree).
See Also
--------
degree, out_degree
Examples
--------
>>> G = nx.MultiDiGraph()
>>> nx.add_path(G, [0, 1, 2, 3])
>>> G.in_degree(0) # node 0 with degree 0
0
>>> list(G.in_degree([0, 1, 2]))
[(0, 0), (1, 1), (2, 1)]
"""
return InMultiDegreeView(self)
@property
def out_degree(self):
"""Return an iterator for (node, out-degree) or out-degree for single node.
out_degree(self, nbunch=None, weight=None)
The node out-degree is the number of edges pointing out of the node.
This function returns the out-degree for a single node or an iterator
for a bunch of nodes or if nothing is passed as argument.
Parameters
----------
nbunch : single node, container, or all nodes (default= all nodes)
The view will only report edges incident to these nodes.
weight : string or None, optional (default=None)
The edge attribute that holds the numerical value used
as a weight. If None, then each edge has weight 1.
The degree is the sum of the edge weights.
Returns
-------
If a single node is requested
deg : int
Degree of the node
OR if multiple nodes are requested
nd_iter : iterator
The iterator returns two-tuples of (node, out-degree).
See Also
--------
degree, in_degree
Examples
--------
>>> G = nx.MultiDiGraph()
>>> nx.add_path(G, [0, 1, 2, 3])
>>> G.out_degree(0) # node 0 with degree 1
1
>>> list(G.out_degree([0, 1, 2]))
[(0, 1), (1, 1), (2, 1)]
"""
return OutMultiDegreeView(self)
def is_multigraph(self):
"""Return True if graph is a multigraph, False otherwise."""
return True
def is_directed(self):
"""Return True if graph is directed, False otherwise."""
return True
[docs] def to_undirected(self, reciprocal=False, as_view=False):
"""Return an undirected representation of the digraph.
Parameters
----------
reciprocal : bool (optional)
If True only keep edges that appear in both directions
in the original digraph.
as_view : bool (optional, default=False)
If True return an undirected view of the original directed graph.
Returns
-------
G : MultiGraph
An undirected graph with the same name and nodes and
with edge (u, v, data) if either (u, v, data) or (v, u, data)
is in the digraph. If both edges exist in digraph and
their edge data is different, only one edge is created
with an arbitrary choice of which edge data to use.
You must check and correct for this manually if desired.
See Also
--------
MultiGraph, copy, add_edge, add_edges_from
Notes
-----
This returns a "deepcopy" of the edge, node, and
graph attributes which attempts to completely copy
all of the data and references.
This is in contrast to the similar D=MultiiGraph(G) which
returns a shallow copy of the data.
See the Python copy module for more information on shallow
and deep copies, https://docs.python.org/2/library/copy.html.
Warning: If you have subclassed MultiDiGraph to use dict-like
objects in the data structure, those changes do not transfer
to the MultiGraph created by this method.
Examples
--------
>>> G = nx.path_graph(2) # or MultiGraph, etc
>>> H = G.to_directed()
>>> list(H.edges)
[(0, 1), (1, 0)]
>>> G2 = H.to_undirected()
>>> list(G2.edges)
[(0, 1)]
"""
graph_class = self.to_undirected_class()
if as_view is True:
return nx.graphviews.generic_graph_view(self, graph_class)
# deepcopy when not a view
G = graph_class()
G.graph.update(deepcopy(self.graph))
G.add_nodes_from((n, deepcopy(d)) for n, d in self._node.items())
if reciprocal is True:
G.add_edges_from((u, v, key, deepcopy(data))
for u, nbrs in self._adj.items()
for v, keydict in nbrs.items()
for key, data in keydict.items()
if v in self._pred[u] and key in self._pred[u][v])
else:
G.add_edges_from((u, v, key, deepcopy(data))
for u, nbrs in self._adj.items()
for v, keydict in nbrs.items()
for key, data in keydict.items())
return G
[docs] def reverse(self, copy=True):
"""Return the reverse of the graph.
The reverse is a graph with the same nodes and edges
but with the directions of the edges reversed.
Parameters
----------
copy : bool optional (default=True)
If True, return a new DiGraph holding the reversed edges.
If False, the reverse graph is created using a view of
the original graph.
"""
if copy:
H = self.__class__()
H.graph.update(deepcopy(self.graph))
H.add_nodes_from((n, deepcopy(d)) for n, d in self._node.items())
H.add_edges_from((v, u, k, deepcopy(d)) for u, v, k, d
in self.edges(keys=True, data=True))
return H
return nx.graphviews.reverse_view(self)


11 Jun 2016
Manali II - No, tell me more about this weed!
So, Manali. I’ll remember Manali as one of the many places I would have liked to explore further. Since my silly eTourist visa only let me stay in India for 30 days, I only spent a total of 1.5 days in Manali…about as much time as I spent on the bus there and back.
The landscapes around Manali are strikingly beautiful, with forrest-covered mountains, roaring waterfalls and staggering views just begging to be explored in extended hikes. Due to the time constraint (and lack of equipment) I decided to limit my excursions to Manali town. Manali itself is distinctly tourist-y, with that in-your-face mixture of western-style cafes and restaurants, clothes that go well with dreadlocks and a hundred travel agencies.
Four things I recall most keenly:
Weather
The first thing I noticed up there: I did not feel like I was being roasted alive on a pyre of burning stars! Due to the altitude the state of Himachal Pradesh enjoys a temperate climate (and snow in winter!) which felt incredibly refreshing as I had been sweat-soaked ever since I left the Georgian mountains two months earlier. When I reached Manali it was a rainy, foggy, somewhat windy 13°C and loved every second of it.
The climate also means that the countryside looks a lot more like the Northern Europe I’m used to. Walking around town in the shade of the tall conifers made me feel oddly…home.
Historical sidenote: The British Raj had its summer residence in the town of Shimla, some hundred kilometers south of Manali for this very reason: British people are as ill-suited for the Indian summer as I am.
Plant life
Given the sheer abundance of natural beauty there is a ton of things you can do. You can buy weed, sell weed, cook with weed, eat weed, drink weed, buy weed paraphernalia, and some people apparently even smoke weed.
And more importantly, you can talk about weed. Since weed is clearly the most interesting topic in the world, there are so many facets to be discussed, weed-smoking-anecdotes to be recounted and hopes of future weed-related adventures to be shared.
This is a view widely shared amongst the crowds of Israeli and Russian backpackers that tend to prowl that whole triangle between Dharamsala, Rishikesh and Manali. Talking to them I found out that some of them had ended up staying in Manali for months when they had planned on staying a few days. Almost as if something made them a bit lazy and passive…
Since I’m not that interested in this side of botany (or other chemical experiments conducted there), I was glad to find two people who were also more interested in the town and we had a look around the town and its surroundings despite the unpredicatable weather and frequent rain.
Mud. Mud everywhere
Oh yes, rain. In a town that doesn’t really do paved roads and is blessed with livestock aplenty. Basically most of Manali is mud of various origins and when I was there I stood in it up to my ankles.
Who said boots weren’t any good for travel in India? For the record: They are. They are absolutely perfect for that.
Impossible interwebs
I had one last educational moment when I logged onto the homestay wifi to send a few emails. Nothing much seemed to happen connection-wise and I tried a ping-command, just to see how bad things were. Oh boy…
The ping tool sends a stream of data packets to a specified destination and measures how long it takes to return. When I ping google.com from home, I get times of 20-50ms. In Manali I did not see any replies coming back at all. Yet the packets did not time out either. Frustrated, I headed out for dinner and when I got back I saw that my loyal packets had indeed returned.
64 bytes from <IP_ADDRESS>: icmp_seq=3212 ttl=46 time=1614652.104 ms
64 bytes from <IP_ADDRESS>: icmp_seq=3213 ttl=46 time=1613654.267 ms
64 bytes from <IP_ADDRESS>: icmp_seq=3214 ttl=46 time=1612656.231 ms
64 bytes from <IP_ADDRESS>: icmp_seq=3217 ttl=46 time=1609908.252 ms
64 bytes from <IP_ADDRESS>: icmp_seq=3218 ttl=46 time=1608912.793 ms
Yes, measured times of 1.6 million ms. That’s 27 minutes.  Either way, I had a good laugh and went to bed.
Until next time,
Arne


{{content}}
{% if page.menu_section == 'query' %}
Be sure to read the original documentation
on this subject.
{% endif %}
Spotted a mistake? Something to add? Fork and edit this file on github without leaving the browser


Plymouth State Programming Team
Fall 2019 Meetings
We meet on Tuesdays from 4-5pm in Memorial 304.
Current Team Members
- Madeleine Gibson
- Rob Kram
- Eric Osgood
- Ryan Latorella
- Mitch Wiig
- Jess Brusa
- Owen Day
- Lucy Lafierrere
Possible Team Members
- Joe Chase
- Charlie Hemenway
- Amelia Rowland
Team Alumni
- Gillian McCreedy '19
- Candace Boris '18
- Dan Burgess '18
- Marcus Gobis '18
- Matt Ferland '18
- Beth Longe '17
- Austin McGuire '17
- Kelsey Neil '16
- Vaughn Coder '15
- Ben Higman '15
Joining Up
Want to join the team? Let Kyle Burke know!
Future Competitions
- October 13, 2018: BOSPRE 2018
Teams:
- '); DROP TABLE Teams; -- : Madeleine G, Charlie H, Rob K
- Team [Sample Text]: Jess B, Ryan L, Mitch W.
Prior Competitions
April 20, 2018: UNH Manchester
Team: Candace Boris, Madeleine Gibson, Charlie Hemenway, Dan Burgess (alternate)
ACM ICPC Regionals 2017
Competition information here
View Scoreboard


Full papers submitted to HCOMP 2016 will be evaluated according to the following review criteria. Our intent in posting review criteria online is to further improve transparency of the conference's peer-review process and to provide additional guidance to authors in preparing their submissions (especially for young researchers, as well as researchers from diverse disciplines).
Feedback or suggestions for further improving these review criteria? Tweet us @hcomp_conf or email us at<EMAIL_ADDRESS>When writing acknowledgments in the final, camera-ready versions of accepted papers, we encourage authors to thank their crowd contributors. After all, we couldn't conduct our research or run our crowd-powered systems without the many individual contributors who choose to participate!


Sneha Sat Vision is Providing Cable TV services for more than 25 years in Ramapuram. We upgrade ourselves with latest technology and services in the due course. We also provide reliable and fast services to our customers. With this success we now step into BROADBAND services.
We provide Digital Set Top Boxes, Digital High Definition(HD) set top boxes and Analogue cable services. Contact us to subscribe.
1/23B, Ist Main Road, Venkateshwara Nagar, Ramapuram, Chennai 89
044 - 24761042
9003245502
<EMAIL_ADDRESS>Your feedback is of high value to us. Please provide us with your suggestions and feedback.


Man arrested after boy, 11, knocked off his bike and killed in quiet village
The crash happened in Ansley Common, Warwickshire, at 2.40pm on Saturday, and the schoolboy died in hospital
by Dave BurkeA man has been arrested after an 11-year-old boy was killed when he was knocked off his bicycle in a village.
Police were called after the collision in Ansley Common, Nuneaton, Warwickshire, at 2.40pm yesterday.
A doctor who was passing the scene gave treatment to the young boy, but tragically he was pronounced dead at University Hospital Coventry.
His family has been informed.
A spokesperson for the Warwickshire Police Serious Collision Investigation Team said: “This is a tragic incident and we’re appealing to anyone who may have witnessed what happened or was passing with dash cameras in this location to please contact us.
“Our thoughts are with the boy’s family at this time.”
A man has been arrested in connection with the incident and later released under investigation.
Anyone with information has been urged to contact police by calling 101 quoting incident number 215 of 2 November 2019.


The browser prompter for macOS
Multi-Default
After clicking a link, use the picker to choose the correct browser for the job.
Favourite
Quickly open your usual browser using the SPACE key.
URL Bar
Make sure the website you are about to open is the one you are expecting.
Browserosaurus is FREE. However, please consider sponsorship. Doing so will help me cover the cost of future development and the fee charged by Apple to release software on their operating system.
FAQ
Why does Browserosaurus ask to be set as my default browser?
This is required for Browserosaurus to know that a link has been
clicked. You can change this at any time by going to
System Preferences > General > Default web browser
and (de)selecting Browserosaurus.
How do I set my favourite browser?
A favourite browser will open when the SPACE key is pressed, and is therefore an easier target to hit. You can set your favourite in the settings menu.
I would like to open a particular browser automatically for specific URLs.
Browserosaurus does not provide a method for automatically selecting browsers, rather opting for the consistency that the picker window will show every time. If you would like to be able set rules, I highly recommend Finicky by John Sterling which can very easily be used in tandem with Browserosaurus, meaning the best of both worlds: a rules engine and a graphical interface.
The picker window is very slow to display.
The app needs to be running in the background for the picker window to show immediately. You can confirm Browserosaurus is running by looking for the "B" icon in the menubar. If Browserosaurus is not currently running, it can take a few seconds until it is available. Each subsequently clicked link will open the picker window promptly.
I'm clicking links in my browser but Browserosaurus does not show.
Only links clicked outside of browsers will open Browserosaurus. This is by design.
How do I open a link in the background?
Hold the ALT key when selecting a browser.
How do I open a link in private/incognito mode?
Hold the SHIFT key when selecting a browser.
Does Browserosaurus collect any of my data and send it to an online service?
No.
Not even the link I click?
Nope. The only outgoing call Browserosaurus makes is to check for an update.
I installed or removed a browser but I'm not seeing this updated in the picker window.
Browserosaurus checks for installed browsers when it is first opened. Clicking the reload button (in the settings menu) will reload the app, triggering a new scan for installed browsers.
I have a browser that's not shown in the picker window, even after reloading Browserosaurus.
Browserosaurus operates on a
whitelist
basis. If you would like a browser added, please
raise an issue.
Spotlight indexing for applications is required, so please ensure
that indexing for applications is enabled in the Spotlight
settings.
Why/how is this free?
Browserosaurus has by far been the most enjoyable project I've ever created and this comes from the fact that I use it every day. Being a fan of open source software, I thought I'd share it with the world. But just because it's free for you does not mean it is free to make. Personal time aside, Apple charges a yearly subscription that I must pay for the app to work correctly on your machine. If you love Browserosaurus as much as I do, please consider sponsoring its future development. Thank you.
I have a question that is not answered here.
If you have any issues or feature requests please raise an issue on the GitHub repository.


6.5. Mathematical Functions and Operators
Mathematical Operators
| Operator | Description |
|---|---|
+ |
Addition |
- |
Subtraction |
* |
Multiplication |
/ |
Division (integer division performs truncation) |
% |
Modulus (remainder) |
Mathematical Functions
-
abs
(x) → [same as input] Returns the absolute value of
x
.
-
cbrt
(x) → double Returns the cube root of
x
.
-
ceil
(x) → [same as input] This is an alias for
ceiling()
.
-
ceiling
(x) → [same as input] Returns
x
rounded up to the nearest integer.
-
cosine_similarity
(x, y) → double Returns the cosine similarity between the sparse vectors
x
andy
:SELECT cosine_similarity(MAP(ARRAY['a'], ARRAY[1.0]), MAP(ARRAY['a'], ARRAY[2.0])); -- 1.0
-
degrees
(x) → double Converts angle
x
in radians to degrees.
-
e
() → double Returns the constant Euler’s number.
-
exp
(x) → double Returns Euler’s number raised to the power of
x
.
-
floor
(x) → [same as input] Returns
x
rounded down to the nearest integer.
-
from_base
(string, radix) → bigint Returns the value of
string
interpreted as a base-radix
number.
-
ln
(x) → double Returns the natural logarithm of
x
.
-
log2
(x) → double Returns the base 2 logarithm of
x
.
-
log10
(x) → double Returns the base 10 logarithm of
x
.
-
log
(x, b) → double Returns the base
b
logarithm ofx
.
-
mod
(n, m) → [same as input] Returns the modulus (remainder) of
n
divided bym
.
-
pi
() → double Returns the constant Pi.
-
pow
(x, p) → double This is an alias for
power()
.
-
power
(x, p) → double Returns
x
raised to the power ofp
.
-
radians
(x) → double Converts angle
x
in degrees to radians.
-
rand
() → double This is an alias for
random()
.
-
random
() → double Returns a pseudo-random value in the range 0.0 <= x < 1.0.
-
random
(n) → [same as input] Returns a pseudo-random number between 0 and n (exclusive).
-
round
(x) → [same as input] Returns
x
rounded to the nearest integer.
-
round
(x, d) → [same as input] Returns
x
rounded tod
decimal places.
-
sign
(x) → [same as input] Returns the signum function of
x
, that is:- 0 if the argument is 0,
- 1 if the argument is greater than 0,
- -1 if the argument is less than 0.
For double arguments, the function additionally returns:
- NaN if tha argument is NaN,
- 1 if the argument is +Infinity,
- -1 if the argument is -Infinity.
-
sqrt
(x) → double Returns the square root of
x
.
-
to_base
(x, radix) → varchar Returns the base-
radix
representation ofx
.
-
truncate
(x) → double Returns
x
rounded to integer by dropping digits after decimal point.
-
width_bucket
(x, bound1, bound2, n) → bigint Returns the bin number of
x
in an equi-width histogram with the specifiedbound1
andbound2
bounds andn
number of buckets.
-
width_bucket
(x, bins) → bigint Returns the bin number of
x
according to the bins specified by the arraybins
. Thebins
parameter must be an array of doubles and is assumed to be in sorted ascending order.
Trigonometric Functions
All trigonometric function arguments are expressed in radians.
See unit conversion functions degrees()
and radians()
.
-
acos
(x) → double Returns the arc cosine of
x
.
-
asin
(x) → double Returns the arc sine of
x
.
-
atan
(x) → double Returns the arc tangent of
x
.
-
atan2
(y, x) → double Returns the arc tangent of
y / x
.
-
cos
(x) → double Returns the cosine of
x
.
-
cosh
(x) → double Returns the hyperbolic cosine of
x
.
-
sin
(x) → double Returns the sine of
x
.
-
tan
(x) → double Returns the tangent of
x
.
-
tanh
(x) → double Returns the hyperbolic tangent of
x
.
Floating Point Functions
-
infinity
() → double Returns the constant representing positive infinity.
-
is_finite
(x) → boolean Determine if
x
is finite.
-
is_infinite
(x) → boolean Determine if
x
is infinite.
-
is_nan
(x) → boolean Determine if
x
is not-a-number.
-
nan
() → double Returns the constant representing not-a-number.


First name:
Family name:
Hello {{.first-name}} {{.last-name}}!
Please enter your name in the input boxes above.


Lorem ipsum dolor sit amet consectetur, adipisicing elit. Ratione perferendis quod animi dignissimos consectetur quibusdam numquam laboriosam, minus, provident...
Some quick example text to build on the card title and make up the bulk of the card's content.
Some quick example text to build on the card title and make up the bulk of the card's content.
Some quick example text to build on the card title and make up the bulk of the card's content.
Some quick example text to build on the card title and make up the bulk of the card's content.


A privacy policy is made to keep the records of personal information of the visitors of the site in order to
keep a check on the activities of the users so that a website can be more improved according to the requirements
of a customer.
We ensure all our customers that the personal information collected from them will be kept confidential and will
only be used in order to serve them and will not be share or sell to anyone.
Our website use cookies in order to improve your browsing experience, you can accept or dismiss by scrolling
down. You can discontinue the use of our site if you don’t agree with any terms found in this privacy policy.
We usually collects your general personal information such as your name, email address, contact number, your
address, passwords, your security data, payment information, your social media login data which can be further
used for authentication and account access if you make any purchases.
All the personal and payment details are well stored by our customer care center and are kept totally
confidential.
You are requested to provide us the correct information, and all the data provided by use should not be fake
otherwise a strict legal action might be taken from our website.
Each product bought from our website will have different criteria of shipment and we offer free shipping to most
of the cities and it would take 2-3 working days.


Welcome to Douglas County Libraries, where exciting things happen every day at
our seven library locations. When you join our team, you become part of a dynamic network of doers. Differing talents and diverse backgrounds are valued. Yes, we work hard, but we also infuse fun (and integrity and excellence) into everything we do. And what we do is engage, educate and entertain Douglas County residents to transform lives and build community. You, too, can contribute to this narrative.
Join Our Team!


This would be more of a technical than a scientific update, but it could be useful if it contained links to the new bits on the website.


poultry HPAI workers virus market farm influenza live markets antibody bird (%) PubMed: reported Influenza farms Avian collab: infection neutralizing {border-style avian Bangladesh px;} study #ffffff;} outbreaks protective confirmed vs. (HN) using workers, (–) Health exposure <. culling days illness personal Virus antibodies contact risk titer titers Bangladesh, Table blood clade measures time Bangladesh. Dis Infect age: assay human identified seroprevalence use workers. years, (mean activities compared die-offs low p=.), test worker Disease Organization case exposures markets. poultry. px; sold {font-family Control Hong Live Poultry Research Workers birds collected did direct duration feeding field font-size laboratory microneutralization respiratory samples serum surveillance transmission viruses water (%), (N=) Dhaka Median P-value Rahman World available collection conducted daily day double; enrolled evidence infections pathogenic serologic used virus. work < (IQR) (clade Contact DLS Dhaka, Institute Kong Science border-color border-width chickens confidence data dead defeathered detection eviscerated hemagglutination highly horse inhibition months occupational outbreak poultry, proportions solid; suspected two-sample virus-infected years {font-style {font-weight (IEDCR) ./journal.pone.. Antibodies Bangladesh: CDC Emerg Highly Khan Ministry Questionnaire Risk WHO) Wang Wore [/] [/], age assays. avian-to-human blot bold caged cases cell close courier; criteria detected died em; employment environmental estimated factors farms. higher humans including interval likely male mild months, oseltamivir performed post-exposure pt;} red regular response rest results seropositive sick study. tested tray trays


YumiBoat is a multipurpose discord bot.
She is a discord bot with SOOOO many commands.


New release is now available for developers. Just a sketch, the early beginning. If project were alive it`s not yet hatchet, not even cracked, but millions of people still live, just concentrate on this on a positive moment.


Anonymous Project Execute (script)
Populate
/examples/config.json
with the proper values before running.
Open the browser's debug window to view print logs for this example.
View
documentation
for more information.


WaDE [WaDE2.0_schema_star.xml]
| Name | ReportingUnitUUID |
| Comment | A reporting unit is the geospatial area that is used to aggregate the water supply, withdrawal, or consumptive use. The ReportingUnitID is the unique identification number for the geospatial area. It could be a 5-digit FIPs code for a county, a 12-digit code for a HUC (or fewer digits), or a custom number created by the data provider. The data provider should concatenate their OrganizationID + custom identifier to ensure this number is unique. |
| Data Type | NVarChar(250) |
| Primary Key | |
| Nulls | |
| Auto Num. | |
| Default | |
| FK |


Bucket of Fish by Thomas Hawk is marked with CC0 1.0
Deep Fried Shamu*
*Disclaimer: Seaworld is an awful institution. Fvck Seaworld


Fill-in form for comments (Your browser must support forms)
Web Site Information
Web Site Disclaimer and conditions
James Barrott |<EMAIL_ADDRESS>| Last updated: 23 October 1995 | © Crown Copyright 1995


Websites grant easy access to your information worldwide. Work with me to greatly improve your image with a fully featured site without the hassle.
0$ Hosting Consulting
Digital Ownership Transfer
Live Web Demos
Logos, Infographics, and 3D models are great communcation tools and if done right, can take an idea to a whole new level. Work with me to create one of a kind graphics for your projects.
Vector Graphic Logos
3D High/Low Poly Models
High Resolution Graphics
Take your brand to the next level with a crisp logo, or a shiny investor presentation. Work with me to improve the aesthetics of your work, and nail your next meeting, assignment, or product.
Image to Vector Graphics
Custom Clipart Creation
Stylized Icon Packs
Competitive Pricing Skilled Work Live Demos Freshbooks Billing Digital Ownership transfer Fast Communication


-
USER MANAGEMENTMultiple Admin facilities for easy management of Users.
INVOICE MANAGEMENTMultiple Cashiers can handle multiple customers parallely and generate their invoices instantly.
INVENTORY MANAGEMENTBuilt-In Inventory Management system to track your warehouse and manage them.
REPORT GENERATIONGenerate billing reports and stock reports to easily track your finances.
-
FAST & SECUREDonecos arem ipsum sit amet consectetur adipisicing elit sed eiusmod tempor incididunt ut donecos dolore ipsum temporest.
CLEAN DESIGNDisum lorem sit amet consectetur adipisicing elit sed eiusmod tempor incididunt ut donecos dolore ipsum temporest.
PRECISE STOCK CONTROLPolor sit amet consectetur adipisicing elit sed eiusmod tempor incididunt ut dolore magna labore eiusmod.


--- layout: post date: 2006-02-23 time: "09:00:00" author: "Greg Wilson" title: Database Lecture is Up category: ["Content"] ---
The lecture on databases (actually an introduction to SQL) is now up. Comments and corrections welcome.


CelOS comes with the Epiphany Browser by GNOME by default. Epiphany comes with an ad-blocker preinstalled and has a beautiful design that matches your system theme!
CelOS comes with the Epiphany Browser by GNOME by default. Epiphany comes with an ad-blocker preinstalled and has a beautiful design that matches your system theme!


{% include "head.html" %}
{% include "navbar.html" %}
You have been logged out
{% include "footer.html" %}


I'm very cute, and I'm looking for a new home.
I was found on the road in Arrabe village, and was rescued by Avishag.
I'm very cute, and I'm looking for a new home.
I was found on the road in Arrabe village, and was rescued by Avishag.
Meow, meow, meow, meow, meow, meow
Meow, meow, meow, meow, meow, meow
Meow, meow, meow, meow, meow, meow
Meow, meow, meow, meow, meow


Password Generator
Master Password:
Checksum is
From Reminder List
From Reminder
New Password
Numbers
Letters
Spaces
Common Symbols
Less Common Symbols
Code:
Reminder Source:
Reminder:
Reminder:
Password:
Press Ctrl-C or ⌘C to copy to the clipboard.


:(
Your PC ran into a problem and needs to restart. We're just collecting some error info, and then we'll restart for you. (0% Complete)
If you'd like to know more, you can search online later for this error: HAL_INITIALIZATION_FAILED
If you'd like to know more, you can search online later for this error: HAL_INITIALIZATION_FAILED


Home
Portfolio
Contact
Mary Jacobs
PROJECTS
Camp Map
Flours
Mandolin Orange
Swimming Pool
State Fair


|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object com.nhn.android.maps.NMapOverlay com.nhn.android.maps.NMapItemizedOverlay
public abstract class NMapItemizedOverlay
A base class for an NMapOverlay which consists of a list of NMapOverlayItems. This handles sorting north-to-south for drawing, creating span bounds, drawing a marker for each point, and maintaining a focused item. It also matches screen-taps to items, and dispatches Focus-change events to an optional listener.
| Nested Class Summary | |
|---|---|
static interface |
NMapItemizedOverlay.OnFocusChangeListener
Interface for listeners interested in when the focused Item changes. |
| Constructor Summary | |
|---|---|
NMapItemizedOverlay(Drawable defaultMarker)
Create a new NMapItemizedOverlay. |
| Method Summary | |
|---|---|
void |
draw(Canvas canvas,
NMapView mapView,
boolean shadow)
Draw a marker on each of our items. |
void |
drawFocusedItem(Canvas canvas,
NMapView mapView,
boolean shadow)
Draw the focused item to put it visually on top of the other items. |
NMapOverlayItem |
getFocus()
|
Rect |
getItemBounds(NMapOverlayItem item)
Get bounds of the specified item in screen coordinates. |
boolean |
isInfoLayersVisible()
|
boolean |
onTap(int px,
int py,
NMapView mapView)
Handle a tap event. |
boolean |
onTouchEvent(MotionEvent event,
NMapView mapView)
Handle a touch event. |
boolean |
onTrackballEvent(MotionEvent event,
NMapView mapView)
Handle a trackball event. |
boolean |
setHiddenExceptEndItems(boolean enable,
int extraExceptionalItem)
|
void |
setOnFocusChangeListener(NMapItemizedOverlay.OnFocusChangeListener listenr)
Set the foucus change listenr |
void |
showAllItems()
|
void |
showFocusedItemOnly()
|
boolean |
showInfoLayers(boolean enable)
|
abstract int |
size()
The number of items in this overlay. |
| Methods inherited from class com.nhn.android.maps.NMapOverlay |
|---|
draw, drawAt, hasPathData, isDrawnOnSnapshot, isHidden, isPersistent, onKeyDown, onKeyUp, setHidden |
| Methods inherited from class java.lang.Object |
|---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public NMapItemizedOverlay(Drawable defaultMarker)
defaultMarker
- A Drawable to be drawn on the map for each item in the overlay| Method Detail |
|---|
public abstract int size()
public Rect getItemBounds(NMapOverlayItem item)
public void draw(Canvas canvas, NMapView mapView, boolean shadow)
draw
in class NMapOverlay
canvas
- The Canvas upon which to draw.
Note that this may already have a transformation applied, so be sure to leave it the way you found it.mapView
- the MapView that requested the draw.
Use NMapView.getMapProjection() to convert between on-screen pixels and latitude/longitude pairs.shadow
- If true, draw the shadow layer. If false, draw the overlay contents.public void drawFocusedItem(Canvas canvas, NMapView mapView, boolean shadow)
drawFocusedItem
in class NMapOverlay
canvas
- The Canvas upon which to draw.
Note that this may already have a transformation applied, so be sure to leave it the way you found it.mapView
- the MapView that requested the draw.
Use NMapView.getMapProjection() to convert between on-screen pixels and latitude/longitude pairs.shadow
- If true, draw the shadow layer. If false, draw the overlay contents.com.nhn.android.maps.NMapOverlay#drawFocusedItem(android.graphics.Canvas, com.nhn.android.maps.NMapView, boolean)
public void showFocusedItemOnly()
public void showAllItems()
public boolean setHiddenExceptEndItems(boolean enable, int extraExceptionalItem)
public boolean showInfoLayers(boolean enable)
public boolean isInfoLayersVisible()
public NMapOverlayItem getFocus()
public boolean onTap(int px, int py, NMapView mapView)
onTap
in class NMapOverlay
public boolean onTrackballEvent(MotionEvent event, NMapView mapView)
onTrackballEvent
in class NMapOverlay
public boolean onTouchEvent(MotionEvent event, NMapView mapView)
onTouchEvent
in class NMapOverlay
public void setOnFocusChangeListener(NMapItemizedOverlay.OnFocusChangeListener listenr)
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


| Libcroco Reference Manual | ||||
|---|---|---|---|---|
| Top | Description |
struct CRSelector; CRSelector * cr_selector_append (CRSelector *a_this
,CRSelector *a_new
); CRSelector * cr_selector_append_simple_sel (CRSelector *a_this
,CRSimpleSel *a_simple_sel
); void cr_selector_destroy (CRSelector *a_this
); void cr_selector_dump (CRSelector const *a_this
,FILE *a_fp
); CRSelector * cr_selector_new (CRSimpleSel *a_sel_expr
); CRSelector * cr_selector_parse_from_buf (const guchar *a_char_buf
,enum CREncoding a_enc
); CRSelector * cr_selector_prepend (CRSelector *a_this
,CRSelector *a_new
); void cr_selector_ref (CRSelector *a_this
); guchar * cr_selector_to_string (CRSelector const *a_this
); gboolean cr_selector_unref (CRSelector *a_this
);
struct CRSelector { /** *A Selection expression. *It is a list of basic selectors. *Each basic selector can be either an element *selector, an id selector, a class selector, an *attribute selector, an universal selector etc ... */ CRSimpleSel *simple_sel ; /**The next selector list element*/ CRSelector *next ; CRSelector *prev ; CRParsingLocation location ; glong ref_count ; };
CRSelector * cr_selector_append (CRSelector *a_this
,CRSelector *a_new
);
a_this
: the current instance of CRSelector.
a_new
: the instance of CRSelector to be appended.
Appends a new instance of CRSelector to the current selector list.
Returns : |
the new list. |
CRSelector * cr_selector_append_simple_sel (CRSelector *a_this
,CRSimpleSel *a_simple_sel
);
a_this
: the current instance of CRSelector.
a_simple_sel
: the simple selector to append.
append a simple selector to the current CRSelector list.
Returns : |
the new list or NULL in case of failure. |
void cr_selector_destroy (CRSelector *a_this
);
a_this
: the current instance of CRSelector.
Destroys the selector list.
void cr_selector_dump (CRSelector const *a_this
,FILE *a_fp
);
a_this
: the current instance of CRSelector.
a_fp
: the destination file.
Serializes the current instance of CRSelector to a file.
CRSelector * cr_selector_new (CRSimpleSel *a_sel_expr
);
a_simple_sel
: the initial simple selector list
of the current instance of CRSelector.
Creates a new instance of CRSelector.
Returns : |
the newly built instance of CRSelector, or NULL in case of failure. |
CRSelector * cr_selector_parse_from_buf (const guchar *a_char_buf
,enum CREncoding a_enc
);
CRSelector * cr_selector_prepend (CRSelector *a_this
,CRSelector *a_new
);
a_this
: the current instance of CRSelector list.
a_new
: the instance of CRSelector.
Prepends an element to the CRSelector list.
Returns : |
the new list. |
void cr_selector_ref (CRSelector *a_this
);
a_this
: the current instance of CRSelector.
Increments the ref count of the current instance of CRSelector.
gboolean cr_selector_unref (CRSelector *a_this
);
a_this
: the current instance of CRSelector.
Decrements the ref count of the current instance of CRSelector. If the ref count reaches zero, the current instance of CRSelector is destroyed.
Returns : |
TRUE if this function destroyed the current instance of CRSelector, FALSE otherwise. |


Postcode Checker
Please enter your postcode below.
Your postcode could not be recognised. Please try again.
Postcode
Sign in


Connection Details
This page details all of the connectors available to a broker. It displays the information in three tables:
- Available Connectors - lists the connectors available to the broker by protocol
- Open Connections - lists the address for all of the connections that are currently open
- Connection Details - right side table that displays detailed information about the selected conneciton
The right hand table displays detailed information about the selected connection:
- protocol of connector
- address from which the client is accessing the connection
- slow consumer warning - slow consumers can cause a number of problems for a broker
- blocked transport warning - TCP connections can become blocked by network issues and blocked connections are closed if they are not unblocked in a specified ammount of time
- dispatch queue size


My name is Jessie. I am a developer, an artist, recreational dancer, and pug enthusiast. I first came to web development when I endeavored to make a personal webpage to display my artwork. Since then, I’ve fallen in love with coding, the internet is my new canvas. Web development has proven incredibly challenging and fulfilling for me, touching on the problem solving skills I learned in my mathematical education, and the creative and aesthetic components of my artistic endeavors. I love working full stack and taking an app from start to finish.
ResumeFlinder is a place to find top news stories and read what people are saying about the events on social media, as well as find the nonprofits that are doing something about it. It uses the NYTimes, Guidestar, and Twitter API to programmatically search current events and the relevant nonprofits, and tweets
I worked on the Dapp App in a 5-person agile team, with a project manager, designer, and two co-developers. We built a dashboard app for the workplace, pulling from Twitter, and NYTimes APIs for user feeds. We also incorporated a group chat, implementing service oriented architecture to run a node app in tandem with our main rails app.


So You Think You Can Count? — Leaderboard
{% if leaderboard %}
{% for line in leaderboard %}
{% else %}
No one's even attempted this puzzle yet!
{% endif %}
| {{ line.0 }} | {{ line.1 }} | {{ line.2 }} |


Search samples
Location(s):
Sex:
Male
Female
Age:
Person(s):
Sentences:
All
Comment:
Translation:
Word(s):


|
Panda3D
|
An instance of this class is written to the front of a Bam or Txo file to make the file a cached instance of some other loadable resource. More...
Public Member Functions | |
| addDependentFile (const Filename pathname) | |
| Adds the indicated file to the list of files that will be loaded to generate the data in this record. More... | |
| addDependentFile (const VirtualFile file) | |
| Variant of add_dependent_file that takes an already opened VirtualFile. More... | |
| clearData () | |
| Removes the in-memory data object associated with this record, if any. More... | |
| clearDependentFiles () | |
| Empties the list of files that contribute to the data in this record. More... | |
| bool | dependentsUnchanged () |
| Returns true if all of the dependent files are still the same as when the cache was recorded, false otherwise. More... | |
| const Filename | getCacheFilename () |
| Returns the name of the cache file as hashed from the source_pathname. More... | |
| TypedWritable | getData () |
| Returns a pointer to the data stored in the record, or NULL if there is no data. More... | |
| const Filename | getDependentPathname (int n) |
| Returns the full pathname of the nth source files that contributes to the cache. More... | |
| int | getNumDependentFiles () |
| Returns the number of source files that contribute to the cache. More... | |
| time_t | getRecordedTime () |
| Returns the time at which this particular record was recorded or updated. More... | |
| const Filename | getSourcePathname () |
| Returns the full pathname to the source file that originally generated this cache request. More... | |
| time_t | getSourceTimestamp () |
| Returns the file timestamp of the original source file that generated this cache record, if available. More... | |
| bool | hasData () |
| Returns true if this cache record has an in-memory data object associated– that is, the object stored in the cache. More... | |
| BamCacheRecord | makeCopy () |
| Returns a duplicate of the BamCacheRecord. More... | |
| bool | operator== (const BamCacheRecord other) |
| output (Ostream out) | |
| setData (TypedWritable ptr) | |
| This variant on set_data() is provided to easily pass objects deriving from TypedWritable. More... | |
| setData (TypedWritable ptr, int dummy) | |
| This variant on set_data() is provided just to allow Python code to pass a 0 as the second parameter. More... | |
| setData (TypedWritable ptr, ReferenceCount ref_ptr) | |
| Stores a new data object on the record. More... | |
| setData (TypedWritableReferenceCount ptr) | |
| This variant on set_data() is provided to easily pass objects deriving from TypedWritableReferenceCount. More... | |
| write (Ostream out, int indent_level) | |
| Public Member Functions inherited from TypedWritable | |
| object | __reduce__ () |
| object | __reduce_persist__ (object pickler) |
| VectorUchar | encodeToBamStream () |
| Converts the TypedWritable object into a single stream of data using a BamWriter, and returns that data as a bytes object. More... | |
| bool | encodeToBamStream (VectorUchar data, BamWriter writer) |
| Converts the TypedWritable object into a single stream of data using a BamWriter, and stores that data in the indicated string. More... | |
| fillin (DatagramIterator scan, BamReader manager) | |
| This internal function is intended to be called by each class's make_from_bam() method to read in all of the relevant data from the BamFile for the new object. More... | |
| UpdateSeq | getBamModified () |
| Returns the current bam_modified counter. More... | |
| markBamModified () | |
| Increments the bam_modified counter, so that this object will be invalidated and retransmitted on any open bam streams. More... | |
| Public Member Functions inherited from TypedObject | |
| TypeHandle | getType () |
| int | getTypeIndex () |
| Returns the internal index number associated with this object's TypeHandle, a unique number for each different type. More... | |
| bool | isExactType (TypeHandle handle) |
| Returns true if the current object is the indicated type exactly. More... | |
| bool | isOfType (TypeHandle handle) |
| Returns true if the current object is or derives from the indicated type. More... | |
| Public Member Functions inherited from ReferenceCount | |
| int | getRefCount () |
| Returns the current reference count. More... | |
| ref () | |
| Explicitly increments the reference count. More... | |
| bool | testRefCountIntegrity () |
| Does some easy checks to make sure that the reference count isn't completely bogus. More... | |
| bool | testRefCountNonzero () |
| Does some easy checks to make sure that the reference count isn't zero, or completely bogus. More... | |
| bool | unref () |
| Explicitly decrements the reference count. More... | |
Static Public Member Functions | |
| static TypeHandle | getClassType () |
| Static Public Member Functions inherited from TypedWritableReferenceCount | |
| static TypedWritableReferenceCount | decodeFromBamStream (VectorUchar data, BamReader reader) |
| Reads the bytes created by a previous call to encode_to_bam_stream(), and extracts and returns the single object on those bytes. More... | |
| static TypeHandle | getClassType () |
| Static Public Member Functions inherited from TypedWritable | |
| static TypeHandle | getClassType () |
| Static Public Member Functions inherited from TypedObject | |
| static TypeHandle | getClassType () |
| Static Public Member Functions inherited from ReferenceCount | |
| static TypeHandle | getClassType () |
Public Attributes | |
| const Filename | cache_filename |
| Returns the name of the cache file as hashed from the source_pathname. More... | |
| TypedWritable | data |
| Returns a pointer to the data stored in the record, or NULL if there is no data. More... | |
| time_t | recorded_time |
| Returns the time at which this particular record was recorded or updated. More... | |
| const Filename | source_pathname |
| Returns the full pathname to the source file that originally generated this cache request. More... | |
| time_t | source_timestamp |
| Returns the file timestamp of the original source file that generated this cache record, if available. More... | |
| Public Attributes inherited from TypedObject | |
| TypeHandle | type |
| Returns the TypeHandle representing this object's type. More... | |
| Public Attributes inherited from ReferenceCount | |
| int | ref_count |
| The current reference count. More... | |
An instance of this class is written to the front of a Bam or Txo file to make the file a cached instance of some other loadable resource.
This record contains information needed to test the validity of the cache.
| addDependentFile | ( | const Filename | pathname | ) |
Adds the indicated file to the list of files that will be loaded to generate the data in this record.
This should be called once for the primary source file, and again for each secondary source file, if any.
| addDependentFile | ( | const VirtualFile | file | ) |
Variant of add_dependent_file that takes an already opened VirtualFile.
| clearData | ( | ) |
Removes the in-memory data object associated with this record, if any.
This does not affect the on-disk representation of the record.
| clearDependentFiles | ( | ) |
Empties the list of files that contribute to the data in this record.
| bool dependentsUnchanged | ( | ) |
Returns true if all of the dependent files are still the same as when the cache was recorded, false otherwise.
| const Filename getCacheFilename | ( | ) |
Returns the name of the cache file as hashed from the source_pathname.
This will be relative to the root of the cache directory, and it will not include any suffixes that may be appended to resolve hash conflicts.
|
static |
| TypedWritable getData | ( | ) |
Returns a pointer to the data stored in the record, or NULL if there is no data.
The pointer is not removed from the record.
| const Filename getDependentPathname | ( | int | n | ) |
Returns the full pathname of the nth source files that contributes to the cache.
| int getNumDependentFiles | ( | ) |
Returns the number of source files that contribute to the cache.
| time_t getRecordedTime | ( | ) |
Returns the time at which this particular record was recorded or updated.
| const Filename getSourcePathname | ( | ) |
Returns the full pathname to the source file that originally generated this cache request.
In some cases, for instance in the case of a of a multipage texture like "cube_#.png", this may not not a true filename on disk.
| time_t getSourceTimestamp | ( | ) |
Returns the file timestamp of the original source file that generated this cache record, if available.
In some cases the original file timestamp is not available, and this will return 0.
| bool hasData | ( | ) |
Returns true if this cache record has an in-memory data object associated– that is, the object stored in the cache.
| BamCacheRecord makeCopy | ( | ) |
Returns a duplicate of the BamCacheRecord.
The duplicate will not have a data pointer set, even though one may have been assigned to the original via set_data().
| bool operator== | ( | const BamCacheRecord | other | ) |
| output | ( | Ostream | out | ) |
| setData | ( | TypedWritable | ptr | ) |
This variant on set_data() is provided to easily pass objects deriving from TypedWritable.
| setData | ( | TypedWritable | ptr, |
| int | dummy | ||
| ) |
This variant on set_data() is provided just to allow Python code to pass a 0 as the second parameter.
| setData | ( | TypedWritable | ptr, |
| ReferenceCount | ref_ptr | ||
| ) |
Stores a new data object on the record.
You should pass the same pointer twice, to both parameters; this allows the C++ typecasting to automatically convert the pointer into both a TypedWritable and a ReferenceCount pointer, so that the BamCacheRecord object can reliably manage the reference counts.
You may pass 0 or NULL as the second parameter. If you do this, the BamCacheRecord will not manage the object's reference count; it will be up to you to ensure the object is not deleted during the lifetime of the BamCacheRecord object.
| setData | ( | TypedWritableReferenceCount | ptr | ) |
This variant on set_data() is provided to easily pass objects deriving from TypedWritableReferenceCount.
| write | ( | Ostream | out, |
| int | indent_level | ||
| ) |
| const Filename cache_filename |
Returns the name of the cache file as hashed from the source_pathname.
This will be relative to the root of the cache directory, and it will not include any suffixes that may be appended to resolve hash conflicts.
| TypedWritable data |
Returns a pointer to the data stored in the record, or NULL if there is no data.
The pointer is not removed from the record.
| time_t recorded_time |
Returns the time at which this particular record was recorded or updated.
| const Filename source_pathname |
Returns the full pathname to the source file that originally generated this cache request.
In some cases, for instance in the case of a of a multipage texture like "cube_#.png", this may not not a true filename on disk.
| time_t source_timestamp |
Returns the file timestamp of the original source file that generated this cache record, if available.
In some cases the original file timestamp is not available, and this will return 0.


'Savage' Lorraine Kelly fumes at Jennifer Arcuri after Piers Morgan interview about Boris Johnson
by Scotsman ReporterScottish television presenter Lorraine Kelly hit out at Jennifer Arcuri following her latest interview over her relationship with Boris Johnson.
Ms Arcuri was grilled by Piers Morgan and Susanna Reid today on ITV's Good Morning Britain but refused to comment on many of the points made by the interviewers.
After Kelly said: "That was crazy wasn't it? What's the point? Coming on and not answering any questions."
When Morgan asked Ms Arcuri to respond to the comments, Kelly demanded: "What's the point you coming on the TV to clear the air and then you don't say anything?"
Arcuri said: "I think I said a few things... what is it that you were looking for that I say?"
Ms Kelly responded: "You didn't answer any of the questions that were put to you and I just don't see the point in you coming on, to be honest."
On Twitter, Lorraine was trending, with one person writing: "Jesus, Lorraine is an actual savage."
@MarkDiStef wrote: "Unbelievably savagery from Lorraine, the artist formerly known as Lorraine Kelly."
Journalist @camillalong added: "I LOVE sassy Lorraine!"


The National Transportation Safety Board (NTSB) has completed an initial review of the cockpit voice recorder from the Atlas Air Boeing 767-300ER Freighter that crashed southeast of Houston on 23 February, and will analyse the flight data recorder that was recovered on 3 March.
An analysis of Atlas Air Flight 3591's flight data recorder by the National Transportation Safety Board shows that the Boeing 767 experienced "small vertical accelerations" similar to what planes experience during turbulence shortly before it began to plunge into Trinity Bay around noon on Feb. 23.
Remains of the Atlas Air / Prime Air 767
Air traffic control communications and radar data indicated the flight was normal from Miami to the Houston terminal area. About 12:30 pm the pilots contacted the Houston terminal radar approach control (TRACON) arrival controller and reported descending for runway 26L; the airplane was at 17,800 ft with a ground speed 320 knots. At 12:34, the airplane was descending through 13,800 ft, and the controller advised of an area of light to heavy precipitation along the flight route and that they could expect vectors around the weather.
FDR, radar, and ADS-B data indicated that the airplane entered a rapid descent on a heading of 270, reaching an airspeed of about 430 knots. A security camera video captured the airplane in a steep, generally wings-level attitude until impact with the swamp. FDR data indicated that the airplane gradually pitched up to about 20 degrees nose down during the descent.


$def with (content) $ title = ("title" in content) and content["title"] or (config['sitename'] + "-" + config['slogan']) $ name = ("name" in content) and content["name"] or ""


{% extends "base.html" %} {% block body %} {% if session.user %} {% endif %} Study Go! WE DO THE BEST! Designed for helping Cornell University students to study. Click here to Sign Up Click here to Log in {% endblock %}
Designed for helping Cornell University students to study.


Welcome to Campus Library
Books
New
Update
Delete
Search
User
New
Update
Delete
Search
Check-in/Check-out
Book Reservation
Manage
About Us
Logout
"Reading is essential for those who seek to rise above the ordinary"
“Today a reader, tomorrow a leader.”
"You absolutely have to know is the location of library."


| Class DBize::DBConnection |
|
Common class for accessing a database Provides some extra functionality
| Methods |
| Attributes |
| :connection | [R] | |
| :meta | [R] | |
| :meta_names | [R] | |
| :meta_types | [R] | |
| :tables | [R] |
| Public Class methods |
| new(dsn, user, pass) |
initialize opens the connection to the database, prepares variables and calls meta (currently AutoCommit is set to false)
| Public Instance methods |
| close() |
close method closes the database connection
| load_meta() |
meta method collects meta information for the database
| sql_format(table, field_name, field_value) |
Returns a field value formatted for sql statments according to the database meta information Essentially it deals with quoting strings
| sql_escape(str) |
sql_escape escapes apostrophes in character string types
| typecast(table, field_name, field_value, honor_func=false) |
typecast's a value according to database meta information


Peter Rabbit and Other Stories
by Beatrix Potter
Collected here are the stories of Peter Rabbit, his brothers and sisters, and many other animals that inhabited the imagination of English Beatrix Potter.
Source: This book was compiled by the Florida Center for Instructional Technology and includes passages from multiple sources. Please refer to the passage pages for further source information.
- “Ginger and Pickles”
- This book tells the story of shopkeepers Ginger, a tom-cat, and Pickles, a Terrier. They allow their customers credit and are unable to collect enough to pay the bills and subsequently go out of business. Their competition, Tabitha Twitchit, raises her prices once customers are forced to shop there and a few try to compensate by selling some specialized goods with limited success. Eventually, Henny Penny, a hen, reopens the shop.
- “The Pie and the Patty-Pan”
- When a little dog named Duchess gets an invitation to tea at the home of Ribby the cat, she becomes dreadfully afraid that Ribby is going to serve her mouse pie. Duchess bakes a delightful veal and ham pie and comes up with a very clever plan to substitute her own pie for Ribby’s. However, both of their pies become mixed up and each becomes dreadfully afraid that they have eaten a patty-pan.
- “The Roly-Poly Pudding”
- The hero is the young Tom Kitten; other main characters are the rat Mr Samuel Whiskers and his wife Anna Maria, who catch Tom Kitten and almost use him to make a roly-poly pudding.
- “The Story of a Fierce Bad Rabbit”
- The story of a good rabbit and a very naughty bad one.
- “The Story of Miss Moppet”
- A cat-and-mouse game between Miss Moppet, a cat, and a tiny mischievous mouse.
- “The Tailor of Gloucester”
- This book tells the story of a poor tailor, his cat, and the mice that live in his shop. He has many scraps of cloth and ribbons left over that are too small for any practical use. The mice take these and make fine clothes for themselves. The tailor sends his cat Simpkin to buy food and a twist of cherry-colored silk for a coat the mayor has commissioned for his wedding. While the cat is gone, he frees the mice from teacups where Simpkin has imprisoned them. When Simpkin returns and finds his mice gone, he hides the twist in anger. When the tailor falls ill, the mice save the day by completing the coat.
- “The Tale of Benjamin Bunny”
- This is the well-known classic story about Benjamin Bunny helping his cousin, Peter Rabbit. Peter must reacquire his clothing from the scarecrow in Mr. MacGregor’s garden.
- “The Tale of Jemima Puddle-Duck”
- This book tells the story of Jemima Puddle-Duck, introduced in the The Tale of Tom Kitten), who seeks out a nesting place away from the farm. A charming fox (who looks not unlike Mr. Tod talks her into nesting at his house on a mysteriously ample supply of feathers. He sends the naive Jemima out to collect traditional herbs for stuffing a duck, saying it is for an omelette. The farm collie, Kep, hears about this, realizes what the fox is really up to and intervenes.
- “The Tale of Mr. Jeremy Fisher”
- This book tells the story of a frog who decides to go fishing for minnows for supper. After several misadventures he gives up and has a dinner of roasted grasshopper and salad with his friends.
- “The Tale of Mr. Tod”
- Mr. Tod, a fox, and Tommy Brock, a badger, are both troublesome neighbors and “disagreeable people.” Mr. Tod has a habit of taking up lodging in other people’s houses. Mr. Brock visits a rabbit friend, who turns out to be Mr. Bouncer Bunny from The Tale of Benjamin Bunny, and then steals his son Benjamin Bunny’s children with plans to cook and eat them. Mr. Tod however finds that Mr. Brock has taken up residence in one of his homes, and after many comical efforts to rouse him, they fight it out. Meanwhile, Benjamin and his cousin Peter have come to rescue Benjamin’s children, and the fight gives them a chance to sneak off with the baby bunnies.
- “The Tale of Mrs. Tiggy-Winkle”
- A little girl loses her handkerchiefs and goes on a search for them. She sees some white cloths on the grass high up a hill and climbs up to discover a a little hedgehog washerwoman, Mrs. Tiggy-Winkle, with her handerchiefs freshly laundered, along with many other interesting articles such as stockings for a hen.
- “The Tale of Mrs. Tittlemouse”
- This book tells the story of a wood-mouse named Mrs. Tittlemouse and her efforts to keep her house in order despite numerous unwanted visitors.
- “The Tale of Peter Rabbit”
- Peter Rabbit defies his mother’s instructions and goes into Mr. McGregor’s garden, where he has to run and hide for his life.
- “The Tale of Pigling Bland”
- In The Tale Of Pigling Bland, farmer Piperson decides it’s time to turn his pigs into bacon, Pigling Bland and Pig-Wig must use their wits to outsmart him.
- “The Tale of Squirrel Nutkin”
- Squirrel Nutkin goes along with a group of squirrels to Owl Island to gather nuts. However, while all the other squirrels are busy collecting nuts, Nutkin is often playing or making mischief. While the other squirrels present the island’s resident owl, Old Brown, with gifts to earn his permission to gather nuts, Nutkin dances and taunts the owl with sing-song rhymes. Eventually, after Nutkin annoys Old Brown many times, the owl captures Nutkin and tries to skin him alive. Nutkin escapes but not without getting his tail bitten off.
- “The Tale of the Flopsy Bunnies”
- When Benjamin Bunny and his children, the “Flopsy Bunnies,” go to Mr. McGregor’s rubbish heap, they are pleasantly surprised to find it filled with overgrown lettuces.  When they are found by Mr. McGregor and put in a bag, Thomasina Tittlemouse comes to their rescue.
- “The Tale of Tom Kitten”
- Three kittens are dressed up for a tea-party and set out to play cleanly, but end up losing their clothes to the ducks, which started with Tom Kitten losing his buttons. Mother cat finds them w/o clothes and sends them upstairs so as not disturb her tea-party, but they keep playing and make noise. The ducks eventually lose the clothes, which fall off for lack of buttons and sink into the pond.
- “The Tale of Timmy Tiptoes”
- An innocent squirrel accused of stealing nuts is forced down a hole in a tree, where he meets a friendly chipmunk.
- “The Tale of Two Bad Mice”
- While the dolls are away, two curious, naughty mice explore the dolls’ house and steal their furniture.


URBAN LEGEND RATING: 5 / 10 --> Not a good movie
For more reviews and movie screensavers, visit http://www.joblo.com/
PLOT: Someone is murdering people on campus in various ways depicting true urban legends. At first, people don't buy it. Then, people start believing. Then, people get really scared.
CRITIQUE: Good little premise with decent mood and a great opening scene, turns into a muddled "teen horror flick of the day", with plot holes the size of my ass, and a resolution that just blew away any suspension of disbelief that I had left over. It's hard for me to describe my distaste for this film's tactics, without giving too much away, but just let me say that I am personally not a fan of horror films that leave too many questions unanswered, and this one had me wondering all kinds of stuff. The fact that the killer wore a parka in the dead of summer was weird enough, but to show various other members of the cast with that same parka just for the sake of spreading out our web of suspension, just didn't brew my beer (Yes, there is actually a girl who wears a parka jacket inside a pool area. Hello!?!?!?). And you know a horror flick's lost all sense of hope, when its killer NOT only confesses to the whole thing whilst torturing a victim, but has a SLIDE SHOW to back things up. That's right....a SLIDE SHOW!!
It's too bad because the film had a nice opening, some tense moments and an interesting premise. And can we please do away with horror flicks in which nobody in the case believes the main accuser, despite obvious evidence, signs of foul play and good ol' fashioned proof??  That kind of stuff doesn't scare us...it just pisses us right off!! Having said all that, I suppose this film could be tolerated under certain circumstances, like a dark, dreary summer night alone in your parka with a beer in one hand, and a gigantic suspension of disbelief in the other. A slide show........I still can't get over it !!! hahaha
Little Known Facts about this film and its stars: Originally titled, MIXED CULTURE and URBAN LEGENDS. If you look behind Natalie and Parker in the auditorium, you will see the writer Silvio Horta acting as a college student. Hopefully, he's taking notes on the implausibilities lined within his own script. When Paul and Natalie walk into the hidden room in Wexler's office, a puppet of Freddy Krueger can be seen just before they see the axe. Robert Englund, who plays Wexler in this film, played Freddy Krueger in the NIGHTMARE ON ELM STREET movie series. The book sitting on the desk in Professor Wexler's desk in his class is "The Vanishing Hitchhiker," which is one of the premiere texts on urban legends. When Joshua Jackson (Damon Brooks) starts his car before he takes Natalie to "the spot" in the woods, the radio is playing Paula Cole's "I Don't Want to Wait" from the TV show "Dawson's Creek" also starring Jackson. There is another reference regarding a "girl in those Noxema commercials" which is another subtle ribbing at actress Rebecca Gayheart, who appears in those commercials. She is currently engaged to her boyfriend of nine years director Brett Ratner (RUSH HOUR (7.5/10)).
Review Date: June 28, 1999 Director: Jamie Blanks Writer: Silvio Horta Producers: Gina Matthews, Michael McDonnell and Neal H. Moritz Actors: Jared Leto as Paul Alicia Witt as Natalie Simon Rebecca Gayheart as Brenda Genre: Horror Year of Release: 1998 ------------------------------------ JoBlo's Movie Emporium http://www.joblo.com/ ------------------------------------ (c) 1999 Berge Garabedian
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


public class VerifiersAdapterFactory
extends org.eclipse.emf.common.notify.impl.AdapterFactoryImpl
createXXX
method for each class of the model.
VerifiersPackage
| Constructor and Description |
|---|
VerifiersAdapterFactory()
Creates an instance of the adapter factory.
|
| Modifier and Type | Method and Description |
|---|---|
org.eclipse.emf.common.notify.Adapter |
createAdapter(org.eclipse.emf.common.notify.Notifier target)
Creates an adapter for the
target . |
org.eclipse.emf.common.notify.Adapter |
createComponentAdapter()
Creates a new adapter for an object of class '
Component '. |
org.eclipse.emf.common.notify.Adapter |
createComponentCollectionAdapter()
Creates a new adapter for an object of class '
Component Collection '. |
org.eclipse.emf.common.notify.Adapter |
createCounterExampleAdapter()
Creates a new adapter for an object of class '
Counter Example '. |
org.eclipse.emf.common.notify.Adapter |
createEObjectAdapter()
Creates a new adapter for the default case.
|
org.eclipse.emf.common.notify.Adapter |
createModelAdapter()
Creates a new adapter for an object of class '
Model '. |
org.eclipse.emf.common.notify.Adapter |
createModelCheckerAdapter()
Creates a new adapter for an object of class '
Model Checker '. |
org.eclipse.emf.common.notify.Adapter |
createModelCheckerInputAdapter()
Creates a new adapter for an object of class '
Model Checker Input '. |
org.eclipse.emf.common.notify.Adapter |
createModelCheckerOutputAdapter()
Creates a new adapter for an object of class '
Model Checker Output '. |
org.eclipse.emf.common.notify.Adapter |
createNegativeAdapter()
Creates a new adapter for an object of class '
Negative '. |
org.eclipse.emf.common.notify.Adapter |
createNuSMVInputAdapter()
Creates a new adapter for an object of class '
Nu SMV Input '. |
org.eclipse.emf.common.notify.Adapter |
createNuSMVModelAdapter()
Creates a new adapter for an object of class '
Nu SMV Model '. |
org.eclipse.emf.common.notify.Adapter |
createNuSMVModelCheckerAdapter()
Creates a new adapter for an object of class '
Nu SMV Model Checker '. |
org.eclipse.emf.common.notify.Adapter |
createNuSMVOutputAdapter()
Creates a new adapter for an object of class '
Nu SMV Output '. |
org.eclipse.emf.common.notify.Adapter |
createNuSMVSpecificationAdapter()
Creates a new adapter for an object of class '
Nu SMV Specification '. |
org.eclipse.emf.common.notify.Adapter |
createNuSMVUniversalModelAdapter()
Creates a new adapter for an object of class '
Nu SMV Universal Model '. |
org.eclipse.emf.common.notify.Adapter |
createPositiveAdapter()
Creates a new adapter for an object of class '
Positive '. |
org.eclipse.emf.common.notify.Adapter |
createResultEntryAdapter()
Creates a new adapter for an object of class '
Result Entry '. |
org.eclipse.emf.common.notify.Adapter |
createResultsCollectionAdapter()
Creates a new adapter for an object of class '
Results Collection '. |
org.eclipse.emf.common.notify.Adapter |
createSpecificationAdapter()
Creates a new adapter for an object of class '
Specification '. |
org.eclipse.emf.common.notify.Adapter |
createUniversalModelAdapter()
Creates a new adapter for an object of class '
Universal Model '. |
org.eclipse.emf.common.notify.Adapter |
createUnknownAdapter()
Creates a new adapter for an object of class '
Unknown '. |
org.eclipse.emf.common.notify.Adapter |
createVerificationResultAdapter()
Creates a new adapter for an object of class '
Verification Result '. |
org.eclipse.emf.common.notify.Adapter |
createVerificationUnitAdapter()
Creates a new adapter for an object of class '
Verification Unit '. |
org.eclipse.emf.common.notify.Adapter |
createViewpointAdapter()
Creates a new adapter for an object of class '
Viewpoint '. |
org.eclipse.emf.common.notify.Adapter |
createViewpointCollectionAdapter()
Creates a new adapter for an object of class '
Viewpoint Collection '. |
boolean |
isFactoryForType(java.lang.Object object)
Returns whether this factory is applicable for the type of the object.
|
public VerifiersAdapterFactory()
public boolean isFactoryForType(java.lang.Object object)
true
if the object is either the model's package or is an instance object of the model.
isFactoryForType
in interface org.eclipse.emf.common.notify.AdapterFactory
isFactoryForType
in class org.eclipse.emf.common.notify.impl.AdapterFactoryImpl
public org.eclipse.emf.common.notify.Adapter createAdapter(org.eclipse.emf.common.notify.Notifier target)
target
.
createAdapter
in class org.eclipse.emf.common.notify.impl.AdapterFactoryImpl
target
- the object to adapt.target
.public org.eclipse.emf.common.notify.Adapter createVerificationResultAdapter()
Verification Result
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
VerificationResult
public org.eclipse.emf.common.notify.Adapter createPositiveAdapter()
Positive
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
Positive
public org.eclipse.emf.common.notify.Adapter createNegativeAdapter()
Negative
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
Negative
public org.eclipse.emf.common.notify.Adapter createModelAdapter()
Model
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
Model
public org.eclipse.emf.common.notify.Adapter createSpecificationAdapter()
Specification
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
Specification
public org.eclipse.emf.common.notify.Adapter createCounterExampleAdapter()
Counter Example
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
CounterExample
public org.eclipse.emf.common.notify.Adapter createUniversalModelAdapter()
Universal Model
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
UniversalModel
public org.eclipse.emf.common.notify.Adapter createModelCheckerAdapter()
Model Checker
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
ModelChecker
public org.eclipse.emf.common.notify.Adapter createNuSMVModelCheckerAdapter()
Nu SMV Model Checker
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
NuSMVModelChecker
public org.eclipse.emf.common.notify.Adapter createModelCheckerInputAdapter()
Model Checker Input
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
ModelCheckerInput
public org.eclipse.emf.common.notify.Adapter createModelCheckerOutputAdapter()
Model Checker Output
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
ModelCheckerOutput
public org.eclipse.emf.common.notify.Adapter createNuSMVInputAdapter()
Nu SMV Input
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
NuSMVInput
public org.eclipse.emf.common.notify.Adapter createNuSMVOutputAdapter()
Nu SMV Output
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
NuSMVOutput
public org.eclipse.emf.common.notify.Adapter createNuSMVModelAdapter()
Nu SMV Model
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
NuSMVModel
public org.eclipse.emf.common.notify.Adapter createNuSMVUniversalModelAdapter()
Nu SMV Universal Model
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
NuSMVUniversalModel
public org.eclipse.emf.common.notify.Adapter createNuSMVSpecificationAdapter()
Nu SMV Specification
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
NuSMVSpecification
public org.eclipse.emf.common.notify.Adapter createUnknownAdapter()
Unknown
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
Unknown
public org.eclipse.emf.common.notify.Adapter createResultsCollectionAdapter()
Results Collection
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
ResultsCollection
public org.eclipse.emf.common.notify.Adapter createComponentAdapter()
Component
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
Component
public org.eclipse.emf.common.notify.Adapter createViewpointAdapter()
Viewpoint
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
Viewpoint
public org.eclipse.emf.common.notify.Adapter createVerificationUnitAdapter()
Verification Unit
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
VerificationUnit
public org.eclipse.emf.common.notify.Adapter createResultEntryAdapter()
Result Entry
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
ResultEntry
public org.eclipse.emf.common.notify.Adapter createViewpointCollectionAdapter()
Viewpoint Collection
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
ViewpointCollection
public org.eclipse.emf.common.notify.Adapter createComponentCollectionAdapter()
Component Collection
'.
This default implementation returns null so that we can easily ignore cases;
it's useful to ignore a case when inheritance will catch all the cases anyway.
ComponentCollection
public org.eclipse.emf.common.notify.Adapter createEObjectAdapter()


This dialog window is shown after clicking the Details button from within the Factorization of a number dialog.
In this dialog displays detailed information about the last factorization.
In the upper text field you'll find the factorised number. The list beneath shows the single steps of the factorization:
A double click will select a row, which appears into the lower mask with some additional information:


Venetian sauce (French: Sauce vénitienne) is a classical French herb sauce used to accompany fish.<ref>Auguste Escoffier (1907), Le Guide culinaire</ref> It consists of:
strained and finished with:
{{reflist}}
{{ingredient-stub}}


13 C Street, Laurel, MD 20708 / @wordfocuschapel on Twitter, Facebook, and Instagram
| Monday 8-8:30 PM |
Prayer Conference Call |<PHONE_NUMBER> PIN 481417 |
| Wednesday 6-6:30 AM |
Prayer Conference Call |<PHONE_NUMBER> PIN 481417 |
| Wednesday 7-8:15 PM |
Bible Study | Theme: The Kingdom |
| Saturday 7-7:30 AM |
Prayer Conference Call |<PHONE_NUMBER> PIN 481417 |
| Sunday 9:30-11 AM |
Power Service | Praise, Prayer and The Word |
7:15-9 PM
13 C Street, Laurel, MD 20708 / @wordfocuschapel on Twitter, Facebook, and Instagram