Functions for reading keys from Java Key Storage.
More...
#include <openssl/evp.h>
#include <openssl/x509.h>
#include <openssl/bio.h>
#include <stddef.h>
#include <stdio.h>
Go to the source code of this file.
|
|
typedef struct jks_st | JKS |
| | JKS container handle.
|
| |
|
typedef struct jks_entry_st | JKSEntry |
| | an element of a JKS container.
|
| |
|
| void | JKSFree (JKS *jks) |
| | destroys JKS data. More...
|
| |
| size_t | JKSType (const JKS *jks) |
| | returns JKS type. More...
|
| |
| size_t | JKSEntryNum (const JKS *jks) |
| | returns a number of JKS entries. More...
|
| |
| JKSEntry * | JKSEntryGet (const JKS *jks, size_t pos) |
| | returns a pointer to the entry number 'pos'. The first entry is 0. More...
|
| |
| size_t | JKSEntryType (const JKSEntry *entry) |
| | returns JKS entry type. More...
|
| |
| int | JKSEntryDecrypt (JKSEntry *entry, const char *password, size_t passSize) |
| | decrypts an entry with private key material. Does nothig for other entry types. More...
|
| |
| const char * | JKSEntryPKeyName (const JKSEntry *entry) |
| | returns an alias of a private key. Returns NULL for other entry types. More...
|
| |
| size_t | JKSEntryPKeyNum (const JKSEntry *entry) |
| | returns a number of private keys in this entry. More...
|
| |
| const EVP_PKEY * | JKSEntryPKey (const JKSEntry *entry, size_t pos) |
| | returns a pointer to an EVP_PKEY number 'pos'. More...
|
| |
| size_t | JKSEntryCertNum (const JKSEntry *entry) |
| | returns a number of certificates in this entry. More...
|
| |
| const X509 * | JKSEntryCert (const JKSEntry *entry, size_t pos) |
| | returns a pointer to a certificate number 'pos'. More...
|
| |
| const char * | JKSEntryCertType (const JKSEntry *entry, size_t pos) |
| | returns a type of a certificate number 'pos'. More...
|
| |
| int | parseJKS (const void *data, size_t size, const char *password, size_t passSize, JKS **keys) |
| | extracts private keys and certs from Java Key Store. More...
|
| |
| int | readJKS (FILE *fp, const char *password, size_t passSize, JKS **keys) |
| | extracts private keys and certs from Java Key Store file. More...
|
| |
| int | readJKS_bio (BIO *bio, const char *password, size_t passSize, JKS **keys) |
| | extracts private keys and certs from Java Key Store using OpenSSL BIO interface. More...
|
| |
Functions for reading keys from Java Key Storage.
◆ JKSEntryCert()
| const X509 * JKSEntryCert |
( |
const JKSEntry * |
entry, |
|
|
size_t |
pos |
|
) |
| |
returns a pointer to a certificate number 'pos'.
- Parameters
-
| entry | a pointer to the JKS entry; |
| pos | certificate number, starting from 0. |
- Returns
- the pointer to the certificate.
◆ JKSEntryCertNum()
| size_t JKSEntryCertNum |
( |
const JKSEntry * |
entry | ) |
|
returns a number of certificates in this entry.
- Parameters
-
| entry | a pointer to the JKS entry. |
- Returns
- the number of certificates.
◆ JKSEntryCertType()
| const char * JKSEntryCertType |
( |
const JKSEntry * |
entry, |
|
|
size_t |
pos |
|
) |
| |
returns a type of a certificate number 'pos'.
- Parameters
-
| entry | a pointer to the JKS entry; |
| pos | certificate number, starting from 0. |
- Returns
- the type of the certificate. Usually 'X509'.
◆ JKSEntryDecrypt()
| int JKSEntryDecrypt |
( |
JKSEntry * |
entry, |
|
|
const char * |
password, |
|
|
size_t |
passSize |
|
) |
| |
decrypts an entry with private key material. Does nothig for other entry types.
- Parameters
-
| entry | a pointer to the JKS entry; |
| password | private key encryption password; |
| passSize | password size. |
- Returns
- 1 for success, 0 in case of failure.
◆ JKSEntryGet()
returns a pointer to the entry number 'pos'. The first entry is 0.
- Parameters
-
| jks | JKS data; |
| pos | entry number starting from 0. |
- Returns
- the pointer to the entry.
◆ JKSEntryNum()
| size_t JKSEntryNum |
( |
const JKS * |
jks | ) |
|
returns a number of JKS entries.
- Parameters
-
- Returns
- the number of entries in the store.
◆ JKSEntryPKey()
| const EVP_PKEY * JKSEntryPKey |
( |
const JKSEntry * |
entry, |
|
|
size_t |
pos |
|
) |
| |
returns a pointer to an EVP_PKEY number 'pos'.
- Parameters
-
| entry | a pointer to the JKS entry; |
| pos | EVP_PKEY number, starting from 0. |
- Returns
- the pointer to the EVP_PKEY.
- Note
- the entry must be decrypted first. Otherwise, the function returns NULL.
◆ JKSEntryPKeyName()
| const char * JKSEntryPKeyName |
( |
const JKSEntry * |
entry | ) |
|
returns an alias of a private key. Returns NULL for other entry types.
- Parameters
-
| entry | a pointer to the JKS entry. |
- Returns
- the alias of the private key or NULL.
◆ JKSEntryPKeyNum()
| size_t JKSEntryPKeyNum |
( |
const JKSEntry * |
entry | ) |
|
returns a number of private keys in this entry.
- Parameters
-
| entry | a pointer to the JKS entry. |
- Returns
- the number of private keys.
- Note
- the entry must be decrypted first. Otherwise, the function returns 0.
◆ JKSEntryType()
| size_t JKSEntryType |
( |
const JKSEntry * |
entry | ) |
|
returns JKS entry type.
- Parameters
-
| entry | a pointer to the JKS entry. |
- Returns
- the type of the entry. JKS_ENTRY_PRIVATE_KEY - private key material, JKS_ENTRY_CERT - certificate.
◆ JKSFree()
| void JKSFree |
( |
JKS * |
jks | ) |
|
destroys JKS data.
- Parameters
-
◆ JKSType()
| size_t JKSType |
( |
const JKS * |
jks | ) |
|
returns JKS type.
- Parameters
-
- Returns
- the type of JKS. JKS_TYPE_JKS - original keystore format, JKS_TYPE_JCEKS - improved format.
◆ parseJKS()
| int parseJKS |
( |
const void * |
data, |
|
|
size_t |
size, |
|
|
const char * |
password, |
|
|
size_t |
passSize, |
|
|
JKS ** |
keys |
|
) |
| |
extracts private keys and certs from Java Key Store.
- Parameters
-
| data | container data; |
| size | container data size; |
| password | container password; |
| passSize | password size; |
| keys | JKS handle, extracted keys will be stored here. |
- Returns
- 1 for success, 0 in case of failure.
◆ readJKS()
| int readJKS |
( |
FILE * |
fp, |
|
|
const char * |
password, |
|
|
size_t |
passSize, |
|
|
JKS ** |
keys |
|
) |
| |
extracts private keys and certs from Java Key Store file.
- Parameters
-
| fp | file handle; |
| password | container password; |
| passSize | password size; |
| keys | JKS handle, extracted keys will be stored here. |
- Returns
- 1 for success, 0 in case of failure.
◆ readJKS_bio()
| int readJKS_bio |
( |
BIO * |
bio, |
|
|
const char * |
password, |
|
|
size_t |
passSize, |
|
|
JKS ** |
keys |
|
) |
| |
extracts private keys and certs from Java Key Store using OpenSSL BIO interface.
- Parameters
-
| bio | OpenSSL BIO; |
| password | container password; |
| passSize | password size; |
| keys | JKS handle, extracted keys will be stored here. |
- Returns
- 1 for success, 0 in case of failure.


|
Polygon Triangulation
Plane Sweep based Polygon Triangulation
|
This file contains the method to triangulate a monotone polygon. More...
Go to the source code of this file.
Functions | |
| vector< Vertex > | getTopChain (vector< Vertex > &sorted, vector< Vertex > &original) |
| Get the Top Chain of the monotone polygon. More... | |
| vector< Vertex > | getBottomChain (vector< Vertex > &sorted, vector< Vertex > &original) |
| Get the Bottom Chain of the monotone polygon. More... | |
| vector< Vertex > | preprocess (vector< Vertex > input, Vertex &left, Vertex &right) |
| Assign top or bottom to each vertex and sort them w.r.t x-axis. More... | |
| bool | validTriangle (Vertex &a, Vertex &b, Vertex &c, bool midSide) |
| Check if the triangle formed by the vertices is valid. More... | |
| Vertex | findMin (const vector< Vertex > &input) |
| Get the minimum Vertex (based on the x-axis) More... | |
| Vertex | findMax (const vector< Vertex > &input) |
| Get the maximum Vertex (based on the x-axis) More... | |
| vector< Triangle > | monotoneTriangulate (vector< Vertex > input) |
| This method performs the triangulation of the given monotone. More... | |
This file contains the method to triangulate a monotone polygon.
Get the Bottom Chain of the monotone polygon.
| sorted | Vertices of polygon sorted w.r.t x-axis |
| original | unmodified clockwise ordering of vertices of polygon as given by the user |
Get the Top Chain of the monotone polygon.
| sorted | Vertices of polygon sorted w.r.t x-axis |
| original | unmodified clockwise ordering of vertices of polygon as given by the user |
This method performs the triangulation of the given monotone.
| input | List of vertices present on the monotone in clockwise order |
Assign top or bottom to each vertex and sort them w.r.t x-axis.
| input | List of vertices representing the clockwise ordering of polygon vertices |
| left | The left most Vertex present on the polygon |
| right | The right most Vertex present on the polygon |
Check if the triangle formed by the vertices is valid.
A triangle is said to be valid only if it completely exists inside the polygon
| a | First Vertex |
| b | Second Vertex |
| c | Third Vertex |
| midSide | Side of the middle vertex (top or bottom as set in the tag of Vertex) |


|
iDreamSky Game Engine
v1.0.0
|
GXShaderUniformType encapsulate Type of Uniform Variable of the Shader. 更多...
#include <GXDef.h>
公開方法(Public Methods) | |
| GXShaderUniformType (unsigned int order_=0) | |
| operator unsigned int () | |
| operator const unsigned int () const | |
| const unsigned int | getNumElements () const |
| const unsigned int | getElementType () const |
| const unsigned int | getSize () const |
| void | read (InputStream &is) |
| void | write (OutputStream &os) const |
靜態公開屬性 | |
| static const GXShaderUniformType | BOOL |
| Uniform is a bool. | |
| static const GXShaderUniformType | BVEC2 |
| Uniform is a BVector2. | |
| static const GXShaderUniformType | BVEC3 |
| Uniform is a BVector3. | |
| static const GXShaderUniformType | BVEC4 |
| Uniform is a BVector4. | |
| static const GXShaderUniformType | INT |
| Uniform is a int. | |
| static const GXShaderUniformType | IVEC2 |
| Uniform is a IVector2. | |
| static const GXShaderUniformType | IVEC3 |
| Uniform is a IVector3. | |
| static const GXShaderUniformType | IVEC4 |
| Uniform is a IVector4. | |
| static const GXShaderUniformType | FLOAT |
| Uniform is a float. | |
| static const GXShaderUniformType | VEC2 |
| Uniform is a Vector2. | |
| static const GXShaderUniformType | VEC3 |
| Uniform is a Vector3. | |
| static const GXShaderUniformType | VEC4 |
| Uniform is a Vector4. | |
| static const GXShaderUniformType | MAT2 |
| Uniform is a Matrix2. | |
| static const GXShaderUniformType | MAT3 |
| Uniform is a Matrix3. | |
| static const GXShaderUniformType | MAT4 |
| Uniform is a Matrix4. | |
| static const GXShaderUniformType | SAMPLER2D |
| Uniform is a Texture 2D. | |
| static const GXShaderUniformType | SAMPLERCUBE |
| Uniform is a Texture Cube. | |
GXShaderUniformType encapsulate Type of Uniform Variable of the Shader.


