N1QL Queries Using the Java SDK with Couchbase Server
You can perform N1QL queries via the Java client.
| See Couchbase Developer documentation for a quick intro to N1QL. |
To issue N1QL queries, you should create a N1qlQuery
object, and pass it to the query(N1qlQuery q)
method in the Bucket
class.
A few variants of such a query exist:
-
Simple queries, which are only strings and do not use placeholders;
-
Parameterized queries, which use numbered or named placeholders.
You can create each via the corresponding factory method on N1qlQuery
, which you can create using a Statement produced by the N1QL DSL or using the statement directly as a String.
The return value from query()
is the object N1qlQueryResult
.
Iterating over the object will yield the rows returned by the server for the given query (as N1qlQueryRow
).
Each row represents a row received for the query.
Additionally, you can get the List<N1qlQueryRow>
from the allRows()
method on the result.
Note that errors returned by the N1QL service during execution are represented as JsonObject
accessible through the errors()
method, rather than exceptions.
Here is the complete list of N1qlQueryResult
methods:
-
parseSuccess
: Returnstrue
if the query could be parsed correctly. This information is available immediately even if the actual list of results takes more time to be computed and streamed to the client. -
finalSuccess
: Returnstrue
if the whole query could be executed successfully, including retrieving all the results and streaming them to the client. -
allRows
: Contains all rows returned by the query; it can be an empty list. -
rows
: Same asallRows
but in an iterator form (theN1qlQueryResult
itself is iterable). -
requestId
: The server-generated unique ID for this query (useful to find associated logs on the N1QL server). -
clientContextId
: User-provided identifier reflected in the server’s response. The identifier can be useful for grouping several queries (for example, in a kind of in-house transaction) and find all associated queries. -
info
: Returns aN1qlMetrics
object, which contains metrics for the query (such as the number of results or processing time). -
errors
: Returns a list ofJsonObject
describing errors or warnings (if any occurred during execution).
Each N1qlQueryRow
exposes the JSON representation of the value()
as a JsonObject
.
It also gives the raw bytes for said value (byteValue()
), in case you need them to apply your deserialization or SELECT RAW
is used which cannot be turned into a JsonObject
.
You can use N1QL placeholders in the query.
Placeholders allow you to specify variable constraints for an otherwise constant query.
A named or positional parameter is a placeholder for a value in the WHERE, LIMIT or OFFSET clause of a query.
To use placeholders, manually construct a N1QLQuery
object with the base query string, and use a JsonObject
of names -> keyword or a JsonArray
of positional arguments for named or positional placeholders, respectively:
import static com.couchbase.client.java.query.Select.select;
import static com.couchbase.client.java.query.dsl.Expression.*;
// ...
Statement statement = select("fname", "lname", "age").from(i("default")).where(x("age").gt(x("$age")));
JsonObject placeholderValues = JsonObject.create().put("age", 22);
q = N1qlQuery.parameterized(statement, placeholderValues);
for (N1qlQueryRow row : bkt.query(q)) {
System.out.println(row);
}
N1QL queries can also be fine tuned by setting options using N1qlParams
object.
These parameters should be added to the query object during creation.
Here is a subset of options that can be tuned:
-
serverSideTimeout
- sets the maximum server side timeout for the query. -
withContextId
- adds client context ID to the request that will be sent back in the response, allowing clients to meaningfully trace requests/responses when many are exchanged. -
consistency
- sets the consistency level for the query. -
maxParallelism
- can override the max parallelism used by the server. -
adhoc
- allows to specify if this query is adhoc or not.
//Using N1qlParams to set adhoc as false for using prepared statements
N1qlParams params = N1qlParams.build().adhoc(false);
N1qlQuery query = N1qlQuery.simple("select count(*) from `mybucket`", params);
For more information on query parameters in N1QL, see 6.0@server:n1ql:n1ql-rest-api/index.adoc.
Building Statements with the DSL
The N1QL domain-specific language (DSL) is a powerful way to guide you in building your statements: you obtain type safety and autocompletion of relevant methods / N1QL clauses.
As of the 2.2.3
version of the SDK, the DSL supports the following features:
-
Data selection with
Select.select(...)
as an entry point (including index hinting). -
All N1QL functions, organized by topic in the helper classes in the
com.couchbase.client.java.query.dsl.functions
package (eg.AggregateFunctions
). -
A mini DSL for building CASE constructs via factory methods on the
Case
class. -
A mini DSL for building collection constructs (ANY, EVERY, ARRAY...) via factory methods on the
Collections
class. -
Index management (index and primary index creation/deletion/deferred building) with
Index
factory methods as an entry point. -
Data modification with
Insert
,Update
,Upsert
andDelete
as entry points.
To construct statements, you can use the Expression
class that comes in with a variety of factory methods to construct both tokens and literals programmatically.
Expressions can be combined and chained with operators (like gte
for "greater than or equal to" comparison).
Use x
to construct a token, s
to construct a string literal, i
to construct a token escaped with backticks (for example, the bucket name beer-sample
must be escaped because it contains a dash).
If you find out that the DSL doesn’t support a particular statement, clause or keyword, you can always revert to providing your statement in plain String form. Using the String form ensures that even if the DSL lags behind the evolutions of the language, users will always have a mean of using new language features.
Querying Asynchronously
To perform a query asynchronously, use the AsyncBucket
interface that you obtain by calling bucket.async()
.
The API is pretty similar except everything is returned as an Observable
.
Some of the components of the query result (an AsyncQueryResult
) can also be delayed and so returned as Observables.
Only requestId
, clientContextId
and parseSuccess
return immediately.
The following Java 8 code prints the found documents or errors as they come:
bucket.async()
.query(select("*").from(i("beer-sample")).limit(10))
.flatMap(result ->
result.errors()
.flatMap(e -> Observable.<AsyncN1qlQueryRow>error(new CouchbaseException("N1QL Error/Warning: " + e)))
.switchIfEmpty(result.rows())
)
.map(AsyncN1qlQueryRow::value)
.subscribe(
rowContent -> System.out.println(rowContent),
runtimeError -> runtimeError.printStackTrace()
);
First, you can see that asynchronous mode was used.
Second, line issues a Statement
using the DSL (notice how "beer-sample" is escaped).
When receiving a result, first check if there are errors.
If there are any, the first one is converted to a CouchbaseException
that will be propagated in the Observable
.
If no errors are found (errors()
is empty), switch to inspecting the rows, then map each received row to its JSON value.
Eventually, trigger the whole process by subscribing to the Observable
you have built.
When a row JSON is received, print it; when an error is propagated, print the stack trace.
Note: All this is done asynchronously so it’s not suitable for a simple test (where the main thread would potentially exit before any result could have been displayed).
Long running Streaming Query
For a long-running N1QL query, you need a way of streaming the rows and correctly handling errors. Use this helper function:
public static Observable<AsyncN1qlQueryRow> query(final Bucket bucket, final N1qlQuery query) {
return bucket.async()
.query(query).flatMap(new Func1<AsyncN1qlQueryResult, Observable<AsyncN1qlQueryRow>>() {
@Override
public Observable<AsyncN1qlQueryRow> call(AsyncN1qlQueryResult result) {
return Observable
.merge(result.rows(), result.errors())
.map(new Func1<Object, AsyncN1qlQueryRow>() {
@Override
public AsyncN1qlQueryRow call(Object o) {
if (o instanceof AsyncN1qlQueryRow) {
return (AsyncN1qlQueryRow) o;
} else {
// The actual exception type and format could be improved further
throw new CouchbaseException(o.toString());
}
}
});
}
});
}
To iterate over the rows, with blocking, call the helper function like this:
Observable<AsyncN1qlQueryRow> rows = query(bucket, N1qlQuery.simple("select count(*) as cnt from `travel-sample`"));
for (AsyncN1qlQueryRow row : rows.toBlocking().toIterable()) {
System.err.println(row);
}
In this example, this will print {"cnt":31591}
to the console.
Conditionals, Case Expressions Mini DSL
The com.couchbase.client.java.query.dsl.functions.Case
class contains a mini-DSL to deal with Conditional operators in N1QL of the CASE
family.
The Simple CASE
expression is defined as:
CASE expression ( WHEN expression THEN expression)
[ ( WHEN expression THEN expression) ]*
[ ELSE expression ] END
The Searched CASE
expression is defined as:
CASE ( WHEN condition THEN expression)
[( WHEN condition THEN expression ) ]*
[ ELSE expression ] END
The corresponding mini-DSL are Case.caseSimple
and Case.caseSearch
.
Simple Case will compare the initial expression with each WHEN
clause for equality, returning the corresponding THEN
expression if a match is found.
Search Case allows for a different condition for each WHEN
clause.
Let’s see two examples. The first one could be used to map match results to a score:
CASE hist.result WHEN "won" THEN 1 ELSE 0 END
//import static com.couchbase.client.java.query.dsl.Expression.*;
//import static com.couchbase.client.java.query.dsl.functions.Case.*;
caseSimple(x("hist.result"))
.when(s("won")).then(x(1))
.elseReturn(x(0))
The second example implements more complex scoring rule using a Search Case (first match of the day counts as 5 points if won):
CASE WHEN hist.result = "won" AND hist.matchNumber = 1 THEN 5
WHEN hist.result = "won" THEN 1
WHEN hist.result = "lost" THEN 0
END
//import static com.couchbase.client.java.query.dsl.Expression.*;
//import static com.couchbase.client.java.query.dsl.functions.Case.*;
caseSearch()
.when(x("hist.result").eq(s("won")).and(x("hist.matchNumber").eq(1))).then(x(5))
.when(x("hist.result").eq(s("won"))).then(x(1))
.when(x("hist.result").eq(s("lost"))).then(x(0))
.end(); //no ELSE clause means other values will return NULL, have to explicitly close the CASE
Collection Operators Mini DSL
The com.couchbase.client.java.query.dsl.functions.Collections
class contains a mini-DSL to deal with Collections operators in N1QL, such as ANY
, EVERY
, ARRAY
and FIRST
.
For example, the ARRAY
construct is defined as:
ARRAY expression FOR variable ( IN | WITHIN ) expression
[ , variable ( IN | WITHIN ) expression ]* [ ( WHEN condition) ] END
The corresponding mini-DSL is Collections.arrayIn
(or Collections.arrayWithin
if you want to start with a WITHIN
clause).
Let’s see two examples from the following statement, which extracts children and also lists the ones that are "teenagers":
SELECT tutorial.fname || ' ' || tutorial.lname AS adult,
ARRAY child FOR child IN tutorial.children END AS children,
ARRAY child.fname FOR child IN tutorial.children WHEN child.age >= 12 END AS teenagers
FROM tutorial WHERE tutorial.children IS NOT NULL;
Here is how to write the second and third lines using the DSL:
//import static com.couchbase.client.java.query.dsl.Expression.*;
//import static com.couchbase.client.java.query.dsl.functions.Collections.*;
//ARRAY child FOR child IN tutorial.children END AS children
arrayIn(x("child"), "child", path("tutorial", "children")).end().as("children");
//ARRAY child.fname FOR child IN tutorial.children WHEN child.age >= 12 END AS teenagers
arrayIn(path("child", "fname"), "child", path("tutorial", "children")).when(path("child", "age").gte(12)).as("teenagers"));
Similarly, ANY
allows to test for a condition that applies to at least one member of a nested array (you can also match on EVERY
member of the array).
ANY
is defined as:
ANY variable ( IN | WITHIN ) expression
[ , variable ( IN | WITHIN ) expression ]*
SATISFIES condition END
In the previous example, you would see an entry for a parent that doesn’t have "teenagers" (its "teenagers" field would be empty), because the statement didn’t specify that the children should contain a "teenager".
You can fix that with ANY
, by rewriting the WHERE
clause:
#...FROM tutorial
#replace "WHERE tutorial.children IS NOT NULL" with:
WHERE ANY child IN tutorial.children SATISFIES child.age >= 12;
//import static com.couchbase.client.java.query.dsl.Expression.*;
//import static com.couchbase.client.java.query.dsl.functions.Collections.*;
anyIn("child", x("tutorial.children")).satisfies(x("child.age").gte(12))


