Getting started
An overview of Kaizen model, it's strength and comparison with current market
This page aims to provide you initial understanding of the model
Preface
Right now more and more companies come to understanding that Software Development is not one-shot activity and the only way to stay competitive in current market - is to always to innovate, deliver new features/functions and make it more comfortable to use. As result of it - project development can span years and cannot be planed ahead properly. That was one of the reason behind of Agile rise, as it addresses those challenges, but big projects / enterprises still need something more formal to make development more predictable and consistent.
This model is published as Work In Progress. I am strong believer that communities are stronger than any individual and, in current era - when we all are "connected", some great solutions can be created together.
Evolution rather then Revolution
In today's world we build upon what people before us did: we try to use best practices, comply with best standards and follow industry procedures to stay competitive. This is right thing to do, in current fast paced world you cannot just throw away progress, you embrace it and improve upon it. Therefore a lot of text in here is based on existing practices, processes, procedures and doesn't try to cover topics which were already raised by them, but only seeks to improve upon them.
I believe that this model incorporates some ideas/practices from some existing methodologies/ideas/principles/practices/philosophies, some of which were created, used and forgotten (by some) by now. This is not Revolution - this is Evolution which, hopefully, would be able to change (a bit) processes/companies without anybody even noticing it...
History
There are a lot of frameworks, methodologies and models out there. In here you will find reviewed most significant ones
Kaizen model
- Iterative development
- Is based on Iterative and Incremental development model and inherits it’s strength
- Allows to perform Continuous Integration
- Proven to be working for big projects
- Formal enough for Enterprises, but informal enough to be feasible for middle/small sized projects.
- Agile development
- Permits requirement changes
- Promotes rapid delivery
- Believes in individuals and interactions over process and tools
- Waste tracking
- Tracking of waste on every stage
- Removal of activities (or keeping it to minimum) which doesn’t bring value to customer
- Talent and Innovation
- Single vision/direction
- Promotion of best people for the job
- Decision are made by experts in the field
- Improvement of cooperation by removing constraints/waste
- Shared effort
- Daily meetings
- Decisions are made by pairs
- Commitment
- No more pigs and chickens – everybody is involved
Guidelines
- Milestones
-
- Every component delivery is a milestone for the project.
- Every milestone goes through all stages – Requirements, Analysis, Design and Implementation.
- Sub cycles
-
- New cycle starts along with third phase (construction).
- Pairs
-
- Decision are made in pairs - improves cooperation, commitment and enables peer review.
- Business and IT lead project together.
- Cooperation
-
- Business and IT work together on project while utilizing knowledge and expertise of each other.
- Everybody is committed, therefore Business and IT make decision together.
- Logs
-
- Every important aspect is recorded and reflected upon end of the cycle
Waste
Recycle plan
Waste removal
- Risks log
-
- Keeps track of Risks associated with the Project.
- Risks log is updated at every checkpoint.
- Issues log
-
- Keeps track of Issues associated with the Project.
- Issues log is updated at every checkpoint.
- Debt log
-
- Contains two sections – business and technical debt.
- Every decision, with possible negative impact, ends up in relevant section.
- Every debt entry have estimated impact (value) attached to it.
- At end of cycle voting is taking place to visualise actual impact; later is it possible to identify estimated vs actual impact.
- Checkpoints
-
- Meetings which allow to add new entries to risks/issues/debt log.
- Amount of checkpoints is flexible. Recommended amount is 4 (one per each phase), minimum is 1 (final checkpoint).
- Final checkpoint is crucial in determining waste and defining recycle plan.
- Recycle plan
-
- Defines actions to be taken to avoid/remove/build around of issue/waste/constraint.
- Every recycle plan is set to be implemented during next cycle.
- Recycle plan from previous cycle is reviewed during planning (pupa) phase.
Feedback
Below you can provide feedback, suggestions, questions regarding information posted on current page


songs are happy of life
Lifestyle
•
songs are help to relax our mind
Lifestyle
•
relax mind
Lifestyle
•
Hindi song
start
stop
May 15, 2014
•
mulumathy avalathu mukamaakum by jodha akbar
Romatic song
start
stop
•
Pachai uduthiya kaadu by vanamagan
album songs
start
stop
lady kash, 2018
•
3
oh penne song
english song
start
stop
•
faded in english song
culture
start
stop
•
Birava song
amazing songs
start
stop
•
bale bale by Bahubali
feelings
start
stop
•
pona usiru by thodati
happiness
start
stop
•
neethaney by mersal
comady
start
stop
•
comady song by nanum rowdy than
Copyright © All rights reserved | This template is made with
by
Ravi Dinuksha


Saint Petersburg, Russia
Date: Jul 10-14, 2017
Sant Cugat, Barcelona, Spain
Date: Jun 14-17, 2016
Chania, Crete, Greece
Date: Jun 6-11, 2016
Muju, Jeollabuk-do, South Korea
Date: Jan 18-22, 2016
National Astronomical Observatory of Japan, Mitaka, Tokyo, Japan
Date: Jan 7-9, 2015
Australia Telescope Compact Array, Narrabri , Australia
Date: Sept 29 to Oct 03, 2014
Kyoto, Nara, Osaka, Toyama, Tokyo
Date: June, 2014
Tokyo
Date: Jan, 2014
Kyoto, Nara, Osaka
Date: Nov, 2013
Tokyo
Date: Dec, 2012


Welcome!
Born late August, my personal site is still a baby; it will get more interesting as it grows up
It's built using only Polymer and Firebase
The Sandbox portion are demos for the rebuild of my Fullstack Academy capstone app
Polymer and Firebase Thoughts
I'm finding this little stack to be shockingly powerful and surprisingly light, like a magic wand!
I'll write up a much longer article sometime soon, it's on the roadmap!
Actively Interviewing
I'm looking to join a Javascript Engineering team in San Francisco!
On Aug 23, I climbed around in this tree looking for a job
Didn't find one
Wesley's Resume
Users
Securely login using a Github account, thanks to Firebase Auth service
If you login, your photo will appear below this line
Logout when you're finished looking at yourself!
More user integration and login options on the roadmap
User:{{params.name}}
Presentations
The following slides are ordered and sortable and automatically persist in the database! Pretty cool right?!
Try it! Rearrange some slides, leave this page, and come back to see your changes stick around
"Adding Presentations" is on the roadmap; so is fixing the border disappearing—it's a paper-material thing
Meetings
The following meetings are also tied to the database and some parts are editable and those edits persist to the database
Try it! Rearrange some slides, leave this page, and come back to see your changes stick around
You will be able to add organizers and create events and all those cool features! It's all on the roadmap
Contact
I really love the web and Javascript
I want to engineer software with a smart, fun team using interesting tech
Call me at<PHONE_NUMBER>
Email me at<EMAIL_ADDRESS>Slick animations are on the roadmap


blackjok3r
24-Aug-19 12:03 PM
No mine is ok too. Asnd MYLO6 seems to have started notarizing a while ago.
the staked branch has a known bug where it gets stuckin in ifninate loop selecting utxo, is fixed in new iguana.
have to pkill -9 it and restart to fix it.
I am also seeing node being banned and unbanned a fair bit here.
4 nodes have somehoe submittind incorrect sig, and failing fastnotaries count. Might investigate this a little further, rather fix the cause of that bug happenign than needing to implement a ban on nodes. Because they are not doing it on purpouse, my node even had one.


