Release Notes for the Advance Toolchain __VERSION_RELEASE__
__FEATURES__ back to top
Support
Customer support for the Advance Toolchain (AT) is provided in one of three ways:
- If you are using AT as directed by an IBM product team (ex.: IBM XL Compiler or PowerVM Lx86) please report suspected AT problems to IBM Support using that product name and entitlement.
- IBM's Support Line for Linux Offerings now provides support for the Advance Toolchain as well. If you have a contract with a Support Line for Linux, place a call to IBM Support, e.g. for United States:
- Dial 1-800-426-IBM-SERV
- Option #2 (Other business products or solutions)
- Option #2 (Software)
- Option #7 (Other OS/Linux)
- All other users can use an electronic forum that is monitored Monday through Friday. For questions regarding the use of or to report a suspected defect in AT, click here.
- Log in.
- Start a topic.
- Enter and save your question or problem.
- An initial response will be attempted within 2 business days.
Installation
__INST__Manual installation for rpms
If you are installing the rpms manually you will need to install them in the following order (due to prerequisites):
advance-toolchain-__VERSION__-runtime-__VERSION_RELEASE__ advance-toolchain-__VERSION__-devel-__VERSION_RELEASE__ advance-toolchain-__VERSION__-perf-__VERSION_RELEASE__ advance-toolchain-__VERSION__-mcore-libs-__VERSION_RELEASE__ advance-toolchain-__VERSION__-runtime-at__OLD_VERSION__-compat-__VERSION_RELEASE__
If you are updating a previous installation, you need to update as a batch, so rpm can solve the dependencies, i.e.:
rpm -Uvh advance-toolchain-__VERSION__-runtime-__VERSION_RELEASE__.ppc64.rpm \ advance-toolchain-__VERSION__-devel-__VERSION_RELEASE__.ppc64.rpm \ advance-toolchain-__VERSION__-perf-__VERSION_RELEASE__.ppc64.rpm \ advance-toolchain-__VERSION__-mcore-__VERSION_RELEASE__.ppc64.rpm \ advance-toolchain-__VERSION__-runtime-at__OLD_VERSION__-compat-__VERSION_RELEASE__.ppc64.rpm
The rpm command should always be run as root. Failure to do so will result in an error similar to this:
error: can't create transaction lock on /var/lib/rpm/__db.000
Important notes
- Timezone files: If you need to use something different than Factory, then you should copy the timezone file you want from /opt/__VERSION__/share/zoneinfo to /opt/__VERSION__/etc/localtime
- advance-toolchain-__VERSION__-runtime-compat-__VERSION_RELEASE__: DO NOT INSTALL it on RHEL7 and beyond. These are intended for runtime compatibility on RHEL6 only (see below).
Installation for runtime compatibility on previous distribution versions
Users running applications on previous distributions of SLES or RHEL may install the compatibility rpm advance-toolchain-__VERSION__-runtime-compat-__VERSION_RELEASE__ in order to get the Advance Toolchain runtime libraries.
Installation of the cross-compiler (x86)
You can download advance-toolchain-__VERSION__-cross-__VERSION_RELEASE__ and install in a x86 machine to build Power binaries on it. Binaries generated by the cross-compiler will run on a Power system with the same version of the Advance Toolchain installed.
back to topDocumentation
The official documentation for the Advance Toolchain is available at the IBM Power Linux Community website.
back to topLegal notices
Each component of Advance Toolchain has its own license, they are all covered by this list:
- LGPL 2.1: https://www.gnu.org/licenses/old-licenses/lgpl-2.1.en.html
- GPL 2.0: https://www.gnu.org/licenses/old-licenses/gpl-2.0.en.html
- GPL 3.0: https://www.gnu.org/licenses/gpl-3.0.en.html
- MIT
- BSD
- PYTHON SOFTWARE FOUNDATION LICENSE VERSION 2
- Boost Software License 1.0
- Eclipse Public License (EPL) 1.0
- Zlib
- Apache License 2.0
The licenses for each GPL and LGPL code segment can be found in the advance-toolchain-__VERSION__-src-__VERSION_RELEASE__.tgz file in the repository, the others are listed below.
In order to comply with the GPL and LGPL licenses, the source code for the following packages is available:
- binutils (GPL 2.0)
- gcc (GPL 3.0)
- gdb (GPL 2.0)
- glibc (LGPL 2.1)
- gmp (GPL 3.0)
- Threading Building Blocks (GPL 2.0)
- libdfp (LGPL 2.1)
- libhugetlbfs (LGPL 2.1)
- libvecpf (LGPL 2.1)
- linux kernel (GPL 2.0)
- mpc (GPL 3.0)
- mpfr (GPL 3.0)
- Userspace RCU (LGPL 2.1)
- Valgrind (GPL 2.0)
- libnxz (GPL 2.0)
Boost
Boost Software License - Version 1.0 - August 17th, 2003
Permission is hereby granted, free of charge, to any person or organization
obtaining a copy of the software and accompanying documentation covered by
this license (the "Software") to use, reproduce, display, distribute,
execute, and transmit the Software, and to prepare derivative works of the
Software, and to permit third-parties to whom the Software is furnished to
do so, all subject to the following:
The copyright notices in the Software and this entire statement, including
the above license grant, this restriction and the following disclaimer,
must be included in all copies of the Software, in whole or in part, and
all derivative works of the Software, unless such copies or derivative
works are solely in the form of machine-executable object code generated by
a source language processor.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE.
Expat (MIT)
Copyright (c) 1998, 1999, 2000 Thai Open Source Software Center Ltd and Clark Cooper
Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006 Expat maintainers.
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Golang (BSD)
Copyright (c) 2012 The Go Authors. 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.
* Neither the name of Google Inc. nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.

Gperftools (BSD)
Copyright (c) 2005, Google Inc. 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.
* Neither the name of Google Inc. nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.

Libauxv (BSD)
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.
* Neither the name of the IBM Corporation nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.

Libpfm (MIT)
Copyright (c) 2002-2006 Hewlett-Packard Development Company, L.P.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
of the Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE
OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
OpenSSL (BSD)
Copyright (c) 1998-2011 The OpenSSL Project. All rights reserved.
Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com). All rights reserved.
* Note: this distribution of OpenSSL does not include the IDEA and RC5 algorithms
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
2. 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.
3. All advertising materials mentioning features or use of this software must display the following acknowledgment: "This product includes software developed by the OpenSSL Project for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to endorse or promote products derived from this software without prior written permission. For written permission, please contact<EMAIL_ADDRESS>5. Products derived from this software may not be called "OpenSSL" nor may "OpenSSL" appear in their names without prior written permission of the OpenSSL Project.
6. Redistributions of any form whatsoever must retain the following acknowledgment: "This product includes software developed by the OpenSSL Project for use in the OpenSSL Toolkit (http://www.openssl.org/)"
THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
This product includes cryptographic software written by Eric Young (eay@cryptsoft.com). This product includes software written by Tim Hudson (tjh@cryptsoft.com).
PAFLib (MIT)
Copyright IBM Corp. 2013
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
 IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM
,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
Python
Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 Python Software Foundation; All Rights Reserved
PYTHON SOFTWARE FOUNDATION LICENSE VERSION 2
--------------------------------------------
1. This LICENSE AGREEMENT is between the Python Software Foundation ("PSF"), and the Individual or Organization ("Licensee") accessing and otherwise using this software ("Python") in source or binary form and its associated documentation.
2. Subject to the terms and conditions of this License Agreement, PSF hereby grants Licensee a nonexclusive, royalty-free, world-wide license to reproduce, analyze, test, perform and/or display publicly, prepare derivative works, distribute, and otherwise use Python alone or in any derivative version, provided, however, that PSF's License Agreement and PSF's notice of copyright, i.e., "Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 Python Software Foundation; All Rights Reserved" are retained in Python alone or in any derivative version prepared by Licensee.
3. In the event Licensee prepares a derivative work that is based on or incorporates Python or any part thereof, and wants to make the derivative work available to others as provided herein, then Licensee hereby agrees to include in any such work a brief summary of the changes made to Python.
4. PSF is making Python available to Licensee on an "AS IS" basis. PSF MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED. BY WAY OF EXAMPLE, BUT NOT LIMITATION, PSF MAKES NO AND DISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESS FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF PYTHON WILL NOT INFRINGE ANY THIRD PARTY RIGHTS.
5. PSF SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF PYTHON FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS AS A RESULT OF MODIFYING, DISTRIBUTING, OR OTHERWISE USING PYTHON, OR ANY DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF.
6. This License Agreement will automatically terminate upon a material breach of its terms and conditions.
7. Nothing in this License Agreement shall be deemed to create any relationship of agency, partnership, or joint venture between PSF and Licensee. This License Agreement does not grant permission to use PSF trademarks or trade name in a trademark sense to endorse or promote products or services of Licensee, or any third party.
8. By copying, installing or otherwise using Python, Licensee agrees to be bound by the terms and conditions of this License Agreement.
SPHDE (EPL)
Copyright (c) 2012 IBM Corporation
Distributed through the Eclipse Public License 1.0. The source code for this project is available on GitHub.
ZLIB Compression Library
(C) 1995-2013 Jean-loup Gailly and Mark Adler
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it
freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must not
claim that you wrote the original software. If you use this software
in a product, an acknowledgment in the product documentation would be
appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be
misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
PVEC Library (Apache License 2.0)
Apache License
Version 2.0, January 2004
http://www.apache.org/licenses/
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
1. Definitions.
"License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document.
"Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License.
"Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
"You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License.
"Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files.
"Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types.
"Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below).
"Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof.
"Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution."
"Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work.
2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form.
3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed.
4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions:
- You must give any other recipients of the Work or Derivative Works a copy of this License; and
- You must cause any modified files to carry prominent notices stating that You changed the files; and
- You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and
- If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License.
You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License.
5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions.
6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file.
7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License.
8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages.
9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability.
END OF TERMS AND CONDITIONS
NX GZIP library (Apache License 2.0)
Apache License
Version 2.0, January 2004
http://www.apache.org/licenses/
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
1. Definitions.
"License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document.
"Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License.
"Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
"You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License.
"Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files.
"Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types.
"Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below).
"Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof.
"Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution."
"Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work.
2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form.
3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed.
4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions:
- You must give any other recipients of the Work or Derivative Works a copy of this License; and
- You must cause any modified files to carry prominent notices stating that You changed the files; and
- You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and
- If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License.
You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License.
5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions.
6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file.
7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License.
8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages.
9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability.
END OF TERMS AND CONDITIONS


org.apache.xerces.validators.schema.identity
Class Selector.Matcher
java.lang.Object
|
+--org.apache.xerces.validators.schema.identity.XPathMatcher
|
+--org.apache.xerces.validators.schema.identity.Selector.Matcher
- Enclosing class:
- Selector
- protected class Selector.Matcher
- extends XPathMatcher
Selector matcher.
- Author:
- Andy Clark, IBM
| Methods inherited from class java.lang.Object |
clone,
equals,
finalize,
getClass,
hashCode,
notify,
notifyAll,
wait,
wait,
wait |
fFieldActivator
protected FieldActivator fFieldActivator
- Field activator.
fElementDepth
protected int fElementDepth
- Element depth.
fMatchedDepth
protected int fMatchedDepth
- Depth at match.
Selector.Matcher
public Selector.Matcher(Selector.XPath xpath,
FieldActivator activator)
- Constructs a selector matcher.
startDocumentFragment
public void startDocumentFragment(StringPool stringPool)
throws java.lang.Exception
- Description copied from class: XPathMatcher
- The start of the document fragment.
- Overrides:
- startDocumentFragment in class XPathMatcher
- Tags copied from class: XPathMatcher
- Parameters:
namespaceScope
- The namespace scope in effect at the
start of this document fragment.grammar:
- the schema grammar we're validating against.- Throws:
- SAXException - Thrown by handler to signal an error.
startElement
public void startElement(QName element,
XMLAttrList attributes,
int handle,
int elemIndex,
SchemaGrammar grammar)
throws java.lang.Exception
- The start of an element. If the document specifies the start element
by using an empty tag, then the startElement method will immediately
be followed by the endElement method, with no intervening methods.
- Overrides:
- startElement in class XPathMatcher
- Parameters:
element
- The name of the element.attributes
- The element attributes.handle:
- beginning of the attribute listelemIndex:
- index of the element holding these attributesgrammar:
- the SchemaGrammar that all this is being validated by- Throws:
- SAXException - Thrown by handler to signal an error.
endElement
public void endElement(QName element,
int elemIndex,
SchemaGrammar grammar)
throws java.lang.Exception
- Description copied from class: XPathMatcher
- The end of an element.
- Overrides:
- endElement in class XPathMatcher
- Tags copied from class: XPathMatcher
- Parameters:
element
- The name of the element.eIndex:
- the elementDeclIndex of the current element;
needed so that we can look up its datatypeValidator.- Throws:
- SAXException - Thrown by handler to signal an error.
Copyright © 1999-2001 Apache XML Project. All Rights Reserved.


cloud
sidekick
velocity
cloud
sidekick
Username:
Password:
Login
Forgot password?
By using Cloud Sidekick, you agree to the
Terms and Conditions
.
Please select a new password.
Password:
Confirm:
Please answer your security question.
Question:
Answer:


This action will save the current state of the template to a local file called data.txt. The data from this file will be used to pre-populate the template fields in the future. This comes handy when you want to save your default details such as company address, logo, currency, notes, etc., so you don't need to re-enter them every time.
After clicking the button below, you'll be prompted to save the file.
Make sure to name this file data.txt and save it in the template directory. If the file already exists, overwrite it.
Note: Saving the state of the template is not intended to store an actual instance of the invoice for record keeping. For this, you should either save the invoice to PDF (by using the Print option) or save it online.
Save data.txt
Right click the button and choose "Download Linked File As..."


Want a college scholarship?
If you've got the passion and skills, we've got the expertise and commitment to get you the scholarship you've been dreaming of.
Find Out MoreLess than 5% of student athletes get college scholarhsips. Sounds daunting, but the truth is college coaches can't possibly recruit you if they don't know you. We hustle to get you looking your best in front of the coaches you care about. Our search is tailored to your geographical preferences, academic standing, and athletic ability. From there, coaches will contact you to get to know you. We will be with you step by step during this process, so you know what to do and say, and what to avoid.
Get Started!We learn your specific goals and agree on a plan to get there.
We get you in front of thousands of coaches, in an eye catching profile
1 on 1 guidance at every step to ensure you nail the recruitment process
Once your scholarhhip is secured, celebrate!
Whether you are looking for a bit of advice or want to get started, we can't wait to help you reach your goals!
951-232-78189


Limerick One
The limerick packs laughs anatomical
In space that is quite economical,
But the good ones I've seen
So seldom are clean,
And the clean ones so seldom are comical.
The limerick packs laughs anatomical
In space that is quite economical,
But the good ones I've seen
So seldom are clean,
And the clean ones so seldom are comical.
Let my viciousness be emptied,
Desire and lust banished,
Charity and patience,
Humility and obedience,
And all the virtues increased.