|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object gov.lbl.glamm.client.model.Reaction
public class Reaction
Model class for reactions.
| Nested Class Summary | |
|---|---|
static class |
Reaction.Direction
Enum specifying reaction direction. |
static class |
Reaction.Participant
Internal class for reaction participants. |
| Field Summary | |
|---|---|
static com.google.gwt.view.client.ProvidesKey<Reaction> |
KEY_PROVIDER
Key provider for Reactions. |
static Type |
TYPE
|
| Constructor Summary | |
|---|---|
Reaction()
Constructor |
| Method Summary | |
|---|---|
void |
addEcNum(java.lang.String ecNum)
Adds an EC (Enzyme Commission) number to this reaction. |
void |
addGene(Gene gene)
Adds a gene to this reaction. |
void |
addProduct(Reaction.Participant rp)
Adds a product to this reaction - products are those reaction participants that appear on the right side of the reaction equation as stored in the GLAMM database. |
void |
addSubstrate(Reaction.Participant rp)
Adds a substrate to this reaction - substrates are those reaction participants that appear on the left side of the reaction equation as stored in the GLAMM database. |
void |
addTransgenicCandidate(java.lang.String ecNum,
Organism organism)
Adds a candidate organism for a given EC number to this non-native reaction. |
boolean |
equals(java.lang.Object obj)
|
java.lang.String |
getDefinition()
Gets the human-readable definition of the reaction. |
Reaction.Direction |
getDirection()
Gets the direction of the reaction. |
java.util.Set<java.lang.String> |
getEcNums()
Gets the set of EC (enzyme commission) numbers for this reaction. |
java.util.Set<java.lang.String> |
getEcNumsForTransgenicCandidate(Organism organism)
Gets the set of EC (enzyme commission) numbers for a transgenic candidate organism for this non-native reaction. |
java.util.Set<Gene> |
getGenes()
Gets the set of genes associated with this reaction. |
java.lang.String |
getGuid()
Gets the GLAMM GUID associated with this reaction - soon to be deprecated. |
MeasurementSet |
getMeasurementSet()
Gets the set of measurements associated with this object. |
java.lang.String |
getNoOptionsString()
Gets the string to be displayed when no options are available. |
java.util.List<java.lang.String> |
getOptions()
Gets the list of selectable options. |
java.util.List<java.lang.String> |
getOptionsPreamble()
Gets the list of options displayed first in the selection cell. |
java.util.Set<Reaction.Participant> |
getProducts()
Gets the set of products. |
ReactionColor |
getReactionColor()
Gets the ReactionColor enum associated with this non-native reaction (used in Route steps.) |
Organism |
getSelectedTransgenicCandidate()
Gets the selected transgenic candidate for this non-native reaction. |
java.util.Set<Reaction.Participant> |
getSubstrates()
Gets the set of substrates. |
java.util.List<Organism> |
getTransgenicCandidates()
Gets ths list of transgenic candidate organisms for this non-native reaction. |
Type |
getType()
Gets the type. |
XrefSet |
getXrefSet()
Gets the XrefSet associated with this object. |
int |
hashCode()
|
boolean |
hasOptions()
Indicates whether or not options are available. |
boolean |
isNative()
Indicates whether or not the reaction is native. |
void |
setColor(ReactionColor color)
Sets the reaction color. |
void |
setDefinition(java.lang.String definition)
Sets the reaction definition. |
void |
setDirection(Reaction.Direction direction)
Sets the reaction direction. |
void |
setGuid(java.lang.String guid)
The reaction GLAMM GUID. |
void |
setNative(boolean isNative)
Sets the flag indicating whether or not the reaction is native. |
void |
setSelectedTransgenicCandidate(java.lang.String name)
Sets the selected transgenic candidate. |
void |
sortTransgenicCandidates()
Sorts the list of transgenic candidate organisms alphabetically. |
| Methods inherited from class java.lang.Object |
|---|
getClass, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
public static final transient Type TYPE
public static final transient com.google.gwt.view.client.ProvidesKey<Reaction> KEY_PROVIDER
| Constructor Detail |
|---|
public Reaction()
| Method Detail |
|---|
public void addEcNum(java.lang.String ecNum)
ecNum
- The EC number.public void addGene(Gene gene)
gene
- The gene.public void addProduct(Reaction.Participant rp)
rp
- The product.public void addSubstrate(Reaction.Participant rp)
rp
- The substrate.public void addTransgenicCandidate(java.lang.String ecNum, Organism organism)
ecNum
- The EC numberorganism
- The organism.public boolean equals(java.lang.Object obj)
equals
in class java.lang.Object
public java.lang.String getDefinition()
public final Reaction.Direction getDirection()
public java.util.Set<java.lang.String> getEcNums()
public java.util.Set<java.lang.String> getEcNumsForTransgenicCandidate(Organism organism)
organism
-
public java.util.Set<Gene> getGenes()
public java.lang.String getGuid()
public java.lang.String getNoOptionsString()
RowDependentSelectionCell.HasOptions
getNoOptionsString
in interface RowDependentSelectionCell.HasOptions
public java.util.List<java.lang.String> getOptions()
RowDependentSelectionCell.HasOptions
getOptions
in interface RowDependentSelectionCell.HasOptions
public java.util.List<java.lang.String> getOptionsPreamble()
RowDependentSelectionCell.HasOptions
getOptionsPreamble
in interface RowDependentSelectionCell.HasOptions
public java.util.Set<Reaction.Participant> getProducts()
public java.util.Set<Reaction.Participant> getSubstrates()
public ReactionColor getReactionColor()
public Organism getSelectedTransgenicCandidate()
public java.util.List<Organism> getTransgenicCandidates()
public int hashCode()
hashCode
in class java.lang.Object
public boolean hasOptions()
RowDependentSelectionCell.HasOptions
hasOptions
in interface RowDependentSelectionCell.HasOptions
public boolean isNative()
public void setColor(ReactionColor color)
color
- The color.public void setDefinition(java.lang.String definition)
definition
- The definition.public void setDirection(Reaction.Direction direction)
direction
- The direction.public void setGuid(java.lang.String guid)
guid
- The guid.public void setNative(boolean isNative)
isNative
- The flag.public void setSelectedTransgenicCandidate(java.lang.String name)
name
- The name of the transgenic candidate organism.public void sortTransgenicCandidates()
public Type getType()
HasType
getType
in interface HasType
public MeasurementSet getMeasurementSet()
HasMeasurements
getMeasurementSet
in interface HasMeasurements
public XrefSet getXrefSet()
HasXrefs
getXrefSet
in interface HasXrefs
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


@(allProjects: Seq[models.Project], user: models.User)(body: => Html)
Zentasks
@import routes.javascript._
@helper.javascriptRouter("jsRoutes")(
Projects.add,
Projects.get,
Projects.delete,
Projects.rename,
Projects.addGroup,
Projects.deleteGroup,
Projects.renameGroup,
Projects.addUser,
Projects.removeUser,
Tasks.addFolder,
Tasks.renameFolder,
Tasks.deleteFolder,
Tasks.index,
Tasks.add,
Tasks.update,
Tasks.delete
)