A lightweight but powerful R interface to the 'Azure Resource Manager' REST API. The package exposes classes and methods for 'OAuth' authentication and working with subscriptions and resource groups. It also provides functionality for creating and deleting 'Azure' resources and deploying templates. While 'AzureRMR' can be used to manage any 'Azure' service, it can also be extended by other packages to provide extra functionality for specific services.
| Version: | 1.0.0 |
| Depends: | R (≥ 3.3) |
| Imports: | utils, httr (≥ 1.3), jsonlite, R6 |
| Suggests: | knitr, testthat |
| Published: | 2018-12-02 |
| Author: | Hong Ooi [aut, cre], Microsoft [cph] |
| Maintainer: | Hong Ooi <hongooi at microsoft.com> |
| BugReports: | https://github.com/cloudyr/AzureRMR/issues |
| License: | MIT + file LICENSE |
| URL: | https://github.com/cloudyr/AzureRMR |
| NeedsCompilation: | no |
| Citation: | AzureRMR citation info |
| Materials: | README NEWS |
| CRAN checks: | AzureRMR results |
| Reference manual: | AzureRMR.pdf |
| Vignettes: |
Extending AzureRMR Introduction to AzureRMR |
| Package source: | AzureRMR_1.0.0.tar.gz |
| Windows binaries: | r-devel: AzureRMR_1.0.0.zip, r-release: AzureRMR_1.0.0.zip, r-oldrel: AzureRMR_1.0.0.zip |
| OS X binaries: | r-release: AzureRMR_1.0.0.tgz, r-oldrel: AzureRMR_1.0.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=AzureRMR to link to this page.


|
Pranoy Ray
Research  |
Experience  |
Education  |
Blog
pranoyr [at] outlook [dot] com
I am a Materials Science Researcher by training, who is deeply interested in Materials Informatics. My aim is to pursue research to develop and predict new materials with tailored properties using ML-driven approaches. in an attempt to empower the next generation of sustainable materials in the aerospace and automobile industries.
When I'm not innovating through research, I love to fiddle with new technologies and learn new management techniques to apply them in my future startup establishment aspirations.
When I don't </>, I try to learn and understand the math behind AI and HPC.
CV  /
Google Scholar  /
LinkedIn  /
Github  /
Twitter
|
|
News
- [February 2021] Re-joined as a Research Assistant on two research projects at BARC
- [October 2020] Recieved an admit to join GeorgiaTech as a PhD student in Summer 2021
- [August 2018] My Startup featured in the news [open] [news article]
|
Publications & Conferences
- High capacity reversible hydrogen storage in titanium doped 2D carbon allotrope Ψ-graphene: DFT invtigations
Authors: B. Chakraborty, P.Ray, N. Garg, S. Banerjee
Elsevier - International Journal of Hydrogen Energy [Vol. 46 Issue 5]
Full Length Article - November 2020 [open]
- Ti-doped PSI-Graphene as an Efficient Medium for Hydrogen Storage
Authors: Pranoy Ray, Brahmananda Chakraborty
Department of Atomic Energy Computational Chemistry Symposoium 2019, Govt. of India
Poster - PUBLISHED in Proceedings (under Board of Research for Nuclear Sciences)
[open]
|
Research Experiences & Subsequent Projects
|
|
Research Assistant Bhabha Atomic Research Centre Mumbai, India [open]
July 2019 to Nov 2020 Feb 2020 - Present
◦ Completed a project where we predicted a Novel Material System for Hydrogen Storage
(Research Paper Published)
◦ Completed a project which involved prediction of a new Material System using DFT (Density Functional Theory), Bader Charge Ananlysis & MD Simulations.
◦ Poster Presented at DAE CCS 2019, and Abstract published in proceedings
◦ Prediction of Nuclear Coolant Materials for MSRs, HP & SRPD - This project was conducted under the supervision of Dr. B. Chakraborty (Scientist G, BARC). The variation of properties of fluoride and chloride salts against various factors & conditions were studied.
|
|
|
Research Intern Indian Institute of Technology Bombay, India [open]
July 2020 - Nov 2020
Worked on a Materials Informatics project using the Random Forest - Machine Learning Algorithm in Python. The determination of Mechanical Properties of various binary and ternary alloys with the aid of Materials Informatics and ML-driven approaches was analyzed. [weblink]
|
|
|
Research Intern Indian Institute of Technology Kharagpur, India [open]
June 2020 - Oct 2020
◦ Worked on a Phase-Field Modelling project involving DFT & MD Simulations.
◦ Managed Collaborations with Washington University at St. Louis & IIT Kanpur
|
|
|
Project & Industrial Intern Hindustan Aeronautics Limited [open]
May 2018 to July 2018
Completed two Projects, namely: [open]
◦ The Identification of Post Investment Casting Defects ◦ Preventive Measures for Quality Control using Lean Management
|
|
|
Undergraduate Research Assistant Physics Department, NIT Durgapur
Summer-Winter 2017
Determination of Water Contamination Content Profile in a Steel Plant Belt(Durgapur)- This project was completed under the supervision of Dr. Hirok Chaudhari (Prof.of the Physics Department, NITD). The determination of the content profile and their effect in our daily lives, besides a few other detrimental physical factors were measured, which were further used as inputs to fabricate an anti-polluting membrane.
|
|
Technical Skills
- [Programming Languages] : Python, Java, R, C, LaTeX
- [Simulation Packages] : VASP, LAMMPS
- [Softwares] : VESTA, Origin, THERMOCALC, Ovito, BlueJ, Adobe Photoshop, MS Word, MS Excel, MS Power-Point
- [Frameworks] : Shell Scripting, Flask, PyQt4, PyCalphad
|
Education
|
|
Bachelor of Technology, Metallurgical and Materials Engineering National Institute of Technology Durgapur, India [open]
July 2016 - June 2020 Passed with First Class
Defended undergradute thesis "Study of microstructure-property and wear behaviour of hypereutectic Al-17Si alloy" [open] Supervisors : Prof. K.S.Ghosh and Prof. B.K.Show, MME, NIT Durgapur
|
|
|
High School Don Bosco School Park Circus [open]
April 2002 - April 2016 Class 12 Passed with 95.25% (ISC 2016) Class 10 Passed with 94.60% (ICSE 2014)
|
|
Grants & Accolades
- [NIT Durgapur] Travel Grant to present my poster at DAE-CCS 2019 (Mumbai)
- [Coursera] Grant of Financial Aid to pursue Stanford University's ML Course
|
|


Mi 11 Ultra Vs Samsung S21 Ultra [ Legends of Android Mobile Community. ]
Why Mi 11 Ultra? | Why Samsung s21 Ultra?
I think all of you already know that Mi 11 Ultra has one of the highest benchmarks in the andoried mobile community.
So, If you want a performance you can go for Mi 11 Ultra.
But Samsung S21 also has one of the highest benchmarks but Mi 11 ultra provides better performance but the difference between the performance is very little.
Camera
Mi 11 Ultra has a very nice camera but the picture quality in both mobiles is the same but Samsung has more features and in Samsung S21 ultra, you will find one of the best software in the world.
Display
Both have Samsung Display | If you like the curved display you can go for Mi 11 ultra | But If you like Flat Display then S21 Ultra is Best for You.
Software
Samsung S21 Ultra has the best Android Software and it is secure by Knox | Mi 11 Ultra also has good Software but in its software, you will find too many bugs and ads but may get fixed after an update.
Battery
Both have 5,000 mah Battery but S21 Ultra have 25w fast charging and Mi 11 Ultra have 67w fast Charging | Samsung S21 ultra take approx 1 hour 8 minutes to charge fully from 0% to 100% | But Mi 11 Ultra take 36 min to charge fully
from 0% to 100% - [ 32min did not affect your day to day life ]
Which phone do I need to buy?
If your budget is 70,000 then You can buy Mi 11 ultra | At this price, it is the best mobile. - [ Value for Money ]
But If you can give 36,000 more, I will recommend you to buy a Samsung mobile. [ Recommended ]
Is iPhone Good If my budget is 1lakh+?
There is no comparison between an android device or an Ios device | Android Users prefers Android | Ios User prefers iPhone
But if you are an Ios user, I recommended you to buy Ios.
The average life of a flagship phone?
- 2 to 3 years
The best Android company, If I want an All-Rounder Mobile with Software, Security, Camera & performance?
Samsung is best for all-rounder but for that, you need to pay more | If you can't pay more choose Realme [ Realme recommended for mid-range Mobiles | Samsung recommended for Flagships Mobiles].
Advice - [ The best Value for money Mobiles are Mid Range Mobiles (10,000 - 30,000) ].


Slide 1
Button for Events
Slide 2
Button for Events
Slide 3
Button for Events
Slide 4
Button for Events
Slide 5
Button for Events
Slide 6
Button for Events
Slide 7
Button for Events
Slide 8
Button for Events
Slide 9
Button for Events


You can make it totally from scratch using grain which involves crushing roasted malted barley, simmering it at specific temperatures, straining, sparging (rinsing), then boiling it, adding hops and then cooling it before adding the yeast (all this will take you about 6 hours) and then fermenting and bottling the finished beer
No, making beer is easy. If you have enough time, then make it from scratch otherwise using kits is a very easy and very tasty way of getting beer just like you’d drink in a pub.
Fermentation usually takes about a week, with another couple of weeks waiting for it to clear. It can take as little at 3 weeks from making to drinking, but the longer it is left to mature the better.