[Background on Dave and Joe can be found in the earlier scenarios.]
The night of the party rolls around, and Dave is on stage setting up his equipment. Joe has all the speakers set up around the dance floor, and Dave syncs up his new AndroiDJ, the newest Android cell phone DJ software, to the speakers. He will control the music from his cell phone. Now, Dave came prepared. Even though he had another tough week of classes, Dave found time create a playlist of about 5 hours' worth of music that he would play that night. With his new software on his phone, Dave had his list of songs queued up in his playlist ready to go. The first song was ready to play, and the next song was "on-deck."
Hundreds of people start showing up to the party, and Dave starts playing his music. But, what Dave wanted to do was to take requests from the audience. So he walked around the party and added each requested song to the end of his playlist. He had most of the requested songs in his library but he noticed that he had been getting the same request from many of the sorority girls at the party, "Party in the USA" by Miley Cyrus. Dave knew he didn't have this song and decided to find the song on Youtube using the searching feature. He hit the search icon and used his on-screen keyboard to type in the song information that he know. Dave had big fingers, so he misspelled a few words. Luckily, these were auto-corrected for him (1). He then streamed it into his cell phone, and played it next. When the girls hear the song, they go wild. Dave knew that the song was streamed and that it would have a little audio interference. So Dave decided to use his software to make the song sound a lot better. He used the AutoEQ button and EQ'ed his song, masking the bad quality with an automated low-pass filter. Although this is an advance technique, Dave was able to use it quite easily, as the interface allowed him to draw in his automations using his finger (2). Dave was pleased to find that his automations behaved exactly as he expected, even with only a little experience. But as Dave was playing with the automation, he forgot to play another song from the requested list. Dave doesn't panic as he quickly hits the back button and then swipes up a "drawer" to expose the play controls. A song starts playing. Dave then makes sure all of his songs are lined up the way he wants them to be, swiping the "drawer" down to hide the controls. That way he can't accidentally hit a button to mess up the sound, yet has smooth and fast access to important controls (3). Dave is a huge hit. Everyone loves his DJ-ing skills.
This scenario reflects Information Design in that Dave is able to more easily accomplish his tasks due to the new user interface. Using the on-screen keyboard is much more appropriate in a DJing situation than, say, voice recognition, which would get blotted out in the noise. Having Dave naviguate through complex menu's in the cloud would be much too demanding, since there are millions of artists to choose from.
The AutoEQ feature is also quite an appropriate use of the touch-screen. With it, Dave is able to visually express what he wants to hear. His actions are backed up by color and actual audio confirmation. With a small learning curve, Dave is a master of a feature that is usually only a characteristic experienced DJ's possess.
Consider again Alex is at a party where a DJ is providing music. The DJ plays several popular tracks and everyone is having a great time. Then the DJ plays a "mash-up". Using the multitouch playback controls, he is able to change the volume of one song, while changing the pitch. This creates a very popular building "swoop" sound effect that the audience loves. The DJ was also able to use this effect to help the terrible sounding "mash-ups". He could leave one song at a low volume while quickly finding the appropriate pitch to match the beat perfectly to the other song (1). This led to less obvious and shorter-lived embarassments. In addition to the multitouch volume/pitch combination, he also changes the volume/pan. This is traditionally done using a 2D graph, but since he is able to control each variable with an independant finger, he is able to achieve a rotary effect that isn't commonly heard. However, he is sweaty, and often messes up the precise touch needed to effectively control the screen (2). Even with the mistakes, this unique sound makes him even more enjoyable to Alex.
In the Activity Scenario, the DJ enjoyed the new features, but ended up making mistakes with them. He picked two songs that didn't go together very well. Even though he attempted to match the beats, having both songs at the same volume made the mistake very obvious and embarassing. Being able to control the pitch and the volume for the song he was trying to bring in was very helpful. To his expectant ear, he could make the changes before his less attentive audience could really pick up on them. Also, even though the DJ had the panning feature available in the Activity Scenario, he wasn't able to utilize it in a new way until the multitouch interface came along.


Hey my name is Evan Nishi, and I'm a rising sophomore at Las Lomas High School. I have a passion for learning and teaching in the field of computer science and math. I also enjoy history, languages, and tinkering with electronics. I am very active in the programming communty, and do side projects which you can check out on my github. Feel free to poke around!


Millions of people come to petitions.org to start and sign petitions that boldly call for social change. Become a member today and fuel our mission to empower EVERYONE to create the kind of change they want to see.
Our Promise: Welcome to Care2, the world’s largest community for good. Here, you’ll find over 45 million like-minded people working towards progress, kindness, and lasting impact.
Petition.org Stands Against: bigots, bullies, science deniers, misogynists, gun lobbyists, xenophobes, the willfully ignorant, animal abusers, frackers, and other mean people. If you find yourself aligning with any of those folks, you can move along, nothing to see here.
Petition.org Stands With: humanitarians, animal lovers, feminists, rabble-rousers, nature-buffs, creatives, the naturally curious, and people who really love to do the right thing. You are our people. You Care. We Care2.
Use for trending topics:Topics for Change.org petitions have grown to include disagreement with the Academy Awards and removing milk from certain types of coffee. The authors of these petitions have been criticized for focusing on first world problems. Further debate over the content of petitions came in November 2014 when Martin Daubney called some of them "bizarre" and stated that the site was being used to promote censorship.
Contribute Monthly
We help people reach the business and government leaders whose decisions impact their lives, giving them the power they deserve. Connecting advocates and decision makers facilitates meaningful changes in policies, laws and business practices.
Two 11-year old students started out with a science project about plastic waste. With help from Change.org, their project grew into an international campaign asking Starbucks to reduce their impact on the environment. Over 340,000 signatures later, their campaign influenced Starbucks CEO Kevin Johnson to invest $10 million USD to develop a fully recyclable and compostable cup.
While there’s no information yet as to when the Equality Act will go before the Senate for a vote,
we do know this: Politicians need votes to stay in office. Votes come from the people.
Pressure from massive amounts of people is a major way to push politicians towards positive change.
LONDON, ENGLAND - DECEMBER 03: Green Party MP Caroline Lucas, (C), Labour MP Chuka Umunna (L)
and Conservative MP Justine Greening (R) join members of the 'Independent and the Peoples Vote campaign group',
to hand in a petition.
to Downing Street calling for the public to be given a chance to reject the final Brexit deal
in favour of staying in the EU,
LONDON, ENGLAND - FEBRUARY 26: Protesters for a change in Northern Irish law on abortion
remove petitions from suitcases outside the Northern Ireland Office at Parliament Square on February 26, 2019
in London, England.
Each protester with Amnesty International carried a suitcase containing sheets of paper with the names of 62,000 people


Podcasts |
This month the Codurance team have been fascinated by this podcast, documenting the dramatic story of the Apollo 11 moon landing, including the technology that made it all happen.
{{> _button mcEdit="reference-component-entry-button--pipe"}}
Podcasts |
||
|
|
This month the Codurance team have been fascinated by this podcast, documenting the dramatic story of the Apollo 11 moon landing, including the technology that made it all happen.
{{> _button mcEdit="reference-component-entry-button--underline"}}


§390-6 Rules. The director shall adopt rules pursuant to chapter 91, necessary for the purpose of this chapter. [L 1969, c 162, pt of §2; am L 2003, c 61, §5]


About
Getting started with Python
We are very pleased to share the report from Girlscript Jamshedpur on the outcome of the online bootcamp
session on "Getting started with python" organised by Girlscript Jamshedpur at WebEx meet on 17th (6 p.m to
7 p.m) and 18th April (6 p.m to 7:14 p.m) was a successful one with our mentor Shambhavi Gupta who is an
instructor at Udemy python programming and a data science enthusiast. She is a brilliant teacher and very
professional. Also the way she interacted with our attendees, grabbing out everyone interest was
outstanding.
Python is widely used , high - level , general purpose , interpreted , dynamic programming language in
today's world .The bootcamp event on Python was very helpful for the candidates .
On 17th April Saturday session was started by very nice introduction of about our organisation and our
mentor by Zuneha Khanam (member of Management team ) and Divyansh Sinha (Web Developer).
And on sunday 18th April Zuneha started by welcoming the guest speaker.At 7:14 meeting was ended by Zuneha
Khanam , Aditya (Cheapter head ) by vote of thanks and gratitude to all the attendees and mentor Shambhavi .
A total of two hours of content was decided to be given but on 2nd day she (our mentor ) came out of her
busy schedule and gave around extra of 10 minutes to the attendees .And along with 2 hours 10 minutes
content some of 2 to 3 pre-recorded videos for installation and environment setup of python was given to the
registered candidates before the session , so that they don't find any difficulty or face problem in setting
up environment .
Topics that were covered include introduction to python and related projects. She also cleared doubts asked
by our attendees. On the First day (17th April ) she discussed about operators (arithmetic operators ,
logical operators , comparison operators ) ,keywords , variables , identifiers ,data type (char , int ,
float , string , double ) and others. She also discussed about the most common mistake that often fresh
learner of python do ,that is learner could not differentiate between strings and variables ,they take
strings as variable and sometimes variable as string . She gave homework on searching more about explicit
and implicit conversion .
On the 2nd day (18th April) she taught Explicit and Implicit conversion and a project on 'set reminder'.
She was so much happy with attendees responses on her every question that she gave a shocking surprise to
the learners . She provided the link of Udmey course which was made free for all the attendees , if they
register before 20 April.
Here, is the key take from the event :-
* Scope of Python programming .
* What can we do with python ?
* Python importance in today's world .
* Why python is most widely used than other programming language?
Last but not the least Girlscript Jamshedpur would like give devote vote of thanks to all GirlScript members
, mentor Shambhavi Gupta and learners for making the session more interactive and bringing out a great
success.


