|
GT RoboCup SSL
Soccer software, robot firmware
|
This guide targets new members looking for a guide on contributing to the project. This guide will focus on the overall picture of effective coding and contributions. It is not intended to be a technical guide.
Contributing to open source presents a unique set of challenges, especially when dealing with large projects. Our project is approximately 50-80k lines of code, and is still very small by some open source standards.
This should not be discouraging, but rather informative. Most initial contributions will be small; it takes time to learn the project structure and any languages and skills each particular project requires. Contributions of any size will be greatly appreciated, and you should have realistic expectations of what a first contribution might be (if you dont believe me, you can look at my first contribution here. It's two lines of 'code'). This guide will help you learn to navigate our code base, and work toward an initial contribution.
With large projects, organization and structure can break down fairly quickly resulting in some bad spaghetti code. We want to avoid this as much as possible. For this reason, every pull request will be reviewed by a more senior member of the team, currently Justin Buchanan. If your request isn't accepted right away, don't take it personally. Often your code may work fine, but there are things you can add or refine. This helps keep our repository clean and will give you valuable experience participating in a code review process.
Continuous Integration (CI) is a tool to help auto-detect problems before they are merged into the main respository and have a chance to cause problems. Every time you submit a pull request, the CI tool is run and it will assign a passing or failing mark to the request. If the CI fails, you will need to fix the error in your code before the code review. If the reason for the failure isn't obvious or it's a problem in the CI check itself, seek some help.
It's important that the content of a pull request be kept clean and small. Pull requests should be less than 1-2k lines of code. The code changes should reflect one and only one topic (e.g do not include two bug fixes in one pull request). Content should generally be kept to code and documentation, binary content, such as images, may be uploaded elsewhere.
Code should be documented thoroughly. Generally speaking, you won't be here for more than 4(ish) years. Many students will come behind you and will need to use the code you've written.
Each class or file you create should be documented as to what it contains and what purpose it serves.
Each function should have documentation containing it's purpose, what parameters is takes, and what values it returns. Error handling should be described as well: what errors will it produce, and what assumptions it makes regarding the validation the caller performs ahead of time. If relevant, state if the function may block for extended periods of time. If applicable, state if the function is reentrant or accquires and releases locks.
If the overall set of code is complex and new, consider editing or adding to the wiki.
C/C++/Python is documented using doxygen. You can view the guide for writing doxygen comments and documentation here.
Text file types that are not supported by doxygen should still be documented using what ever commenting style that format supports.
In order to keep the code more readable, code should be formatted and styled uniformly. This would be difficult to coordinate across multiple users, so we have a program that automatically restyles the code for you. If you submit a pull request before restyling the code, it will likely fail the CI check. You can auto-format the code by running make pretty
. If you have a lot of code, you may have to run this a few times. You can check if the style is passing by running make checkstyle
. If there are no errors, then you are good to go.


This is a short description. Many thanks for visiting my page! This page is written for the Udacity - Google Introductory Course to HTML and CSS At the Zukunftswerkstatt in Munich 2018


Metadata
- Adds a new intelligence level, "no-swap", which never swaps any cards at all. This should only be used in extreme circumstances, such as the character losing their glasses, falling unconscious, temporarily leaving the game entirely, etc.
Advanced
- Removes the "pt" and "px" options for custom text size, as they vary wildly on different systems. All existing text sizes will be converted to percents.
Validator
- Restores a large number of validation rules that weren't working.
- Now checks for issues within AND/OR tabs as well.
- Flags conditions with a count of "0+", which is meaningless and was usually meant to be a count of zero.
- Flags Self Saying Marker, Self Saying Text, and Self Pose conditions, which never work.
- Flags redundant use of ifMale in an already gendered case.
- The "incorrect clothing weight" rule now functions correctly in the case of an item being converted to Important due to being the last item covering nudity.
- Clarifies if a clothing classification is only invalid due to being incorrectly capitalized.
Miscellaneous
- Fixes an oversight in the case conversion process. Now all cases will be converted to the new format. (If you don't know what this means, don't worry about it.)
Bug Fixes
- Fixes the Respond system sometimes assigning a response a custom priority.
- Fixes certain images disappearing in the Pose Maker.
- Fixes an issue preventing the cross-costume custom poses from working.
- Fixes a minor bug in determining which layers would be converted to Important.


WITNESS LIST Financial Institutions Committee March 24, 2003-12:00A HB 1841 For: Neeley, Karen (Independent Bankers Association of Texas) Temple, Larry (Texas Mortgage Bankers Association) Tippets, John M. (Texas Conference for Homeowners Rights) Against: Cardenas, Gus (AARP) Marina, Charles (Self) Porter, Thomas David (Self and Small Business United of Texas) Stinson, Bill (Texas Association of Realtors) On: Jobe, Everette (Texas Department of Banking) Pettijohn, Leslie (Consumer Credit Commissioner) Piggott, Guido (Self and Central Bank of Houston, et al.) Registering, but not testifying: For: Sandberg, Eric (Texas Savings and Community Bankers Association) Against: Alexander, Robert A. (AARP) Alix, Noble J. (AARP) Ash-Taylor, Delores (AARP) Carr, Waggoner (AARP) Castellano-Hoyt, Don (AARP) Castellano-Hoyt, Julia (AARP) Connally, Marie (AARP) Davila, Alex (Self and AARP) Forcier, Donald J. (AARP) Forey, James C. (AARP) Garza, Frances E. (AARP) Glueck, Shirley (AARP) Heck, R.Z. (AARP) Henneberger, John (Texas Low Income Housing Information Service) Hooser, A.H. (AARP) Howard, Mellie (AARP) Hughlett, Ann (AARP) Martinez, Lydia V. (AARP) Marvin, Edward L. (AARP) Mays, Famie Louise (AARP) McKinley, Dot (AARP) Metzger, Luke (Texas Public Interest Research Group) Narisi, Jacob (Self) Niedzwiecki, Connie (Self) Pinkus, David (Small Business United of Texas) Radle, Eva-Jean (Self) Rhinehart, Jane W. (AARP) Russell, Barbara (Self) Teal, Dennis (AARP) Teal, Sharon (AARP) Wallace, Aliceanne (AARP) Walters, Jo Ann (AARP) White, Margaret A. (Self and AARP) Wildman, Peggy (AARP) Young, Edwin J. (AARP) Young, Mamie L. (AARP) On: Donohoe, Dan (Bank One Corp.) Morris, Mark (JPMorgan Chase Bank) HJR 23 For: Norman, Scott (Texas Reverse Mortgage Lenders) Stinson, Bill (Texas Association of Realtors) On: Pettijohn, Leslie (Consumer Credit Commissioner) Registering, but not testifying: For: Carr, Mindy (Texas Land Title Association) Donohoe, Dan (Bank One Corp.) Neeley, Karen (Independent Bankers Association of Texas) Rodgers, Kelly (Texas Conference for Homeowners Rights) HJR 70 For: Neeley, Karen (Independent Bankers Association of Texas) Porter, Thomas David (Self and Small Business United of Texas) Temple, Larry (Texas Mortgage Bankers Association) Tippets, John M. (Texas Conference for Homeowners Rights) Against: Cardenas, Gus (AARP) Doggett, Robert (Self) Marina, Charles (Self) Mattei, Blanca (Self) Schneider, Rob (Consumers Union) On: Jobe, Everette (Texas Department of Banking) Pettijohn, Leslie (Consumer Credit Commissioner) Piggott, Guido (Self and Central Bank of Houston, et al.) Stinson, Bill (Texas Association of Realtors) Registering, but not testifying: For: Clark, Jeff (National Federation of Independent Business) Pinkus, David (Small Business United of Texas) Sandberg, Eric (Texas Savings and Community Bankers Association) Against: Alexander, Robert R. (AARP) Alix, Noble J. (AARP) Ash-Taylor, Delores (AARP) Carr, Waggoner (AARP) Castellano-Hoyt, Don (AARP) Castellano-Hoyt, Julia (AARP) Connally, Marie (AARP) Davila, Alex (Self and AARP) Forey, James C. (AARP) Garza, Frances E. (AARP) Glueck, Fred (AARP) Glueck, Shirley (AARP) Heck, R.Z. (AARP) Henneberger, John (Texas Low Income Housing Information Service) Hooser, A.H. (AARP) Howard, Mellie (AARP) Hughlett, Ann (AARP) Irwin, G. Peter (AARP) Kern, Jack (Self) Kern, Martha (AARP) Martinez, Lydia (AARP) Marvin, Edward L. (AARP) Mays, Famie Louise (AARP) McKinley, Dot (AARP) Metzger, Luke (Texas Public Interest Research Group) Narisi, Jacob (Self) Niedzwiecki, Connie (Self) Radle, Eva-Jean (Self) Rhinehart, Jane W. (AARP) Russell, Barbara (Self) Walters, Jo Ann (AARP) White, Margaret A. (Self and AARP) Wildman, Peggy (AARP) Young, Edwin J. (AARP) Young, Mamie L. (AARP) On: Donohoe, Dan (Bank One Corp) Morris, Mark (JPMorgan Chase Bank)


|
Groovy JDK |
| Method Summary | |
|---|---|
void
|
append(Object text)
Append the text at the end of the File. |
void
|
append(byte[] bytes)
Append bytes to the end of a File. |
void
|
append(InputStream stream)
Append binary data to the file. |
void
|
append(Object text, String charset)
Append the text at the end of the File, using a specified encoding. |
Object
|
asType(Class c)
Converts this File to a Writable or delegates to default DefaultGroovyMethods#asType. |
File
|
asWritable()
Converts this File to a Writable. |
File
|
asWritable(String encoding)
Allows a file to return a Writable implementation that can output itself to a Writer stream. |
static File
|
createTempDir()
|
static File
|
createTempDir(String prefix, String suffix)
|
boolean
|
deleteDir()
Deletes a directory with all contained files and subdirectories. |
long
|
directorySize()
Calculates directory size as total size of all its files, recursively. |
void
|
eachByte(Closure closure)
Traverse through each byte of this File |
void
|
eachByte(int bufferLen, Closure closure)
Traverse through the bytes of this File, bufferLen bytes at a time. |
void
|
eachDir(Closure closure)
Invokes the closure for each subdirectory in this directory, ignoring regular files. |
void
|
eachDirMatch(Object nameFilter, Closure closure)
Invokes the closure for each subdirectory whose name (dir.name) matches the given nameFilter in the given directory - calling the DefaultGroovyMethods#isCase method to determine if a match occurs. |
void
|
eachDirRecurse(Closure closure)
Invokes the closure for each descendant directory of this directory. |
void
|
eachFile(FileType fileType, Closure closure)
Invokes the closure for each 'child' file in this 'parent' folder/directory. |
void
|
eachFile(Closure closure)
Invokes the closure for each 'child' file in this 'parent' folder/directory. |
void
|
eachFileMatch(FileType fileType, Object nameFilter, Closure closure)
Invokes the closure for each file whose name (file.name) matches the given nameFilter in the given directory - calling the DefaultGroovyMethods#isCase method to determine if a match occurs. |
void
|
eachFileMatch(Object nameFilter, Closure closure)
Invokes the closure for each file whose name (file.name) matches the given nameFilter in the given directory - calling the DefaultGroovyMethods#isCase method to determine if a match occurs. |
void
|
eachFileRecurse(FileType fileType, Closure closure)
Invokes the closure for each descendant file in this directory. |
void
|
eachFileRecurse(Closure closure)
Invokes the closure for each descendant file in this directory. |
Object
|
eachLine(Closure closure)
Iterates through this file line by line. |
Object
|
eachLine(String charset, Closure closure)
Iterates through this file line by line. |
Object
|
eachLine(int firstLine, Closure closure)
Iterates through this file line by line. |
Object
|
eachLine(String charset, int firstLine, Closure closure)
Iterates through this file line by line. |
void
|
eachObject(Closure closure)
Iterates through the given file object by object. |
Writable
|
filterLine(Closure closure)
Filters the lines of a File and creates a Writable in return to stream the filtered lines. |
Writable
|
filterLine(String charset, Closure closure)
Filters the lines of a File and creates a Writable in return to stream the filtered lines. |
void
|
filterLine(Writer writer, Closure closure)
Filter the lines from this File, and write them to the given writer based on the given closure predicate. |
void
|
filterLine(Writer writer, String charset, Closure closure)
Filter the lines from this File, and write them to the given writer based on the given closure predicate. |
byte[]
|
getBytes()
Read the content of the File and returns it as a byte[]. |
String
|
getText(String charset)
Read the content of the File using the specified encoding and return it as a String. |
String
|
getText()
Read the content of the File and returns it as a String. |
File
|
leftShift(Object text)
Write the text to the File. |
File
|
leftShift(byte[] bytes)
Write bytes to a File. |
File
|
leftShift(InputStream data)
Append binary data to the file. |
DataInputStream
|
newDataInputStream()
Create a data input stream for this file |
DataOutputStream
|
newDataOutputStream()
Creates a new data output stream for this file. |
BufferedInputStream
|
newInputStream()
Creates a buffered input stream for this file. |
ObjectInputStream
|
newObjectInputStream()
Create an object input stream for this file. |
ObjectInputStream
|
newObjectInputStream(ClassLoader classLoader)
Create an object input stream for this file using the given class loader. |
ObjectOutputStream
|
newObjectOutputStream()
Create an object output stream for this file. |
BufferedOutputStream
|
newOutputStream()
Create a buffered output stream for this file. |
PrintWriter
|
newPrintWriter()
Create a new PrintWriter for this file. |
PrintWriter
|
newPrintWriter(String charset)
Create a new PrintWriter for this file, using specified charset. |
BufferedReader
|
newReader()
Create a buffered reader for this file. |
BufferedReader
|
newReader(String charset)
Create a buffered reader for this file, using the specified charset as the encoding. |
BufferedWriter
|
newWriter()
Create a buffered writer for this file. |
BufferedWriter
|
newWriter(boolean append)
Creates a buffered writer for this file, optionally appending to the existing file content. |
BufferedWriter
|
newWriter(String charset, boolean append)
Helper method to create a buffered writer for a file. |
BufferedWriter
|
newWriter(String charset)
Creates a buffered writer for this file, writing data using the given encoding. |
byte[]
|
readBytes()
Reads the content of the file into a byte array. |
List
|
readLines()
Reads the file into a list of Strings, with one item for each line. |
List
|
readLines(String charset)
Reads the file into a list of Strings, with one item for each line. |
boolean
|
renameTo(String newPathName)
Renames the file. |
void
|
setBytes(byte[] bytes)
Write the bytes from the byte array to the File. |
void
|
setText(String text)
Synonym for write(text) allowing file.text = 'foo'. |
void
|
setText(String text, String charset)
Synonym for write(text, charset) allowing: myFile.setText('some text', charset)or with some help from ExpandoMetaClass , you could do something like:
myFile.metaClass.setText = { String s -> delegate.setText(s, 'UTF-8') } myfile.text = 'some text' |
long
|
size()
Provide the standard Groovy size() method for File .
|
Object
|
splitEachLine(String regex, Closure closure)
Iterates through this file line by line, splitting each line using the given regex separator. |
Object
|
splitEachLine(Pattern pattern, Closure closure)
Iterates through this file line by line, splitting each line using the given separator Pattern. |
Object
|
splitEachLine(String regex, String charset, Closure closure)
Iterates through this file line by line, splitting each line using the given regex separator. |
Object
|
splitEachLine(Pattern pattern, String charset, Closure closure)
Iterates through this file line by line, splitting each line using the given regex separator Pattern. |
void
|
traverse(Map options, Closure closure)
Invokes closure for each descendant file in this directory tree.
|
void
|
traverse(Closure closure)
Invokes the closure for each descendant file in this directory tree. |
void
|
traverse(Map options)
Invokes the closure specified with key 'visit' in the options Map for each descendant file in this directory tree. |
Object
|
withDataInputStream(Closure closure)
Create a new DataInputStream for this file and passes it into the closure. |
Object
|
withDataOutputStream(Closure closure)
Create a new DataOutputStream for this file and passes it into the closure. |
Object
|
withInputStream(Closure closure)
Create a new InputStream for this file and passes it into the closure. |
Object
|
withObjectInputStream(Closure closure)
Create a new ObjectInputStream for this file and pass it to the closure. |
Object
|
withObjectInputStream(ClassLoader classLoader, Closure closure)
Create a new ObjectInputStream for this file associated with the given class loader and pass it to the closure. |
Object
|
withObjectOutputStream(Closure closure)
Create a new ObjectOutputStream for this file and then pass it to the closure. |
Object
|
withOutputStream(Closure closure)
Creates a new OutputStream for this file and passes it into the closure. |
Object
|
withPrintWriter(Closure closure)
Create a new PrintWriter for this file which is then passed it into the given closure. |
Object
|
withPrintWriter(String charset, Closure closure)
Create a new PrintWriter with a specified charset for this file. |
Object
|
withReader(Closure closure)
Create a new BufferedReader for this file and then passes it into the closure, ensuring the reader is closed after the closure returns. |
Object
|
withReader(String charset, Closure closure)
Create a new BufferedReader for this file using the specified charset and then passes it into the closure, ensuring the reader is closed after the closure returns. |
Object
|
withWriter(Closure closure)
Creates a new BufferedWriter for this file, passes it to the closure, and ensures the stream is flushed and closed after the closure returns. |
Object
|
withWriter(String charset, Closure closure)
Creates a new BufferedWriter for this file, passes it to the closure, and ensures the stream is flushed and closed after the closure returns. |
Object
|
withWriterAppend(String charset, Closure closure)
Create a new BufferedWriter which will append to this file. |
Object
|
withWriterAppend(Closure closure)
Create a new BufferedWriter for this file in append mode. |
void
|
write(String text)
Write the text to the File. |
void
|
write(String text, String charset)
Write the text to the File, using the specified encoding. |
| Method Detail |
|---|
public void append(Object text)
text
- the text to append at the end of the File.public void append(byte[] bytes)
bytes
- the byte array to append to the end of the File.public void append(InputStream stream)
stream
- stream to read data from..public void append(Object text, String charset)
text
- the text to append at the end of the File.charset
- the charset used.public Object asType(Class c)
c
- the desired class.public File asWritable()
public File asWritable(String encoding)
encoding
- the encoding to be used when reading the file's contents.public static File createTempDir()
public static File createTempDir(String prefix, String suffix)
public boolean deleteDir()
The method returns
public long directorySize()
public void eachByte(Closure closure)
closure
- a closure.public void eachByte(int bufferLen, Closure closure)
bufferLen
- the length of the buffer to use..closure
- a 2 parameter closure which is passed the byte[] and a number of bytes successfully read..public void eachDir(Closure closure)
closure
- a closure (first parameter is the subdirectory file).public void eachDirMatch(Object nameFilter, Closure closure)
nameFilter
- the nameFilter to perform on the name of the directory (using the DefaultGroovyMethods#isCase method).closure
- the closure to invoke.public void eachDirRecurse(Closure closure)
closure
- a closure.public void eachFile(FileType fileType, Closure closure)
fileType
- if normal files or directories or both should be processed.closure
- the closure to invoke.public void eachFile(Closure closure)
closure
- a closure (first parameter is the 'child' file).public void eachFileMatch(FileType fileType, Object nameFilter, Closure closure)
// collect names of files in baseDir matching supplied regex pattern import static groovy.io.FileType.* def names = [] baseDir.eachFileMatch FILES, ~/foo\d\.txt/, { names << it.name } assert names == ['foo1.txt', 'foo2.txt'] // remove all *.bak files in baseDir baseDir.eachFileMatch FILES, ~/.*\.bak/, { File bak -> bak.delete() } // print out files > 4K in size from baseDir baseDir.eachFileMatch FILES, { new File(baseDir, it).size() > 4096 }, { println "$it.name ${it.size()}" }
fileType
- whether normal files or directories or both should be processed.nameFilter
- the filter to perform on the name of the file/directory (using the DefaultGroovyMethods#isCase method).closure
- the closure to invoke.public void eachFileMatch(Object nameFilter, Closure closure)
nameFilter
- the nameFilter to perform on the name of the file (using the DefaultGroovyMethods#isCase method).closure
- the closure to invoke.public void eachFileRecurse(FileType fileType, Closure closure)
fileType
- if normal files or directories or both should be processed.closure
- the closure to invoke on each file.public void eachFileRecurse(Closure closure)
closure
- a closure.public Object eachLine(Closure closure)
closure
- a closure (arg 1 is line, optional arg 2 is line number starting at line 1).public Object eachLine(String charset, Closure closure)
charset
- opens the file with a specified charset.closure
- a closure (arg 1 is line, optional arg 2 is line number starting at line 1).public Object eachLine(int firstLine, Closure closure)
firstLine
- the line number value used for the first line (default is 1, set to 0 to start counting from 0).closure
- a closure (arg 1 is line, optional arg 2 is line number).public Object eachLine(String charset, int firstLine, Closure closure)
charset
- opens the file with a specified charset.firstLine
- the line number value used for the first line (default is 1, set to 0 to start counting from 0).closure
- a closure (arg 1 is line, optional arg 2 is line number).public void eachObject(Closure closure)
closure
- a closure.public Writable filterLine(Closure closure)
closure
- a closure which returns a boolean indicating to filter
the line or not.public Writable filterLine(String charset, Closure closure)
charset
- opens the file with a specified charset.closure
- a closure which returns a boolean indicating to filter
the line or not.public void filterLine(Writer writer, Closure closure)
writer
- a writer destination to write filtered lines to.closure
- a closure which takes each line as a parameter and returns
true
if the line should be written to this writer..public void filterLine(Writer writer, String charset, Closure closure)
writer
- a writer destination to write filtered lines to.charset
- opens the file with a specified charset.closure
- a closure which takes each line as a parameter and returns
true
if the line should be written to this writer..public byte[] getBytes()
public String getText(String charset)
charset
- the charset used to read the content of the file.public String getText()
public File leftShift(Object text)
text
- the text to write to the File.public File leftShift(byte[] bytes)
bytes
- the byte array to append to the end of the File.public File leftShift(InputStream data)
data
- an InputStream of data to write to the file.public DataInputStream newDataInputStream()
public DataOutputStream newDataOutputStream()
public BufferedInputStream newInputStream()
public ObjectInputStream newObjectInputStream()
public ObjectInputStream newObjectInputStream(ClassLoader classLoader)
classLoader
- the class loader to use when loading the class.public ObjectOutputStream newObjectOutputStream()
public BufferedOutputStream newOutputStream()
public PrintWriter newPrintWriter()
public PrintWriter newPrintWriter(String charset)
charset
- the charset.public BufferedReader newReader()
public BufferedReader newReader(String charset)
charset
- the charset for this File.public BufferedWriter newWriter()
public BufferedWriter newWriter(boolean append)
append
- true if data should be appended to the file.public BufferedWriter newWriter(String charset, boolean append)
charset
- the name of the encoding used to write in this file.append
- true if in append mode.public BufferedWriter newWriter(String charset)
charset
- the name of the encoding used to write in this file.public byte[] readBytes()
public List readLines()
public List readLines(String charset)
charset
- opens the file with a specified charset.public boolean renameTo(String newPathName)
newPathName
- The new pathname for the named file.true
if and only if the renaming succeeded;
false
otherwisepublic void setBytes(byte[] bytes)
bytes
- the byte[] to write to the file.public void setText(String text)
text
- the text to write to the File.public void setText(String text, String charset)
myFile.setText('some text', charset)or with some help from
ExpandoMetaClass
, you could do something like:
myFile.metaClass.setText = { String s -> delegate.setText(s, 'UTF-8') } myfile.text = 'some text'
charset
- The charset used when writing to the file.text
- The text to write to the File.public long size()
size()
method for File
.public Object splitEachLine(String regex, Closure closure)
regex
- the delimiting regular expression.closure
- a closure.public Object splitEachLine(Pattern pattern, Closure closure)
pattern
- the regular expression Pattern for the delimiter.closure
- a closure.public Object splitEachLine(String regex, String charset, Closure closure)
regex
- the delimiting regular expression.charset
- opens the file with a specified charset.closure
- a closure.public Object splitEachLine(Pattern pattern, String charset, Closure closure)
pattern
- the regular expression Pattern for the delimiter.charset
- opens the file with a specified charset.closure
- a closure.public void traverse(Map options, Closure closure)
closure
for each descendant file in this directory tree.
Sub-directories are recursively traversed as found.
The traversal can be adapted by providing various options in the options
Map according
to the following keys:def totalSize = 0 def count = 0 def sortByTypeThenName = { a, b -> a.isFile() != b.isFile() ? a.isFile() <=> b.isFile() : a.name <=> b.name } rootDir.traverse( type : FILES, nameFilter : ~/.*\.groovy/, preDir : { if (it.name == '.svn') return SKIP_SUBTREE }, postDir : { println "Found $count files in $it.name totalling $totalSize bytes" totalSize = 0; count = 0 }, postRoot : true sort : sortByTypeThenName ) {it -> totalSize += it.size(); count++ }
options
- a Map of options to alter the traversal behavior.closure
- the Closure to invoke on each file/directory and optionally returning a FileVisitResult value
which can be used to control subsequent processing.public void traverse(Closure closure)
closure
- the Closure to invoke on each file/directory and optionally returning a FileVisitResult value
which can be used to control subsequent processing.public void traverse(Map options)
options
- a Map of options to alter the traversal behavior.public Object withDataInputStream(Closure closure)
closure
- a closure.public Object withDataOutputStream(Closure closure)
closure
- a closure.public Object withInputStream(Closure closure)
closure
- a closure.public Object withObjectInputStream(Closure closure)
closure
- a closure.public Object withObjectInputStream(ClassLoader classLoader, Closure closure)
classLoader
- the class loader to use when loading the class.closure
- a closure.public Object withObjectOutputStream(Closure closure)
closure
- a closure.public Object withOutputStream(Closure closure)
closure
- a closure.public Object withPrintWriter(Closure closure)
closure
- the closure to invoke with the PrintWriter.public Object withPrintWriter(String charset, Closure closure)
charset
- the charset.closure
- the closure to invoke with the PrintWriter.public Object withReader(Closure closure)
closure
- a closure.public Object withReader(String charset, Closure closure)
charset
- the charset for this input stream.closure
- a closure.public Object withWriter(Closure closure)
closure
- a closure.public Object withWriter(String charset, Closure closure)
charset
- the charset used.closure
- a closure.public Object withWriterAppend(String charset, Closure closure)
charset
- the charset used.closure
- a closure.public Object withWriterAppend(Closure closure)
closure
- a closure.public void write(String text)
text
- the text to write to the File.public void write(String text, String charset)
text
- the text to write to the File.charset
- the charset used.
|
Groovy JDK |


Laurentius Tirtarahardja
Laurentius was born in Torrance, CA on September 7, 1987. Shortly after, he moved to Laguna Niguel, CA and has lived there since. Hobbies that Laurentius likes are hockey, video games, tabletop role playing games, and music. Laurentius' favorite team is the Anaheim Ducks.


Install on Arch Linux Source & Docs
I thought it'd be cool to project random images from web search on the wall in my apartment. Sort of a live poster, which changes the picture every once in a while. Hardware parts wasn't a problem - 320x240 projector for $50 and Raspberry Pi for $35 did great job for a price. Though I couldn't find an open-source tool to fetch random pictures from the web, so I wrote one. Hope you'll have as much fun with it as I do!
Oleg
It runs continuously as a daemon, gets URLs from web image search, downloads images, resizes, and sets random image from current search query as X desktop background every now and then.
Can be controlled through file system via echo and touch. I use SSH client on my smartphone as remote control.
Available commands include: change search query, skip image, blacklist controls.
Global and per-query blacklists. You can block image from appearing in current query or all queries.
Offline cache. All images are stored on disk. If network goes offline, slide show continues with what was already downloaded.
Adjustable download speed limit.
Duplicate images are skipped in slide show. Duplicate detection is based on pixel data, so identical images get detected even if they were downloaded from different websites, have different names and different metadata.
Built with 30% more love than closest competitor!
Copyright 2015 Oleg Plakhotniuk


scored:
died:
hi
Learning Rate
Discount Factor
Action Randomization
Full set of states
(may take longer to train)
▶ TRAIN
reset


"Data scientist is a person who is better at statistics than any programmer and better at programming than any statistician."
Y = F(X): No input, no output.
Applied problem solving skills in navigating challenging datasets. Main challenges included that the datasets were very large, high percentage(93% - 98%) of "missing value" in majority of the datasets.
View the presentation: RedHat_KaggleCase_Presentation.pdf
Designed data collection plan, performed company competitor and industry growth researches, applied qualitative and quantitative analysis including inferential statistics and process flow charts, and delivered cost-effective suggestions.
Concerning the challenge and problem that nearly half of the high school graduates in Arizona do not enter college after graduation, the government is burdened to convert more high school graduates to college students. As a result, a linear programming maximization model was created to find the optimal solution and the projected maximum tax revenue. The main challenges were to find out and make decisions on what relevant input variables to select and how they should be logically related and presented. One particular challenge in the parameter selection stage was to figure out the value of the key parameter"Conversion rate."
Four overarching modules were covered in this seven-week course. These included: typical architecture of enterprise data analytics systems; constructing data models and entity-relationship diagrams; using SQL to query small and big databases; conducting query and reporting using Tableau.
In this seven-week class, a variety of interesting and important topics were covered. These included: Internet of Things, Regression, Machine Learning (classification & clustering algorithms, Deep Learning), Text Mining. In predictive analytics module, specific topics covered included Neural Networks, K-nearest neighbor, Support Vector Machines, and Decisional Trees and its algorithm ramifications. In clustering module, Kohonen SOM and K-Means techniques were discussed. Additional topics covered included, using R to solve machine learning problems, machine learning model evaluation, voting-based ensemble techniques, stack ensemble, cross-validation, feature selection, feature extraction, and gradient boosting, etc. The two main tools used in the course and applied in doing assignments were Microsoft Azure Machine Learning and SPSS Modeler 18.
In this fourteen-week course, six key topics were studied including Six Sigma principles, Six Sigma Methodology (DMAIC: Define, Measure, Analyze, Improve and Control), Statistical Process Control, Process Capability Evaluation, Design of Experiment, and Inferential Statistics (focus on product and process quality). Throughout the semester, four Harvard case studies were analyzed.
In this fourteen-week problem-solving course, a variety of advanced analytical techniques derived from management science were examined to improve decision making. Specifically, four overarching deterministic optimization techniques were studied in details and applied in four case studies. These business decisions-supporting techniques included linear programming, nonlinear programming, integer programming; network models and a brief introduction to metaheuristics.
One of the most valuable experience that this class offered was that, all these models were analyzed for a variety of common business problems across diverse fields such as e-commerce, banking, healthcare, services, telecommunication, transportation, and utilities, among others. Additionally, Implementation of these models was done using Excel——performing spreadsheet modeling and setting up Solver to find the optimal solution, and corresponding Sensitivity report was analyzed for each model to ensure that the optimal solution works in a wide variety of situations (what-if analysis, essentially).


Lists in Html
Technologies that we learn
Technologies that we learn
- Java
- Sprint
- HTML
- css
Technologies that we learn
- Java
- Sprint
- HTML
- css
Technologies that we learn
- Java
- Sprint
- HTML
- css
Technologies that we learn
- Java
- Sprint
- HTML
- css
Technologies that we learn
- Java
- Sprint
- HTML
- css
Nested List


If you clicked this, your dog is probably a husky!
The Husky is a dog often compared to Jesus because it has the sky in one eye and God's brown earth on the other. Make sure not to let them tear your heads off, for they are ferocious and have sharp teeth, especially when they hear a sin.:)


LONDON CALLING
Celtic star Edouard on Crystal Palace’s transfer radar with Rangers’ Morelos
by Alan NixonODSONNE EDOUARD is on Crystal Palace’s radar as they hunt for a new striker.
The Celtic hitman, has emerged as a possible January target, with Roy Hodgson also interested in Rangers’ Alfredo Morelos.
Palace have £50million in the bank from the sale of Aaron Wan-Bissaka to Manchester United.
But Hodgson knows it would be tough to nick either player in the middle of a title fight.
Edouard has been in electric form for the Hoops with 12 goals and 12 assists so far this season.
He joined Celtic in 2018 in a £9million move from French champions PSG after a successful loan spell at Parkhead.
Yesterday we told that Edouard could miss over half of the Hoops European qualifiers next season after revealing his Olympics dream.
The Tokyo 2020 Under-23 tournament runs from July 23 to August 8, with France among the favourites.
Edouard is desperate to make the squad for Japan — but that would rule him out of key qualifiers.
The in-form striker insists he’s determined to play a leading role in Sylvain Ripoll’s squad in the Far East next summer.
He said: “It’s a very important competition, one that every sportsman dreams of participating in.
“I have waited a long time to be called up by France at this level and I am keen to do well so I make an impression.”


| ID | Formula | FW | DSSTox_CID | DSSTox_RID | DSSTox_GSID | DSSTox_FileID_Sort | TS_ChemName | TS_ChemName_Synonyms | TS_CASRN | CASRN_ChemName_Relationship | TS_Description | ChemNote | STRUCTURE_Shown | STRUCTURE_Formula | STRUCTURE_MW | STRUCTURE_ChemType | STRUCTURE_DefinedOrganicForm | STRUCTURE_IUPAC | STRUCTURE_SMILES | STRUCTURE_SMILES_Desalt | Substance_modify_yyyymmdd | |
| 88-24-4 | 7527 | C25H36O2 | 368.5521 | 18864 | 79411 | 38864 | 4093 | 2,2'-Methylenebis(ethyl-6-tert-butylphenol) | Phenol, 2,2'-methylenebis(6-tert-butyl-4-ethyl- | 88-24-4 | primary | single chemical compound | tested chemical | C25H36O2 | 368.5521 | defined organic | parent | 2,2'-methanediylbis(6-tert-butyl-4-ethylphenol) | CC(C)(C)c2cc(cc(Cc1cc(CC)cc(c1O)C(C)(C)C)c2O)CC | CC(C)(C)c2cc(cc(Cc1cc(CC)cc(c1O)C(C)(C)C)c2O)CC | 20080429 |


Crystal 0.27.2 has been released!
This release includes some fixes that appeared in 0.27.1. So don’t miss the 0.27.1 release post, that is the real deal here.
Back to our regular stats, there were 5 commits since 0.27.1 by 3 contributors.
You can view the changes in GitHub’s release changelog.
Yesterday was a great day, where each of the issues detected in the previous version got fixed at the same time by different members of the community. Go team! I mean…, Crystal team!


Next generation, serverless cloud
Tencent Cloud and Serverless have joined forces to create a serverless cloud focused on delivering outcomes, not infrastructure. Everything autoscaling; never pay for idle.
View examples
a fullstack app built on serverless components via the serverless framework
ß
{{ message }}
Name:
Email:
Site:
Submit
Name: {{ item.name }}
Email: {{ item.email }}
Site: {{ item.site }}
x
No Data


|
qLibc
|
Hash APIs. More...
Go to the source code of this file.

Definition in file qhash.c.
| bool qhashmd5 | ( | const void * | data, |
| size_t | nbytes, | ||
| void * | retbuf | ||
| ) |
Calculate 128-bit(16-bytes) MD5 hash.
| data | source object |
| nbytes | size of data |
| retbuf | user buffer. It must be at leat 16-bytes long. |
| bool qhashmd5_file | ( | const char * | filepath, |
| off_t | offset, | ||
| ssize_t | nbytes, | ||
| void * | retbuf | ||
| ) |
Get 128-bit MD5 hash of a file contents.
| filepath | file path |
| offset | start offset. Set to 0 to digest from beginning of file. |
| nbytes | number of bytes to digest. Set to 0 to digest until end of file. |
| retbuf | user buffer. It must be at leat 16-bytes long. |
| uint32_t qhashfnv1_32 | ( | const void * | data, |
| size_t | nbytes | ||
| ) |
Get 32-bit FNV1 hash.
| data | source data |
| nbytes | size of data |
| uint64_t qhashfnv1_64 | ( | const void * | data, |
| size_t | nbytes | ||
| ) |
Get 64-bit FNV1 hash integer.
| data | source data |
| nbytes | size of data |
| uint32_t qhashmurmur3_32 | ( | const void * | data, |
| size_t | nbytes | ||
| ) |
Get 32-bit Murmur3 hash.
| data | source data |
| nbytes | size of data |
| bool qhashmurmur3_128 | ( | const void * | data, |
| size_t | nbytes, | ||
| void * | retbuf | ||
| ) |
Get 128-bit Murmur3 hash.
| data | source data |
| nbytes | size of data |
| retbuf | user buffer. It must be at leat 16-bytes long. |


Step 2: Generate your voting transaction while being OFF-LINE
First of all, save this website to your local machine (right click, Save as…). This can be done in two ways:
MAXIMUM SECURITY: Copy the file to a secure, off-line computer, which has never been connected to the internet - this gives you best protection. In this case, you should use a pen drive or an external hard drive to port the file to the off-line machine.
 This is less secure, as it won't protect you from malware or key loggers that you may already have, but is still way more secure than doing this on-line.
While being OFF-LINE do the following:
Open the saved 2_generate_transaction.html file in your browser. Your private key is at no point exposed to on-line connections, which greatly reduces the risk of getting hacked.
Fill in all fields. Triple check everything! For chain_id, block_num and ref_block_prefix use the data fetched in the previous step.
Copy or write down the generated transaction, as you'll need it in the subsequent step. Please note that your private key is used to sign transaction, but it's NOT part of the transaction.
Generated and signed raw transaction:
Copy or write down the above raw transaction (whitespaces don't matter).
Next, go to Step 3, to push this transaction to the network.


题意：给出一个数列，求出有多少种排序方法将其排成升序。
| Swaps |
Sorting an array can be done by swapping certain pairs of
adjacent entries in the array. This is the fundamental technique
used in the well-known bubble sort. If we list the identities of
the pairs to be swapped, in the sequence they are to be swapped, we
obtain what might be called a swap map. For example, suppose we
wish to sort the array A whose elements are 3, 2, and 1 in that
order. If the subscripts for this array are 1, 2, and 3, sorting
the array can be accomplished by swapping A2 and A3, then swapping
A1 and A2, and finally swapping A2 and A3. If a pair is identified
in a swap map by indicating the subscript of the first element of
the pair to be swapped, then this sorting process would be
characterized with the swap map 2 1 2.
It is instructive to note that there may be many ways in which
swapping of adjacent array entries can be used to sort an array.
The previous array, containing 3 2 1, could also be sorted by
swapping A1 and A2, then swapping A2 and A3, and finally swapping
A1 and A2 again. The swap map that describes this sorting sequence
is 1 2 1.
For a given array, how many different swap maps exist? A little
thought will show that there are an infinite number of swap maps,
since sequential swapping of an arbitrary pair of elements will not
change the order of the elements. Thus the swap map 1 1 1 2 1 will
also leave our array elements in ascending order. But how many swap
maps of minimum size will place a given array in order? That is the
question you are to answer in this problem.
Input
The input data will contain an arbitrary number of test cases,
followed by a single 0. Each test case will have a integer n
that gives the size of an array, and will be followed by the
n integer values in the array.
Output
For each test case, print a message similar to those shown in
the sample output below. In no test case will n be larger
than 5.
Sample
Input
2 9 7
2 12 50
3 3 2 1
3 9 1 5
0
Sample
Output
There are 1 swap maps for input data set 1.
There are 0 swap maps for input data set 2.
There are 2 swap maps for input data set 3.
There are 1 swap maps for input data set 4.
“<<step<<”
swap maps for input data set
“<<ncase<<“.”<<endl;


5 R-markdown file “12_Forecasting_Models_ARIMA_PM10”
As first step I created a very simple model to use as a base reference. This model takes as prediction the value from the previous hour, forecasting just one hour ahead. So, the formula for this base model would be: Xt = Xt-1.
Then, I generated three different seasonal (frequency: 24 hours) ARIMA models with three different training periods.
And I applied these three models to the testing period data (2017-01-01 - 2017-09-30) in order to obtain their prediction accuracy scores for the one hour ahead forecast.
Finally, I obtained the prediction accuracy scores for the ARIMA with the three years training period for the 6 hours, 12 hours and 24 hours ahead forecasts.
In the table below we can see the R-squared and the MAE obtained for each ARIMA model tested for the PM10 pollutant.
| Model type | Target variable | Prediction horizon | Train period | Test period | R-Squared | MAE | Model detail |
|---|---|---|---|---|---|---|---|
| Auto regressive (Base model) | PM10 | 1 hour | - |<PHONE_NUMBER>09 | 0.5327 | 5.15 | PM10t = PM10(t-1) |
| ARIMA | PM10 | 1 hour |<PHONE_NUMBER>12 |<PHONE_NUMBER>09 | 0.5975 | 4.88 | ARIMA(2,1,4)(0,0,2)[24] |
| ARIMA | PM10 | 1 hour |<PHONE_NUMBER>12 |<PHONE_NUMBER>09 | 0.6015 | 4.84 | ARIMA(2,1,3)(0,0,2)[24] |
| ARIMA | PM10 | 1 hour | 200901_201612 |<PHONE_NUMBER>09 | 0.5966 | 4.88 | ARIMA(3,1,2)(0,0,2)[24] |
| ARIMA | PM10 | 6 hours |<PHONE_NUMBER>12 |<PHONE_NUMBER>09 | 0.2118 | 7.12 | ARIMA(2,1,3)(0,0,2)[24] |
| ARIMA | PM10 | 12 hours |<PHONE_NUMBER>12 |<PHONE_NUMBER>09 | 0.1108 | 7.64 | ARIMA(2,1,3)(0,0,2)[24] |
| ARIMA | PM10 | 24 hours |<PHONE_NUMBER>12 |<PHONE_NUMBER>09 | 0.0138 | 10.90 | ARIMA(2,1,3)(0,0,2)[24] |
5.1 Machine Learning results
Machine learning methods Linear Regression Random Forests XGBoosts Neural Networks


About Davar
DAVAR is with the Hikvision Research Institute, China. It locates at Block No. 12, Technology Leader City No. 1388 Zhangdong Rd, Pudong district, Shanghai. The main founders of DAVAR are Ms. Yunlu Xu (Director), Mr. Liang Qiao (Co-Director) and Mr. Zhanzhan Cheng (Honor Founder).
"DAVAR" means "Document, Audio, Video Analysis and Recognition". The main research interests of DAVAR include computer vision and machine learning, and some other related areas.
Currently our research mainly involves: OCR system, document understanding, sequence learning, vision foundation model, difussion model, image quality assessment, weakly/semi-supervised learning and other ML related researches.
DAVAR team is committed to providing secure and robust artificial intelligence technology to make world better.
See Far, Go Further.
Join us
We recruit long/short-term interns all year round. Please send your resume to: xuyunlu@hikvision.com


public class ELProcessor
extends java.lang.Object
This class provides a direct and simple interface for
ValueExpression
to a Jakarta Expression Language variable.This API is not a replacement for the APIs in Jakarta Expression Language 2.2. Containers that maintain Jakarta Expression Language environments can continue to do so, without using this API.
For Jakarta Expression Language users who want to manipulate Jakarta Expression Language environments, like adding
custom ELResolver
s, ELManager
can be used.
Since it maintains the state of the Jakarta Expression Language environments, ELProcessor
is not thread
safe. In the simplest case, an instance can be created and destroyed before and after evaluating Jakarta Expression
Language expressions. A more general usage is to use an instance of ELProcessor
for a session, so that
the user can configure the Jakarta Expression Language evaluation environment for that session.
A note about the Jakarta Expression Language expressions strings used in the class. The strings allowed in the methods
getValue(java.lang.String, java.lang.Class<?>)
, setValue(java.lang.String, java.lang.Object)
, and setVariable(java.lang.String, java.lang.String)
are limited to
non-composite expressions, i.e. expressions of the form ${...} or #{...} only. Also, it is not necessary (in fact not
allowed) to bracket the expression strings with ${ or #{ and } in these methods: they will be automatically
bracketed. This reduces the visual cluster, without any lost of functionalities (thanks to the addition of the
concatenation operator).
ELProcessor elp = new ELProcessor(); elp.defineBean("employee", new Employee("Charlie Brown")); String name = elp.eval("employee.name");
| Constructor and Description |
|---|
ELProcessor() |
| Modifier and Type | Method and Description |
|---|---|
void |
defineBean(java.lang.String name,
java.lang.Object bean)
Define a bean in a local bean repository, hiding other beans of the same name.
|
void |
defineFunction(java.lang.String prefix,
java.lang.String function,
java.lang.reflect.Method method)
Define a Jakarta Expression Language function in the local function mapper.
|
void |
defineFunction(java.lang.String prefix,
java.lang.String function,
java.lang.String className,
java.lang.String method)
Define a Jakarta Expression Language function in the local function mapper.
|
java.lang.Object |
eval(java.lang.String expression)
Evaluates an Jakarta Expression Language expression.
|
ELManager |
getELManager()
Return the ELManager used for Jakarta Expression Language processing.
|
java.lang.Object |
getValue(java.lang.String expression,
java.lang.Class<?> expectedType)
Evaluates an Jakarta Expression Language expression, and coerces the result to the specified type.
|
void |
setValue(java.lang.String expression,
java.lang.Object value)
Sets an expression with a new value.
|
void |
setVariable(java.lang.String var,
java.lang.String expression)
Assign a Jakarta Expression Language expression to a Jakarta Expression Language variable.
|
public ELManager getELManager()
public java.lang.Object eval(java.lang.String expression)
expression
- The Jakarta Expression Language expression to be evaluated.public java.lang.Object getValue(java.lang.String expression, java.lang.Class<?> expectedType)
expression
- The Jakarta Expression Language expression to be evaluated.expectedType
- Specifies the type that the resultant evaluation will be coerced to.public void setValue(java.lang.String expression, java.lang.Object value)
expression
- The target expressionvalue
- The new value to set.PropertyNotFoundException
- if one of the property resolutions failed because a specified variable or property
does not exist or is not readable.PropertyNotWritableException
- if the final variable or property resolution failed because the specified
variable or property is not writable.ELException
- if an exception was thrown while attempting to set the property or variable. The thrown exception
must be included as the cause property of this exception, if available.public void setVariable(java.lang.String var, java.lang.String expression)
null
, the variable will be removed.var
- The name of the variable.expression
- The Jakarta Expression Language expression to be assigned to the variable.public void defineFunction(java.lang.String prefix, java.lang.String function, java.lang.String className, java.lang.String method) throws java.lang.ClassNotFoundException, java.lang.NoSuchMethodException
prefix
- The namespace for the function or "" for no namesapce.function
- The name of the function. If empty (""), the method name is used as the function name.className
- The full Java class name that implements the function.method
- The name (specified without parenthesis) or the signature (as in the Java Language Spec) of the static
method that implements the function. If the name (e.g. "sum") is given, the first declared method in class that
matches the name is selected. If the signature (e.g. "int sum(int, int)" ) is given, then the declared method with
the signature is selected.java.lang.NullPointerException
- if any of the arguments is null.java.lang.ClassNotFoundException
- if the specified class does not exists.java.lang.NoSuchMethodException
- if the method (with or without the signature) is not a declared method of the class, or
if the method signature is not valid, or if the method is not a static method.public void defineFunction(java.lang.String prefix, java.lang.String function, java.lang.reflect.Method method) throws java.lang.NoSuchMethodException
prefix
- The namespace for the function or "" for no namesapce.function
- The name of the function. If empty (""), the method name is used as the function name.method
- The java.lang.reflect.Method
instance of the method that implements the function.java.lang.NullPointerException
- if any of the arguments is null.java.lang.NoSuchMethodException
- if the method is not a static methodpublic void defineBean(java.lang.String name, java.lang.Object bean)
name
- The name of the beanbean
- The bean instance to be defined. If null
, the name will be removed from the local bean
repository.


abstract class Validator<out T>
Responsible for validating data.
T
- the type of data to validate (see validate).
Validator(rootView: View)
Responsible for validating data. |
val rootView: View
the view used as the root for displaying a Snackbar |
fun showMessage(stringRes: Int): Unit
Displays a Snackbar message using the string resource (stringRes) for the short duration of time. |
|
abstract fun validate(): T?
Validates the user inputs and instantiates a class of type T from it. |
class MarriageValidator : Validator<Marriage>
Responsible for validating a Marriage. |
|
class PersonValidator : Validator<Person>
Responsible for validating a Person. |


| Name: mr.anjani pandey | Reg No: 04-4SMHC19 |
|---|---|
| Age / Sex:36/m | Contact No:9871647469 |
| Marital Status:ml- 7 yrs. | Date:13/4/19 |
| Occupation:asst.manager finance. | Dr. pjfp |
| Address:native of bihar. Stayed in delhi fr past 12 years. In blore frm 8 mnths. | DIAGNOSIS- |
Concentration is low. Anxiety. Getting irritated. Frm almost one.
Diagnosed with hypothyroidism frm 10 years.
Got diagnosed due to weakness and tiredness. Weight also less not increasing. Then got diagnosed esr was high and tsh was more than 300.
Now feels swelling in the foot.concentration level is very low. When others are talking around that disturbs him. I get irritated. Feels doubts tht they r joking on him and deliberately disturbing him.
3 bro and 2 sisters.
Last child is the patient.
Dad expired when pt was 8-9 yrs old had good relation with him bt could nt get euf time with him. Had some kidney failure .
Mom: 3-4 yrs back developed thyroid dysfunction, asthma.
One sister: hypothyroid.
In college time use to have some fear like what they will feel what will they think. What they will judge.

Some party in delhi they had to do a team work where they left him out.
Took some med in psychiatry clinic saying he had social anxiety.
Dreams about running,
Occasionally feels constipated.
Rx:
Baryta carb 1m- 1 dose.
Aconite10m – 5 days later.
Thyroid 6c -4-0-4 a/food disc.
Rub 15 – 1 tab night b/food.
27/4/19: feeling better. …
Rx:
Baryta carb 1m- 1 dose.
Aconite10m – 5 days later.
Thyroid 6c -4-0-4 a/food disc.
Rub 15 – 1 tab night b/food.
11/5/19: feeling better. Having stomach pbm. After eating pain in abd. Must pass motion imm. Constipation all frm one week. Had some food outside vacation coz of.
Rx:
Baryta carb 1m- 1 dose.
Aconite10m – 5 days later.
Thyroid 6c -4-0-4 a/food disc.
Rub 15 – 1 tab night b/food.
kurchiQ+hydrastisQ – 15-10-15 drops a/food water.
25/5/19: heaviness if eats little also after eating specifically since a week.. . more eructation. Little better after.concentrtion issue and irritation frm a week. . Motion is not clear.smtimes loose smtimes hard. Went to Delhi and came back last week. Work related pressure late hours working. Sleep also not good due to stomach.
Rx:
lyco 200 – 4-0-4 pills b/food.
Carbo veg30 – 4-0-4 pills b/food.
Nat phos 6x 4-4-4 a/food.
Rub 15 – 1 tab night b/food.
Ginseng 15-15-15 a/food water .


GetVehicleAttribute()
Syntax
Result.f = GetVehicleAttribute(#Entity, Attribute, Wheel)Description
Get the specified attribute of the given vehicle entity.
Parameters
#Entity The vehicle entity to use. Attribute The attribute to get. The following attributes are available: #PB_Vehicle_Friction: get the wheel friction value (see CreateVehicleBody() for more info). #PB_Vehicle_MaxSuspensionForce: get the wheel maximum suspension force value (see CreateVehicleBody() for more info). #PB_Vehicle_SuspensionStiffness: get the stiffness value for the suspension (see CreateVehicleBody() for more info). #PB_Vehicle_MaxSuspensionCompression: get the wheel maximum suspension compression value (see CreateVehicleBody() for more info). #PB_Vehicle_MaxSuspensionLength: get the maximum length of the suspension (meters). #PB_Vehicle_WheelDampingCompression: get the wheel damping compression value. #PB_Vehicle_WheelDampingRelaxation: get the wheel damping relaxation value. #PB_Vehicle_RollInfluence: get the wheel roll influence value (see AddVehicleWheel() for more info).Wheel The wheel index, starting from 0.
Return value
Returns the value of the specified attribute or 0 if the vehicle does not support the attribute.
See Also
SetVehicleAttribute()
Supported OS
All


{% block body %}
{{ brand_name }}
{{ description }}
Logout
Are you sure you want to logout?
{% endblock %}


Team Members
`
George McMurray
Manager
ID#: 5
Email
<EMAIL_ADDRESS>Office # :3
Gong Bob
Engineer
ID#: 2
Email
<EMAIL_ADDRESS>GitHub Name
gmcmurray
Sally Man
Intern
ID#: 9
Email
<EMAIL_ADDRESS>School
SateU
`


This is a website for organizing my reading notes of research papers and a few books.
If you have any question about this project, please feel free to contact me: Qian Feng<EMAIL_ADDRESS>.
Paper review
Identify recombination
- RDP4: Detection and analysis of recombination patterns in virus genomes Virus Evolution, 1(1),(2015)Martin, D. P., Murrell, B., Golden, M., Khoosal, A., & Muhire, B.
- Paper: https://academic.oup.com/ve/article/1/1/vev003/2568683
- Software: http://web.cbio.uct.ac.za/~darren/RDP4Manual.pdf
- Note: link
Phylogenetic Network construction
Var biology background knowledge
This R Markdown site was created with workflowr


| Name | Current Version | Latest Version | Date Added | Public Popularity | Enterprise Usage | Team Usage |
|---|---|---|---|---|---|---|
| {{dependency.name}} | {{dependency.curVersion}} | {{dependency.latestVersion}} | {{dependency.dateAdded}} | {{dependency.pubPopularity}} | {{dependency.enterpriseUsage}} | {{dependency.teamUsage}} |


func DecodeTracks(header *Header, rawBytes []byte) (tracks []Track, err error)
DecodeTracks uses the data in header and the input slice rawBytes to genereate the tracks slice.
func ParseCString(byteSlice []byte) string
ParseCString reads a byteSlice until the first NUL character and returns a string
func ParseFloat32LE(byteSlice []byte) (float32, error)
ParseFloat32LE reads a byteSlice and parses the bytes as a 32 bit little endian float and returns a float32
func ParseInt32BE(byteSlice []byte) (int32, error)
ParseInt32BE reads a byteSlice and parses the bytes as a 32 bit big endian integer and returns an int32
func ParseString(byteSlice []byte, length int) string
ParseString reads at most length bytes from a byteSlice and returns a string
func ParseTrackPatternAsString(trackPatternBytes []byte) string
ParseTrackPatternAsString decodes a sequence of bytes representing track pattern step data in groups of 4 consecutive bytes example output looks like this: |x-x-|x-x-|x-x-|x-x-|
func ParseUInt8BE(byteSlice []byte) (uint8, error)
ParseUInt8BE reads a byteSlice and parses the bytes as a 8 bit big endian unsigned integer and returns an uint8
func PatternToString(trackPattern *Pattern) string
PatternToString returns a string representing the Pattern trackPattern in the format required by decoder_test.go
type Header struct { FormatName string // File format name: SPLICE, max string length 10 DataSize int32 // Size of next data chunk containing valid data Version string // HW Version that created the file, max string length 32 Tempo float32 // Tempo value }
A Header represents the header for a splice file.
func DecodeHeader(rawBytes []byte) (header *Header, err error)
DecodeHeader decodes data in rawBytes and returns a new Header that represents the decoded data file header.
type Pattern struct { Header Header // Header for this file Tracks []Track // Track data slice StringValue string // This is for convenience for embedding the Pattern in text format required by decoder_test.go. }
Pattern is the high level representation of the drum pattern contained in a .splice file.
func DecodeFile(path string) (*Pattern, error)
DecodeFile decodes the drum machine file found at the provided path and returns a pointer to a parsed pattern which is the entry point to the rest of the data.
func DecodeSpliceFileToPattern(rawBytes []byte) (patternData *Pattern, err error)
DecodeSpliceFileToPattern decodes the header and track data for a file and returns patternData, which contains the decoded data contained in a splice file represented by rawBytes.
type Track struct { Id byte // Track id 0-255 NameLength int32 // Length of the track name string Name string // Track name string PatternStr string // Track pattern as a string: |x-x-|x-x-|x-x-|x-x-| extracted from a 16 byte slice }
A Track contains data for a single track contained in a splice file
| Name | Synopsis | |
|---|---|---|
| .. | ||
| fixtures |


| S.No |
Job Type |
Job Description |
Job Location |
Experience |
Primary Skills |
No of Resources |
Join Within |
Post |
| {{$index+1}} |
{{post.jobTitle}} |
{{post.description}} |
{{post.jobLocation}} |
{{post.experience}} |
{{post.primarySkills}} |
{{post.resources}} |
{{post.joinWithin}} |
|


ichatz (Ioannis Chatzigiannakis)
- This is you!
- Edit Your Profile
- Name
- Ioannis Chatzigiannakis
- Website/Blog
- http://ru1.cti.gr/~ichatz
- Company
- Research Academic Computer Technology Institute
- Location
- Rion, Greece
- Member Since
- Feb 28, 2011
Headers
# This is an <h1> tag ## This is an <h2> tag ###### This is an <h6> tag
Text styles
*This text will be italic* _This will also be italic_ **This text will be bold** __This will also be bold__ *You **can** combine them*
Unordered
* Item 1 * Item 2 * Item 2a * Item 2b
Ordered
1. Item 1 2. Item 2 3. Item 3 * Item 3a * Item 3b
Images
![GitHub Logo](/images/logo.png) Format: ![Alt Text](url)
Links
http://github.com - automatic! [GitHub](http://github.com)
Blockquotes
As Kanye West said: > We're living the future so > the present is our past.
Syntax highlighting with GFM
```javascript function fancyAlert(arg) { if(arg) { $.facebox({div:'#foo'}) } } ```
Or, indent your code 4 spaces
Here is a Python code example without syntax highlighting: def foo: if not bar: return true
Inline code for comments
I think you should use an `<addr>` element here instead.


Na na na... That wasn't just a QR code. That was also an AR TOKEN.Try again...This time use the Blippar AppTest code:1263760


|
libccs811
1.0.0
This is a shared library for the Raspberry PI (Raspbian distribution)
|
This is an easy to use shared library for CO2 and TVOC sensor CCS811
WiringPi library installed
Download this library as zip file, then click in "Sketch" -> "Include Library" ->"Add .ZIP Library" and select the zip file downloaded.
| ARDUINO (IC | |
|---|---|
| MOSI | DIN |
| MISO | DOUT |
| SCLK | SCLK |
| 5 (change this pin to fit your needs) | CS |
This is the typical circuit for a "thermocouple measurement system" as shown in the TI ADS1118 datasheet page 32.
Everyone is invited to contribute When contributing to this repository, please first discuss the change you wish to make via issue, email, or any other method with me before making a change.
1.0.0 CHANGE: Initial commit
I am using SemVer for versioning.
This project is licensed under the MIT License - see the LICENSE file for details.


SecDump.io
Machine Learning in Security is key for the future protection. The threads complexity, data volumes and speed of development can not be handled by semi manual approach of the classical security.


Interface IHostsZptSharp
An object which is capable of hosting a ZptSharp environment, using its own dependency injection, separate from those of the containing application.
Inherited Members
Namespace: ZptSharp.Hosting
Assembly: ZptSharp.Abstractions.dll
Syntax
public interface IHostsZptSharp : IDisposable
Remarks
Use this object when you wish to make use of the the entry-points to ZptSharp, without depending upon ZptSharp being wired up into your applications's dependency injection.
Properties
| Improve this Doc View SourceBulkRenderer
Gets a service which renders many template files at once and saves the output to disk.
Declaration
IRendersManyFiles BulkRenderer { get; }
Property Value
| Type | Description |
|---|---|
| IRendersManyFiles | The bulk renderer. |
DocumentRendererForPathFactory
Gets a service which may be used to create an instance of IRendersZptDocument, suitable for use with a given file path. The file path will be used to detect the type of document.
Note that if you wish to render a template from disk, then it is easier to use FileRenderer instead. This service is appropriate when the file path might not exist, but a stream is being provided for the template document anyway.
Declaration
IGetsZptDocumentRendererForFilePath DocumentRendererForPathFactory { get; }
Property Value
| Type | Description |
|---|---|
| IGetsZptDocumentRendererForFilePath | The document renderer factory for file paths. |
FileRenderer
Gets a service which renders ZPT template files from disk paths.
Declaration
IRendersZptFile FileRenderer { get; }
Property Value
| Type | Description |
|---|---|
| IRendersZptFile | The file renderer. |
StreamCopier
Gets a service which copies a System.IO.Stream to a System.IO.TextWriter.
Declaration
IWritesStreamToTextWriter StreamCopier { get; }
Property Value
| Type | Description |
|---|---|
| IWritesStreamToTextWriter | The stream-copying service. |


Brendan Davis
The subject and author of this about me page.
Click here to take a quiz about me.
Ten of My Favorite Books (in no particular order)
- Jennifer Government
- Red Rising
- Flight of the Silvers
- Empires of Eve: A History of the Great Empires of Eve Online
- Extra Lives: Why Video Games Matter
- Ordinary Men: The Story of Reserve Police Battalion 101
- House of Leaves
- Solaris
- The Library at Mount Char
- Geek Love


All of the form components in goponents are built on the
concept of Angular's reactive forms
and require a FormControl
.
The FormControl class is the basic building block when
using reactive forms. To register a single form control,
import the FormControl
class into your component and create a new instance of
the form control to save as a class property.


Building
Building Frida
Frida has a rather complicated build system due to some design constraints:
-
Short build time for new contributors. frida-build-env downloads a prebuilt toolchain and SDK to save time. This requires a bit more fiddling to get the build environment just right, but it has the added benefit of providing a coherent build environment. For example we know we’re being built with just one version of autotools whether we’re on Mac or Linux.
-
No moving parts. The final binary must be self-contained/portable. Some of Frida’s run-time components, like frida-fruitjector-helper, frida-agent, etc. will at some point need to be present on the filesystem. These binaries are serialized and linked into the Frida library (for example
_frida.so
in the case of frida-python), which means it’s portable without relying on external moving parts. At runtime these are written out to a temporary directory and later cleaned up. -
No runtime conflicts. frida-agent, the shared library injected into target processes, must have all of its dependencies (GLib, Gee, etc.) linked in to avoid runtime conflicts with target applications that happen to use the same libraries. Because of this, these libraries are compiled as static libraries.
-
No resource leaks. frida-agent, the shared library injected into target processes, should not allocate any OS resources without releasing them when it is unloaded to avoid accumulating leaks in long-lived processes. Because Frida is mostly written in C and makes use of the excellent GLib library, which unfortunately doesn’t provide any way to clean up statically allocated resources, we had to patch that library to add support for this. Upstream doesn’t consider this a valid use-case, so unfortunately we need to maintain our fork of this library. This means we can’t make use of a system-wide GLib on Linux systems, which consequently makes the prebuilt SDK much larger.
Frida’s build system tries to keep you sane by making use of a prebuilt toolchain and SDK for each platform. This is what’s used in the steps outlined below.
Linux
- Make sure you have a:
- Modern x86 64-bit system (Frida’s Linux backend is not yet ported to 32-bit).
- Compiler:
$ sudo apt-get install build-essential
- Clone
frida-build-env
and build it:$ git clone git://github.com/frida/frida-build-env.git $ cd frida-build-env $ make
Mac
- Make sure you have the latest Xcode with command-line tools installed.
- Clone
frida-build-env
and build it:$ git clone git://github.com/frida/frida-build-env.git $ cd frida-build-env $ make
Windows
- Make sure you have:
- 64-bit version of Windows (32-bit will work but may require some fiddling)
- Visual Studio 2010
- Git
- Python 2.7 and 3.3. You want both the 32- and the 64-bit version of each, with the 32-bit versions installed in
C:\Program Files (x86)
and 64-bit ones installed inC:\Program Files
. - Clone
frida-build-env
:$ git clone git://github.com/frida/frida-build-env.git $ cd frida-build-env $ git submodule init $ git submodule update
- Open
frida.sln
and build it.
Building the toolchain and SDK
This should not be necessary unless you’re porting Frida to a new platform. The following steps assume you have the OS-specific prerequisites mentioned above.
UNIX
- Make sure your system has the following goodies:
$ sudo apt-get install build-essential gcc git sudo flex \ bison libglib2.0-dev
- Clone the
frida-ci
repository and build away:$ git clone git@github.com:frida/frida-ci.git $ mkdir tmp $ cd tmp $ ../frida-ci/create-toolchain-and-sdk.sh
- Transfer the resulting toolchain and SDK to a web server somewhere:
$ scp build/toolchain-*.tar.bz2<EMAIL_ADDRESS>$ scp build/sdk-*.tar.bz2<EMAIL_ADDRESS>- Now you can clone
frida-build-env
like above and adjust the URLs insetup-env.sh
(look fordownload_command
) before runningmake
.
Windows
- Prepare your system
- Make sure that Visual Studio 2010 is installed.
- Install hsbuild-0.2.msi. You need Git and Perl installed, and
perl
should be in your PATH. For packaging you will also need 7-Zip to be in your PATH. - Ensure that your Git configuration at
C:\Program Files (x86)\Git\etc\gitconfig
(or similar) has the following in itscore
section:autoCRLF = false
- Also ensure that your environment does not have a
CC
environment variable defined (might have happened if you installedmsys
orcygwin
). - Use bazaar to check out our slightly modified HSBuild:
$ bzr branch lp:~oleavr/hsbuild/tweaks hsbuild
- Open
msbuild\tasks\HSBuildTasks.sln
and build it inRelease
configuration. - Open
hsbuild\hsbuild.sln
and build it inRelease
configuration (with Platform set tox86
). - As Administrator, run
deploy.bat
, which will update the system-wide HSBuild installation. - Download Frida.props and put it alongside HSBuild’s .targets/.props files, typically something like
C:\Program Files (x86)\MSBuild\HSBuild
.
- Build it - Download frida.modules and put it in a (preferably empty) directory somewhere.
- Open
cmd.exe
and navigate to that directory. - Start the build process:
$ set FRIDAMODULES=glib libgee json-glib vala $ hsbuild build -p x86_64 -c Debug -v %FRIDAMODULES% $ hsbuild build -p x86_64 -c Release -v %FRIDAMODULES% $ hsbuild build -p x86 -c Debug -v %FRIDAMODULES% $ hsbuild build -p x86 -c Release -v %FRIDAMODULES%
- Open
- Package it - Download makedist.py and put it next to
frida.modules
. - Run makedist.py:$ makedist.py
- Transfer the resulting toolchain and SDK to a web server somewhere:
$ scp toolchain-windows-*.exe<EMAIL_ADDRESS>$ scp sdk-windows-*.exe<EMAIL_ADDRESS>- Now you can clone
frida-build-env
like above and adjust the URLs inwindows-toolchain.txt
andwindows-sdk.txt
before openingfrida.sln
.


{% extends "en/2019/base_chapter.html" %} {% set metadata = {'part_number': 'I', 'chapter_number': 2, 'title': 'CSS', 'description': 'Something about CSS', 'hero_image': '', 'authors': ['una', 'argyleink'], 'reviewers': ['meyerweb', 'huijing'], 'translaters': []} %} {% block main %}
This is a test.
And only a test
{% endblock %}If it was anything more, it would certainly have had better placeholder text


General usage¶
General structure¶
The goal of the pipeline is to prepare cases obtained from Face2Gene containing information on genomic variants, phenotypic features and scores inferred from the features and a provided photograph with additional data sources, such as an alternative interpretation of phenotypic features with Phenomizer and the parsing and conversion of variant HGVS strings into VCF files.
This process requires the following steps:
- Downloading of Face2Gene cases
- Parsing of json format cases into internal representation
- Adding phenomizer data
- Creating VCF files from HGVS information
- Checking whether data quality requirements are met*
- for performance and parser implementation reasons an initial check is already done on json level
Downloading¶
Data is acquired from a AWS S3 Bucket, which is updated periodically with new cases and recalculations of old cases.
JSON Parsing¶
The raw json files provided by Face2Gene are processed into an internal case representation which attempts to bundle information from various JSON fields into a simpler structure.
Phenomization¶
Phenomizer information is included into cases by calling the phenomizer object.
VCF Generation¶
VCF files are generated by caling the vcf function of the case.
Quality Check functions¶
Whether certain criteria have been met for the cases can be checked by using the check function available in the json object and the case object.
Error correction overrides¶
There are multiple possibilities to provide corrections for erroneous input data.


Enum AllocationType
Defines the different types of memory allocations.
Namespace: ProcessMemoryUtilities.Native
Assembly: ProcessMemoryUtilities.Native.dll
Syntax
[Flags]
public enum AllocationType : uint
Fields
| Name | Description |
|---|---|
| Commit | Allocates memory charges (from the overall size of memory and the paging files on disk) for the specified reserved memory pages. The function also guarantees that when the caller later initially accesses the memory, the contents will be zero. Actual physical pages are not allocated unless/until the virtual addresses are actually accessed. To reserve and commit pages in one step, call VirtualAllocEx with MEM_COMMIT | MEM_RESERVE. Attempting to commit a specific address range by specifying MEM_COMMIT without MEM_RESERVE and a non-NULL lpAddress fails unless the entire range has already been reserved. The resulting error code is ERROR_INVALID_ADDRESS. An attempt to commit a page that is already committed does not cause the function to fail. This means that you can commit pages without first determining the current commitment state of each page. If lpAddress specifies an address within an enclave, flAllocationType must be MEM_COMMIT. |
| Invalid | An invalid value. |
| LargePages | Allocates memory using large page support. The size and alignment must be a multiple of the large-page minimum. To obtain this value, use the GetLargePageMinimum function. If you specify this value, you must also specify MEM_RESERVE and MEM_COMMIT. |
| Physical | Reserves an address range that can be used to map Address Windowing Extensions (AWE) pages. This value must be used with MEM_RESERVE and no other values. |
| Reserve | Reserves a range of the process's virtual address space without allocating any actual physical storage in memory or in the paging file on disk.  To reserve and commit pages in one step, call VirtualAllocEx with MEM_COMMIT | MEM_RESERVE. Other memory allocation functions, such as malloc and LocalAlloc, cannot use reserved memory until it has been released. |
| Reset | Indicates that data in the memory range specified by lpAddress and dwSize is no longer of interest. The pages should not be read from or written to the paging file. However, the memory block will be used again later, so it should not be decommitted. This value cannot be used with any other value. Using this value does not guarantee that the range operated on with MEM_RESET will contain zeros. If you want the range to contain zeros, decommit the memory and then recommit it. When you use MEM_RESET, the VirtualAllocEx function ignores the value of fProtect. However, you must still set fProtect to a valid protection value, such as PAGE_NOACCESS. VirtualAllocEx returns an error if you use MEM_RESET and the range of memory is mapped to a file. A shared view is only acceptable if it is mapped to a paging file. |
| ResetUndo | MEM_RESET_UNDO should only be called on an address range to which MEM_RESET was successfully applied earlier. It indicates that the data in the specified memory range specified by lpAddress and dwSize is of interest to the caller and attempts to reverse the effects of MEM_RESET. If the function succeeds, that means all data in the specified address range is intact. If the function fails, at least some of the data in the address range has been replaced with zeroes. This value cannot be used with any other value. If MEM_RESET_UNDO is called on an address range which was not MEM_RESET earlier, the behavior is undefined. When you specify MEM_RESET, the VirtualAllocEx function ignores the value of flProtect. However, you must still set flProtect to a valid protection value, such as PAGE_NOACCESS. Windows Server 2008 R2, Windows 7, Windows Server 2008, Windows Vista, Windows Server 2003 and Windows XP: The MEM_RESET_UNDO flag is not supported until Windows 8 and Windows Server 2012. |
| TopDown | Allocates memory at the highest possible address. This can be slower than regular allocations, especially when there are many allocations. |
| WriteWatch | Causes the system to track pages that are written to in the allocated region. If you specify this value, you must also specify MEM_RESERVE. To retrieve the addresses of the pages that have been written to since the region was allocated or the write-tracking state was reset, call the GetWriteWatch function. To reset the write-tracking state, call GetWriteWatch or ResetWriteWatch. The write-tracking feature remains enabled for the memory region until the region is freed. |


I will be happy to implement it if it seems like it will help many people. You can either visit the website listed below or you are welcome to email me at<EMAIL_ADDRESS>Sorry, I am only allowing hours to be displayed weekly for now. If I get enough requests I may implement this feature. For now please add the weeks together you would like the summary for.
The App assumes no exemptions in payroll. It would have been lots of work every year to accurately fix this because the IRA provides tables rather than formulas. See page 45 of this document for the tables. For most shift workers that are young and Single with no dependants this should be fairly accurate.
I chose to make the hours figure more of an equivalent hours due to being able to add overtime hours. So, if you log hours at time-and-a-half it will multiple the hours by 1.5 for the hours summary. In practical use it should not matter because the email button will still send the accurate number.
I don't store any data on my servers, or even contact any remote servers in the App. I may configure Google Analytics tracking code at some point but currently it is not in use.
© Aaron Decker - 2014. Design by Abe Wolke.


= Sample document This is a preamble. == First section This is a paragraph. This is another paragraph.


well here we are with the non0header actual text this is not really a paragraph let us continue with this it is a lot of text wow wow wow
let me google th0t 4u


washing machine
`Prev `__
W
`Next `__
--------------
**washing machine**: n.
1. Old-style 14-inch hard disks in floor-standing cabinets. So called
because of the size of the cabinet and the ‘top-loading’ access to the
media packs — and, of course, they were always set on ‘spin cycle’. The
washing-machine idiom transcends language barriers; it is even used in
Russian hacker jargon. See also `*walking
drives* `__. The thick channel cables connecting
these were called bit hoses (see `*hose* <../H/hose.html>`__, sense 3).
|image0|
(The next cartoon in the Crunchly saga is
`76-02-20:2 <../B/batch.html#crunchly-2>`__. The previous cartoon was
`75-10-04 <../B/bit-bucket.html#crunchly75-10-04>`__.)
2. [CMU] A machine used exclusively for `*washing
software* `__. CMU has clusters of these.
--------------
+-------------------------+----------------------------+-------------------------------------+
| `Prev `__ | `Up <../W.html>`__ | `Next `__ |
+-------------------------+----------------------------+-------------------------------------+
| wart | `Home <../index.html>`__ | washing software |
+-------------------------+----------------------------+-------------------------------------+
.. |image0| image:: ../graphics/76-02-14.png


| 8:30 AM | Check-in |
| 9:00 AM | GDG Philippines Introduction |
| 9:15 AM | Welcome Remarks |
| 9:30 AM | Hackathon Mechanics |
| 9:45 AM | Hackathon Proper |
| 12:00 PM | Lunch |
| 1:00 PM | Mentor Session |
| 7:00 PM | Dinner |
| 10:00 PM | Venue Closes |
| 8:00 AM | Venue Opens |
| 8:00 AM | Breakfast |
| 9:00 AM | Hackathon Proper |
| 12:00 PM | Lunch |
| 1:00 PM | Preparation for Judging |
| 2:00 PM | Judging |
| 5:00 PM | Announcement of Winners |
Participants in this app challenge will create innovative apps and online platforms that have the potential to help MSMEs in APEC economies leverage the internet to begin exporting to foreign markets. Participants are encouraged to think creatively about the challenges faced by local MSMEs, the opportunities afforded by online tools and marketplaces, and the practicalities associated with developing and implementing their new product.
Participants might address this challenge in some of the following ways:
All eligible entries will be evaluated and ranked by a panel of qualified judges based on but not limited to the following criteria:
Each judge will assign an app a score between 1 and 10 inclusively for each of the four criteria, with 1 being unexceptional and 10 being exceptional.The judges’ decisions are final and binding.
Winning team will receive an all expense paid trip to Hanoi, Vietnam on May 18-19, 2017 to represent Philippines to APEC App Challenge 2017
Register My TeamFor more information, contact:
GDG Philippines Secretariat
E-mail<EMAIL_ADDRESS>Contact #:<PHONE_NUMBER>5


abstract val amount: Amount<T>
Amount represents a positive quantity of some token which can be cash, tokens, stock, agreements, or generally anything else that's quantifiable with integer quantities. See Amount for more details.


We need your help keeping the Design System accurate and up-to-date! If you see something wrong or missing, edit the page. If you can’t make those changes yourself, file an issue. If you have a substantial change to an existing page, or a new standard you want to add, follow these guidelines.
Page last edited: {% assign file_url_path = page.path | split: '/' | last %} {% assign page_collection_name = 'pages' %} {% if page.collection_name %} {% assign page_collection_name = page.collection_name %} {% endif %} {% assign file_url_path = page_collection_name | append: '/' | append: file_url_path %}


The videos below are of some of my past performances. All videos were taken by my father. I hope you enjoy!
Megadeth- "Sweating Bullets"
I played bass guitar and sang lead vocals.
This performance was at the Canal Club.
Crosby, Stills, Nash & Young - "Ohio"
I sang lead vocals.
This performance was at Capital Ale House in downtown Richmond
The Allman Brothers - "Whipping Post"
I played bass guitar.
This performance was at Capital Ale House in downtown Richmond


To add more tour stops, create an HTML file like this one, with a basic div container. Name
it using the index number of the page you'd like to attach the tour stop to. (The index of
the left page showing on any spread is the number at the end of the URL above; add one for
the right page.) Upload the file to the directory:
data/{name of your book}/tour/
.
Be sure to update the tour.json
file in the same folder, which orders the tour.
A tour can zigzag non-linearly across a book, but you must update the JSON file.


Martin Gathu, Photo Hub
Home
Select Location
{%for location in locations%}
{{location.location_name | title}}
{%endfor%}
Upload Image


We make natural fibers for a better tomorrow
Valuable products made out of wheat straw, miscanthus, kenaf and sugar cane.
Innovative and proprietary technology used to produce sustainable products.
Less straw burned eliminates thousands of tons of air emissions.


| [ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Shell functions are defined with the function reserved word or the special syntax ‘funcname ()’. Shell functions are read in and stored internally. Alias names are resolved when the function is read. Functions are executed like commands with the arguments passed as positional parameters. (See Command Execution.)
Functions execute in the same process as the caller and share all files and present working directory with the caller. A trap on EXIT set inside a function is executed after the function completes in the environment of the caller.
The return builtin is used to return from function calls.
Function identifiers can be listed with the functions builtin. Functions can be undefined with the unfunction builtin.
| [ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
A function can be marked as undefined using the autoload builtin (or ‘functions -u’ or ‘typeset -fu’). Such a function has no body. When the function is first executed, the shell searches for its definition using the elements of the fpath variable. Thus to define functions for autoloading, a typical sequence is:
fpath=(~/myfuncs $fpath) autoload myfunc1 myfunc2 ...
The usual alias expansion during reading will be suppressed if the autoload builtin or its equivalent is given the option -U. This is recommended for the use of functions supplied with the zsh distribution. Note that for functions precompiled with the zcompile builtin command the flag -U must be provided when the .zwc file is created, as the corresponding information is compiled into the latter.
For each element in fpath, the shell looks for three possible files, the newest of which is used to load the definition for the function:
A file created with the zcompile builtin command, which is expected to contain the definitions for all functions in the directory named element. The file is treated in the same manner as a directory containing files for functions and is searched for the definition of the function. If the definition is not found, the search for a definition proceeds with the other two possibilities described below.
If element already includes a .zwc extension (i.e. the extension was explicitly given by the user), element is searched for the definition of the function without comparing its age to that of other files; in fact, there does not need to be any directory named element without the suffix. Thus including an element such as ‘/usr/local/funcs.zwc’ in fpath will speed up the search for functions, with the disadvantage that functions included must be explicitly recompiled by hand before the shell notices any changes.
A file created with zcompile, which is expected to contain the definition for function. It may include other function definitions as well, but those are neither loaded nor executed; a file found in this way is searched only for the definition of function.
A file of zsh command text, taken to be the definition for function.
In summary, the order of searching is, first, in the parents of directories in fpath for the newer of either a compiled directory or a directory in fpath; second, if more than one of these contains a definition for the function that is sought, the leftmost in the fpath is chosen; and third, within a directory, the newer of either a compiled function or an ordinary function definition is used.
If the KSH_AUTOLOAD option is set, or the file contains only a simple definition of the function, the file’s contents will be executed. This will normally define the function in question, but may also perform initialization, which is executed in the context of the function execution, and may therefore define local parameters. It is an error if the function is not defined by loading the file.
Otherwise, the function body (with no surrounding ‘funcname() {...}’) is taken to be the complete contents of the file. This form allows the file to be used directly as an executable shell script. If processing of the file results in the function being re-defined, the function itself is not re-executed. To force the shell to perform initialization and then call the function defined, the file should contain initialization code (which will be executed then discarded) in addition to a complete function definition (which will be retained for subsequent calls to the function), and a call to the shell function, including any arguments, at the end.
For example, suppose the autoload file func contains
func() { print This is func; } print func is initialized
then ‘func; func’ with KSH_AUTOLOAD set will produce both messages on the first call, but only the message ‘This is func’ on the second and subsequent calls. Without KSH_AUTOLOAD set, it will produce the initialization message on the first call, and the other message on the second and subsequent calls.
It is also possible to create a function that is not marked as autoloaded, but which loads its own definition by searching fpath, by using ‘autoload -X’ within a shell function. For example, the following are equivalent:
myfunc() { autoload -X } myfunc args...
and
unfunction myfunc # if myfunc was defined autoload myfunc myfunc args...
In fact, the functions command outputs ‘builtin autoload -X’ as the body of an autoloaded function. This is done so that
eval "$(functions)"
produces a reasonable result. A true autoloaded function can be identified by the presence of the comment ‘# undefined’ in the body, because all comments are discarded from defined functions.
To load the definition of an autoloaded function myfunc without executing myfunc, use:
autoload +X myfunc
| [ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
If no name is given for a function, it is ‘anonymous’ and is handled specially. Either form of function definition may be used: a ‘()’ with no preceding name, or a ‘function’ with an immediately following open brace. The function is executed immediately at the point of definition and is not stored for future use. The function name is set to ‘(anon)’.
Arguments to the function may be specified as words following the closing brace defining the function, hence if there are none no arguments (other than $0) are set. This is a difference from the way other functions are parsed: normal function definitions may be followed by certain keywords such as ‘else’ or ‘fi’, which will be treated as arguments to anonymous functions, so that a newline or semicolon is needed to force keyword interpretation.
Note also that the argument list of any enclosing script or function is hidden (as would be the case for any other function called at this point).
Redirections may be applied to the anonymous function in the same manner as to a current-shell structure enclosed in braces. The main use of anonymous functions is to provide a scope for local variables. This is particularly convenient in start-up files as these do not provide their own local variable scope.
For example,
variable=outside function { local variable=inside print "I am $variable with arguments $*" } this and that print "I am $variable"
outputs the following:
I am inside with arguments this and that I am outside
Note that function definitions with arguments that expand to nothing, for example ‘name=; function $name { ... }’, are not treated as anonymous functions. Instead, they are treated as normal function definitions where the definition is silently discarded.
| [ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Certain functions, if defined, have special meaning to the shell.
| [ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
For the functions below, it is possible to define an array that has the same name as the function with ‘_functions’ appended. Any element in such an array is taken as the name of a function to execute; it is executed in the same context and with the same arguments as the basic function. For example, if $chpwd_functions is an array containing the values ‘mychpwd’, ‘chpwd_save_dirstack’, then the shell attempts to execute the functions ‘chpwd’, ‘mychpwd’ and ‘chpwd_save_dirstack’, in that order. Any function that does not exist is silently ignored. A function found by this mechanism is referred to elsewhere as a ‘hook function’. An error in any function causes subsequent functions not to be run. Note further that an error in a precmd hook causes an immediately following periodic function not to run (though it may run at the next opportunity).
Executed whenever the current working directory is changed.
If the parameter PERIOD is set, this function is executed every $PERIOD seconds, just before a prompt. Note that if multiple functions are defined using the array periodic_functions only one period is applied to the complete set of functions, and the scheduled time is not reset if the list of functions is altered. Hence the set of functions is always called together.
Executed before each prompt. Note that precommand functions are not re-executed simply because the command line is redrawn, as happens, for example, when a notification about an exiting job is displayed.
Executed just after a command has been read and is about to be executed. If the history mechanism is active (regardless of whether the line was discarded from the history buffer), the string that the user typed is passed as the first argument, otherwise it is an empty string. The actual command that will be executed (including expanded aliases) is passed in two different forms: the second argument is a single-line, size-limited version of the command (with things like function bodies elided); the third argument contains the full text that is being executed.
Executed when a history line has been read interactively, but before it is executed. The sole argument is the complete history line (so that any terminating newline will still be present).
If any of the hook functions returns status 1 (or any non-zero value other than 2, though this is not guaranteed for future versions of the shell) the history line will not be saved, although it lingers in the history until the next line is executed, allowing you to reuse or edit it immediately.
If any of the hook functions returns status 2 the history line will be saved on the internal history list, but not written to the history file. In case of a conflict, the first non-zero status value is taken.
A hook function may call ‘fc -p ...’ to switch the history context so that the history is saved in a different file from the that in the global HISTFILE parameter. This is handled specially: the history context is automatically restored after the processing of the history line is finished.
The following example function works with one of the options INC_APPEND_HISTORY or SHARE_HISTORY set, in order that the line is written out immediately after the history entry is added. It first adds the history line to the normal history with the newline stripped, which is usually the correct behaviour. Then it switches the history context so that the line will be written to a history file in the current directory.
zshaddhistory() { print -sr -- ${1%%$'\n'} fc -p .zsh_local_history }
Executed at the point where the main shell is about to exit normally. This is not called by exiting subshells, nor when the exec precommand modifier is used before an external command. Also, unlike TRAPEXIT, it is not called when functions exit.
| [ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
The functions below are treated specially but do not have corresponding hook arrays.
If defined and non-null, this function will be executed whenever the shell catches a signal SIGNAL, where NAL is a signal name as specified for the kill builtin. The signal number will be passed as the first parameter to the function.
If a function of this form is defined and null, the shell and processes spawned by it will ignore SIGNAL.
The return status from the function is handled specially. If it is zero, the signal is assumed to have been handled, and execution continues normally. Otherwise, the shell will behave as interrupted except that the return status of the trap is retained.
Programs terminated by uncaught signals typically return the status 128 plus the signal number. Hence the following causes the handler for SIGINT to print a message, then mimic the usual effect of the signal.
TRAPINT() { print "Caught SIGINT, aborting." return $(( 128 + $1 )) }
The functions TRAPZERR, TRAPDEBUG and TRAPEXIT are never executed inside other traps.
If the option DEBUG_BEFORE_CMD is set (as it is by default), executed before each command; otherwise executed after each command. See the description of the trap builtin in Shell Builtin Commands for details of additional features provided in debug traps.
Executed when the shell exits, or when the current function exits if defined inside a function. The value of $? at the start of execution is the exit status of the shell or the return status of the function exiting.
Executed whenever a command has a non-zero exit status. However, the function is not executed if the command occurred in a sublist followed by ‘&&’ or ‘||’; only the final command in a sublist of this type causes the trap to be executed. The function TRAPERR acts the same as TRAPZERR on systems where there is no SIGERR (this is the usual case).
The functions beginning ‘TRAP’ may alternatively be defined with the trap builtin: this may be preferable for some uses. Setting a trap with one form removes any trap of the other form for the same signal; removing a trap in either form removes all traps for the same signal. The forms
TRAPNAL() { # code }
(’function traps’) and
trap ' # code ' NAL
(’list traps’) are equivalent in most ways, the exceptions being the following:
| [ << ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
This document was generated on April 26, 2019 using texi2html 5.0.
Zsh version 5.7.1, released on February 3, 2019.