--- layout: post title: Zip Seeking Missile date: 2014-11-22 00:03:37.000000000 -05:00 categories: blog ---
In the spirit of "don't give a presentation without offering a script/tool", here is something I am currently dubbing the "Zip Seeking Missile€ (not married to that name, suggestions are welcome). This script reads in a file and looks for the Local File Headers, Central Directory File Headers, and Central Directory End Records. If found it will attempt to parse the various fields. It is still pretty rough but it is good enough now that someone might find it useful. I intend on adding analysis of the compressed file data and automating the carving process as well. I realize there are probably dozens of software that already do this but I enjoy the insight that comes with building tools from the ground up.
https://github.com/glassdfir/ZipFileJunk/blob/master/zsm.py
Here is the usage information:
Zip Seeking Missile ========================================== Purpose: Reads binary file for zip file headers and parses the metadata. Usage: python zsm.py -f memdump.dmp This tool can be used on memory dumps, pcaps, disk images, zip files, MS-Office 2007+ files (docx,xlsx...) Usage: zsm.py [options] Options: -h, --help show this help message and exit -f FILE, --file=FILE File to carve Zips from -v, --verbose Show more than file names -c, --count Display only the counts of meta types C:DEMO>python zsm.py -f "This is a test.docx" Possible 11 Local File Headers at offsets: [0, 915, 1715, 2281, 2884, 4506, 5491, 5991, 6306, 6984, 7661] Offset 0 - LH INFO - File name: [Content_Types].xml Offset 915 - LH INFO - File name: _rels/.rels Offset 1715 - LH INFO - File name: word/_rels/document.xml.rels Offset 2281 - LH INFO - File name: word/document.xml Offset 2884 - LH INFO - File name: word/theme/theme1.xml Offset 4506 - LH INFO - File name: word/settings.xml Offset 5491 - LH INFO - File name: word/fontTable.xml Offset 5991 - LH INFO - File name: word/webSettings.xml Offset 6306 - LH INFO - File name: docProps/app.xml Offset 6984 - LH INFO - File name: docProps/core.xml Offset 7661 - LH INFO - File name: word/styles.xml Possible 11 Central Directory File Headers at offsets: [10549, 10614, 10671, 10745, 10808, 10875, 10938, 11002, 11068, 11130, 11193] Offset 10549 - CD INFO - File name: [Content_Types].xml Offset 10614 - CD INFO - File name: _rels/.rels Offset 10671 - CD INFO - File name: word/_rels/document.xml.rels Offset 10745 - CD INFO - File name: word/document.xml Offset 10808 - CD INFO - File name: word/theme/theme1.xml Offset 10875 - CD INFO - File name: word/settings.xml Offset 10938 - CD INFO - File name: word/fontTable.xml Offset 11002 - CD INFO - File name: word/webSettings.xml Offset 11068 - CD INFO - File name: docProps/app.xml Offset 11130 - CD INFO - File name: docProps/core.xml Offset 11193 - CD INFO - File name: word/styles.xml Found 1 hits for Central Dir. End Record at byte offsets [11254] . C:UsersjonDocumentsGitHubZipFileJunk>python zsm.py -f "c:demozipFile1.zip" -v Possible 3 Local File Headers at offsets: [0, 64, 128] Offset 0 - LH INFO - File name: File1.txt Version: 2.00 Compression: 08: Deflated Last Modified Date 2014-11-13 22:31:28 CRC-32 Checksum: 751451497 Compressed size: 25 Uncompressed size: 40 File Name Length: 0 Extra Field Length: 0 Offset 64 - LH INFO - File name: File2.txt Version: 2.00 Compression: 08: Deflated Last Modified Date 2014-11-13 22:31:16 CRC-32 Checksum:<PHONE_NUMBER> Compressed size: 25 Uncompressed size: 40 File Name Length: 0 Extra Field Length: 0 Offset 128 - LH INFO - File name: File3.txt Version: 2.00 Compression: 08: Deflated Last Modified Date 2014-11-02 23:47:04 CRC-32 Checksum:<PHONE_NUMBER> Compressed size: 22 Uncompressed size: 23 File Name Length: 0 Extra Field Length: 0 Possible 3 Central Directory File Headers at offsets: [189, 244, 299] Offset 189 - CD INFO - File name: File1.txt Version: 2.00 Version Needed To Extract: 2.00 Compression: 08: Deflated Last Modified Date 2014-11-13 22:31:28 CRC-32 Checksum: 751451497 Compressed size: 25 Uncompressed size: 40 File Name Length: 9 Extra Field Length: 0 File Comment Length: 0 Disk # Start: 0 Offset 244 - CD INFO - File name: File2.txt Version: 2.00 Version Needed To Extract: 2.00 Compression: 08: Deflated Last Modified Date 2014-11-13 22:31:16 CRC-32 Checksum:<PHONE_NUMBER> Compressed size: 25 Uncompressed size: 40 File Name Length: 9 Extra Field Length: 0 File Comment Length: 0 Disk # Start: 0 Offset 299 - CD INFO - File name: File3.txt Version: 2.00 Version Needed To Extract: 2.00 Compression: 08: Deflated Last Modified Date 2014-11-02 23:47:04 CRC-32 Checksum:<PHONE_NUMBER> Compressed size: 22 Uncompressed size: 23 File Name Length: 9 Extra Field Length: 0 File Comment Length: 0 Disk # Start: 0 Found 1 hits for Central Dir. End Record at byte offsets [354] .
Taking this experiment to a logical extreme, I threw a 12GB memory dump into the script and here are the results. I was amazed by all of the Java that was floating around in memory. I also noticed the tool can generate some false positives on the file name. Occasionally those magic numbers just occur in memory and this script will attempt to parse whatever it sees. I did put a limit of 260 on the file name in an effort to knock down some of the false positives. Windows Shell API limits a single path to around 260 characters depending upon your flavor of Windows. Seems like as good of a number as any.


script.addEventListener('load', callback)
fires on script load and calls the callback function that we pass to it!
[ScriptLoadService object].loadScript(mapsApiUrl, 'map-script-id', () => {
const maps = window['google']['maps'];
this.map = new maps.Map( ... details here ...);
}
Notice how instead of referencing directly the google.maps
object (as we could and would be allowed to),
we are reading it explicitly from the window object.
If we reference it directly, the linter will complain because it cannot see its definition.


This is a Sublime Text plugin for building markdown into html and open it in browser.
Install using Package Control (Recommanded)
Install manually
Originally this plugin is named "SublimeMarkdown" which features automatic bullet points, numbered lists etc. Now the bullet points functionality is extracted to a separated plugin named "SublimeBullet" https://github.com/erinata/SublimeBullet
Press Ctrl+b to build the markdown file to html and view it in the browser. It used Python-markdown to build the html file but you do not need to have Python installed in order to use this plugin. This package utilizes the Python inside Sublime Text to get the job done.
I also include a Markdown.tmLanguage file so the markdown files' syntax should be highlighted. It works well with the theme "SunBurst" but it should work for other themes too.
You can customize the behaviour of MarkdownBuild in that MarkdownBuild.sublime-settings file.
This project only target at building Markdown. But it can be modified to support other formats.
For textile support please see Xkeeper's SublimeTextileBuild https://github.com/Xkeeper/SublimeTextileBuild
Please fork this project if you want it to support other document formats. In most case the only part of code that you need to change is the line
md = markdown_python.markdown(contents)
in the file MarkdownBuild.py
. Just change it to the parser you likem, this plugin will build the html and show it in the browser accordingly.
Of course you can rename the files, commands, or css ...... etc. Xkeeper's SublimeTextileBuild https://github.com/Xkeeper/SublimeTextileBuild is a good example.
This package works on Windows, OSX, and Linux
Copyright (C) 2012 Tom Lam. MIT License.


[§398-2] Inapplicability. The rights provided under this chapter shall not apply to employees of an employer with fewer than one hundred employees. [L 1991, c 328, pt of §1]


@Retention(value=RUNTIME)
@Inherited
public @interface SchemaProperty
properties
attribute of a Schema
annotation.
These types can be objects, but also primitives and arrays.
This object is an extended subset of the JSON Schema Specification Wright Draft 00.| Modifier and Type | Required Element and Description |
|---|---|
java.lang.String |
name
The name of the property.
|
| Modifier and Type | Optional Element and Description |
|---|---|
java.lang.Class<?>[] |
allOf
Provides an array of java class implementations which can be used to describe multiple acceptable schemas.
|
java.lang.Class<?>[] |
anyOf
Provides an array of java class implementations which can be used to describe multiple acceptable schemas.
|
java.lang.String |
defaultValue
Provides a default value.
|
boolean |
deprecated
Specifies that a schema is deprecated and SHOULD be transitioned out of usage.
|
java.lang.String |
description
A description of the schema.
|
DiscriminatorMapping[] |
discriminatorMapping
An array of discriminator mappings.
|
java.lang.String |
discriminatorProperty
Provides a discriminator property value.
|
java.lang.String[] |
enumeration
Provides a list of enum values.
|
java.lang.String |
example
A free-form property to include an example of an instance for this schema.
|
boolean |
exclusiveMaximum
If true, makes the maximum value exclusive, or a less-than criteria.
|
boolean |
exclusiveMinimum
If true, makes the minimum value exclusive, or a greater-than criteria.
|
ExternalDocumentation |
externalDocs
Additional external documentation for this schema.
|
java.lang.String |
format
Provides an optional override for the format.
|
boolean |
hidden
Allows schema to be marked as hidden.
|
java.lang.Class<?> |
implementation
Provides a java class as implementation for this schema.
|
java.lang.String |
maximum
Sets the maximum numeric value for a property.
|
int |
maxItems
Only applicable if type=array.
|
int |
maxLength
Sets the maximum length of a string value.
|
int |
maxProperties
Constrains the number of arbitrary properties when additionalProperties is defined.
|
java.lang.String |
minimum
Sets the minimum numeric value for a property.
|
int |
minItems
Only applicable if type=array.
|
int |
minLength
Sets the minimum length of a string value.
|
int |
minProperties
Constrains the number of arbitrary properties when additionalProperties is defined.
|
double |
multipleOf
Constrains a value such that when divided by the multipleOf, the remainder must be an integer.
|
java.lang.Class<?> |
not
Provides a java class to be used to disallow matching properties.
|
boolean |
nullable
Allows sending a null value for the defined schema.
|
java.lang.Class<?>[] |
oneOf
Provides an array of java class implementations which can be used to describe multiple acceptable schemas.
|
java.lang.String |
pattern
A pattern that the value must satisfy.
|
boolean |
readOnly
Relevant only for Schema "properties" definitions.
|
java.lang.String |
ref
Reference value to a Schema definition.
|
java.lang.String[] |
requiredProperties
Allows multiple properties in an object to be marked as required.
|
java.lang.String |
title
A title to explain the purpose of the schema.
|
SchemaType |
type
Provides an override for the basic type of the schema.
|
boolean |
uniqueItems
Only applicable if type=array.
|
boolean |
writeOnly
Relevant only for Schema "properties" definitions.
|
public abstract java.lang.String name
The name will be used as the key to add this schema to the parent schema's 'properties' map.
public abstract java.lang.Class<?> implementation
public abstract java.lang.Class<?> not
public abstract java.lang.Class<?>[] oneOf
Inline or referenced schema MUST be of a Schema Object and not a standard JSON Schema.
public abstract java.lang.Class<?>[] anyOf
Inline or referenced schema MUST be of a Schema Object and not a standard JSON Schema.
public abstract java.lang.Class<?>[] allOf
Inline or referenced schema MUST be of a Schema Object and not a standard JSON Schema.
public abstract java.lang.String title
public abstract double multipleOf
public abstract java.lang.String maximum
public abstract boolean exclusiveMaximum
public abstract java.lang.String minimum
public abstract boolean exclusiveMinimum
public abstract int maxLength
public abstract int minLength
public abstract java.lang.String pattern
public abstract int maxProperties
public abstract int minProperties
public abstract java.lang.String[] requiredProperties
public abstract java.lang.String description
public abstract java.lang.String format
If a consumer is unaware of the meaning of the format, they shall fall back to using the basic type without format. For example, if \"type: integer, format: int128\" were used to designate a very large integer, most consumers will not understand how to handle it, and fall back to simply \"type: integer\"
public abstract java.lang.String ref
This property provides a reference to an object defined elsewhere. This property and all other properties are mutually exclusive. If other properties are defined in addition to the ref property then the result is undefined.
public abstract boolean nullable
public abstract boolean readOnly
If the property is marked as readOnly being true and is in the required list, the required will take effect on the response only. A property MUST NOT be marked as both readOnly and writeOnly being true.
public abstract boolean writeOnly
If the property is marked as writeOnly being true and is in the required list, the required will take effect on the request only. A property MUST NOT be marked as both readOnly and writeOnly being true.
public abstract java.lang.String example
To represent examples that cannot be naturally represented in JSON or YAML, a string value is used to contain the example with escaping where necessary.
When associated with a specific media type, the example string shall be parsed by the consumer to be treated as an object or an array.public abstract ExternalDocumentation externalDocs
public abstract boolean deprecated
public abstract SchemaType type
Value MUST be a string. Multiple types via an array are not supported.
MUST be a valid type per the OpenAPI Specification.public abstract java.lang.String[] enumeration
public abstract java.lang.String defaultValue
Unlike JSON Schema, the value MUST conform to the defined type for the Schema Object defined at the same level.
For example, if type is string, then default can be "foo" but cannot be 1.public abstract java.lang.String discriminatorProperty
The discriminator is an object name that is used to differentiate between other schemas which may satisfy the payload description.
public abstract DiscriminatorMapping[] discriminatorMapping
public abstract boolean hidden
public abstract int maxItems
An array instance is valid against "maxItems" if its size is less than, or equal to, the value of this keyword.
Ignored if value is Integer.MIN_VALUE.public abstract int minItems
An array instance is valid against "minItems" if its size is greater than, or equal to, the value of this keyword.
Ignored if value is Integer.MAX_VALUE.public abstract boolean uniqueItems
If false, the instance validates successfully. If true, the instance validates successfully if all of its elements are unique.


0 people are discussing these questions
(This stuff helps us figure out how many fruitcakes to make come December)
You must include at least one person
Got it! Enjoy your discussion.


{% extends "base.html" %}
{% block content %}
{% if hacs.configuration.dev %}
{% set message = "You have 'dev' enabled for HACS, this is not intended for regular use, no support will be given if you break something." %}
{% include 'message.html' with context %}
{% endif %}
{% include 'modal/upgrade_all.html' with context %}
{% include 'settings/hacs_info.html' with context %}
{% include 'settings/buttons.html' with context %}
{% include 'settings/custom_repositories.html' with context %}
{% include 'settings/hidden_repositories.html' with context %}
{% if hacs.configuration.dev and not hacs.system.status.background_task %}
{% include 'settings/developer.html' with context %}
{% endif %}
{% endblock %}


EATING A film review by Jon Newman Copyright 1991 Jon Newman
Director Henry Jaglom's new film EATING has the voyeuristic attraction of spying on a group therapy session. On the surface, the scene of this film is a large birthday party in (where else?) southern California, where 38 women gather to celebrate the birthdays of Helene (turning 40), Kate (30) and Sadie (50). However, much of the film centers on the deeply personal revelations of these women concerning their problems with food, men and body image. As the film progresses, we see more and more how the various problems of these apparently independent and successful women express themselves in an obsession with food, thinness and dieting.
One of these women is Martine, a French television documentary maker, played convincingly by Nelly Allard. Martine is ostensibly producing a documentary about Southern California lifestyles, but her work actually centers on women and food. This "play within a play" mechanism is contrived, but it produces some of the most memorable moments of the film. EATING is sprinkled with short cutaways and collages from this woman's videocamera, as the women at the party describe the formative moments of their relationship with food.
I will not try to list all of the notable performances in this film, since every one of the actresses, even the nameless bit players, has her moment of revelation, many in front of Martine's videocamera. Director Henry Jaglom obviously establishes a rapport with these women, and the portrayals come across as absolutely authentic. I will however, single out two performances. Gwen Welles plays the neurotic and unsympathetic Sophie, whose jealousy of her successful (and, above all, thin) friends leads her to viciously attack and manipulate her closest friend Helene. And Frances Bergen (Candice's mother) plays Helene's mother, perhaps the only character who is not obsessed with food, and who tries to confront various other characters with their neurotic behavior.
One memorable scene: The cutting of the birthday cake, where slices of birthday cake are passed endlessly around the room as if they were time bombs.
My favorite line: "I guess I'm still looking for a man who will excite me as much as a baked potato."
While EATING does center on the topic of eating disorders, it is completely unlike those preachy television docudramas which isolate specific problems in an otherwise Leave it To Beaver world. EATING presents eating disorders with both humor and pathos, as a symptom of the problems women face in affluent Western society.
I strongly recommend EATING to anyone who can put up with "talky" films. In my opinion, this may be the best film to hit the arthouse scene since JESUS OF MONTREAL.
This is my first contribution to r.a.m.r; I hope you like it!
--<EMAIL_ADDRESS>.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Money Play. How should Red play 31?
pips Red=154 White=109
(CorrectAnswer= 0/0, ErrorScore= 0)
Only compromise your home board if you absolutely have to. I have learnt that lesson so many times!
Here Red does not have to compromise his board and should simply play 16/12. White is not favourite to hit the blot. Any play other 16/12 is a blunder. Even if you take the spare checkers from White’s 6- and 5-pts to make his ace-point, 16/12 would still be the correct play by a long, long way.
Lesson learnt - again!
Here Red does not have to compromise his board and should simply play 16/12. White is not favourite to hit the blot. Any play other 16/12 is a blunder. Even if you take the spare checkers from White’s 6- and 5-pts to make his ace-point, 16/12 would still be the correct play by a long, long way.
Lesson learnt - again!
1. Cubeful 2-ply 16/12 Eq.: -0.149 0.411 0.098 0.003 - 0.589 0.208 0.004 2. Cubeful 2-ply 16/13 4/3 Eq.: -0.232 (-0.083) 0.376 0.081 0.002 - 0.624 0.191 0.005 3. Cubeful 2-ply 16/13 6/5 Eq.: -0.277 (-0.129) 0.363 0.073 0.001 - 0.637 0.196 0.004 4. Cubeful 2-ply 16/13 5/4 Eq.: -0.294 (-0.146) 0.358 0.074 0.001 - 0.642 0.203 0.005 5. Cubeful 2-ply 16/13 2/1 Eq.: -0.296 (-0.148) 0.355 0.078 0.002 - 0.645 0.202 0.005