| Book of Mormon |
Annotations |
|
Chapter 31
|
|
|
1 Now it came to pass that after the end of Korihor, Alma
having received tidings that the Zoramites were perverting the ways of the
Lord, and that Zoram, who was their leader, was leading the hearts of the
people to bow down to dumb idols, his heart again began to sicken because of
the iniquity of the people.
|
|
|
2 For it was the cause of great sorrow to Alma to know of
iniquity among his people; therefore his heart was exceedingly sorrowful
because of the separation of the Zoramites from the Nephites.
|
|
|
3 Now the Zoramites had gathered themselves together in a
land which they called Antionum, which was east of the land of Zarahemla,
which lay nearly bordering upon the seashore, which was south of the land of
Jershon, which also bordered upon the wilderness south, which wilderness was
full of the Lamanites.
|
|
|
4 Now the Nephites greatly feared that the Zoramites would
enter into a correspondence with the Lamanites, and that it would be the
means of great loss on the part of the Nephites.
|
|
|
5 And now, as the preaching of the word had a great
tendency to lead the people to do that which was just—yea, it had had more
powerful effect upon the minds of the people than the sword, or
anything else, which had happened unto them—therefore Alma thought it was
expedient that they should try the virtue of the word of God.
|
The only pre-Columbian weapon I can find that was similar
to a sword was the macuahuitl which was made with a plank of wood similar in
shape to a cricket bat with obsidian blades mounted on the edges. It is
similar enough to a sword that it is often referred to as the Aztec sword.
However, the macuahuitl does not seem to fit the Book of
Mormon time frame. “Some groups of Central Mexico, principally in the
transition between the Early and the Late Post-Classic, probably
developed this weapon” (emphasis added, Dr. Marco Antonio Cervera Obregón,
“The macuahuitl: an innovative weapon of the Late Post-Classic in
Mesoamerica”, Arms & Armour, Vol.3, Nov. 2, 2006, p. 146, article from a research journal).
The Post-Classic period is between 900 CE and the Spanish conquest.
|
|
6 Therefore he took Ammon, and Aaron, and Omner; and Himni
he did leave in the church in Zarahemla; but the former three he took with
him, and also Amulek and Zeezrom, who were at Melek; and he also took two of
his sons.
|
|
|
7 Now the eldest of his sons he took not with him, and his
name was Helaman; but the names of those whom he took with him were Shiblon
and Corianton; and these are the names of those who went with him among the
Zoramites, to preach unto them the word.
|
|
|
8 Now the Zoramites were dissenters from the Nephites;
therefore they had had the word of God preached unto them.
|
|
|
9 But they had fallen into great errors, for they would
not observe to keep the commandments of God, and his statutes, according to
the law of Moses.
|
Alma 31:9-11
This lists the causes of Zoramite apostasy as:
- Failing to keep the commandments
- Failing to pray daily
- Perverting the ways of the Lord
These are among the reasons the LDS Church gives for
people leaving it. It is never admitted that there might be legitimate
reasons to leave.
From the perspective of a mind-control group, there is
“never a legitimate reason to leave; those who leave are weak, undisciplined,
unspiritual, worldly, brainwashed by family or counselor, or seduced by
money, sex, or rock and roll”
(Steven Hassan’s BITE model of mind control)
|
|
10 Neither would they observe the performances of the
church, to continue in prayer and supplication to God daily, that they might
not enter into temptation.
|
Annotation for Alma 31:9-11 above
|
|
11 Yea, in fine, they did pervert the ways of the Lord in
very many instances; therefore, for this cause, Alma and his brethren went
into the land to preach the word unto them.
|
Annotation for Alma 31:9-11 above
|
|
12 Now, when they had come into the land, behold, to their
astonishment they found that the Zoramites had built synagogues, and that
they did gather themselves together on one day of the week, which day they
did call the day of the Lord; and they did worship after a manner which Alma
and his brethren had never beheld;
|
|
|
13 For they had a place built up in the center of their
synagogue, a place for standing, which was high above the head; and the top
thereof would only admit one person.
|
|
|
14 Therefore, whosoever desired to worship must go forth
and stand upon the top thereof, and stretch forth his hands towards heaven,
and cry with a loud voice, saying:
|
|
|
15 Holy, holy God; we believe that thou art God, and we
believe that thou art holy, and that thou wast a spirit, and that thou art a
spirit, and that thou wilt be a spirit forever.
|
|
|
16 Holy God, we believe that thou hast separated us from
our brethren; and we do not believe in the tradition of our brethren, which
was handed down to them by the childishness of their fathers; but we believe
that thou hast elected us to be thy holy children; and also thou hast made it
known unto us that there shall be no Christ.
|
|
|
17 But thou art the same yesterday, today, and forever;
and thou hast elected us that we shall be saved, whilst all around us are
elected to be cast by thy wrath down to hell; for the which holiness, O God,
we thank thee; and we also thank thee that thou hast elected us, that we may
not be led away after the foolish traditions of our brethren, which doth bind
them down to a belief of Christ, which doth lead their hearts to wander far
from thee, our God.
|
|
|
18 And again we thank thee, O God, that we are a chosen
and a holy people. Amen.
|
|
|
19 Now it came to pass that after Alma and his brethren
and his sons had heard these prayers, they were astonished beyond all
measure.
|
|
|
20 For behold, every man did go forth and offer up these
same prayers.
|
|
|
21 Now the place was called by them Rameumptom, which,
being interpreted, is the holy stand.
|
|
|
22 Now, from this stand they did offer up, every man, the
selfsame prayer unto God, thanking their God that they were chosen of him,
and that he did not lead them away after the tradition of their brethren, and
that their hearts were not stolen away to believe in things to come, which
they knew nothing about.
|
|
|
23 Now, after the people had all offered up thanks after
this manner, they returned to their homes, never speaking of their God again
until they had assembled themselves together again to the holy stand, to
offer up thanks after their manner.
|
|
|
24 Now when Alma saw this his heart was grieved; for he
saw that they were a wicked and a perverse people; yea, he saw that their
hearts were set upon gold, and upon silver, and upon all manner of fine
goods.
|
|
|
25 Yea, and he also saw that their hearts were lifted up
unto great boasting, in their pride.
|
|
|
26 And he lifted up his voice to heaven, and cried,
saying: O, how long, O Lord, wilt thou suffer that thy servants shall dwell
here below in the flesh, to behold such gross wickedness among the children
of men?
|
|
|
27 Behold, O God, they cry unto thee, and yet their hearts
are swallowed up in their pride. Behold, O God, they cry unto thee with their
mouths, while they are puffed up, even to greatness, with the vain things of
the world.
|
|
|
28 Behold, O my God, their costly apparel, and their
ringlets, and their bracelets, and their ornaments of gold, and all their
precious things which they are ornamented with; and behold, their hearts are
set upon them, and yet they cry unto thee and say—We thank thee, O God, for
we are a chosen people unto thee, while others shall perish.
|
|
|
29 Yea, and they say that thou hast made it known unto
them that there shall be no Christ.
|
|
|
30 O Lord God, how long wilt thou suffer that such
wickedness and infidelity shall be among this people? O Lord, wilt thou give
me strength, that I may bear with mine infirmities. For I am infirm, and such
wickedness among this people doth pain my soul.
|
|
|
31 O Lord, my heart is exceedingly sorrowful; wilt thou
comfort my soul in Christ. O Lord, wilt thou grant unto me that I may have
strength, that I may suffer with patience these afflictions which shall come
upon me, because of the iniquity of this people.
|
|
|
32 O Lord, wilt thou comfort my soul, and give unto me
success, and also my fellow laborers who are with me—yea, Ammon, and Aaron,
and Omner, and also Amulek and Zeezrom, and also my two sons—yea, even all
these wilt thou comfort, O Lord. Yea, wilt thou comfort their souls in
Christ.
|
|
|
33 Wilt thou grant unto them that they may have strength,
that they may bear their afflictions which shall come upon them because of
the iniquities of this people.
|
|
|
34 O Lord, wilt thou grant unto us that we may have
success in bringing them again unto thee in Christ.
|
|
|
35 Behold, O Lord, their souls are precious, and many of
them are our brethren; therefore, give unto us, O Lord, power and wisdom that
we may bring these, our brethren, again unto thee.
|
|
|
36 Now it came to pass that when Alma had said these
words, that he clapped his hands upon all them who were with him. And behold,
as he clapped his hands upon them, they were filled with the Holy Spirit.
|
|
|
37 And after that they did separate themselves one from
another, taking no thought for themselves what they should eat, or what they
should drink, or what they should put on.
|
|
|
38 And the Lord provided for them that they should hunger
not, neither should they thirst; yea, and he also gave them strength, that
they should suffer no manner of afflictions, save it were swallowed up in the
joy of Christ. Now this was according to the prayer of Alma; and this because
he prayed in faith.
|
|


Write your quote below
Name is required
Description is required
Date is required
THANK YOU A LOT FOR VISITING US AND BEING PART OF US!


xjc(1) xjc(1) Name xjc - Java(TM) Architecture for XML Binding Binding Compiler Specification Version: 2.1 Reference Implementation (RI) Version: 2.1.3 Launching xjc The binding compiler can be launched using the appropriate xjc shell script in the bin directory for your platform. We also provide an Ant task to run the binding complier - see the instructions for using the XJC Ant task @ https://jaxb.dev.java.net/nonav/2.1.3/docs/xjcTask.html. % xjc -help Output Usage: xjc [-options ...] <schema file/URL/dir/jar> ... [-b <bindinfo>] ... If dir is specified, all schema files in it will be compiled. If jar is specified, /META-INF/sun-jaxb.episode binding file will be compiled. Options: -nv : do not perform strict validation of the input schema(s) -extension : allow vendor extensions - do not strictly follow the Compatibility Rules and App E.2 from the JAXB Spec -b <file/dir> : specify external bindings files (each <file> must have its own -b); if a directory is given, **/*.xjb is searched -d <dir> : generated files will go into this directory -p <pkg> : specifies the target package -httpproxy <proxy> : set HTTP/HTTPS proxy; format is [user[:password]@]proxyHost:proxyPort -httpproxyfile <f> : works like -httpproxy but takes the argument in a file to protect password -classpath <arg> : specify where to find user class files -catalog <file> : specify catalog files to resolve external entity references; support TR9401, XCatalog, and OASIS XML Catalog format -readOnly : generated files will be in read-only mode -npa : suppress generation of package level annotations (**/package-info.java) -no-header : suppress generation of a file header with timestamp -target 2.0 : behave like XJC 2.0 and generate code that doesnt use any 2.1 features -xmlschema : treat input as W3C XML Schema (default) -relaxng : treat input as RELAX NG (experimental,unsupported) -relaxng-compact : treat input as RELAX NG compact syntax (experimental,unsupported) -dtd : treat input as XML DTD (experimental,unsupported) -wsdl : treat input as WSDL and compile schemas inside it (experimental,unsupported) -verbose : be extra verbose -quiet : suppress compiler output -help : display this help message -version : display version information Extensions: -Xlocator : enable source location support for generated code -Xsync-methods : generate accessor methods with the 'synchronized' keyword -mark-generated : mark the generated code as @javax.annotation.Generated -episode <FILE> : generate the episode file for separate compilation OPTIONS -nv By default, the XJC binding compiler performs strict validation of the source schema before processing it. Use this option to disable strict schema validation. This does not mean that the binding com‐ piler will not perform any validation, it simply means that it will perform less-strict validation. -extension By default, the XJC binding compiler strictly enforces the rules outlined in the Compatibility chapter of the JAXB Specification. Appendix E.2 defines a set of W3C XML Schema features that are not completely supported by JAXB v1.0. In some cases, you may be allowed to use them in the "-extension" mode enabled by this switch. In the default (strict) mode, you are also limited to using only the binding customizations defined in the specification. By using the "-extension" switch, you will be allowed to use the JAXB Vendor Extensions -b <file> Specify one or more external binding files to process. (Each bind‐ ing file must have its own "-b" switch.) The syntax of the external binding files is extremely flexible. You may have a single binding file that contains customizations for multiple schemas or you can break the customizations into multiple bindings files: xjc schema1.xsd schema2.xsd schema3.xsd -b bindings123.xjb xjc schema1.xsd schema2.xsd schema3.xsd -b bindings1.xjb -b bind‐ ings2.xjb -b bindings3.xjb In addition, the ordering of the schema files and binding files on the command line does not matter. -d <dir> By default, the XJC binding compiler will generate the Java content classes in the current directory. Use this option to specify an alternate output directory. The output directory must already exist, the XJC binding compiler will not create it for you. -p <pkg> Specifying a target package via this command-line option overrides any binding customization for package name and the default package name algorithm defined in the specification. -httpproxy <proxy> Specify the HTTP/HTTPS proxy. The format is [user[:password]@]prox‐ yHost[:proxyPort]. The old -host and -port are still supported by the RI for backwards compatibility, but they have been deprecated. Note that the password specified with this option is an argument that is visible to other users who use the top command, for exam‐ ple. For greater security, use -httpproxyfile, below. -httpproxyfile <file> Specify the HTTP/HTTPS proxy using a file. Same format as above, but the password specified in the file is not visible to other users. -classpath <arg> Specify where to find client application class files used by the <jxb:javaType> and <xjc:superClass> customizations. -catalog <file> Specify catalog files to resolve external entity references. Sup‐ ports TR9401, XCatalog, and OASIS XML Catalog format. Please read the XML Entity and URI Resolvers document or the catalog-resolver sample application. -readOnly By default, the XJC binding compiler does not write-protect the Java source files it generates. Use this option to force the XJC binding compiler to mark the generated Java sources read-only. -npa Supress the generation of package level annotations into **/pack‐ age-info.java. Using this switch causes the generated code to internalize those annotations into the other generated classes. -no-header Supress the generation of a file header comment that includes some note and timestamp. Using this makes the generated code more diff-friendly. -target 2.0 Avoid generating code that relies on any JAXB 2.1 features. This will allow the generated code to run with JAXB 2.0 runtime (such as JavaSE 6.) -xmlschema Treat input schemas as W3C XML Schema (default). If you do not specify this switch, your input schemas will be treated as W3C XML Schema. -relaxng Treat input schemas as RELAX NG (experimental, unsupported). Sup‐ port for RELAX NG schemas is provided as a JAXB Vendor Extension. -relaxng-compact Treat input schemas as RELAX NG compact syntax(experimental, unsup‐ ported). Support for RELAX NG schemas is provided as a JAXB Vendor Extension. -dtd Treat input schemas as XML DTD (experimental, unsupported). Support for RELAX NG schemas is provided as a JAXB Vendor Extension. -wsdl Treat input as WSDL and compile schemas inside it (experimen‐ tal,unsupported). -quiet Suppress compiler output, such as progress information and warn‐ ings. -verbose Be extra verbose, such as printing informational messages or dis‐ playing stack traces upon some errors. -help Display a brief summary of the compiler switches. -version Display the compiler version information. <schema file/URL/dir> Specify one or more schema files to compile. If you specify a directory, then xjc will scan it for all schema files and compile them. Non-Standard Command Line Options -Xlocator Causes the generated code to expose SAX Locator information about the source XML in the Java bean instances after unmarshalling. -Xsync-methods Causes all of the generated method signatures to include the syn‐ chronized keyword. -mark-generated Mark the generated code with the annotation @javax.annotation.Gen‐ erated. -episode <file> Generate the specified episode file for separate compilation. Deprecated and Removed Command Line Options -host & -port These options have been deprecated and replaced with the -httpproxy option. For backwards compatibility, we will continue to support these options, but they will no longer be documented and may be removed from future releases. -use-runtime Since the JAXB 2.0 specification has defined a portable runtime, it is no longer necessary for the JAXB RI to generate **/impl/runtime packages. Therefore, this switch is obsolete and has been removed. -source The -source compatibility switch was introduced in the first JAXB 2.0 Early Access release. We have decided to remove this switch from future releases of JAXB 2.0. If you need to generate 1.0.x code, please use an installation of the 1.0.x codebase. Compiler Restrictions In general, it is safest to compile all related schemas as a single unit with the same binding compiler switches. Please keep the following list of restrictions in mind when running xjc. Most of these issues only apply when compiling multiple schemas with mul‐ tiple invocations of xjc. o To compile multiple schemas at the same time, keep the following precedence rules for the target Java package name in mind: 1. The "-p" command line option takes the highest precedence. 2. <jaxb:package> customization 3. If targetNamespace is declared, apply targetNamespace -> Java package name algorithm defined in the specification. 4. If no targetNamespace is declared, use a hardcoded package named "generated". o It is not legal to have more than one <jaxb:schemaBindings> per namespace, so it is impossible to have two schemas in the same tar‐ get namespace compiled into different Java packages. o All schemas being compiled into the same Java package must be sub‐ mitted to the XJC binding compiler at the same time - they cannot be compiled independently and work as expected. o Element substitution groups spread across multiple schema files must be compiled at the same time. See Also o Running the binding compiler (XJC): [ command-line instructions @ https://jaxb.dev.java.net/nonav/2.1.3/docs/xjc.html, using the XJC Ant task @ https://jaxb.dev.java.net/nonav/2.1.3/docs/xjcTask.html] o Java Architecture for XML Binding (JAXB) @ http://docs.oracle.com/javase/7/docs/tech‐ notes/guides/xml/jaxb/index.html 16 Mar 2012 xjc(1)