{% extends "index.html" %} {% block content %} {#-----------------------------------------------------------------------#}
You can use logical keywords to perform search, such as: AND, OR and NOT. Exactly uppercase. Search is not working for spelling mistakes. Your request must match tag exactly. Anything, except keywords, is converted to lowercase during processing.
Meanings are:
Query will be split into series of pairs keyword+text. If your request does not start from keyword, system will automatically add AND at the start. So "cats AND dogs NOT frogs" will be turned into "AND cats AND dogs NOT frogs". As a result, human readable form of this request is: "show me all records, that specifically have tag 'dogs' and optionally have tag 'cats', but definitely do not have tag 'frogs'".
Do not think of the query as of logical rule. Each keyword is treated separately. You cannot use queries like "cats AND NOT dogs".
Themes are constructed from folders in base folder. Each "theme" is representing some, well, theme and makes it possible to distinguish between them. Once you got inside theme, system will try to keep you inside. You can change themes on the Tags tab. You also can use keywords to alter search results without actually changing your current theme.
Meanings are:
Note that themes are separate from tags. Even if they have the same name, search will be performed separately. You also cas use these keywords multiple times.
Currently you need to specify directory name, not actually theme name.
You can use special keywords to perform search. Exactly uppercase.
For images:
For video/audion or animated images:
For specific media type:
Other:
For example: bgc AND SHORT AND DESC
Logical keywords do not matter here, AND will always be used.


{% extends 'members_template.html' %} {% block members_content %}
Are you sure you want to archive this member?
This will expunge their membership record of any personal records, such as date of birth, address &c. It will not remove club details, such as their traning record, BSAC informaton or expiry dates.


[§431:11-104.6] Inapplicable provisions. Sections 431:11-110(b), 431:11-110(c), and 431:11-112 do not apply to acquisitions to which sections 431:11-104.1 through 431:11-104.5 apply. [L 1992, c 176, pt of §3]


Donna Seay
2 minutes agoA wonderful serenity has taken possession of my entire soul, like these sweet mornings of spring.
Samantha Francis
3 hours agoMy entire soul, like these sweet mornings of spring.
Robert Walker
5 hours agoI should be incapable of drawing a single stroke at the present moment...
Larry Smith
Yesterday, 8:34pmWhen, while the lovely valley teems with vapour around me, and the meridian sun strikes...
Donna Seay
Jan 23, 2:32amA wonderful serenity has taken possession of my entire soul, like these sweet mornings of spring.
Suzzeth Bungaos tagged you and 18 others in a post.
October 03, 2017 8:45amMellisa Brown appreciated your work The Social Network
October 02, 2017 12:44am20+ new items added are for sale in your Sale Group
October 01, 2017 10:20pmJulius Erving wants to connect with you on your conversation with Ronnie Mara
October 01, 2017 6:08pmSuzzeth Bungaos tagged you and 12 others in a post.
September 27, 2017 6:45am10+ new items added are for sale in your Sale Group
September 28, 2017 11:30pmMellisa Brown appreciated your work The Great Pyramid
September 26, 2017 11:01amJulius Erving wants to connect with you on your conversation with Ronnie Mara
September 23, 2017 9:19pmA card is a flexible and extensible content container that includes options for headers and footers, etc.
An example some text within a card body.
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Source Code

...

An example of using card title. In the same way, links are added and placed next to each other by adding link tag.
This is the card subtitle
Some quick example text to build on the card title and make up the bulk of the card's content.
Card link Another linkThis is the card subtitle
Some quick example text to build on the card title and make up the bulk of the card's content.
Card link Another linkThis is the card subtitle
Some quick example text to build on the card title and make up the bulk of the card's content.
Card link Another linkSource Code

The Card Title

This is the card subtitle

...

Card link
Another link

Places an image to the top of the card.
Places an image to the bottom of the card.
Turn an image into a card background and overlay your card’s text.
Source Code

The Green Leaves

...

Read more

Add an optional header within a card.
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Source Code

Description

...

Add an optional footer within a card.
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Source Code

...

...

Add a navigation in header of a card.
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Some quick example text to build on the card title and make up the bulk of the card's content. Lorem ipsum dolor sit amet consictetur...
Source Code

Popular

Recent

...

Cards include their own variant classes for quickly changing card background.
Source Code

Some quick example text to build on the card title...

Cards with some options in the right corner of header of card.


From:Stark Cindy To:Geaccone Tracy ; Hayslett Rod Sent:2017-01-11T04:36:39.0000000Z Subject:FW:
Tracy: Since I believe that Rod will also be out at EOTT tomorrow with Stan...and unable to attend the below meeting....would you please attend on EGS' behalf? Please confirm with me.
Thanks,
Cindy
-----Original Message-----
From: Taylor, Liz
Sent: Monday, October 29, 2001 2:14 PM
To: Stark, Cindy
Subject: RE:
Yes
Liz Taylor
Exec. Assistant to Greg Whalley
Office of the Chairman
Enron Corporation
Tel.<PHONE_NUMBER>
Fax<PHONE_NUMBER>
-----Original Message-----
From: Stark, Cindy
Sent: Monday, October 29, 2001 2:13 PM
To: Taylor, Liz
Subject:
Importance: High
Liz: Will Mr. Whalley be having a Budget Meeting tomorrow, Tuesday, October 30, at 11:00AM in 32C2?
Cindy Stark
Executive Assistant to Stan Horton
Tel: 713/853-6197
Fax: 713/345-7047
<EMAIL_ADDRESS>***********
EDRM Enron Email Data Set has been produced in EML, PST and NSF format by ZL Technologies, Inc. This Data Set is licensed under a Creative Commons Attribution 3.0 United States License <http://creativecommons.org/licenses/by/3.0/us/> . To provide attribution, please cite to "ZL Technologies, Inc. (http://www.zlti.com)."
***********
California


Power manager interface. More...
Data Structures | |
| struct | Power_NotifyObj |
| Power notify object structure. More... | |
Macros | |
| #define | Power_TOTAL 1 |
| #define | Power_RESUME 2 |
| #define | Power_NOTIFYDONE 0 |
| #define | Power_NOTIFYERROR 1 |
| #define | Power_SOK 0 |
| #define | Power_EFAIL 1 |
| #define | Power_EINVALIDPOINTER 2 |
| #define | Power_ECHANGE_NOT_ALLOWED 3 |
| #define | Power_EBUSY 4 |
| #define | Power_NOTSUPPORTED 5 |
| #define | Power_ACTIVE 1 |
| #define | Power_ENTERING_SLEEP 2 |
| #define | Power_EXITING_SLEEP 3 |
| #define | Power_ENTERING_SHUTDOWN 4 |
| #define | Power_CHANGING_PERF_LEVEL 5 |
Typedefs | |
| typedef void(* | Power_PolicyInitFxn) (void) |
| Power policy initialization function pointer. | |
| typedef void(* | Power_PolicyFxn) (void) |
| Power policy function pointer. | |
| typedef int(* | Power_NotifyFxn) (unsigned int eventType, uintptr_t eventArg, uintptr_t clientArg) |
| Power notify function pointer. | |
| typedef struct Power_NotifyObj | Power_NotifyObj |
| Power notify object structure. More... | |
Functions | |
| void | Power_enablePolicy (void) |
| Enable the configured power policy to run when the CPU is idle. More... | |
| unsigned int | Power_getConstraintMask (void) |
| Get the constraints that have been declared with Power. More... | |
| unsigned int | Power_getDependencyCount (unsigned int resourceId) |
| Get the current dependency count for a resource. More... | |
| unsigned int | Power_getPerformanceLevel (void) |
| Get the current performance level. More... | |
| unsigned int | Power_getTransitionLatency (unsigned int sleepState, unsigned int type) |
| Get the hardware transition latency for a sleep state. More... | |
| unsigned int | Power_getTransitionState (void) |
| Get the current transition state of the Power manager. More... | |
| void | Power_idleFunc (void) |
| Power function to be added to the application idle loop. More... | |
| unsigned int | Power_init (void) |
| Power initialization function. More... | |
| unsigned int | Power_registerNotify (Power_NotifyObj *pNotifyObj, unsigned int eventTypes, Power_NotifyFxn notifyFxn, uintptr_t clientArg) |
| Register a function to be called upon a specific power event. More... | |
| unsigned int | Power_releaseConstraint (unsigned int constraintId) |
| Release a previously declared constraint. More... | |
| uint32_t | Power_releaseDependency (unsigned int resourceId) |
| Release a previously declared dependency. More... | |
| unsigned int | Power_setConstraint (unsigned int constraintId) |
| Declare an operational constraint. More... | |
| uint32_t | Power_setDependency (unsigned int resourceId) |
| Declare a dependency upon a resource. More... | |
| unsigned int | Power_setPerformanceLevel (unsigned int level) |
| Set the MCU performance level. More... | |
| unsigned int | Power_shutdown (unsigned int shutdownState, unsigned int shutdownTime) |
| Put the device into a shutdown state. More... | |
| unsigned int | Power_sleep (unsigned int sleepState) |
| Transition the device into a sleep state. More... | |
| void | Power_unregisterNotify (Power_NotifyObj *pNotifyObj) |
| Unregister previously registered notifications. More... | |
Power manager interface.
============================================================================
The Power header file should be included in an application as follows:
The Power manager facilitates the transition of the CPU from active state to one of the sleep states and vice versa. It provides drivers the ability to set and release dependencies on hardware resources and keeps a reference count on each resource to know when to enable or disable the peripheral clock to the resource. It provides drivers the ability to register a callback function upon a specific power event. In addition, drivers and apps can set or release constraints to prevent the CPU from transitioning into a particular sleep state.
| #define Power_ACTIVE 1 |
normal active state
| #define Power_CHANGING_PERF_LEVEL 5 |
moving to new performance level
| #define Power_EBUSY 4 |
busy with another transition
| #define Power_ECHANGE_NOT_ALLOWED 3 |
change is not allowed
| #define Power_EFAIL 1 |
general failure
| #define Power_EINVALIDPOINTER 2 |
invalid pointer
| #define Power_ENTERING_SHUTDOWN 4 |
entering a shutdown state
| #define Power_ENTERING_SLEEP 2 |
entering a sleep state
| #define Power_EXITING_SLEEP 3 |
exiting a sleep state
| #define Power_NOTIFYDONE 0 |
OK, notify completed
| #define Power_NOTIFYERROR 1 |
an error occurred during notify
| #define Power_NOTSUPPORTED 5 |
API not supported for device
| #define Power_RESUME 2 |
resume latency
| #define Power_SOK 0 |
OK, operation succeeded
| #define Power_TOTAL 1 |
total latency
| typedef struct Power_NotifyObj Power_NotifyObj |
Power notify object structure.
This struct specification is for internal use. Notification clients must pre-allocate a notify object when registering for a notification; Power_registerNotify() will take care initializing the internal elements appropriately.
| void Power_enablePolicy | ( | void | ) |
Enable the configured power policy to run when the CPU is idle.
Calling this function sets a flag that will cause the configured power policy function to be invoked on each pass through the Idle loop. This runtime function call will essentially override a 'false' setting of the "enablePolicy" setting in the Power manager configuration object.
For some processor families automatic power transitions are at odds with the debugger, and having the policy running by default makes application debug difficult. This convenience function allows an application to be initially configured, built, and debugged, without automatic power transitions during idle time. When the application is found to be working, this function can be called (typically in main()) to enable the policy to run, without having to change the application configuration. Note that there is no comparable 'disable' policy function; once the policy has been enabled to run, it will always run until the applicaiton is rebooted.
| unsigned int Power_getConstraintMask | ( | void | ) |
Get the constraints that have been declared with Power.
This function returns a bitmask indicating the constraints that are currently declared to the Power manager (via previous calls to Power_setConstraint()). For each constraint that is currently declared, the corresponding bit in the bitmask will be set. For example, if two clients have independently declared two different constraints, the returned bitmask will have two bits set.
Constraint identifiers are device specific, and defined in the device-specific Power include file. For example, the constraints for PRCM are defined in PowerPRCM.h. The corresponding bit in the bitmask returned by this function can be derived by a left-shift using the constraint identifier. For example, for PRCM, for the corresponding bit for the PowerPRCM_DISALLOW_SLEEP constraint, the bit position is determined by the operation: (1 << PowerPRCM_DISALLOW_SLEEP)
| unsigned int Power_getDependencyCount | ( | unsigned int | resourceId | ) |
Get the current dependency count for a resource.
This function returns the number of dependencies that are currently declared upon a resource.
Resource identifiers are device specific, and defined in the device-specific Power include file. For example, the resources for PRCM are defined in PowerPRCM.h.
| resourceId | resource id |
| unsigned int Power_getPerformanceLevel | ( | void | ) |
Get the current performance level.
This function returns the current device performance level in effect.
If performance scaling is not supported for the device, this function will always indicate a performance level of zero.
| unsigned int Power_getTransitionLatency | ( | unsigned int | sleepState, |
| unsigned int | type | ||
| ) |
Get the hardware transition latency for a sleep state.
This function reports the minimal hardware transition latency for a specific sleep state. The reported latency is that for a direct transition, and does not include any additional latency that might occur due to software-based notifications.
Sleep states are device specific, and defined in the device-specific Power include file. For example, the sleep states for PRCM are defined in PowerPRCM.h.
This function is typically called by the power policy function. The latency is reported in units of microseconds.
| sleepState | the sleep state |
| type | the latency type (Power_TOTAL or Power_RESUME) |
| unsigned int Power_getTransitionState | ( | void | ) |
Get the current transition state of the Power manager.
This function returns the current transition state for the Power manager. For example, when no transitions are in progress, a status of Power_ACTIVE is returned. Power_ENTERING_SLEEP is returned during the transition to sleep, before sleep has occurred. And Power_EXITING_SLEEP will be returned after wakeup, as the device is being transtioned back to Power_ACTIVE.
| void Power_idleFunc | ( | void | ) |
Power function to be added to the application idle loop.
This function should be added to the application idle loop. (The method to do this depends upon the operating system being used.) This function will invoke the configured power policy function when appropriate. The specific policy function to be invoked is configured as the 'policyFxn' in the application-defined Power configuration object.
| unsigned int Power_init | ( | void | ) |
Power initialization function.
This function initializes Power manager internal state. It must be called prior to any other Power API. This function is normally called as part of TI-RTOS board initialization, for example, from within the the <board name>_initGeneral() function.
| unsigned int Power_registerNotify | ( | Power_NotifyObj * | pNotifyObj, |
| unsigned int | eventTypes, | ||
| Power_NotifyFxn | notifyFxn, | ||
| uintptr_t | clientArg | ||
| ) |
Register a function to be called upon a specific power event.
This function registers a function to be called when a Power event occurs. Registrations and the corresponding notifications are processed in first-in-first-out (FIFO) order. The function registered must behave as described later, below.
The pNotifyObj parameter is a pointer to a pre-allocated, opaque object that will be used by Power to support the notification. This object could be dynamically allocated, or declared as a global object. This function will properly initialized the object's fields as appropriate; the caller just needs to provide a pointer to this pre-existing object.
The eventTypes parameter identifies the type of power event(s) for which the notify function being registered is to be called. (Event identifiers are device specific, and defined in the device-specific Power include file. For example, the events for PRCM are defined in PowerPRCM.h.) The eventTypes parameter for this function call is treated as a bitmask, so multiple event types can be registered at once, using a common callback function. For example, to call the specified notifyFxn when both the entering deepsleep and awake from deepsleep events occur, eventTypes should be specified as: PowerPRCM_ENTERING_DEEPSLEEP | PowerPRCM_AWAKE_DEEPSLEEP
The notifyFxn parameter specifies a callback function to be called when the specified Power event occurs. The notifyFxn must implement the following signature: status = notifyFxn(eventType, eventArg, clientArg);
Where: eventType identifies the event being signalled, eventArg is an optional event-specific argument, and clientArg is an abitrary argument specified by the client at registration. Note that multipe types of events can be specified when registering the notification callback function, but when the callback function is actually called by Power, only a single eventType will be specified for the callback (i.e., the current event). The status returned by the client notification function must be one of the following constants: Power_NOTIFYDONE if the client processed the notification successfully, or Power_NOTIFYERROR if an error occurred during notification.
The clientArg parameter is an arbitrary, client-defined argument to be passed back to the client upon notification. This argument may allow one notify function to be used by multiple instances of a driver (that is, the clientArg can be used to identify the instance of the driver that is being notified).
| pNotifyObj | notification object (preallocated by caller) |
| eventTypes | event type or types |
| notifyFxn | client's callback function |
| clientArg | client-specified argument to pass with notification |
| unsigned int Power_releaseConstraint | ( | unsigned int | constraintId | ) |
Release a previously declared constraint.
This function releases a constraint that was previously declared with Power_setConstraint(). For example, if a device driver is starting an I/O transaction and wants to prohibit activation of a sleep state during the transaction, it uses Power_setConstraint() to declare the constraint, before starting the transaction. When the transaction completes, the driver calls this function to release the constraint, to allow the Power manager to once again allow transitions to sleep.
Constraint identifiers are device specific, and defined in the device-specific Power include file. For example, the constraints for PRCM are defined in PowerPRCM.h.
Only one constraint can be specified with each call to this function; to release multiple constraints this function must be called multiple times.
It is critical that clients call Power_releaseConstraint() when operational constraints no longer exists. Otherwise, Power may be left unnecessarily restricted from activating power savings.
| constraintId | constraint id |
| uint32_t Power_releaseDependency | ( | unsigned int | resourceId | ) |
Release a previously declared dependency.
This function releases a dependency that had been previously declared upon a resource (by a call to Power_setDependency()).
Resource identifiers are device specific, and defined in the device-specific Power include file. For example, the resources for PRCM are defined in PowerPRCM.h.
| resourceId | resource id |
| unsigned int Power_setConstraint | ( | unsigned int | constraintId | ) |
Declare an operational constraint.
Before taking certain actions, the Power manager checks to see if the requested action would conflict with a client-declared constraint. If the action does conflict, Power will not proceed with the request. This is the function that allows clients to declare their constraints with Power.
Constraint identifiers are device specific, and defined in the device-specific Power include file. For example, the constraints for PRCM are defined in PowerPRCM.h.
Only one constraint can be specified with each call to this function; to declare multiple constraints this function must be called multiple times.
| constraintId | constraint id |
| uint32_t Power_setDependency | ( | unsigned int | resourceId | ) |
Declare a dependency upon a resource.
This function declares a dependency upon a resource. For example, if a UART driver needs a specific UART peripheral, it uses this function to declare this to the Power manager. If the resource had been inactive, then Power will activate the peripheral during this function call.
What is needed to make a peripheral resource 'active' will vary by device family. For some devices this may be a simple enable of a clock to the specified peripheral. For others it may also require a power on of a power domain. In either case, the Power manager will take care of these details, and will also implement reference counting for resources and their interdependencies. For example, if multiple UART peripherals reside in a shared serial power domain, the Power manager will power up the serial domain when it is first needed, and then automatically power the domain off later, when all related dependencies for the relevant peripherals are released.
Resource identifiers are device specific, and defined in the device-specific Power include file. For example, the resources for PRCM are defined in PowerPRCM.h.
| resourceId | resource id |
| unsigned int Power_setPerformanceLevel | ( | unsigned int | level | ) |
Set the MCU performance level.
This function manages a transition to a new device performance level. Before the actual transition is initiated, notifications will be sent to any clients who've registered (with Power_registerNotify()) for a 'start change performance level' notification. The event name is device specific, and defined in the device-specific Power include file. For example, for PRCM, the event is "PowerPRCM_START_CHANGE_PERF_LEVEL", which is defined in PowerPRCM.h. Once notifications have been completed, the change to the performance level is initiated. After the level change is completed, there is a comparable event that can be used to signal a client that the change has completed. For example, on PRCM the "PowerPRCM_DONE_CHANGE_PERF_LEVEL" event can be used to signal completion.
This function will not return until the new performance level is in effect. If performance scaling is not supported for the device, or is prohibited by an active constraint, or if the specified level is invalid, then an error status will be returned.
| level | the new performance level |
| unsigned int Power_shutdown | ( | unsigned int | shutdownState, |
| unsigned int | shutdownTime | ||
| ) |
Put the device into a shutdown state.
This function will transition the device into a shutdown state. Before the actual transition is initiated, notifications will be sent to any clients who've registered (with Power_registerNotify()) for an 'entering shutdown' event. The event name is device specific, and defined in the device-specific Power include file. For example, for PRCM, the event is "PowerPRCM_ENTERING_SHUTDOWN", which is defined in PowerPRCM.h. Once notifications have been completed, the device shutdown will commmence.
If the device is successfully transitioned to shutdown, this function call will never return. Upon wakeup, the device and application will be rebooted (through a device reset). If the transition is not successful, one of the error codes listed below will be returned.
On some devices a timed wakeup from shutdown can be specified, using the shutdownTime parameter. This enables an autonomous application reboot at a future time. For example, an application can go to shutdown, and then automatically reboot at a future time to do some work. And once that work is done, the application can shutdown again, for another timed interval. The time interval is specified via the shutdownTime parameter. (On devices that do not support this feature, any value specified for shutdownTime will be ignored.) If the specified shutdownTime is less than the total shutdown latency for the device, then shutdownTime will be ignored. The shutdown latency for the device can be found in the device-specific Power include file. For example, for the PRCM, this latency is defined in PowerPRCM.h, as "PowerPRCM_TOTALTIMESHUTDOWN".)
| shutdownState | the device-specific shutdown state |
| shutdownTime | the amount of time (in milliseconds) to keep the the device in the shutdown state; this parameter is not supported on all device families |
| unsigned int Power_sleep | ( | unsigned int | sleepState | ) |
Transition the device into a sleep state.
This function is called from the power policy when it has made a decision to put the device in a specific sleep state. This function returns to the caller (the policy function) once the device has awoken from sleep.
This function must be called with interrupts disabled, and should not be called directly by the application, or by any drivers. This function does not check declared constraints; the policy function must check constraints before calling this function to initiate sleep.
| sleepState | the sleep state |
| void Power_unregisterNotify | ( | Power_NotifyObj * | pNotifyObj | ) |
Unregister previously registered notifications.
This function unregisters for event notifications that were previously registered with Power_registerNotify(). The caller must specify a pointer to the same notification object used during registration.
| pNotifyObj | notify object |