Task manager API to abstract the connection and logic with the mongo database
Obtains a JSON with all the tasks on the system
curl -X GET "{{url}}/tasks"
GET %7B%7Burl%7D%7D/tasks HTTP/1.1
Host:
Inserts a task on the system based on a JSON document provided and returns the result of this operation in JSON format
curl -X POST -H "Content-Type: application/json" -d ' {"title": "test title",
"reference": "test ref",
"description": "test desc",
"timeWorked": [],
"status": "test status",
"visible": true }' "{{url}}/tasks"
POST %7B%7Burl%7D%7D/tasks HTTP/1.1
Host:
Content-Type: application/json
{"title": "test title",
"reference": "test ref",
"description": "test desc",
"timeWorked": [],
"status": "test status",
"visible": true }
Deletes a task on the system using its ID passed by parameter
curl -X DELETE "{{url}}/tasks/{{id}}"
DELETE %7B%7Burl%7D%7D/tasks/%7B%7Bid%7D%7D HTTP/1.1
Host:
Obtains the array of times for a specific task by its id
curl -X GET "{{url}}/times/{{id}}"
GET %7B%7Burl%7D%7D/times/%7B%7Bid%7D%7D HTTP/1.1
Host:
curl -X POST -H "Content-Type: application/json" -d '{"timestamp": "Sat Aug 31 2019 08:36:35 GMT+0100", "duration": 666}' "{{url}}/times/{{id}}"
POST %7B%7Burl%7D%7D/times/%7B%7Bid%7D%7D HTTP/1.1
Host:
Content-Type: application/json
{"timestamp": "Sat Aug 31 2019 08:36:35 GMT+0100", "duration": 666}
Deletes an entry to the time table for a single document specified by id
curl -X DELETE -H "Content-Type: application/json" -d '{"timestamp": "Sat Aug 31 2019 08:36:35 GMT+0100"}' "{{url}}/times/{{id}}"
DELETE %7B%7Burl%7D%7D/times/%7B%7Bid%7D%7D HTTP/1.1
Host:
Content-Type: application/json
{"timestamp": "Sat Aug 31 2019 08:36:35 GMT+0100"}