We are the Hoodies
We are a community of many different people. Some of us are developers, others are non-coding experts. Some of us love coffee, others prefer tea or water; some of us like cheesecake, others love burritos, and some of us like robots.
What we have in common is that we all enjoy a good night’s sleep, and we all think that the web can only have a future if it's independent, decentralised and built in diverse communities. And we want Hoodie to do its part to turn this into reality. This is why we’re working on this Open Source project. Together, we are strong. Together, we are the Hoodie Community.


'You have very good English for a Nigerian girl': RTÉ journalist, 23, opens up about racism
An RTÉ journalist has opened up about the racial abuse she has received both online and in real life.
Zainab Boladale, 23, started working in RTÉ in 2017 as a presenter for news2day and currently works with Nationwide.
Ms Boladale is a fluent Irish speaker and comes from Clare, having moved to Ennis when she was four.
Over the weekend, she took to Twitter to highlight some of the racism directed at her online.
"For months and months, a YouTube channel constantly compiled videos of me from my account/social/TV etc," she wrote.
"When I used to write articles they’d post it on racist forums - Talking about racism when you’re a POC [person of colour] is tiring because the experience feels overwhelming.
"After months of reporting the channel - YouTube finally took it down (I’m guessing others featured on that channel complained too)."
Attaching screeshots, the comments on the videos contained racist and insulting language.
Speaking to RTÉ's News at One, Ms Boladale said she spoke up "out of frustration".
"I think I was just felt really fed up," she said.
"And there was just a lot out there in the media about the questions about racism, whether or not Ireland was racist."
She said she felt "irritated that we were still having this conversation, because I felt like we're constantly having the conversation about what is racist and what isn't.
"It's clear what is and what isn't."
Ms Boladale also highlighted that she also experienced racism in real life while working on a story about Direct Provision.
"I was out recently on a report and someone stopped me in a field," she said.
"I was in the midlands and someone stopped me and was questioning whether or not...I think they had thought that I was someone from Direct Provision."
Ms Boladale said the person asked where she was from. When she replied "Clare" the person laughed and asked again.
"Then he asked a third time and I got that he wanted to know where I'm 'originally from'."
When she said Nigeria, Ms Boladale said the person replied saying "You have very good English for a Nigerian girl.
She said the man laughed "condescendingly" when she told him she was an RTÉ reporter.
Ms Boladale said the incident "put a downer" on her day adding that it was tough "when you're trying to do your job and you have these things thrown at you."
Jon Williams, Managing Director of RTÉ News and Current Affairs, said in a statement:
"All of us in RTÉ are disgusted that anyone should have to put up with such vile behaviour.
"Zainab's grace and dignity stands in sharp contrast to the cowardice of the bullies who've abused her.
"Sadly harassment of journalists is nothing new. But we expect the social media companies to act quickly and decisively to protect victims.
"All of her RTÉ family stand with Zainab and abhor any kind of racism."
READ MORE
Woman loses €75k defamation claim over 'upset' caused by being asked if she paid for Bag for Life


Draw filter example
Manipulate a filter and a geoJSON data structure will be shown on the console.log.
Create
Clear


In one of my earlier entries I wrote a bit about systemd, but I did not elaborate on it sufficiently. The time has come.
To those unfamiliar with the topic, systemd is a Linux init system, but also a device and service manager. It governs the boot sequence, drive mounting, networking, etc. In other words, it's pivotal to the proper functioning of a Linux operating system. It was originally developed as a pet project by a Red Hat employee, Lennard Poettering. After initial resistance from Red Hat, it gained enough traction in the Linux community to be included in Fedora, Arch Linux and much, much later in Debian, Ubuntu and finally back in CentOS and RHEL.
In and of itself, systemd doesn't sound like a bad idea - an effort to unify and standardize the Linux ecosystem. Fantastic, right? The issues become slightly more noticeable when one looks under the hood.
Firstly, systemd seems to have been designed in a vacuum, with complete disregard for the design principles behind Unix-like operating systems. I'm talking about transparency (parsable clear-text log files and program output), modularity (each component can be used independently, but when used together they display incredible synergy) and ease of understanding (it is apparent what each component does, without the need to study it thoroughly). Systemd is none of that. More so, it falls prey to bugs which had been addressed in other Unix system software in the past and could be considered obvious exploits.
Secondly, it was adopted too rapidly. See: the mention of critical bugs before, and the fact that the Linux ecosystem was not ready for a change of such a caliber. What I mean is a migration from convoluted and ugly System V init Shell scripts to poorly-documented, beta-quality service unit definitions in INI format. Things could and did go horribly wrong sometimes, like services failing and getting constantly restarted without ever reaching an active state or services blocking each other due to unfulfilled dependencies.
Thirdly, systemd led to accidental vendor lock-in in the case of major projects like the KDE and GNOME desktop environments. This fact was somewhat neglected, because systemd was being continuously marketed as modern, intuitive and useful. This is true to some extent, but I feel that the Linux ecosystem suffered more than it profited from this arrangement. After all, the very definition of Linux has always been choice. The right to decide on the distribution, installed software, programming environment. Perhaps also the init system? We used to have System V init scripts, Upstart, OpenRC, etc. I admit, none of these systems is / was perfect, but up until now we at least had a choice. Let's have a look at OpenRC as a case study.
OpenRC is one of the init system options available in Gentoo (systemd being the other). It utilizes a global Unix-inspired
configuration file /etc/rc.conf
to manage core aspects of the boot process. OpenRC also handles drive mounting and
manages system services via the rc-service
module. In principle, it serves the same role as systemd with a number
of exceptions:
systemctl
, which if broken, makes systemd unusable)
As nothing directly depends on OpenRC, I am free to do whatever I want with my operating system. Problems start when one wants to use a more feature-complete desktop environment like MATE, for instance. It's similar to Xfce, GNOME3 and KDE, but more akin to the look and feel of GNOME2. Hence, a perfectly reasonable choice, even for weaker computers. However, in order to use any of the major desktops one needs systemd or at least some bits of it.
I find it quite reasonable that popular desktop environments try to take advantage of systemd, but why, God why, does it have to be mandatory? Why do I need to limit myself to a specific init system, and often by extension to a specific range of distributions (systemd is already quite widespread) to enjoy Linux?
I don’t want to sound like one of those tinfoil hat aficionados, but the current systemd craze is slightly troubling, because it brings us a big step closer to Windows and its flaws. Let's bear that in mind!


Structure
|
CV
|
Common_elements
|
Graphics
|
Temporal
|
Form
|
Table
|
Portfolio
USER REGISTRATION
3
4
5
jan
2018
Male
Female
PHP
CSS
HTML
JAVA
Send
Clear


#include "graphics.h" voud setmousequeuestatus(int kind, bool status=true);
When a window first opens, queuing is turned off for all events.
/* mouse example */ #include#include "graphics.h" using namespace std; int main(void) { int maxx, maxy; // Maximum x and y pixel coordinates int x, y; // Coordinates of the mouse click int divisor; // Divisor for the length of a triangle side // Put the machine into graphics mode and get the maximum coordinates: initwindow(450, 300); setmousequeuestatus(WM_LBUTTONDOWN); maxx = getmaxx( ); maxy = getmaxy( ); // Draw a white circle with red inside and a radius of 50 pixels: setfillstyle(SOLID_FILL, RED); setcolor(WHITE); fillellipse(maxx/2, maxy/2, 50, 50); // Print a message and wait for a red pixel to be double clicked: settextstyle(DEFAULT_FONT, HORIZ_DIR, 2); outtextxy(20, 20, "Left click several times!"); setcolor(BLUE); divisor = 2; while (!ismouseclick(WM_LBUTTONDOWN)) { delay(5000); // Five second delay, so there might be a several clicks } while (ismouseclick(WM_LBUTTONDOWN)) { getmouseclick(WM_LBUTTONDOWN, x, y); cout << "The mouse was clicked at: "; cout << "x=" << x; cout << " y=" << y << endl; } // Switch back to text mode: closegraph( ); }


