# #UnitedForClimate 20. Sept. 2019
[🇩🇪 version](index.de.html)
**Your planet needs you! On 20. September 2019.**
## Why?
To put it clearly: if mankind doesn't start drastically reducing carbon emissions in **2020**, there will be basically no chance to reach the Paris agreement.
[1](https://twitter.com/Jumpsteady/status/1167132740527042561)
[2](https://twitter.com/Jumpsteady/status/1163720944982069248)
[3](https://twitter.com/Jumpsteady/status/1167119243835576325)
[4](https://twitter.com/Jumpsteady/status/1167121575373627393)
## Why should I care about the Paris agreement?
Climate scientist think, that warming of a maximum of 2 degrees compared to 1880, will keep earth in a comparable state to what humans know and can live in.
But a 2 degree warming already means for example: loss of **all** coral reefs, 24% of global population facing **water shortage**, six times higher chances of 100-year **flooding** by 2080, habitable ranges for plants and animals will decrease by 30-50% (**food supply** at risk).
[5](https://twitter.com/Jumpsteady/status/1168797490893774848)
[6](https://twitter.com/Jumpsteady/status/1168799873317113857)
## 2 degrees
If we miss the 2 degree target, it's very likely that we are not able to even limit warming to 3 degrees due to **tipping points** (see below).
If we manage to become carbon-neutral by 2050 and scale carbon capturing (removing carbon from the atmosphere), we have a **66%** chance of staying below 2 degrees warming. Want a higher chance? Act earlier and faster!
[7](https://twitter.com/Jumpsteady/status/1163729742799003648)
[8](https://twitter.com/Jumpsteady/status/1168799873317113857)
## Tipping points
There are several tipping points that, once reached, can't be undone.
If the **amazon rainforest** dies, one of the largest land-based carbon sinks becomes an emitter. Fueling global warming.
If the **Siberian permafrost** unfreezes, it will release **two times** as much carbon into the atmosphere as mankind already has emitted. Fueling global warming.
If the **Greenland ice** melts, the now sunlight reflecting white ice will become dark, muddy land that heats up instead of reflecting energy. Fueling global warming and contributing to sea level rise.
*All these processes have already started.*
If we are not able to limit global warming to a maximum of 2 degrees, they will inevitably contribute to global warming and push the earth system into a state that is literally **unknown to mankind**.
[9](https://en.wikipedia.org/wiki/Tipping_points_in_the_climate_system)
## Long lasting effect
Even if we stop all carbon emissions today, the carbon that's already in the atmosphere doesn't go away.  There's also a lot of heat and carbon stored in the oceans. In order to reduce this effect, we need to get carbon out of the atmosphere. For example by **planting trees**. But at first: we need to stop emitting.
[10](https://twitter.com/Jumpsteady/status/1168795122936496128
)
## 4 or more degrees warming
4 degrees doesn't sound like much. But it's an average temperature. The last ice-age only was 4 degrees less compared to 1880. At the end of this period, mankind was almost extinct, leaving only a tribe of 15000 humans in Ethiopia alive.
[11](https://twitter.com/Jumpsteady/status/1169900343582347264
)
A 4 degree warmer world is probably only able to feed 1 billion people. Currently, we're almost 8 billion. This is not going to happen in a distant future but by the end of this century, if we don't take drastic action **now**.
[12](https://twitter.com/Jumpsteady/status/1163739206121938944)
[13](https://twitter.com/Jumpsteady/status/1163724935409360896)
[14](https://twitter.com/Jumpsteady/status/1163739206121938944)
[15](https://twitter.com/Jumpsteady/status/1169895375638892545)
## Warming is one problem - the pace is another one
Currently we're heading towards 4-6 degrees warming over the next 100 years. Earlier temperature changes in earth's history took a lot longer. Like: 100 times longer.
Slower change gives nature time to react. Plants and animals can move north/south. Ecosystems can adapt. If they have time.
[16](https://twitter.com/Jumpsteady/status/1169903068453818368)
[17](https://twitter.com/Jumpsteady/status/1169634986347114496)
## Are we doomed? What can I do?
To be honest, future doesn't look too bright. But it's not too late yet, although the window of opportunity is closing rapidly.
What you can do:
- educate yourself and others
- try to reduce your own carbon footprint
- talk to your politicians because individual reduction is good but can't solve the crisis alone
- connect to activist groups like "fridays for future" or "extinction rebellion"
*(data has been extracted from various climate scientist talks and interviews provided by https://twitter.com/jumpsteady - huge thanks for your work!)


{{ define "main" }}
Software developer since 2007, currently working at Bitvavo and living in Amsterdam, member of Google Cloud Expert, previously worked for Getir. Focusing distributed systems and cloud computing.
Loading...


| company-id |
company-name |
EMAIL-ID |
LOCATION |
JOINED -ON |
ACTION |
| 12345 |
rakesh technology |
<EMAIL_ADDRESS>|
bangalore |
25/11/2002 |
|
| 12348 |
avatexh |
avatech.co.in |
hyderabad |
25/11/2002 |
|
| 12345 |
krista |
<EMAIL_ADDRESS>|
baroda |
28/11/2008 |
|
| 12345 |
prat technology |
<EMAIL_ADDRESS>|
delhi |
25/11/2015 |
|


Reimbursement Form
Logout
Reimbursement Form
Event Name:
Date of Event:
Time of Event:
Event Location:
Event Description:
Event Cost:
Justification:
Estimated Work Days Missed:
Event Type:
University Course
Seminar
Certification Preparation Class
Certification
Technical Training
Other
Grading Format:
Letter Grade
Pass/Fail
Presentation
Other
Submit


Release Notes 17.12.05
Apache OFBiz® 17.12.05, released on January 2021, is the fifth and final release of the 17.12 series, that has been stabilized since December 2017.
Sub-task
- [OFBIZ-11840] - Reflected XSS in content component
- [OFBIZ-11871] - Server-Side Template Injection using Static
- [OFBIZ-12055] - Prevent possible post-auth RCE from webtools/control/ProgramExport
- [OFBIZ-12057] - Prevent arbitary file write using webtools/control/EntitySQLProcessor.
- [OFBIZ-12080] - Secure the uploads
- [OFBIZ-12096] - Post-auth XSS vulnerability at catalog/control/EditProductPromo
- [OFBIZ-12098] - Make ruleName field in PriceForms.xml#AddPriceRules safe
Bug
- [OFBIZ-7249] - Error on removing scrum members
- [OFBIZ-8302] - Sorting of lists generates undesired results
- [OFBIZ-9687] - Bug in order manager main page when using Arab language
- [OFBIZ-9901] - Unable to create event in SFA component
- [OFBIZ-10302] - Display/functionality improvement in findParty of OOTB regarding classification group
- [OFBIZ-10532] - Default value flags not working for configurable and variant products at the time of order entry
- [OFBIZ-10536] - Giant Widget with variant explosion: a "Select Unit of Measure" dropdown box appears with no reason.
- [OFBIZ-10669] - Getting Insecure connection error while navigating from product link
- [OFBIZ-10834] - Uploading image to data resource
- [OFBIZ-11168] - Issue in creating promotion action
- [OFBIZ-11582] - Required fields for party content upload are not checked
- [OFBIZ-11734] - View Image button on order view page fails to render the image
- [OFBIZ-11735] - Product link on Order confirmation page is not responding
- [OFBIZ-11788] - Edit button(s) are shown for shipments received or shipped
- [OFBIZ-11838] - One page checkout is broken because of ordermgr::getAssociatedStateList
- [OFBIZ-11881] - Wrong image name in css
- [OFBIZ-11906] - product summary looks bad in the promotion products list
- [OFBIZ-11910] - product summary cards don't have uniform height
- [OFBIZ-11920] - Distorted Final Checkout Review page when Credit card is selected as Payment option
- [OFBIZ-11971] - Incorrect data for InvoiceItemTypeMap and ReturnItemTypeMap
- [OFBIZ-11972] - wrong quote marks
- [OFBIZ-11976] - svg files not removed on clean
- [OFBIZ-11977] - multiflex css is linking to wrong location
- [OFBIZ-11978] - "cart" should be "card"
- [OFBIZ-11984] - MessagingException in sendShipmentScheduledNotification service
- [OFBIZ-11993] - display/selection of unit of measure is broken/plugins
- [OFBIZ-12014] - Error while decoding url parameters with percent character
- [OFBIZ-12019] - variant product selection trashes image
- [OFBIZ-12023] - Label issue on List Companies page
- [OFBIZ-12026] - Hyperlink title under form widget doesn't support character encoding for special characters
- [OFBIZ-12039] - Flexible reports use an old noNamespaceSchemaLocation
- [OFBIZ-12044] - Issue: Displaying company and product information at product backlog, subcomponent of Scrum Application
- [OFBIZ-12045] - Single product tile is displayed on one row in product search
- [OFBIZ-12050] - NotSerializableException using uploadPartyContentFile service
- [OFBIZ-12066] - init-gradle-wrapper.sh fails to install wrapper files using wget
- [OFBIZ-12078] - Remove hardcoded product category on CategoryWorker.getCatalogTopCategory
- [OFBIZ-12082] - Unique form names for promo actions
- [OFBIZ-12087] - Lucene TopScoreDocCollector::create wrong call the 2 in Search.groovy scripts
- [OFBIZ-12100] - Gradle build of 17.12.04 crashes on Centos 8
- [OFBIZ-12101] - partymgr fails to upload image
Improvement
- [OFBIZ-9254] - Inconsistent String Comparisons
- [OFBIZ-9978] - Upgrade jQuery 1.11.0 to jQuery 3.2.1
- [OFBIZ-11882] - Rename a few map files
- [OFBIZ-11891] - Hard coded label in ProductUomDropDownOnly
- [OFBIZ-11892] - Add missing jGrowl map file
- [OFBIZ-11950] - Add a title to Javadoc overview
- [OFBIZ-12029] - Handle special characters like single quote in Freemarker template (prevent encoding)
- [OFBIZ-12067] - Update IND Geo data as per 2020-11-24 notification
- [OFBIZ-12085] - Gradle logging hygiene


Samsung Galaxy Fold Landed In India At 164,999 Rupees ($2312)
by Argam ArtashyanSamsung Galaxy Fold Landed In India At 164,999 Rupees ($2312)
5 (100%) 2 votes
Recently, the Samsung Galaxy Fold foldable smartphone has been officially launched in many countries and regions. It even landed in China to compete with the Huawei Mate X, which has gained a bad reputation. Today, we learned this amazing handset has arrived in India as well. But before recalling its key features we are offering to take a look at real photos taken by the team of 91mobiles.
The Samsung Galaxy Fold folding screen smartphone has two colors of night fog silver and quantum black. It adopts a 7.3-inch foldable screen design (4.6-inch external screen), which can provide HDR10 + color contrast. As for hardware, our protagonist comes with the Qualcomm Snapdragon 855 processor. In its turn, there is a 12GB of memory and 512GB of storage space. The battery capacity is 4380mAh.
Besides the innovative folding screen design and powerful hardware, the Samsung Galaxy Fold comes with six camera sensors. A triple-camera with a sensors combination of 16MP super wide-angle + 12MP wide-angle + 12MP telephoto lenses is placed on the back. Another triple-camera is placed on the front. But its sensors’ resolutions differ a lot. Apart from the 10MP selfie main lens, there are 10MP portrait lens and 8MP art portrait lens.
As for pricing, not accidentally, the Samsung Galaxy Fold folding screen smartphone is considered to be the most expensive device in the Indian market. It costs 164,999 Indian rupees, which is equivalent to $2312. When comparing with the Huawei Mate X, they belong to the same price range. But we know there are some use issues related to the Mate X. Although, Samsung is still silent and we don’t know whether its model faces similar problems or not.


Tetris
New Game
Pause
Resume
Save
Load Last Game
Leader Board
Instructions
Move the tetris pieces with the arrows on your keyboard. The
up arrow
rotates the piece. The other arrows move the piece in their respective directions. Speed increases every 50 points. Good luck!
Login
Name:
Score:
0


module BatLazyList:{
..}
Lazy lists are similar to lists, with the exception that their contents are only computed whenever requested. This makes them particularly useful in contexts where streams of data are to be handled.
Note For this documentation, we will assume the existence of
a lazy list syntax extension such that [^ ^]
is the empty lazy
list and [^ a;b;c ^]
is the lazy list containing elements a
,
b
, c
.
Note Enumerations (as featured in module BatEnum
) and lazy
lists (as featured in this module) are quite similar in
purpose. Lazy lists are slightly higher level, insofar as no
cloning is required to get them to work, which makes them
slightly more useful in contexts where backtracking is
common. Enumerations, on the other hand, are closer to
traditional stream processing, and require more low-level marking
whenever backtracking is required, but may be faster and more
memory-efficient when used properly. Either choice is recommended
over OCaml's built-in Stream
.
Author(s): David Teller
exception Empty_list
Empty_list
is raised when an operation applied on an empty list
is invalid. For instance, hd nil
will raise Empty_list
.exception Invalid_index of int
Invalid_index
is raised when an indexed access on a list is
out of list bounds.exception Different_list_size of string
Different_list_size
is raised when applying functions such as
iter2
on two lists having different size.exception No_more_elements
Note The types are kept concrete so as to allow pattern-matching.
However, it is generally easier to manipulate BatLazyList.nil
and BatLazyList.cons
.
type t'a
=Lazy.t (node_t 'a)
type node_t 'a
=
| |
Nil |
|||
| |
Cons of |
(* |
The type of an item in the list.
| *) |
include BatEnum.Enumerable
include BatInterfaces.Mappable
let nil : t 'a
let cons : 'a => t 'a => t 'a
let (^:^) : 'a => t 'a => t 'a
cons
: x^:^l
is the lazy list with head x
and tail l
let peek : t 'a => option 'a
peek l
returns the first element of l
, if it exists.let get : t 'a => option ('a, t 'a)
get l
returns the head and tail of l
, if l
is not empty.let from : (unit => 'a) => t 'a
from next
creates a (possibly infinite) lazy list from the successive
results of next
.LazyList.No_more_elements
to denote the end of the list.let from_while : (unit => option 'a) => t 'a
from next
creates a (possibly infinite) lazy list from the successive
results of next
.
The list ends whenever next
returns None
.let from_loop : 'b => ('b => ('a, 'b)) => t 'a
from_loop data next
creates a (possibly infinite) lazy list from
the successive results of applying next
to data
, then to the
result, etc. The list ends whenever the function raises
LazyList.No_more_elements
.let seq : 'a => ('a => 'a) => ('a => bool) => t 'a
seq init step cond
creates a sequence of data, which starts
from init
, extends by step
, until the condition cond
fails. E.g. seq 1 ((+) 1) ((>) 100)
returns [^1, 2, ... 99^]
. If cond
init
is false, the result is empty.let unfold : 'b => ('b => option ('a, 'b)) => t 'a
unfold data next
creates a (possibly infinite) lazy list from
the successive results of applying next
to data
, then to the
result, etc. The list ends whenever the function returns None
let init : int => (int => 'a) => t 'a
Array.init
, init n f
returns the lazy list
containing the results of (f 0),(f 1).... (f (n-1)).Invalid_argument
"LazyList.init"
if n < 0.let make : int => 'a => t 'a
String.make
, make n x
returns a
list containing n
elements x
.let range : int => int => t int
The range is empty if b <= a.
let iter : ('a => 'b) => t 'a => unit
iter f [^ a0; a1; ...; an ^]
applies function f
in turn to a0;
a1; ...; an
. It is equivalent to begin f a0; f a1; ...; f an; ()
end
. In particular, it causes all the elements of the list to be
evaluated.
let iteri : (int => 'a => unit) => t 'a => unit
iteri f [^ a0; a1; ...; an ^]
applies function f
in turn to
a0; a1;...; an
, along with the corresponding 0,1..n
index. It
is equivalent to begin f 0 a0; f 1 a1; ...; f n an; ()
end
. In particular, it causes all the elements of the list to be
evaluated.
let map : ('a => 'b) => t 'a => t 'b
map f [^ a0; a1; ... ^]
builds the list [^ f a0; f a1; ... ^]
with the results returned by f
. Not tail-recursive. Evaluations
of f
take place only when the contents of the list are forced.
let mapi : (int => 'a => 'b) => t 'a => t 'b
mapi f [^ a0; a1; ... ^]
builds the list [^ f 0 a0; f 1 a1;
... ^]
with the results returned by f
. Not
tail-recursive. Evaluations of f
take place only when the
contents of the list are forced.
let fold_left : ('a => 'b => 'a) => 'a => t 'b => 'a
LazyList.fold_left f a [^ b0; b1; ...; bn ^]
is f (... (f (f
a b0) b1) ...) bn
. This causes evaluation of all the elements of
the list.
let fold_right : ('a => 'b => 'b) => 'b => t 'a => 'b
fold_right f b [^ a0; a1; ...; an ^]
is f a0 (f a1 (... (f an b) ...))
.
This causes evaluation of all the elements of the list. Not
tail-recursive.
Note that the argument order of this function is the same as
fold_left
above, but inconsistent with other fold_right
functions in Batteries. We hope to fix this inconsistency in the
next compatibility-breaking release, so you should rather use the
more consistent eager_fold_right
.
Since 2.2.0
let eager_fold_right : ('a => 'b => 'b) => t 'a => 'b => 'b
As fold_right
above, but with the usual argument order for
a fold_right.
Just as fold_left
on a structure 'a t
turns an element-level
function of type ('b -> 'a -> 'b)
, with the accumulator argument
'b
on the left, into a structure-level function
'b -> 'a t -> 'b
, fold_right
turns a function
('a -> 'b -> 'b)
(accumulator on the right) into
a 'a t -> 'b -> 'b
.
let lazy_fold_right : ('a => Lazy.t 'b => 'b) => t 'a => Lazy.t 'b => Lazy.t 'b
lazy_fold_right f (Cons (a0, Cons (a1, Cons (a2, nil)))) b
is
lazy (f a0 (lazy (f a1 (lazy (f a2 b)))))
.
Forcing the result of lazy_fold_right
forces the first element of
the list; the rest is forced only if/when the function f
forces
its accumulator argument.
Since 2.1
let mem : 'a => t 'a => bool
mem x l
determines if x
is part of l
.
Evaluates all the elements of l
which appear
before x
.let memq : 'a => t 'a => bool
mem
, but with physical equalitylet find : ('a => bool) => t 'a => 'a
find p l
returns the first element of l
such as p x
returns true
.Not_found
if such an element has not been found.let rfind : ('a => bool) => t 'a => 'a
rfind p l
returns the last element x
of l
such as p x
returns
true
.Not_found
if such element as not been found.let find_exn : ('a => bool) => exn => t 'a => 'a
find_exn p e l
returns the first element of l
such as p x
returns true
or raises e
if such an element has not been found.let rfind_exn : ('a => bool) => exn => t 'a => 'a
find_exn p e l
returns the last element of l
such as p x
returns true
or raises e
if such an element has not been found.let findi : (int => 'a => bool) => t 'a => (int, 'a)
findi p e l
returns the first element ai
of l
along with its
index i
such that p i ai
is true.Not_found
if no such element has been found.let rfindi : (int => 'a => bool) => t 'a => (int, 'a)
findi p e l
returns the last element ai
of l
along with its
index i
such that p i ai
is true.Not_found
if no such element has been found.let index_of : 'a => t 'a => option int
index_of e l
returns the index of the first occurrence of e
in l
, or None
if there is no occurrence of e
in l
let index_ofq : 'a => t 'a => option int
index_ofq e l
behaves as index_of e l
except it uses
physical equalitylet rindex_of : 'a => t 'a => option int
index_of e l
returns the index of the last occurrence of e
in l
, or None
if there is no occurrence of e
in l
let rindex_ofq : 'a => t 'a => option int
rindex_ofq e l
behaves as rindex_of e l
except it uses
physical equalitylet next : t 'a => node_t 'a
let length : t 'a => int
Causes the evaluation of all the elements of the list.
let is_empty : t 'a => bool
true
if the list is empty, false otherwise.let would_at_fail : t 'a => int => bool
would_at_fail l n
returns true
if l
contains strictly less
than n
elements, false
otherwiselet hd : t 'a => 'a
Empty_list
if the list is empty.
Note: this function does not comply with the usual exceptionless error-management
recommendations, as doing so would essentially render it useless.
let tl : t 'a => t 'a
Empty_list
if the list is empty.
Note: this function does not comply with the usual exceptionless error-management
recommendations, as doing so would essentially render it useless.
let first : t 'a => 'a
hd
let last : t 'a => 'a
Empty_list
if
the list is empty. This function takes linear time and causes the
evaluation of all elements of the listlet at : t 'a => int => 'a
at l n
returns the element at index n
(starting from 0
) in
the list l
.Invalid_index
is the index is outside of
l
bounds.let nth : t 'a => int => 'a
at
These lists behave essentially as HashMap
, although they are
typically faster for short number of associations, and much
slower for for large number of associations.
let assoc : 'a => t ('a, 'b) => 'b
assoc a l
returns the value associated with key a
in the list of
pairs l
. That is, assoc a [^ ...; (a,b); ...^] = b
if (a,b)
is the leftmost binding of a
in list l
.Not_found
if there is no value associated with a
in the
list l
.let assq : 'a => t ('a, 'b) => 'b
BatLazyList.assoc
but with physical equalitylet mem_assoc : 'a => t ('a, 'b) => bool
let mem_assq : 'a => t ('a, 'b) => bool
BatLazyList.mem_assoc
but with physical equality.let rev : t 'a => t 'a
let eager_append : t 'a => t 'a => t 'a
Cost is linear in the length of the first list, not tail-recursive.
let rev_append : t 'a => t 'a => t 'a
Cost is linear in the length of the first list, tail-recursive.
let append : t 'a => t 'a => t 'a
Cost is constant. All evaluation is delayed until the contents
of the list are actually read. Reading itself is delayed by
a constant.
let (^@^) : t 'a => t 'a => t 'a
let concat : t (t 'a) => t 'a
let flatten : list (t 'a) => t 'a
let split_at : int => t 'a => (t 'a, t 'a)
split_at n l
returns two lists l1
and l2
, l1
containing the
first n
elements of l
and l2
the others.Invalid_index
if
n
is outside of l
size bounds.let split_nth : int => t 'a => (t 'a, t 'a)
split_at
.let unique : cmp::('a => 'a => int)? => t 'a => t 'a
unique cmp l
returns the list l
without any duplicate element.
Default comparator ( = ) is used if no comparison function specified.let unique_eq : eq::('a => 'a => bool)? => t 'a => t 'a
unique
except only uses an equality function. Use for
short lists when comparing is expensive compared to equality
testinglet remove : 'a => t 'a => t 'a
remove l x
returns the list l
without the first element x
found
or returns l
if no element is equal to x
. Elements are compared
using ( = ).let remove_if : ('a => bool) => t 'a => t 'a
remove_if cmp l
is similar to remove
, but with cmp
used
instead of ( = ).let remove_all : 'a => t 'a => t 'a
remove_all l x
is similar to remove
but removes all elements that
are equal to x
and not only the first one.let remove_all_such : ('a => bool) => t 'a => t 'a
remove_all_such f l
is similar to remove
but removes all elements
that satisfy the predicate f
and not only the first one.let take : int => t 'a => t 'a
take n l
returns up to the n
first elements from list l
, if
available.let drop : int => t 'a => t 'a
drop n l
returns l
without the first n
elements, or the empty
list if l
have less than n
elements.let take_while : ('a => bool) => t 'a => t 'a
take_while f xs
returns the first elements of list xs
which satisfy the predicate f
.let drop_while : ('a => bool) => t 'a => t 'a
drop_while f xs
returns the list xs
with the first
elements satisfying the predicate f
dropped.let to_list : t 'a => list 'a
let to_stream : t 'a => Stream.t 'a
let to_array : t 'a => array 'a
let enum : t 'a => BatEnum.t 'a
let of_list : list 'a => t 'a
Albeit slower than eager conversion, this is the default mechanism for converting from regular
lists to lazy lists. This for two reasons :
* if you're using lazy lists, total speed probably isn't as much an issue as start-up speed
* this will let you convert regular infinite lists to lazy lists.
let of_stream : Stream.t 'a => t 'a
let of_enum : BatEnum.t 'a => t 'a
let eager_of_list : list 'a => t 'a
This function is much faster than BatLazyList.of_list
but will freeze on cyclic lists.
let of_array : array 'a => t 'a
let filter : ('a => bool) => t 'a => t 'a
filter p l
returns all the elements of the list l
that satisfy the predicate p
.
The order of the elements in the input list is preserved.
let exists : ('a => bool) => t 'a => bool
exists p [^ a0; a1; ... ^]
checks if at least one element of the list satisfies the predicate p
.
That is, it returns (p a0) || (p a1) || ...
.
let for_all : ('a => bool) => t 'a => bool
for_all p [^ a0; a1; ... ^]
checks if all elements of the list satisfy the predicate p
.
That is, it returns (p a0) && (p a1) && ...
.
let filter_map : ('a => option 'b) => t 'a => t 'b
filter_map f [^ a0; a1; ... ^]
applies lazily f
to each a0
,
a1
... If f ai
evaluates to None
, the element is not included
in the result. Otherwise, if f ai
evaluates to Some x
, element
x
is included in the result.
This is equivalent to
match f a0 with
| Some x0 -> x0 ^:^ (match f a1 with
| Some x1 -> x1 ^:^ ...
| None -> [^ ^])
| None -> [^ ^]
.
let eternity : t unit
let sort : cmp::('a => 'a => int)? => t 'a => t 'a
compare
).let stable_sort : ('a => 'a => int) => t 'a => t 'a
let map2 : ('a => 'b => 'c) => t 'a => t 'b => t 'c
map2 f [^ a0; a1; ...^] [^ b0; b1; ... ^]
is [^ f a0 b0; f a1
b1; ... ^]
.Different_list_size
if the two lists have
different lengths. Not tail-recursive, lazy. In particular, the
exception is raised only after the shortest list has been
entirely consumed.let iter2 : ('a => 'b => unit) => t 'a => t 'b => unit
iter2 f [^ a0; ...; an ^] [^ b0; ...; bn ^]
calls in turn
f a0 b0; ...; f an bn
. Tail-recursive, eager.Different_list_size
if the two lists have
different lengths.let fold_left2 : ('a => 'b => 'c => 'a) => 'a => t 'b => t 'c => 'a
fold_left2 f a [^ b0; b1; ...; bn ^] [^ c0; c1; ...; cn ^]
is
f (... (f (f a b0 c0) b1 c1) ...) bn cn
. Eager.Different_list_size
if the two lists have
different lengths.let fold_right2 : ('a => 'b => 'c => 'c) => t 'a => t 'b => 'c => 'c
fold_right2 f [^ a0; a1; ...; an ^] [^ b0; b1; ...; bn ^] c
is
f a0 b0 (f a1 b1 (... (f an bn c) ...))
. Eager.Different_list_size
if the two lists have
different lengths. Tail-recursive.let for_all2 : ('a => 'b => bool) => t 'a => t 'b => bool
BatLazyList.for_all
, but for a two-argument predicate.Different_list_size
if the two lists have
different lengths.let exists2 : ('a => 'b => bool) => t 'a => t 'b => bool
BatLazyList.exists
, but for a two-argument predicate.Different_list_size
if the two lists have
different lengths.let combine : t 'a => t 'b => t ('a, 'b)
combine [^ a0; a1; ... ^] [^ b0; b1; ... ^]
is
[^ (a0, b0); (a1, b1); ... ^]
.Different_list_size
if the two lists
have different lengths. Tail-recursive, lazy.let uncombine : t ('a, 'b) => (t 'a, t 'b)
module Infix:{
..}
let print : first::string? =>
last::string? =>
sep::string? =>
(BatInnerIO.output 'a => 'b => unit) =>
BatInnerIO.output 'a => t 'b => unit
LazyList
with functions
behaving slightly differently but having the same name. This is by design:
the functions meant to override the corresponding functions of LazyList
.module Exceptionless:{
..}
module Labels:{
..}
LazyList
with labels.


Action : Get the list of MySQL databases
This action will retrieve the list of databases on a MySQL.
Parameters
| Parameters | Descriptions |
|---|---|
| Variable receiving the result | Must be equal to the array variable receiving the list of databases. |
Return value
The return value is determined by the databases installed on the server. It will be stored in the variable defined in the parameter "Variable receiving the result". This value is a list of text values (System.String).
Code Visual Basic.Net generated by SoftwareZator
If the variable receiving the result is "Result", the generated code will be as follows :
Result = VelerSoftware_MySQLPlugin.GetDatabases_MySQL()
Runtime errors
No runtime error is detected here.
Characteristics
| Types | Informations |
|---|---|
| Requiered level | Beginner |
| Category | MySQL |
| Type of value returned | List of text values (System.String) |
| Work in functions | Yes |
| Works in the declaration area | No |
| This action may receive children actions | No |


The RDA PIT API provides facilities to query and manipulate typed
information available from persistent identifiers and shared through
type registries.
All documentation of this project is released into the public domain as according to
CC0.
Testing
Testing can be done using mvn test.
However, testing requires an accessible Handle Server v8 instance and a Type Registry instance.
The configuration for these (IP addresses, credentials) must be provided through a property file.
The name of this file must be passed as a Java property using a '-D' switch to mvn test;
the name of the property is 'pitapi.testingconfig'. An example file can be found in the source code root
(testing.properties.example). Note that the addresses given in there are outdated and will not work anymore.
Alternatively, all properties in the properties file can be passed using '-D' switches.
Deployment
Deploying the API prototype requires access to a Handle System 8 server and a Type Registry instance.
The current API prototype uses the interface to an older version of the type registry under development by CNRI at typeregistry.org.
The older version may still be available at http://<IP_ADDRESS>:8002/registrar; an adaption to the newer interface may be available from the PIT git repository.
At time of writing, the Handle System 8 has not been publicly released. Some closed beta servers may be available for instance from members of the European Persistent Identifier Consortium.
The API prototype was written using
Jersey 2 based on
JAX-RS 2.0. The project offers full support for
Apache Maven.
The following instructions assume deployment on an
Apache Tomcat 8
application server.
- Use the following call to generate a web application
archive (war) file:
$ mvn war:war
- The REST service must be configured properly so it knows
which identifier service and type registry to contact.
An
example configuration file in Java's properties file format can be
found here.
Copy it to /usr/local/rda/pitapi.properties
and make
sure the application server's user has sufficient permissions to read it.
Also update it with the addresses of the Handle System 8 instance and possibly the Type Registry.
The config file contains the same properties that are also used for testing.
- Deploy the generated war file on your application server.
- A simple test to verify that the API is running properly can
be made by calling the {@link
rdapit.rest.TypingRESTResource#simplePing ping} method:
$ curl http://your.server/your.application.path/pitapi/ping
Hello World
Usage
Detailed documentation on the REST methods available can be found in
the {@link rdapit.rest.TypingRESTResource TypingRESTResource} class.


Online documentation:
Home
What Sensor Data?
Collecting Sensor Data
Formatting Sensor Data
Store/Transfer Data
Research
Contributing
Project Github Page
These pages describe how to use our open source software libraries. You can also view the research papers and smartphone apps that have been built using them.
All of the code described here, including these documentation pages, can be found on our Github Page. Our open-source software is licensed with the BSD License.
ESSensorManager
library provides a uniform and easily configurable access to sensor data, supporting both one-off and continuous sensing scenarios.
ESSensorDataManager
library allows you to format, and store and transfer data to your server.
These software libraries were developed as part of the EPSRC Ubhave project, which was funded between 2011-2015. They are all released under the BSD License; we do not guarantee that they are bug-free and/or up to date with the ever-evolving Android operating system.
The developers Google group is here. For any other queries, you can contact @nlathia.


ELECTION COMMISSION OF INDIA
GENERAL ELECTION TO VIDHAN SABHA TRENDS & RESULT 2018
Partywise
Constituencywise-All Candidates
Constituencywise Trends
Partywise
Select State
Choose State
Telangana
Mizoram
Rajasthan
Madhyapradesh
Chattisgarh


Creating a Core Language Pack
How to create a core language pack using the Languages module. Restricted to SuperUsers only.
- Navigate to Admin > Advanced Settings > Languages - OR - Go to a Languages module.
- Select the Languages tab.
- Click the Create Language Pack button.
- At Resource Locale, select the locale that want to generate the language pack for.
- At Resource Pack Type, select Core.
- Optional. In the Resource Pack Name text box, modify the name of the generated resource pack. Note: Part of the name is fixed.
- Click the Create button. This displays a success message that includes the path where the language pack is located.


Planet Rocket
Event Name
Info
Date
Location
Red Cross
Event Name
Info
Date
Location
Friends of the Dunes
Event Name
Info
Date
Location
Greenpeace
Event Name
Info
Date
Location


First Paragraph
Fanny pack mustache migas, brooklyn 3 wolf moon DIY ugh squid irony lomo flexitarian. Tousled fashion axe man bun viral. Kale chips pop-up artisan jean shorts aesthetic leggings. Fap gastropub kickstarter celiac flannel. Bushwick migas echo park, jean shorts normcore four dollar toast pork belly you probably haven't heard of them. Post-ironic typewriter tattooed chambray butcher forage. Hammock mustache +1, YOLO authentic etsy distillery echo park roof party cornhole seitan lumbersexual cold-pressed actually poutine.
Read MoreSecond Paragraph
Put a bird on it flexitarian kickstarter, messenger bag bushwick four dollar toast meh lo-fi gastropub ugh deep v artisan waistcoat wolf kogi. Typewriter ennui pinterest sartorial hammock iPhone. Mustache typewriter microdosing knausgaard try-hard schlitz. Blue bottle hella four dollar toast, pinterest tattooed taxidermy readymade disrupt kombucha hoodie iPhone YOLO authentic kale chips. Small batch banh mi beard, truffaut neutra single-origin coffee tumblr street art gluten-free yuccie sriracha health goth marfa swag ugh. Butcher dreamcatcher selvage heirloom. Post-ironic narwhal deep v sustainable.
Read MoreThird Paragraph
Fap flexitarian bushwick cred. YOLO fashion axe yr scenester, selvage wolf marfa meggings everyday carry craft beer. Crucifix tote bag pop-up tilde, letterpress mlkshk gastropub. Microdosing pinterest paleo forage gluten-free, vinyl chartreuse bicycle rights viral. Lo-fi marfa literally blog aesthetic, typewriter four loko kitsch retro. Bicycle rights drinking vinegar meditation, truffaut iPhone four dollar toast XOXO asymmetrical disrupt lo-fi. Umami beard jean shorts, before they sold out four dollar toast schlitz church-key austin shoreditch thundercats street art deep v hammock iPhone.
Read More


COPY
Loads data into a table from data files or from an Amazon DynamoDB table. The files can be located in an Amazon Simple Storage Service (Amazon S3) bucket, an Amazon EMR cluster, or a remote host that is accessed using a Secure Shell (SSH) connection.
Note
Amazon Redshift Spectrum external tables are read-only. You can't COPY to an external table.
The COPY command appends the new input data to any existing rows in the table.
The maximum size of a single input row from any source is 4 MB.
Note
To use the COPY command, you must have INSERT privilege for the Amazon Redshift table.
COPY Syntax
COPY table-name [ column-list ] FROM data_source authorization [ [ FORMAT ] [ AS ] data_format ] [ parameter [ argument ] [, ... ] ]
COPY Syntax Overview
You can perform a COPY operation with as few as three parameters: a table name, a data source, and authorization to access the data.

This section presents the required COPY command parameters and groups the optional parameters by function. Subsequent topics describe each parameter and explain how various options work together. You can also go directly to a parameter description by using the alphabetical parameter list.
Required Parameters
The COPY command requires three elements:
The simplest COPY command uses the following format.
COPY table-name FROM data-source authorization;
The following example creates a table named CATDEMO, and then loads the table with
sample data from a data file in Amazon S3 named category_pipe.txt
.
create table catdemo(catid smallint, catgroup varchar(10), catname varchar(10), catdesc varchar(50));
In the following example, the data source for the COPY command is a data file named
category_pipe.txt
in the tickit
folder of
an Amazon S3 bucket named awssampledbuswest2
. The COPY command is
authorized to access the Amazon S3 bucket through an AWS Identity and Access Management
(IAM) role. If your cluster
has an existing IAM role with permission to access Amazon S3 attached, you can substitute
your role's Amazon Resource Name (ARN) in the following COPY command and execute
it.
copy catdemo from 's3://awssampledbuswest2/tickit/category_pipe.txt' iam_role 'arn:aws:iam::
<aws-account-id>
:role/<role-name>
' region 'us-west-2';
For steps to create an IAM role, see Step 2: Create an IAM Role in the Amazon Redshift Getting Started. For complete instructions on how to use COPY commands to load sample data, including instructions for loading data from other AWS regions, see Step 6: Load Sample Data from Amazon S3 in the Amazon Redshift Getting Started..
- table-name
-
The name of the target table for the COPY command. The table must already exist in the database. The table can be temporary or persistent. The COPY command appends the new input data to any existing rows in the table.
- FROM data-source
-
The location of the source data to be loaded into the target table.
The most commonly used data repository is an Amazon S3 bucket. You can also load from data files located in an Amazon EMR cluster, an Amazon EC2 instance, or a remote host that your cluster can access using an SSH connection, or you can load directly from a DynamoDB table.
- Authorization
-
A clause that indicates the method that your cluster uses for authentication and authorization to access other AWS resources. The COPY command needs authorization to access data in another AWS resource, including in Amazon S3, Amazon EMR, Amazon DynamoDB, and Amazon EC2. You can provide that authorization by referencing an IAM role that is attached to your cluster or by providing the access key ID and secret access key for an IAM user.
Optional Parameters
You can optionally specify how COPY maps field data to columns in the target table, define source data attributes to enable the COPY command to correctly read and parse the source data, and manage which operations the COPY command performs during the load process.
Column Mapping
By default, COPY inserts field values into the target table's columns in the same order as the fields occur in the data files. If the default column order will not work, you can specify a column list or use JSONPath expressions to map source data fields to the target columns.
Data Format Parameters
You can load data from text files in fixed-width, character-delimited, comma-separated values (CSV), or JSON format, or from Avro files.
By default, the COPY command expects the source data to be in character-delimited UTF-8 text files. The default delimiter is a pipe character ( | ). If the source data is in another format, use the following parameters to specify the data format.
Data Conversion Parameters
As it loads the table, COPY attempts to implicitly convert the strings in the source data to the data type of the target column. If you need to specify a conversion that is different from the default behavior, or if the default conversion results in errors, you can manage data conversions by specifying the following parameters.
Data Load Operations
Manage the default behavior of the load operation for troubleshooting or to reduce load times by specifying the following parameters.
Using the COPY Command
For more information about how to use the COPY command, see the following topics:


Dear {{ user.username }},
Welcome to Row-Bot. Your account has been confirmed and you can now login here.
Sincerely,
The Row-Bot Engine
Note: replies to this email address are not monitored.


#include <EOSKernel.h>
Public Member Functions | |
| ~EOSKernel () | |
| destructor | |
| void | start (const char *appPath, bool norun) |
| starts the kernel | |
| void | stop () |
| stops the kernel | |
| EOSLuaEnvironment * | getLuaEnvironment () |
| returns a pointer to the current EOSLuaEnvironment wrapper class | |
Static Public Member Functions | |
| static EOSKernel * | getInstance () |
| returns the static instance of the class | |
| static int | moduleLoad (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.module.load) Loads a module in EOS environment | |
| static int | shutdown (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.shutdown) Shuts down the kernel (closes the application) | |
| static int | sleep (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.sleep) Suspends kernel execution for a given number of milliseconds | |
| static int | getCurrentTime (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.time.getCurrent) Returns the time (in seconds) since application started | |
| static int | getCurrentTimeMillis (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.time.getCurrentMillis) Returns the time (in milliseconds) since application started | |
| static int | setTargetFrameRate (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.setTargetFrameRate) Sets the target frame rate of the kernel (number of "update" executions per second) | |
| static int | getTargetFrameRate (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.getTargetFrameRate) Returns the current target frame rate of the kernel | |
| static int | getLastFrameTime (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.getLastFrameTime) Returns the duration (in seconds) of last kernel iteration (formerly a 'frame') | |
| static int | getApplicationRoot (lua_State *luaRuntime) |
| static int | processCreate (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.process.create) Returns the time (in seconds) since application started | |
| static int | processExists (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.process.exists) Tests the existence of a process | |
| static int | processSetActive (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.process.setActive) Sets the activity status of a Process | |
| static int | processIsActive (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.process.isActive) Sets the activity status of a Process | |
| static int | processDestroy (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.process.destroy) Destroys a Process | |
| static int | messageInit (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.message.init) Initializes a message structure | |
| static int | messagePushData (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.message.pushData) Pushes a data pair (key, value) in a previously initialized message (see messageInit) | |
| static int | messageSend (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.message.send) Sends a previously initialized and prepared message | |
| static int | setConsoleLogLevel (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.log.setConsoleLogLevel) Sets the verbosity level (on stderr) of the EOS Kernel | |
| static int | traceError (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.log.traceError) Writes a line in eos.log logfile, with 'error' class mark ([E]) | |
| static int | traceWarning (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.log.traceWarning) Writes a line in EOS.log logfile, with 'warning' class mark ([W]) | |
| static int | traceDebug (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.log.traceDebug) Writes a line in EOS.log logfile, with 'debug' class mark ([D]) | |
| static int | traceUser (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.log.traceUser) Writes a line in EOS.log logfile, with 'user' class mark ([U]) | |
| static int | traceInfo (lua_State *luaRuntime) |
| (Lua binding interface: mapped to eos.log.traceInfo) Writes a line in EOS.log logfile, with 'info' class mark ([I]) | |
Data Fields | |
| int | consoleVerbosityLevel |
| verbosity level for the console (stderr) output | |
Static Public Attributes | |
| static int | SAFEGUARD_ACTIVE = 1 |
| safeguard mechanism: activity flag | |
| static int | SAFEGUARD_FLAG_LOADMODULE = 2 |
| safeguard mechanism: module load check | |
| static struct luaL_reg | lua_eoskernel_main [] |
| contains top level lua binding functions (eos.*) | |
| static struct luaL_reg | lua_eoskernel_module [] |
| contains module handling lua binding functions (eos.module.*) | |
| static struct luaL_reg | lua_eoskernel_time [] |
| contains time related lua binding functions (eos.time.*) | |
| static struct luaL_reg | lua_eoskernel_process [] |
| contains process handling lua binding functions (eos.process.*) | |
| static struct luaL_reg | lua_eoskernel_message [] |
| contains message handling lua binding functions (eos.message.*) | |
| static struct luaL_reg | lua_eoskernel_log [] |
| contains log handling lua binding functions (eos.log.*) | |
Private Member Functions | |
| EOSKernel () | |
| private constructor | |
| int | init (const char *appPath, bool norun) |
| runs early initialization code of the kernel | |
| int | makeScripts (const char *scriptsPath) |
| compiles given application source scripts | |
| bool | safeguardCheck () |
| safeguard mechanism: exception check | |
| void | update () |
| executes an update cycle of the kernel (formerly a "frame") | |
| void | run () |
| starts kernel execution cycle | |
| void | pause (unsigned int milliseconds) |
| pauses kernel for a given number of milliseconds | |
| void | cleanup () |
| kernel resources cleanup. This function also calls cleanup on all loaded extension modules. | |
| bool | createProcess (const char *processName, const char *scriptName) |
| creates an EOS Process | |
| EOSProcess * | processByName (const char *processName) |
| returns the pointer to an EOS Process, by its name | |
| bool | setProcessActivity (const char *processName, bool activity) |
| sets the activity status of an EOS Process | |
| bool | destroyProcess (const char *processName) |
| destroys an EOS Process | |
| void | _setFrameRate (const char *requestedFrameRate) |
| sets the target execution frame rate of the kernel | |
| float | currentTime () |
| returns elapsed time since kernel start, in seconds | |
| unsigned long | currentTimeMillis () |
| returns elapsed time since kernel start, in milliseconds | |
| void | logMessage (int level, const char *format_string,...) |
| writes a line in the application log file | |
| void | prepareMessage (const char *messageClass) |
| prepares (initializes) a new EOSMessage structure | |
| void | pushMessageData (const char *messageDataKey, bool messageDataValue) |
| pushes a boolean data field in the current EOSMessage structure | |
| void | pushMessageData (const char *messageDataKey, float messageDataValue) |
| pushes a numeric data field in the current EOSMessage structure | |
| void | pushMessageData (const char *messageDataKey, const char *messageDataValue) |
| pushes a string data field in the current EOSMessage structure | |
| void | sendPreparedMessage (const char *messageReceiver) |
| sends current EOSMessage structure to the receiver Process | |
| void | registerNativeLuaFunctions () |
Private Attributes | |
| EOSPrecisionTimer * | kernelTimer |
| precision timer to handle execution timings | |
| EOSLuaEnvironment * | luaEnvironment |
| instance of the class that manages Lua Runtime Environment | |
| EOSScriptManager * | scriptManager |
| instance of the class that manages source scripts | |
| EOSProcess * | masterProcess |
| pointer to the application's main process (MasterProcess is the only process automatically instanced by the kernel) | |
| EOSMessage * | temporaryMessage |
| pointer to the temporary EOSMessage structure | |
| std::queue< EOSMessage * > | messageQueue |
| message queue | |
| unsigned long | frameStart |
| unsigned long | lastFrameTime |
| unsigned long | targetFrameTime |
| fields used for timing purposes | |
| std::map< std::string, EOSProcess * > | processes |
| processes hashmap | |
| unsigned int | safeguardRegistry |
| safeguard mechanism: flag registry | |
Static Private Attributes | |
| static bool | instanceFlag = false |
| static instance flag | |
| static EOSKernel * | instance = NULL |
| static instance | |
| static std::ofstream | logStream |
| application's output log stream |
| EOSKernel::~EOSKernel | ( | ) | [inline] |
destructor
| EOSKernel::EOSKernel | ( | ) | [private] |
private constructor
| EOSKernel * EOSKernel::getInstance | ( | ) | [static] |
returns the static instance of the class
| void EOSKernel::start | ( | const char * | appPath, | |
| bool | norun | |||
| ) | [inline] |
starts the kernel
| void EOSKernel::stop | ( | ) |
stops the kernel
| EOSLuaEnvironment* EOSKernel::getLuaEnvironment | ( | ) | [inline] |
returns a pointer to the current EOSLuaEnvironment wrapper class
| int EOSKernel::moduleLoad | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.module.load)
Loads a module in EOS environment
| moduleName | filename (relative to eos executable location) of the EOS Dynamic Module to load |
| int EOSKernel::shutdown | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.shutdown)
Shuts down the kernel (closes the application)
| int EOSKernel::sleep | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.sleep)
Suspends kernel execution for a given number of milliseconds
| milliseconds | number of milliseconds to sleep |
| int EOSKernel::getCurrentTime | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.time.getCurrent)
Returns the time (in seconds) since application started
| int EOSKernel::getCurrentTimeMillis | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.time.getCurrentMillis)
Returns the time (in milliseconds) since application started
| int EOSKernel::setTargetFrameRate | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.setTargetFrameRate)
Sets the target frame rate of the kernel (number of "update" executions per second)
| targetFrameRate | requested target frame rate |
| int EOSKernel::getTargetFrameRate | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.getTargetFrameRate)
Returns the current target frame rate of the kernel
| int EOSKernel::getLastFrameTime | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.getLastFrameTime)
Returns the duration (in seconds) of last kernel iteration (formerly a 'frame')
| static int EOSKernel::getApplicationRoot | ( | lua_State * | luaRuntime | ) | [static] |
| int EOSKernel::processCreate | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.process.create)
Returns the time (in seconds) since application started
| processName | - name of the new Process to create. The name must be unique. | |
| scriptName | - name of the script to use for the process. A script can be used for many processes. |
| int EOSKernel::processExists | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.process.exists)
Tests the existence of a process
| processName | - name of Process to test |
| int EOSKernel::processSetActive | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.process.setActive)
Sets the activity status of a Process
| processName | - name of the Process | |
| activity | - the activity status (true|false) to set |
| int EOSKernel::processIsActive | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.process.isActive)
Sets the activity status of a Process
| processName | - name of the Process |
| int EOSKernel::processDestroy | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.process.destroy)
Destroys a Process
| processName | - name of the Process to destroy |
| int EOSKernel::messageInit | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.message.init)
Initializes a message structure
| messageClass | - class of the message (tipically a string that identifies the sender, or the type of the message) |
| int EOSKernel::messagePushData | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.message.pushData)
Pushes a data pair (key, value) in a previously initialized message (see messageInit)
| keyName | - name of the data field to push (the 'key') | |
| valueData | - value to push: it can be a Boolean, a Numeric, or a String |
| int EOSKernel::messageSend | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.message.send)
Sends a previously initialized and prepared message
| receiverProcessName | - name of the receiver process |
| int EOSKernel::setConsoleLogLevel | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.log.setConsoleLogLevel)
Sets the verbosity level (on stderr) of the EOS Kernel
| verbosityLevel | - max message level to dump on stderr. (A constant between eos.kernel.[ LOGLEVEL_NONE | LOGLEVEL_ERR | LOGLEVEL_WARN | LOGLEVEL_DBUG | LOGLEVEL_USER | LOGLEVEL_INFO ] ) |
| int EOSKernel::traceError | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.log.traceError)
Writes a line in eos.log logfile, with 'error' class mark ([E])
| logLine | - line to write to log |
| int EOSKernel::traceWarning | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.log.traceWarning)
Writes a line in EOS.log logfile, with 'warning' class mark ([W])
| logLine | - line to write to log |
| int EOSKernel::traceDebug | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.log.traceDebug)
Writes a line in EOS.log logfile, with 'debug' class mark ([D])
| logLine | - line to write to log |
| int EOSKernel::traceUser | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.log.traceUser)
Writes a line in EOS.log logfile, with 'user' class mark ([U])
| logLine | - line to write to log |
| int EOSKernel::traceInfo | ( | lua_State * | luaRuntime | ) | [static] |
(Lua binding interface: mapped to eos.log.traceInfo)
Writes a line in EOS.log logfile, with 'info' class mark ([I])
| logLine | - line to write to log |
| int EOSKernel::init | ( | const char * | appPath, | |
| bool | norun | |||
| ) | [private] |
runs early initialization code of the kernel
| int EOSKernel::makeScripts | ( | const char * | scriptsPath | ) | [private] |
compiles given application source scripts
| bool EOSKernel::safeguardCheck | ( | ) | [private] |
safeguard mechanism: exception check
| void EOSKernel::update | ( | ) | [private] |
executes an update cycle of the kernel (formerly a "frame")
| void EOSKernel::run | ( | ) | [private] |
starts kernel execution cycle
| void EOSKernel::pause | ( | unsigned int | milliseconds | ) | [inline, private] |
pauses kernel for a given number of milliseconds
| void EOSKernel::cleanup | ( | ) | [private] |
kernel resources cleanup. This function also calls cleanup on all loaded extension modules.
| bool EOSKernel::createProcess | ( | const char * | processName, | |
| const char * | scriptName | |||
| ) | [private] |
creates an EOS Process
| EOSProcess * EOSKernel::processByName | ( | const char * | processName | ) | [private] |
returns the pointer to an EOS Process, by its name
| bool EOSKernel::setProcessActivity | ( | const char * | processName, | |
| bool | activity | |||
| ) | [private] |
sets the activity status of an EOS Process
| bool EOSKernel::destroyProcess | ( | const char * | processName | ) | [private] |
destroys an EOS Process
| void EOSKernel::_setFrameRate | ( | const char * | requestedFrameRate | ) | [private] |
sets the target execution frame rate of the kernel
| float EOSKernel::currentTime | ( | ) | [private] |
returns elapsed time since kernel start, in seconds
| unsigned long EOSKernel::currentTimeMillis | ( | ) | [private] |
returns elapsed time since kernel start, in milliseconds
| void EOSKernel::logMessage | ( | int | level, | |
| const char * | format_string, | |||
| ... | ||||
| ) | [private] |
writes a line in the application log file
| void EOSKernel::prepareMessage | ( | const char * | messageClass | ) | [private] |
prepares (initializes) a new EOSMessage structure
| void EOSKernel::pushMessageData | ( | const char * | messageDataKey, | |
| bool | messageDataValue | |||
| ) | [private] |
pushes a boolean data field in the current EOSMessage structure
| void EOSKernel::pushMessageData | ( | const char * | messageDataKey, | |
| float | messageDataValue | |||
| ) | [private] |
pushes a numeric data field in the current EOSMessage structure
| void EOSKernel::pushMessageData | ( | const char * | messageDataKey, | |
| const char * | messageDataValue | |||
| ) | [private] |
pushes a string data field in the current EOSMessage structure
| void EOSKernel::sendPreparedMessage | ( | const char * | messageReceiver | ) | [private] |
sends current EOSMessage structure to the receiver Process
| void EOSKernel::registerNativeLuaFunctions | ( | ) | [private] |
verbosity level for the console (stderr) output
int EOSKernel::SAFEGUARD_ACTIVE = 1 [static] |
safeguard mechanism: activity flag
int EOSKernel::SAFEGUARD_FLAG_LOADMODULE = 2 [static] |
safeguard mechanism: module load check
struct luaL_reg EOSKernel::lua_eoskernel_main[] [static, read] |
contains top level lua binding functions (eos.*)
struct luaL_reg EOSKernel::lua_eoskernel_module[] [static, read] |
contains module handling lua binding functions (eos.module.*)
struct luaL_reg EOSKernel::lua_eoskernel_time[] [static, read] |
contains time related lua binding functions (eos.time.*)
struct luaL_reg EOSKernel::lua_eoskernel_process[] [static, read] |
contains process handling lua binding functions (eos.process.*)
struct luaL_reg EOSKernel::lua_eoskernel_message[] [static, read] |
contains message handling lua binding functions (eos.message.*)
struct luaL_reg EOSKernel::lua_eoskernel_log[] [static, read] |
contains log handling lua binding functions (eos.log.*)
bool EOSKernel::instanceFlag = false [static, private] |
static instance flag
EOSKernel * EOSKernel::instance = NULL [static, private] |
static instance
std::ofstream EOSKernel::logStream [static, private] |
application's output log stream
EOSPrecisionTimer* EOSKernel::kernelTimer [private] |
precision timer to handle execution timings
EOSLuaEnvironment* EOSKernel::luaEnvironment [private] |
instance of the class that manages Lua Runtime Environment
EOSScriptManager* EOSKernel::scriptManager [private] |
instance of the class that manages source scripts
EOSProcess* EOSKernel::masterProcess [private] |
pointer to the application's main process (MasterProcess is the only process automatically instanced by the kernel)
EOSMessage* EOSKernel::temporaryMessage [private] |
pointer to the temporary EOSMessage structure
std::queue<EOSMessage*> EOSKernel::messageQueue [private] |
message queue
unsigned long EOSKernel::frameStart [private] |
unsigned long EOSKernel::lastFrameTime [private] |
unsigned long EOSKernel::targetFrameTime [private] |
fields used for timing purposes
std::map<std::string, EOSProcess*> EOSKernel::processes [private] |
processes hashmap
unsigned int EOSKernel::safeguardRegistry [private] |
safeguard mechanism: flag registry


Web forms example - with style
Your username
email
password
Language
Choose language:
Български
Deutch
Gender:
woman
man
I agree
Choose avatar:


Provides various building blocks for building an Emacs-like text editor.
It also provides a number of Scheme procedures that have the same name
and similar functionality as the Emacs Lisp functions.
Somewhat out of date.
Check the JEmacs home page
for more information.
It uses the Swing tool-kit.
Plan
The plan is to use
this together with the (unfinished) gnu.jemacs.lang
package to provide a fully-functional re-implementation of
Emacs Lisp which compiles to Java bytecodes.
I'm hoping volunteers will help me make "JEmacs" into something
useful. I have fairly clear ideas about much of what need to be
done. Contact me if you are interested.
Home page
There is now a JEmacs home page.
Also check out the
Kawa home page.
Screen snapshot
There is a now a
teaser screen snapshot.
Status
Very unfinished proof of concerpt.
It is a functional but very minimal editor.
Many of the core Emacs concepts (keymaps, windows, frames,
buffers, markers) are implemented, and generally in such a way as
to provide the standard Emacs semantics. There are Scheme functions
with the same name and similar behavior as the standard Emacs Lisp
functions. However, there is only a very limited set of core "editing"
commands, and no searching commands. And it is not
robust or reliable.
To-do
A couple of things volunteers might start with
(but let me know before you spend serious time on any of these):
- Implement more of the editing commands: Insert/delete/forward/backward
word/line.
- Display the modeline in inverse video, but extend it to the full
window width.
- Come up with a design for narrowing a buffer. One possibility
is to use some kind of invisible style for the text outside the narrowing.
But I think a more flexible design would use an "IndirectDocument" class
that refers to a sub-range of a buffer. This would help with "Indirect
Buffers", and might be flexible and elegant in general.
- Perhaps Buffer should inherit from Document (or rather
DefaultStyledDocument). However, that might lose some flexibility.
- Needs methods to control Window scrolling.
- Think about how to map extents and faces to Swing attributes
and styles.
- Decide how to implement Emacs strings.
Initially, we'll use kawa.lang.FString, but we do want to support strings
with extents and text properties.
Usage
These classes depend on Swing, so make sure you have Swing available.
Then make sure you have a version of the Kawa classes that contains
the gnu.jemacs.buffer
classes. (In other words,
Kawa needs to have been configure --with-swing
support.)
Then just start Kawa in the usual way:
java kawa.repl
Then evaluate:
(emacs)
That brings up a Emacs window.
You can do (split-window)
to create new (sub-)windows
in an existing frame; type (make-frame)
to create
a new frame (to-level window), or do (get-buffer-create NAME)
to create a new buffer.
Note also how ctrl/B
and ctrl/F
have been
bound to the correct functions. For other working key-bindings,
look for the calls to define-key
in emacs.scm
.
The call (scheme-swing-window)
creates a new Scheme
interaction window.
License
Same as the package gnu.expr
: Modified Gnu Public License.
See the file COPYING.
For now, the copyright holder is Per Bothner; in the future it may
make more sense to make the FSF the copyright owner, since the plan
is to use a lot of the existing ELisp packages once ELisp support
is complete.
Author
Per Bothner,
<bothner@gnu.org>


Cake Gallery
Regular
Fruit&CheeseCakes
Occasion
Special
Kids cakes
Wedding
Order Now
Contact us
Admin
About us
Home
Our most popular cake of the week!!


| Five of a kind | 250 | 500 | 750 | 2250 | 5000 |
| Royal Straight | 100 | 200 | 300 | 900 | 1000 |
| Straight flush | 40 | 80 | 120 | 360 | 400 |
| Four of a kind | 20 | 40 | 60 | 180 | 200 |
| Full house | 8 | 16 | 24 | 72 | 80 |
| Flush | 5 | 10 | 15 | 45 | 50 |
| Straight | 4 | 8 | 12 | 36 | 40 |
| Three of a kind | 2 | 4 | 6 | 18 | 20 |
| Two pair | 1 | 2 | 3 | 9 | 10 |
WAGERWAIT
WIN0
WIN0
Credits
WAIT
WAIT


title = "Register" url = "/register" layout = "noSidebar" is_hidden = 0 role = 0 permission = 0 anonymous_only = 0 logged_only = 0 [Registration] mode = "submit" redirect_on = 1 redirect_page = "profile" activation = "activation_on" force_login = 1 ==


This report of Google Foobar's death was greatly exaggerated
Two new problems were added on . Other two problems were added on .
So, what was1 Google Foobar about? I still don't know. Some said it was an hiring push for Python developers. Others claimed that Google was looking for cryptanalysts. There's even someone who proposed that it was an elaborate marketing ploy for the recently released "The Imitation Game" movie.
I won't talk in this post about how to get in, or what does it look like, since excellent articles were already written about these topics. I will instead describe the problems I encountered, the techniques I used and what I learned. I will also discuss a few conjectures I have about Google Foobar.
The problems
Google Foobar currently consists of 30 problems articulated in 8 levels, where level \(i\) contains exactly \(i\) problems, except for level 8, which for now only has six. Problem difficulty does not always increase with the level: it does until level 5, then, when all the hard problems are gone, we get all the easier problems that we didn't solve before.
Since there's still people playing, I won't spoil their fun by posting the exact problem statements or their solutions. On the other hand, several problems are well-known, therefore discussing their solution should do no harm.
For example, one of these problems asks to calculate the number of integer points within a triangle, and this problem is solved in this Stackoverflow thread by rederiving Pick's Theorem for triangles.
Another problem asks how much water gets trapped in a given landscape, represented by an array of integers. This is a classical interview question, also solved on Stackoverflow.
As you might know, this problem has a solution that does 3 passes over the landscape array \(A\). If you were to implement a simpler solution that does \(\max(A)\) passes you'd discover that Google Foobar times out.
In fact, the possible input size almost invariably acted as a strong hint for the accepted time complexity. An input in the order of the millions would usually require a linear algorithm, while inputs in the order of the tens would imply some kind of brute-force or exponential algorithm.
Choosing the right algorithm and implementing it correctly were usually enough to advance to the next level. In some cases I needed a little bit of profiling: this just meant to run
$ python -m cProfile solution.py
to identify and fix the bottleneck. In most cases the problem was solved by adding a very naïve memoization cache. For example, I frequently used this method to compute the binomial coefficient \({n \choose k}\):
Sometimes this was too slow, but adding a memoization dictionary made the method fast enough. For example:
This was all that was needed to pass the vast majority of puzzles. A few puzzles required either more advanced mathematics or, in my case, a little bit of cheating.
The difficult problems
In my opinion, three problems stood out for difficulty: undercover_underground
, zombit_pandemic
and grid_zero
.
The first two asked to calculate the number of graphs having certain properties. In both cases, an explicit formula was out of question, but the problems could be solved by finding a recursive formula and applying it (usually with a memoization dictionary).
It's interesting to note that both problems can be solved using the techniques of Analytic Combinatorics, hinting that somebody behind Foobar has an advanced mathematics background.
I almost ran out of time on the last one. It essentially asks to find the minimal number of buttons to press to turn all buttons off in a variant of the Lights out game, in which pressing a button will flip the state of all buttons in the same row and column (including itself).
I tried everything I could with this problem, as detailed in this Mathematics StackExchange question, but I only managed to implement a brute-force algorithm that solved correctly 4 out of 5 test cases.
With only a few hours left, I resorted to... unorthodox strategies. I knew that the answer to a test case was a number between 1 and 225, so I submitted fake solutions until I determined the answer to the missing test case. Then I incorporated the fake solution in the rest of my code, hoped that Foobar was using the same test cases for verify
and submit
... and they did.
What Google Foobar probably wasn't
Finally, here are my conjectures about Google Foobar.
An attempt to recruit cryptanalysts: Only one problem had something to do with code-breaking. Most of the other problems were standard algorithmical questions, perhaps with a little more mathematics than usual.
A marketing ploy for "The Imitation Game": While I found it remarkable that Google managed to sneak in Foobar in the trailer of a movie that some say is poised for an Academy Award, I don't think that's a reasonable explanation. The hiring push seems just much more probable.
A success: According to StackExchange, my questions were seen roughly 200 times each. From this data, I estimate that Google Foobar had in the order of the low hundreds of committed participants, who got to at least level 4/5. On the other hand, it's possible that most people stopped after level 3, when Google Foobar asks your credentials to submit them to a Google recruiter.2
I don't think anything will come out of this. I don't expect to be called by Google over Foobar — but I wouldn't mind!


Balbuzard - Documentation
This is the documentation home page for the Balbuzard tools. The online version is here, and a copy can be found in the balbuzard/doc subfolder of the package.
Balbuzard is a package of malware analysis tools in python to extract patterns of interest from suspicious files (IP addresses, domain names, known file headers, interesting strings, etc). It can also crack malware obfuscation such as XOR, ROL, etc by bruteforcing and checking for those patterns.
- balbuzard is a tool to extract patterns of interest from malicious files, such as IP addresses, URLs, embedded files and typical malware strings. It is easily extensible with new patterns, regular expressions and Yara rules.
- bbcrack uses a new algorithm based on patterns of interest to bruteforce typical malware obfuscation such as XOR, ROL, ADD and various combinations, in order to guess which algorithms/keys have been used.
- bbharvest extracts all patterns of interest found when applying typical malware obfuscation transforms such as XOR, ROL, ADD and various combinations, trying all possible keys. It is especially useful when several keys or several transforms are used in a single file.
- bbtrans can apply any of the transforms from bbcrack (XOR, ROL, ADD and various combinations) to a file.
- If you need to analyze a new malicious file, you can first try balbuzard to extract strings/patterns of interest and detect embedded files in cleartext.
- Then if you think the malicious file might use an obfuscation algorithm such as XOR to hide interesting data (e.g. an embedded executable file), try bbcrack to find the algorithm and the key(s).
- Alternatively, if bbcrack is not successful, or if you think the file may use several algorithms and/or keys, try bbharvest. bbharvest is especially targeted at single strings obfuscated within an executable or malicious file.
5 minutes demo
See the Demo page to see examples and test the tools by yourself in a few minutes using the provided samples.
Help wanted:
- if you have malware samples or malicious documents with known obfuscation algorithms such as XOR, please contact me. That will help me a lot to improve bbcrack and bbharvest.
- if you know other strings, patterns, file headers useful for malware analysis that Balbuzard should support, or other obfuscation algorithms, please contact me.
Documentation pages
Quick links:
See http://www.decalage.info/python/balbuzard
for more info and other tools.


Profile
First name
John
Last name
Doe
Email
<EMAIL_ADDRESS>Created on
Created on
Edited on
Edited on
Roles
Admin
User
Edit


Perl Advent Calendar 2016 CFP
You are cordially invited to write an article for the 2016 Perl Advent Calendar.
As an advent calendar author you will write on entry on a module of your choosing that will be revealed to the world on The Perl Advent Calendar on a given day of advent (between the 1st and 24th of December 2016 inclusive.)
The Perl Advent Calendar welcome diverse author submissions from all types of Perl programmer. It is our firm belief that every Perl Programmer, no matter how advanced or how novice, has a favorite Perl module they want to tell the world about. The module that is the subject of the article need not be written by the article author, and more often than not this is not the case.
The Perl Advent Calendar also believes that the pool of authors should not be limited to people who have English as their first language. Authors who speak English as a second language are encouraged to submit. Each article submission undergoes an editorial process which assist those authors who may need help with their writing.
In order to participate in the Perl Advent Calendar please use this form to submit your chosen module and a brief description of your article (which need be no more than two or three sentences) by no later than 11:59 PM EST Saturday October 15th 2016.
We look forward to hearing from you!
Timelines
-
11:59 PM EST Saturday October 15th 2016: Deadline for Call For Participation.
-
11:59 PM EST Sunday October 16th 2016: Authors of all CFP submissions will be notified if their article has been accepted
-
11:59 PM EST Tuesday November 1st 2016: First draft of article submission committed by author into Perl Advent Calendar Github repository. This need not be 100% completed at this point, but at this point the Perl Advent Calendar editorial team will start the editing process (correcting typos, editing for house style, making sure the article renders correctly, suggesting language and graphics improvements, etc.)
-
11:59 PM EST Wednesday November 30th 2016: Deadline for the final changes to the articles
-
12:00 AM EST Thursday December 1st 2016: Advent begins. Go live date.
Guidelines on the Articles
-
The best way to see what we’re after in an article is to take a look at the previous year’s articles.
-
Our articles should try and be light and trivial and along the Christmas theme. Our variable names can be
$rudolph
, or$frosty
, or$mrhankey
. Our articles are often stories of problems fictional Christmas characters have. In all, we try to be entertaining in our articles. -
We like our articles to contain text and code interspersed, and if necessary a final script at the end with lots of comments.
-
Pictures, graphs, and other graphics are good and highly encouraged. Last year we included animated gifs of terminal output, renderes of spinning OpenGL snowflakes, and a full interactive JavaScript map of the world showing off GeoIP location from Perl.
-
Formatting is in POD with a custom header. See the source for previous year’s articles for examples. You can use
=for html
or even=for web_only
and=for rss_only
if needed to add custom HTML to your POD.


--- layout: default title: "COSC 201: Algorithms and Data Structures" shorttitle: "COSC 201" --- Syllabus Schedule Facebook Group


{% blocktrans trimmed %} You are authenticated as {{ username }}, but are not authorized to access this page. Would you like to login to a different account? {% endblocktrans %}
{% endif %} {% if first_login %}{% blocktrans trimmed %} You are about to set up the system and add data sources. But first, please log in with the default username and password. {% endblocktrans %}
{% endif %} {% if not first_login and google_oauth_credentials %} {% endif %} {% if not first_login and google_oauth_credentials %} {% endif %}


We forward you order to the school.

Your order will be placed when payment is received
Drop your payment off at the rectory or send it with your kids to school.
Your order will be placed when payment is received


POPUP1
POPUP1
POPUP5
OPEN
TRIGGER
POPUP2
CUSTOM-CLOSE
OPEN
Open Pop1
Popup 1
close
Close Pop1
Popup 2
Monday
Tuesday
Wednesday
Thursday
Friday
Saturday
Popup 3
Custom Close
Close
Popup 5
light
medium
dark


The following values were updated on the blockchain/contract:
Operation: {{ receipt.operation }}
From: {{ receipt.from }}
To: {{ receipt.to }}
Gas Used: {{ receipt.gasUsed }}
Account balance: {{ receipt.balance }}


Use CSS to style elements with the class name "city":
London is the capital of England.
Paris is the capital of France.
Tokyo is the capital of Japan.


* Assets filed in or after 2015 and published in or before 2019 in US.
Data Sources
UCI Machine Learning Repository


Created by Mashape
<IP_ADDRESS>:30000
<IP_ADDRESS>:30001
<IP_ADDRESS>:40000
<IP_ADDRESS>:40001
This project has been started to help testing TCP and UDP requests in a very easy way. It is very useful for seeing what your clients are sending to TCP/UDP servers and debug problems. It can also be used for mock integration tests.

Mockbin.com - Mock, Test & Track HTTP calls
Apiembed.com - Embeddable API Code snippets
Mashape.com - Largest API Marketplace And Powerful Tools For Private And Public APIs


DuoTones colorschemes
Based on DuoTone themes by Simurai for Atom.
This is a work in progress. Until now only templates for Vim, Sublime Text and Prism have been edited.
In time the templates for HighlightJs and Prettify will also be edited to tone down those brackets, punctuation and so on, in order to keep these colorschemes in the spirit of the original DuoTone Themes.
“DuoTone themes use only 2 hues (7 shades in total). It tones down less important parts (like punctuation and brackets) and highlights only the important ones. This leads to a more calm color scheme, but still lets you find the stuff you’re looking for.”
DuoTone Dark
Based on DuoTone Dark Theme by Simurai.
Go to demo with Prism.
function foo(bar) {
var a = 42,
b = 'Prism';
return a + bar(b);
}
DuoTone DarkSea
Based on DuoTone DarkSea Theme by Simurai
Go to demo with Prism.
function foo(bar) {
var a = 42,
b = 'Prism';
return a + bar(b);
}
DuoTone DarkSpace
Based on DuoTone DarkSpace Theme by Simurai.
Go to demo with Prism.
function foo(bar) {
var a = 42,
b = 'Prism';
return a + bar(b);
}
DuoTone DarkEarth
Based on DuoTone DarkEarth Theme by Simurai.
Go to demo with Prism.
function foo(bar) {
var a = 42,
b = 'Prism';
return a + bar(b);
}
DuoTone DarkForest
Based on DuoTone DarkForest Theme by Simurai.
Go to demo with Prism.
function foo(bar) {
var a = 42,
b = 'Prism';
return a + bar(b);
}
DuoTone DarkPool
Adapted from DuoTone Dark Theme by Simurai.
Go to demo with Prism.
function foo(bar) {
var a = 42,
b = 'Prism';
return a + bar(b);
}
Downloads
All downloads can be found in the output folder.
For Atom, please use the original theme by Simurai. For Sublime Text, go to the Textmate folder within the output folder. Or download the zip-file for Sublime Text/Textmate directly from here.
Installation for Sublime Text with Git
Or, when using Git, you can clone the dedicated repo for this purpose
In your Packages directory, clone the theme repository using the command below:
git clone https://github.com/atelierbram/duotones-sublime-colorschemes.git
Installation for Vim with Git
For Vim with Pathogen you can clone the dedicated repo for this purpose in the ~/.vim/bundle
directory like so:
cd ~/.vim/bundle
git clone https://github.com/atelierbram/vim-colors_duotones.git
Demo
Lab
Credits
- Credits to Simurai whose DuoTone themes for Atom were a model for these colorschemes
- Credits to Chris Kempson, whose Base16 Builder was used for conversion to the different output formats. It’s a remarkable building tool, and I would also recommend trying out the colorschemes he made with them.


class Pusher::PushNotifications
Push Notifications Client
Constants
- MAX_INTEREST_LENGTH
Maximum interest name length
- SDK_VERSION
Pusher Push Notifications Ruby server SDK version
Public Class Methods
new(instance_id, secret_key)
click to toggle source
Initializes Push Notification client
Attributes¶ ↑
instance_id
-
The unique identifier for your Push notifications
instance
secret_key
-
Push Notifications instance secret key
Examples¶ ↑
instance_id = '97c56dfe-58f5-408b-ab3a-158e51a860f2' secret_key = '6033364526F02EDEF472461879CE485' pusher = Pusher::PushNotifications.new(instance_id, secret_key)
# File lib/push_notifications.rb, line 37 def initialize(instance_id, secret_key) @instance_id = instance_id @secret_key = secret_key end
Public Instance Methods
publish(interests, publish_body)
click to toggle source
Publish a push notification to your registered & subscribed devices
Attributes¶ ↑
interests
-
Array of interests that you want to subscribe to
publish_body
-
Hash containing the body of the publish request
Examples¶ ↑
publish_body = { 'apns': { 'aps': { 'alert': 'Hello!' } } } interests = %w[luka pizza] pusher.publish(interests, publish_body)
# File lib/push_notifications.rb, line 61 def publish(interests, publish_body) raise ArgumentError, 'Publishes must target at least one interest' if interests.empty? validate_interest_length(interests) validate_interest_characters(interests) res = publishes_request(interests, publish_body) if res.is_a?(Net::HTTPSuccess) return JSON.parse(res.body)['publishId'] else handle_error(res) end end


A MAN FOR ALL SEASONS A film review by Mark R. Leeper Copyright 1988 Mark R. Leeper
Capsule review: Ted Turner could not colorize A MAN FOR ALL SEASONS, so he remade it, letting Charleton Heston direst himself. He gave it a good cast, restored all the dialogue of the stage play, and did all the right things. But why remake a film that cannot be improved? Rating: high +2. Rating of the original film +4 and a must-see. Over and over.
I like film more than most people. And I have seen a lot of films that have deeply affected me, but my favorite film of all time is Fred Zinnemann's 1966 A MAN FOR ALL SEASONS. Back when I was in graduate school I had the entire film on audiotape and would play it two or three times a week. It was the second film I had recorded on audiotape in a collection of eventually hundreds. It was the FIRST film I ever recorded on videotape to keep. Very well, I could never expect the new version to measure up. I was sure I would begrudge the film every minor variation from the original. That expectation turned out to be wrong, but not by a whole lot.
The plot and most of the dialogue are, of course, identical to the Zinnemann version. The first plus for the remake is that it follows very closely the original stage play. The original film rearranged things a little. For those who have not seen the 1966 version, you have my pity and this plot synopsis. A MAN FOR ALL SEASONS is Robert Bolt's play about the results of Thomas More's choice of principle and integrity over all else. More had an extremely nimble mind, a love of his king and close friend Henry VIII, and a love of his religion, Catholicism. These loves are perfectly consistent until Henry decides to split from the Church and expects the endorsement of the nobility. Being asked to choose between his loves, More decides to be officially neutral with full knowledge that the law should protect his stand. For the lack of one oath of support, Henry's agents make war on More. They have the power of the king; More has only the law and his agile use of it to protect himself.
For this version Charleton Heston both plays More and directs. He certainly has more name recognition than Paul Scofield, who played the role in the Zinnemann version. Scofield is better known for stage than for film. Heston's dramatic talent and acting range lie somewhere between those of a Scofield and those of, say, a Sylvester Stallone, and I would guess it lies at just about the halfway point. Heston has none of the frailty of Scofield. He has always overpowered his roles.  The pain in Scofield's delivery gives the line far more sincerity. He is a friend who has to hurt a friend and does not want to, while Heston's More is only saying what is expected. In one scene in the play, More breaks down and cries. Scofield lets his voice break up and then sobs. He does it gently. Heston contorts his face in agony. He just cannot project gentle emotions so he rarely uses them.
One place where the remake should have been an improvement and disappointingly was not was in the role of Wolsey. Where Zinnemann had Orson Welles, Heston had John Gielgud. Both are good actors but I generally would give the edge to Gielgud. But not in this film. When Heston faces Gielgud, each knows his own lines but they are not playing off of each other. Talking about actions that will be taken against the Church, Wolsey refers to "certain measures, perhaps regrettable, perhaps not," then noting More's wry smile, "All right, regrettable." Gielgud does not stop to see the smile. He runs the two lines together with no change of tone and there is no wry smile. It is a misdelivery and a better director than Heston would have corrected it.
Vanessa Redgrave, the only obvious actor to play in both versions goes from playing a nubile Anne Boleyn to Alice, More's wife. Wendy Hiller played the role as an intelligent, willful woman who, when she calls herself "a fool" clearly means it only in contrast to More. Redgrave really plays it as a fool--doughty, flutterly, and superficial, with just a hint of something deeper behind the gestures. Her interpretation is certainly a valid one, but as with most interpretations of roles in the Heston version, she is not as appealing as she was in the original film.
All these criticisms are, of course, only contrasts to the original film. In its own right, the Heston version is an excellent film. It is a superb play done with a very good cast. It raises the same issues as the other version and has the same excellent writing. There is little even an indifferent filmmaker could have done to hurt the story. In good conscience I could not give the Heston film anything beneath a high +2. To my mind, however, the Best Picture of 1966 remains the best picture of all seasons.
Mark R. Leeper att!mtgzz!leeper<EMAIL_ADDRESS>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


| Modifier and Type | Method and Description |
|---|---|
XPathElement |
XPathPullParser.getCurrentElement()
Gets the current element being passed, as an
XPathElement . |
| Modifier and Type | Method and Description |
|---|---|
XPathElement |
XPathPullParserImpl.getCurrentElement()
Gets the current element being passed, as an
XPathElement . |
| Modifier and Type | Method and Description |
|---|---|
protected static XPathRepository<XPathElement> |
BaseIceSoapParserImpl.compileXPath(XMLField soapFieldAnnot,
Field sourceField)
Gets the xpath from a
XMLField annotation and compiles it to a
repo of XPathElement s. |
protected static XPathRepository<XPathElement> |
BaseIceSoapParserImpl.compileXPath(XMLObject soapObjectAnnot,
Class<?> sourceClass)
Gets the xpath from a
XMLObject annotation and compiles it to a
repository of xpath elements. |
protected XPathRepository<XPathElement> |
BaseIceSoapParserImpl.getRootXPaths()
Gets the root xpaths being parsed.
|
protected static XPathRepository<XPathElement> |
BaseIceSoapParserImpl.retrieveRootXPaths(Class<?> targetClass)
Retrieves the root xpath(s) from the annotation on the class - there will
be only one in most cases, but more if the xpath "|" operator has been
used to define multiple xpaths.
|
| Constructor and Description |
|---|
BaseIceSoapParserImpl(XPathElement rootXPath)
Instantiates a new
BaseIceSoapParserImpl |
IceSoapListParserImpl(Class<ListItemType> clazz,
XPathElement containingXPath)
Instantiates a new list parser.
|
IceSoapListParserImpl(Class<ListItemType> clazz,
XPathElement containingXPath,
BaseIceSoapParserImpl<ListItemType> parser)
Instantiates a new list parser.
|
IceSoapParserImpl(Class<ReturnType> targetClass,
XPathElement rootXPath)
Instantiates a new parser.
|
| Constructor and Description |
|---|
BaseIceSoapParserImpl(XPathRepository<XPathElement> rootXPaths)
Instantiates a new
BaseIceSoapParserImpl . |
IceSoapParserImpl(Class<ReturnType> targetClass,
XPathRepository<XPathElement> rootXPaths)
Instantiates a new parser.
|
| Modifier and Type | Method and Description |
|---|---|
XPathElement |
XPathRepository.XPathRecord.getKey()
The key the record is stored against.
|
| Modifier and Type | Method and Description |
|---|---|
XPathRepository<XPathElement> |
XPathFactory.compile(String xpathString)
Compiles an XPath expression in String format to IceSoap java object (
XPathElement ) format. |
Set<XPathElement> |
XPathRepository.keySet()
Gets all the XPathElements with values stores against them in the
repository.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
XPathRepository.contains(XPathElement key)
Returns true of an element exists within the repo that matches the
supplied key.
|
T |
XPathRepository.get(XPathElement key)
Gets the first object stored against the supplied XPathElement.
|
XPathRepository.XPathRecord<T> |
XPathRepository.getFullRecord(XPathElement key)
Gets a record containing both the object stored against the supplied
XPathElement and the XPathElement that it was stored
against (which is usually simpler than the one used for the lookup. |
void |
XPathRepository.put(XPathElement key,
T value)
Stores an object in the repository against the specified
XPathElement . |
T |
XPathRepository.remove(XPathElement key)
Removes the record with the supplied key from the repository.
|
| Constructor and Description |
|---|
XPathRepository.XPathRecord(XPathElement key,
E value)
Instantiates a new
XPathRepository.XPathRecord . |
XPathRepository(XPathElement key,
T value)
Instantiates a new
XPathRepository , adding the provided key and
value. |
| Modifier and Type | Method and Description |
|---|---|
XPathElement |
XPathElement.clone()
Performs a deep-copy of this
XPathElement instance - this
includes deep copies of the entire previous element chain. |
XPathElement |
XPathElement.getFirstElement()
Gets the first element of the XPath associated with this XPath.
|
XPathElement |
XPathElement.getPreviousElement()
Gets the element previous to this one in the XPath expression.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
XPathElement.matches(XPathElement otherElement)
Determines whether the passed XPathElement matches all the information
specified by this one.
|
void |
XPathElement.setPreviousElement(XPathElement previousElement)
Sets the previous element to this one in the XPath expression.
|
| Modifier and Type | Class and Description |
|---|---|
class |
AttributeXPathElement
Wrapper for XPathElement to represents XPath elements that describe an
attribute, e.g.
|
class |
BaseXPathElement
Represents base logic that applies to all XPathElement implementations unless
overridden.
|
class |
DoubleSlashXPathElement
Represents XPath elements that start with a double-slash ("//").
|
class |
RelativeXPathElement
Represents a relative XPath element - i.e.
|
class |
SingleSlashXPathElement
Represents an XPath element that starts with a single slash ("/").
|
| Modifier and Type | Method and Description |
|---|---|
XPathElement |
BaseXPathElement.getFirstElement()
Gets the first element of the XPath associated with this XPath.
|
XPathElement |
AttributeXPathElement.getFirstElement()
Gets the first element of the XPath associated with this XPath.
|
XPathElement |
BaseXPathElement.getPreviousElement()
Gets the element previous to this one in the XPath expression.
|
XPathElement |
AttributeXPathElement.getPreviousElement()
Gets the element previous to this one in the XPath expression.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
SingleSlashXPathElement.matches(XPathElement otherElement)
Determines whether the passed element has the same name and the correct
value for all specified predicates of this element.
|
boolean |
RelativeXPathElement.matches(XPathElement otherElement)
Determines whether the passed element has the same name and the correct
value for all specified predicates of this element.
|
boolean |
DoubleSlashXPathElement.matches(XPathElement otherElement)
Determines whether the passed element has the same name and the correct
value for all specified predicates of this element.
|
boolean |
BaseXPathElement.matches(XPathElement otherElement)
Determines whether the passed element has the same name and the correct
value for all specified predicates of this element.
|
boolean |
AttributeXPathElement.matches(XPathElement otherElement)
Determines whether the passed XPathElement matches all the information
specified by this one.
|
void |
RelativeXPathElement.setPreviousElement(XPathElement element)
Sets the previous element to this one in the XPath expression.
|
void |
BaseXPathElement.setPreviousElement(XPathElement element)
Sets the previous element to this one in the XPath expression.
|
void |
AttributeXPathElement.setPreviousElement(XPathElement previousElement)
Sets the previous element to this one in the XPath expression.
|
| Constructor and Description |
|---|
AttributeXPathElement(XPathElement wrappedElement)
Instantiates a new
AttributeXPathElement |
BaseXPathElement(String name,
XPathElement previousElement)
Instantiates a new BaseXPathElement.
|
DoubleSlashXPathElement(String name,
XPathElement previousElement)
Instantiates a new
DoubleSlashXPathElement |
RelativeXPathElement(String name,
XPathElement previousElement)
Instantiates a new
RelativeXPathElement . |
SingleSlashXPathElement(String name,
XPathElement previousElement)
Instantiates a new
SingleSlashXPathElement . |
Copyright © 2016. All rights reserved.


Time Celebrates 100 Rising Stars
"Riverdale" actress Lili Reinhart, "Fantastic Beasts" actor Ezra Miller, Olympic gymnast Ally Raisman were among the eclectic mix of guests to make an appearance at the inaugural Time 100 Next event.
by Kathryn HopkinsTime looked to musicians Camila Cabello and Maggie Rogers to help with its street cred Thursday evening.
In a bid to build off the success of its 15-year-old Time 100 list of the most influential people and reach a younger audience, the magazine invited a collection of the next 100 Big Things to a gathering at Pier 17 in the Seaport District, all of whom were serenaded by the two singers. Rogers opened and Cabello closed.
“Riverdale” actress Lili Reinhart, “Fantastic Beasts” actor Ezra Miller and Olympic gymnast Ally Raisman were among the eclectic mix of guests who braved the cold to make an appearance at the inaugural Time 100 Next event, which was both a mini-summit and party.
Some guests clearly forgot about the summit part and got a bit too loud catching up over drinks during an onstage interview with the president of Costa Rica, which led to lots of shushing.
But back to the guest list. Others included sexual assault survivor Chanel Miller, Glossier founder Emily Weiss, “Now They See Us” star Jharrel Jerome, who was accompanied by the Central Park Five member he played and activist Korey Wise.
On the political side were Rep. Lauren Underwood, the aforementioned Costa Rica President Alvarado Quesada, Miami Mayor Francis Suarez and Ugandan musician and opposition leader Bobi Wine.
The event was a celebration of the Time 100 Next list of 100 rising stars that the magazine believes are “shaping the future of business, entertainment, sports, politics, science, health and more,” according to Edward Felsenthal, editor in chief and chief executive officer of Time.
Six of those appeared on the cover today — Akwafina, Cabello, Weiss, Alvarado Quesada, Miller and basketball player Zion Williamson.
“When we first published our Time 100 list of the world’s most influential people 15 years ago, it was dominated by individuals who rose through traditional power structures: heads of state, ceo’s of public companies, actors from big-budget blockbusters, leaders of global foundations. What has been striking about more recent editions is the growing number of individuals who did not need an establishment to command international attention,” added Felsenthal.
Opening the event, Dan Mascai, Time executive editor and editorial director of the Time 100, said: “All of you are here tonight because you are doing extraordinary things. Because you are shaping the future. Because you aren’t afraid to reject conventional wisdom and try something new.”


| fkTransforms reference pages |
t=T2D_TRANSLATE(offset)
t=T2D_TRANSLATE(offset) returns tranaformation matrix representing a translation. Offset can be a scalar or two element vector specifying the translation in x and y dimensions.
t=T2D_TRANSLATION(offset,t) applies translation to exisiting transformation matrix.
| transform_image | Toolbox page | T2D_transform |