ZIP Code :
1-2
Low. No Protection Required.
3-5
Moderate. Protection Required.
6-7
High. Protection Essential
8-10
Very High. Avoid All Sun.
11+
Extreme. Take All Precautions Possible.


--- layout: post title: Avon nailwear pro+ Perfectly Flesh tags: - Avon status: publish type: post published: true meta: _edit_last: '2' _aioseop_title: Avon nailwear pro+ Perfectly Flesh review swatches _aioseop_keywords: Avon nailwear pro+ Perfectly Flesh, perfectly flesh _yoast_wpseo_linkdex: '0' _thumbnail_id: '4500' _yoast_wpseo_focuskw: '' _yoast_wpseo_title: '' _yoast_wpseo_metadesc: '' _yoast_wpseo_metakeywords: '' _yoast_wpseo_meta-robots-noindex: '0' _yoast_wpseo_meta-robots-nofollow: '0' _yoast_wpseo_meta-robots-adv: none _yoast_wpseo_sitemap-include: ! '-' _yoast_wpseo_sitemap-prio: ! '-' _yoast_wpseo_canonical: '' _yoast_wpseo_redirect: '' --- I have grown so fond of pastels and bold shades, that it has been ages that I tried something neutral on my nail. But the latest range from avon is so tempting that I had to try all the shades. Avon has come up with some really affordable and great quality nail wear pro+ colors...:high five: Price: Rs. 99 for 8ml (I got 2 for Rs.179) Me not a big fan of perfectly flesh, it makes my hand look dull, but the nail color is good quality, gives a perfect non streaky finish and easily lasts 5-6 days with minimal chipping(Use 3-4 coats) Check other shades here Midnight Plum, Aqua Fantasy & Loving Lavender
If you have not tried this range, I totally suggest these.. great quality and quantity for a fab price :)
So what plans for the weekend ?


 The bots learn your preferences and take care of the legwork. Human experts ensure you get the best possible deal.
Experience the differenceEnter your destination, dates of travel and budget. Keep it simple or customize it to your heart's content.
Our bots work for you; analyzing crowdsourced quotes from hundreds of websites and human travel agents/experts.
The top-ranking choices are automatically booked and emailed to you, along with two other choices.
Your bookings are refundable. Confirm with a tap if you like. Ignore the email if you don't. It's free.
Travel expert? Want to earn money booking and planning trips? Give us a call or send us an email and we will get back to you as soon as possible!
801-747-9713


AT Dalton, near Thirsk, in Yorkshire, is a mill. It has quite recently been rebuilt; but when I was at Dalton, six years ago, the old building stood. In front of the house was a long mound, which went by the name of "the giant's grave," and in the mill was shown a long blade of iron something like a scythe-blade, but not curved, which was said to have been the giant's knife. A curious story was told of this knife. There lived a giant at this mill, and he ground men's bones to make his bread. One day he captured a lad on Pilmoor, and instead of grinding him in the mill he kept him as his servant, and never let him get away. Jack served the giant many years, and never was allowed a holiday. At last he could bear it no longer. Topcliffe fair was coming on, and the lad entreated that he might be allowed to go there to see the lasses and buy some spice. The giant surlily refused leave: Jack resolved to take it.
The day was hot, and after dinner the giant lay down in the mill with his head on a sack and dozed. He had been eating in the mill, and had laid down a great loaf of bone bread by his side, and the knife was in his hand, but his fingers relaxed their hold of it in sleep. Jack seized the moment, drew the knife away, and holding it with both his hands drove the blade into the single eye of the giant, who woke with a howl of agony, and starting up barred the door.
Jack was again in difficulties, but he soon found a way out of them. The giant had a favourite dog, which had also been sleeping when his master was blinded. Jack killed the dog, skinned it, and throwing the hide over his back ran on all-fours barking between the legs of the giant, and so escaped.
1 Henderson, Notes on the Folk-Lore of the Northern Counties of England and the Borders, p. 195.