HTML would be the ingredient list of a recipe, while CSS would be the instructions telling you how to prepare and combine the ingredients to get a delicious meal.
Control Flow and Loops are very similar to driving up to, into and around, and exiting a roundabout. When you get to the roundabout (control flow and loop block) you need to perform certain tasks to enter it. Once these tasks are completed and you find yourself inside the roundabout, you engage a certain set of behaviours such as checking for side traffic, using your indicator correctly and keeping an eye out for your exit. These In-Roundabout-Tasks are similar to tasks performed in a loop in the sense that you will need to keep doing them until the exit criteria is met. Once you reach your exit you can resume Regular-Driving-Mode and can proceed in the new direction.
The DOM, or Document Object Model is the framework in which all elements on a document are arranged. These elements are organised hierarchically and can be accessed directly by using their ‘address’ within the framework. Accessing an element in this way allows you to change its properties and behaviours in a number of ways. As an example - a page I am working on has a number of squares (theNephews) nested inside an element (littleBrother), nested inside another element (bigBrother). I am tasked with changing the colour of theNephews. To achieve this I would use a code editor or my browser developer tools and the nested address of the squares (bigBrother.litteBrother.theNephews) to access them directly. Once I have done this I can temporarily change their colour using the DevTools, and once I am satisfied with the result, write a CSS class to replicate what I did in the DevTools and assign that class to the Nephew elements on the fly.
The difference between accessing data in an array and in an object stems from the way that the data is stored within each of these variables. When new information is sent to an array it is assigned a numerical value based on the order in which it is added. ‘A’ would get assigned an index of 0, ‘B’ of 1 and so on. When you need to access information within an array you call it using this assigned numerical reference. When data is stored inside an object it is done as part of a Key:Value pair. This Key is created by yourself during the creation of the object or when it is specified as new data gets added. When you need to call (or store) data contained in the object you can then do so by referencing the Key directly.
A function is a reusable block of code consisting of a name, parameters and a series of statements. When you call a function you pass it values matching the specified parameter. These values are then used by the statements and a value is returned to the function call. Functions are extremely efficient in that they only need to be written once and can then be used throughout your document, saving code redundancy and maintaining clarity in your work. Due to their flexible nature it is also entirely possible to reuse a function across multiple documents.
Emotional intelligence is the ability to be aware of your emotions and internal landscape at all times. You can then use this knowledge to interact with people and your surroundings in a way that is based on the facts at hand, rather than on your reactions to the facts.
IQ is merely a way of measuring intelligence based on a set of standard questions, often based on information and skills acquired during academic pursuits. EQ on the other hand is based on how you handle the intersection of your internal world with the external. This makes EQ more of a skill than a baseline measurement and while it requires effort to do so, the constant flux in which we find ourselves provides ample opportunity for growth and development of the skills that make up our EQ.
EQ is important because it sits right on the border where our internal world brushes up against the external. As such it can act as a filter through which all sense perceptions flow in and all actions and flow back out again. Having the skills to self moderate in this way enables you to act on each situation in an authentic way - thereby increasing the effectiveness and suitability of your actions.


{% extends "base.html" %} {% block title %}WattTime: Terms of Service{% endblock %} {% block content %}
Please note: The following terms will almost certainly change. Should these terms change, WattTime team members will attempt to notify in a timely manner any active users for whom we have contact information. But we cannot offer any guarantee that we will do so.
WattTime collects personal data in the form of contact information, settings, and answers to surveys or text messages. All of WattTime’s personal data collection is clearly indicated as such. WattTime team members agree not to pass on personally identifiable data to third parties without written permission, but may share aggregated and anonymized data such as survey responses. WattTime may employ cookies to process these personal data. Users have the ability to decline cookies by modifying their browsers.
WattTime makes use of continuous feeds of external data. WattTime team members have no control over these data, and cannot review all of these data. Use of WattTime does not transfer to users any intellectual property over these or any other data.
Users agree not to use WattTime for commercial use.
This informational service is provided “as is”. WattTime team members are unable to offer any warranty, express or implied, that this service will be error-free, uninterrupted, or suitable for any given purpose. It is subject to change or termination without notice. No representation or warranty is made by any party about the accuracy, reliability, completeness, date, or timeliness of the content.
Users agree to indemnify and hold harmless the team members of WattTime from any and all claims and expenses, including attorneys’ fees, arising out of users’ use of the service. Team members shall have no liability for any failure or delay due to matters beyond their reasonable control.
Users are free to unsubscribe at any time. WattTime team members will make reasonable efforts to ensure that unsubscriptions are implemented immediately, but can not guarantee the speed of unsubscription.


{% extends "base.html" %} {% block meta_title %}Access denied (403){% endblock %} {% block title %}
Access to this web page is restricted to the editorial team.


Flaterial
Popups plugin 1.1.0
Flaterial Popups from Flaterial template, dev by Jean-jacques AKAKPO.
View project code source on github
hasBackdrop: true
Add an overlay layer. Its make other elements not clickable instead of the popup itself.
show with backdrop
queue: true
Next popups elements will show up bellow previous.
show queued popups
autoCloseDelay: 2000
Wait 2000ms before close a popup
show and close after 2000ms
closeOnClick: true
Close when user clicks on it
show and close when user clicks
waitingForUser: true, waitingForUserOpts: {...}
Wait for user to run correspondant code and close
deal with the user acceptance
autoCloseDelay: 5000,
Wait 5000ms before close
Custom flag. You can use relative image ressource file as a flag.
custom flag


The site is temporarily down for maintenance.Please check back soon.
For questions, please contact the IT<EMAIL_ADDRESS>|<PHONE_NUMBER>


