|
|
MySQL - Change password
|
There are three methods of changing the MySQL root password: by UniController, phpMyAdmin or MySQL Prompt. The easiest method is to use UniController, which is fully automated. Other methods require a certain amount of typing and editing, and are more error-prone.
Set New MySQL root user password using UniController
Starting UniController provides the first opportunity to change the current root password, it is highly recommended that you set this password at the first opportunity.
Alternatively you can skip setting a new MySQL root password and run this menu option later using:
MySQL > Change MySQL root password
- The Set New MySQL Password menu opens (See image on right)
- A) Enter a new password
- B) Click the OK button.
Note: Clicking the cancel button no action is taken. You can set the password later.
|
|
Set New MySQL root user password using phpMyAdmin
Setting a new MySQL root password using phpMyAdmin requires two root accounts to be changed along with one configuration file.
Note: The following assumes the current password is root12 and the new password is root123; substitute for these as appropriate.
First start both servers using UniController and then start phpMyAdmin. To change the password proceed as follows:
- From the top menu bar of phpMyAdmin, click the Privileges (1) button. The user privileges page opens, as shown on right:
- Click the first Edit Privileges (2) which opens a new page: "Edit Privileges: User"
- Scroll down the page to Change password
- Enter new root password:
For example root123 (4) repeat password (5)
- Click Go (6) to unpdate the user's password
- Repeat step 2) for the remaining user (3)
- Navigate to the end of the Privileges User Overview page and click reload the privileges link.
Note: Do not stop the MySQL server at this point.
|
|
- Edit file C:\UniServerZ\htpasswd\passwd.txt
Replace root12 with the new root password root123.
Note: Perform a quick test. Clear your browser's cache and restart the servers. Run phpMyAdmin and verify that the MySQL server is accessible.
|
|
Note: The above root user accounts all use the same root password. This is purely for convenience and one of consistency.
Set New MySQL root user password using MySQL Prompt
Setting a new MySQL root password using MySQL Prompt requires two root accounts to be changed along with one configuration file.
Note: The following assumes the current password is root123 and the new password is root1234; substitute for these as appropriate.
|
First start both servers using UniController and proceed as follows:
- Start MySQL Prompt: Click MySQL Console button
- At the MySQL prompt type the following:
mysql> SET PASSWORD FOR<EMAIL_ADDRESS>= PASSWORD('root1234');
mysql> SET PASSWORD FOR<EMAIL_ADDRESS>= PASSWORD('root1234');
mysql> FLUSH PRIVILEGES;
mysql> exit;
Results for steps 1) and 2) are shown on right.
- Edit file C:\UniServerZ\htpasswd\passwd.txt
Replace root123 with the new root password root1234.
Note: Perform a quick test. Clear your browser's cache and restart the servers. Run phpMyAdmin and verify that the MySQL server is accessible.
|
Welcome to the MySQL monitor. Commands end with ; or \g.
Your MySQL connection id is 1
Server version: 5.5.30 MySQL Community Server (GPL)
Copyright (c) 2000, 2013, Oracle and/or its affiliates.
All rights reserved.
Oracle is a registered trademark of Oracle Corporation
and/or its affiliates. Other names may be trademarks of
their respective owners.
Type 'help;' or '\h' for help. Type '\c' to clear the
current input statement.
mysql> SET PASSWORD FOR<EMAIL_ADDRESS>= PASSWORD('root1234');
Query OK, 0 rows affected (0.11 sec)
mysql> SET PASSWORD FOR<EMAIL_ADDRESS>= PASSWORD('root1234');
Query OK, 0 rows affected (0.00 sec)
mysql> FLUSH PRIVILEGES;
Query OK, 0 rows affected (0.44 sec)
mysql> exit
Bye
C:\UniServerZ\core\mysql\bin>
|
Related topics
Restore MySQL root password.
MySQL Prompt.
|


Please close as many browser tabs as possible to ensure the task runs smoothly.
In this task, you will see four white shapes and four black shapes. These shapes will move and bounce around inside a blue rectangle. These shapes will randomly speed up and slow down while they move, making them tricky to follow.
Try to keep your eyes fixed on the dark blue square while you complete this task.
Click the button below to begin.
START


Please welcome new OsmAnd Topo map style. If you are a hiker or a cyclist spending much time in the countryside, you are likely to appreciate the new style. It is designed to make your trips as convenient as possible while enjoying the nature. Let&s get to the details.
Right from the beginning, you'll notice a comparatively high contrast of the map colors. The roads are displayed in orange shades with a clear and thick black border. This increases their visibility and improves map's legibility. Also, we've transferred cycling and pedestrian routes from default OsmAnd style to make it even more convenient.
Contour lines are brown showing every 100m of altitude. You'll be able to see the names on such line presented in a dark color. The names won't resemble the shape of lines: such solution improves readability of information.
The ridges have black edges with nicks. The buildings are represented in solid black color. It reduces your chances to miss a shelter in a sparsely populated area.
The forests are painted in a brighter shade of green. Deep rivers and lakes have deep-colored edges, while smaller rivers and other waterways are dark blue.
Also, some symbols are different in the topo style: 'surface integral rendering' is made to conveniently show the surface information. You can add or remove this feature in Configure map - 'Details' menu. The roads will be marked according to the scale presented below. Access restriction symbols have been made dark-red to prevent violation of private property or planning your route across a closed area. Spot obstacles are shown as dots on bigger scales.
Linear obstacles are represented as fine lines visible from zoom level 16 or from level 13 if you enable the 'More details' option. You can enable it in Configure map - 'Details' menu. Main landmarks are designed to be seen from higher scale levels.
Enjoy your travel with OsmAnd!