{% extends "base.html" %}
{% block content %}
SQL error (You have an error in your SQL syntax, but this is just a text; check the manual that corresponds to your MySQL server version for the right syntax to use near 'ORDER BY people.lastname ASC LIMIT 0, 10' at line 6) in ( SELECT answer.aid as aid,answer.pid, answer.title title, answer.tags as tags, answer.content as content, answer.content_type as content_type, people.group_id as group_id ,people.picture as picture,people.firstname as firstname, people.lastname as lastname , people.title as title, people.organization as organization FROM answer, ques_to_ans, people WHERE answer.aid = ques_to_ans.aid AND people.pid = answer.pid AND ques_to_ans.qid = ORDER BY people.lastname ASC LIMIT 0, 10 ) SQL error (You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near 'AND people.group_id = 3' at line 5) in ( SELECT answer.aid as aid,answer.pid, answer.title title, answer.tags as tags, answer.content as content, answer.content_type as content_type, people.group_id as group_id ,people.picture as picture,people.firstname as firstname, people.lastname as lastname , people.title as title, people.organization as organization FROM answer, ques_to_ans, people WHERE answer.aid = ques_to_ans.aid AND people.pid = answer.pid AND ques_to_ans.qid = AND people.group_id = 3 ) SQL error (You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near 'ORDER BY people.lastname ASC LIMIT 0, 10' at line 6) in ( SELECT answer.aid as aid,answer.pid, answer.title title, answer.tags as tags, answer.content as content, answer.content_type as content_type, people.group_id as group_id ,people.picture as picture,people.firstname as firstname, people.lastname as lastname , people.title as title, people.organization as organization FROM answer, ques_to_ans, people WHERE answer.aid = ques_to_ans.aid AND people.pid = answer.pid AND ques_to_ans.qid = ORDER BY people.lastname ASC LIMIT 0, 10 ) SQL error (You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near 'AND people.group_id = 3' at line 5) in ( SELECT answer.aid as aid,answer.pid, answer.title title, answer.tags as tags, answer.content as content, answer.content_type as content_type, people.group_id as group_id ,people.picture as picture,people.firstname as firstname, people.lastname as lastname , people.title as title, people.organization as organization FROM answer, ques_to_ans, people WHERE answer.aid = ques_to_ans.aid AND people.pid = answer.pid AND ques_to_ans.qid = AND people.group_id = 3 )
{% endblock %}


| Properties' Summary |
[ maybedefault ] boolean
Japanese |
If this property is true, the candlesticks are shown as
japanese candlesticks. This implies that the property
ShowFirst is also true.
|
[ maybevoid ] ::com::sun::star::beans::XPropertySet
WhiteDay |
If the candlestick chart shows japanese candlesticks, that is
the property Japanese is true, the
property set given here contains the formatting attributes of
the white boxes, i.e. the boxes shown for rising values.
|
[ maybevoid ] ::com::sun::star::beans::XPropertySet
BlackDay |
If the candlestick chart shows japanese candlesticks, that is
the property Japanese is true, the
property set given here contains the formatting attributes of
the black boxes, i.e. the boxes shown for falling values.
|
[ maybedefault ] boolean
ShowFirst |
If this property is true, the first value (which would be
the opening course in a stock chart) is shown in the chart.
This also makes the role "values-first" mandatory.
|
[ maybedefault ] boolean
ShowHighLow |
If this property is true, the low and high values are shown
in the chart. This also makes the roles "values-min" and
"values-max" mandatory.
|
| Properties' Details |
Japanese
[ maybedefault ] boolean Japanese;
- Description
- If this property is true, the candlesticks are shown as
japanese candlesticks. This implies that the property
ShowFirst is also true.
Japanese candlesticks show the first and last value as
boxes. A rising course (i.e. if the last value is greater
than the first one) is shown by a white box. A falling course
is shown by a black box.
Default is false.
- See also
- WhiteDay, BlackDay
|
|
WhiteDay
[ maybevoid ] ::com::sun::star::beans::XPropertySet WhiteDay;
- Description
- If the candlestick chart shows japanese candlesticks, that is
the property Japanese is true, the
property set given here contains the formatting attributes of
the white boxes, i.e. the boxes shown for rising values.
The ::com::sun::star::beans::XPropertySet
given here must support the services
::com::sun::star::drawing::FillProperties
and
::com::sun::star::drawing::LineProperties.
|
|
BlackDay
[ maybevoid ] ::com::sun::star::beans::XPropertySet BlackDay;
- Description
- If the candlestick chart shows japanese candlesticks, that is
the property Japanese is true, the
property set given here contains the formatting attributes of
the black boxes, i.e. the boxes shown for falling values.
The ::com::sun::star::beans::XPropertySet
given here must support the services
::com::sun::star::drawing::FillProperties
and
::com::sun::star::drawing::LineProperties.
|
|
ShowFirst
[ maybedefault ] boolean ShowFirst;
- Description
- If this property is true, the first value (which would be
the opening course in a stock chart) is shown in the chart.
This also makes the role "values-first" mandatory.
This property is only evaluated for non-japanese
candlestick charts, as japanese candlesticks always require to
show the first value.
Default is false.
|
|
ShowHighLow
[ maybedefault ] boolean ShowHighLow;
- Description
- If this property is true, the low and high values are shown
in the chart. This also makes the roles "values-min" and
"values-max" mandatory.
Default is true.
|
|
Copyright © 2013, The Apache Software Foundation, Licensed under the Apache License, Version 2.0. Apache, the Apache feather logo, Apache OpenOffice and OpenOffice.org are trademarks of The Apache Software Foundation. Other names may be trademarks of their respective owners.


--- layout: narrow title: Memory collection: games screenshot: /images/game-screenshots/memory.png styles: style.css scripts: - //cdnjs.cloudflare.com/ajax/libs/underscore.js/1.6.0/underscore-min.js - script.js ---
Click the cards to turn them over. Try to pair together matching cards.


Login:
Password:
This is a content editable paragraph!
Phone:
Phone Read-Only:
Phone Disabled:
Enabled Input:
Default Number:
Text Max Length (5):
Number Min (7):
Number Max (45):
Text Area:
Text areas will be parsed into the keyboard input field as inputs, type=text.


Simple, traffic-based pricing
Sign-up our 30-day trial. No credit card required.
10K
pageviews
$8.00
/ month
Monthly Billing
Yearly Billing
-25%
discount
Unlimited websites
100% data ownership
Email reports
Start my trial


|
Imperx Tools SDK
<IP_ADDRESS>
|
Defines for TS Coefficients parameters. More...
Macros | |
| #define | TS_RR_COEFF "RR" |
| #define | TS_RG_COEFF "RG" |
| #define | TS_RB_COEFF "RB" |
| #define | TS_GR_COEFF "GR" |
| #define | TS_GG_COEFF "GG" |
| #define | TS_GB_COEFF "GB" |
| #define | TS_BR_COEFF "BR" |
| #define | TS_BG_COEFF "BG" |
| #define | TS_BB_COEFF "BB" |
Defines for TS Coefficients parameters.
| Macro | Parameter Name | Type | Description |
|---|---|---|---|
| TS_RR_COEFF | "RR" | [float: DBL_MIN-DBL_MAX] | Red-red coefficient of color correction matrix |
| TS_RG_COEFF | "RG" | [float: DBL_MIN-DBL_MAX] | Red-green coefficient of color correction matrix |
| TS_RB_COEFF | "RB" | [float: DBL_MIN-DBL_MAX] | Red-blue coefficient of color correction matrix |
| TS_GR_COEFF | "GR" | [float: DBL_MIN-DBL_MAX] | Green-red coefficient of color correction matrix |
| TS_GG_COEFF | "GG" | [float: DBL_MIN-DBL_MAX] | Green-green coefficient of color correction matrix |
| TS_GB_COEFF | "GB" | [float: DBL_MIN-DBL_MAX] | Green-blue coefficient of color correction matrix |
| TS_BR_COEFF | "BR" | [float: DBL_MIN-DBL_MAX] | Blue-red coefficient of color correction matrix |
| TS_BG_COEFF | "BG" | [float: DBL_MIN-DBL_MAX] | Blue-green coefficient of color correction matrix |
| TS_BB_COEFF | "BB" | [float: DBL_MIN-DBL_MAX] | blue-blue coefficient of color correction matrix |
| #define TS_RR_COEFF "RR" |
Red-red coefficient of color correction matrix
Type/Range [float: DBL_MIN-DBL_MAX]
| #define TS_RG_COEFF "RG" |
Red-green coefficient of color correction matrix
Type/Range [float: DBL_MIN-DBL_MAX]
| #define TS_RB_COEFF "RB" |
Red-blue coefficient of color correction matrix
Type/Range [float: DBL_MIN-DBL_MAX]
| #define TS_GR_COEFF "GR" |
Green-red coefficient of color correction matrix
Type/Range [float: DBL_MIN-DBL_MAX]
| #define TS_GG_COEFF "GG" |
Green-green coefficient of color correction matrix
Type/Range [float: DBL_MIN-DBL_MAX]
| #define TS_GB_COEFF "GB" |
Green-blue coefficient of color correction matrix
Type/Range [float: DBL_MIN-DBL_MAX]
| #define TS_BR_COEFF "BR" |
Blue-red coefficient of color correction matrix
Type/Range [float: DBL_MIN-DBL_MAX]
| #define TS_BG_COEFF "BG" |
Blue-green coefficient of color correction matrix
Type/Range [float: DBL_MIN-DBL_MAX]
| #define TS_BB_COEFF "BB" |
Blue-blue coefficient of color correction matrix
Type/Range [float: DBL_MIN-DBL_MAX]


Software development for the web
Repo github Click on the link to get access to the repo on github
Forked repo Click on the link to get access to the forked repo
Repo github Click on the link to get access to the repo on github
Forked repo Click on the link to get access to the forked repo


If you are reading this, it is because your browser does not support the audio element.
Time For Adventure