import "github.com/ghetzel/go-stockutil/sliceutil"
Utilities for converting, manipulating, and iterating over slices
| Filename | Size | SLOC | func |
type |
const |
var |
|---|---|---|---|---|---|---|
| sliceutil.go | 11KB | 333 | 32 | 4 | 3 | |
| sliceutil_test.go | 13KB | 428 |
var RelaxedEqualityCompare = var Stop = utils.Stop var StrictEqualityCompare =
func Append(in interface{}, values ...interface{}) []interface{}
Returns a copy of the given slicified value with the given additional values appended.
func At(in interface{}, index int) (interface{}, bool)
Returns the element in the given indexable value at the given index. If the
index is present, the second return value will be true. If the index is not
present, or the given input is not indexable, the second return value will be
false.
func Autotype(in interface{}) []interface{}
Returns a copy of the given slice with each element’s value passed to stringutil.Autotype
func Chunks(in interface{}, size int) [][]interface{}
Divide the given slice into chunks of (at most) a given length
func Compact(in interface{}) []interface{}
Removes all elements from the given interface slice that are “empty”, which is
defined as being nil, a nil or zero-length array, chan, map, slice, or string.
The zero values of any other type are not considered empty and will remain in
the return value.
func CompactString(in []string) []string
Removes all zero-length strings from the given string slice, returning a new
slice with the values removed.
func Contains(in interface{}, value interface{}, comparators ...CompareFunc) bool
Return whether the given slice contains the given value. If a comparator is provided, it will
be used to compare the elements.
func ContainsAllStrings(list []string, elems ...string) bool
Returns whether the given string slice contains all of the following strings.
func ContainsAnyString(list []string, elems ...string) bool
Returns whether the given string slice contains any of the following strings.
func ContainsString(list []string, elem string) bool
Returns whether the given string slice contains a given string.
func Difference(first interface{}, second interface{}) []interface{}
Return the slice that results from removing elements in second from the first.
func Each(slice interface{}, iterFn IterationFunc) error
Iterate through each element of the given array or slice, calling
iterFn exactly once for each element. Otherwise, call iterFn one time
with the given input as the argument.
func First(in interface{}) interface{}
Returns the first element from the given slice, array or string; or nil.
func FirstNonZero(inputs ...interface{}) interface{}
Returns the first element in the given inputs that is not that type’s zero value. All input values
are flattened into a single array, so variadic elements can contain scalar or array values.
func Flatten(in interface{}) []interface{}
Returns the given slice as a single-level flattened array.
func Get(in interface{}, index int) interface{}
Returns the nth element from the given slice, array or string; or nil.
func Intersect(a interface{}, b interface{}) []interface{}
Return the intersection of two slices.
func IntersectStrings(a []string, b []string) []string
Return the intersection of two string slices.
func Last(in interface{}) interface{}
Returns the last element from the given slice, array or string; or nil.
func Len(in interface{}) int
Returns the length of the given slice, array, or string.
func Map(in interface{}, fn MapFunc) []interface{}
Returns a copy of the given slice with each element modified by the a given function.
func MapString(in interface{}, fn MapStringFunc) []string
Returns a copy of the given slice with each element modified by the a given function, then
converted to a string.
func Or(in ...interface{}) interface{}
Returns the first item that is not the zero value for that value’s type.
func OrString(in ...string) string
Returns the first item that is not a zero-length string.
func Rest(in interface{}) []interface{}
Returns the all but the first element from the given slice, array or string; or nil.
func Slice(slice interface{}, from int, to int) []interface{}
Returns a new slice with only the specified subset of items included. In addition to the
normal slice index rules in Golang, negative indices are also supported. If a negative index is
given for the from and/or to values, the index will be treated as being relative to the end of the
given slice. For example:
Slice([]interface{}{1,2,3,4,5}, -5, -1) // returns []interface{}{1, 2, 3, 4, 5}
Slice([]interface{}{1,2,3,4,5}, -2, -1) // returns []interface{}{4, 5}
Slice([]interface{}{1,2,3,4,5}, -1, -1) // returns []interface{}{5}
Slice([]interface{}{1,2,3,4,5}, -4, -2) // returns []interface{}{2, 3, 4}
func Sliceify(in interface{}) []interface{}
Takes some input value and returns it as a slice.
func StringSlice(slice interface{}, from int, to int) []string
Same as slice, but returns strings.
func Stringify(in interface{}) []string
Converts all elements of the given interface slice to strings using the “%v”
format string via the fmt package.
func TrimSpace(in interface{}) []string
Trims the whitespace from each element in the given array.
func Unique(in interface{}) []interface{}
Returns a new slice with only unique elements from the given interface included.
func UniqueStrings(in interface{}) []string
Returns a new slice with only unique string elements from the given interface included.
type CompareFunc func(i int, first interface{}, second interface{}) bool // {}
type IterationFunc = utils.IterationFunc
type MapFunc func(i int, value interface{}) interface{}
type MapStringFunc func(i int, value string) string


Closing arguments in East Village gas explosion trial
by Eyewitness NewsEAST VILLAGE, Manhattan (WABC) -- Closing arguments beganTuesday in the manslaughter trial stemming from the deadly 2015 gas explosion in the East Village.
The owner of the building, an unlicensed plumber, and a general contractor are accused of rigging an illegal gas line at the building on Second Avenue at 7th Street.
Two people died and 13 were injured in the fiery blast.
"Unbeknownst to the people who were walking down the street, driving down the street, there was a virtual bomb lurking under the East Village," Assistant District Attorney Randolph Clarke said in his opening statement.
The building owner, 59-year-old Maria Hrynenko, of Rockland; an unlicensed plumber, 63-year-old Athanasios Ioannidis, of Queens; and the general contractor, 44-year-old Dilber Kukic, of the Bronx; face manslaughter and other charges.
In all, three buildings collapsed and a fourth building was seriously damaged.
Sushi restaurant worker Moises Ismael Locon Yac and 23-year-old diner Nicholas Figueroa, who was on a date at the time, were killed.
"He was a beautiful, happy guy," dad Nixon Figueroa said. "I'm proud of having him as a son."
Officials found his body in the debris an agonizing three days later, and Nixon Figueroa, the state's first witness, described identifying his son's body and wanting to hug him one more time.
"He was a good kid," he said. "So I just want to say, I'm glad we're here and I'm going to take it step by step."
Locon Yac's brother had also testified.
"They called and said the bodies had never been found," he told jurors. "When we went to the area to see where my brother's body was, they told us we wouldn't recognize him."
Defense lawyers argued it was a tragic accident and their clients are not responsible.
EXCLUSIVE: Video shows moment of East Village explosion
RELATED: Crews reach basement in Manhattan building explosion clean-up
-- EXCLUSIVE: Survivor of East Village explosion tells his story


{% extends "reports/base_report.html" %} {% block title %} Contribution into {{ module }} for the last {{ days }} days {% endblock %} {% block scripts %} {% endblock %} {% block content %}
| # | Engineer | Reviews | -2 | -1 | +1 | +2 | A | +/- | Disagreements | Ratio | On review / patch sets | Commits | Emails |
|---|


Extends 'flexclust' with an R implementation of order constrained solutions in k-means clustering (Steinley and Hubert, 2008, <doi:10.1007/s11336-008-9058-z>).
| Version: | 1.0 |
| Depends: | flexclust |
| Imports: | methods, parallel, modeltools, stats4 |
| Suggests: | seriation |
| Published: | 2016-11-22 |
| Author: | Sebastian Krey [aut, cre], Friedrich Leisch [aut], Sebastian Hoffmeister [ctb] |
| Maintainer: | Sebastian Krey <sebastian.dev at skrey.net> |
| License: | GPL-2 | GPL-3 |
| NeedsCompilation: | no |
| CRAN checks: | ockc results |
| Reference manual: | ockc.pdf |
| Package source: | ockc_1.0.tar.gz |
| Windows binaries: | r-devel: ockc_1.0.zip, r-release: ockc_1.0.zip, r-oldrel: ockc_1.0.zip |
| OS X binaries: | r-release: ockc_1.0.tgz, r-oldrel: ockc_1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=ockc to link to this page.


This example demonstrates the use of OSGi in JBoss AS 7.
The example can be deployed using Maven from the command line, by using the AS 7 web console or by dropping the OSGi bundle in the deployments folder.
To set up Maven or JBoss Tools in Eclipse, refer to the Getting Started Developing Applications Guide.
To deploy to JBoss AS 7 using Maven, start JBoss AS 7 and type
mvn package jboss-as:deploy
.
This will build, deploy and start the OSGi bundle. You will see a
Hello AS7 World!!
message appear on the console when this is done.
You can read more details in the Getting Started Developing Applications Guide.