Preparation time
less than 30 mins
Cooking time
30 mins to 1 hour
Serves
Makes 24
Dietary
These rich little slices take a bit of time to make but the end result is worth every second. This does mean, though, that they will seem to disappear at the speed of light!
Preheat the oven to 180C/350F/Gas 4.
To make the base, cream the butter and gradually add the caster sugar. Beat until pale, soft and light. Add the egg, a little at a time, beating well after each addition, before adding the vanilla extract.
Sift together the dry ingredients and stir gently into the creamed mixture.
Mix everything together lightly and add the milk to moisten. Spread the mixture into the prepared tin, smoothing it out to the edges. Spread the jam gently over the cake mixture and sprinkle with the raspberries. You may need to press them down gently into the cake mixture.
Make the topping. Cream the butter and sugar together as before until pale, soft and light. Add the beaten eggs gradually, beating well after each addition. Mix together the coconut and rice flour and fold into the mixture. Spread gently but evenly over the raspberries and bake in the oven for about 35-40 minutes or until a skewer comes out cleanly.
Leave to cool in the tin and cut into 24 biscuits.


{# _q_section_customize_submodel.html #}
{# this is a "section" template #}
{# it is inserted as needed by ng via AJAX using the load-on-demand paradigm #}
{# see the "q_load_section" django view #}
{# and see the "section" ng directive" #}
{% include 'questionnaire/_q_customize_properties.html' %}


{% assign category = page.url | split: '/'| last | capitalize %}
{% assign posts = site.categories[category] %}
{% comment %}
=======================
The following part extracts all the sub-taxonomy from your posts
and sort them, so that you do not need to manually
collect your sub taxonomy of your post.
=======================
{% endcomment %}
{% assign rawtaxs = "" %}
{% for post in posts %}
{% assign ttaxs = post.sub_class | join:'|' | append:'|' | downcase %}
{% assign rawtaxs = rawtaxs | append:ttaxs %}
{% endfor %}
{% assign rawtaxs = rawtaxs | split:'|' | sort %}
{% comment %}
=======================
The following part removes dulpicated
classes and invalid classes like blank tag.
=======================
{% endcomment %}
{% assign taxs = "" %}
{% for tax in rawtaxs %}
{% if tax != "" %}
{% if taxs == "" %}
{% assign taxs = tax | split:'|' %}
{% endif %}
{% unless taxs contains tax %}
{% assign taxs = taxs | join:'|' | append:'|' | append:tax | split:'|' %}
{% endunless %}
{% endif %}
{% endfor %}
{{ cate.desc }}
{% endif %} {% endfor %}


---------To provide all the caffeine that you need to power your life! Just drink it.
A smooth, mild blend of coffees from Mexico, Bolivia and Guatemala
Espresso, steamed milk and chocolate syrup
A mixture of espresso, steamed milk and foam
A spicy drink made with black tea, spices, milk and honey
See Chai Tea


org.mindswap.pellet
Class EdgeList
java.lang.Object
org.mindswap.pellet.EdgeList
- public class EdgeList
- extends java.lang.Object
- Author:
- Evren Sirin
| Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
EdgeList
public EdgeList()
EdgeList
public EdgeList(int size)
EdgeList
public EdgeList(EdgeList edges)
EdgeList
public EdgeList(Edge edge)
- Create an immutable singleton EdgeList;
- Parameters:
edge
-
addEdgeList
public void addEdgeList(EdgeList edges)
addEdge
public void addEdge(Edge e)
removeEdge
public boolean removeEdge(Edge edge)
edgeAt
public Edge edgeAt(int i)
size
public int size()
sort
public EdgeList sort()
isEmpty
public boolean isEmpty()
iterator
public java.util.Iterator iterator()
getEdgesFromTo
public EdgeList getEdgesFromTo(Individual from,
Node to)
getEdgesFrom
public EdgeList getEdgesFrom(Individual from)
getEdgesTo
public EdgeList getEdgesTo(Node to)
getEdges
public EdgeList getEdges(Role role)
getEdgesContaining
public EdgeList getEdgesContaining(Node node)
getPredecessors
public java.util.Set getPredecessors()
getSuccessors
public java.util.Set getSuccessors()
getRoles
public java.util.Set getRoles()
getNeighborNames
public java.util.Set getNeighborNames(Individual node)
getNeighbors
public java.util.Set getNeighbors(Node node)
getFilteredNeighbors
public java.util.Set getFilteredNeighbors(Individual node)
hasEdgeFrom
public boolean hasEdgeFrom(Individual from)
hasEdgeFrom
public boolean hasEdgeFrom(Individual from,
Role role)
hasEdgeTo
public boolean hasEdgeTo(Node to)
hasEdgeTo
public boolean hasEdgeTo(Role role,
Node to)
hasEdge
public boolean hasEdge(Role role)
hasEdge
public boolean hasEdge(Individual from,
Role role,
Node to)
hasEdge
public boolean hasEdge(Edge e)
toString
public java.lang.String toString()
Copyright © 2004 Evren Sirin. All Rights Reserved.


{% extends "global.html" %} {% block body_content %}
| ID | Name | Country | Region | City | Created | Updated | |
|---|---|---|---|---|---|---|---|
| {{entry.excavation_id}} | {{entry.excavation_name}} | {{entry.country_id}} | {{entry.region_id}} | {{entry.city_id}} | {{entry.excavation_created}} | {{entry.excavation_updated}} | Edit Delete |


BreadCrumb with reset
BreadCrumb without reset
BreadCrumb without reset and some property
Div text align right


Using jQuery
jQuery is a Javascript framework that simplifies DOM manipulation and guarantees consistent behavior across multiple
browsers.
The jQuery Function
Getting and Setting HTML Attributes
Getting and Setting HTML Form Values
Getting and Setting CSS Attributes
Getting and Setting CSS Classes
Getting and Setting Element Content
Getting and Setting Element Size and Position
Animations
Utility Functions
Ajax Utilities
jQuery Events
TODO - Summarize the contents of http://nefariousdesigns.co.uk/archive/2006/05/object-oriented-javascript/ with code examples.


The network manager is in charge of all things network. It’s main goal is to provide a private network to each project, with internet connectivity, as well as the possibility of launching Docker containers for testing and deployment. All the traffic is completely isolated from each network and the users can access their projects’ networks and containers by associating RJ-45 sockets at DML’s room to them.
A simplified vision of our network architecture would be:
Before Starting
We recommend having a small knowledge base on Software Defined Networks (SDN), OpenFlow, Open vSwitch, Docker and overall networking before diving into this section.
The “core” of each project’s network will be hosted on a datacenter, where the containers will be orchestrated and the NAT/PAT mechanisms will provide internet access to all the hosts across the private networks.
In order to fulfill time milestones, it was decided that this implementation of the container orchestration will be focused on a single-host datacenter architecture, rather than a swarm-like implementation.
The datacenter will be running an HTTP server (NetManager), that will fulfill all the requests of the DML’s API, and will be responsible for managing all the Open vSwitch bridges, containers and the associated ports of the projects.
The datacenter will also be running the SDN Controller responsible for controlling the switch’s traffic at the DETI MakerLab room.
Both the NetManager and SDN Controller will be using the same PostgreSQL
database, where it’ll be stored all the information relative to the network.
At the moment, all the requests made to the NetManager come exclusively from the
dml-servant
. The following image describes the current architecture in place:
NetManager
The controller behind managing all the things at the Datacenter is a flask powered HTTP Server, with the assistance of a PostgreSQL database to store all the networking-relative information. Its main functionalities are:
- Creation and destruction of a project’s network — when the first container is launched (within the scope of a project) or a ethernet port is requested, an OvS bridge is created and a router-like container is started;
- Creation and destruction of containers — either a pre-built container or built with a Dockerfile provided by the user;
- Change of state (start and stop) of containers;
- Association of RJ-45 sockets (based on a printed ID on them) to projects’ networks (in order to let the SDN controller know which ports belong to the projects’ VLANs);
- Informational endpoints to the platform’s API, mainly to the
dml-servant
, returning container’s DockerIDs, IPs, status, logs and more.
Project’s vSwitch
Project’s vSwitch is nothing more than a virtual switch (using Open vSwitch), created in the scope of each project (when the first container is created or a port is requested) and that will have two main purposes:
- Operate as a switch/bridge for attaching containers;
- Create a connection between the project’s switch and the VTEP bridge to send the traffic trough the VxLAN tunnel, so that all containers and users’ terminals (laptops, etc.) at DML coexist inside the same Layer 2 network (private network of each project).
“Router” container
Each private network, after the creation of its OvS bridge, will be provided with a container that will operate like a router, creating the “bridge” between this network and the internet, using NAT/PAT mechanisms, and operating like a DHCP server, providing IP addresses to all the hosts within that network.
The router container runs a Alpine Linux distro with IPTables for NAT/PAT and ISC DHCP server for the DHCP service.
Container Orchestration Architecture
A more comprehensive view on the internal works of the datacenter orchestration can be seen in the following image.
There are two main bridges that are created with the system deployment:
- Routing bridge — aggregates all the public routers’ interfaces, as well as a network interface of the deployment machine, allowing the routers to obtain a public IP address;
- VTEP bridge — aggregates all the patch ports that connect directly to the projects’ vSwitches. It’ll operate as a OpenFlow virtual switch, since, by the time a project bridge is created, two flows are installed on the bridge, in order to redirect traffic coming from the VxLAN tunnel to the project’s vSwitch and vice-versa.
Setup
For the complete setup instructions, please look for the network installation guide for detailed instructions of how to set up all the network related components.
Endpoints
The datacenter-master/server.py
contains a flask app which provides a set of
endpoints to manage all the networking. These are described below. However, there
are other auxiliary methods that are not displayed here, but they are well
documented in the code.
In all endpoints, json is returned. A return code of 400 or 500 along the with an error message is returned in case of failure, otherwise 200 is returned (unless something unexpected happens).
Add port
Accepting a given user_id
, project_id
(id of a project) and a port number,
adds that port to the VLAN of that project, using the SDN controller.
/add-port/<int:user_id>/<int:project_id>/<int:port_id>/
user_id: ID of the user on the platform
project_id: ID of the project that the port will be associated to
port_id: Ethernet socket port number that will be requested
POST: Returns a successful HTTP response
Remove port
Accepting a given user_id
and a port number, removes that port to the VLAN
of that project, using the SDN controller.
/remove-port/<int:user_id>/<int:port_id>/
user_id: ID of the user on the platform
port_id: Ethernet socket port number that will be freed
POST: Returns a successful HTTP response
Create project bridge
Accepting a given user_id
and a project_id
(id of a project),
creates a new OvS bridge and launches its router-like container.
/create-bridge/<int:user_id>/<int:project_id>/
user_id: ID of the user on the platform
project_id: ID of the project that will have the bridge associated to
POST: Returns a successful HTTP response
Delete project bridge
Accepting a given user_id
and a project_id
(id of a project), deletes
the corresponding OvS bridge and all its containers.
/delete-bridge/<int:user_id>/<int:project_id>/
user_id: ID of the user on the platform
project_id: ID of the project that will have the bridge associated to
POST: Returns a successful HTTP response
New container
Accepting a given user_id
, a project_id
(id of a project), and possibly
a Dockerfile, launches a new container.
/new-container/<int:user_id>/<int:project_id>/
user_id: ID of the user on the platform.
project_id: ID of the project (bridge) that the new container will be
attached to
dockerfile: In attachment might be a dockerfile, describing the container
that'll be launched
POST: Returns a dictionary with {success, container_name, ip, docker_id}
Update container
Accepting a given user_id
, a docker_id
and a Dockerfile,
updates the container.
/update-container/<int:user_id>/<docker_id>/
user_id: ID of the user on the platform.
docker_id: ID of the Docker container that will be updated
dockerfile: In attachment, it should be a dockerfile, describing the container
that'll be launched.
POST: Returns a dictionary with {success, container_name, ip, docker_id}
Delete container
Given a user_id
and a docker_id
, stops and removes
the corresponding container.
/remove-container/<int:user_id>/<docker_id>/
user_id: ID of the user on the platform.
docker_id: ID of the Docker container that will be updated
POST: Returns a successful HTTP response
Get project’s containers
Given a user_id
and a project_id
(id of a project), returns all the
containers info related to the project.
/get-project-containers/<int:user_id>/<int:project_id>/
user_id: ID of the user on the platform.
project_id: ID of the project
GET: Returns a dictionary with {success, containers}
Get container info
Accepting a given user_id
, docker_id
, returns all info about it:
IP, DockerID, status and CPU and memory usage stats.
/get-container-info/<int:user_id>/<docker_id>/
user_id: ID of the user on the platform.
docker_id: ID of the Docker container that the info is requested
GET: Returns a dictionary with {success, stats={id, docker_id, status,
cpu, mem_used, mem_limit, mem_perc}}
Get container logs
Accepting a user_id
and a docker_id
, returns its last 50 lines of log.
/get-container-logs/<int:user_id>/<docker_id>/
user_id: ID of the user on the platform.
docker_id: ID of the Docker container that the info is requested
GET: Returns a dictionary with {success, logs}
Start container
Accepting a given user_id
and docker_id
,
starts the corresponding container.
/start-container/<int:user_id>/<docker_id>/
user_id: ID of the user on the platform.
docker_id: ID of the Docker container that'll be started
GET: Returns a dictionary with {success, ip, docker_id}
Stop container
Accepting a given user_id
and docker_id
,
stops the corresponding container.
/stop-container/<int:user_id>/<docker_id>/
user_id: ID of the user on the platform.
docker_id: ID of the Docker container that'll be stoped
GET: Returns a successful HTTP response
Restart container
Accepting a given user_id
and docker_id
, restarts
the corresponding container.
/restart-container/<int:user_id>/<docker_id>/
user_id: ID of the user on the platform.
docker_id: ID of the Docker container that'll be restarted
GET: Returns a dictionary with {success, ip, docker_id}
SDN Controller
It’ll be at the DETI MakerLab room that the users will connect to their projects’ networks, where there are several RJ-45 sockets and a OpenFlow enabled Switch to control all the traffic inside the room and forward it to the datacenter.
To connect all the hosts at DML, a OpenFlow enabled Switch must exist but, in order to work as intended, a SDN controller is also needed.
This controller will be responsible for:
- Analyzing and redirecting packets that the Switch are not familiar with and to tell it where to forward them, may their destination be an host at the room or a VM through the VxLAN tunnel;
- Installing OpenFlow rules in the Switch, so that the packets with a similar destination would be automatically redirected without the need of sending them to the controller.
Although the SDN controller initially provided an HTTP REST endpoints, it’s deprecated an not used at the moment, but in the future it might be useful. With that in mind, the SDN controller runs an HTTP server, but without any current endpoints.
To start the SDN controller, just use ryu-manager sdn-controller/dml_switch_rest.py
.
The controller contains the following methods:
Get IP (class method)
Returns the IP of a project VLAN given a certain project_id
.
project_id: ID of the project
Returns: string containing the IP address.
Get VNI (class method)
Returns the VLAN ID / VNI, which equals the project_id
, given an IP of a
project VLAN.
ip: a given IP address
Returns: the VLAN ID / VNI of a project's network
Get All Reserved Ports
Returns a list of all already reserved ports currently in the network database.
ip: a given IP address
Returns: list of integers - port numbers
Get VLAN Port
Given a certain port number, returns the VLAN ID that’s associated to.
port: ethernet port number
Returns: the VLAN ID / VNI of the network the given port is associated to
Switch Features Handler
Receving an OpenFlow event as input, installs a table-miss flow entry.
At the moment, if it specified a lesser number, e.g., 128,
OvS will send Packet-In with invalid buffer_id
and truncated packet data.
In that case, it is not possible to output packets correctly.
ev: An OpenFlow event, that contains a packet message and the involved protocols
Returns: None
Add flow
Creates a new OpenFlow flow in the current datapath (table 0).
datapath: Datapath of the OpenFlow controlled switch
priority: Priority of the flow
match: Packets matching conditions config
actions: Actions to perform given the selected packets
buffer_id: used Buffer ID
Returns: None
Parse VxLAN broadcast
Given a certain packet message and its headers that comes from the VxLAN tunnel port and that the destination MAC address is the broadcast address, this method parses that packet, figuring out which VNI / VLAN ID the packet carries and send it to the correct ports.
msg: Message of a packet
header_list: List of headers of the given message
Returns: None
Packet-In handler
Given an OpenFlow event, parses that event packet.
According to the In-Packet origin, there are multiple alternatives:
- If the traffic comes from the VxLAN tunnel port with the broadcast MAC
destination, calls the
_parse_vxlan_broadcast
method with the given packet message and its headers; - If the traffic comes from the VxLAN tunnel port with a destination IP
address, use the
get_vni
method to obtain the VLAN ID to forward it to the correct VLAN; - If the traffic comes from an host directly connected to the switch, obtain
its VLAN ID using the
get_port_to_vlan
method;
According to the In-Packet destination:
- If the packet’s destination MAC address is unknown (not present in the ARP table at the time), send the packet to all the VLAN ports, including the VxLAN tunnel port (flooding process);
- If the packet’s destination MAC address is known, send it to the correct
port and call the
add_flow
method to regist a new flow at the switch to prevent these known “routes” to be constantly redirected to the SDN controller;
It is worth poiting out that, if a packet is redirected to the VxLAN tunnel port, it’s necessarily added a new OpenFlow message field with the corresponding VNI / VLAN ID.
ev: An OpenFlow event, that contains a packet message and the involved protocols
Returns: None


I’m A Parent In COVID-Riddled Florida, And I’m Terrified For My Kids
“The new school year is starting with no mask mandate or social distancing.”
A-levels 2021: What you need to know about this year's results
Students in England, Wales and Northern Ireland have received their A-level results, and final Scottish Highers results have also been released.


A curated list of awesome lists
-
Check out my
blog
and follow me on
Twitter
.
Table of Contents
Platforms
-
Node.js
★ 11353, pushed 1 days ago
-
Frontend Development
★ 18696, pushed 1 days ago
-
iOS
★ 11176, pushed 4 days ago
-
Android
★ 2328, pushed 9 days ago
-
IoT & Hybrid Apps
★ 186, pushed 89 days ago
-
Electron
★ 5761, pushed 2 days ago
-
Cordova
★ 103, pushed 115 days ago
-
React Native
★ 4339, pushed 1 days ago
-
Xamarin
★ 100, pushed 9 days ago
-
Linux
★ 331, pushed 2 days ago
-
OS X
★ 3920, pushed 2 days ago
-
watchOS
★ 162, pushed 76 days ago
-
JVM
★ 122, pushed 4 days ago
-
Salesforce
★ 55, pushed 14 days ago
-
Amazon Web Services
★ 1859, pushed 4 days ago
-
Windows
★ 63, pushed 53 days ago
-
IPFS
★ 177, pushed 11 days ago
-
Fuse
★ 112, pushed 19 days ago
-
Heroku
★ 13, pushed 28 days ago
Programming Languages
-
JavaScript
-
Promises
★ 573, pushed 10 days ago
-
Standard Style
★ 119, pushed 19 days ago
-
Must Watch Talks
★ 10625, pushed 3 days ago
-
Tips
★ 9516, pushed 6 days ago
-
Network Layer
★ 218, pushed 45 days ago
-
Micro npm Packages
★ 234, pushed 5 days ago
-
Mad Science npm Packages
★ 452, pushed 69 days ago
-
Maintenance Modules
- For npm packages
★ 230, pushed 104 days ago
-
npm
★ 1710, pushed 11 days ago
-
AVA
- Test runner
★ 99, pushed 1 days ago
-
ESLint
★ 213, pushed 4 days ago
★ 5882, pushed 4 days ago
-
Swift
★ 7959, pushed 3 days ago
-
Python
★ 20412, pushed 3 days ago
-
Rust
★ 2097, pushed 6 days ago
-
Haskell
★ 732, pushed 24 days ago
-
PureScript
★ 62, pushed 71 days ago
-
Go
★ 12513, pushed 0 days ago
-
Scala
★ 3388, pushed 5 days ago
-
Ruby
-
Events
★ 167, pushed 19 days ago
★ 5648, pushed 4 days ago
-
Clojure
★ 683, pushed 12 days ago
-
ClojureScript
★ 250, pushed 42 days ago
-
Elixir
★ 3654, pushed 2 days ago
-
Elm
★ 595, pushed 5 days ago
-
Erlang
★ 422, pushed 23 days ago
-
Julia
★ 327, pushed 2 days ago
-
Lua
★ 821, pushed 65 days ago
-
C
★ 214, pushed 2 days ago
-
C/C++
★ 4935, pushed 2 days ago
-
R
★ 1317, pushed 4 days ago
-
D
★ 123, pushed 21 days ago
-
Common Lisp
★ 276, pushed 4 days ago
-
Perl
★ 268, pushed 88 days ago
-
Groovy
★ 261, pushed 8 days ago
-
Dart
★ 136, pushed 126 days ago
-
Java
-
RxJava
★ 27, pushed 8 days ago
★ 6775, pushed 4 days ago
-
Kotlin
-
OCaml
★ 601, pushed 7 days ago
-
Coldfusion
★ 29, pushed 106 days ago
-
Fortran
★ 65, pushed 110 days ago
-
.NET
★ 1717, pushed 3 days ago
-
PHP
★ 11659, pushed 1 days ago
-
Delphi
★ 128, pushed 7 days ago
-
Assembler
-
AutoHotkey
★ 234, pushed 12 days ago
-
AutoIt
★ 34, pushed 61 days ago
-
Crystal
★ 301, pushed 10 days ago
-
TypeScript
★ 105, pushed 2 days ago
Front-end Development
-
ES6 Tools
★ 3009, pushed 66 days ago
-
Web Performance Optimization
★ 5366, pushed 14 days ago
-
Web Tools
★ 188, pushed 64 days ago
-
CSS
★ 411, pushed 8 days ago
-
React
-
Relay
★ 60, pushed 48 days ago
★ 13197, pushed 2 days ago
-
Web Components
★ 797, pushed 171 days ago
-
Polymer
★ 207, pushed 13 days ago
-
Angular 2
★ 1444, pushed 4 days ago
-
Angular
★ 1490, pushed 7 days ago
-
Backbone
★ 319, pushed 37 days ago
-
HTML5
★ 472, pushed 76 days ago
-
SVG
★ 2861, pushed 6 days ago
-
Canvas
★ 97, pushed 74 days ago
-
KnockoutJS
★ 36, pushed 1 days ago
-
Dojo Toolkit
★ 46, pushed 137 days ago
-
Inspiration
★ 372, pushed 146 days ago
-
Ember
★ 125, pushed 17 days ago
-
Android UI
★ 13918, pushed 5 days ago
-
iOS UI
★ 7875, pushed 5 days ago
-
Meteor
★ 547, pushed 30 days ago
-
BEM
★ 147, pushed 31 days ago
-
Flexbox
★ 340, pushed 19 days ago
-
Web Typography
★ 144, pushed 13 days ago
-
Web Accessibility
★ 126, pushed 22 days ago
-
Material Design
★ 337, pushed 103 days ago
-
D3
★ 2786, pushed 8 days ago
-
Emails
★ 78, pushed 11 days ago
-
jQuery
-
Tips
★ 3683, pushed 1 days ago
★ 188, pushed 8 days ago
-
Web Audio
★ 149, pushed 23 days ago
-
Offline-First
★ 1410, pushed 1 days ago
-
Static Website Services
★ 178, pushed 8 days ago
-
A-Frame VR
- Virtual reality
★ 228, pushed 4 days ago
-
Cycle.js
★ 315, pushed 5 days ago
-
Text Editing
★ 8, pushed 55 days ago
-
Motion UI Design
★ 244, pushed 33 days ago
-
Vue.js
★ 2411, pushed 3 days ago
-
Marionette.js
★ 104, pushed 25 days ago
-
Aurelia
★ 20, pushed 5 days ago
-
Charting
★ 560, pushed 9 days ago
-
Ionic Framework 2
★ 50, pushed 3 days ago
-
Chrome DevTools
★ 1354, pushed 14 days ago
Back-end Development
-
Django
★ 3650, pushed 25 days ago
-
Flask
★ 2367, pushed 13 days ago
-
Docker
★ 3116, pushed 2 days ago
-
Vagrant
★ 177, pushed 68 days ago
-
Pyramid
★ 248, pushed 1 days ago
-
Play1 Framework
★ 23, pushed 113 days ago
-
CakePHP
★ 393, pushed 5 days ago
-
Symfony
★ 697, pushed 3 days ago
-
Laravel
★ 2725, pushed 4 days ago
-
Rails
-
Gems
★ 1621, pushed 33 days ago
★ 829, pushed 48 days ago
-
Phalcon
★ 181, pushed 13 days ago
-
Useful
.htaccess
Snippets
★ 9219, pushed 27 days ago
-
nginx
★ 1628, pushed 66 days ago
-
Dropwizard
★ 12, pushed 7 days ago
-
Kubernetes
★ 149, pushed 26 days ago
-
Lumen
★ 62, pushed 37 days ago
Computer Science
-
University Courses
★ 14954, pushed 14 days ago
-
Data Science
★ 2359, pushed 8 days ago
-
Machine Learning
★ 12665, pushed 4 days ago
-
Speech and Natural Language Processing
★ 1193, pushed 106 days ago
-
Linguistics
★ 40, pushed 270 days ago
-
Cryptography
★ 1544, pushed 191 days ago
-
Computer Vision
★ 1254, pushed 46 days ago
-
Deep Learning
- Neural networks
★ 1922, pushed 8 days ago
-
Deep Vision
★ 1273, pushed 8 days ago
-
Open Source Society University
★ 13722, pushed 9 days ago
-
Functional Programming
★ 115, pushed 64 days ago
-
Static Analysis & Code Quality
★ 76, pushed 5 days ago
-
Software-Defined Networking
★ 20, pushed 48 days ago
Big Data
Theory
Books
Editors
Gaming
Development Environment
-
Quick Look Plugins
- OS X
★ 5950, pushed 4 days ago
-
Dev Env
★ 388, pushed 14 days ago
-
Dotfiles
★ 1061, pushed 8 days ago
-
Shell
★ 6673, pushed 17 days ago
-
Command-Line Apps
★ 398, pushed 7 days ago
-
ZSH Plugins
★ 1464, pushed 3 days ago
-
GitHub
★ 187, pushed 44 days ago
-
Git Cheat Sheet & Git Flow
★ 1138, pushed 50 days ago
-
Git Tips
★ 515, pushed 4 days ago
-
Git Add-ons
★ 227, pushed 10 days ago
-
SSH
★ 315, pushed 46 days ago
-
FOSS for Developers
★ 115, pushed 54 days ago
Entertainment
Databases
Media
Learn
Security
Content Management System
Miscellaneous
-
JSON
★ 306, pushed 25 days ago
-
Discounts for Student Developers
-
Slack
★ 218, pushed 104 days ago
-
Conferences
★ 407, pushed 34 days ago
-
GeoJSON
★ 270, pushed 66 days ago
-
Sysadmin
★ 3496, pushed 4 days ago
-
Radio
★ 73, pushed 270 days ago
-
Awesome
★ 34522, pushed 2 days ago
-
Analytics
★ 334, pushed 14 days ago
-
Open Companies
★ 93, pushed 119 days ago
-
REST
★ 636, pushed 13 days ago
-
Selenium
★ 99, pushed 28 days ago
-
Endangered Languages
★ 81, pushed 38 days ago
-
Continuous Delivery
★ 167, pushed 4 days ago
-
Services Engineering
★ 2107, pushed 270 days ago
-
Free for Developers
★ 13074, pushed 5 days ago
-
Bitcoin
★ 83, pushed 24 days ago
-
Answers
- Stack Overflow, Quora, etc
-
Sketch
- OS X design app
★ 413, pushed 12 days ago
-
Places to Post Your Startup
★ 851, pushed 99 days ago
-
PCAPTools
★ 378, pushed 4 days ago
-
Remote Jobs
★ 5439, pushed 1 days ago
-
Boilerplate Projects
★ 199, pushed 70 days ago
-
Readme
★ 360, pushed 41 days ago
-
Tools
★ 6277, pushed 2 days ago
-
Styleguides
★ 291, pushed 21 days ago
-
Design and Development Guides
★ 1097, pushed 36 days ago
-
Software Engineering Blogs
★ 7780, pushed 0 days ago
-
Self Hosted
★ 6801, pushed 4 days ago
-
FOSS Production Apps
★ 82, pushed 157 days ago
-
Gulp
★ 142, pushed 3 days ago
-
AMA
- Ask Me Anything
★ 527, pushed 7 days ago
-
Open Source Photography
★ 44, pushed 55 days ago
-
OpenGL
★ 267, pushed 23 days ago
-
Productivity
★ 67, pushed 112 days ago
-
GraphQL
★ 1179, pushed 4 days ago
-
Transit
★ 91, pushed 14 days ago
-
Research Tools
★ 95, pushed 33 days ago
-
Niche Job Boards
★ 30, pushed 34 days ago
-
Data Visualization
★ 431, pushed 11 days ago
-
Social Media Share Links
-
JSON Datasets
★ 88, pushed 141 days ago
-
Microservices
★ 883, pushed 5 days ago
-
Unicode Code Points
★ 80, pushed 78 days ago
-
Internet of Things
★ 212, pushed 74 days ago
-
Beginner-Friendly Projects
★ 304, pushed 25 days ago
-
Bluetooth Beacons
★ 131, pushed 56 days ago
-
Programming Interviews
-
Ripple
- Open source distributed settlement network
★ 32, pushed 103 days ago
-
Katas
★ 32, pushed 74 days ago
-
Tools for Activism
★ 152, pushed 84 days ago
-
TAP
- Test Anything Protocol
★ 197, pushed 46 days ago
-
Robotics
★ 162, pushed 28 days ago
-
MQTT
- "Internet of Things" connectivity protocol
★ 41, pushed 31 days ago
-
Hacking Spots
★ 245, pushed 16 days ago
-
For Girls
★ 95, pushed 8 days ago
-
Vorpal
- Node.js CLI framework
★ 54, pushed 8 days ago
-
OKR Methodology
- Goal setting & communication best practices
★ 33, pushed 88 days ago
-
Vulkan
★ 186, pushed 6 days ago
-
LaTeX
- Typesetting language
★ 19, pushed 28 days ago
-
Network Analysis
★ 179, pushed 1 days ago
-
Economics
- An economist's starter kit
★ 33, pushed 7 days ago
License
To the extent possible under law,
Sindre Sorhus
has waived all copyright and related or neighboring rights to this work.


-getusrs template: pers?com=getusrs&whr=<cond> <num_pattern>&srt=<order_pattern>&cmp=<comp_pattern> Order of query params is not important. pattern : * The '*' means all character sequences. descript: Returns all the users that has a name that satisfies the whr pattern example : pers?com=getusrs&whr=* pers?com=getusrs&whr=sample* returns : 200 OK, 401 (fail, request error), 501 (fail, server error) 200 OK : in this case the response body is as follows <?xml version="1.0"?> <?xml-stylesheet type="text/xsl" href="/resp_xsl/user_profile.xsl"?> <result> <row><usr>user</usr></row> ... </result> comments: the reference to the xsl file allows to view results in a web browser. In case the response body is handled directly by an application and not by a browser, this reference to xsl can be ignored.


In this function, each process i receives data items from each process j if an edge (j,i) exists in the topology graph or Cartesian topology. Similarly, each process i sends data items to all processes j where an edge (i,j) exists. This call is more general than MPI_NEIGHBOR_ALLGATHER in that different data items can be sent to each neighbor. The k-th block in send buffer is sent to the k-th neighboring process and the l-th block in the receive buffer is received from the l-th neighbor.
int MPI_Neighbor_alltoall(const void* sendbuf, int sendcount, MPI_Datatype sendtype, void* recvbuf, int recvcount, MPI_Datatype recvtype, MPI_Comm comm)
MPI_Neighbor_alltoall(sendbuf, sendcount, sendtype, recvbuf, recvcount, recvtype, comm, ierror)
TYPE(*), DIMENSION(..), INTENT(IN) :: sendbuf
TYPE(*), DIMENSION(..) :: recvbuf
INTEGER, INTENT(IN) :: sendcount, recvcount
TYPE(MPI_Datatype), INTENT(IN) :: sendtype, recvtype
TYPE(MPI_Comm), INTENT(IN) :: comm
INTEGER, OPTIONAL, INTENT(OUT) :: ierror
MPI_NEIGHBOR_ALLTOALL(SENDBUF, SENDCOUNT, SENDTYPE, RECVBUF, RECVCOUNT, RECVTYPE, COMM, IERROR)
<type> SENDBUF(*), RECVBUF(*)
INTEGER SENDCOUNT, SENDTYPE, RECVCOUNT, RECVTYPE, COMM, IERROR
This function supports Cartesian communicators, graph communicators, and distributed graph communicators as described in Section . If comm is a distributed graph communicator, the outcome is as if each process executed sends to each of its outgoing neighbors and receives from each of its incoming neighbors:
MPI_Dist_graph_neighbors_count(comm,&indegree,&outdegree,&weighted); int *srcs=(int*)malloc(indegree*sizeof(int)); int *dsts=(int*)malloc(outdegree*sizeof(int)); MPI_Dist_graph_neighbors(comm,indegree,srcs,MPI_UNWEIGHTED, outdegree,dsts,MPI_UNWEIGHTED); int k,l; /* assume sendbuf and recvbuf are of type (char*) */ for(k=0; k<outdegree; ++k) MPI_Isend(sendbuf+k*sendcount*extent(sendtype),sendcount,sendtype, dsts[k],...); for(l=0; l<indegree; ++l) MPI_Irecv(recvbuf+l*recvcount*extent(recvtype),recvcount,recvtype, srcs[l],...); MPI_Waitall(...);The type signature associated with sendcount, sendtype, at a process must be equal to the type signature associated with recvcount, recvtype at any other process. This implies that the amount of data sent must be equal to the amount of data received, pairwise between every pair of communicating processes. Distinct type maps between sender and receiver are still allowed.
The ``in place'' option is not meaningful for this operation.
All arguments are significant on all processes and the argument comm must have identical values on all processes.
The vector variant of MPI_NEIGHBOR_ALLTOALL allows sending/receiving different numbers of elements to and from each neighbor.
| MPI_NEIGHBOR_ALLTOALLV(sendbuf, sendcounts, sdispls, sendtype, recvbuf, recvcounts, rdispls, recvtype, comm) | |
| IN sendbuf | starting address of send buffer (choice) |
| IN sendcounts | non-negative integer array (of length outdegree) specifying the number of elements to send to each neighbor |
| IN sdispls | integer array (of length outdegree). Entry j specifies the displacement (relative to sendbuf) from which to send the outgoing data to neighbor j |
| IN sendtype | data type of send buffer elements (handle) |
| OUT recvbuf | starting address of receive buffer (choice) |
| IN recvcounts | non-negative integer array (of length indegree) specifying the number of elements that are received from each neighbor |
| IN rdispls | integer array (of length indegree). Entry i specifies the displacement (relative to recvbuf) at which to place the incoming data from neighbor i |
| IN recvtype | data type of receive buffer elements (handle) |
| IN comm | communicator with topology structure (handle) |
int MPI_Neighbor_alltoallv(const void* sendbuf, const int sendcounts[], const int sdispls[], MPI_Datatype sendtype, void* recvbuf, const int recvcounts[], const int rdispls[], MPI_Datatype recvtype, MPI_Comm comm)
MPI_Neighbor_alltoallv(sendbuf, sendcounts, sdispls, sendtype, recvbuf, recvcounts, rdispls, recvtype, comm, ierror)
TYPE(*), DIMENSION(..), INTENT(IN) :: sendbuf
TYPE(*), DIMENSION(..) :: recvbuf
INTEGER, INTENT(IN) :: sendcounts(*), sdispls(*), recvcounts(*),
rdispls(*)
TYPE(MPI_Datatype), INTENT(IN) :: sendtype, recvtype
TYPE(MPI_Comm), INTENT(IN) :: comm
INTEGER, OPTIONAL, INTENT(OUT) :: ierror
MPI_NEIGHBOR_ALLTOALLV(SENDBUF, SENDCOUNTS, SDISPLS, SENDTYPE, RECVBUF, RECVCOUNTS, RDISPLS,
RECVTYPE, COMM, IERROR)
<type> SENDBUF(*), RECVBUF(*)
INTEGER SENDCOUNTS(*), SDISPLS(*), SENDTYPE, RECVCOUNTS(*), RDISPLS(*), RECVTYPE, COMM, IERROR
This function supports Cartesian communicators, graph communicators, and distributed graph communicators as described in Section . If comm is a distributed graph communicator, the outcome is as if each process executed sends to each of its outgoing neighbors and receives from each of its incoming neighbors:
MPI_Dist_graph_neighbors_count(comm,&indegree,&outdegree,&weighted); int *srcs=(int*)malloc(indegree*sizeof(int)); int *dsts=(int*)malloc(outdegree*sizeof(int)); MPI_Dist_graph_neighbors(comm,indegree,srcs,MPI_UNWEIGHTED, outdegree,dsts,MPI_UNWEIGHTED); int k,l; /* assume sendbuf and recvbuf are of type (char*) */ for(k=0; k<outdegree; ++k) MPI_Isend(sendbuf+sdispls[k]*extent(sendtype),sendcounts[k],sendtype, dsts[k],...); for(l=0; l<indegree; ++l) MPI_Irecv(recvbuf+rdispls[l]*extent(recvtype),recvcounts[l],recvtype, srcs[l],...); MPI_Waitall(...);The type signature associated with sendcounts [k], sendtype with dsts[k]==j at process i must be equal to the type signature associated with recvcounts [l], recvtype with srcs[l]==i at process j. This implies that the amount of data sent must be equal to the amount of data received, pairwise between every pair of communicating processes. Distinct type maps between sender and receiver are still allowed. The data in the sendbuf beginning at offset sdispls [k] elements (in terms of the sendtype) is sent to the k-th outgoing neighbor. The data received from the l-th incoming neighbor is placed into recvbuf beginning at offset rdispls [l] elements (in terms of the recvtype).
The ``in place'' option is not meaningful for this operation.
All arguments are significant on all processes and the argument comm must have identical values on all processes.
MPI_NEIGHBOR_ALLTOALLW allows one to send and receive with different datatypes to and from each neighbor.
| MPI_NEIGHBOR_ALLTOALLW(sendbuf, sendcounts, sdispls, sendtypes, recvbuf, recvcounts, rdispls, recvtypes, comm) | |
| IN sendbuf | starting address of send buffer (choice) |
| IN sendcounts | non-negative integer array (of length outdegree) specifying the number of elements to send to each neighbor |
| IN sdispls | integer array (of length outdegree). Entry j specifies the displacement in bytes (relative to sendbuf) from which to take the outgoing data destined for neighbor j (array of integers) |
| IN sendtypes | array of datatypes (of length outdegree). Entry j specifies the type of data to send to neighbor j (array of handles) |
| OUT recvbuf | starting address of receive buffer (choice) |
| IN recvcounts | non-negative integer array (of length indegree) specifying the number of elements that are received from each neighbor |
| IN rdispls | integer array (of length indegree). Entry i specifies the displacement in bytes (relative to recvbuf) at which to place the incoming data from neighbor i (array of integers) |
| IN recvtypes | array of datatypes (of length indegree). Entry i specifies the type of data received from neighbor i (array of handles) |
| IN comm | communicator with topology structure (handle) |
int MPI_Neighbor_alltoallw(const void* sendbuf, const int sendcounts[], const MPI_Aint sdispls[], const MPI_Datatype sendtypes[], void* recvbuf, const int recvcounts[], const MPI_Aint rdispls[], const MPI_Datatype recvtypes[], MPI_Comm comm)
MPI_Neighbor_alltoallw(sendbuf, sendcounts, sdispls, sendtypes, recvbuf, recvcounts, rdispls, recvtypes, comm, ierror)
TYPE(*), DIMENSION(..), INTENT(IN) :: sendbuf
TYPE(*), DIMENSION(..) :: recvbuf
INTEGER, INTENT(IN) :: sendcounts(*), recvcounts(*)
INTEGER(KIND=MPI_ADDRESS_KIND), INTENT(IN) :: sdispls(*), rdispls(*)
TYPE(MPI_Datatype), INTENT(IN) :: sendtypes(*), recvtypes(*)
TYPE(MPI_Comm), INTENT(IN) :: comm
INTEGER, OPTIONAL, INTENT(OUT) :: ierror
MPI_NEIGHBOR_ALLTOALLW(SENDBUF, SENDCOUNTS, SDISPLS, SENDTYPES, RECVBUF, RECVCOUNTS, RDISPLS, RECVTYPES, COMM, IERROR)
<type> SENDBUF(*), RECVBUF(*)
INTEGER(KIND=MPI_ADDRESS_KIND) SDISPLS(*), RDISPLS(*)
INTEGER SENDCOUNTS(*), SENDTYPES(*), RECVCOUNTS(*), RECVTYPES(*), COMM,
IERROR
This function supports Cartesian communicators, graph communicators, and distributed graph communicators as described in Section . If comm is a distributed graph communicator, the outcome is as if each process executed sends to each of its outgoing neighbors and receives from each of its incoming neighbors:
MPI_Dist_graph_neighbors_count(comm,&indegree,&outdegree,&weighted); int *srcs=(int*)malloc(indegree*sizeof(int)); int *dsts=(int*)malloc(outdegree*sizeof(int)); MPI_Dist_graph_neighbors(comm,indegree,srcs,MPI_UNWEIGHTED, outdegree,dsts,MPI_UNWEIGHTED); int k,l; /* assume sendbuf and recvbuf are of type (char*) */ for(k=0; k<outdegree; ++k) MPI_Isend(sendbuf+sdispls[k],sendcounts[k], sendtypes[k],dsts[k],...); for(l=0; l<indegree; ++l) MPI_Irecv(recvbuf+rdispls[l],recvcounts[l], recvtypes[l],srcs[l],...); MPI_Waitall(...);The type signature associated with sendcounts [k], sendtypes [k] with dsts[k]==j at process i must be equal to the type signature associated with recvcounts [l], recvtypes [l] with srcs[l]==i at process j. This implies that the amount of data sent must be equal to the amount of data received, pairwise between every pair of communicating processes. Distinct type maps between sender and receiver are still allowed.
The ``in place'' option is not meaningful for this operation.
All arguments are significant on all processes and the argument comm must have identical values on all processes.


set ccolor
set ccolor rainbow
set ccolor color#
This command sets the color of the plotted contours. If
ccolor
is set to rainbow
, then GrADS will
use the default rainbow sequence to assign
colors to individual contours, resulting in a pleasing color palette
that spans the range of the plotted values. To draw all contours with
the same color, use the second option, where
color#
may be one of the 16 GrADS default colors or the number of a
user-defined color created with set
rgb.
Usage Notes
set ccolor
is reset by entering clear
or display
.
- The color sequence for the default rainbow
palette is:
9 14 4 11 5 13 3 10 7 12 8 2 6
. This may
be overridden by using the set rbcols
command.
- If the number of colors in the rainbow palette is smaller
than the number of contour levels, then some contour colors will be
repeated -- i.e. not every contour color will be unique. Likewise, if
the number of colors in the rainbow palette is larger than the number
of contour levels, then some colors will be omitted.
- When overlaying contour plots, GrADS will automatically change the
color of the contours for each successive plot in order to distinguish
between different variables. The default order is: rainbow, foreground,
3 (green), 7 (yellow), 2 (red), 6 (magenta), 9 (purple), ....
Examples


The monk introduces himself and explains his intentions in the simplest way, by speaking unaccompanied. The speech is tranquil, steady, and performed almost without movement while the actor remains on Square 1. Although the overall texture remains simple, the inclusion of the narrative that answers the 'who,' 'why,' 'what' and 'where' about the monk, gives this shōdan a higher Intermedia Index than the preceding Nanoribue.
The monk concludes the Nanori by , holding a Buddhist rosary in the right hand. While the origin of this gesture is believed to be related to prayer, it has become a standard closing gesture also used by secular characters such as the Emperor’s envoy in Kokaji.


Before Change
self._running_mean = torch.zeros(in_channels, 1, 1)
self._running_var = torch.ones(in_channels, 1, 1)
self._batch_mean = torch.zeros(in_channels, 1, 1)
self._batch_var = torch.ones(in_channels, 1, 1)
def forward(self, x, compute_jacobian=True):
if self.training:
After Change
self.register_buffer("_running_mean", torch.zeros(in_features))
self.register_buffer("_running_var", torch.ones(in_features))
self.register_buffer("_batch_mean", torch.zeros(in_features))
self.register_buffer("_batch_var", torch.ones(in_features))
def forward(self, x, compute_jacobian=True):
if self.training:
self._batch_mean = x.mean(0)


include "includes/download-head.html"
include "includes/ga.html" include "includes/download-navigation.html"
include "includes/download-top.html"
include "includes/download-delete.html"
include "includes/download-footer.html" include "includes/download-js.html"


We live in a world where development is emphasized both in a local level and international level. However, development projects sometimes do reflect its objective. Rapid economic development brings in technological advancement, but it also increases consumption which sometimes create unsustainable growth. Therefore, to allow development serve its development goal, and to tackle the challenges that current development are facing, DeCon wants to take an interdisplinatory approach. DeCon (DC Development Conference) is a Biennial conference that aims to create a platform for designer, architect, developer, and urbanist, different development fields to engage in furious conversation about development. This year, DC DeCon will focuses on city design. Locally, how city design build strong and sustainable and infrastructure and system that comply with sustainable growth? Internationally, how can city design serve as an resilient tool for resilience to tackle disaster and humanitarian crisis?


Content for 1st class "featured-excrpt" Goes Here
Content for 2nd class "featured-excrpt" Goes Here
Content for 3rd class "featured-excrpt" Goes Here


The returned sequence may be passed between threads safely. However, individual IEnumerator values generated from the returned sequence should not be accessed concurrently.
Parameters
IEnumerable<T>
source1
The first sequence.
IEnumerable<T>
source2
The second sequence.
Return
ParallelQuery<T>
The result sequence.


GSoC 2020 with KDE
Greetings Reader,
Much to my delight, the first phase of my project for GSoC has completed successully. All the goals according to my proposal timeline for the first month have been met and I’m pleased to say that I have passed my first evaluation.
The official email from Google
Hoping for similar results for the next two evaluations :)
So, what happened in Week 4? Here is a quick overview.
Week 4
In my project proposal timeline, I have kept this week (which is the last week before the first evaluation) with lesser work than the rest. I was wary of the fact that some unforseeable problems may creep up during the project and to account for that I had kept some time reserved. Fortunately, no such problem showed up and my work proceeded as planned.
So, the major tasks this week were to rewrite and enable the benchmark tool and ensure that it works as a CTest and to make some changes to the ktoblzcheck command-line tool to allow the support of user-supplied bankdata which had become incompatible due to my previous work.
The command line tool was not much work. It just needed to take the argument from the user, do some error-checking and call the appropriate constructor. Although to make the checking part easier, I included a method in the public API to help in future.
This is a mere translation of a similar function in update-database.py.
The benchmark tool required an almost rewrite. The existing code dealt solely with text file reading, thus had to be replaced. The current benchmarking uses the two functions that were in the existing tool.
The first function, check_bankData_lookup, generates given number of blz and checks them using the AccountNumberCheck::findBank method.
The second function, check_testkontos, takes a file as a parameter and for blz in each row in this file, it generates a random kto and checks the two using AccountNumberCheck::check method.
After pushing these changes, my mentor Ralf suggested to add a --file argument to this tool so as to use this tool with any specified bankdata file. Thus, to handle command-line arguments, I made some further changes using the code from an existing tool in the project.
You can see my commits here : Commit Browser
As outlined in the previous post, all the objectives of this phase are completed.
- A script that generates the SQLite DB using blz datafile downloaded from the Deutsche Bundesbank
- Modifications in the CMake build system to call this script at build time.
- Replacing the part of code that uses the text datafile with the code that reads from this database.
- Updating tests, documentations and benchmark to work with the new database.
- Modifying the command-line tool to enable support for user-supplied database.
So, this marks the end of the first phase of the project. Truly, a remarkable experience.
Learnt so much, still much remains unknown. Hoping to discover more new stuff.
See you in the next post.
Prasun.


Jonathon Brucato Weisse
Home
Theatre
Ping-Pong
Contact
Awesome proximity law: You can be more awesome by proximity!
First Name:
Last Name:
What's your topic of interest?
Awesomeness
Theatre
Ping-Pong
Submit
Reset


Juno <IP_ADDRESS> is a minor update.
- Fixed issue preventing &Accept-Language from being used as a GET parameter.
- Minor XSS vulnerability fix.
- Empty results on HTML pages now shows "no results" instead of a blank page.
- Fixed issues preventing REST pages from rendering HTML in newer versions of Internet Explorer.
- Changed RestServletProperties.REST_allowMethodParam to be disabled by default.


CPack¶
Build binary and source package installers.
Introduction¶
The CPack module generates a file CPackConfig.cmake
intended for
use in a subsequent run of the cpack
program
where it steers the generation of installers or/and source packages.
Inclusion of the CPack module adds two new build targets, package
and package_source
, which build the binary and source installers
respectively. The generated binary installers contain everything
installed via CMake’s install()
command (and the deprecated
commands install_files()
, install_programs()
, and
install_targets()
).
For certain kinds of binary installers (including the graphical
installers on macOS and Windows), CPack generates installers that
allow users to select individual application components to install.
See CPackComponent
module for further details.
CPack Generators¶
The CPACK_GENERATOR
variable has different meanings in different
contexts. In a CMakeLists.txt
file, CPACK_GENERATOR
is a
list of generators: and when cpack
is run with no other
arguments, it will iterate over that list and produce one package for each
generator. In a CPACK_PROJECT_CONFIG_FILE
,
CPACK_GENERATOR
is a string naming a single generator. If you
need per-cpack-generator logic to control other cpack settings, then you
need a CPACK_PROJECT_CONFIG_FILE
.
The CMake source tree itself contains a CPACK_PROJECT_CONFIG_FILE
.
See the top level file CMakeCPackOptions.cmake.in
for an example.
If set, the CPACK_PROJECT_CONFIG_FILE
is included automatically
on a per-generator basis. It only need contain overrides.
Here’s how it works:
cpack
runs- it includes
CPackConfig.cmake
- it iterates over the generators given by the
-G
command line option, or if no such option was specified, over the list of generators given by theCPACK_GENERATOR
variable set in theCPackConfig.cmake
input file. - foreach generator, it then
- sets
CPACK_GENERATOR
to the one currently being iterated - includes the
CPACK_PROJECT_CONFIG_FILE
- produces the package for that generator
- sets
This is the key: For each generator listed in CPACK_GENERATOR
in
CPackConfig.cmake
, cpack will reset CPACK_GENERATOR
internally to the one currently being used and then include the
CPACK_PROJECT_CONFIG_FILE
.
Variables common to all CPack Generators¶
Before including this CPack module in your CMakeLists.txt
file, there
are a variety of variables that can be set to customize the resulting
installers. The most commonly-used variables are:
-
CPACK_PACKAGE_NAME
¶ The name of the package (or application). If not specified, it defaults to the project name.
-
CPACK_PACKAGE_VENDOR
¶ The name of the package vendor. (e.g., “Kitware”). The default is “Humanity”.
-
CPACK_PACKAGE_DIRECTORY
¶ The directory in which CPack is doing its packaging. If it is not set then this will default (internally) to the build dir. This variable may be defined in a CPack config file or from the
cpack
command line option-B
. If set, the command line option overrides the value found in the config file.
-
CPACK_PACKAGE_VERSION_MAJOR
¶ Package major version. This variable will always be set, but its default value depends on whether or not version details were given to the
project()
command in the top level CMakeLists.txt file. If version details were given, the default value will beCMAKE_PROJECT_VERSION_MAJOR
. If no version details were given, a default version of 0.1.1 will be assumed, leading toCPACK_PACKAGE_VERSION_MAJOR
having a default value of 0.
-
CPACK_PACKAGE_VERSION_MINOR
¶ Package minor version. The default value is determined based on whether or not version details were given to the
project()
command in the top level CMakeLists.txt file. If version details were given, the default value will beCMAKE_PROJECT_VERSION_MINOR
, but if no minor version component was specified thenCPACK_PACKAGE_VERSION_MINOR
will be left unset. If no project version was given at all, a default version of 0.1.1 will be assumed, leading toCPACK_PACKAGE_VERSION_MINOR
having a default value of 1.
-
CPACK_PACKAGE_VERSION_PATCH
¶ Package patch version. The default value is determined based on whether or not version details were given to the
project()
command in the top level CMakeLists.txt file. If version details were given, the default value will beCMAKE_PROJECT_VERSION_PATCH
, but if no patch version component was specified thenCPACK_PACKAGE_VERSION_PATCH
will be left unset. If no project version was given at all, a default version of 0.1.1 will be assumed, leading toCPACK_PACKAGE_VERSION_PATCH
having a default value of 1.
-
CPACK_PACKAGE_DESCRIPTION
¶ A description of the project, used in places such as the introduction screen of CPack-generated Windows installers. If not set, the value of this variable is populated from the file named by
CPACK_PACKAGE_DESCRIPTION_FILE
.
-
CPACK_PACKAGE_DESCRIPTION_FILE
¶ A text file used to describe the project when
CPACK_PACKAGE_DESCRIPTION
is not explicitly set. The default value forCPACK_PACKAGE_DESCRIPTION_FILE
points to a built-in template fileTemplates/CPack.GenericDescription.txt
.
-
CPACK_PACKAGE_DESCRIPTION_SUMMARY
¶ Short description of the project (only a few words). If the
CMAKE_PROJECT_DESCRIPTION
variable is set, it is used as the default value, otherwise the default will be a string generated by CMake based onCMAKE_PROJECT_NAME
.
-
CPACK_PACKAGE_HOMEPAGE_URL
¶ Project homepage URL. The default value is taken from the
CMAKE_PROJECT_HOMEPAGE_URL
variable, which is set by the top levelproject()
command, or else the default will be empty if no URL was provided toproject()
.
-
CPACK_PACKAGE_FILE_NAME
¶ The name of the package file to generate, not including the extension. For example,
cmake-2.6.1-Linux-i686
. The default value is:${CPACK_PACKAGE_NAME}-${CPACK_PACKAGE_VERSION}-${CPACK_SYSTEM_NAME}
-
CPACK_PACKAGE_INSTALL_DIRECTORY
¶ Installation directory on the target system. This may be used by some CPack generators like NSIS to create an installation directory e.g., “CMake 2.5” below the installation prefix. All installed elements will be put inside this directory.
-
CPACK_PACKAGE_ICON
¶ A branding image that will be displayed inside the installer (used by GUI installers).
-
CPACK_PACKAGE_CHECKSUM
¶ An algorithm that will be used to generate an additional file with the checksum of the package. The output file name will be:
${CPACK_PACKAGE_FILE_NAME}.${CPACK_PACKAGE_CHECKSUM}
Supported algorithms are those listed by the string(<HASH>) command.
-
CPACK_PROJECT_CONFIG_FILE
¶ CPack-time project CPack configuration file. This file is included at cpack time, once per generator after CPack has set
CPACK_GENERATOR
to the actual generator being used. It allows per-generator setting ofCPACK_*
variables at cpack time.
-
CPACK_RESOURCE_FILE_LICENSE
¶ License to be embedded in the installer. It will typically be displayed to the user by the produced installer (often with an explicit “Accept” button, for graphical installers) prior to installation. This license file is NOT added to the installed files but is used by some CPack generators like NSIS. If you want to install a license file (may be the same as this one) along with your project, you must add an appropriate CMake
install()
command in yourCMakeLists.txt
.
-
CPACK_RESOURCE_FILE_README
¶ ReadMe file to be embedded in the installer. It typically describes in some detail the purpose of the project during the installation. Not all CPack generators use this file.
-
CPACK_RESOURCE_FILE_WELCOME
¶ Welcome file to be embedded in the installer. It welcomes users to this installer. Typically used in the graphical installers on Windows and Mac OS X.
-
CPACK_MONOLITHIC_INSTALL
¶ Disables the component-based installation mechanism. When set, the component specification is ignored and all installed items are put in a single “MONOLITHIC” package. Some CPack generators do monolithic packaging by default and may be asked to do component packaging by setting
CPACK_<GENNAME>_COMPONENT_INSTALL
toTRUE
.
-
CPACK_GENERATOR
¶ List of CPack generators to use. If not specified, CPack will create a set of options following the naming pattern
CPACK_BINARY_<GENNAME>
(e.g.CPACK_BINARY_NSIS
) allowing the user to enable/disable individual generators. If the-G
option is given on thecpack
command line, it will override this variable and anyCPACK_BINARY_<GENNAME>
options.
-
CPACK_OUTPUT_CONFIG_FILE
¶ The name of the CPack binary configuration file. This file is the CPack configuration generated by the CPack module for binary installers. Defaults to
CPackConfig.cmake
.
-
CPACK_PACKAGE_EXECUTABLES
¶ Lists each of the executables and associated text label to be used to create Start Menu shortcuts. For example, setting this to the list
ccmake;CMake
will create a shortcut named “CMake” that will execute the installed executableccmake
. Not all CPack generators use it (at least NSIS, WIX and OSXX11 do).
-
CPACK_STRIP_FILES
¶ List of files to be stripped. Starting with CMake 2.6.0,
CPACK_STRIP_FILES
will be a boolean variable which enables stripping of all files (a list of files evaluates toTRUE
in CMake, so this change is compatible).
-
CPACK_VERBATIM_VARIABLES
¶ If set to
TRUE
, values of variables prefixed withCPACK_
will be escaped before being written to the configuration files, so that the cpack program receives them exactly as they were specified. If not, characters like quotes and backslashes can cause parsing errors or alter the value received by the cpack program. Defaults toFALSE
for backwards compatibility.
Variables for Source Package Generators¶
The following CPack variables are specific to source packages, and will not affect binary packages:
-
CPACK_SOURCE_PACKAGE_FILE_NAME
¶ The name of the source package. For example
cmake-2.6.1
.
-
CPACK_SOURCE_STRIP_FILES
¶ List of files in the source tree that will be stripped. Starting with CMake 2.6.0,
CPACK_SOURCE_STRIP_FILES
will be a boolean variable which enables stripping of all files (a list of files evaluates toTRUE
in CMake, so this change is compatible).
-
CPACK_SOURCE_GENERATOR
¶ List of generators used for the source packages. As with
CPACK_GENERATOR
, if this is not specified then CPack will create a set of options (e.g.CPACK_SOURCE_ZIP
) allowing users to select which packages will be generated.
-
CPACK_SOURCE_OUTPUT_CONFIG_FILE
¶ The name of the CPack source configuration file. This file is the CPack configuration generated by the CPack module for source installers. Defaults to
CPackSourceConfig.cmake
.
-
CPACK_SOURCE_IGNORE_FILES
¶ Pattern of files in the source tree that won’t be packaged when building a source package. This is a list of regular expression patterns (that must be properly escaped), e.g.,
/CVS/;/\\.svn/;\\.swp$;\\.#;/#;.*~;cscope.*
Variables for Advanced Use¶
The following variables are for advanced uses of CPack:
-
CPACK_CMAKE_GENERATOR
¶ What CMake generator should be used if the project is a CMake project. Defaults to the value of
CMAKE_GENERATOR
. Few users will want to change this setting.
-
CPACK_INSTALL_CMAKE_PROJECTS
¶ List of four values that specify what project to install. The four values are: Build directory, Project Name, Project Component, Directory. If omitted, CPack will build an installer that installs everything.
-
CPACK_SYSTEM_NAME
¶ System name, defaults to the value of
CMAKE_SYSTEM_NAME
, except on Windows where it will bewin32
orwin64
.
-
CPACK_PACKAGE_VERSION
¶ Package full version, used internally. By default, this is built from
CPACK_PACKAGE_VERSION_MAJOR
,CPACK_PACKAGE_VERSION_MINOR
, andCPACK_PACKAGE_VERSION_PATCH
.
-
CPACK_TOPLEVEL_TAG
¶ Directory for the installed files.
-
CPACK_INSTALL_COMMANDS
¶ Extra commands to install components.
-
CPACK_INSTALLED_DIRECTORIES
¶ Extra directories to install.
-
CPACK_PACKAGE_INSTALL_REGISTRY_KEY
¶ Registry key used when installing this project. This is only used by installers for Windows. The default value is based on the installation directory.
-
CPACK_CREATE_DESKTOP_LINKS
¶ List of desktop links to create. Each desktop link requires a corresponding start menu shortcut as created by
CPACK_PACKAGE_EXECUTABLES
.
-
CPACK_BINARY_<GENNAME>
¶ CPack generated options for binary generators. The
CPack.cmake
module generates (whenCPACK_GENERATOR
is not set) a set of CMake options (see CMakeoption()
command) which may then be used to select the CPack generator(s) to be used when building thepackage
target or when runningcpack
without the-G
option.


WITNESS LIST Natural Resources Committee May 2, 2005-2:00P HB 2425 For: Butler, Susan (San Antonio Water System) Robbins, Dean (Texas Water Conservation Association) Rochelle, Martin (N. Texas Mun. Water Dist, Upper Trinity Reg. Water Dist, City of Cleburne, San Antonio Water Sys.) Against: Hess, Myron (National Wildlife Federation) Kelly, Mary E. (Environmental Defense) Kramer, Ken (Lone Star Chapter, Sierra Club) Lowerre, Richard (Caddo Lake Institute) HB 3284 Against: Petersen, Ken (Texas Rural Water Association) HB 3539 For: Lilley, Virgil E. (Lampasas County Commissioner's Court and the Saratoga Underground Water Cons. Dist.) HB 3546 For: Henderson, Wyatt (Marlin Atlantis/Whitstone Houston Land) Kugle, Julianne (Marlin Atlantis) HB 3559 For: Hawes, Jay (Fate Land, L.P.) On: Holcomb, Doug (Texas Commission on Environmental Quality) HB 3561 For: Petersen, Ken (Texas Rural Water Association) On: Holcomb, Doug (Texas Commission on Environmental Quality) HB 3564 For: Martinez, Sebastian (Self) Against: Blair, Dist. Eng., Dr. Al (El Paso County Water Improvement District #1) Ivey, Arthur (El Paso County Water Improvement District #1) Reyes, General Mgr., Jesus (El Paso County Water Improvement #1) HB 3565 For: Kosub, Steve (San Antonio Water System) Against: Clement, James (Bexar Metropolitan Water District Board of Directors, District #5) Contero, J. Fernando (Self) Gallegos, Jr., Jose (Bexar Metropolitan Water District) Harris, Cty Admin., David J. (City of Hill Country Village) Martin, M. Paul (Bexar Metropolitan Water District) Martinez, Lorenzo G. (Self) Norcross, Kip (City of Somerset) Olivares, Gil (Bexar Metropolitan Water District) Rosenberg, Louis T. (Bexar Metropolitan Water District) Shands, Mike (Self and City of Castle Hills) Villarreal, Victor V. (Bexar Metropolitan Water District - President, Board of Directors) Wertz, Linda (City of Somerset) HB 3574 For: Stepherson, Angela (Huffines Communities) HB 3576 For: Gershon, Mike (Benbrook Water and Sewer Authority) Wasson, David L. (Benbrook Water and Sewer Authority) HB 3577 For: Kugle, Julianne (Prime Tex Realty Group, LC) Stone, Spencer (Prime Tex Realty Group, LC) SB 509 On: Schwartz, Suzanne (Texas Water Development Board) SB 1065 For: Adams, Janet (Jeff Davis County Underground Water Conservation District) Adams, Janet (Presidio County Underground Water Conservation District)