|
DESERT
3.0
|
#include <mmac.h>
#include <module.h>
#include <packet.h>
Go to the source code of this file.
Classes | |
| struct | hdr_TRIGGER_UFETCH |
| struct | hdr_RTS_UFETCH |
| struct | hdr_CTS_UFETCH |
| struct | hdr_BEACON_UFETCH |
| struct | hdr_PROBE_UFETCH |
| struct | hdr_POLL_UFETCH |
| struct | hdr_CBEACON_UFETCH |
Macros | |
| #define | HDR_TRIGGER_UFETCH(p) |
| #define | HDR_RTS_UFETCH(p) (hdr_RTS_UFETCH::access(p)) |
| #define | HDR_CTS_UFETCH(p) (hdr_CTS_UFETCH::access(p)) |
| #define | HDR_BEACON_UFETCH(p) |
| #define | HDR_PROBE_UFETCH(p) |
| #define | HDR_POLL_UFETCH(p) (hdr_POLL_UFETCH::access(p)) |
| #define | HDR_CBEACON_UFETCH(p) |
Typedefs | |
| typedef struct hdr_TRIGGER_UFETCH | hdr_TRIGGER_UFETCH |
| typedef struct hdr_RTS_UFETCH | hdr_RTS_UFETCH |
| typedef struct hdr_CTS_UFETCH | hdr_CTS_UFETCH |
| typedef struct hdr_BEACON_UFETCH | hdr_BEACON_UFETCH |
| typedef struct hdr_PROBE_UFETCH | hdr_PROBE_UFETCH |
| typedef struct hdr_POLL_UFETCH | hdr_POLL_UFETCH |
| typedef struct hdr_CBEACON_UFETCH | hdr_CBEACON_UFETCH |
Variables | |
| packet_t | PT_BEACON_UFETCH |
| packet_t | PT_POLL_UFETCH |
| packet_t | PT_CBEACON_UFETCH |
| packet_t | PT_RTS_UFETCH |
| packet_t | PT_PROBE_UFETCH |
| packet_t | PT_TRIGGER_UFETCH |
| packet_t | PT_CTS_UFETCH |
| static const int | v_speed_sound |
| static const int | BIT_RATE_SERVICE = 1000 |
| static const int | BIT_RATE_INSTANT = 10000 |
Common structures and variables in the protocol.
Definition in file uwUFetch_cmn_hdr.h.
| #define HDR_BEACON_UFETCH | ( | p | ) |
alias defined to access the BEACON HEADER
Definition at line 56 of file uwUFetch_cmn_hdr.h.
| #define HDR_CBEACON_UFETCH | ( | p | ) |
alias defined to access the CBEACON HEADER
Definition at line 72 of file uwUFetch_cmn_hdr.h.
| #define HDR_CTS_UFETCH | ( | p | ) | (hdr_CTS_UFETCH::access(p)) |
alias defined to access the CTS HEADER
Definition at line 53 of file uwUFetch_cmn_hdr.h.
| #define HDR_POLL_UFETCH | ( | p | ) | (hdr_POLL_UFETCH::access(p)) |
alias defined to access the POLL \ HEADER
Definition at line 66 of file uwUFetch_cmn_hdr.h.
| #define HDR_PROBE_UFETCH | ( | p | ) |
alias defined to access the PROBE HEADER
Definition at line 61 of file uwUFetch_cmn_hdr.h.
| #define HDR_RTS_UFETCH | ( | p | ) | (hdr_RTS_UFETCH::access(p)) |
alias defined to access the RTS HEADER
Definition at line 50 of file uwUFetch_cmn_hdr.h.
| #define HDR_TRIGGER_UFETCH | ( | p | ) |
alias defined to access the TRIGGER HEADER
Definition at line 45 of file uwUFetch_cmn_hdr.h.
| typedef struct hdr_BEACON_UFETCH hdr_BEACON_UFETCH |
Content header of BEACON packet.
| typedef struct hdr_CBEACON_UFETCH hdr_CBEACON_UFETCH |
Content header of CBEACON packet.
| typedef struct hdr_CTS_UFETCH hdr_CTS_UFETCH |
Content header of CTS packet.
| typedef struct hdr_POLL_UFETCH hdr_POLL_UFETCH |
Content header of POLL packet.
| typedef struct hdr_PROBE_UFETCH hdr_PROBE_UFETCH |
Content header of PROBE packet.
| typedef struct hdr_RTS_UFETCH hdr_RTS_UFETCH |
Content header of RTS packet.
| typedef struct hdr_TRIGGER_UFETCH hdr_TRIGGER_UFETCH |
Content header of TRIGGER packet.
|
static |
Definition at line 89 of file uwUFetch_cmn_hdr.h.
|
static |
Definition at line 88 of file uwUFetch_cmn_hdr.h.
| packet_t PT_BEACON_UFETCH |
BEACON packet type.
BEACON packet type.
Definition at line 54 of file data_link/uwUFetch/initlib.cpp.
| packet_t PT_CBEACON_UFETCH |
CBEACON packet type.
CBEACON packet type.
Definition at line 57 of file data_link/uwUFetch/initlib.cpp.
| packet_t PT_CTS_UFETCH |
| packet_t PT_POLL_UFETCH |
| packet_t PT_PROBE_UFETCH |
| packet_t PT_RTS_UFETCH |
| packet_t PT_TRIGGER_UFETCH |
TRIGGER packet type.
TRIGGER packet type.
Definition at line 51 of file data_link/uwUFetch/initlib.cpp.
|
static |
Underwater sound propagation speed.
Definition at line 86 of file uwUFetch_cmn_hdr.h.


Admin Dashboard
Employers
Calendar
Invoice
Search
Settings
John Henderson
Edit Profile
Log Out
Settings
General Settings
Site title
Tagline
Few words that will describe your site.
Site URL
Email address
Here you will receive site notifications.
Members
Anyone can register
Default user role
Subscriber
Author
Editor
Administrator
New users
Will have to activate their account (via email)
Account is automatically activated
Maximum login attempts
Date and Time
Date format
November 04, 2015
11/04/2015
2015/11/04
Custom format:
Read more about
date format
Save Changes
Reset Previous


This analysis is a placeholder with a sample set. If you want to contribute new analyses for the site, contact Disaster Area on Discord.
Level: 55 / 53
- Thunderbolt
- Drill Peck
- Double Team / Thunder Wave
- Rest
This analysis is a placeholder with a sample set. If you want to contribute new analyses for the site, contact Disaster Area on Discord.
Level: 55
- Thunderbolt
- Drill Peck
- Double Team / Thunder Wave
- Agility
This analysis is a placeholder with a sample set. If you want to contribute new analyses for the site, contact Disaster Area on Discord.
Hyper Beam for Electric-type mirrors, Thunder, Fly, Substitute in Poke Cup.
This analysis is a placeholder with a sample set. If you want to contribute new analyses for the site, contact Disaster Area on Discord.
Author: zalarye
Quality checked by: Plague von Karma
Publish Date: 10th August 2020


 Suspendisse varius enim in eros elementum tristique. Duis cursus, mi quis viverra ornare, eros dolor interdum nulla, ut commodo diam libero vitae erat. Aenean faucibus nibh et justo cursus id rutrum lorem imperdiet.
Headcount
Function
0
Total
2
Staffed
0
Open
Function
0
Total
0
Staffed
0
Open
Function
0
Total
0
Staffed
0
Open
Function
0
Total
0
Staffed
0
Open
Function
0
Total
0
Staffed
0
Open
Function
0
Total
0
Staffed
0
Open
Function
0
Total
0
Staffed
0
Open
Function
0
Total
0
Staffed
0
Open
Function
0
Total
0
Staffed
0
Open
Function
0
Total
0
Staffed
0
Open
Budget
Plan Funding
$14,545,678
x.x%
x.x%
x.x%
x.x%
People
$1,800,000
12
Total Staff
- Branding
- Channel Marketing
- Corporate Marketing
- Creative/Content
- Digital Marketing
- Marketing Management
- Marketing Finance
- Marketing Operations
- Project Management
- Insights & Research
Marketing
$8,990,000
15
Total Plays
- Activity 1
- Activity 2
- Activity 3
- Activity 4
- Activity 5
- Activity 6
- Activity 7
Services
$1,290,678
3
Service Partners
- Agency 1
- Agency 2
- Agency 3
Capability
$2,465,000
7
Total Capabilities
- Capability 1
- Capability 2
- Capability 3
- Capability 4
- Capability 5
- Capability 6
- Capability 7
Time
Activities
Create Your Plan
Describe Your Plan
Plan Name
2019 Back-to-School Mobile Plan
Fiscal Year
Select Year
Total Quarters
Select Qs
Status
Select Status
Define Your Commitment & Contribution
Plan Commitment
Enter amount here
Total Value Mix Contribution
Headcount
Select Your Team
Select Your Team
Select Your Team
Select Your Team
Select Your Team
Select Total Headcount
Select Total Headcount
Select Total Headcount
Select Total Headcount
Select Total Headcount
Budget
Select Category
Select Category
Select Category
Select Category
Enter amount here
Enter amount here
Enter amount here
Enter amount here
Time
Activities
Select Your Activity
Select Your Activity


2 men arrested in Denmark following churchyard vandalism
by EndPlayCOPENHAGEN, Denmark (AP) - Police say two men, aged 27 and 38, have been arrested on suspicion of "gross vandalism" of gravestones in the Jewish section of a churchyard in northwestern Denmark.
The men are suspected of dousing green paint on 84 gravestones and knocking over several of them.
Police spokesman Klaus Arboe Rasmussen says their motive was to target "a particular group of the population based on their religion."
Arboe Rasmussen added Wednesday that the men, who were not identified in line with Danish practice, also are suspected of throwing black and green paint on a building in Randers, some 177 kilometers (110 miles) northeast of Copenhagen.
He added both incidents happened in the night between Friday and Saturday. Police want the men held in custody while they investigate the case.


Brexit Party to hold two Black Country meetings this week
The Brexit Party is holding two public meetings in the Black Country to hear people's views ahead of the general election.
Wolverhampton candidates Raj Chaggar and Vishal Khatri will chair a meeting at the Old Chainyard pub, Castle Street, Coseley, tomorrow from 7.30pm.
And on Friday Walsall South candidate Gary Hughes is holding a meeting at Lyndon House Hotel, Upper Rushall Street, at 7.30pm.
Both events are free to attend.
Mr Hughes, said: "We are holding these public meetings because we passionately believe in listening to the people.
"I urge people to come along to our meetings and have a say local and national issues."
The party had been due to hold two major rallies in the Black Country last Friday.
Nigel Farage scrapped one in Dudley after his candidate Rupert Lowe pulled out, then cancelled his appearance at a later event in Willenhall at short notice.


Toggle navigation
Menu
DRP Studios
Services
Products
About
Contact
Under Construction
We
new friends!


Usage¶
Once the SymbolDownloader Powershell Module is installed you should be able to use from a command prompt in any directory.
Download a single package¶
get-symbols Miruken <IP_ADDRESS>
You must provide the package name, and the version number. This can be done from the commandline in any directory.
Important
Package names are case sensitive.
Download symbols in a solution¶
If you are in a directory that contains packages.config files such as a solution or project directory, SymbolDownloader can read the packages.config files and download the symbols for specific versions of the packages you specify. It does a case insensitive contains on the package name.
get-symbols miruken
Will download the symbols and source for miruken, miruken.castle, miruken.mvc, miruken.mediator, etc...
get-symbols miruken.mediator
Will download the symbols for miruken.mediator and miruken.mediator.castle
This is all provided that the packages.config files contain references to these packages.
get-symbols castle
Will download miruken.castle, castle.core, castle.windsor, etc
It is recusive based on the working directory of the console, so you can run it in a project directory and it will only download packages referenced in that project, or you can run it in the solution and download symbols for all projects.