These release notes cover new developer and user-facing incompatibilities, important issues, features, and major improvements.
JobMonitor can now deploy multiple threads for faster job-status polling. Use ‘gridmix.job-monitor.thread-count’ to set the number of threads. Stress mode now relies on the updates from the job monitor instead of polling for job status. Failures in job submission now get reported to the statistics module and ultimately reported to the user via summary.
Makes Gridmix use the uncompressed input data size while simulating map tasks in the case where compressed input data was used in original job.
Makes Gridmix emit out correct error message when the input data directory already exists and -generate option is used. Makes Gridmix exit with proper exit codes when Gridmix fails in args-processing, startup/setup.
Fixes NPE and makes Gridmix simulate succeeded-jobs-with-failed-tasks. All tasks of such simulated jobs(including the failed ones of original job) will succeed.
Fixed the sortFinishTime and shuffleFinishTime adjustments in Rumen Folder.
Fixes NPE in cpu emulation in Gridmix
Fixes Rumen to parse counter strings containing the special characters “{” and “}”.
Bug fixed in compression emulation feature for map only jobs.
Made the method ParsedTask.obtainTaskAttempts() public.
Kosmos FS (KFS) is no longer maintained and Hadoop support has been removed. KFS has been replaced by QFS (HADOOP-8885).
The default blocks size prior to this change was 64MB. This jira changes the default block size to 128MB. To go back to previous behavior, please configure the in hdfs-site.xml, the configuration parameter “dfs.blocksize” to 67108864.
WARNING: No release note provided for this change.
With this improvement the following options are available in release 1.2.0 and later on 1.x release stream: 1. jsvc location can be overridden by setting environment variable JSVC_HOME. Defaults to jsvc binary packaged within the Hadoop distro. 2. jsvc log output is directed to the file defined by JSVC_OUTFILE. Defaults to $HADOOP_LOG_DIR/jsvc.out. 3. jsvc error output is directed to the file defined by JSVC_ERRFILE file. Defaults to $HADOOP_LOG_DIR/jsvc.err.
With this improvement the following options are available in release 2.0.4 and later on 2.x release stream: 1. jsvc log output is directed to the file defined by JSVC_OUTFILE. Defaults to $HADOOP_LOG_DIR/jsvc.out. 2. jsvc error output is directed to the file defined by JSVC_ERRFILE file. Defaults to $HADOOP_LOG_DIR/jsvc.err.
For overriding jsvc location on 2.x releases, here is the release notes from HDFS-2303: To run secure Datanodes users must install jsvc for their platform and set JSVC_HOME to point to the location of jsvc in their environment.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
fixed in HADOOP-9258
fixed in HADOOP-9258
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
Part of the RPC version 9 change. A service class byte is added after the version byte.
WARNING: No release note provided for this change.
There is now a new option to have the DN take into account available disk space on each volume when choosing where to place a replica when performing an HDFS write. This can be enabled by setting the config “dfs.datanode.fsdataset.volume.choosing.policy” to the value “org.apache.hadoop.hdfs.server.datanode.fsdataset.AvailableSpaceVolumeChoosingPolicy”.
WARNING: No release note provided for this change.
Ensure that mapreduce APIs are semantically consistent with mapred API w.r.t Mapper.cleanup and Reducer.cleanup; in the sense that cleanup is now called even if there is an error. The old mapred API already ensures that Mapper.close and Reducer.close are invoked during error handling. Note that it is an incompatible change, however end-users can override Mapper.run and Reducer.run to get the old (inconsistent) behaviour.
This change introduces a maximum number of blocks per file, by default one million, and a minimum block size, by default 1MB. These can optionally be changed via the configuration settings “dfs.namenode.fs-limits.max-blocks-per-file” and “dfs.namenode.fs-limits.min-block-size”, respectively.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
This change adds support for referencing files and directories based on fileID/inodeID using a path /.reserved/.inodes/<inodeid>. With this change creating a file or directory /.reserved is not longer allowed. Before upgrading to a release with this change, files /.reserved needs to be renamed to another name.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
This umbrella jira makes enhancements to support Hadoop natively on Windows Server and Windows Azure environments.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
This patch should be checked in together (or after) with JIRA Hadoop-8469: https://issues.apache.org/jira/browse/HADOOP-8469
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
This change makes name node keep its internal replication queues and data node state updated in manual safe mode. This allows metrics and UI to present up-to-date information while in safe mode. The behavior during start-up safe mode is unchanged.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
The Protocol Buffers definition of the inter-namenode protocol required a change for compatibility with compiled C clients. This is a backwards-incompatible change. A namenode prior to this change will not be able to communicate with a namenode after this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
Document MR Binary Compatibility vis-a-vis hadoop-1 and hadoop-2 for end-users.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
Raw SASL protocol now uses protobufs wrapped with RPC headers. The negotiation sequence incorporates the state of the exchange. The server now has the ability to advertise its supported auth types.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
Connection context is now sent as a rpc header wrapped protobuf.
WARNING: No release note provided for this change.
The dfsadmin -metasave command has been changed to overwrite the output file. Previously, this command would append to the output file if it already existed.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
The RPC client now waits for the Server’s SASL negotiate response before instantiating its SASL client.
Client ping will be sent as a RPC header with a reserved callId instead of as a sentinel RPC packet length.
Fixes blank Configuration object creation overhead by reusing the Job configuration in InMemoryReader.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.
WARNING: No release note provided for this change.


Multithreading
Awarded to 3 teams, or 0.21% of registered teams. Part of the Teamwork trophy.
Great job splitting up the work.
Solve two challenges within 30 seconds of each other
Teams
| team name | unlocked at |
|---|---|
| 9447 | 2014-05-17 00:57:58 UTC |
| More Smoked Leet Chicken | 2014-05-18 13:39:31 UTC |
| team enu | 2014-05-18 17:04:52 UTC |


Player 1 must have a name!
Player 1 name must have at least 3 characters.
Player 2 must have a name!
Player 2 name must have at least 3 characters.


import AsiNgToolsModule or AsiFileChooserModule
| Name | Description |
|---|---|
| [label] | Component label |
| [labelPosition] | Component label position in 'top' , 'left' , 'right' , 'bottom |
| [fileSrc] | The link to the chosen file |
| [fileName] | The name to give to the file, overriding its real name |
| [accept] | List of file type to accept. Use 'AsiMimeType' |
| Name | Description |
|---|---|
| @asi-file-chooser-label-color | Label color of the file chooser |
| @asi-file-chooser-background-color | Background color of the file chooser |
| @asi-file-chooser-border | Border of the file chooser |