Using Extensions
Not everyone needs every feature all the time. DMZ has been designed to allow simple extensions that enable you to enhance DataMapper models. There are two primary ways to extend DataMapper, which can be used at the same time.
The techniques differ greatly, and will be described in brief below.
Using Shareable Extension Classes
This is the recommended way of extending a DataMapper model. This technique allows you to add methods and custom validation rules to DataMapper models, without having to change any existing code.
It works by calling non-private methods on separate classes as needed. These classes are usually stored within the application/datamapper directory. You can change this directory by changing the DataMapper config item 'extensions_path'.
An extension is automatically loaded either globally, through the DataMapper config, or on a per-class basis, through the $extensions array. The order you load the methods matters, as the first extensions loaded take precedence over later ones. (Per-class or local extensions will also override global extensions.) You can also load an extension on-the-fly using load_extension.
Adding a Global Extension
// In DataMapper Config $config['extensions'] = array('json'); // Include the json extension
Adding an Extension to the User Class Only
class User extends DataMapper { // Include the json extension var $extensions = array('json'); // ...
Loading Global Extensions Dynamically with load_extension
$user = new User(); // load csv, which is now available on all DataMapper objects. $user->load_extension('csv');
You can also include other files that are stored relative to the application directory by including the path. For example, to include a library, you would use 'library/mylibary'
Note that all three can coexist. You can load some extensions in globally and others locally, at the same time, and still others on-the-fly.
Some extensions include the ability to pass in options.
Adding a Global Extension with Options
// In DataMapper Config
$config['extensions'] = array('htmlform' => array(
'form_template' => 'my_form_template'
));
Dynamically Loading a Single (Global) Extension with Options
$user = new User();
// load htmlform, which is now available on all DataMapper objects.
$user->load_extension('htmlform', array('row_template' => 'my_row_template'));
Dynamically Loading a Single (Local) Extension with Options
You can also dynamically load an extension for a single class. This allows you to provide different options for each model.
$user = new User();
// load htmlform, which is now available on all DataMapper objects.
$user->load_extension('htmlform', array('row_template' => 'my_row_template'), TRUE);
Using the Extension
The extensions work by adding methods directly to the DataMapper models. In the above example, the json extension adds several methods, including:
to_json()from_json()
These methods would be called as a normal method:
$u = new User(); $u->get_by_id($user_id); echo $u->to_json();
You can Learn more about writing your own extensions, or you can view the list of included extensions.
Extending DataMapper Directly
Some features are not able to be added using the extensions mechanism. This includes those that need to override built-in DataMapper methods.
To handle these, it is recommended that you create a class that extends DataMapper, and use that as your base class for your models. You can call it whatever you like, but for the examples below, I named it DataMapperExt:
application/models/datamapperext.php
class DataMapperExt extends DataMapper { function __construct($id = NULL) { parent::__construct($id); } // Add your method(s) here, such as: // only get if $this wasn't already loaded function get_once() { if( ! $this->exists()) { $this->get(); } return $this; } }
application/models/user.php
class User extends DataMapperExt { // Standard DataMapper definition function __construct($id = NULL) { parent::__construct($id); } // ... }
Now you can add any methods or properties you want to DataMapperExt, and they will be visible to any model that subclasses DataMapperExt. You can even overwrite default DataMapper methods.
The drawbacks to this method is that it is very difficult to share this kind of extension, and it isn't very modular. In any case, I highly recommend it whenever you think you need to edit DataMapper directly.


module ISet: BatISet
type t
= BatAvlTree.tree (int, int)
the underlying representation is a balanced tree of ranges
type elt
= int
This kind of set only holds ints
let empty : t
The empty set
let is_empty : t => bool
Test whether a set is empty, returns true
if the set is empty.
let mem : int => t => bool
test whether a given int is a member of the set
let add : int => t => t
Add the given int to the set, returning a new set
let add_range : int => int => t => t
add_range lo hi t
adds the range of integers lo, hi
(including both endpoints) to
the given set, returning a new set
Raises Invalid_argument
if lo
> hi
let singleton : int => t
Return the singleton set containing only the given element
let remove : int => t => t
Remove an element from the given set, returning a new set
let remove_range : int => int => t => t
remove_range lo hi t
removes a range of elements from the given set, returning a new set
Raises Invalid_argument
if lo
> hi
let union : t => t => t
Compute the union of two sets. This is the set whose elements are
those elements in either input set.
let inter : t => t => t
Compute the intersection of two sets. This is the set whose
elements are those in *both* of the input sets.
let diff : t => t => t
Compute the difference between two sets. This is the set of
elements that are in the first but not in the second. Unlike
union
and inter
, order matters here.
let compl : t => t
Create the complement of the given set - i.e. the set of all
values not in the input set.
let compare : t => t => int
Compare two sets. It is not safe to use the polymorphic (<) and
related functions to compare these sets, as the tree representation
used can balance in multiple ways.
let equal : t => t => bool
Test whether two sets are equal. It is not safe to use the
polymorphic (=) on these sets, as the same set can have multiple
representations depending on how it was built.
let ord : t => t => BatOrd.order
Same as compare
but returns BatOrd.Lt | BatOrd.Eq | BatOrd.Gt
instead of an int.
let subset : t => t => bool
subset t u
returns true
if t
is a subset of u
let from : int => t => t
from x t
returns the portion of t
in the range x, max_int
let after : int => t => t
after x t
returns the portion of t
in the range x+1, max_int
let until : int => t => t
until x t
returns the portion of t
in the range min_int, x
let before : int => t => t
before x t
returns the portion of t
in the range min_int, x-1
let iter : (int => unit) => t => unit
iter f t
calls f
once for each element of t
let iter_range : (int => int => unit) => t => unit
iter_range f t
calls f
once for each contiguous range of t
.
The contiguous ranges of a set are sequences of adjacent integers
all part of the set.
let fold : (int => 'a => 'a) => t => 'a => 'a
fold f t x0
returns the final result of merging each element of
t
into x0
using merge function f
let fold_range : (int => int => 'a => 'a) => t => 'a => 'a
As fold, but operates on contiguous ranges
let for_all : (int => bool) => t => bool
Tests whether a predicate applies to all elements of the set
let exists : (int => bool) => t => bool
Test whether some element of a set satisfies a predicate
let filter : (int => bool) => t => t
Builds the subset of those elements that satisfy the predicate
let partition : (int => bool) => t => (t, t)
partitions the input set into two sets with elements that satisfy
the predicate and those that don't
let cardinal : t => int
Returns the number of elements in the set
let elements : t => list int
Returns a list of all elements in the set
let ranges : t => list (int, int)
Returns a list of all contiguous ranges in the set
let min_elt : t => int
Returns the minimum element in the set
let max_elt : t => int
Returns the maximum element in the set
let choose : t => int
Returns some element in the set
let enum : t => BatEnum.t (int, int)
Enumerates all contiguous ranges in the set
let of_enum : BatEnum.t (int, int) => t
let of_list : list (int, int) => t
Build a ISet.t out of a list or enum of ranges
let print : BatIO.output 'a => t => unit


Content of section 1.
This styleguide includes components, typographical conventions, etc. The mark-up uses Zurb Foundation 4 conventions by default, but feel free to change it if you have your own (or another) CSS framework and/or conventions.
See Zurb's own Kitchen Sink page, for the most up-to-date and complete set of all of their Foundation components.
Every front-end developer has that perfect combination of tools and libraries that he or she already uses to improve their workflow. Sometimes its that special combination of plugins to trick out their favorite editor or IDE (e.g. the perfect Vim, Sublime Text, or WebStorm set up). As we continue to learn of new tools, libraries, and best practices, we further pepper our set ups. But it turns out to be really hard to keep up with what "the cool kids" are using at any given point in time. This is why an opinionated tool such as Yeoman can help us out so much. We’re provided an assortment of battle-tested developer tools that help us maintain best practices and speed up workflow.
Here is a standard link.
Insanity: doing the same thing over and over again and expecting different results.Albert Einstein
It has an easy to override visual style, and is appropriately subdued.
It's a little ostentatious, but useful for important content.
Zurb Foundation tables default to being pre-styled with zebra-striping, borders, etc. If you don't want these you'll need to override the settings that get used by the scss/foundation/components/_tables.scss partial by defining the appropriate variables in your settings override (that gets included before foundation):
$table-bg: #fff !default; $table-even-row-bg: #f9f9f9 !default;// e.g. make the same as $table-bg to remove striping $table-border-style: solid !default; // e.g. change to 'none'
| Table Header | Table Header | Table Header | Table Header |
|---|---|---|---|
| Content Goes Here | This is longer content Donec id elit non mi porta gravida at eget metus. | Content Goes Here | Content Goes Here |
| Content Goes Here | This is longer Content Goes Here Donec id elit non mi porta gravida at eget metus. | Content Goes Here | Content Goes Here |
| Content Goes Here | This is longer Content Goes Here Donec id elit non mi porta gravida at eget metus. | Content Goes Here | Content Goes Here |
Regular Label
Radius Secondary Label
Round Alert Label
Success Label
Form elements are wrapped in grid specs so they can be positions and sized to your exact specification! For example, the following form uses row and columns grid techniques to control each for element's size. Note that this only applies if you're using Zurb Foundation.
Content to the right of the navigation.


# Snake direction = 1 function arrowUp() direction = 0 function arrowRight() direction = 1 function arrowDown() direction = 2 function arrowLeft() direction = 3 function loop() if direction is 0 moveUp() else if direction is 1 moveRight() else if direction is 2 moveDown() else if direction is 3 moveLeft() # Calculator function multiply(a, b) sum = 0 repeat b times sum = sum + a return sum function pow(base, exponent) sum = base repeat exponent - 1 times sum = multiply(sum, base) return sum


Demonstrate how to:
<svg>
,
This example is based on Mike Bostock's Drag & Zoom II Block. The original source with its supporting explanation can be found by following the link below.
Source: Drag & Zoom II Block.
The implementation is an Angular component with inputs.
The component supports inputs controlling key layout determinants: height, width, the radius of the phyllotaxis layout,
and the point radius. Its template is a plain <svg>
element.
The component renders the visualization using the d3
instance provided by the injected D3Service
.
When input values change, the visualization is redrawn.
The D3 component can be embedded into a parent component using the following tag:
<app-drag-zoom-2 [width]="960" [height]="500" [phylloRadius]="10" [pointRadius]="2.5"></app-drag-zoom-2>
.
The numeric example inputs above reflect the choices of the reference source. However, in true Angular manner the component is reusable and can obtain input values from parent component properties, as shown below.
The source code for the D3 component and its parent component can be found at:
| Choose Layout: | |||
|---|---|---|---|
| Width | {{selectedLayout.width}} | Height | {{selectedLayout.height}} |
| Radius (Phyllotaxis) | {{selectedLayout.phylloRadius}} | Radius (Point) | {{selectedLayout.pointRadius}} |


Quick Start Guide¶
Instructions for installing anemoi.¶
Anemoi only supports Python 3 and requires statsmodels, which is distributed via Anaconda. First, if you have a Windows machine you’ll need to install a C++ compiler. You can do this by installing the most recent version of Visual Studio Community edition from here. Then, assuming you’ve already installed Anaconda, run the following:
conda install statsmodels
pip install anemoi
If you can run the following within a Jupyter Notebook without an error you know you’re ready to analize some wind data.
1 | import anemoi as an
|
Alternate instructions for using anemoi.¶
You can download the anemoi package from the master branch on GitHub and place the anemoi folder in your working directory. This option requires you to separately install all the needed Python packages listed in the requirements.txt file.


__________/| MMBones
(_|__|_____\|________
,|_|____________)
The Homepage of the Michigan Marching Band Trombone Section
Web
Bones
Bonebabes
Bass Bones
Fossils
Maps
Money
Join Us
Links
contact us »
The Homepage of The Michigan Marching Band Trombone Section
MMBones Home
-
The Michigan Marching Band
-
The Michigan Athletic Department
-
The University of Michigan
©2004-2013 MMBones


MESSI
Group number 13
The application will allow users to track complete details about a player starting from his personal details, going through club and nationality information to right down to his technicalities at each position in soccer world. The software also allows users to view the whole list of players, teams and footballing statistics at once, thereby helping them build their perspective. Users have the privilege to add new players to a particular team, and to modify their records when the player decides to retire. FIFA 18 player management system also allows users to access players based on their rating other than their preferential position of playing thus guiding managers to build a strong positional team by selecting best rated player at each position. In conclusion, this application will come extremely handy in maintaining player spread across different teams and nations.


Introduction
In this section we will be following along with the examples from "Modern Fortan" by Milan Curcic (Manning). I have chosen to use Jupyter Lab with the GFortran Kernel to facilitate rapid production of HTML content. The output of the Fortran code will be displayed in graphical format using Python scripts and Matplotlib.
Description
The purpose of this section is to contain usefull programs for calculating items of interest to me in various projects. These may include linear algebra, differential equations or calculus.
Program to Predict the Linear Advection of an Object, with Periodic Boundary Conditions
Output of Program to Predict the Linear Advection of an Object, with Periodic Boundary Conditions
The program above produced data that was then plotted using a Python script and Matplotlib.


Please insert your api key in the field below. You can find it here: https://trello.com/app-key
Continue
Paste the url of one card from the column you need to prioritize and press The button
The button
See card


CSLRfidAppEngine
@interface CSLRfidAppEngine : NSObject
Singleton class that handles all activities on the reader. It provides a centralize point and allows data to be moved across different controllers
-
CSLBleReader instance of the connected reader
Declaration
Objective-C
@property (assign, readwrite, atomic) CSLBleReader *reader;
Swift
var reader: CSLBleReader! { get set }
-
Reader settings being stored in User Defaults
Declaration
Objective-C
@property (assign, readwrite, atomic) CSLReaderSettings *settings;
Swift
var settings: CSLReaderSettings! { get set }
-
Technical details of the connected reader
Declaration
Objective-C
@property (assign, readwrite, atomic) CSLReaderInfo *readerInfo;
Swift
var readerInfo: CSLReaderInfo! { get set }
-
Tag selected for tag read/write/search
Declaration
Objective-C
@property (assign, readwrite, atomic) NSString *tagSelected;
Swift
var tagSelected: String! { get set }
-
Defines the current reader mode (RFID/Barcode)
Declaration
Objective-C
@property (assign, readwrite, atomic) BOOL isBarcodeMode;
Swift
var isBarcodeMode: Bool { get set }
-
Reader settings on MQTT broker
Declaration
Objective-C
@property (assign, readwrite, atomic) CSLMQTTSettings *MQTTSettings;
Swift
var mqttSettings: CSLMQTTSettings! { get set }
-
Reader settings for temperature tags
Declaration
Objective-C
@property (assign, readwrite, atomic) CSLTemperatureTagSettings *temperatureSettings;
Swift
var temperatureSettings: CSLTemperatureTagSettings! { get set }
-
Initialize the app engine
Declaration
Objective-C
+ (CSLRfidAppEngine *)sharedAppEngine;
Swift
class func shared() -> CSLRfidAppEngine!
Return Value
Reference to the singleton class CSLRfidAppEngine
-
Memory allocation of the singleton class
Declaration
Objective-C
+ (id)alloc;
Swift
class func alloc() -> Self!
Return Value
Reference to the allocated instance
-
Release the singleton class
Declaration
Objective-C
+ (void)destroy;
Swift
class func destroy()
-
Initializing instances for: (1) CSLBleReader (2) CSLReaderSettings (3) CSLReaderInfo
Declaration
Objective-C
- (id)init;
Swift
init!()
Return Value
Reference to the allocated instance
-
dealloc (not in use)
Declaration
Objective-C
- (void)dealloc;
-
Load settings from User Defaults
Declaration
Objective-C
- (void)reloadSettingsFromUserDefaults;
Swift
func reloadSettingsFromUserDefaults()
-
Save current settings to User Defaults
Declaration
Objective-C
- (void)saveSettingsToUserDefaults;
Swift
func saveSettingsToUserDefaults()
-
Load MQTT settings from User Defaults
Declaration
Objective-C
- (void)reloadMQTTSettingsFromUserDefaults;
Swift
func reloadMQTTSettingsFromUserDefaults()
-
Save current MQTT settings to User Defaults
Declaration
Objective-C
- (void)saveMQTTSettingsToUserDefaults;
Swift
func saveMQTTSettingsToUserDefaults()
-
Load temperature tag settings from User Defaults
Declaration
Objective-C
- (void)reloadTemperatureTagSettingsFromUserDefaults;
Swift
func reloadTemperatureTagSettingsFromUserDefaults()
-
Save current temperature tag settings to User Defaults
Declaration
Objective-C
- (void)saveTemperatureTagSettingsToUserDefaults;
Swift
func saveTemperatureTagSettingsToUserDefaults()
-
Play iOS default sound alerts
Declaration
Objective-C
- (void)soundAlert:(SystemSoundID)soundId;
Swift
func soundAlert(_ soundId: SystemSoundID)


I am a UCSD senior pursuing a degree in cognitive science: human computer interaction. I am an aspiring UI designer and user researcher. My main interests include user experience, interaction design, and digital & multimedia marketing, and I aim to pursue a career that encompasses all of my interests.
Timeline: Eleven Weeks (March — June 2016)
Our goal was to use human centered design to improve voter experience for college students to increase voter turnout.
Role: Survey Design, Held Interviews, Competitive Analysis,
We began with secondary research on the topics of voter engagement. We learned that voter apathy is one of the main factors that are preventing eligible voters from registering and registered voters from voting. We then conducted an online survey asking UCSD students if they are registered to vote, if they had voted before, and reason for voting/not voting. The survey established our target audiences, the registered voters who voted, registered voters who are hesitant to vote, and students who are not registered to vote. We were also able to recruit interviewees for deeper personal insights on their thoughts regarding voting. Using the data we gatehred from survey and iterviews, we found three emerging themes:caring, convenience, and information.
With the themes in mind, we conducted contextual interviews and field observations. We got in touch with a campus organization, “SOVAC” (Student Organized Voter Action Committee),who has been planning multiple events that assist student population with the vointg/registering process. One of these evnets — “Voterpalooza” — we later participated in. From Voterpalooza We learned that people who did care about voting had some registration struggles, others were confused on voting method (mail, or booth) and voting location. We noticed that a large majority of people who stopped by Voterpalooza were informed via social media, e.g. Facebook.
Additional research indicated that social media engagement was one of the most effective way to gather youth vote which were in line with what we observed at Voterpalooza. We then considered multiple social media platforms and decided to use Snapchat custom filters as our solution, as they allowed for ease of integration in college student’s lives, while simultaneously allowing custom information to be displayed based on location. Due to the fact that UCSD colleges will have multiple voting polls based on where a student lived on campus, we wanted to create filters targeting each sub-community while still being able to access the information everywhere on campus.
We never implemented our final solution. Instead, we tested custom filters aimed at the May 23rd voter registration deadline, as we needed to collect data before the quarter ended. We tried to utilize research suggesting it was better to call people “voters” than people who’ve “voted.” Sadly, low usage over a short period of time lead to inconclusive results. Our results weren’t clear, but they were hopeful.
This project taught the importance of diverging and pivoting during the design process. We were able to test our designs and use the data gathered to iterate on the next pivot.
Timeline: Eleven Weeks (March — June 2017)
UX Designer, User Researcher
Skills: Needfinding, Storyboarding, Interviewing, A/B testing, Prototyping
Tools used: Illustrator, Unbounce, Google Analytics/Adwords, Balsamic
A platform for getting film lovers back into the theaters.
We get customers the best deals through flexible ticket pricing by working with local theaters. With Going, customers can go to the movies at a more affordable price with the power of crowdsourcing. Theaters set ticket goals and customers save money! The movie goers become recruiters by sharing the deal with friends and family and unlocking lower prices. Overrated prices shouldn’t stop you from the movie experience.
In the beginning our group focused on creating a dating/social app that focused on building relationship through a planned event. However after taking a closer look at the market through competitive analysis we realize that the dating market was too saturated and dating app users are often one time users who will ultimately abandon the service after successful match or just simply gave up. Our team then shifted to crowdsourced event planning. Inspired by on campus organization that held free movie premier for students at local theaters. We chose to focus on the Cinema experience because we know that movies attract a large crowd and that the movie industry is slowly declining with streaming services becoming more popular.
We created multiple storyboards reflecting on different strategies that might bring more traffic back to the theaters. We then tested these storyboards with online surveys.
From our surveys we learned that people are more motivated to go to the theaters when ticket deals are available and when friends plan together. With these idea in mind we came up with a businesss plan that utilized crowdfunding abilites to drive lower ticket prices. The more people commit to a movie showing the cheaper the ticket is for that showing.To test our business idea we contacted multiple local theater manager and held phone as well as in person interviews presenting our minimal viable product. We also performed service enactment with the stakeholders (movie goers, theaters) to see if they would use our product.
The results were positive. Local theater supported the idea. Users liked the idea and would recommened such service amongst friends. During this process we also mentioned the possibility of bringing older films back to the theaters.
The following are some quotes we received from service enactment.
Our prototype demonstrated the price unlock and commit feature.
Price Unlock Feature: For showings that are not projected to sell very well, theaters can offer discounts for each ticket goal set. When a ticket goal is reached, a new price drop will be unlocked. Customers can see what discounts to expect and buy tickets at the goals they want to join in on.
Commit Feature: They can also see how many more people need to commit to a goal in order to reach the next one.Potential customers who do not want to buy tickets right away can choose to commit to a specific ticket goal and once the goal is met, tickets will automatically be purchased for the customers.
We also explored with possible future function such as throwback Movies, where movie goers can relive opening weekend at an affordable price. We hope to implement a voting function for movie enthusiasts to vote on the movies they want to see in theaters again. GOING users can suggest films, anything from classic to independent or even foreign films. The movie that wins the vote will be made available in the partnered theaters.
Because we are the middle man providing more affordable tickets from theaters to movie goers we will charge a small service fee from the movie goers and a small % per ticket sale from the theater. Percentage of ticket sale may vary due to the relationship between theaters and movie studios. Another portion of our revenue will from advertisement on the application.
Timeline: three Weeks (Nov — Dec 2017)
UX Designer, User Researcher
Skills: Competitive Analysis, Needfinding, interviewing, Prototyping
Tools used: Figma, Invision
For this assignment we conductee a total of 9 interviews, asking each participants their prefered music application and their playlist management behaviors. From our interviews we complied a list of 10 user scenarios.
Create Playlist:We then performed competitive analysis on multiple music application that had the ability to create and manage playlists. Within each of these application (amazon prime music, SoundCloud, and Spotify) we looked for good and bad examples of good user flow. We also performed competitive analysis of information architecture creating site maps and genre maps for each competing applcation on the market
The first decision we had to make was the items on the top navigation tabs.From our interviews we found the following
We decided to stick with 3 broad navbar tabs: Browse, Search, and Library. These three tabs included most of users' actions and at the same time increase efficiently while decreasing chance for error.
This is what the user will see first when they open the application. From our interview we found that most user never use the home page in most applications instead they head directly to the following pages.
We desided to create a home screen that included all of users' most likely actions above the fold so taht the users can reach their desired music without scrolling.
From our interviews we learned that most peole have tried spotify's premade mood/activty playlists but few use it regularly. Most of our participants create their own playlist for a specific mood or activity making a more personal experience; however this method does not introduce new music into their library. Our task here is to find a balance where users can create mood/activity playlists with songs from their own library as well as add new songs that fit the mood/activty.
On the home screen, under “Mood Activity, the user will see several mood or activity based playlists, which could be user-created. If those do not fit them, they may go to a playlist generator, which allows them to pick as many or as few criteria (mood, activity, genre, etc), from which the app will automatically generate a playlist.
We decided to revamp the "Now Playing" screen with play pause controls because we wanted to increase visualization for the playlists and queue functions. Our design allows users to see up the 2 upcoming tracks as well as 1 previously played track all in one screen.
Use this area of the page to describe your project. The icon above is part of a free icon set by Flat Icons. On their website, you can download their free set with 16 icons, or you can purchase the entire set with 146 icons for only $12!
Use this area of the page to describe your project. The icon above is part of a free icon set by Flat Icons. On their website, you can download their free set with 16 icons, or you can purchase the entire set with 146 icons for only $12!
Use this area of the page to describe your project. The icon above is part of a free icon set by Flat Icons. On their website, you can download their free set with 16 icons, or you can purchase the entire set with 146 icons for only $12!


DIABOLIQUE A film review by Edwin Jahiel Copyright 1996 Edwin Jahiel
DIABOLIQUE (1996) * Directed by Jeremiah Chechik. Written by Don Roos from the (uncredited) French film "Les Diaboliques," itself based on the Pierre Boileau & Thomas Narcejac novel "Celle qui n'etait pas" ("The woman who wasn't"). Photography, Peter James. Editing, Carol Littleton. Production design, Leslie Dilley. Music, Randy Edelman. Cast: Sharon Stone, Isabelle Adjani, Chazz Palminteri, Kathy Bates, Spalding Gray, Alan Garfield, Adam Hann-Byrd, Shirley Knight. A Morgan Creek film released by Warner's.115 minutes.
Recently, in a benevolent mood I wrote that Hollywood remakes are generally worse than the originals, with some exceptions. "Diabolique" reminds me that I was too kind, that the enormous majority of remakes are bad. And they can stink when you know the orginal, like the classic thriller-suspenser by Henri-Georges Clouzot, "Les Diaboliques" of 1955.
The plot. A boarding school for boys somewhere in the mountains of Pennsylvania, within easy driving distance to Pittsburgh. The establishement was inherited by Mia (Adjani) who suffers from 1) a weak heart and 2) lousy husband Guy (Palminteri).
The two women are teachers and friends. The school is a manor that ought to be shabby and run down, but that's not made clear.  He doesn't even have the swimming pool cleaned. ("Dirty pool" applies both literally and figuratively to the plot). The women, fully aware of each one's relations and relationship with Guy, decide to kill him.
End of plot so far as this review is concerned. For two reasons. First, because what little you might get from the movie depends entirely on the twists and gimmicks. Second, to honor the memory of Mr. Clouzot, his wishes must be followed. When his film was shown there was a final "don't divulge the end" plea to the audience.
That's probably where Alfred Hitchcock got the idea of doing something like this for his "Psycho." Hitchcock loved "Les Diaboliques" and its source book. Unable to get permission to remake it, he used another novel ("From Among the Dead," which some critics wrongly translate as "Between Deaths"), by the same writers, and made "Vertigo," a gem with an improbable plot.
The new version follows its model in bizarre ways. Many parts are copied scene-for-scene, other not.   Like Hitchcock.
In the French film, the mistress was the excellent, already famous Simone Signoret; the wife was the unknown Vera Clouzot, then the director's wife. Signoret had presence and nuances. Clouzot was a born victim totally subjugated by both Signoret and Paul Meurisse, the husband.
Here, Sharon Stone mercilessly overdoes her hardness and cynical repartees, so much that she telegraphs plot developments. She's so hard that SS could easily play an SS guard.
Tarted up with heavy makeup, tight clothes (selected by herself) in terrible taste, with tops that never miss a chance to show her breasts, she's like a floozy. In the movie's 115 minutes she does not once crack smile. How mechanical.
Adjani, at the start, has a full nudity scene. Her body is beautiful body, not just for a 40-year old but for any woman. But it is used only as a cheap, gratuitous come-on. She has minimal expressions and in general is a ninny.
As in the French film, Nicole is the strong one of the pair, Mia by far the weaker. But she lacks the wispiness, the convincing frailty and ill health, the helplessness, the pathetic religiosity of Vera Clouzot.
The school's staff is very small. Spalding Gray and the fine Alan Garfield have microscopic, irrelevant parts, unlike those of their atmosphere-enhancing French counterparts. The latter help set the mood for the women's fatal decision. The remake makes a flat mess even of the model's superior dining room scene, where rotten fish was served.
Nobody is more than skin-deep in version 2. While we don't need full-fledged background records or psychological analyses, all characters are paper thin. Thrown in are two young men who are doing a promotional video for the school. It's plain padding. Thrown in too is an overt lesbian relationship instead of the original's hints.
Worse yet, Adjani has a scene where, after being disgustingly insulted by Palminteri, she revels in a kiss, with absolutely illogical and uncharacteristic passion. Cut to vigorous sex .. but wait, this is between Stone and Palmenteri!
The French police inspector was played by talented veteran Charles Vanel, who, I am told, was the model for Lieutenant Columbo. Vanel, like Signoret, had a weighty presence. Here, to feminize the movie, he's replaced by private investigator Cathy Bates. Her presence is depressing, her sleuthing improbable.
Bates is addressed as "detective," as in " What do you think, detective?" I've never heard this turn of speech before. Her character's name is Shirley. There's another Shirley in the cast, the likable actress Shirley Knight, in another depressing role. The odd thing is that she is not even mentioned in the blurbs given to the press. Sic transit...
Now to Mr. Palminteri and all that Chazz. Where the original's Meurisse was a diabolical, malevolent snake, Palminteri is just a coarse, crass, vulgar brute. It's like replacing a sports car with a dumpster.
The cardinal sin is the doctoring up the French film's climax, one of the cleverest, most unexpected and startling in the history of movie thrillers. Be prepared for more cheap and dumb turns, false twists, Grand Guignol and additional crassness.
The camera-work is OK though overdone and showy. Hitchcock would never have tolerated it. Strange too are the close-ups of Adjani that often elongate her face, like an El Greco painting or a CinemaScope film projected through a regular lens. Beats me.
The film is soporific. Instead of being an edge-of-the seat affair, it is a bottom-of-the-seat proposition. The torpor is intercut by the music's sudden bursts of energy, drumbeats and all, with imitations of Hitchcock scores by the great Bernard Herrmann.
Get the French film or most any Hitchcock movie.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


WITNESS LIST State Affairs Committee April 2, 2001-2:00P HB 412 For: Lacy, Kerry (City of Liberty) On: Fainter, Jr., John (Association of Electric Companies of Texas) Registering, but not testifying: For: Zion, Mark (Texas Public Power Association) On: Lloyd, Brian (Public Utility Commission of Texas) Mueller, Paula (Public Utility Commission of Texas) Totten, Jess (Public Utility Commission of Texas) HB 838 Registering, but not testifying: For: Baggett, Donnis (Texas Daily Newspaper Association and Texas Press Association) Levy, Rick (Texas AFL-CIO) Schneider, Michael (Texas Association of Broadcasters) Smith, Tom "Smitty" (Public Citizen) Woodford, Suzy (Self and Common Cause Texas) HB 2151 For: Chapman, Randall (Texas Legal Services Center) Lee, Donald (Texas Conference of Urban Counties) Smith, Tom "Smitty" (Public Citizen) Against: Schaeffer, Steve (Association of Electric Companies of Texas and Reliant Energy) Registering, but not testifying: Against: Fainter, Jr., John (Association of Electric Companies of Texas) On: Lloyd, Brian (Public Utility Commission of Texas) Mueller, Paula (Public Utility Commission of Texas) Totten, Jess (Public Utility Commission of Texas) HB 2505 Against: Schaeffer, Steve (Association of Electric Companies of Texas and Reliant Energy) Seidlits, Curtis (TXU and Association of Electric Companies of Texas) On: Briesemeister, Janee (Consumers Union) Registering, but not testifying: On: Lloyd, Brian (Public Utility Commission of Texas) Mueller, Paula (Public Utility Commission of Texas) Totten, Jess (Public Utility Commission of Texas) HB 2506 For: Chapman, Randall (Self and Texas Legal Services Center) Smith, Tom "Smitty" (Public Citizen) Against: Schaeffer, Steve (Association of Electric Companies of Texas and Reliant Energy) On: Bertin, Suzanne (The New Power Company) Registering, but not testifying: For: Berasley, George (AARP) Biedrzycki, Carol (Texas Ratepayers Organization to Save Energy) Briesemeister, Janee (Consumers Union) On: Lloyd, Brian (Public Utility Commission of Texas) Mueller, Paula (Public Utility Commission of Texas) Totten, Jess (Public Utility Commission of Texas) HB 2507 For: Briesemeister, Janee (Consumers Union) Chapman, Randall (Self and Texas Legal Services Center) Smith, Tom "Smitty" (Public Citizen) Against: Schaeffer, Steve (Association of Electric Companies of Texas and Reliant Energy) On: Perlman, Brett (Public Utility Commission of Texas) Registering, but not testifying: For: Berasley, George (AARP) Biedrzycki, Carol (Texas Ratepayers Organization to Save Energy) On: Lloyd, Brian (Public Utility Commission of Texas) Mueller, Paula (Public Utility Commission of Texas) Totten, Jess (Public Utility Commission of Texas) HB 2523 Registering, but not testifying: For: Smith, Tom "Smitty" (Public Citizen) HB 2552 For: Baker, Wendell (Matagorda County Hospital District) Pruett, Michael (Matagorda County) Against: Patton, Charles (American Electric Power) Schaeffer, Steve (Reliant Energy) On: Mueller, Paula (Public Utility Commission of Texas) Registering, but not testifying: On: Lloyd, Brian (Public Utility Commission of Texas) Totten, Jess (Public Utility Commission of Texas) HB 2709 For: Campbell, Jo (South Texas Electric) Joiner, Gary (Texas Farm Bureau) Miller, Henry (Self) Smothers, W.C. "Dub" (Self) Webking, Catherine (Self and Yanta Cattle Company and Lee Hammak) Wharton, Jeanette (Self) Against: Fainter, Jr., John (Association of Electric Companies of Texas) Schaeffer, Steve (Association of Electric Companies of Texas and Reliant Energy) Segrest, Philip (Brazos Electric Power Cooperative) On: Perlman, Brett (Public Utility Commission of Texas) Registering, but not testifying: Against: Davis, Mark (East Texas Cooperatives) Gibbens, David (City Public Service of San Antonio) Labus, Joyce (City Public Service of San Antonio) Marquez, Fidel (City Public Service of San Antonio) Phillips, Ross (Lower Colorado River Authority) Rodriguez, Ferdie (East Texas Cooperatives) Williams, Mike (Texas Electric Cooperatives) Zion, Mark (Texas Public Power Association) On: Lloyd, Brian (Public Utility Commission of Texas) Mueller, Paula (Public Utility Commission of Texas) Totten, Jess (Public Utility Commission of Texas) HB 2809 On: Collins, Steve (Texas Legislative Council) Registering, but not testifying: For: Kamm, Bob (Texas Municipal League Intergovernmental Risk Pool) HB 2810 For: Lee, Donald (Texas Conference of Urban Counties) Paniagua, Joe (Fort Worth City Council) Against: Kerr, John (Fort Worth Police Officer's Association) On: Brown, Mark (Texas Legislative Council) Jones, Chris (Combined Law Enforcement Associations of Texas) Registering, but not testifying: For: Allison, Jim (County Judges and Commissioners Association of Texas) Against: DeLord, Ron (Combined Law Enforcement Associations of Texas) HB 2811 On: Fulton, Deborah (Texas Legislative Council) Registering, but not testifying: For: Shawn, Jim (Capitol County Mutual) HB 2812 On: Skarke, David (Texas Legislative Council) HB 2813 On: Harrison, Shawn (Texas Legislative Council) HB 2853 On: Collins, Steve (Texas Legislative Council) HB 2969 For: Grubbs, David (Self and South Texas Electric Cooperative) Registering, but not testifying: For: Bresnen, Steve (South Texas Electric Cooperative) Campbell, Jo (South Texas Electric Cooperative) Davis, Mark (East Texas Cooperatives) Rodriguez, Ferdie (East Texas Cooperatives) Segrest, Philip (Brazos Electric Power Cooperative) Williams, Mike (Texas Electric Cooperatives) On: Fainter, Jr., John (Association of Electric Companies of Texas) Lloyd, Brian (Public Utility Commission of Texas) Mueller, Paula (Public Utility Commission of Texas) Totten, Jess (Public Utility Commission of Texas) HB 2983 For: Marquez, Fidel (City Public Service of San Antonio) Mitchell, Seth (Bexar County Commissioners Court) Smothers, W.C. "Dub" (Self) Against: Fainter, Jr., John (Association of Electric Companies of Texas) On: Perlman, Brett (Public Utility Commission of Texas) Registering, but not testifying: For: Gibbens, David (City Public Service of San Antonio) Labus, Joyce (City Public Service of San Antonio) Smith, Tom "Smitty" (Public Citizen) Against: Phillips, Ross (Lower Colorado River Authority) On: Lloyd, Brian (Public Utility Commission of Texas) Mueller, Paula (Public Utility Commission of Texas) Totten, Jess (Public Utility Commission of Texas) HB 3245 For: Smothers, W.C. "Dub" (Self) Urban, Charles (Self and Citizens Against Site Five) Against: Zion, Mark (Texas Public Power Association) Registering, but not testifying: Against: Gibbens, David (City Public Service of San Antonio) Labus, Joyce (City Public Service of San Antonio) Marquez, Fidel (City Public Service of San Antonio) On: Fainter, Jr., John (Association of Electric Companies of Texas) Lloyd, Brian (Public Utility Commission of Texas) Mueller, Paula (Public Utility Commission of Texas) Totten, Jess (Public Utility Commission of Texas) HB 3542 For: Rodriguez, Stella (Texas Association of Community Action Agencies) Against: Fainter, Jr., John (Association of Electric Companies of Texas) Registering, but not testifying: For: Berasley, George (AARP) Briesemeister, Janee (Consumers Union) Chapman, Randall (Self and Texas Legal Services Center) Lavine, Dick (Center for Public Policy Priorities) Smith, Tom "Smitty" (Public Citizen) On: Calvin, Peggy (Texas Department of Housing and Community Affairs) Lanford, Lane (Public Utility Commission of Texas) Lloyd, Brian (Public Utility Commission of Texas) Mueller, Paula (Public Utility Commission of Texas) Totten, Jess (Public Utility Commission of Texas) HB 3542 Committee Substitute (Turner, S.) For: Biedrzycki, Carol (Texas Ratepayers Organization to Save Energy) Kampschafer, A. R. (Texas Association of Community Action Agencies and Community Services of Corsicana) HJR 86 Registering, but not testifying: For: Smith, Tom "Smitty" (Public Citizen) SB 380 Registering, but not testifying: For: Schneider, Michael (Texas Association of Broadcasters) Woodford, Suzy (Self and Common Cause of Texas) On: Totten, Jess (Public Utility Commission of Texas)


tool to record sessions and display results in a nice graph.
on the bottom right pane you will find an editor where you can enter sessions.
the tool parses the file as soon as youhit
refresh and displays rsults in
a graph.
each session musthave the following format:
MyHomeGame | EUR | 12.03.2012-20:35 | +120.50
..that is 4 parameters, separated by vertical bars
- the session type
- the currency. supported is USD, EUR, BTC (bitcoin)
- date and time of the session (day.month.year-hour:minute). Note that this thingy expects 4 digits for the year
- ballance of the session. +amount or -amount
an example of multiple sessions and multiple session types:
MyHomeGame Tourney $4 | USD | 12.03.2012-20:35 | +120.50
MyHomeGame Tourney $4 | USD | 11.03.2012-20:35 | -4
MyHomeGame Tourney $4 | USD | 10.03.2012-20:35 | -4.00
MyHomeGame Tourney $4 | USD | 09.03.2012-20:35 | +12
MyHomeGame CashGame $2/4 | USD | 10.03.2012-20:35 | -65.00
MyHomeGame CashGame $2/4 | USD | 09.03.2012-20:35 | +96.50
you may comment out single sessions by putting a hash char atthe beginning of a line (#)
or you may comment out multiple lines at one by placing a double hash at the beginning
(##). in this case all lines up to the next double hash will be commented out.
- to retrieve exchange rates the Gui queries the following sites on every startup:
- https://mtgox.com/api/1/BTCEUR/ticker (for bitcoin exchange rate. NOTE: mount gox
has a limit of one query per 15 seconds. so don't push too hard, otherwise you may get banned)
- https://rate-exchange.appspot.com/currency?from=USD&to=EUR (US dollar echange rate)


public class JScan extends JStruct
JMemory.Type
| ���������� | �ֶκ�˵�� |
|---|---|
static int |
END_OF_HEADERS_ID
Special header ID that when used with a scanner's next_id
variable,
indicates that this is the last header and scanner should exit its loop.
|
private static java.lang.String |
STRUCT_NAME
The Constant STRUCT_NAME.
|
JNETPCAP_LIBRARY_NAME,
MAX_DIRECT_MEMORY_DEFAULT,
POINTER
| ��������˵�� |
|---|
JScan()
Alocates and creates scan_t structure in native memory.
|
JScan(JMemory.Type type)
Creates an uninitialized scan structure.
|
| ���������� | ������˵�� |
|---|---|
int |
record_header()
Record_header.
|
void |
record_header(int value)
Record_header.
|
void |
scan_buf_len(int size)
Size of packet data.
|
void |
scan_buf(JBuffer buffer)
Gets the current packet data buffer.
|
int |
scan_gap()
Scan_gap.
|
void |
scan_gap(int value)
Scan_gap.
|
int |
scan_id()
Scan_id.
|
void |
scan_id(int id)
Scan_id.
|
int |
scan_length()
Scan_length.
|
void |
scan_length(int length)
Scan_length.
|
int |
scan_next_id()
Scan_next_id.
|
void |
scan_next_id(int next_id)
Scan_next_id.
|
int |
scan_offset()
Gets teh curren offset by the dscanner into the packet buffer.
|
void |
scan_offset(int offset)
Sets the current offset by the scanner into the packet buffer.
|
JPacket |
scan_packet()
Java packet that is being processed.
|
int |
scan_payload()
Scan_payload.
|
void |
scan_payload(int value)
Scan_payload.
|
int |
scan_postix()
Scan_postix.
|
void |
scan_postix(int value)
Scan_postix.
|
int |
scan_prefix()
Scan_prefix.
|
void |
scan_prefix(int value)
Scan_prefix.
|
void |
scan_set_lengths(int prefix,
int header,
int gap,
int payload,
int postfix)
Sets all the various lengths in the header structure all at
once.
|
static int |
sizeof()
Size in bytes of the native scan_t structure on this particular
platform.
|
getStructName,
toString
availableDirectMemory,
check, cleanup, createReference,
isInitialized,
isJMemoryBasedOwner,
isOwner, maxDirectMemory,
peer,
peer,
peer,
reservedDirectMemory,
setSize, size, softDirectMemory,
toDebugString,
toHexdump, toHexdump,
totalActiveAllocated,
totalAllocateCalls,
totalAllocated,
totalAllocatedSegments0To255Bytes,
totalAllocatedSegments256OrAbove,
totalDeAllocateCalls,
totalDeAllocated,
transferFrom,
transferFrom,
transferFrom,
transferFrom,
transferFromDirect,
transferOwnership,
transferTo,
transferTo,
transferTo,
transferTo,
transferTo,
transferTo,
transferTo,
transferTo0
private static final java.lang.String STRUCT_NAME
public static final int END_OF_HEADERS_ID
public JScan()
public JScan(JMemory.Type type)
type
- memory typepublic int scan_id()
public int scan_next_id()
public int scan_length()
public void scan_id(int id)
id
- the idpublic void scan_next_id(int next_id)
next_id
- the next_idpublic void scan_length(int length)
length
- the lengthpublic int scan_prefix()
public int scan_gap()
public int scan_payload()
public int scan_postix()
public int record_header()
public void scan_prefix(int value)
value
- the valuepublic void scan_gap(int value)
value
- the valuepublic void scan_payload(int value)
value
- the valuepublic void scan_postix(int value)
value
- the valuepublic void record_header(int value)
value
- the valuepublic void scan_set_lengths(int prefix, int header, int gap, int payload, int postfix)
prefix
- prefix length in bytes before the headerheader
- length of the header (same as scan_length(int)
)
gap
- length of the gap between header and payloadpayload
- length of payloadpostfix
- length of postfix after the payloadpublic static int sizeof()
public void scan_buf(JBuffer buffer)
buffer
- packet data bufferpublic void scan_buf_len(int size)
size
- length in bytespublic void scan_offset(int offset)
offset
- offset in bytespublic JPacket scan_packet()
public int scan_offset()


Interface Action
-
- All Superinterfaces:
HasDefinition<ActionDefinition>
- All Known Implementing Classes:
SimpleAction
public interface Action extends HasDefinition<ActionDefinition>
- Author:
- verhas
-
-
Method Summary
All Methods Instance Methods Abstract Methods Default Methods Modifier and Type Method Description java.util.Map<java.lang.String,java.lang.String>
getParameters()
Get the parameter map that belongs to the action.Result
getResult(java.lang.String name)
Get a result based on its name that belongs to the action.Result[]
getResults()
Step
getStep()
Get the step that this action is executed from.void
join(java.lang.String[] steps)
Join the steps listed in the argument list into this action.void
join(Step[] steps)
Join the steps listed in the argument list into this action.default Step[]
perform()
Execute the pre-function, validator and post-function for the specific action and moves the workflow to the target step or target steps in case the action with the result returned by the post function is a split action.Step[]
performPost(java.lang.Object transientObject, java.util.Map<java.lang.String,java.lang.String> userInput)
Execute the post-function of the action.java.lang.Object
performPre()
Execute the pre-function of the action.-
Methods inherited from interface javax0.wtf.HasDefinition
getDefinition
-
-
-
-
Method Detail
-
getStep
Step getStep()
Get the step that this action is executed from. Every action starts from a step in the workflow and transfers the workflow into other (or the same) step or steps. This method returns the step from which the action can be executed from.- Returns:
- the step
-
getParameters
java.util.Map<java.lang.String,java.lang.String> getParameters()
Get the parameter map that belongs to the action.Actions are defined in a workflow and an action can be performed starting from many steps. The definition of the work flow may define parameters separately at each such use.
The implementation
SimpleWorkflow
allows actions to have parameters that are generic for all steps, no matter where the action is used. In that case the returned map will return the merged set.- Returns:
- the parameter Map
-
getResult
Result getResult(java.lang.String name)
Get a result based on its name that belongs to the action.- Parameters:
name
- of the action- Returns:
- the result object
- Throws:
InvalidResultException
- if there is no result for the action with the given name.
-
getResults
Result[] getResults()
- Returns:
- all the possible results for this action that are defined in the workflow definition.
-
perform
default Step[] perform() throws ValidatorFailedException, java.lang.ClassNotFoundException, java.lang.InstantiationException, java.lang.IllegalAccessException
Execute the pre-function, validator and post-function for the specific action and moves the workflow to the target step or target steps in case the action with the result returned by the post function is a split action.This method is called when an action can be performed automatically without user input.
The method should also alter the steps of the work flow object, so the next call to
getSteps()
should return the steps.- Returns:
- the step or steps that the work flow is after performing the action. This replaces the step 'step' in the argument in the array of steps which is returned by getSteps().
- Throws:
ValidatorFailedException
java.lang.ClassNotFoundException
java.lang.InstantiationException
java.lang.IllegalAccessException
-
performPre
java.lang.Object performPre() throws java.lang.ClassNotFoundException, java.lang.InstantiationException, java.lang.IllegalAccessException
Execute the pre-function of the action.This method is called when the action should be performed in two phases. The first phase is the pre-function and gathering user input. The second phase is to execute the validator and the post-function.
When the action is performed in two phase the pre-function returns a
transientState
object that the post function and the validator may use to perform their methods.- Returns:
- the transient state object the pre-function creates
- Throws:
java.lang.ClassNotFoundException
java.lang.InstantiationException
java.lang.IllegalAccessException
-
performPost
Step[] performPost(java.lang.Object transientObject, java.util.Map<java.lang.String,java.lang.String> userInput) throws ValidatorFailedException, java.lang.ClassNotFoundException, java.lang.InstantiationException, java.lang.IllegalAccessException
Execute the post-function of the action.This method is called when the action should be performed in two phases as described in the documentation of the method {
- Parameters:
transientObject
- the transient state object returned by the pre-functionuserInput
- the user-input that was gathered after calling pre-function- Returns:
- the steps to which the action transfers from the old step. (Not
all the steps the work flow is in after the action, only the ones that
replace the step we transit from.) It returns
null
if the action postFunction returned null. In that case the steps the work flow is in remain the same. - Throws:
ValidatorFailedException
-#performPre(StepDefinition step, ActionDefinition action)
.The method should also alter the steps of the work flow object, so the next call to
getSteps()
should return the steps that the work flow is after the execution of the action.java.lang.ClassNotFoundException
java.lang.InstantiationException
java.lang.IllegalAccessException
-
join
void join(Step[] steps)
Join the steps listed in the argument list into this action.This method can be used to implement a join programmatically. The post function may call this method to list all the steps that have to be joined to the actual flow. Joining means that the workflow will not be in the steps listed in the argument, but only in the steps in which the actual action performing leads to.
More precisely the the method
join(Step[] steps)
will remove the listed steps from the set of steps that the workflow is in currently. Other steps that are not removed will still belong to the set. The new set of steps will be the ones that the currently executing action leads to and the steps that were not joined.The actual implementation should be sloppy in the sense that the caller may specify steps that the workflow is not currently in.
This is a complimentary method that can be implemented using only the interface methods, and the implementation in the package
com.verhas.workflow.simple
is one that does not depend on the actual implementation details.- Parameters:
steps
- the steps to join.
-
join
void join(java.lang.String[] steps)
Join the steps listed in the argument list into this action. The steps are listed by their names and not the actual steps. For more explanation {- Parameters:
steps
- the names of the steps that are to be joined.join(Step[] steps)
.
-
-


?Det.-rev.
M,
Thiv
(B)
2001
Lisianthius
longifolius
L.
R.
E.
WEAVER,
JR.
19^0
Duke
University
Herbarium
.
FLORA
OF
JAMAICA
Coll.
Geo.
E.
Nichols.
ebl*
^
└Hi.
/
/f*3
Ci
V,
1624687
Legend -
Level of confidence that token is an accurately-transcribed word
extremely low
very low
low
undetermined
medium
high
very high