---
layout: post
title: When optimal matters
categories:
- Software Engineering
tags:
- donald knuth
- finite resource
- it
- optimal code
- optimization techniques
- optimizations
- Pharo
- profiling
- resource assumptions
- software
- software-development
- technology
status: publish
type: post
published: true
meta:
_publicize_pending: '1'
_wpas_done_3194664: '1'
tagazine-media: a:7:{s:7:"primary";s:0:"";s:6:"images";a:0:{}s:6:"videos";a:0:{}s:11:"image_count";i:0;s:6:"author";s:8:"35633512";s:7:"blog_id";s:8:"36660125";s:9:"mod_stamp";s:19:"2013-03-23
19:57:19";}
_publicize_done_external: a:1:{s:8:"facebook";a:1:{i:1479284455;b:1;}}
publicize_twitter_user: GuillePolito
_wpas_done_1260342: '1'
_wpas_done_1260340: '1'
publicize_reach: a:3:{s:7:"twitter";a:1:{i:1260342;i:159;}s:2:"fb";a:1:{i:3194664;i:363;}s:2:"wp";a:1:{i:0;i:9;}}
_wpas_skip_3194664: '1'
_wpas_skip_1260342: '1'
_wpas_skip_1260340: '1'
_elasticsearch_indexed_on: '2013-03-23 19:57:19'
---
This last week I've been involved somehow in several discussions which, although not explicitly, talked about optimizations. In particular, premature optimizations. Of course, we all know they are evil. Do we? I'll not discuss today on optimization techniques, but on what should an IT professional think about when thinking about optimizations in his programs.
The main arguments I heard this week of people supporting premature organizations were:
- A guy using some technology X, should know the underlying details of X, or he will fail. Let's say, if you are a Java programmer, you must not only know there is a GC, but also how it works.
- A tech guy should be always conscious of the resources used. i.e., not to store a lot of objects in caches because memory is a finite resource.
- Assumptions on what should be faster. Using or not a macro in C for example.
And these arguments are not even totally wrong. But they are not so totally true as they were stated.
Premature optimization is the root of all evil
You know Donald Knuth? This phrase (attributed to C.A.R. Hoare, btw) became famous because of this paper he authored. The interesting thing is that this phrase, when used, is taken out from context. The original phrase is:
Programmers waste enormous amounts of time thinking about, or worrying about, the speed of noncritical parts of their programs, and these attempts at efficiency actually have a strong negative impact when debugging and maintenance are considered. We should forget about small efficiencies, say about 97% of the time: premature optimization is the root of all evil. Yet we should not pass up our opportunities in that critical 3%.
Being optimal is not all that matters
When writing software, running optimal is not the only variable to analyze. We want programs to be debuggeable, understandable, extendable, maintainable. And sometimes, optimal code can be ugly, and can be hard to change, or to fix bugs on it.
So, let's look at this piece of code written for Pharo. This piece of code takes a string, splits the substrings taking the space character as separator, excludes the substrings that do not exist as symbols in the system, and then it converts them to symbols.
[code language="ruby"]
aString := 'aaaaa bbb Class cccc ddd'.
((aString splitOn: Character space)
reject: [ :each| Symbol lookup: each ])
collect: #asSymbol
[/code]
Kind of understandable piece of code. But what goes on behind scenes?
- splitOn: creates a new (and temporary) collection. It also creates strings for each substrings and copy all the contents into those strings;
- reject: iterates over the result of #splitOn:, creates a new (temporary again) collection;
- collect: iterates over the result of #reject:, creates a new collection to put the results of #asSymbol
Finally, there are two intermediate collections that are discarded, some substrings are created by copying all the contents and finally discarded (cause we only care about the symbols). Yes, that is inefficient: lots of temporary allocations that could launch the GC, several iterations over collections... we could do better. Let's see an alternative version Camillo Bruni (Rmod, Inria) suggested to improve in terms of speed and memory usage:
[code language="ruby"]
Array streamContents: [ :s|
aString
splitOn: Character space
indicesDo: [ :start :end|
aString asSymbolFrom: start to: end ifPresent: [ :symbol|
s nextPut: symbol]]
[/code]
This new version, which btw ends up with the same result, is pretty much more efficient:
- Streaming on the result causes only one collection allocation without temporal ones;
- Some special methods introduced into String to avoid extra collection allocation, and substring copies;
- One collection means only one iteration :)
But wow, the code became much more complicated (given the simplicity of the example), and less object oriented. We do not manipule so easily the substrings by sending messages to them, we have instead the indices into the source string. Our code is much more aware of the problems we stated before, and recurring to lower level APIs to avoid them.
Now, extend these ideas to a whole large application. Hundreds or thousands of classes written this way. We write methods of tens (or hundreds, why not?) of lines of code to avoid message sends (and therefore method lookups), we avoid at the maximum object allocation and go for an if based solution... and soon we will have lots of duplicated code, stringy code everywhere... And yet I can tell you (just guessing :^) your program will not be tons more optimal. What? Now my code is so hard to maintain and not very much faster? Not cool...
Being optimal when optimal matters
So let's say we have this function that takes 100.000 database rows, makes some calculations, and show a simple result to a user. It takes 1 second, which is a lot for a nowadays machine. But this function is used once per hour...
Now take the code that evaluates the bytecode that access an object's field. It gets executed maybe some lots of thousands of times per second? So, if this operation starts to take 1 second... :)
Or take this application that stores data on background, but when restoring wants to be as fast as possible to give a really good user experience. Will you care how much it takes the storing operation?
Do we really have to spend a lot of time optimizing code that is almost not used? Or code that does not need to run that fast? Wait! My application runs ok, do I really have to optimize something?
As Knuth says, 97% of the code is not critical. Only 3% deserves to be optimized.
Understand when and where optimal matters
So now you know the key point (optimizing when it matters), and you understood it mattered in your case. Time to find that 3%. And it may be not so obvious...
Thanks engineers invented profiling! Just look a bit around, there are tons of tools to help you understand what you're doing wrong: where is memory allocated?, and of which type?, is the GC launched so often? is a time consuming function executed too many times? Profiling is a technique that should be on every software engineer tool-case.
The rules of optimization
As a conclusion, today I found this link I want to share about the rules of optimization. And I think they are a pretty good guideline. When you are thinking on making an optimization:
- First time: Don't do it!
- Second time: Don't do it yet!
- Third time: Ok, but you first profile and measure, and then optimize
There is much to lose when only thinking on the optimal solution to a problem in terms of machine resources. Remember people's time to understand the written code, to adapt it to new situations and to fix bugs on it is also a valuable resource.
Guille


Describes the status of a parameter of door.
@added in SmartDeviceLink 7.1.0
- (nonnull instancetype)initWithLocation:(nonnull SDLGrid *)location
status:(nonnull SDLDoorStatusType)status;
init(location: SDLGrid, status: SDLDoorStatusType)
- location
- status
A SDLDoorStatus object
The location of the door on the vehicle grid
@property (nonatomic, strong) SDLGrid *_Nonnull location;
var location: SDLGrid { get set }
The status of the door
@property (nonatomic, strong) SDLDoorStatusType _Nonnull status;
var status: SDLDoorStatusType { get set }


Forms only alphabets (no numbers & no symbols)
Forms only Numbers (no alphabets & no symbols)
Forms only symbols (no alphabets & no numbers)


statistical module¶
-
statistical.
check_significance
(data, threshd)¶ Checks which columns are significant based on the set threshold for numpy arrays and pandas dataframes. Deletes insignificant columns.
- Args:
data (numpy array/pandas dataframe): The data object. threshd (float): The variance threshold below which data is considered as constant and not included in the output.
- Returns:
numpy array/pandas dataframe, integer list/string list: The data object without insignificant columns and the indices that correspond to the original columns that remain, for plotting/labeling purposes. purposes.
-
statistical.
correlation_matrix
(data)¶ Calculates the correlation matrix of a dataframe and orders by degree of correlation.
- Args:
data (pandas dataframe): The data object.
- Returns:
pandas series: The correlation matrix sorted with highest correlation on the top.
-
statistical.
euclidean_distance
(list_ref, list_comp, vectors)¶ Calculates the Euclidean distance (L2 norm) between pairs of vectors.
- Args:
list_ref (integer list): A list with the indices of the reference vectors. list_comp (integer list): A list with the indices of the vectors to compare to. data (numpy array): The data object.
- Returns:
numpy array: The Euclidean distance (L2 norm) for comparison vs. reference vectors.


Tester's Tricks
IT
misc
links
Pelican
Python.org
Jinja2
You can modify those links in your config file
social
You can add links in your config file
Another social link


Description
By default, after the conditions of a rule are met and the action are apllied, the plugin moves on to the next completed build in the build history and starts to process all the rules again from the start of the list of rules.
When this flag is set to false
(default) AND this rule's conditions are met,
this rule is the last rule applied to the build. The plugin moves on to the next completed build
and starts processing the rules from the start of the list of rules.
When this flag is set to true
AND this rule's conditions are met,
the plugin moves on to the next rule with the same build. This way multiple consecutive rules
can be applied to the same build.
Use cases
This is the way to apply more than one rule to the same build, providing the conditions of all those rules are met.


Tef prompt
This is the 'main' prompt notice
Content url ?
Typing speed ?
Prompt color ?
Prompt background ?
Please name your new planner
Are you sure you want to delete this planner?


--- creation_epoch:<PHONE_NUMBER> lastmod_epoch:<PHONE_NUMBER> categories: Programming title: Require certain version of Perl in a script --- require 5.010_000; # Require Perl version 5.10 or better
This is the backwards compatible way which will not generate warnings when you run Perl -W


<dependency>
<groupId>com.tinkerpop.blueprints</groupId>
<artifactId>blueprints-core</artifactId>
<version>??</version>
</dependency>
GraphSON is a JSON-based format for individual graph elements (i.e. vertices and edges). How these elements are organized and utilized when written as a complete graph can also be considered GraphSON format. In other words, the schema for GraphSON is very flexible and therefore, any JSON document or fragment that is produced by or can be consumed by the Blueprints IO packages can be considered valid GraphSON.
The GraphSON reader and writer package allows an entire graph to be streamed to and from the standard JSON format which is utilized across the TinkerPop stack. GraphSON can be read or written in several styles:
For most scenarios, standard JSON without data typing should generally be acceptable. Using the more verbose outputting of explicit data types only provides the added value of ensuring that numeric values are converted properly (ie. float versus double).
The following example shows the format without explicit data types:
{
"graph": {
"mode":"NORMAL",
"vertices": [
{
"name": "lop",
"lang": "java",
"_id": "3",
"_type": "vertex"
},
{
"name": "vadas",
"age": 27,
"_id": "2",
"_type": "vertex"
},
{
"name": "marko",
"age": 29,
"_id": "1",
"_type": "vertex"
},
{
"name": "peter",
"age": 35,
"_id": "6",
"_type": "vertex"
},
{
"name": "ripple",
"lang": "java",
"_id": "5",
"_type": "vertex"
},
{
"name": "josh",
"age": 32,
"_id": "4",
"_type": "vertex"
}
],
"edges": [
{
"weight": 1,
"_id": "10",
"_type": "edge",
"_outV": "4",
"_inV": "5",
"_label": "created"
},
{
"weight": 0.5,
"_id": "7",
"_type": "edge",
"_outV": "1",
"_inV": "2",
"_label": "knows"
},
{
"weight": 0.4000000059604645,
"_id": "9",
"_type": "edge",
"_outV": "1",
"_inV": "3",
"_label": "created"
},
{
"weight": 1,
"_id": "8",
"_type": "edge",
"_outV": "1",
"_inV": "4",
"_label": "knows"
},
{
"weight": 0.4000000059604645,
"_id": "11",
"_type": "edge",
"_outV": "4",
"_inV": "3",
"_label": "created"
},
{
"weight": 0.20000000298023224,
"_id": "12",
"_type": "edge",
"_outV": "6",
"_inV": "3",
"_label": "created"
}
]
}
}
The following example shows the format with explicit data types:
{
"mode":"EXTENDED",
"vertices": [
{
"name": {
"type": "string",
"value": "lop"
},
"lang": {
"type": "string",
"value": "java"
},
"_id": "3",
"_type": "vertex"
},
{
"name": {
"type": "string",
"value": "vadas"
},
"age": {
"type": "integer",
"value": 27
},
"_id": "2",
"_type": "vertex"
},
{
"name": {
"type": "string",
"value": "marko"
},
"age": {
"type": "integer",
"value": 29
},
"_id": "1",
"_type": "vertex"
},
{
"name": {
"type": "string",
"value": "peter"
},
"age": {
"type": "integer",
"value": 35
},
"_id": "6",
"_type": "vertex"
},
{
"name": {
"type": "string",
"value": "ripple"
},
"lang": {
"type": "string",
"value": "java"
},
"_id": "5",
"_type": "vertex"
},
{
"name": {
"type": "string",
"value": "josh"
},
"age": {
"type": "integer",
"value": 32
},
"_id": "4",
"_type": "vertex"
}
],
"edges": [
{
"weight": {
"type": "float",
"value": 1
},
"_id": "10",
"_type": "edge",
"_outV": "4",
"_inV": "5",
"_label": "created"
},
{
"weight": {
"type": "float",
"value": 0.5
},
"_id": "7",
"_type": "edge",
"_outV": "1",
"_inV": "2",
"_label": "knows"
},
{
"weight": {
"type": "float",
"value": 0.4000000059604645
},
"_id": "9",
"_type": "edge",
"_outV": "1",
"_inV": "3",
"_label": "created"
},
{
"weight": {
"type": "float",
"value": 1
},
"_id": "8",
"_type": "edge",
"_outV": "1",
"_inV": "4",
"_label": "knows"
},
{
"weight": {
"type": "float",
"value": 0.4000000059604645
},
"_id": "11",
"_type": "edge",
"_outV": "4",
"_inV": "3",
"_label": "created"
},
{
"weight": {
"type": "float",
"value": 0.20000000298023224
},
"_id": "12",
"_type": "edge",
"_outV": "6",
"_inV": "3",
"_label": "created"
}
]
}
There are a few differences between the formats. If types are embedded, the JSON must start with a mode
key with a value of EMBEDDED
. This key acts as a hint to the reader that it must extract property values in a different manner. If the key is omitted, that setting is assumed to be NORMAL
.
There is a third option for the mode
, which is COMPACT
. This mode allows more complete control over exactly what element properties get serialized to the GraphSON output. As there is complete control, there is a possibility that the GraphSON will not be viable for reading (ie. if an important property is not serialized out, like the vertex _id
).
All values of keys, short of the values for reserved keys that start with an underscore, must contain an object that has two keys: type
and value
. The type
must be one of the following: boolean
, string
, integer
, long
, float
, double
, list
, or map
.
If the type is a map
or a list
, then each component object that make up that key must use that same format. For example:
"someMap": {
"name": {"type":"string", "value":"william"},
"age": {"type":"int", "value":76}
},
"someList" [{"type":"int", "value":1},{"type":"int", "value":2},{"type":"int", "value":3}]
Please note that complex objects stored as properties will be converted to strings by way of the object’s toString
method.
To output a graph in JSON format, pass the graph into the GraphSONWriter
constructor, then call outputGraph
:
Graph graph = ...
OutputStream out = ...
GraphSONWriter.outputGraph(graph, out);
The GraphSONReader
works in a similar format. Simply pass what would likely be an empty graph into the constructor, then call inputGraph
:
Graph graph = ...
InputStream in = ...
GraphSONReader.inputGraph(graph, in);
There are a number of static method overloads that offer more options and control.
The GraphSONUtility
class is used by both GraphSONReader
and GraphSONWriter
to convert individual graph elements (vertices and edges) to and from the GraphSON format with conversion options to both a Jettison JSONObject
and a Jackson ObjectNode
. Usage is as follows:
Vertex v = graph.getVertex(1);
JSONObject json = GraphSONUtility.jsonFromElement(v);
System.out.println(json.toString())
Vertex convertedBack = GraphSONUtility.vertexFromJson(json,
new GraphElementFactory(graph), GraphSONMode.NORMAL, null);
The GraphElementFactory
is an implementation of the ElementFactory
class, that utilizes a Graph
instance to construct Vertex
and Edge
instances. In most cases, the GraphElementFactory
is all that is needed to use the GraphSONUtility
, though in cases where vertices or edges need to be constructed outside of the context of a Graph
implementation, it might be necessary to implement a custom implementation.


Upload Image
{% if disp %}
{% load static %}
We have developed a Deep Learning model which predicts skin disease just by looking at the picture. Isn't that just amazing!!!! We have used state of the art Deep Learning methods and developed a Convulational Neural Network which which is fast , efficient and reliable. This model is trained on the HAM10000 dataset publically available on kaggle . AI is changing Medical Diagnosis completely and as an AI enthusiast I have tried to contribute something.
Skin disorders vary greatly in symptoms and severity. They can be temporary or permanent, and may be painless or painful. Some have situational causes, while others may be genetic. Some skin conditions are minor, and others can be life-threatening. While most skin disorders are minor, others can indicate a more serious issue.
In the observational study, skin diseases contributed 1.79% to the global burden of disease measured in disability-adjusted life years (DALYs). Skin diseases arranged in order of decreasing global DALYs are as follows: dermatitis (atopic, contact, seborrheic), acne vulgaris, urticaria, psoriasis, viral skin diseases, fungal skin diseases, scabies, melanoma, pyoderma, cellulitis, keratinocyte carcinoma, decubitus ulcer, and alopecia areata. Skin diseases remain a major cause of disability worldwide. An objective measure of burden, such as the DALY, allows for comparison of diverse diseases across geography and time.
Disability secondary to skin conditions is substantial worldwide. The Global Burden of Disease Study 2013 includes estimates of global morbidity and mortality due to skin diseases. For nonfatal estimates, data were found by literature search using PubMed and Google Scholar in English and Spanish for years 1980 through 2013 and by accessing administrative data on hospital inpatient and outpatient episodes. Data for fatal estimates were based on vital registration and verbal autopsy data.
Skin conditions contributed 1.79% to the global burden of disease measured in DALYs from 306 diseases and injuries in 2013. Individual skin diseases varied in size from 0.38% of total burden for dermatitis (atopic, contact, and seborrheic dermatitis), 0.29% for acne vulgaris, 0.19% for psoriasis, 0.19% for urticaria, 0.16% for viral skin diseases, 0.15% for fungal skin diseases, 0.07% for scabies, 0.06% for malignant skin melanoma, 0.05% for pyoderma, 0.04% for cellulitis, 0.03% for keratinocyte carcinoma, 0.03% for decubitus ulcer, and 0.01% for alopecia areata. All other skin and subcutaneous diseases composed 0.12% of total DALYs.
Skin and subcutaneous diseases were the 18th leading cause of global DALYs in Global Burden of Disease 2013. Excluding mortality, skin diseases were the fourth leading cause of disability worldwide.
So there is a need to help people worldwide with skin disease. Therefore, the idea of this application
arises. This application helps people to get to know which disease they are going through.
Patient need to sign up to this application for running diagnose test. After signing up, they
have to upload a microscopic image of the area where they have symptoms. Using deep learning, this
application will predict the disease they are suffering from. Patient need to be signed in to run this test.
Our algorithm identifies 7 diseases, which are:


WITNESS LIST Environmental Regulation Committee March 22, 2005-8:00A HB 680 For: Hadden, Karen (Sustainable Energy and Economic Development Coalition) Schneider, Robin (Tx Campaign for the Environment) Against: Fisher, Jon (Tx Chemical Council) Miksa, Mary (Tx Assoc. of Business) Morphew, Cindy (Tx Oil and Gas Assoc.) Moyer, Liz (American Electronics Assoc.) Newton, Jennifer (Associated General Contractors of Tx Highway, Heavy Utilities and Industrial Branch) Stewart, Mike (Tx Aggregates & Concrete Assoc.) HB 1780 For: Hadden, Karen (Sustainable Energy and Economic Development Coalition) Kramer, Ed (Self) Schneider, Robin (Tx Campaign for the Environment) Steidinger, Jimmie (Citizens Against Landfill Location) Against: Fisher, Jon (Tx Chemical Council) Miksa, Mary (Tx Assoc. of Business) On: Fink, Rebecca (Tx Chapter of Solid Waste Assoc. of North America) HB 1880 For: Schneider, Robin (Tx Campaign for the Environment) Against: Fisher, Jon (Tx Chemical Council) On: Gonzalez Gromatzky, Lydia (Tx Commission on Environmental Quality) HB 1900 For: Morphew, Cindy (Tx Oil and Gas Assoc.) Mullin, Patrick (Exxon Mobil Corp.) Mullin, Patrick (Tx Assoc. of Business) Mullin, Patrick (Tx Chemical Council) Mullin, Patrick (Tx Oil and Gas Assoc.) Strother, Stephanie (Assoc. of Electric Companies of Tx) Against: O'Brien, Beth (Public Citizen) HB 1987 - Committee Substitute (Howard) For: Newton, Chris (Tx Petroleum Marketers and Convenience Store Assoc.) On: Hardee, Jackie (Tx Comm. on Environmental Quality) HB 2129 For: Culver, Anne (Greater Houston Partnership) Smith, Tom "Smitty" (Public Citizen) Vasquez, Michael (Tx Clean Air Working Group) HB 2411 - Committee Substitute (Kuempel) For: Smith, Tom "Smitty" (Public Citizen) HB 2481 - Committee Substitute (Kuempel) For: Alvarez, Ramon (Environmental Defense) Culver, Anne (Greater Houston Partnership) Culver, Anne (Tx Clean Air Working Group) Glacken, Shawn (Assoc. of Electric Companies of Tx) Harris, Ron (Collin County and North Texas Clean Air Steering Committee) LaBoon, Bruce (Greater Houston Partnership) LaBoon, Bruce (Tx Environmental Research Consortium) Miksa, Mary (Tx Assoc. of Business) Moyer, Liz (Texas Instruments) Newton, Jennifer (Associated General Contractors of Tx Highway, Heavy Utilities and Industrial Branch) Oneacre, Amanda (Greater Dallas Chamber) Smith, Tom "Smitty" (Public Citizen) Against: Green, Renee (Bexar County) On: Matthews, Jim (North East Tx Air Care) Schanbacher, David (Tx Commission on Environmental Quality) HB 2510 For: Snowden, Jeff (Tx Onsite Wastewater Assoc.) On: Franco, Tony (Tx Comm. on Environmental Quality) HB 2758 For: Combs, Susan (Tx Dpt. of Agriculture) Fisher, Jon (Tx Chemical Council) Miksa, Mary (Tx Assoc. of Business) Morris, James (Self) Moyer, Liz (American Electronics Assoc.) Riley, John (National Solid Wastes Management Assoc., Tx Chapter) Seals, Paul (Self) Against: Brown, Christopher (National Wildlife Federation) Hadden, Karen (Sustainable Energy and Economic Development Coalition) Lenz, Carole (Harris County Precinct 3 Commissioner Steve Radack) Newman, Paul (Harris County, Pollution Division, Public Health and Environmental Services) O'Brien, Beth (Public Citizen) Oldham, Melanie (Self) Reed, Cyrus (Lone Star Chapter, Sierra Club) Schneider, Robin (Tx Campaign for the Environment) Sisk, Cathy (Harris Co. Attorney and Harris County)


{% extends "security/base.html" %} {% from "security/_macros.html" import render_field_with_errors, render_field, render_field_errors %} {% block content %} {% include "security/_messages.html" %}
{{ _("Open your authenticator app on your device and scan the following qrcode to start receiving codes:") }}


--- layout: page permalink: "/community-commissioned/transforming-spaces/" ---
I was commissioned to work with young people in the hospital. Using their vivid imaginations, they were encouraged to transform familiar hospital areas into personal, magical spaces using digital cameras and software. Together we created an interactive book aimed at patients between 3 and 10 years. The images here show some of their pages.


authenticate
Username:
user_id:
Password:
read_write_key:
create new user
Username:
Password:
Load Defaults:
Note: "auth" info injected into requests before sending, based on login credentials above. "auth" format as follows:
{"auth":{"key":abcdefg1234567, "user_id":123}, ... (the rest of the JSON object...) }
create
update
get
delete
custom
Result:
(No Requests made)


Sass is a CSS pre-processor, the most mature, stable, and powerful professional grade CSS extension language in the world; adding features that allow variables, mixins, functions. Bootkit supports Sass.
Sass Files are found under build/sass
sass
│
├── styles
│ ├── mixins/
│ └── *.scss
│
└── main.scss
In styles folder, you can remove whats not necessary and build yout own custom css.
| Name | Description |
|---|---|
| alerts.scss | Bootstrap alert messages over-written classes |
| aside-right.scss | Right sidebar related styles |
| button.scss | Over-written classes and dropdown for bootstrap button |
| calendar.scss | Calendar plugin |
| chart-rickshaw.scss | Chart Rickshaw related |
| ckeditor.scss | CkEditor over-written classes and ids |
| colors.scss | Color helper classes |
| components.scss | Components over-written classes, ex: i-check |
| dropdowns.scss | User dropdown and Bootstrap dropdown over-written classes |
| forms.scss | Bootstrap form element and wizard form over-written classes |
| invoice.scss | Invoice related classes |
| labels.scss | Color helper classes for label component (not form label tag) |
| layout.scss | Main layout related classes. Includes header, footer, navbar, sidebar and responsive styles |
| login.scss | Login (Signin) page related styles |
| mailbox.scss | Mailbox app layout related styles. |
| mixins.scss | Scss mixins (all mixins imported in this file) |
| navs.scss | Navbar related styles |
| note.scss | Note app layout styles |
| notifications.scss | Notification box related styles |
| pager.scss | Bootstrap pager over-written classes and custom styles |
| pagination.scss | Bootstrap pagination over-written classes and custom styles |
| panels.scss | Bootstrap panel over-written classes and custom styles |
| profile.scss | Profile related classes and styles |
| select2.scss | jQuery Select2 over-written classes |
| tabs.scss | Bootstrap tabs over-written classes |
| tagsinput.scss | Dynamic tag input over-written classes and custom styles |
| timeline.scss | Timeline component related styles |
| timepicker.scss | Bootstrap timepicker over-written classes and custom styles |
| toastr.scss | Toastr over-written classes and custom styels |
| type.scss | BooKit base typograhpy setup |
| upload.scss | File upload over-written classes and custom styles |
| utilities.scss | Utility (helper) class collection |
| variables.scss | BootKit Scss variables |
| widgets.scss | Widget related styles. Incudes high chart, spark line, nestable, short states etc |


EMPLOYMENT HISTORY
Mock Table Games Dealer
WEST COAST ENTERTAINMENT - SEATTLE, WA
10/10/2013 to PRESENT
Provide excellent fun and lasting memories for fundraisers and corporate parties by effectively dealing table games. Math skills nearly impeccable, attitude is great.
Building Manager
CLOUSTON PROPERTIES LLC - SEATTLE, WA
9/8/2013 to 10/26/2015
Provided property management, maintenance and grounds keeping while keeping costs at a minimum. Responsibilities included leasing homes and collecting rents, housekeeping, apartment turns, plumbing, electrical work, landscaping, and superior customer service. Effectively handled situations such as an all building lock change due to a burglary. Only three move outs in two years, all due to job relocation. Performed all duties to keep 94 year building running smoothly, with no staff and nominal budget to work with. Acquired and hired contractors when necessary. Increased owner rental income by $5,000 or 20% in just the two years.
Administrative
LEGACY PARTNERS - BELLEVUE, WASHINGTON
4/2014 to 6/2014
(Contract through Elwood Staffing)I was brought in to help with a smooth transition due to a owner change and/or a facility management change. Audited and organized all commercial property lease files, created a duplicate of all data, then made the move of the files. Handled change of ownership letters.
Administrative Accounting
ONLINE METALS - SEATTLE, WASHINGTON
3/6 to 3/21/2014
(Contract through Elwood Staffing)Performed verification of bill of lading, scanned and organized onto company web application format. Efficiently coded and performed multiple site data entry for billing. My speed and accuracy was so efficient, asked to complete other two divisions.
Project Coordinator
CBRE-MICROSOFT - REDMOND,WASHINGTON
7/15/12 to 3/1/2013
(Contract through Elwood Staffing)Provided support through the creation and maintenance of various projects, with special emphasis on the Performance Management System for the Real Estate and Facilities Integrator team. Assisted with the initiation of the new ROB (Rhythm of Business) tool system, MS Planner. Created training correspondence for the 360 Survey and Project Insight. Assisted with the transition from MSPKC to ProjectInsight, comparing, analyzing and entering data in order to match the two systems before MSPKC is phased out. Created and entered purchase order data in ProjectInsight. Assisted with Playbook (operating manual) development for REandF Integrator teams. Updated the appropriate SharePoint websites as needed. Assisted with uploading over 3,000 A/P documents to electronic filing portal for the Lease Administration team. Utilized Access for utility data input for all Microsoft data centers worldwide to analyze Carbon Footprint for the good of the environment.
Leasing Agent
PINNACLE PROPERTIES - SEATTLE, WASHINGTON
6/2011 to 12/31/2011
(Contract through Apple One)Assisted with management of three properties, commercial and residential. Demonstrated strong ability to build trusting relationships with residents, vendors and management. Effectively increased rents up 20%, improved community curb appeal and improved resident communication.
Assistant Property Manager
ESSEX PROPERTY TRUST - NEWCASTLE,WASHINGTON
11/2009 to 5/2010
Responsible for all aspects of property operations, under the direction of the Property Manager. Particular emphasis on administration of the property operations and rental office, supervision, where applicable, of rental staff and marketing operations. Assisted in monitoring the financial operations of the property to meet the goals of the operating budget. Maintained 97% occupancy. Processed monthly rents, posting and bank deposits.
Leasing Consultant
BRE PROPERTIES, INC. - REDMOND, WASHINGTON
10/2007 to 2/2009
Attracted prospective residents through sales and marketing campaigns, which included greeting callers, follow-up with guest and visitor inquiries, and touring and showcasing community advantages and amenities. Reorganized and audited lease files for the Trails of Redmond, a 423 unit property. Floated to Shadowbrook, a 416-unit property.
Retail Development Coordinator
COINSTAR, INC. - BELLEVUE, WASHINGTON
3/1998 to 5/2001
Analyzed and compiled sales and performance reports for key clients. Interfaced with programmers and created databases and innovative presentation materials for national sales team. Designed, negotiated and managed production of promotional gifts for distribution to clients. Assisted sales team in execution of client contracts. Coordinated travel, conference and leisure arrangements for the sales team. Created a new style of reporting utilizing graphics, to clients, and presented and trained the sales team as necessary.
Sales and Marketing Administrative Assistant - before promotion.Provided full administrative support for sales managers and national sales team, which was comprised of twelve Account Executives handling over 3,000 clients. Created new position and promoted in one year.
Tour Inventory Specialist
HOLLAND AMERICA LINE-WESTOURS - SEATTLE, WASHINGTON
4/1994 to 3/1998
Responsible for the negotiation, execution and fulfillment of contracts with hotels utilized by the cruiseline for ports of call. Reported on sales and year-end results for presentation to groups of 5-15 executives. Performed light programming within the company databases. Budgeted and performed room inventory forecasting for hotel room bookings with an 85-95% utilization rate. Acted as temporary supervisor for seven person department while supervisor was out on leave from 8/97 to 1/98.
EDUCATION and TRAINING
HAWAII PACIFIC UNIVERSITY - HONOLULU, HAWAII
8/88 - 6/1993
Bachelor of Science in Business Administration, Travel Industry Management Major, Dean's List,1992-93


{% extends "django_registration/base.html" %} {% load bootstrap3 %} {% load static %} {% block content %}
Password or Username is incorrect
Don't have an account? Sign up.


[gecode-users] BoolVars, Intvars and Channeling
David Przybilla
paranoic.pum at gmail.com
Sun Oct 26 05:22:51 CET 2008
In gecode 1 it was possible to use BoolVars and IntVars interchangeably,
that means that a function which received a BoolVar could receive an Intvar
and a function which received an IntVar could received a BoolVar as an
argument.
Im porting a library from gecode 1 to Gecode 2
The solution I had found for these function callings is to create a new
variable and post a channeling constraint
I wonder if there is another way to achieve this, and if posting this new
constraint would affect the performance.
Thank you in advance.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.ps.uni-sb.de/pipermail/users/attachments/20081025/90da45b4/attachment.htm>
More information about the gecode-users
mailing list


British Airways flights delayed due to 'technical issue'
British Airways flights are being disrupted due to a "technical issue", the airline has said.
The airline said some flights have been affected and accommodation has been offered where customers have been unable to fly overnight.
Flights to and from the UK's two busiest airports, Heathrow and Gatwick, appear to be among those affected.
By 9am on Thursday, 45 flights due to land at Heathrow had been delayed by more than 45 minutes.
The worst affected was Flight BA170 from Pittsburgh, in the US, which was more than 12 hours behind schedule.
Customers have complained of delays of several hours on Twitter and the airline says it is working on resolving the issue as soon as possible.
One customer tweeted that they had been seated on a plane for three hours without taking off and without any food provided for their children.
Sorry, this content isn't available on your device.
A British Airways spokesperson said: “Our teams are working hard to resolve a technical issue which is affecting some of our flights, and we have rebooked customers onto alternative flights and offered hotel accommodation where they have been unable to continue their journeys last night.
“We are very sorry for the disruption to their travel plans.
“We are advising customers to check ba.com for the latest flight information and to ensure that contact details are up to date on their booking, so that we can provide the latest information.”
- British Airways told to ‘sort out mess’ after error over flight cancellations
- British Airways sorry for 'email error' informing wrong customers of flight cancellations
Customers were urged to check ba.com for latest flight information and ensure their contact details are up to date on their booking.
It is the latest in a series of systems failures suffered by the airline in recent months.
In August, an IT glitch caused the cancellation of more than 100 flights and disrupted the travel plans of tens of thousands of passengers.
Rory Boland, editor of Which? Travel magazine, said: "This is the latest in a long line of British Airways technical glitches causing delays and cancellations and yet again it's thousands of passengers who are paying the price - left tired, frustrated and with a lack of information and assistance from the airline.
"BA must do the right thing and reroute passengers as quickly as possible, using other airlines where necessary, as well as informing customers facing disruption about their entitlement to compensation."


--- layout: post title: Smoky and Spicy Chicken Tinga Is the Ultimate One-Pot Taco Filling date: 2016-12-23 15:25:29.000000000 -05:00 type: post parent_id: '0' published: true image: assets/images/post-img/6D517A0E-E45B-4F6D-9C5F-AB669EAA48F5-768x768.jpg status: publish categories: - Chicken - Mexican-Latin-Hispanic tags: - Our Photo - We liked this - We tried this meta: _wpas_done_all: '1' _wpghs_github_path: _posts/2016-12-23-smoky-and-spicy-chicken-tinga.md _sha: dacb814d6fa7d8d9f7fc78ffd278c051b136444b _edit_last: '1' _thumbnail_id: '535' _jetpack_dont_email_post_to_subs: '1' _posts_by_tag_page_fields: a:2:{s:12:"widget_title";s:0:"";s:11:"widget_tags";s:0:"";} _wp_old_slug: smoky-and-spicy-chicken-tinga-is-the-ultimate-one-pot-taco-filling _yourls_url: http://7t3.link/em02u _yourls_clicks: '10' author: login: mkelley email<EMAIL_ADDRESS>display_name: Mike first_name: Mike last_name: Kelley ---
Here's chicken tinga at its most basic: Simmer chicken breasts or thighs with tomatoes, onions, and aromatics in water. Purée the tomato and onions with chipotle chilies. Shred the chicken, and stir it all together. It's tasty made this way, but I wondered if I could improve it with just a few minor tweaks, while not making the recipe significantly more inconvenient.
Source: Smoky and Spicy Chicken Tinga Is the Ultimate One-Pot Taco Filling
I tried this out and added sweet potatoes. Great recipe and great tasting.


This is a paragraph, and as such uses the browser’s default font (because there are no other author styles being applied to this document). This is usually, as it is here, a serif font of some variety.


This important and fabilous text is formatted using b and i tags.
And this text is formatted using sup and sub tags.
This text is
broken is br tag.
And after this text comes a horizontal line using hr tag
This fancy text uses semantic tags to basically do the same thing.
This text is no longer relevant and thus is deleted


Edison is a physicist currently preparing in machine learning. He considers himself a focused person and someone is worth it to work with.
Edison has a trasversal education. He has a background in mathematics and physics, he started to interact with the software and hardware world while being teacher assistant on his university where worked and learned electronics and Internet of Things for 2 and a half years.
These last two years (2020-2021), Edison has been focused on learning Software development basis as: Data structures, algorithms, C programming, Python, OOP, Linux, Systems Engineering/Devops and more. Especially since the end of the last year, he has been training on Machine Learning (ML) topics like Neural networks, computer vision, Hidden Markov models, Gaussian processes.
He worked as a software developer for 2 months at Truora, for a project in the academy he is studying. There, he worked developing an anonymous forum applying technologies as Vue, Aws services, Golang and Javascript. There, he experienced the work dynamics on a real company.
Finally, Edison expects finishing his studies on ML at the end of september. He is interested on AI companies and is open to remote work, feel free to contact him and thanks for your time.
Development of a web forum:
Development of a web forum:
Topics seen there considered relevant for Machine Learning:
Building in C language a replica of the printf function of standard library.
View ProjectCreation of clone of an early version of AirBnB page using MySQL, Flask, Python, HTML, CSS, JavaScript.
View Project


Brook
Jordan
A software engineer with deep understanding of JavaScript, CSS, and HTML alongside a background in design, illustration, and animation. I excel in frontend architecture, componentisation, and design systems – keeping: codebases efficient and maintainable; teams focused and excited; and projects accessible and punctual.
Employment history
Motional
Senior Software Engineer
Front-end
Leading the front-end build, tests, and deployment of the Command Center application.
Live data using a combination of polling and websockets, where appropriate.
Maps using Google Maps, then MapBox.
People
Worked closely with a design intern to release new project.
Mentored intern to develop system to create and control simulated vehicles.
Mentored a second intern to expand that previous system to control real vehicles from the cloud.
Architecture
Put forward the usecase of new design system.
Built it out while working on new features.
Gradually back-ported old projects to the new system.
Work closely with back-end to encourage consistent APIs for internal and external use.
TradeGecko
Software Engineer
Core application
Championing UX architecture, componentisation, and frontend architecture. Rapidly prototyping, then converting to highly-polished MVPs, taking into consideration speed-to-production, developer happiness, and end-user accessibility. Work included in-depth code reviews, technical documenting, and refactoring code reactively and proactively to prevent bottlenecks.
Marketing website
I built and maintained the marketing website by building custom tooling on top of HubSpot. I ensured the system was quick and easy to update; that analytics and SEO gave an accurate representation of our audience; and load times were fast.
People
After some time the core app demanded I worked on it fulltime and I couldn’t spend time on the marketing site, so I began mentoring a junior for the marketing site. This carried forward to me similarly mentoring other team members from the engineering team, with regular pairing and conversations.
Win Technologies
Software Engineer
Under the Betway brand: I started by polishing up the Bingo website, then quickly moved to lead the new white-label gaming website. Together we made a portal that tailored itself to the needs of multiple brands.
Perform Group
Web developer
Leading live streaming website projects, CMS integrations, curated data feeds, and technical documentation.
Junior web developer
After three months of teaching myself web development: Perform Group, excited by my passion for the role, gave me a shot as a junior developer. In less than a year I was leading teams for the Norwegian Eliteserien and OBOS-ligaen.
Research Now
Graphic design intern
This is where my journey into web dev began. After learning Flash on-the-job while hitting deadlines I was asked to create an email. This hooked me in and I started learning web dev on my 2-hour commute.
Technical Skills In order of preference
-
CSS: SCSS, Vanilla
-
Frontend JavaScript: Vanilla, React, Ember
-
HTML: Accessibile
-
Node: Express, Vanilla
-
SQL: MySQL, PostgreSQL
Formal Education
-
BA Illustration with Animation: Manchester Metropolitan University
-
Arts Foundation: University of Lincoln
Hobbies & interests
Travel
A revelation, as before leaving the UK around 5 year ago, I hardly left the house. Moving to Singapore has opened my eyes to travelling and I have been trying to get to new countries at least every couple of months. Activities while abroad include diving, hiking, and meeting new people.
Art
I still enjoy life-drawing and try to go to classes to keep my drawing sharp. During down-time you could find me sketching or folding a paper animal.
Computers
Most of my spare time is spent with computers, and electronics: learning new things and immersing myself in their world.
Gaming
The progressive problem-solving nature of real-time strategy games makes them my ‘go-to’, but I also enjoy casual action and fps games to wind-down with.
Guitar & recording
Having taught myself guitar while at University, I enjoyed recording sessions in my bedroom... all parts played by yours-truly. However, these days I tend to keep my playing more to myself.
Photography
I am familiar with modern DSLR cameras, but as I generally take photos while out-and-about I stick mostly to point-and-shoot cameras or my Phone. As I started diving I’m currently enjoying the Olympus TG-5.


---
layout: default
title: "TTWeb - Admin Dashboard Template"
parent: "dashboard"
sub_parent: ""
activePage: "index"
plugins: ["chart_js", "vector_map", "date_range_picker", "toastr"]
---
{% include top-stats.htm %}
{% include sales-graph.htm %}
{% include revenue-donut-chart.htm %}
{% include sales-overview-graph.htm %}
{% include top-sold-table.htm %}
{% include notification.htm %}
{% include recent-order-table.htm %}
{% include to-do-list.htm %}
{% include area-chart.htm %}
{% include new-customers.htm %}
{% include top-products.htm %}


My name is Steven Bender, I was born in Fargo, North Dakota. My dad went to NDSU and after he graduated we moved to Kansas City. I have lived here for most of my life so my favorite teams are from Kansas City, other than Hockey.  Going to live music is something I really like to do also.
I have never done any type of coding before joining this program.


{% if registration.offices and registration.offices.businessOffice %}
|
Mailing Address
{{ registration.offices.businessOffice.mailingAddress.streetAddress }}
{{ registration.offices.businessOffice.mailingAddress.streetAddressAdditional }}
{{ registration.offices.businessOffice.mailingAddress.addressCity }}
{{ registration.offices.businessOffice.mailingAddress.addressRegion }}
{{ registration.offices.businessOffice.mailingAddress.postalCode }}
{{ registration.offices.businessOffice.mailingAddress.addressCountry }}
{{ registration.offices.businessOffice.mailingAddress.deliveryInstructions }}
|
{% endif %}
{% if registration.offices.businessOffice.deliveryAddress %}
Delivery Address
{{ registration.offices.businessOffice.deliveryAddress.streetAddress }}
{{ registration.offices.businessOffice.deliveryAddress.streetAddressAdditional }}
{{ registration.offices.businessOffice.deliveryAddress.addressCity }}
{{ registration.offices.businessOffice.deliveryAddress.addressRegion }}
{{ registration.offices.businessOffice.deliveryAddress.postalCode }}
{{ registration.offices.businessOffice.deliveryAddress.addressCountry }}
{{ registration.offices.businessOffice.deliveryAddress.deliveryInstructions }}
|
{% endif %}


Empowers the individuals to become their own designers
Current photo-sharing platforms have static images that do not provide context to the photo.
For our customers, fashion is more than just articles of clothing – it’s a statement.
Fashion is the sum of common trends yet it speaks individuality.


Alert readers will have noted the appearance (thrice) of a crest or emblem at the top of the page. This is taken from the pamphlet Dobson's Heraldic Dossier, a bewildering little booklet which the great pamphleteer had specially printed on an antique press which Marigold Chew discovered rotting away in a blizzard-swept tent on the outskirts of Helsinki during her tour of Finland. Dobson writes in hallucinatory prose about what he calls “the new heraldry” which he planned to usher in, and provides a number of examples of his own devising, though it is thought that the artwork itself was completed by Chew. [...]


|
Figure 1
|
Hurricane peak season (August, September, and October, ASO) ... |
|
Figure 2
|
Vertical wind shear from left panels: CMIP5 multi-model mean ... |
|
Figure 3
|
( a) CMIP5 multi-model mean vertical wind shear for historic ... |
|
Figure 4
|
Global pattern of VWS difference between 2070–2099 and 1971– ... |


If I make a
$200
$500
$1000
$5000
inventment today.
then a
$200
$500
$1000
$5000
investment per month
how are we looking after
5
5
10
25
10K
years
Compare now


[gecode-users] AllDiff_except_0
Guido Tack
guido.tack at monash.edu
Tue Oct 27 10:54:45 CET 2015
Hi,
you don’t need a loop. Look for the count constraint that takes an IntVarArgs and an IntSetArgs as arguments, that does exactly what you need in a single constraint. It propagates bounds and domain consistency (depending on the IntConLevel argument) so it’s a perfect replacement for alldifferent_except_0.
Cheers,
Guido
--
Guido Tack
http://www.csse.monash.edu/~guidot/ <http://www.csse.monash.edu/~guidot/>
> On 27 Oct 2015, at 8:18 PM, mehdi m <medistif at hotmail.fr <mailto:medistif at hotmail.fr>> wrote:
>
> Hi,
>
> Ok.
> For the moment i did it with cardinality constraint (count) with an upper bound of 1, but i do not know how far the propagator is really strong since i put it in a loop for every possible value except 0 !
>
> It will be useful to put the AllDiff_except_value constraint in the Gecode’s wishlist.
>
> Cheers,
> Mehdi M
> --------------
> To: users at gecode.org <mailto:users at gecode.org>
> From: jean-noel.monette at it.uu.se <mailto:jean-noel.monette at it.uu.se>
> Date: Tue, 27 Oct 2015 09:44:30 +0100
> Subject: Re: [gecode-users] AllDiff_except_0
>
> Hi,
>
> Another way to do it is to use a global cardinality constraint (called "count" in Gecode) with an upper bound of 1 for all values, except 0 for which you put any suitable large value. This requires to know the list of possible values in advance.
>
> Cheers,
>
> JN
>
> On 2015-10-27 09:38, Christian Schulte wrote:
> Hi,
>
> No, unfortunately not. If you need it really badly, I could put it on Gecode’s wishlist.
>
> For the time being, you would have to resort to using reification.
>
> Cheers
> Christian
>
> --
> Christian Schulte, www.gecode.org/~schulte <http://www.gecode.org/~schulte>
> Professor of Computer Science, KTH, cschulte at kth.se <mailto:cschulte at kth.se>
> Expert Researcher, SICS, cschulte at sics.se <mailto:cschulte at sics.se>
>
> From: users-bounces at gecode.org <mailto:users-bounces at gecode.org> [mailto:users-bounces at gecode.org <mailto:users-bounces at gecode.org>] On Behalf Of mehdi m
> Sent: Monday, October 26, 2015 08:26 PM
> To: users at gecode.org <mailto:users at gecode.org>
> Subject: [gecode-users] AllDiff_except_0
>
> Hi everyone,
>
> Is there the constraint (AllDiff_except_0) in gecode ?
>
> Thanks.
>
>
> _______________________________________________
> Gecode users mailing list
> users at gecode.org <mailto:users at gecode.org>
> https://www.gecode.org/mailman/listinfo/gecode-users <https://www.gecode.org/mailman/listinfo/gecode-users>
>
>
> _______________________________________________ Gecode users mailing list users at gecode.org <mailto:users at gecode.org> https://www.gecode.org/mailman/listinfo/gecode-users <https://www.gecode.org/mailman/listinfo/gecode-users>_______________________________________________
> Gecode users mailing list
> users at gecode.org <mailto:users at gecode.org>
> https://www.gecode.org/mailman/listinfo/gecode-users <https://www.gecode.org/mailman/listinfo/gecode-users>
--
Guido Tack,
http://www.csse.monash.edu/~guidot/
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.gecode.org/pipermail/users/attachments/20151027/4e002234/attachment.html>
More information about the users
mailing list


---
layout: default
title: Home
---
Vsevolod Glumov
Web application developer (
CV). Python hacker.
GitHub activist. Productivity junkie and Beeminder nerd.
Coffee addict. Hebrew enthusiast.
Current Projects
- Maintainer @ Data-Driven-Tests.
Django package that allows you to multiply one test case by running it
with different test data, and make it appear as multiple test cases.
- Creator @ Gradient Daily.
Small artsy project I made out of curiosity, it generates a gradient image
and uploads it to Instagram every day.
- Contributor @ Flask-RESTful.
Flask extension that provides the building blocks for creating a great REST
API.
- Contributor @ django-cities-light.
An add-on that provides models and commands to import country, region/state,
and city data in your database.
Twitter
Featured Writings


Down To You A Film Review By Geoff Berkshire
Cast: Freddie Prinze Jr., Julia Stiles, Shawn Hatosy, Zak Orth, Selma Blair, Rosario Dawson, Henry Winkler, Lucie Arnez, Ashton Kutchner Director: Kris Isacsson
Late in Down To You, the lead female character (Julia Stiles) states her greatest fear is having an "artificial conversation" with her boyfriend (Freddie Prinze Jr.). The irony of this statement will not be lost on audience members who have not yet walked out, fallen asleep, or otherwise given up on this pathetic attempt at romantic comedy. The film is a multi-million dollar testament to everything artificial. Filled with characters, motivation, plot and dialogue that ring fake and shallow at every step this is an unquestionable disaster.
Prinze plays a college student intent on playing the field until he falls for Stiles' freshman co-ed. At first the movie seems to be an attempt to string along scenes with the sole purpose of out-doing the previous in how "cute" it can be. The happy couple "psychoanalyze" each other; they pick out a song because, as Prinze's DJ mother (Lucie Arnez) explains, every couple needs a song; he smells her shampoo; she scratches his chest in the morning to let him know she wants to make love.
Then, in standard romantic comedy style, things fall apart. Why? Well, because they have to. Otherwise the couple can't make up and live (presumably) happily ever after.
Down To You exists outside the realm of normal logic.  A picnic scene involving the six key characters is just bizarre, not only for the stretched logic of these people hanging out together, or even knowing each other, but mostly because an unusual amount of screen time is dedicated to a goat.
The supporting characters are remarkably flat, and insultingly ridiculous as well.  He is one of those famous porn stars who is frequently interviewed on television, does the college lecture circuit, and stars in high budget costume epic porns that are shot on film.
Attempts at drama (which means Julia is going to cry) include a pregnancy scare and the big break up. These characters are so insipid only the most forgiving viewer would be manipulated by these weak scenes.
What happened here? The cast is full of likable, promising, young actors (Stiles especially seems to be going places). Writer/director Kris Isacsson has simply given them material so weak not even seasoned pros could pull it off. In fact the whole film feels like a reworking of last year's extremely unpleasant The Story of Us, for teen audiences.
The direction is film-school-grad obvious. It's stylish in a hugely self conscious way which throws in split screen, a pointless parody of "Cops," characters walking into the flashbacks of other characters, and a hilariously cheesy airport meeting between Prinze and Stiles where all the extras move in fast motion while the couple moves in extreme slow motion. Plus, the whole story is told flashback style, narrated by Prinze and Stiles directly addressing the camera.
This is the second film in a row (following Wing Commander) starring Freddie Prinze Jr. which should have premiered on the aisles of the local Blockbuster but was likely saved from that fate due to the fluke success of She's All That. If he doesn't start making better choices fast his future films won't be so lucky.
* (out of ****)
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


{% extends 'administration/base_admin.html' %} {% load i18n %} {% block title %}{% trans "Statistics of your website" %}{% endblock %} {% block action_close %}admin.settings.cancel_form();{% endblock %} {% block content %}
{% trans "Modulo use 'Google Analytics' to analyse your traffic in real time. This tool is recognized to be extremely effective."%}
{% trans "Complete the left form with your google analytics id, and then connect on the website http://analytics.google.com to see your stats in real time." %}


XMOUSEPOS(1) XMOUSEPOS(1) NAME xmousepos - Gets and prints the current mouse position SYNOPSIS xmousepos [windowid] DESCRIPTION xmousepos is a program that gets and prints the current mouse position in the window specified by windowid or from the current window by default. The output has the form X Y U V where X - root x position Y - root y position U - mouse relative x position to the window. V - mouse relative y position to the window. SEE ALSO pat2ppm(1), patextract(1), png2pat(1), rgb2pat(1), visgrep(1). AUTHOR xmousepos was written by Steve Slaven<EMAIL_ADDRESS>This manual page was written by Kapil Hari Paranjape<EMAIL_ADDRESS>for the Debian project (but may be used by others). 15 December 2007 XMOUSEPOS(1)


Menu
ZANIMO.JS EDITOR
create, store and share animations
EDITOR HELP
A script is the body of a function with the following arguments:
- Q
- the Q library, documentation
- Zanimo
- the Zanimo library
- Qajax
- the Qajax library, documentation
- Qimage
- the Qimage library, documentation
- randomColor
- generate random colors, documentation
- create
- helper for creating dom elements and appending them to the document body
- width
- the width of the viewport in pixel
- height
- the height of the viewport in pixel
the function must return a promise.
EDITOR SHORTCUTS
⌘+S: Save current script
⌘+E: Run current script
ZANIMO CHEAT SHEET
Zanimo(el | promise[el])
➜ promise[el]
Takes a dom element or a promise of a dom element and returns a promise of it.
Zanimo(
el,
attr,
value
) ➜ promise[elt]
Applies a css style on the given DOM element.
Zanimo(
el,
property,
value,
duration,
[easing]
) ➜ promise[el]
Start a css `property` transition with value `value` on the dom element `el` with a duration of `duration` ms and a optional timing function `easing`.
Zanimo.f(*)
➜ function(elt) ➜ promise[elt]
Encapsulates a `Zanimo(el, *)` call by returning a function (el) ➜ promise[el]. Useful to define reusable transitions.


The tests given below are for evaluating the reading experience with the chosen assistive technology tool such as the Screen Reader or Refreshable Braille Display. Do not perform the tests given in this chapter using the Read Aloud feature of the Reading System.
Focus on the beginning of a paragraph or a sentence and initiate reading. Reading should continue until interrupted by the user, or the end of the document is reached. or at the end of the current document, e.g. current chapter.
The text being read should preferably remain in view, but this is not a requirement to pass the test.
Indicate Pass or Fail.
Indicate Pass or Fail.
Sample text has been provided to test the reading order. The Paragraph 2 should be read after Paragraph 1. Note that visually Paragraph 2 is placed to the left of Paragraph 1 but it is second in the reading order.
Indicate Pass or Fail.
Paragraph 1: Mother's Day is a celebration honoring mothers and motherhood, maternal bonds, and the influence of mothers in society. It is celebrated on various days in many parts of the world, most commonly in the months of March or May. It complements similar celebrations honoring family members, such as Father's Day and Siblings Day.


Sections
The New York Times
Sections
Home
World
U.S.
Politics
N.Y. / Region
Business Day
Technology
Sports
Opinion
Science
Health
Arts
Style
Autos
Books
Dining & Wine
Education
Fashion & Style
Home & Garden
Media
Movies
Music
Obituaries
Real Estate
T Magazine
Television
Theater
Travel
Weddings / Celebrations


C2Serve is distributed under the terms of the BSD license.
This means that this software is free for commercial use and that you can modify the source code to fit to your own needs.
Copyright (c) 2012, C2Serve (http://www.c2serve.eu)
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
-
Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
-
Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
-
All advertising materials mentioning features or use of this software
must display the following acknowledgement: "This product includes software of the C2Serve project".
-
Neither the name of the C2Serve project nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.


Array of field objects.
Object, default = []
For each input or select control in the HTML template of the form, you need to define a corresponding object in the
fields array. A field object has following structure:
The form supports all types that $().w2field({}) supports and few more types in addition. The complete list of all types are:
- text
- textarea
- email
- pass
- password
- int
- float
- money
- currency (alias for money)
- percent
- hex
- alphanumeric
- color
- date
- time
- list
- combo
- enum
- file
- select
- radio
- checkbox
- toggle
If your HTML template is defined as :
And you have a container:
The form definition will be:
Please note that the name of the input control in the HTML template must match the name of the field. (case-sensitive). See
fields section for more information about field types.


When you traverse a set, you use an iterator, just as you do with lists. Thus, the simple program simple_set.cpp employs a set to sort the lines of standard input:
#include <set> #include <iostream> using namespace std; main() { string s; set <string> names; set <string>::iterator nit; while(getline(cin, s)) names.insert(s); for (nit = names.begin(); nit != names.end(); nit++) { cout << *nit << endl; } } |
To repeat, instead of using push_back(), like you do with lists or vectors, you use insert(), which puts the string into the right place. The traversal is exactly like traversing a list.
UNIX> cat input-1.txt Jack Journey Mackenzie Olympia James Splotch Dylan Ache UNIX> simple_set < input-1.txt Dylan Ache Jack Journey James Splotch Mackenzie Olympia UNIX>The first question you should have is: "What about duplicate entries?" For example, let's try input-2.txt, which has two duplicate entries:
UNIX> cat input-2.txt John Bevy Xavier Ornately Nicholas Wyatt Fecund Max Inadvertent III John Bevy Max Inadvertent III UNIX> simple_set < input-2.txt John Bevy Max Inadvertent III Nicholas Wyatt Fecund Xavier Ornately UNIX>As you can see, it does not insert duplicates. If you want to allow duplicates, you use a multiset, as in simple_multiset.cpp. The only difference with this program is the declaration of names and nit:
multiset <string> names; multiset <string>::iterator nit; |
Everything else is the same, and the duplicate entries each get their own entry in the multiset:
UNIX> simple_multiset < input-2.txt John Bevy John Bevy Max Inadvertent III Max Inadvertent III Nicholas Wyatt Fecund Xavier Ornately UNIX>We can use the find() method of a set or multiset to see if an element is in the set or multiset. This is done in log time, which means very fast -- much faster than traversing all elements of the set to find it. Find() returns an iterator to the element in the set if it is found. If it is not in the set, it returns an iterator that equals the end() method.
Here's an example in simple_set_find.cpp:
#include <set> #include <fstream> #include <iostream> #include <cstdlib> using namespace std; main(int argc, char **argv) { string s; ifstream f; set <string> names; if (argc != 2) { cerr << "usage: simple_set_find file\n"; exit(1); } f.open(argv[1]); if (f.fail()) { perror(argv[1]); exit(1); } while(getline(f, s)) names.insert(s); f.close(); while (1) { cout << "Enter a name: "; cout.flush(); // Don't worry about this too much -- I do this // to make sure that the string is printed to the screen. // Sometimes, partial lines aren't printed immediately, // and cout.flush() forces the partial line to be printed. if (!getline(cin, s)) exit(0); if (names.find(s) == names.end()) { cout << s << " is not in the set.\n"; } else { cout << s << " is in the set.\n"; } } } |
The program reads a file and puts each line into a set. It then reads lines from standard input and prints whether the line is in the set. For example:
UNIX> cat input-3.txt Madelyn Psychotic Joseph Halverson Aidan Pooh Bailey Cycad Wyatt Advantageous UNIX> simple_set_find input-3.txt Enter a name: Aidan Pooh Aidan Pooh is in the set. Enter a name: Jim Plank Jim Plank is not in the set. Enter a name: <CNTL-D> UNIX>
map <string, int> names; map <string, int>::iterator nit; |
We'll write a simple example. This example assumes that input is as in Roster.txt: it is composed of first and last names of people. (Our example is all the NFL players in 2009 whose last names begin with "A", in random order). We'll use a map as declared above, and what we are going to do is keep track of the last names, and how many players have each last name. The program for this is in simple_map.cpp:
#include <stdio.h> #include <iostream> #include <string> #include <map> using namespace std; main() { map <string, int> names; map <string, int>::iterator nit; string fn, ln; while (cin >> fn >> ln) { nit = names.find(ln); if (nit == names.end()) { names.insert(make_pair(ln, 1)); } else { nit->second++; } } for (nit = names.begin(); nit != names.end(); nit++) { cout << "Last name: " << nit->first << ". Number of players: " << nit->second << endl; } } |
When you insert into a map, since you are inserting two things (a key and value), you must combine them into a pair with the make_pair() procedure. The types of the arguments must match the types specified in the declaration -- in this case, they must be a string and an integer.
The iterator for a map is different, too. Instead of simply specifying it with pointer indirection, you can grab the key from an iterator with "->first" and the value with "->second". Yes, I wish they were called key and val, but that is life. When we run it on Roster.txt, we get:
UNIX> simple_map < Roster.txt Last name: Abdallah. Number of players: 1 Last name: Abdullah. Number of players: 2 Last name: Abiamiri. Number of players: 1 Last name: Abraham. Number of players: 1 Last name: Adams. Number of players: 7 .....We can check for correctness with grep:
UNIX> grep Abdallah Roster.txt Nader Abdallah UNIX> grep Adams Roster.txt Gaines Adams Jamar Adams Anthony Adams Michael Adams Titus Adams Flozell Adams Mike Adams UNIX> grep Adams Roster.txt | wc 7 14 90 UNIX>Like sets, you traverse the maps in ascending order, and you can't insert duplicate keys. Since simple_map.cpp calls find() and only performs insert() when the key is not found, the limitation on duplicate keys is not a problem. If you need duplicate keys, use a multimap.
#include <cstdio> #include <iostream> #include <string> #include <set> using namespace std; main() { multiset <string> names; multiset <string>::iterator nit; string fn, ln, pn; int count; while (cin >> fn >> ln) names.insert(ln); for (nit = names.begin(); nit != names.end(); nit++) { if (nit != names.begin()) { if (*nit == pn) { count++; } else { printf("%-20s %d\n", pn.c_str(), count); pn = *nit; count = 1; } } else { pn = *nit; count = 1; } } if (names.size() > 0) printf("%-20s %d\n", pn.c_str(), count); } |
Compared to the map, that's a pretty convoluted piece of code. However, make sure that you can step through it and convince yourself that it works.
UNIX> head -n 10 Roster.txt Russell Allen Gaines Adams Aundrae Allison David Anderson Adrian Arrington Hamza Abdullah Tim Anderson Devin Aromashodu Asher Allen Eric Alexander UNIX> head -n 10 Roster.txt | nnames_multiset Abdullah 1 Adams 1 Alexander 1 Allen 2 Allison 1 Anderson 2 Aromashodu 1 Arrington 1 UNIX>
#include <stdio.h> #include <iostream> #include <string> #include <set> #include <map> using namespace std; typedef set <string> fnset; main() { map <string, fnset *> lnames; map <string, fnset *>::iterator lnit; fnset *fnames; fnset::iterator fnit; string fn, ln; while (cin >> fn >> ln) { lnit = lnames.find(ln); if (lnit == lnames.end()) { fnames = new fnset; lnames.insert(make_pair(ln, fnames)); } else { fnames = lnit->second; } fnames->insert(fn); } for (lnit = lnames.begin(); lnit != lnames.end(); lnit++) { fnames = lnit->second; for (fnit = fnames->begin(); fnit != fnames->end(); fnit++) { cout << *fnit << " " << lnit->first << endl; } } } |
The program uses a map to sort the last names. The "second" field of the map is a pointer to a set, which sorts the first names that belong to that last name. When you read in a name, you check the last name to see if it's in the map. If so, then it sets fnames to be the set of first names with that last name. If not, it creates a new fnames set and inserts it and the last name into the map. Last, it inserts the first name into the set.
When it's done reading input, it does a nested traversal to print out all of the names.
Note the typedef statement to make the program read more easily.
This program will not print out duplicate names, because sets don't hold duplicate entries. If you wanted it to print out duplicate names, you would have to use a multiset.
UNIX> sort_names_1 < Roster.txt | head Nader Abdallah Hamza Abdullah Husain Abdullah Victor Abiamiri John Abraham Anthony Adams Flozell Adams Gaines Adams Jamar Adams Michael Adams UNIX>
#include <stdio.h> #include <iostream> #include <string> #include <set> #include <map> using namespace std; typedef set <string> fnset; main() { map <string, fnset> lnames; map <string, fnset>::iterator lnit; fnset fnames; fnset::iterator fnit; string fn, ln; while (cin >> fn >> ln) { lnit = lnames.find(ln); if (lnit == lnames.end()) { lnames.insert(make_pair(ln, fnames)); } else { fnames = lnit->second; } fnames.insert(fn); } for (lnit = lnames.begin(); lnit != lnames.end(); lnit++) { fnames = lnit->second; for (fnit = fnames.begin(); fnit != fnames.end(); fnit++) { cout << *fnit << " " << lnit->first << endl; } } } |
This program is very buggy.  What's going on? Well, two things. Let's concentrate on the most egregious. This is the fact that you reuse fnames to insert a name into the set, and then you use that same fnames when you insert a last name into the map. That's wrong. Let's fix that by having two fnset's: fnames, which we'll use to insert first names, and fnames_empty, which we use to put an empty set into a newly created last name map: (sort_names_bad2.cpp)
#include <stdio.h> #include <iostream> #include <string> #include <set> #include <map> using namespace std; typedef set <string> fnset; main() { map <string, fnset> lnames; map <string, fnset>::iterator lnit; fnset fnames, fnames_empty; fnset::iterator fnit; string fn, ln; while (cin >> fn >> ln) { lnit = lnames.find(ln); if (lnit == lnames.end()) { lnames.insert(make_pair(ln, fnames_empty)); lnit = lnames.find(ln); } fnames = lnit->second; fnames.insert(fn); } for (lnit = lnames.begin(); lnit != lnames.end(); lnit++) { fnames = lnit->second; for (fnit = fnames.begin(); fnit != fnames.end(); fnit++) { cout << *fnit << " " << lnit->first << endl; } } } |
This one still doesn't work:
UNIX> head -n 2 Roster.txt | sort_names_bad2 UNIX>Why? The culprit lies in these two lines:
fnames = lnit->second; fnames.insert(fn); |
The first of these lines makes a copy of lnit->second; You insert the first name into the copy, which does not modifiy the fnset that is actually in lnit->second. To fix this, you need to insert directly into lnit->second. I do this in sort_names_bad3.cpp:
#include <stdio.h> #include <iostream> #include <string> #include <set> #include <map> using namespace std; typedef set <string> fnset; main() { map <string, fnset> lnames; map <string, fnset>::iterator lnit; fnset fnames, fnames_empty; fnset::iterator fnit; string fn, ln; while (cin >> fn >> ln) { lnit = lnames.find(ln); if (lnit == lnames.end()) { lnames.insert(make_pair(ln, fnames_empty)); lnit = lnames.find(ln); } lnit->second.insert(fn); } for (lnit = lnames.begin(); lnit != lnames.end(); lnit++) { fnames = lnit->second; for (fnit = fnames.begin(); fnit != fnames.end(); fnit++) { cout << *fnit << " " << lnit->first << endl; } } } |
This works as it should:
UNIX> sort_names_1 < Roster.txt > out1.txt UNIX> sort_names_bad3 < Roster.txt > out2.txt UNIX> diff out1.txt out2.txt UNIX>So, now you say, "Ok, it works. Why can't I do this?" The answer is twofold. First, the fact that you can't have a variable point to lnit->second is not only inconvenient, it makes your programs very hard to read. Second, you'll find yourself setting variables to lnit->second and making copies when you don't have to. For example, look at the for loop that prints out the names:
for (lnit = lnames.begin(); lnit != lnames.end(); lnit++) { fnames = lnit->second; for (fnit = fnames.begin(); fnit != fnames.end(); fnit++) { cout << *fnit << " " << lnit->first << endl; } } |
It is making copies of lnit->second. Even though it's not a bug, it's extremely inefficient in terms of both time and memory. Get into the habit of using pointers in the second field of your maps.
pair<iterator, bool> set::insert(const TYPE& val); |
The "(const TYPE& val)" simply means that it works with type that you specify when you define the set.
The return value is a pair much like what you pass to the insert() call of a map. Its first field will be an iterator for the set, and the second will be a boolean. If the element is inserted, then the iterator will point to the newly inserted element. Otherwise, you tried to insert a duplicate, and the iterator is to the value already in the set. The second field reports whether the item was inserted or not.
To see usage, take a look at setreturn.cpp:
#include <set> #include <iostream> using namespace std; typedef set <string> string_set; main() { string s; string_set names; string_set::iterator nit; pair <string_set::iterator, bool> retval; while(getline(cin, s)) { retval = names.insert(s); if (retval.second) { cout << s << ": Successfully inserted.\n"; } else { cout << s << ": Duplicate not inserted.\n"; } } } |
Note how it returns a pair, whose fields you access with dots rather than arrows. Why then do you use arrows in iterators on maps? Because those iterators point to pairs -- they are not pairs themselves.
UNIX> cat input-2.txt John Bevy Xavier Ornately Nicholas Wyatt Fecund Max Inadvertent III John Bevy Max Inadvertent III UNIX> setreturn < input-2.txt John Bevy: Successfully inserted. Xavier Ornately: Successfully inserted. Nicholas Wyatt Fecund: Successfully inserted. Max Inadvertent III: Successfully inserted. John Bevy: Duplicate not inserted. Max Inadvertent III: Duplicate not inserted. UNIX>