Usually a flexus-toolbar (in accordance with Material Design spec) is 56px tall (except for tablets where it's 64px, because default gutter and side margins raise from 16px to 24px).
Speaking of gutter and margins... The toolbar has a 16px padding on both sides. Followed by a 24x24px hamburger or navigation arrow icon/button. That's 40px so far. Indentation keyline is 56px away from content margin (16px on the phone), which positions the title at exactly 72px (16+56) from the left edge, with 32px space between nav icon and the title.


--- layout: example categories: example/v1.0.0 version: v1.0.0 title: Marker styles using pointToLayer description: Set marker style in a featureLayer with pointToLayer. tags: - markers - featureLayer - style ---


The current version of my software product which is called Icarus is being developed now. This software has a modern frontend framework which works on the web. Attractive to look at using twitter bootstrap. It uses the latest JavaScript technologies AngularJS for interactivity. The service offered is one for analysing large data sets. If you have big data we offer an attractive user interface for searching, tabulating and storing large datasets. The test case is on genomics data, the works of William Shakespeare and astrophysics data. The store is located at Cherry Pi where you can learn raspberry pi tutorial to build internet radios and buy supplies. We add tutorials to help you get some ideas for your next raspberry Pi project. We are also an Adafruit official distributor.


C for Metal Tutorial¶
Revision 6.0
Primary Author(s): Gang Chen and Guei-Yuan Lueh (with sources from current and past C for Metal members)
Contributor(s): Kaiyu Chen, Michael Liao, Fang Liu, Wei Pan, Yuting Yang
Special thanks to our previous teammates in UK, David Stuttard, Tim Renouf, Tim Corringham, and Stephen Thomas, who were the main developers of this llvm-based compiler.
Intro: Comparing C for Metal with CUDA/OpenCL¶
Similarities¶
- Program for GPU acceleration: host program on CPU; kernel program on GPU.
- Host API provided in C++. GPU kernel programming in a subset of C++.
Differences¶
- Explicit SIMD-programming model. Allow varying SIMD width.
- One C for Metal thread is equivalent to one CUDA warp or one OCL subgroup, operates on a block of pixels instead of one pixel.
- access the entire vector register file instead of one-lane of the register file. Enable developers to achieve the most efficient register usage.
- Predefined vector and matrix type.
- Natural representation of media data
- Parallelism expressed through vector and matrix operations
- Expose GEN hardware media-acceleration functions
- Cm is good for applications that
- Need cross SIMD-lane operations
- Need mixed SIMD width
- Need to change data layout (e.g., transpose)
Contents¶
- Tutorial 1. Basic Host Programming
- Tutorial 2. Basic Kernel Programming
- Tutorial 3. Enqueuing Multiple Kernels
- Tutorial 4. Using Media Walker with Thread Dependence
- Tutorial 5. Builtin Matrix and Vector Operations
- Tutorial 6. Shared Local Memory and Thread Group
- Tutorial 7. Using Printf in Kernel
- Tutorial 8. Using CmBuffer
- Tutorial 9. Zero-Copy with User-Provided Surfaces
- Tutorial 10. Event-Driven Synchronization
- Tutorial 11. Kernel Programming: Register Usage
- Tutorial 12. Kernel Deep-Dive: BitonicSort
- Tutorial 13. Kernel Deep-Dive: RadixSort
- Tutorial 14. Kernel Example - PrefixSum
- Tutorial 15. Kernel Example - Graph-Cut
Legal Notices and Disclaimers¶
INFORMATION IN THIS DOCUMENT IS PROVIDED IN CONNECTION WITH INTEL® PRODUCTS. NO LICENSE, EXPRESS OR IMPLIED, BY ESTOPPEL OR OTHERWISE, TO ANY INTELLECTUAL PROPERTY RIGHTS IS GRANTED BY THIS DOCUMENT. EXCEPT AS PROVIDED IN INTEL’S TERMS AND CONDITIONS OF SALE FOR SUCH PRODUCTS, INTEL ASSUMES NO LIABILITY WHATSOEVER, AND INTEL DISCLAIMS ANY EXPRESS OR IMPLIED WARRANTY, RELATING TO SALE AND/OR USE OF INTEL PRODUCTS INCLUDING LIABILITY OR WARRANTIES RELATING TO FITNESS FOR A PARTICULAR PURPOSE, MERCHANTABILITY, OR INFRINGEMENT OF ANY PATENT, COPYRIGHT OR OTHER INTELLECTUAL PROPERTY RIGHT. UNLESS OTHERWISE AGREED IN WRITING BY INTEL, THE INTEL PRODUCTS ARE NOT DESIGNED NOR INTENDED FOR ANY APPLICATION IN WHICH THE FAILURE OF THE INTEL PRODUCT COULD CREATE A SITUATION WHERE PERSONAL INJURY OR DEATH MAY OCCUR. Intel may make changes to specifications and product descriptions at any time, without notice. Designers must not rely on the absence or characteristics of any features or instructions marked “reserved” or “undefined.” Intel reserves these for future definition and shall have no responsibility whatsoever for conflicts or incompatibilities arising from future changes to them. The information here is subject to change without notice. Do not finalize a design with this information. The products described in this document may contain design defects or errors known as errata which may cause the product to deviate from published specifications. Current characterized errata are available on request. Contact your local Intel sales office or your distributor to obtain the latest specifications and before placing your product order. Copies of documents which have an order number and are referenced in this document, or other Intel literature, may be obtained by calling 1-800-548-4725, or by visiting Intel’s Web Site. Intel processor numbers are not a measure of performance. Processor numbers differentiate features within each processor family, not across different processor families. See http://www.intel.com/products/processor_number for details. This document contains information on products in the design phase of development. BunnyPeople, Celeron, Celeron Inside, Centrino, Centrino Atom, Centrino Atom Inside, Centrino Inside, Centrino logo, Core Inside, FlashFile, i960, InstantIP, Intel, Intel logo, Intel386, Intel486, IntelDX2, IntelDX4, IntelSX2, Intel Atom, Intel Atom Inside, Intel Core, Intel Inside, Intel Inside logo, Intel. Leap ahead., Intel. Leap ahead. logo, Intel NetBurst, Intel NetMerge, Intel NetStructure, Intel SingleDriver, Intel SpeedStep, Intel StrataFlash, Intel Viiv, Intel vPro, Intel XScale, Itanium, Itanium Inside, MCS, MMX, Oplus, OverDrive, PDCharm, Pentium, Pentium Inside, skoool, Sound Mark, The Journey Inside, Viiv Inside, vPro Inside, VTune, Xeon, and Xeon Inside are trademarks of Intel Corporation in the U.S. and other countries. * Other names and brands may be claimed as the property of others.
Copyright (C) 2009-2017, Intel Corporation. All rights reserved.


New qtapps module¶
qtapps
are being created to provide modular, re-useable apps for data retrieval, plotting, calibration and more.
What… why?¶
There is a new folder in the scikit-rf repository called qtapps. It contains a python package called skrf_qtwidgets
.
The goal of this package is to provide a reusable set of qt widgets to easily construct gui applications that can measure, process, and analyze data. The two main widgets are a QListWidget
called NetworkListWidget
that provides a container for Network
objects and a plot widget called NetworkPlotWidget
for visualizing networks.
How¶
All of these feature are in the master git branch, so you will have to git it.
There is a conda env called skrf_qtapps_py35.yml
in the qtapps module, which can be used to run the qtapps. All currently constructed widgets are in the widgets.py
and calibration_widgets.py
modules.
Two example applications have been written:
data_grabber.py
is a simple data acquisition and viewer program.multiline_trl.py
is a gui application that implements theMultilineTRL
class, though I will probably switch this to the recently included NIST algorithm.
These are meant to be useful, but also conceptual. I would greatly appreciate testing, feedback and ideas for future applications. Documentation is basically non-existent right now, so please take a look at the working examples and code. I will put together something more helpful as I am able.
– vince


| Top |
GTcpWrapperConnectionGTcpWrapperConnection — Wrapper for non-GSocketConnection-based, GSocket-based GIOStreams |
GObject ╰── GIOStream ╰── GSocketConnection ╰── GTcpConnection ╰── GTcpWrapperConnection
A GTcpWrapperConnection can be used to wrap a GIOStream that is based on a GSocket, but which is not actually a GSocketConnection. This is used by GSocketClient so that it can always return a GSocketConnection, even when the connection it has actually created is not directly a GSocketConnection.
GSocketConnection * g_tcp_wrapper_connection_new (GIOStream *base_io_stream
,GSocket *socket
);
Wraps base_io_stream
and socket
together as a GSocketConnection.
Since 2.28
GIOStream *
g_tcp_wrapper_connection_get_base_io_stream
(GTcpWrapperConnection *conn
);
Get's conn
's base GIOStream
“base-io-stream”
property“base-io-stream” GIOStream *
The wrapped GIOStream.
Flags: Read / Write / Construct Only


AIIMS duped of Rs 12 cr as fraudsters withdraw money using 'cloned cheques'
The money was illegally withdrawn from the AIIMS' accounts in the State Bank of India at its non-home branches in other cities
by Press Trust of IndiaOver Rs 12 crore have been siphoned off from two bank accounts of the country's premier healthcare institute AIIMS here by fraudsters by allegedly using "cloned cheques" over the past one month, official sources said.
The money was illegally withdrawn from the AIIMS' accounts in the State Bank of India (SBI) at its non-home branches in other cities, the sources told PTI.
Even after the fraud came to light, the culprits made attempts to siphon off over Rs 29 crore allegedly using the cloned cheques in SBI's non-home branches located in Dehradun and Mumbai in the last one week.
However, the attempts were foiled.
The hospital administration has already approached the Economic Offences Wing of Delhi Police seeking an investigation into the scam.
According to an official, the cheques presented by the fraudsters at SBI's branches passed Ultra Violet Ray tests and the original cheque leaves with same series were still in the possession of the institute, the AIIMS said in a report to the health ministry.
It said the SBI has failed to follow verification protocol while clearing cheques at non-home branches and asked the bank to deposit the stolen amount.


--- layout: example categories: example/v1.0.0 version: v1.0.0 title: Leaflet Locate description: Add a find me control that sets the map view to the current coordinates a user is in the world. tags: - plugins ---


The below will appear and disappear as a model object is bound and unbound from the template. Conditionals are implemented simply as "this template appears if something is bound" and "this template disappears if nothing is bound".
Hello {{msg}}
The below will appear and disappear if the conditional value is true or false.
Activated!


We extend tables!
- optimize efficient paradigms
- integrate bleeding-edge infrastructures
- drive synergistic e-business
- engineer back-end ROI
- engage clicks-and-mortar synergies
- redefine vertical content
- repurpose killer functionalities
- visualize cutting-edge e-business