The Ghost and the Darkness (1996) A movie review by Serdar Yegulalp (C) 1997 by Serdar Yegulalp
CAPSULE: Stuff it and mount it.
Funny how your expectations can be defeated, and not in good ways. THE GHOST AND THE DARKNESS promised (at least, it seemed to me to promise) a Hemingwayesque showdown between men and nature. What it delivered was MYSTERY SCIENCE THEATER 3000-level material -- an inadvertently hilarious story that made me scream advice at the characters. "Get new jobs!" was one line, if I remember correctly.
At the end of the 19th century, Col. Patterson (Val Kilmer, whose Irish accent comes and goes like an African zephyr) is an engineer who has been hired to build a British railway bridge across the Tsavo River in Uganda.  Patterson tries to handle the situation himself, incompetently, and then turns to Charles Remington (Michael Douglas), a hunter of world reknown (or something like that).
The movie stacks the deck so heavily in favor of the lions, they should have gotten top billing and co-starred with Siegfried and Roy. They are nigh-invulnerable, as one comic book put it, and this is of course just the excuse the movie needs to have one native after another stepping forth to solmenly recite lines about the Power of Nature. Give me a break. The movie hasn't got the wherewithal to even begin to exploit such ideas; it's just trying to find convenient ways to stall us.
Even the lion hunts themselves are idiotic. Get this: Remington's big plan is to build a large scaffold-like structure in the middle of the savannah, sit on it, and wait for the lion to show up. He does this, and then gets knocked off by a BIRD. By the end of the movie, the blood vessels in my palm were all broken open from me pounding my forehead with my hand.
The acting is forgettable. Douglas does a good job of portraying a relatively cracked fellow, but it's nothing he hasn't done before. Kilmer looks like he wishes he were someone else, somewhere else, and the rest vanish into the cinematography. The camera, by the way, sometimes behaves so stupidly all by itself that most of the lion attacks are incoherent.
What did I expect from this movie? I dunno. Some real excitement, I suppose. A sense that there were formidable forces on both sides of this equation. No such luck. I dug out my tattered copy of Hemingway's "The Short Happy Life of Francis Macomber" and read that to get the taste of this movie out of my mind.
One out of four long rifles.
<EMAIL_ADDRESS>EFNet IRC: GinRei http://www.io.com/~syegul another worldly device... Finger me on IRC for address for after-hours (EST) experimental HTTP server.
you can crush me as I speak/write on rocks what you feel/now feel this truth
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


waveform visualizer prototype
Play song "Stories from Emona VI" (2008) by MAYA FILIPIČ from jamendo.com


Last updated: August 15, 2017
Drive 2 Photos ("us", "we", or "our") operates the https://drive2photos.herokuapp.com/ website (the "Service"). This page informs you of our policies regarding the collection, use and disclosure of Personal Information when you use our Service.
We will not use or share your information with anyone except as described in this Privacy Policy.
We use your Personal Information for providing the Service. By using the Service, you agree to the collection and use of information in accordance with this policy.
While using our Service, we may ask you to provide us with certain personally identifiable information that can be used to provide the service. The information collected will not be stored with us.
We collect information that your browser sends whenever you visit our Service ("Log Data"). This Log Data may include information such as your computer's Internet Protocol ("IP") address, browser type, browser version, the pages of our Service that you visit, the time and date of your visit, the time spent on those pages and other statistics.
Cookies are files with small amount of data, which may include an anonymous unique identifier. Cookies are sent to your browser from a web site and stored on your computer's hard drive.
We use "cookies" to collect information. You can instruct your browser to refuse all cookies or to indicate when a cookie is being sent. However, if you do not accept cookies, you may not be able to use some portions of our Service.
The security of your Personal Information is important to us, but remember that no method of transmission over the Internet, or method of electronic storage is 100% secure. While we strive to use commercially acceptable means to protect your Personal Information, we cannot guarantee its absolute security.
Our Service may contain links to other sites that are not operated by us. If you click on a third party link, you will be directed to that third party's site. We strongly advise you to review the Privacy Policy of every site you visit.
We have no control over, and assume no responsibility for the content, privacy policies or practices of any third party sites or services.
We may update our Privacy Policy from time to time. We will notify you of any changes by posting the new Privacy Policy on this page.
are advised to review this Privacy Policy periodically for any changes. Changes to this Privacy Policy are effective when they are posted on this page.
If you have any questions about this Privacy Policy, please contact us.


A few weeks ago it started with the following tweet of Steve Goodman:
In a very short period several Exchange and Lync bloggers informed Steve that they would like to attend and this resulted in The UCArchitects. A podcast which only contains unified communications related subjects. The mail and IM traffic which was exchanged between the contributors was from a high volume and new ideas were found.
After several days the site was already online although hidden for the large public. As it looks like Metro will be the new style we decided to use this both for the website and landing page. This resulted in the following landing page:
On the 18th of June the website was launched together with the first episode of the podcast: In the Beginning … . In this episode the following things where discussed:
- Exchange 2010 SP2 UR3 – Added features and bugs fixed. Installation complexities
- Importance of a development/lab environment for testing and demos
- Who’s going to MEC (Microsoft Exchange Conference)? Not Steve!
- TechEd 2012 vs. MEC
- Exchange “15″
- Public folders
- Simultaneous product releases
- Running multiple versions of Office products, upgrading client apps
- End of Edge Transport? Alternative approaches to messaging hygiene
- Desired features of the next version of Exchange
- Centralized (roaming) signatures
- Archiving
- The coming week and points of interest
Last week the second podcast was published: Corruption, Poison, and Ethiopia. In the second episode the following things where discussed:
- News Roundup (Yammer, Surface, MVPs)
- Lync: July2012 CU6
- Lync: Wildcard Support
- Lync: Push Notifications on IOS Update
- Exchange: Mailbox Corruption
- Exchange: Poison Mailboxes
- Exchange Tip: Get-MailboxReport
- Tip: TechEd North America 2012 / Europe 2012 content available
- MEC 2012
- Upcoming Event: UC User Group London (July, 26th)
- Lync Tip: How to make phone numbers and IM address in signatures clickable
- Upcoming Event: Network Group Netherlands (TBA, around end of October)
- Turkish Community Group, msHowto
- Roundup
If you would like to listen to the Podcasts you can do this by using one of the following methods:
- iTunes <itpc://www.theucarchitects.com/podcasts/podcasts.xml>
- Zune <zune://subscribe/?The UC Architects Podcast=http://www.theucarchitects.com/podcasts/podcasts.xml>
- RSS http://www.theucarchitects.com/podcasts/podcasts.xml
Besides the Podcasts and the website you can find us back here:
Facebook: http://www.facebook.com/#!/TheUcArchitects
Linkedin: http://www.linkedin.com/groups?home=&gid=4483924&trk=anet_ug_hm


At St Patrick Ventures, we are dedicated to our core purpose of helping all people live healthy lives. We are always looking to add effective and capable associates whose personal values align with ours to our team. One of the most important characteristics of great workplace is great people. At St. Patrick, we reward our team members by offering a variety of initiatives and programs to help our employees develop their careers, and ensure a balance between work and life.
Our Summer Intern Program is designed to enable students interested in health care fields. St. Patrick Ventures’ primary objective is to provide effective individuals with meaningful work experience and exposure to the health care industry. As an intern, we provide you with the chance to make an impact on health through networking activities, and in-depth orientation to the multifaceted world of health, and the benefits of working at St. Patrick Ventures.
if you express interest in a career with the St. Patrick Ventures family, please contact us by email or phone for more information


Preparation time
over 2 hours
Cooking time
10 to 30 mins
Serves
Makes 8
Dietary
Luilak is a Dutch festival held on the day before Whit Sunday. Young people start to crowd the streets at four in the morning, whistling, banging on doors and ringing bells to make as much noise as they can. Any young person who fails to get up is a ‘lazybones’. As well as making lots of noise, the revellers stuff themselves with goodies, including these very tasty buns, which are a bit like our hot cross buns.
Put the sugar, butter and milk in a small saucepan and heat very gently for a few seconds until just warm. Take care that the milk doesn’t get too hot or the yeast won’t work.
Pour the milk mixture into a heatproof bowl and stir in the yeast. Leave for 10 minutes or until a light foam forms on the surface.
Mix the flour, salt, cinnamon and lemon zest in a large bowl and make a well in the centre.
Whisk the egg into the warm milk mixture, then pour it all on to the flour. Stir with a wooden spoon until the mixture forms a ball.
Turn the mixture out on to a very lightly floured surface and knead for 5 minutes to make a smooth, pliable dough.
Knead the fruit into the dough for a couple of minutes until it is evenly distributed.
Place the dough in a lightly oiled bowl and cover with oiled clingfilm. Leave to rise in a warm place for 1½ hours, or until it has doubled in size and is spongy to touch.
Return the dough to the work surface and knock it back with your knuckles. Knead lightly, then divide the dough into 8 portions. Roll each of these into a ball, then pull the dough from around the sides and tuck it underneath the bun to give it a neat shape.
Place the buns on a large baking tray lined with baking parchment and flatten them slightly. If your tray isn’t large enough to take all of the buns at once, bake them in a couple of batches.
Cover with oiled clingfilm and leave to prove for a further 45 minutes.
Preheat the oven to 190°C/375F/Gas 5. Remove the clingfilm and bake the buns in the centre of the oven for about 20 minutes until risen and golden brown.
Serve warm the day they’re made – great spread with butter and drizzled with syrup or honey.


--- title: From a (set.)seed grows a mighty dataset author: Jonathan Carroll date: 2016-05-30 21:35:26 slug: seed categories: [R] tags: [rstats] type: '' subtitle: '' image: '' ---
Can you predict the output from this code?
Can you predict the output from this code?
printStr <- function(str) paste(str, collapse="")
set.seed(12173423); x <- sample(LETTERS, 5, replace=TRUE)
set.seed(7723132);y <- sample(LETTERS, 5, replace=TRUE)
paste(printStr(x), printStr(y))
Okay, the first bit is straightforward; it’s a function that puts two string together into one. The next two lines appear to provide a random integer to the set.seed
function then sample the pool of LETTERS
5 times with replacement. The last line uses the function from the first line to combine those samples of letters together into one string. Easy enough. Looks like it will produce a random string. Give it a try… go on, the seeds should make it reproducible.
[1] "HELLO WORLD"
Whoa! What are the odds of that!?! Of all the possible letters we could have sampled, we get that!
Okay, yes, it’s rigged. Pretty neat choice of values for set.seed
there, right? I came across the Java variant of this via StackOverflow’s ‘Hot Network Questions’ sidebar (a rabbit-hole equal in depth to a Wikipedia wiki-hole). The seeds just happen to be ones that when sampled 5 times with replacement produce the right values to extract those letters in order. That seems simple enough until you want to find them.
The possible combinations of 5 letters, chosen with replacement, from the pool of 26 is \(26^5\) which is a lot, but not insanely many. I work with multi-million row datasets frequently enough. So, we could just run a loop over all integers (set.seed
rounds to nearest integer anyway; refer to ?set.seed
), set the seed to that value, and save the sampled letters. The first combination will be
set.seed(1L)
sample(LETTERS, 5, replace=TRUE)
## [1] "G" "J" "O" "X" "F"
So, we write a loop and iterate over the seed, saving the outputs. But wait, you may wonder, what’s to guarantee that we don’t get the same sample twice? Nothing. It’s a random sample starting from a different seed every time; there’s no control over the results after the fact. A quick check confirms this; here’s a duplicate of the first record appearing at seed 3415066L
set.seed(1L);sample1 <- sample(LETTERS, 5, replace=TRUE)
set.seed(3415066L); sample2 <- sample(LETTERS, 5, replace=TRUE)
identical(sample1, sample2)
## [1] TRUE
So, set.seed(1L)
produces the same 5 letter sample as set.seed(3415066L)
. There’s definitely duplicates of other combinations between those two too. Okay, so we’re not going to be limited to \(26^5\). How many though? Who knows? What’s the distribution of duplication? Without knowing how many we need to try for, we can take the upper limit and go for that; on my machine I get
.Machine$integer.max
## [1]<PHONE_NUMBER>
which is certainly a bigger number, but not out of the realm of possibility.
To make life easier, we can split the problem up. It’s “embarrassingly parallel” (each iteration is completely independent of the others) so it’s perfect for parallelisation. If you haven’t read Drew Schmidt a.k.a wrathematics’ semi-NSFW guide to Parallelism, R, and OpenMP then stop reading this and go read that.
You’re back, great. Let’s assume for now that you too have access to a big, fast computer and want to parallelise the loop over all positive integers. If you’re lucky, it’s as easy as
library(parallel)
cl <-
makeCluster(7) ## 8-core machine, leave one out to remain stable
clusterApply(cl, seq(1, (.Machine$integer.max - 1), 1e7), function(x) {
wordvec <- data.frame(word = character(1e7L), seed = integer(1e7L))
for (iloop in 1:(1e7)) {
iseed <- x + iloop - 1
if (abs(iseed) < .Machine$integer.max) {
set.seed(iseed)
wordvec[iloop, "word"] <-
paste0(LETTERS[sample(26, 5, replace = TRUE)], collapse = "")
wordvec[iloop, "word"] <- iseed
}
}
write.csv(wordvec, file = paste0("seeded_words_", as.character(x), ".csv"))
}
})
but life’s not that easy. This is slow as a week of Mondays. For starters, updating the data.frame
this many times will probably exhaust your RAM. This was run on a machine with 32GB available, and it got full, fast. Writing out large .csv
files is slow, and given that each of them has ten million rows, the 215 files aren’t particularly small; there are a lot of duplicate entries.
We can make this better with a few adjustments;
library(parallel)
cl <-
makeCluster(7) ## 8-core machine, leave one out to remain stable
clusterApply(cl, seq(1, (.Machine$integer.max - 1), 1e7), function(x) {
library(data.table)
wordvec <- data.table(word = character(1e7L), seed = integer(1e7L))
for (iloop in 1:(1e7)) {
iseed <- x + iloop - 1
if (abs(iseed) < .Machine$integer.max) {
set.seed(iseed)
set(
wordvec,
i = iloop,
j = "word",
value = paste0(LETTERS[sample(26, 5, replace = TRUE)], collapse = "")
)
set(wordvec,
i = iloop,
j = "seed",
value = iseed)
}
}
unique_wordvec <- unique(wordvec, by = "word")
save(unique_wordvec,
file = paste0("seeded_words_", as.character(x), ".rds"))
}
})
Using data.table
means that the set()
operations are all in-memory and this alone speeds up the loops. Removing duplicates using unique
(now dispatched for data.table
) and saving as a compressed binary .rds
file makes this a little less bulky. All in all, this can be completed in a few hours on a decent enough machine. I did try using feather for the saving of files and my early tests using smaller subsets showed it to be amazingly fast. Unfortunately there are still some bugs to be ironed out of that package for large files/lots of rows, and my 215 files ended up small, but unreadable.
Given that there’s only \(26^5 = 11881376\) combinations that we’re looking for, depending on how often duplicates come up, we probably don’t need all the results. I’ll save you the trouble and let you know that the loop only needs to go up to at most, 113449118
. Reading all of the files back in and merging them again requires some careful considerations. R
isn’t too keen on creating objects larger than 2GB, so we can’t really just merge 113449118 lines of data. Taking it step-wise, I managed to get it to work
library(data.table)
library(dplyr)
load("seeded_words_1.rds") ## load the first file
bigdf <-
unique_wordvec## objects were saved as unique_wordvec so save ## to a new name to avoid overwriting
rm(unique_wordvec)## then drop the saved version
allfiles <- list.files(pattern = "01.rds")
## files were saved as 'seeded_words_X.rds' where x was steps of 1e7
## sorting alphabetically gives the wrong order
for (file in allfiles[order(as.numeric(sub("\\.rds", "", sub(
"[a-z_]*", "", allfiles
))))]) {
cat(paste0("** Processing file ", file, "\n")) ## show notifications on the screen
load(file)
bigdf <-
unique(data.table(bind_rows(bigdf, unique_wordvec)), by = "word") ## drop duplicates as we go
rm(unique_wordvec)
if (nrow(bigdf) &
amp
gt
= 26 ^ 5) {
cat(paste0("** Processing OUTPUT file.\n"))
save(bigdf, file = "all_seeded_words.rds")
stop()
}
}
This results in a 75MB .rds
of all unique combinations of 5 letters sampled with replacement, and the seed that generates them. Not particularly share-able or convenient. We’re mainly interested in actual words. We can filter this list down to English words if we can think of some way to do that (with the associated assumptions and limitations that may bring). Here’s one R
option:
library(ScrabbleScore)
words <- bigdf[is.twl06.word(bigdf$word), ]
This filters the generated 5-letter words against a Scrabble Official Tournament and Club Word List which is as close as I can be bothered getting to ‘English’ words. What’s left is a list of 8938
5-letter words with their associated generating seeds. Sure enough, filtering the twl06
wordlist down to the 5-letter words gives exactly that many; we’ve generated all the 5-letter words in that data set. Cool. What were we hoping to do with it? Oh, right.
print(words["HELLO"])
#> 1: HELLO 12173423
print(words["WORLD"])
#> 1: WORLD 7723132
There we go, the seeds used in the original question for this post. If we wanted, we could write other words or phrases in this way.
set.seed(5360994); x <- sample(LETTERS, 5, replace=TRUE)
set.seed(21732771); y <- sample(LETTERS, 5, replace=TRUE)
paste(printStr(x), printStr(y))
## [1] "STATS RULES"
We might be interested in what the distribution of unique, English words looks like. Here you go;
library(ggplot2)
gg <- ggplot(words, aes(x=seq_along(seed), y=seed)) gg <- gg + geom_point(alpha=0.6, col="steelblue1", pch=20, size=2) gg <- gg + theme_bw()
gg <- gg + labs(title="Seed that generates unique, English words", subtitle="Filtered as valid Scrabble TW06 words",
caption="https://en.wikipedia.org/wiki/Official_Tournament_and_Club_Word_List",
x="Index",
y="Seed")
gg
I’ve converted that using the excellent plotly::ggplotly()
function so you can mouseover each point to see the corresponding word.
Fairly uniform looking in that plot. How about the density?
library(ggplot2)
gv <- ggplot(words, aes(x=factor(0), y=seed)) gv <- gv + geom_violin(fill="steelblue1") gv <- gv + theme_bw()
gv <- gv + theme(axis.title.x=element_blank(),
axis.text.x=element_blank(),
axis.ticks.x=element_blank())
gv <- gv + labs(title="Violin plot of seed that generates unique, English words", subtitle="Filtered as valid Scrabble TW06 words",
caption="https://en.wikipedia.org/wiki/Official_Tournament_and_Club_Word_List",
y="Seed")
gv
which looks pretty nicely vanishing as more duplicates are produced.
Finally, what about the distribution by starting letter?
Unsurprisingly; not many words starting with “X” (13) and lots starting with “S” (1084). The last word produced (the one with the largest unique seed before we run out of unique words) is “HUTCH” at 113449118.
Can we do anything else with this? The first thing that comes to mind is using this to encode a message. This method is reminiscent of a hash function; it takes some data and via a 1-way mechanism, produces an encoded message. Of course, the 1-way nature of this takes a word and encodes it to an integer that can’t be easily predicted, so hopefully your message is all integers. Many reasons make this a bad idea to actually use for this purpose. The first being that in the world of digital security, if you’re thinking of rolling your own, you’re setting yourself up for trouble. Much smarter people than you or I have spent a lot of time getting digital security right, and it still isn’t.
As for actual technical issues, the obvious one is that it can be brute-forced (as we just showed) easily. I produced the list of all 5-letter combinations produced from all possible integers in a few hours. Modern GPU processing can perform many millions of these calculations per second. Another technical fault of this would be that collisions are all too easy, as demonstrated by our duplicates. A good encoding should only generate the hashed value from the input, not any other input. MD5 has this flaw. If you were to try and use this encoding to validate a message (say, the integer represents a checksum of the message contents, encoded as a difficult to predict word) then it would be far too easy for a malicious entity to produce the same word from their own message padded out with junk data.
So, not very useful for encryption/hashing (not that it should be). I don’t really have a useful application for this apart from the riddle at the start of this post, but it’s been an interesting journey through optimisation, parallelisation, filtering, and file input/output. I’d say that has made it worthwhile enough.
The data file of valid Scrabble words can be downloaded here if you’d like it. I’ll gladly provide the full 5-letter list on request.
I’m not a data-security expert so any and all of my advice there is liable to be rubbish. Do you know a better way to generate this data, or an aspect I haven’t considered? Hit the comments and let me know.


---
layout: post
title: 'Augustin: The Typeface not the Man'
date: '2009-07-14T12:17:00.003-05:00'
author: Jabell
tags:
- Fun
- Fonts
modified_time: '2009-07-14T12:31:33.201-05:00'
thumbnail: http://2.bp.blogspot.com/_p0aKmLIk4oY/Sly_z38QK5I/AAAAAAAAAHQ/Rh1TFqh4ZoA/s72-c/Augustin.png
blogger_id: tag:blogger.com,1999:blog-19739956.post-7679479827061859045
blogger_orig_url: http://theabellsix.blogspot.com/2009/07/augustin-typeface-not-man.html
---
I have a friend (here and here) who has introduced me to the world of typography. I am a total neophyte, but hopefully I am learning. I ran across this new typeface today, which I really like. Maybe those with a more discerning eye would disagree, but I like it and would love to print my next exegetical paper in Augustin.


Hello there! My name is Thanos! I was born in a small town in the northern part of Greece. My story begins with my father showing and explaining to me the main parts of a computer (back when I was a kid). After moving to the city, I was finally introduced to the superb world of the internet.  Some years later (when I was around 16) websites and the philosophy behind them got my interest. I started looking for ways of building a website and managed to get some knowledge on WordPress as well as the basics of HTML and CSS. At the age of 18, I was accepted at the TEI of Crete, at the Department of Informatics Engineering. I've been coding since then for either my university or personal projects.
This is a project visualizing the data given from an NYPD database showing the crimes in New York City in 2018. The main purpose of this project is using as many data patterns as possible, having a well-structured code and put in use all the object-oriented principles
So far, we finished a heartbeat tracker and a simple theme for the watch, but there is more to come!
After mastering the basics of linear algebra and having already worked in Blender with some 3D modeling, I enrolled a course in my university, focusing on the core of graphics using the WebGL API as well as shaders.


Toggle navigation
Home
assignment_ind
Patients
person
Doctor
supervisor_account
Admin
add_box
New Patient?
×
Bye
You have deleted your account
Welcome To Hospital!