|
Game of life
2.3
|
Go to the source code of this file.
Data Structures | |
| struct | cell_info |
| This struct is used to store invidual cell info. More... | |
Macros | |
| #define | ROWS 50 |
| #define | COLUMNS 100 |
| #define | FILL_PERCENTAGE 30 |
| #define | NORTH map [i-1][j].current_status |
| #define | SOUTH map [i+1][j].current_status |
| #define | EAST map [i][j+1].current_status |
| #define | WEST map [i][j-1].current_status |
| #define | NORTHEAST map [i-1][j+1].current_status |
| #define | SOUTHEAST map [i+1][j+1].current_status |
| #define | NORTHWEST map [i-1][j-1].current_status |
| #define | SOUTHWEST map [i+1][j-1].current_status |
| #define | SNAKE_NORTH map [i-1][j].snake_head |
| #define | SNAKE_SOUTH map [i+1][j].snake_head |
| #define | SNAKE_EAST map [i][j+1].snake_head |
| #define | SNAKE_WEST map [i][j-1].snake_head |
| #define | SNAKE_NORTHEAST map [i-1][j+1].snake_head |
| #define | SNAKE_SOUTHEAST map [i+1][j+1].snake_head |
| #define | SNAKE_NORTHWEST map [i-1][j-1].snake_head |
| #define | SNAKE_SOUTHWEST map [i+1][j-1].snake_head |
| #define | SNAKE_BODY_NORTH map [i-1][j].snake_body |
| #define | SNAKE_BODY_SOUTH map [i+1][j].snake_body |
| #define | SNAKE_BODY_EAST map [i][j+1].snake_body |
| #define | SNAKE_BODY_WEST map [i][j-1].snake_body |
| #define | SNAKE_BODY_NORTHEAST map [i-1][j+1].snake_body |
| #define | SNAKE_BODY_SOUTHEAST map [i+1][j+1].snake_body |
| #define | SNAKE_BODY_NORTHWEST map [i-1][j-1].snake_body |
| #define | SNAKE_BODY_SOUTHWEST map [i+1][j-1].snake_body |
| #define | EGG_NORTH map [i-1][j].egg |
| #define | EGG_SOUTH map [i+1][j].egg |
| #define | EGG_EAST map [i][j+1].egg |
| #define | EGG_WEST map [i][j-1].egg |
| #define | EGG_NORTHEAST map [i-1][j+1].egg |
| #define | EGG_SOUTHEAST map [i+1][j+1].egg |
| #define | EGG_NORTHWEST map [i-1][j-1].egg |
| #define | EGG_SOUTHWEST map [i+1][j-1].egg |
| #define | UNDERPOPULATION_LIMIT 2 |
| #define | OVERPOPULATION_LIMIT 3 |
| #define | REBIRTH_LIMIT 3 |
| #define | SNAKE_MAX_LEN 6 |
| #define | TIME_TO_HATCH 20 |
| #define | TIME_BETWEEN_REBIRTH 0.5 |
| #define COLUMNS 100 |
Size of the map in x-direction
Definition at line 9 of file constants.h.
Referenced by copy_map(), debug_print(), Snake::destroy_snake(), draw_creatures(), draw_static(), map_filler(), map_reader(), map_saver(), menu_function(), and update_life().
| #define EAST map [i][j+1].current_status |
Defines east direction for current.status
Definition at line 19 of file constants.h.
Referenced by update_life().
| #define EGG_EAST map [i][j+1].egg |
Defines east direction for egg
Definition at line 70 of file constants.h.
Referenced by update_life().
| #define EGG_NORTH map [i-1][j].egg |
Defines north direction for egg
Definition at line 66 of file constants.h.
Referenced by update_life().
| #define EGG_NORTHEAST map [i-1][j+1].egg |
Defines northeast direction for egg
Definition at line 74 of file constants.h.
Referenced by update_life().
| #define EGG_NORTHWEST map [i-1][j-1].egg |
Defines northwest direction for egg
Definition at line 78 of file constants.h.
Referenced by update_life().
| #define EGG_SOUTH map [i+1][j].egg |
Defines south direction for egg
Definition at line 68 of file constants.h.
Referenced by update_life().
| #define EGG_SOUTHEAST map [i+1][j+1].egg |
Defines southeast direction for egg
Definition at line 76 of file constants.h.
Referenced by update_life().
| #define EGG_SOUTHWEST map [i+1][j-1].egg |
Defines southwest direction for egg
Definition at line 80 of file constants.h.
Referenced by update_life().
| #define EGG_WEST map [i][j-1].egg |
Defines west direction for egg
Definition at line 72 of file constants.h.
Referenced by update_life().
| #define FILL_PERCENTAGE 30 |
Random fill percentage when generating random map
Definition at line 11 of file constants.h.
Referenced by random_value_filler().
| #define NORTH map [i-1][j].current_status |
Defines north direction for current.status
Definition at line 15 of file constants.h.
Referenced by update_life().
| #define NORTHEAST map [i-1][j+1].current_status |
Defines northeast direction for current.status
Definition at line 23 of file constants.h.
Referenced by update_life().
| #define NORTHWEST map [i-1][j-1].current_status |
Defines northwest direction for current.status
Definition at line 27 of file constants.h.
Referenced by update_life().
| #define OVERPOPULATION_LIMIT 3 |
Kills creature if there's more neighbours than the limit
Definition at line 86 of file constants.h.
Referenced by update_life().
| #define REBIRTH_LIMIT 3 |
How many empty cells there has to be for a new creature to born
Definition at line 88 of file constants.h.
Referenced by update_life().
| #define ROWS 50 |
Size of the map in y-direction
Definition at line 7 of file constants.h.
Referenced by copy_map(), debug_print(), Snake::destroy_snake(), draw_creatures(), draw_static(), map_filler(), map_reader(), map_saver(), menu_function(), Snake::move_snake(), print_count(), print_stats(), and update_life().
| #define SNAKE_BODY_EAST map [i][j+1].snake_body |
Defines east direction for snake_body
Definition at line 53 of file constants.h.
Referenced by update_life().
| #define SNAKE_BODY_NORTH map [i-1][j].snake_body |
Defines north direction for snake_body
Definition at line 49 of file constants.h.
Referenced by update_life().
| #define SNAKE_BODY_NORTHEAST map [i-1][j+1].snake_body |
Defines northeast direction for snake_body
Definition at line 57 of file constants.h.
Referenced by update_life().
| #define SNAKE_BODY_NORTHWEST map [i-1][j-1].snake_body |
Defines northwest direction for snake_body
Definition at line 61 of file constants.h.
Referenced by update_life().
| #define SNAKE_BODY_SOUTH map [i+1][j].snake_body |
Defines south direction for snake_body
Definition at line 51 of file constants.h.
Referenced by update_life().
| #define SNAKE_BODY_SOUTHEAST map [i+1][j+1].snake_body |
Defines southeast direction for snake_body
Definition at line 59 of file constants.h.
Referenced by update_life().
| #define SNAKE_BODY_SOUTHWEST map [i+1][j-1].snake_body |
Defines southwest direction for snake_body
Definition at line 63 of file constants.h.
Referenced by update_life().
| #define SNAKE_BODY_WEST map [i][j-1].snake_body |
Defines west direction for snake_body
Definition at line 55 of file constants.h.
Referenced by update_life().
| #define SNAKE_EAST map [i][j+1].snake_head |
Defines east direction for snake_head
Definition at line 36 of file constants.h.
Referenced by update_life().
| #define SNAKE_MAX_LEN 6 |
Maximum length for the snake
Definition at line 90 of file constants.h.
Referenced by Snake::move_snake(), and Snake::set_head_location().
| #define SNAKE_NORTH map [i-1][j].snake_head |
Defines north direction for snake_head
Definition at line 32 of file constants.h.
Referenced by update_life().
| #define SNAKE_NORTHEAST map [i-1][j+1].snake_head |
Defines northeast direction for snake_head
Definition at line 40 of file constants.h.
Referenced by update_life().
| #define SNAKE_NORTHWEST map [i-1][j-1].snake_head |
Defines northwest direction for snake_head
Definition at line 44 of file constants.h.
Referenced by update_life().
| #define SNAKE_SOUTH map [i+1][j].snake_head |
Defines south direction for snake_head
Definition at line 34 of file constants.h.
Referenced by update_life().
| #define SNAKE_SOUTHEAST map [i+1][j+1].snake_head |
Defines southeast direction for snake_head
Definition at line 42 of file constants.h.
Referenced by update_life().
| #define SNAKE_SOUTHWEST map [i+1][j-1].snake_head |
Defines southwest direction for snake_head
Definition at line 46 of file constants.h.
Referenced by update_life().
| #define SNAKE_WEST map [i][j-1].snake_head |
Defines west direction for snake_head
Definition at line 38 of file constants.h.
Referenced by update_life().
| #define SOUTH map [i+1][j].current_status |
Defines south direction for current.status
Definition at line 17 of file constants.h.
Referenced by update_life().
| #define SOUTHEAST map [i+1][j+1].current_status |
Defines southeast direction for current.status
Definition at line 25 of file constants.h.
Referenced by update_life().
| #define SOUTHWEST map [i+1][j-1].current_status |
Defines southwest direction for current.status
Definition at line 29 of file constants.h.
Referenced by update_life().
| #define TIME_BETWEEN_REBIRTH 0.5 |
| #define TIME_TO_HATCH 20 |
Snake egg hatching time
Definition at line 92 of file constants.h.
Referenced by Snake::hatch_egg().
| #define UNDERPOPULATION_LIMIT 2 |
Kills creature if there's less neighbours than the limit
Definition at line 84 of file constants.h.
Referenced by update_life().
| #define WEST map [i][j-1].current_status |
Defines west direction for current.status
Definition at line 21 of file constants.h.
Referenced by update_life().


| 1 | /* | |
| 2 | * Copyright 2016 Google Inc. | |
| 3 | * | |
| 4 | * Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except | |
| 5 | * in compliance with the License. You may obtain a copy of the License at | |
| 6 | * | |
| 7 | * http://www.apache.org/licenses/LICENSE-2.0 | |
| 8 | * | |
| 9 | * Unless required by applicable law or agreed to in writing, software distributed under the License | |
| 10 | * is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express | |
| 11 | * or implied. See the License for the specific language governing permissions and limitations under | |
| 12 | * the License. | |
| 13 | */ | |
| 14 | ||
| 15 | package com.google.googlejavaformat.java.filer; | |
| 16 | ||
| 17 | import static com.google.common.base.Preconditions.checkNotNull; | |
| 18 | ||
| 19 | import com.google.common.io.CharSink; | |
| 20 | import com.google.common.io.CharSource; | |
| 21 | import com.google.googlejavaformat.java.Formatter; | |
| 22 | import com.google.googlejavaformat.java.FormatterException; | |
| 23 | import java.io.IOException; | |
| 24 | import java.io.Writer; | |
| 25 | import javax.annotation.processing.Messager; | |
| 26 | import javax.tools.Diagnostic; | |
| 27 | import javax.tools.ForwardingJavaFileObject; | |
| 28 | import javax.tools.JavaFileObject; | |
| 29 | import org.checkerframework.checker.nullness.qual.Nullable; | |
| 30 | ||
| 31 | /** A {@link JavaFileObject} decorator which {@linkplain Formatter formats} source code. */ | |
| 32 | final class FormattingJavaFileObject extends ForwardingJavaFileObject<JavaFileObject> { | |
| 33 | /** A rough estimate of the average file size: 80 chars per line, 500 lines. */ | |
| 34 | private static final int DEFAULT_FILE_SIZE = 80 * 500; | |
| 35 | ||
| 36 | private final Formatter formatter; | |
| 37 | private final Messager messager; | |
| 38 | ||
| 39 | /** | |
| 40 | * Create a new {@link FormattingJavaFileObject}. | |
| 41 | * | |
| 42 | * @param delegate {@link JavaFileObject} to decorate | |
| 43 | * @param messager to log messages with. | |
| 44 | */ | |
| 45 | FormattingJavaFileObject( | |
| 46 | JavaFileObject delegate, Formatter formatter, @Nullable Messager messager) { | |
| 47 | super(checkNotNull(delegate)); | |
| 48 | this.formatter = checkNotNull(formatter); | |
| 49 | this.messager = messager; | |
| 50 | } | |
| 51 | ||
| 52 | @Override | |
| 53 | public Writer openWriter() throws IOException { | |
| 54 | final StringBuilder stringBuilder = new StringBuilder(DEFAULT_FILE_SIZE); | |
| 55 |
1
1. openWriter : mutated return of Object value for com/google/googlejavaformat/java/filer/FormattingJavaFileObject::openWriter to ( if (x != null) null else throw new RuntimeException ) → KILLED |
return new Writer() { |
| 56 | @Override | |
| 57 | public void write(char[] chars, int start, int end) throws IOException { | |
| 58 |
1
1. write : Replaced integer subtraction with addition → NO_COVERAGE |
stringBuilder.append(chars, start, end - start); |
| 59 | } | |
| 60 | ||
| 61 | @Override | |
| 62 | public void write(String string) throws IOException { | |
| 63 | stringBuilder.append(string); | |
| 64 | } | |
| 65 | ||
| 66 | @Override | |
| 67 | public void flush() throws IOException {} | |
| 68 | ||
| 69 | @Override | |
| 70 | public void close() throws IOException { | |
| 71 | try { | |
| 72 |
1
1. close : removed call to com/google/googlejavaformat/java/Formatter::formatSource → KILLED |
formatter.formatSource( |
| 73 | CharSource.wrap(stringBuilder), | |
| 74 | new CharSink() { | |
| 75 | @Override | |
| 76 | public Writer openStream() throws IOException { | |
| 77 |
1
1. openStream : mutated return of Object value for com/google/googlejavaformat/java/filer/FormattingJavaFileObject$1$1::openStream to ( if (x != null) null else throw new RuntimeException ) → KILLED |
return fileObject.openWriter(); |
| 78 | } | |
| 79 | }); | |
| 80 | } catch (FormatterException e) { | |
| 81 | // An exception will happen when the code being formatted has an error. It's better to | |
| 82 | // log the exception and emit unformatted code so the developer can view the code which | |
| 83 | // caused a problem. | |
| 84 |
3
1. close : negated conditional → SURVIVED 2. close : removed call to java/io/Writer::close → SURVIVED 3. close : removed call to java/lang/Throwable::addSuppressed → SURVIVED |
try (Writer writer = fileObject.openWriter()) { |
| 85 | writer.append(stringBuilder.toString()); | |
| 86 |
2
1. close : negated conditional → SURVIVED 2. close : removed call to java/io/Writer::close → SURVIVED |
} |
| 87 |
1
1. close : negated conditional → KILLED |
if (messager != null) { |
| 88 |
1
1. close : removed call to javax/annotation/processing/Messager::printMessage → KILLED |
messager.printMessage(Diagnostic.Kind.NOTE, "Error formatting " + getName()); |
| 89 | } | |
| 90 | } | |
| 91 | } | |
| 92 | }; | |
| 93 | } | |
| 94 | } | |
Mutations | ||
| 55 |
1.1 |
|
| 58 |
1.1 |
|
| 72 |
1.1 |
|
| 77 |
1.1 |
|
| 84 |
1.1 2.2 3.3 |
|
| 86 |
1.1 2.2 |
|
| 87 |
1.1 |
|
| 88 |
1.1 |


The Basics of the Web and HTML!
Stage 0 gives an explaination of HTML and the use of markup tages are used
I have used some tags before without knowing what I was really doing taking instructions from co-workers for example href= "www.3c.org/html"HTML I am not sure if I did that one correctly but I will get plenty of practice by the end of class
"


--- layout: default title: "BLUE Internship Research Page" ---
This project was first imagined in the last few weeks of 2020, when the COVID-19 pandemic brought upon a “new wave” of anti-Asian racism. Chinatowns across North America faced overt acts of violence, especially against elders, and sudden drops in tourism which have endangered many independent, family-run businesses. In Montreal, there was discussion about whether Chinatown could “survive” the pandemic. Yet these developments are not new—Montreal Chinatown has long been threatened by racism, gentrification, displacement, and neglect. What would Chinatown look like if we imagined its future beyond survival? If we valued its historical and cultural significance like we did other areas of the city, like Old Montreal? If we centered the lives of its most marginalized residents? “Beyond Survival” hopes to accessibly generate conversations around these questions by exploring the past, present, and future of Chinatown.
Montreal Chinatown is located on unceded and unsurrendered land of the Kanien’kehá:ka Nation. This project wishes to avoid a flat narrative of oppression that denies or is uncritical of ongoing Indigenous dispossession. Though Asian-identified settlers have long been afflicted by processes of colonialism and imperialism, they too have contributed to Indigenous dispossession on Turtle Island and perpetuated anti-Indigenous racism. Too often, Asian demands for belonging in Canadian society have relied on nationalist sentiment; creating new narratives does not mean re-framing dominant “Canadian” stories to simply include Asian-settlers. Instead, we must contemplate the meanings of national identity, racial capitalism, land appropriation, and their disproportionate effects on the material conditions of racialized peoples. This project seeks a just future for Montreal Chinatown; a future that refuses displacement and gentrification; a future that foregrounds Asian-Indigenous solidarity. For example, the community spaces that this project proposes must also benefit Indigenous community members. Building solidarity is a long-term struggle, one that cannot be hastily solved by a land acknowledgement. Our resources and acknowledgements page includes a list of resources on Asian-Indigenous relations to build mutual understanding; with hope, a start to the road ahead.


railo-context.Component coldbox.system.ioc.Injector
A WireBox Injector: Builds the graphs of objects that make up your application.
| Constructor Summary | |
|---|---|
|
init([any binder='coldbox.system.ioc.config.DefaultBinder'], [any<struct> properties='[runtime expression]'], [any<Controller> coldbox=''])
Constructor. |
| Method Summary | |
|---|---|
any
|
autowire(any target, [any<Mapping> mapping], [any targetID=''], [any<Boolean> annotationCheck='false'])
I wire up target objects with dependencies either by mappings or a-la-carte autowires. |
private any
|
buildBinder(any binder, any properties)
Load a configuration binder object according to passed in type. |
any
|
buildInstance(any<Mapping> mapping, [any<struct> initArguments='[runtime expression]'])
Build an instance, this is called from registered scopes only as they provide locking and transactions. |
any
|
clearSingletons()
Clear the singleton cache. |
void
|
configure(any<Binder> binder, any<struct> properties)
Configure this injector for operation, called by the init(). |
private void
|
configureCacheBox(any<struct> config)
Configure a standalone version of cacheBox for persistence. |
private void
|
configureEventManager()
Configure a standalone version of a WireBox Event Manager. |
private void
|
configureLogBox(any configPath)
Configure a standalone version of logBox for logging. |
any<boolean>
|
containsInstance(any name)
Checks if this injector can locate a model instance or not. |
private void
|
doScopeRegistration()
Register this injector on a user specified scope. |
any<Binder>
|
getBinder()
Get the Injector's configuration binder object. |
any<Builder>
|
getBuilder()
Get the Injector's builder object. |
any<CacheFactory>
|
getCacheBox()
Get the instance of CacheBox linked in this Injector. |
any<Controller>
|
getColdbox()
Get the instance of ColdBox linked in this Injector. |
any
|
getEventManager()
Get the injector's event manager. |
any
|
getInjectorID()
Get the unique ID of this injector. |
any
|
getInstance([any name], [any dsl], [any<struct> initArguments='[runtime expression]'], [any targetObject=''])
Locates, Creates, Injects and Configures an object model instance. |
any<LogBox>
|
getLogBox()
Get the instance of LogBox configured for this Injector. |
any<BeanPopulator>
|
getObjectPopulator()
Get an object populator useful for populating objects from JSON,XML, etc. |
any<Injector>
|
getParent()
Get a reference to the parent injector instance, else an empty simple string meaning nothing is set. |
any
|
getScope(any scope)
Get a registered scope in this injector by name. |
any<struct>
|
getScopeRegistration()
Get the structure of scope registration information. |
any<struct>
|
getScopes()
Get all the registered scopes structure in this injector. |
any<ScopeStorage>
|
getScopeStorage()
Get the scope storage utility. |
any<Util>
|
getUtil()
Return the core util object. |
any
|
getVersion()
Get the Injector's version string. |
private void
|
injectTarget(any target, any propertyName, any propertyObject, any scope, any argName)
Inject a model object with dependencies via setters or property injections. |
any<boolean>
|
isCacheBoxLinked()
Checks if CacheBox is linked. |
any<boolean>
|
isColdBoxLinked()
Checks if Coldbox application context is linked. |
any
|
locateInstance(any name)
Tries to locate a specific instance by scanning all scan locations and returning the instantiation path. |
any<Injector>
|
locateScopedSelf()
Return a self reference using the scoped registration, mostly used by providers or scope widening objects. |
private void
|
processAfterCompleteDI(any targetObject, any DICompleteMethods)
Process after DI completion routines. |
private void
|
processInjection(any targetObject, any DIData, any targetID)
Process property and setter injection. |
private void
|
processMixins(any targetObject, any mapping)
Process mixins on the selected target. |
private void
|
processProviderMethods(any targetObject, any mapping)
Process provider methods on the selected target. |
any
|
registerDSL(any namespace, any path)
A direct way of registering custom DSL namespaces. |
private void
|
registerListeners()
Register all the configured listeners in the configuration file. |
any
|
registerNewInstance(any name, any instancePath)
Register a new requested mapping object instance thread safely and returns the mapping configured for this instance. |
private void
|
registerScopes()
Register all internal and configured WireBox Scopes. |
void
|
removeFromScope()
Remove the Injector from scope registration if enabled, else does nothing. |
void
|
setParent(any<Injector> injector)
Link a parent Injector with this injector. |
void
|
shutdown()
Shutdown the injector gracefully by calling the shutdown events internally. |
| Methods inherited from class railo-context.Component |
|---|
| None |
| Constructor Detail |
|---|
Constructor. If called without a configuration binder, then WireBox will instantiate the default configuration binder found in: coldbox.system.ioc.config.DefaultBinder
binder
- The WireBox binder or data CFC instance or instantiation path to configure this injector withproperties
- A structure of binding properties to passthrough to the Binder Configuration CFCcoldbox
- A coldbox application context that this instance of WireBox can be linked to, if not using it, we just ignore it.| Method Detail |
|---|
I wire up target objects with dependencies either by mappings or a-la-carte autowires
target
- The target object to wire upmapping
- The object mapping with all the necessary wiring metadata. Usually passed by scopes and not a-la-carte autowirestargetID
- A unique identifier for this target to wire up. Usually a class path or file path should do. If none is passed we will get the id from the passed target via introspection but it will slow down the wiringannotationCheck
- This value determines if we check if the target contains an autowire annotation in the cfcomponent tag: autowire=true|false, it will only autowire if that metadata attribute is set to true. The default is false, which will autowire anything automatically.Load a configuration binder object according to passed in type
binder
- The data CFC configuration instance, instantiation path or programmatic binder object to configure this injector withproperties
- A map of binding properties to passthrough to the Configuration CFCBuild an instance, this is called from registered scopes only as they provide locking and transactions
mapping
- The mapping to constructinitArguments
- The constructor structure of arguments to passthrough when initializing the instanceClear the singleton cache
Configure this injector for operation, called by the init(). You can also re-configure this injector programmatically, but it is not recommended.
binder
- The configuration binder object or path to configure this Injector instance withproperties
- A structure of binding properties to passthrough to the Configuration CFCConfigure a standalone version of cacheBox for persistence
config
- The cacheBox configuration data structureConfigure a standalone version of a WireBox Event Manager
Configure a standalone version of logBox for logging
configPath
- The logBox configuration path to useChecks if this injector can locate a model instance or not
containsInstance
in interface
IInjector
name
- The object name or alias to search for if this container can locate it or has knowledge of itRegister this injector on a user specified scope
Get the Injector's configuration binder object
Get the Injector's builder object
Get the instance of CacheBox linked in this Injector. Empty if using standalone version
Get the instance of ColdBox linked in this Injector. Empty if using standalone version
Get the injector's event manager
Get the unique ID of this injector
Locates, Creates, Injects and Configures an object model instance
getInstance
in interface
IInjector
name
- The mapping name or CFC instance path to try to build updsl
- The dsl string to use to retrieve the instance model object, mutually exclusive with 'name'initArguments
- The constructor structure of arguments to passthrough when initializing the instancetargetObject
- The object requesting the dependency, usually only used by DSL lookupsGet the instance of LogBox configured for this Injector
Get an object populator useful for populating objects from JSON,XML, etc.
Get a reference to the parent injector instance, else an empty simple string meaning nothing is set
getParent
in interface
IInjector
Get a registered scope in this injector by name
scope
- The name of the scopeGet the structure of scope registration information
Get all the registered scopes structure in this injector
Get the scope storage utility
Return the core util object
Get the Injector's version string.
Inject a model object with dependencies via setters or property injections
target
- The target that will be injected with dependenciespropertyName
- The name of the property to injectpropertyObject
- The object to injectscope
- The scope to inject a property into, if any else empty means it is a setter callargName
- The name of the argument to send if setter injectionChecks if CacheBox is linked
Checks if Coldbox application context is linked
Tries to locate a specific instance by scanning all scan locations and returning the instantiation path. If model not found then the returned instantiation path will be empty
name
- The model instance name to locateReturn a self reference using the scoped registration, mostly used by providers or scope widening objects
Process after DI completion routines
targetObject
- The target object to do some goodness onDICompleteMethods
- The array of DI completion methods to callProcess property and setter injection
targetObject
- The target object to do some goodness onDIData
- The DI data to usetargetID
- The target ID to process injectionsProcess mixins on the selected target
targetObject
- The target object to do some goodness onmapping
- The target mappingProcess provider methods on the selected target
targetObject
- The target object to do some goodness onmapping
- The target mappingA direct way of registering custom DSL namespaces
namespace
- The namespace you would like to registerpath
- The instantiation path to the CFC that implements this scope, it must have an init() method and implement: coldbox.system.ioc.dsl.IDSLBuilderRegister all the configured listeners in the configuration file
Register a new requested mapping object instance thread safely and returns the mapping configured for this instance
name
- The name of the mapping to registerinstancePath
- The path of the mapping to registerRegister all internal and configured WireBox Scopes
Remove the Injector from scope registration if enabled, else does nothing
Link a parent Injector with this injector
setParent
in interface
IInjector
injector
- A WireBox Injector to assign as a parent to this InjectorShutdown the injector gracefully by calling the shutdown events internally.
shutdown
in interface
IInjector


To create browser-compatible final output, we can use a package manager such as Webpack.
Webpack changes our development process to include a build step, which bundles all our libraries, packages, dependencies, etc. into static files that we can run in-browser as-is
Our HTML now only includes a single script called "bundle.js" which containst everything we need from our local collection of JavaScript files.
Test


Recipe 19.13. Fetching Large Record Sets from a Database with a GeneratorCredit: Christopher Prinos ProblemYou want to fetch a result set from a database (using the Python DB API) and easily iterate over each record in the result set. However, you don't want to use the DB cursor's method fetchall: it could consume a lot of memory and would force you to wait until the whole result set comes back before you can start iterating. SolutionA generator is the ideal solution to this problem: def fetchsome(cursor, arraysize=1000): ''' A generator that simplifies the use of fetchmany ''' while True: results = cursor.fetchmany(arraysize) if not results: break for result in results: yield result DiscussionIn applications that use the Python DB API, you often see code that goes somewhat like (where cursor is a DB API cursor object): cursor.execute('select * from HUGE_TABLE') for result in cursor.fetchall( ): doSomethingWith(result) This simple approach is "just" fine, as long as fetchall returns a small result set, but it does not work very well if the query result is very large. A large result set can take a long time to return. Also, cursor.fetchall( ) needs to allocate enough memory to store the entire result set in memory at once. Further, with this simple approach, the doSomethingWith function isn't going to get called until the entire query's result finishes coming over from the database to our program. An alternative approach is to rely on the cursor.fetchone method: for result in iter(cursor.fetchone, None): doSomethingWith(result) However, this alternative approach does not allow the database to optimize the fetching process: most databases can exhibit better efficiency when returning multiple records for a single query, rather than returning records one at a time as fetchone requires. To let your applications obtain greater efficiency than fetchone allows, without the risks of unbounded memory consumption and delay connected to the use of fetchall, Python's DB API's cursors also have a fetchmany method. However, the direct use of fetchmany makes your iterations somewhat more complicated than the simple for statements such as those just shown. For example: while True: results = cursor.fetchmany(1000) if not results: break for result in results: doSomethingWith(result) Python's generators are a great way to encapsulate complicated iteration logic so that application code can just about always loop with simple for statements. With this recipe's fetchsome generator, you get the same efficiencies and safeguards as with the native use of the fetchmany method in the preceding snippet but with the same crystal-clear simplicity as in the snippets that used either fetchall or fetchone, namely: for result in fetchsome(cursor): doSomethingWith(result) By default, fetchsome fetches up to 1,000 records at a time, but you can change that number, depending on your requirements. Optimal values can depend on schema, database type, choice of Python DB API module. In general, you're best advised to experiment with a few different values in your specific settings if you need to optimize this specific aspect. (Such experimentation is often a good idea for any optimization task.) This recipe is clearly an example of a more general case: a subsequence unbuncher generator that you can use when you have a sequence of subsequences (each subsequence being obtained through some call, and the end of the whole sequence being indicated by an empty subsequence) and want to flatten it into a simple, linear sequence of items. You can think of this unbunching task as the reverse of the sequence-bunching tasks covered earlier in Recipe 19.10 and Recipe 19.11, or as a simpler variant of the sequence-flattening task covered in Recipe 4.6. A generator for unbunching might be: def unbunch(next_subseq, *args): ''' un-bunch a sequence of subsequences into a linear sequence ''' while True: subseq = next_subseq(*args) if not subseq: break for item in subseq: yield item As you can see, the structure of unbunch is basically identical to that of the recipe's fetchsome. Usage would also be just about the same: for result in unbunch(cursor.fetchmany, 1000): doSomethingWith(result) However, while it is important and instructive to consider this kind of generalization, when you're writing applications you're often better off using specific generators that directly deal with your application's specific needs. In this case, for example, calling fetchsome(cursor) is more obvious and direct than calling unbunch(cursor.fetchmany, 1000), and fetchsome usefully hides the usage of fetchmany as well as the specific choice of 1,000 as the subsequence size to fetch at each step. See AlsoRecipe 19.10; Recipe 19.11; Recipe 4.6; Python's DB API is covered in Chapter 7 and in Python in a Nutshell. |


Mercury Rising A movie by Harold Becker Mit Bruce Willis, Miko Hughes, Alec Baldwin, Peter Stormare u.a.
9 year old autistic Simon (Miko Hughes) loves to solve all kinds of riddles. But who would suppose that his hobby can put him into mortal danger. One day, however, his caretaker gives him a riddle magazine that has one very special riddle - the solution of which is a top secret telephone number.
The American secret service has developed a new encryption code for correspondence with their foreign contacts. The code is supposedly unbreakable for computers, not to mention for the human brain. The programmers came up with the ultimate test for the code: they hid an encoded phone number in one of the riddles in a magazine. When the phone actually rings and a kid is on the other end a torrent of events is kicked loose that they can no longer control.
Lt. Nicholas Kudrow (Alec Baldwin) immediately gives the order to silence the kid and his parents once and for all. But Simon manages to escape the killers. FBI agent Art Jeffries (Bruce Willis) is put in charge of the case, and a frantic run for the boy's life begins.
Even if this time only one little boy's life is at stake and not the fate of the Earth as in THE FIFTH ELEMENT or ARMAGEDDON Bruce Willis is more convincing in his unusual part as involuntary nanny. The scenes with him and little Simon - very well portrayed by Miko Hughes - raise this movie slightly above the average. Art Jeffreys differs from John McClane of DIE HARD fame not only in that he doesn't sport a bloodstained undershirt, he also is not so excessivly tough and resorts to pills to calm his strained nerves. The man of steel seems to have some dents, or what else is to be made of that? He survives a fall out of a flying helicopter, though. So don't you worry, he's still invulnerable.
Jeffrey's adversary Kudrow is a very different type. Alec Baldwin is a good choice for the part.  Not a very likable guy. You can't help wishing for him to end up a grease spot. Considering that kids are never seriously harmed in Hollywood flicks and Bruce Willis always comes out on top you know full well who is going to be alive when the end credits are start rolling. Minor characters serve only to add some blood and noise to the action scenes. As far as suspense is concerned MERCURY RISING is no better than other movies of the kind.
The one riddle of the movie is Peter Stormare's short appearance, but you won't need a Cray computer to solve it. I can offer the following explanations: 1. It was a lifelong dream of his to fight on camera with Bruce Willis. 2. He had some very urgent bills to pay. 3. After everybody saw him in Spielberg's THE LOST WORLD he no longer believes that doing an action movie is bad for his image. His talent was completely wasted on MERCURY RISING, but the more famous names on the poster the more people will want to see the movie.
Miko Hughes turns in a great performance as the autistic boy. Apart from Bruce Willis, who simply does what he always does, Hughes is the real star of the movie and makes the viewers stick out till the very predictable ending.
No surprising plot twists or brilliant ideas, but easier to digest than ARMAGEDDON, where the Last Judgement turned out to be just a harmless shower of meteorites with a pompous prelude.
Homepage: Book and movie reviews http://sites.inka.de/darwin
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Home
About
Portfolio
Resume
Contact
Connect with Me!
<EMAIL_ADDRESS>www.linkedin.com/in/michelle-ma-905b3711b/


--- title: Home ---
I am a PhD student at the Computer Laboratory of the University of Cambridge where I have been working on Programming with effect hierarchies under the supervision of Alan Mycroft since October 2013. I am a member of the Programming, Logic, and Semantics Group, the Cambridge Programming Research Group, and Darwin College. I am an Associate Fellow of the Higher Education Academy.
From July 2017, I will be a Senior Teaching Fellow in the Department of Computer Science at the University of Warwick.
My research interests focus around the design and implementation of programming languages, including their type systems. I am particularly interested in languages which solve problems that larger and evolving software projects face, such as modularity and changing dependencies. To this end, I primarily work with Haskell and other functional programming languages. I am also interested in applying advances in programming languages to other fields, both within and outside of Computer Science.
I completed my BSc (Hons) in Computer Science at the University of Nottingham between September 2010 and October 2013. My dissertation deals with the design and implementation of a Haskell-like language with syntactic sugar for state monads. It was supervised by Graham Hutton. The code for the compiler is freely available on GitHub.
During my time at Nottingham, I wrote a book about automata theory, which eventually became a recommended text for the corresponding module there. It is freely available here.
In my spare time, I enjoy cooking, punting, and video games. I am currently the Admiral of the Punts at Darwin College.
You can find me on GitHub and I still help moderate the /r/UoN subreddit, which I founded in 2011.


Provision Your Client Node
The provisioning code for $$$NICKNAME$$$
is: $$$CODE$$$
Now run the following command and enter the provisioning code when asked:
$ ag-setup-solo [BASEDIR]
Then just follow the instructions. Thank you for provisioning an Agoric
Testnet Client Node!


Experience
Nothing ever becomes real 'til it is experienced.― John Keats
Work Experience
Volunteership
>
Mentorship


elevator_pitch.exe
taskkill floating_islands.exe
cd /situs_vulgaris
start elevator_pitch.exe
{% capture my_include %}{% include blurb/pitch-blurb.markdown %}{% endcapture %} {{ my_include | markdownify }}
taskkill floating_islands.exe
cd /situs_vulgaris
start elevator_pitch.exe


WITNESS LIST Ways & Means Committee March 5, 1997-4:00P HB 137 For: Rep. George West (himself) HB 197 For: Rep. George West (Himself) Rep. Glenn (Himself) HB 463 For: Jimmy Sylvia (himself) Rep. Zeb Zbranek (himself) Sarah Cerrone (herself) Against: Don Hansen (Tx Hotel/Motel Assoc.) Lucia Arrant (Tx Asc Convention & Vis) HB 526 For: Rep. John Shields (himself) HB 1281 For: Carlos Rubenstein (himself) John Wood (City of Brownsville) Paul Calapa (himself) Pete Gonzalez (himself) Rep. Rene Oliveira (himself) On: Mona Shoemate (Comptroller of Public A) HB 1411 For: Mary Beth McHale (MCI Telecommunication) Rep. Rene Oliveira (himself) Vaughn Aldredge (AT&T) HB 1424 For: Don Hansen (Tx Hotel/Motel Assoc.) Don Mafrige (City of Galveston) Peter J. LaValle (Galveston Co. M.U.D. #1) Rep. Pattricia Gray (herself)


Maria O’Sullivan, otherwise known as AltoHearts, is a software development and testing student, entrepeneur, artist, and gamer. She has a passion for creativity, innovation, and technology. At just 19, she cofounded a Software Development company named PolyWare Studios, and currently she owns and operates her own digital art business, AltoHearts Creations. Within the next year she looks forward to breaking into the tech industry, while selling her artwork on the side and traveling to conventions.
No Thoughts.
Only code.


system_mkfifo(3f) - [M_system:FILE_SYSTEM] make a FIFO special file relative to directory file descriptor (LICENSE:PD)
Synopsis
Description
Return Value
Examples
Author
License
function system_mkfifo(pathname,mode) result(ierr)
character(len=*),intent(in) :: pathname integer,intent(in) :: mode integer :: ierr
A regular pipe can only connect two related processes. It is created by a process and will vanish when the last process closes it.A named pipe, also called a FIFO for its behavior, can be used to connect two unrelated processes and exists independently of the processes; meaning it can exist even if no one is using it. A FIFO is created using the mkfifo() library function.
The mkfifo() function creates a new FIFO special file named by the pathname.
The file permission bits of the new FIFO are initialized from mode.
The file permission bits of the mode argument are modified by the process file creation mask.
When bits in mode other than the file permission bits are set, the effect is implementation-defined.
If path names a symbolic link, mkfifo() shall fail and set errno to [EEXIST].
The FIFOs user ID will be set to the process effective user ID.
The FIFOs group ID shall be set to the group ID of the parent directory or to the effective group ID of the process.
Implementations shall provide a way to initialize the FIFOs group ID to the group ID of the parent directory.
Implementations may, but need not, provide an implementation-defined way to initialize the FIFOs group ID to the effective group ID of the calling process.
Upon successful completion, mkfifo() shall mark for update the last data access, last data modification, and last file status change timestamps of the file.
Also, the last data modification and last file status change timestamps of the directory that contains the new entry shall be marked for update.
Predefined variables are typically used to set permission modes.
You can bytewise-OR together these variables to create the most common permissions mode:
User: R_USR (read), W_USR (write), X_USR(execute) Group: R_GRP (read), W_GRP (write), X_GRP(execute) Others: R_OTH (read), W_OTH (write), X_OTH(execute)Additionally, some shortcuts are provided (basically a bitwise-OR combination of the above):
Read + Write + Execute: RWX_U (User), RWX_G (Group), RWX_O (Others) DEFFILEMODE: Equivalent of 0666 =rw-rw-rw- ACCESSPERMS: Equivalent of 0777 = rwxrwxrwxTherefore, to give only the user rwx (read+write+execute) rights whereas group members and others may not do anything, you can use any of the following mkfifo() calls equivalently:
ierr= mkfifo("myfile", IANY([R_USR, W_USR, X_USR])); ierr= mkfifo("myfile", RWX_U);In order to give anyone any rights (mode 0777 = rwxrwxrwx), you can use any of the following calls equivalently:
ierr= mkfifo("myfile",& & IANY([R_USR,W_USR,X_USR,R_GRP,W_GRP,X_GRP,R_OTH,W_OTH,X_OTH])); ierr= mkfifo("myfile",IANY([RWX_U,RWX_G,RWX_O])); ierr= mkfifo("myfile",ACCESSPERMS);
Upon successful completion, return 0. Otherwise, return -1 and set errno to indicate the error. If -1 is returned, no FIFO is created.
The following example shows how to create a FIFO file named /home/cnd/mod_done, with read/write permissions for owner, and with read permissions for group and others.
program demo_system_mkfifo use M_system, only : system_mkfifo, system_perror !use M_system, only : R_GRP,R_OTH,R_USR,RWX_G,RWX_O !use M_system, only : RWX_U,W_GRP,W_OTH,W_USR,X_GRP,X_OTH,X_USR !use M_system, only : DEFFILEMODE, ACCESSPERMS use M_system, only : W_USR, R_USR, R_GRP, R_OTH implicit none integer :: status status = system_mkfifo("/tmp/buffer", IANY([W_USR, R_USR, R_GRP, R_OTH])) if(status.ne.0)then call system_perror(*mkfifo* error:) endif end program demo_system_mkfifoNow some other process (or this one) can read from /tmp/buffer while this program is running or after, consuming the data as it is read.
John S. Urban
Public Domain
| Nemo Release 3.1 | system_mkfifo (3) | July 22, 2023 |


sa = SampleAnnotation()
sa.sample = sample
sa.data = {"description": "LV-T350A&si-EZH2-3"}
sa.save()
return pj
sample_assoc.sample = sample
sample_assoc.save()
sample = Sample.objects.get(title="LV-T350A&si-EZH2-3")
sample.title = "ignoreme_for_description"
sample.accession_code = "ignoreme_for_description"
sample.save()


I first became interested in Sinicuichi when I read about it being used in conjunction with mescaline. It sounded like interesting stuff, so I ordered 2 ounces of it from an internet supplier of botanical curiosities. It arrived - long green leaves with a pleasant smell.
I researched various methods of ingesting the plant, and decided to make a tea out of approximately 10 grams of leaves. I put 5 grams of leaves into 2 mason jars and filled both jars to the top with boiling water. I then set them outside to sit in the sun for around a day and a half.
I drank the bitter brown liquid quickly. The first effects were apparent in around 10 minutes - I felt a feeling of calm, almost to the point of being sedated. I also felt a bit queasy, a feeling that would stay with me for some time. No other effects were noticeable for the duration of the trip.
In all, sinicuichi didn't do much for me, but I highly suspect that the tea that I made was weaker than it should have been. It was not unpalatable.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Add a new feed by supplying a resource. This should be an URL. If you ommit the protocol, "http://" is prefixed
Add a feed
Export all your feeds to a file
Export to file
Clearing all settings will remove all feeds and any settings specified.
Clear all feeds


In this, the writer’s new song,
We hear of an ordinary man
Who, stricken by ill fortune, just wants to get home
By whatever way he can.
Tipped to become a hit,
With its style, panache and wit,
You will find yourself just humming the tune,
So don’t go home without it!


Notes for Machine Learning - Week 6
Contents
Advice for Applying Machine Learning
Evaluating a Learning Algorithm
Deciding What to Try Next
Errors in your predictions can be troubleshooted by:
- Getting more training examples
- Trying smaller sets of features
- Trying additional features
- Trying adding polynomial features
- Increasing or decreasing $\lambda$
Don’t just pick one of these avenues at random. We’ll explore diagnostic techniques for choosing one of the above solutions in the following sections.
In the next few sections, We’ll first talk about how evaluate your learning algorithms and after that we’ll talk about some of these diagnostics which will hopefully let you much more effectively select more of the useful things to try mixing if your goal to improve the machine learning system.
Evaluating a Hypothesis
A hypothesis may have low error for the training examples but still be inaccurate (because of overfitting). And it may fail to generalize to new examples not in training set.
With a given dataset of training examples, we can split up the data into two sets: a training set and a test set. (normally 70% for training set and 30% for test set)
The training/testing procedure using these two sets is then:
Learn $\Theta$ and minimize $J_{train}(\Theta)$ using the training set
Compute the test set error $J_{test}(\Theta)$
For linear regression: $J_{test}(\Theta) = \dfrac{1}{2m_{test}} \sum_{i=1}^{m_{test}}(h_\Theta(x^{(i)}_{test}) - y^{(i)}_{test})^2$
For classification ~ Misclassification error (aka 0/1 misclassification error):
$err(h_\Theta(x),y) = \begin{cases} 1 & \mbox{if } h_\Theta(x) \geq 0.5\ and\ y = 0\ or\ h_\Theta(x) < 0.5\ and\ y = 1 \\ 0 & otherwise \end{cases}$
This gives us a binary 0 or 1 error result based on a misclassification.
The average test error for the test set is
$\text{Test Error} = \dfrac{1}{m_{test}} \sum^{m_{test}}_{i=1} err(h_\Theta(x^{(i)}_{test}), y^{(i)}_{test})$
- This gives us the proportion of the test data that was misclassified.
Model Selection and Train/Validation/Test Sets
Once parameters $\theta _0, \theta _1, \dots , \theta _4$ were fit to some set of data (training set), the error of the parameters as measured on that data (the training error $J(\theta)$ ) is likely to be lower than the actual generalization error.
- Just because a learning algorithm fits a training set well, that does not mean it is a good hypothesis.
- The error of your hypothesis as measured on the data set with which you trained the parameters will be lower than any other data set.
In order to choose the model of your hypothesis, you can test each degree of polynomial and look at the error result.
Without the Validation Set (bad method)
- Optimize the parameters in $\Theta$ using the training set for each polynomial degree.
- Find the polynomial degree d with the least error using the test set.
- Estimate the generalization error also using the test set with $J_{test}(\Theta^{(d)})$, (d = theta from polynomial with lower error);
In this case, we have trained one variable, d, or the degree of the polynomial, using the test set. I.e., our extra parameter is fit to the test set. This will cause our error value to be greater for any other set of data. Then the performance of the fitted model on the training set is not predictive of how well the hypothesis will generalize to new examples.
Use of the CV set
To solve this, we can introduce a third set, the Cross Validation Set (交叉验证集), to serve as an intermediate set that we can train d with. Then our test set will give us an accurate, non-optimistic error.
One example way to break down our dataset into the three sets is:
- Training set: 60%
- Cross validation set: 20%
- Test set: 20%
We can now calculate three separate error values for the three different sets.
With the Validation Set (note: this method presumes we do not also use the CV set for regularization)
- Optimize the parameters in $\Theta$ using the training set for each polynomial degree.
- Find the polynomial degree d with the least error using the cross validation set.
- Estimate the generalization error using the test set with $J_{test}(\Theta^{(d)})$, (d = theta from polynomial with lower error);
This way, the degree of the polynomial d has not been trained using the test set.
Be aware that using the CV set to select ’d’ means that we cannot also use it for the validation curve process of setting the lambda value.
Bias vs. Variance
Diagnosing Bias vs. Variance
We’ll examine the relationship between the degree of the polynomial $d$ and the underfitting or overfitting of our hypothesis.
- We need to distinguish whether bias (偏差) or variance (方差) is the problem contributing to bad predictions.
- High bias is underfitting and high variance is overfitting. We need to find a golden mean between these two.
The training error will tend to decrease as we increase the degree d of the polynomial.
At the same time, the cross validation error will tend to decrease as we increase d up to a point, and then it will increase as d is increased, forming a convex curve.
- High bias (underfitting): both $J_{train}(\Theta)$ and $J_{CV}(\Theta)$ will be high, and $J_{CV}(\Theta) \approx J_{train}(\Theta)$.
- High variance (overfitting): $J_{train}(\Theta)$ will be low but $J_{CV}(\Theta)$ will be high. And $J_{CV}(\Theta) \gg J_{train}(\Theta)$.
Regularization and Bias/Variance
The relationship of $\lambda$ to the training set and the variance set is as follows:
- Low $\lambda$ (High variance, overfitting): $J_{train}(\Theta)$ is low and $J_{CV}(\Theta)$ is high (high variance/overfitting).
- Intermediate λ: $J_{train}(\Theta)$ and $J_{CV}(\Theta)$ are somewhat low and Jtrain(Θ)≈JCV(Θ).
- Large $\lambda$ (High bias, underfitting): both $J_{train}(\Theta)$ and $J_{CV}(\Theta)$ will be high (underfitting/high bias)
- A large lambda heavily penalizes all the $\Theta$ parameters, which greatly simplifies the line of our resulting function, so causes underfitting.
In order to choose the model and the regularization $\lambda$, we need:
- Create a list of lambda (i.e. $\lambda \in {0,0.01,0.02,0.04,0.08,0.16,0.32,0.64,1.28,2.56,5.12,10.24}$);
- Select a lambda to compute;
- Create a model set like degree of the polynomial or others;
- Select a model to learn $\Theta$;
- Learn the parameter $\Theta$ for the model selected, using $J_{train}(\Theta)$ with $\lambda$ selected (this will learn $\Theta$ for the next step);
- Compute the train error using the learned $\Theta$ (computed with λ ) on the $J_{train}(\Theta)$ without regularization or $\lambda = 0$;
- Compute the cross validation error using the learned $\Theta$ (computed with λ) on the $J_{CV}(\Theta)$ without regularization or $\lambda = 0$;
- Do this for the entire model set and lambdas, then select the best combo that produces the lowest error on the cross validation set;
- Now if you need visualize to help you understand your decision, you can plot to the figure like above with: ($\lambda$ x Cost $J_{train}(\Theta)$) and ($\lambda$ x Cost $J_{CV}(\Theta)$);
- Now using the best combo $\Theta$ and $\lambda$, apply it on Jtest(Θ) to see if it has a good generalization of the problem.
- To help decide the best polynomial degree and $\lambda$ to use, we can diagnose with the learning curves, that is the next subject.
Learning Curves
Supposed we use $h_\theta(x) = \theta_0 + \theta_1x + \theta_2x^2$, it’s clear that when $m=1, 2, 3$, we’ll get $0$ errors because we can always find a quadratic curve that exactly touches given points.
- As the training set gets larger, the error for a quadratic function increases.
- The error value will plateau out after a certain m, or training set size.
High Bias
- Low training set size: $J_{train}(\Theta)$ will be low and $J_{CV}(\Theta)$ will be high.
- Large training set size: both $J_{train}(\Theta)$ and $J_{CV}(\Theta)$ will be high with $J_{train}(\Theta) \approx J_{CV}(\Theta)$.
If a learning algorithm is suffering from high bias, getting more training data will not (by itself) help much.
High Variance
- Low training set size: $J_{train}(\Theta)$ will be low and $J_{CV}(\Theta)$ will be high.
- Large training set size: $J_{train}(\Theta)$ increases with training set size and $J_{CV}(\Theta)$ continues to decrease without leveling off. Also, $J_{train}(\Theta) < J_{CV}(\Theta)$ but the difference between them remains significant.
If a learning algorithm is suffering from high variance, getting more training data is likely to help.


{{user.points}} points {{user.questions.length}} questions
Logout Sign in with Facebook
Welcome to Matigeni game. Please login to play game!


r3b00+
Score: 1
Captain: P.Nageswara Rao
Challenges solved
| category & points | name | solved at |
|---|---|---|
| 3dub 1 | badmedicine | 2013-06-16 06:29:55 UTC |
Members
- P.Nageswara Rao
- P.Anesh
- Santosh.Baswa
- Venkata Sateesh.Netti
- Naresh Chowdary.Kommuri
- anush0247
- vasu555
- braddbradd


- for statement
- do while
- while
- labeled statement
- break statement
- continue statement
- for…in statement
- for…of statement
Loops offer a quick and easy way to do something repeatedly.
for statement
do while
while
labeled statement
A label
provides a statement with an identifier that lets you refer to it elsewhere in your program(引用到别的位置).
The syntax:
label :
statement
For example, you can use a
label
to identify a loop, and then use thebreak
orcontinue
statements to indicate whether a program should interrupt the loop or continue its execution.
markLoop:
while (theMark == true) {
doSomething();
}
The label
markloop
identifies a while loop.
break statement
Use the break
statement to terminate a loop, switch, or in conjunction with (链接到) a labeled statement.
The syntax：
break;
break label;
The first form of the syntax terminates the innermost(最内层) enclosing loop or switch; the second form of the syntax terminates the specified enclosing labeled statement.
continue statement
The continue
statement can be used to restart a while
, do-while
, for
, or label statement
.
The syntax：
continue;
continue label;
Example
checkiandj:
while (i < 4) {
console.log(i);
i += 1;
checkj:
while (j > 4) {
console.log(j);
j -= 1;
if ((j % 2) == 0) {
continue checkj;
}
console.log(j + ' is odd.');
}
console.log('i = ' + i);
console.log('j = ' + j);
}
A statement labeled
checkiandj
contains a statement labeledcheckj
. Ifcontinue
is encountered, the program terminates the current iteration ofcheckj
and begins the next iteration.
If
continue
had a label ofcheckiandj
, the program would continue at the top of thecheckiandj
statement.(如果continue
只有一个label
标记，就会从标记循环语句的上面的代码执行)
for…in statement
The for...in
statement iterates a specified variable over all the enumerable properties(可枚举的属性) of an object.
The syntax：
for (variable in object){
statement;
}
for…of statement
The for...of
statement creates a loop Iterating over iterable objects (including Array
, Map
, Set
, arguments object and so on), invoking a custom iteration hook with statements to be executed for the value of each distinct property (对值的每一个独特的属性调用一个将被执行的自定义的和语句挂钩的迭代).
for (variable of object){
statement;
}
The difference of for … of and for … in
let arr = [3, 5, 7];
arr.foo = 'hello';
for (let i in arr) {
console.log(i); // logs "0", "1", "2", "foo"
}
for (let i of arr) {
console.log(i); // logs 3, 5, 7
}
}
While
for...in
iterates over property names(属性名), `for…of iterates over property values(属性值).


an Index
This is, in short, an index to all my creative content, and there's lots! We're still moving in, so expect a lot of missing content. The Creative section is divided into three large topical chunks:
Due to the rather interconnected nature of all the material that goes into here, all the pages are (or, at least, should be) heavily inter-linked, enabling easy navigation between topically close content. Practically speaking, all the conlangs I've thus far made exist in some sort of conworld, generally built around the languages, and as such practically nothing is left contextless in that way. Much of my writing, as well, is very much closely linked to the conworlds and conlangs I've made, and many of the stories have hyperlinks to relevant parts of other pages.
In the top right corner of the navbar you can find the general area (of the three large subdivisions above) that you're in, as well as the general page (or, in some cases, category of pages) you're on right now.


{% extends "vizlayout.html" %} {%block content%}
Labor Force Data by Age Group
Labor Force Data by Gender
Unemployment by Education
Wages - Salary vs. Benefits
Job Vacancies vs. Hires
Earnings by Degree - Bachelors (Top 20)
Earnings by Degree - Bachelors (Bottom 20)
Earnings by Degree - Masters
Earnings by Degree - Doctorate


How come there are no experiences with alcohol on here?!? I guess I'll be the first to educate some of you considering drinking.
This was my first actual experience recreationally using drugs (other than cigarettes). My parents didn't drink, so I couldn't get my hands on any beer, but they did keep two bottles of Seagrams 7 80 proof whiskey in the cabinet (and they never drank it, so I was in the clear for sneaking it away). I also have extremely strong willpower and my parents aren't drinkers so I figured that I didn't have much of a chance to become an alcoholic.
When I first poured myself a little cup, I nearly threw it up with one sip. I wasn't expecting this awful tasting, warm, burning liquid to tear my throat up. I threw the cup away, and put the liquor back. I didn't think it would be that bad ...
After talking with my friends, and telling them how bad it was, I was reassured that it would pay off if I got drunk. Well, me being the curious teenager, I decided to drink with the goal of getting drunk. I was going to do it, no matter what.
So, one night, I snuck a bottle up to my room, and poured myself a giant glass of it. I also brought up a cold glass of milk to try to get past some of that horrible taste. I swallowed one mouthful and managed to keep it down. I waited about five minutes (to settle the burning in my stomach and throat) and took another mouthful. Ugh ... I kept asking myself why I was doing this, and I kept in mind that it SHOULD be worth it. I soon finished the glass, returned the bottle/glasses and sat on my bed, watched some TV (wrestling. why? I have no idea) and waited for the effects to start.
About a half an hour into it, I started feeling a pleasant, buzzing feeling in my head. I thought that this would be it, but I was wrong. 45 Minutes into my buzz, It really started. My head started spinning, and my eyes were having trouble focusing and adjusting. It was basically like my brain was slowing down (which is what alcohol does). I was VERY comfortable, laying on my bed, swinging my head back and forth, watching my vision try to keep up with my movements. It was awesome. I didn't really have many physical effects, other than a slight numbing feeling on my skin. Most of it was my mind being slurred. I couldn't concentrate on the TV with all of these new sensations I was feeling (of course not).
I thought about all those drunks on TV that always stumble around, and thought it would be funny if I tried to walk. (note: I was laying down when I decided this, so I first had to sit up) When I thrust myself up, I couldn't stop, and fell over again. It was very hard to sit up straight without continuing over.  Like I said before, my vision lagged behind what I was actually doing, so I thought I was walking fine, but I was really falling all over the place. Awesome feeling.  I don't really know why, it was just funny. It was probably because I thought of what I was doing, and I probably thought it was funny as hell to be watching myself. I was mumbling, and laughing for about 15 minutes straight. After that, I started to compose myself. I felt the buzz wearing off now, but I was still kinda slow and 'dead headed'.
All in all, the whole experience lasted about 2 and a half hours. I loved it. I didn't really have any worries or thoughts about anything. It was a great experience. I didn't have a hangover the next day, there was no abnormal peeing or puking or whatnot ... although, when I told my friends that I downed a big glass of whiskey, they were shocked.
From this experience, I learned how come people actually become alcoholics (cause it's so damn fun/enjoyable). I've only been drunk about 5 times in 1999, and right now, there are two empty bottles of whiskey in my parents cabinet that I have to come up with a solution for (lol). Hopefully they won't find out until I'm 21 when I can reimburse them. :) Hope this has been useful.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


mren(1) mren(1) Name mren - rename an existing MSDOS file Note of warning This manpage has been automatically generated from mtools's texinfo docu‐ mentation, and may not be entirely accurate or complete. See the end of this man page for details. Description The mren command is used to rename or move an existing MS-DOS file or subdirectory. Its syntax is: mren [-voOsSrRA] sourcefile targetfile Mren renames an existing file on an MS-DOS file system. In verbose mode, Mren displays the new filename if the name supplied is invalid. If the first syntax is used (only one source file), and if the target name doesn't contain any slashes or colons, the file (or subdirectory) is renamed in the same directory, instead of being moved to the current mcd directory as would be the case with mmove. Unlike the MS-DOS version of REN, mren can be used to rename directories. See Also Mtools' texinfo doc Viewing the texi doc This manpage has been automatically generated from mtools's texinfo docu‐ mentation. However, this process is only approximative, and some items, such as crossreferences, footnotes and indices are lost in this transla‐ tion process. Indeed, these items have no appropriate representation in the manpage format. Moreover, not all information has been translated into the manpage version. Thus I strongly advise you to use the original texinfo doc. See the end of this manpage for instructions how to view the texinfo doc. * To generate a printable copy from the texinfo doc, run the follow‐ ing commands: ./configure; make dvi; dvips mtools.dvi * To generate a html copy, run: ./configure; make html A premade html can be found at `http://www.gnu.org/software/mtools/man‐ ual/mtools.html' * To generate an info copy (browsable using emacs' info mode), run: ./configure; make info The texinfo doc looks most pretty when printed or as html. Indeed, in the info version certain examples are difficult to read due to the quot‐ ing conventions used in info. mtools-4.0.17 29Jun11 mren(1)


55: def publish
56: @additional_exam_group = AdditionalExamGroup.find(params[:id])
57: @additional_exams = @additional_exam_group.additional_exams
58: @batch = @additional_exam_group.batch
59: @sms_setting_notice = ""
60: @no_exam_notice = ""
61: if params[:status] == "schedule"
62<EMAIL_ADDRESS>63: students.each do |s|
64: student_user = s.user
65: unless student_user.nil?
66: Reminder.create(:sender=> current_user.id,:recipient=>student_user.id,
67: :subject=>"Additional Exam Scheduled"<EMAIL_ADDRESS>has been scheduled
 Please view calendar for more details")
68: end
69: end
70: end
71: unless @additional_exams.empty?
72: AdditionalExamGroup.update( @additional_exam_group.id,:is_published=>true) if params[:status] == "schedule"
73: AdditionalExamGroup.update( @additional_exam_group.id,:result_published=>true) if params[:status] == "result"
74: sms_setting = SmsSetting.new()
75: if sms_setting.application_sms_active and sms_setting.exam_result_schedule_sms_active
76: students = @additional_exam_group.students
77: students.each do |s|
78: guardian = s.immediate_contact
79:
80: recipients = []
81: if s.is_sms_enabled
82: if sms_setting.student_sms_active
83: recipients.push s.phone2 unless s.phone2.nil?
84: end
85: if sms_setting.parent_sms_active
86: recipients.push guardian.mobile_phone unless guardian.mobile_phone.nil?
87: end
88: @message =<EMAIL_ADDRESS>exam Timetable has been published." if params[:status] == "schedule"
89: @message =<EMAIL_ADDRESS>exam result has been published." if params[:status] == "result"
90: unless recipients.empty?
91: sms = SmsManager.new(@message,recipients)
92: sms.send_sms
93: end
94: end
95: end
96: else
97: @conf = Configuration.available_modules
98: if @conf.include?('SMS')
99: @sms_setting_notice = "Exam schedule published, No sms was sent as Sms setting was not activated" if params[:status] == "schedule"
100: @sms_setting_notice = "Exam result published, No sms was sent as Sms setting was not activated" if params[:status] == "result"
101: else
102: @sms_setting_notice = "Exam schedule published" if params[:status] == "schedule"
103: @sms_setting_notice = "Exam result published" if params[:status] == "result"
104: end
105: end
106: if params[:status] == "result"
107: students = @additional_exam_group.students
108: students.each do |s|
109: student_user = s.user
110: Reminder.create(:sender=> current_user.id,:recipient=>student_user.id,
111: :subject=>"Result Published",
112: :body=>"#{ @additional_exam_group.name} result has been published
 Please view reports for your result")
113: end
114: end
115: else
116: @no_exam_notice = "Exam scheduling not done yet."
117: end
118: end


Util
class Util (View source)
Utility class.
Methods
Make a url, possibly prefixing a mount point.
Ensure that a url is valid.
Recursive array sort (sort by keys if possible, otherwise sort by values).
Json stringify some data.
Json stringify some data.
Create an assertion/expectation message for assertions.
Normalize an array of headers.
Normalize a header name.
Create a closure from a callable.
Remove the byte-order-mark from a string.
Details
at line 34
static string
applyMountPoint(string $pathOrUrl, string|null $mountPoint = null)
Make a url, possibly prefixing a mount point.
at line 57
static string
ensureValidUrl(string $url)
Ensure that a url is valid.
at line 79
static array
recursiveArraySort(array $array)
Recursive array sort (sort by keys if possible, otherwise sort by values).
at line 105
static string
toJson($data)
Json stringify some data.
at line 117
static string
toPrettyJson($data)
Json stringify some data.
at line 131
static string
makeExpectationMessage(string $message, mixed $expected, mixed $actual)
Create an assertion/expectation message for assertions.
at line 173
static array
normalizeHeaders(array $headers)
Normalize an array of headers.
Turns this:
[ 'HTTP/1.0 200 OK', 'Content-Type ' => ' application/json', 'x-foo-bar: thing', 'x-baz-bing: ', ]
into this: [ 'HTTP/1.0 200 OK', 'content-type' => 'application/json', 'x-foo-bar' => 'thing', 'x-foo-bing' => '', ]
at line 213
static string
normalizeHeaderName(string $headerName)
Normalize a header name.
content-type becomes Content-Type X-FOO-Bar becomes X-Foo-Bar
at line 234
static Closure
closureFromCallable(callable $callable)
Create a closure from a callable.
at line 254
static string
removeBom(string $str, string $outCharset = null, string $outEndian = null)
Remove the byte-order-mark from a string.


Practical Reverse Engineering Sample D
Overview
I will be reverse engineering Sample D from Practical Reverse Engineering
This includes answering questions about the sample from the book as well as looking into other parts of the sample (if found to be interesting)
You can grab the samples from here
Taking a glance
The first thing I want to check if the sample if intended for x86 or x64 using PEbear.
As shown, it is an x86 sample
Loading into IDA, there only 6 functions written by the author (excluding import calls), which is really nice (beginner kernel malware to start reverse engineering with)
Tackling the questions!
In the book on page 184, question 1 is as stated:
(Sample D)
Analyze and explain what the function 0x10001277 does.
Where does the second argument come from and can it ever be invalid?
What do the functions at offset 0x100012B0 and 0x100012BC do?
0x10001277
Whole function in IDA:
Let’s start at the top:
This part can be broken down into just two checks for dst and src.
if(MmIsAddressValid(dst) && MmIsAddressValid(src)) {
...
}
Afterwards,
The third argument is count, which has to be positive and src is subtracted from dst to get the offset.
if(count > 0) {
size_t offset = src - dst;
...
}
Lastly,
Use of [ecx + eax]
is essentially an array index to a pointer and afterwards, it the value is copied to the src pointer at an index.
Basically, an inline memcpy is implemented here.
This is done until esi is zero.
memcpy(src, dst, count);
Decompiled:
void sub_10001277(PVOID dst, PVOID src, size_t count)
{
if(MmIsAddressValid(dst) && MmIsAddressValid(src) && count) {
memcpy(src, dst, count);
}
}
Where does the second argument come from and can it ever be invalid?
Take a look at the xrefs:
The first two xrefs:
These both reference [edi + 0Ch]
. In the beginning of the function, IDA labels edi as Irp
.
What is at the offset at 0Ch of Irp?


© 2017-2023 Luna Wolf Studios LLC - Sheep Tag, and Sheep Tag 2 are registered trademarks of Luna Wolf Studios LLC. Privacy Policy | EULA


My site will be one page, and will consist of the following sections:
Welcome Header;
A one to two line introduction that clearly states my name and role as a Front end Developer who specializes in front end design. This welcome message will positioned to the side of a professional headshot of myself.
About Me sub header
This section will detail a little more about myself including where I am from, what I do, along with the skills that I can use to create engaging and accessible websites.
Portfolio section
I will include a carasoul style gallery of links to my other projects and sample material. I will include 4 - 6 links that the user can flip through. The user will be able to click the links and be taken to another page that inlcude my role and contribitions to each project along with text or icons that denote what technologies I used.
Contact
I plan to indluce a simple contact form that will include my professional email address along with additional links to professional social media profiles such as: Twitter, Facebook, and Instagram. I will also include a contact form that will allow a user to send me an email to get in touch.
Wireframes
I plan for this site to be responsive on small and large screens, along with the site maintaining one layout that will dynamically adjust to small and large screens.


--- layout: post title: Sync gmail, contacts and calendar with Thunderbird and Evolution date: '2012-02-12T03:36:00.027+09:00' author: tknv comments: true tags: - offlineimap - Thunderbird - linux - imap - evolution - dovecot - google modified_time: '2012-02-12T03:36:00.277+09:00' blogger_id: tag:blogger.com,1999:blog-2736766923155041598.post-4456405258919776427 blogger_orig_url: http://yet-another-problem.blogspot.com/2012/02/sync-gmail-contacts-and-calendar-with.html ---
some solutionsThere is solution for to sync gmail, contacts and calendar with Thunderbird and Evolution. But why need install that pims. We use browser already.同期にもcloud!


Sioux Falls Developers Group
We are software developers in the Sioux Falls, South Dakota area.
Meetups and Events
We meet up from time to time to talk about developer-related topics. Check out the Meetup.com group for more information. To propose a talk or topic, add an issue to the GitHub Meetups Repository


Yizhen Chen
Home
Sound Wave
Gallery
Send File
Blank
DIVMS
The University of Iowa
Follow
Twitter @Tonyforpeace
Facebook #Tony Chen


Javascript is considered harmful (you have to enable it to play the game, though)
1/1
Scores
Settings
Restart
Settings
Board size
12
18
24
Colors
4
6
8
Apply
High scores


SoCal Spring 2014: Program
Breakfast / Welcome (9:15am–10:00am)
Session 1 (10:00am–11:00am)
- The Challenges of Attaining Grace (at least in a language definition)
- Andrew Black (Portland State University), Kim Bruce (Pomona College),
Michael Homer (Victoria University of Wellington), James Noble
(Victoria University of Wellington)
- Typed Self-Interpretation
- Matt Brown (UCLA), Jens Palsberg(UCLA)
- A Relaxed Consistency based DSM for Asynchronous Parallelism
- Keval Vora (UC Riverside), Sai Charan Koduru (UC Riverside),
Rajiv Gupta (UC Riverside)
Break (11:00–11:30am)
Session 2 (11:30am–12:30pm)
- Automatic Fault Localization for Data Structures
- Vineet Singh (UC Riverside), Rajiv Gupta (UC Riverside),
Iulian Neamtiu (UC Riverside)
- SafeDispatch: An Extended C++ Compiler for Securing C++ Virtual Calls from Memory Corruption Attacks
- Dongseok Jang (UC San Diego), Zachary Tatlock (University of Washington),
Sorin Lerner (UC San Diego)
- Type-based Verification of Linked Data Structures
- Alexander Bakst (UC San Diego), Ranjit Jhala (UC San Diego)
Lunch (12:30pm–2:00pm)
Session 3 (2:00pm–3:00pm)
- Liquid Types for Haskell
- Niki Vazou (UC San Diego), Eric L. Seidel (UC San Diego),
Ranjit Jhala (UC San Diego)
- Language Fuzzing Using Constraint Logic Programming
- Kyle Dewey (UC Santa Barbara), Jared Roesch (UC Santa Barbara),
Ben Hardekopf (UC Santa Barbara)
- Automating Formal Proofs for Reactive Systems
- Daniel Ricketts (UC San Diego), Valentin Robert (UC San Diego),
Dongseok Jang (UC San Diego), Zachary Tatlock (University of Washington),
Sorin Lerner (UC San Diego)
Break (3:00pm–3:30pm)
Session 4: (3:30pm–4:30pm)
- PERF-BLOWER: A Novel Performance Testing Framework based on Virtual Amplification
- Lu Fang (UC Irvine), Liang Dou (UC Irvine), Guoqing Xu (UC Irvine)
- CuSha: Vertex-Centric Graph Processing on GPUs
- Farzad Khorasani (UC Riverside), Keval Vora (UC Riverside),
Rajiv Gupta (UC Riverside), Laxmi N. Bhuyan (UC Riverside)
- FACADE: A Compiler and Runtime for (Almost) Object-Bounded Big Data Applications
- Khanh Nguyen (UC Irvine), Guoqing Xu (UC Irvine), Kai Wang (UC Irvine),
Yingyi Bu (UC Irvine), Lu Fang (UC Irvine), Jianfei Hu (UC Irvine)
Business Meeting / Wrapup: 4:30pm–5pm


Grid
Since v3.0 Codebase has included a responsive, fluid, real CSS Grid grid-system.
On this page:
With the arrival of grid to CSS, web developer thought leaders such as Rachel Andrew have argued persuasively that there is no need for a CSS grid-based grid system – because you can create your own, directly in your CSS.
But you may find Codebase’s CSS grid system handy, anyhow!
As with all Codebase class-builder units, if you don’t want this in your outputted codebase.css
you can toggle it to false in codebase/scss/01_basics/__default-variables.scss
SCSS:
$include-css-grid: true !default;
Grid System Features
- Unlike the traditional (columnar) 12 column grid systems based on floats or flexbox, with the Codebase grid you get to choose how many columns and rows you need for your layout: 2, 3, or 4 (max). That’s everything up to a 4×4 grid.
- This versatility covers the majority of use cases. But if you really need more (e.g. you need 5 or 6 columns), then you can increase the
$grid-max-cols
and$grid-max-rows
variables in the SCSS. (Don’t go too high here, because that could massively increase your outputted CSS from the SCSS preprocessor loops.) - By default, the grid area (grid cell) widths and are flexible – where they are depends on how much content you have in each area. But where necessary, you can do a “distribute columns evenly” by applying grid equalize classes.
- This versatility covers the majority of use cases. But if you really need more (e.g. you need 5 or 6 columns), then you can increase the

a

b

a

b

c

a

b

c

d

e

f

g

- Three grid systems are included:
- Default – use this if you need a grid layout at all viewport widths.
-md
becomes effective at minimum 768px viewport width.-lg
becomes effective at minimum 1024px viewport width.
- Per grid-item justification and alignment.
- Nestable.
- RTL and LTR languages are supported.
- No need for any of that offseting, push-pulling and re-ordering stuff you may be used to, if you’ve used float and flexbox grids. Instead, you can intuitively position your grid items wherever you want.
- You can even use the grid in three dimensions – because grid items can be stacked by overlapping.
Fluid Grid Wrapper Classes
| All viewport widths: | Viewport widths >= 768px: |
Viewport widths >= 1024px: |
|---|---|---|
.grid |
.grid-md |
.grid-lg |
.grid
instantiates the grid layout. Add (one or more of) these classes to the wrapper block element (e.g. a

).
That may be all you need, for setting up the wrapper – if you are not interested in having equal column widths. By default, the grid’s widths (and heights) all self-adjust depending on the size or amount of content in grid items – a behavior similar to the way table columns and rows adjust to their content.
Adding a Gap Between Grid Items
An optional .grid-gap
adds a gap (gutter) in between grid items, both horizontally and vertically. This gap is equal to the margin-bottom
on headings, paragraphs, lists and tables (default).

First grid item

This is the second grid item with a lot of content

Third grid item

Additionally, if you wish to constrain the width of particular grid item(s), you can go ahead and specify their widths in your stylesheet (e.g. .sidebar {width: 200px;}
) or by an inline style (e.g. style="width: 200%"
).
Equalizing Column Widths
.grid-equalize-*
.grid-md-equalize-*
.grid-lg-equalize-*
The -equalize-*
modifier class is used to equalize column widths (at different media query widths) – similar to a “distribute columns evenly” function in a word processor or spreadsheet software. (Note: -equalize-*
only affects columns, not rows.)
With -equalize-*
columns will each equally expand to occupy the available grid wrapper width. So, two columns will have half-width each; three will have third-width; four will have quarter-width.
E.g. .grid.grid-md-equalize-4
sets a grid with 4 columns of equal span (constrained 25% each) that kicks in at 768px viewport width.
After you have populated the first row of the grid with item(s) that complete your required number of columns, you can sometimes get away with not specifying the positioning of subsequent grid items – the browser will figure out where to place them.
Grid-Item Classes
| All viewport widths: | Viewport widths >= 768px: |
Viewport widths >= 1024px: |
|---|---|---|
|
|
|
Column Tracking
Multiple permutations, e.g:
.col-md-1
– item occupies a position in column 1 only..col-md-2-3
– item spans columns 2-3 (i.e. starts at column track 2 and ends at column track 4)..col-md-3-4
– item spans columns 3-4 ( i.e. starts at column track 3 and ends at column track 5).
Row Tracking
Multiple permutations, e.g:
.row-3
– item occupies a position in row 3 only..row-md-1-2
– item spans columns 1-2 (i.e. starts at row track 1 and ends at row track 3)..row-md-2-3
– item spans rows 2-3 (i.e. starts at row track 2 and ends at row track 4).
Note: while you are building your your grid, rows may sometimes not appear to span correctly. E.g. if you have an item that spans multiple rows but you haven’t placed anything else on that row yet, your tall item may not appear to be tall enough (unless you place a lot of content in it). But when you add your other grid items, your layout will all take the shape that you want.
Justification (horizontal)
Within a grid area (which may span multiple columns) – multiple permutations, e.g:
.justify-md-left
.justify-md-right
.justify-md-center
.justify-md-stretch
(default; you only need this if you unstretched it at a smaller viewport width)
Alignment (vertical)
Within a grid area (which may span multiple rows) – multiple permutations, e.g:
.align-md-top
.align-md-bottom
.align-md-center
.align-md-stretch
(default; you only need this if you unstretched it at a smaller viewport width)
Using the Grid System
Here’s what you actually do:
- Use
.grid
to instantiate your grid.- Optional: use
.grid-gap
if you need a gap between grid items. - Optional: use
.grid-*-equalize-*
if you need to constrain the grid layout to equal-width columns.
- Optional: use
- Place your items on the grid, according to their start and end tracks for
.col-*
and.row-*
(at what viewport width you require). - Optional: set
.justify-*
and.align-*
on an item within its grid area.
Do this for the default grid (as in the steps above) and/or for a grid that kicks in at md
or lg
.
Examples
Simple
This grid has 3 columns – on medium viewports and up. The first three grid items are used to define the layout. The remaining six items will wrap to a second and then a third row, all adopting the pattern set in the first row. Since the columns have not been equalized, column widths will expand or contract according to how much content they have.

First grid item

Second grid item

Third grid item

Fourth grid item

Fifth grid item

Sixth grid item

Seventh grid item

Eighth grid item

Ninth grid item

Row spanning
2 columns and 3 rows (on all viewports), with is a gap between columns. The first column will be occupied by the first grid item for its full height (spanning 3 rows). The second column will have 3 items on 3 rows. Column width had been equalized so that each column has half the available width.

First grid item

Second grid item

Third grid item

Fourth grid item

Easy Layout
Full width header and footer on all viewports. On medium viewports and up: main section left 2/3 width. Sidebar right 1/3 width. And there is a gap between columns.
Article
Lorem ipsum dolor sit amet, vis in blandit singulis, an unum doming facilisi vim. Facete aliquam bonorum id quo, ex labore tincidunt mel, usu no quod liberavisse. Ex sea dolorum insolens assueverit, sed ut harum latine dignissim. Vis cibo vidit ea, eu duo debet platonem explicari, pro ex graece meliore. Illum graeci inciderint mei et, ei decore nostro vim.

Header

Article

Sidebar nav
Footer

Complex Layout
Exemplifying grid nesting, column re-ordering and justifying.
Article

Header
Primary nav
Secondary nav

Article

Nested

Nested

Nested

Footer

Explanation:
- Header
- justified center on small viewports
- left ¼ width (beside primary nav) on medium viewports up
- Primary nav
- full width on small viewports
- right ¾ width (beside header) on medium viewports up
- Secondary nav
- full width on small viewports
- left ¼ width on medium viewports
- right ¼ width on large viewports
- Main article
- as full width block on small viewports
- right ¾ width on medium viewports
- left ¾ width on large viewports
Therefore, sidebar and main article switch places when going from medium to large viewports – exemplifying “column reordering”.
- Three nested items (within main article)
- stacked on small viewports
- in a row on medium viewports up
- Footer – full width but centered on all viewports
Grid CSS Classes
| Block (Wrapper) Class | Element Class |
|---|---|
.grid .grid-gap 1.grid-equalize-{1...4} 2
|
.col-{1...4}(-{2...4}) .row-{1...4}(-{2...4}) Horizontal alignment within grid areas: .justify-left .justify-center .justify-right .justify-stretch Vertical alignment within grid areas: .align-top .align-middle .align-bottom .justify-stretch |
.grid-md .grid-md-equalize-{1...4}
|
.col-{1...4}(-{2...4}) .row-{1...4}(-{2...4}) Horizontal alignment within grid areas: .justify-md-left .justify-md-center .justify-md-right .justify-md-stretch Vertical alignment within grid areas: .align-md-top .align-md-middle .align-md-bottom .justify-md-stretch |
.grid-lg .grid-lg-equalize-{1...4}
|
.col-{1...4}(-{2...4}) .row-{1...4}(-{2...4}) Horizontal alignment within grid areas: .justify-lg-left .justify-lg-center .justify-lg-right .justify-lg-stretch Vertical alignment within grid areas: .align-lg-top .align-lg-middle .align-lg-bottom .justify-lg-stretch |
1 It is assumed that if you want to use .grid-gap
, then you will want it to be applied at all viewport widths. (Thus, there is no .grid-md-gap
or .grid-lg-gap
)
2 {1...4}
can be 1, 2, 3 or 4.


| |
Methods defined here:
- __init__(self, words)
- Sets up classifyWords class
Initializes member variable of words, every word that needs
to be classified as adjective, noun, verb, etc.
:param words: a TextBlob object
- createWordDictionary(self)
- Creates a dictionary of dictionaries for each
generalized part of partsOfSpeech
:return: a dictionary of dictionaries
- getPOSList(self, arguments)
- Gets a list of a particular part of speech
:param arguments: a list of TextBlob parts of speech
:return: a list of words matching the arguments
- getPartOfSpeech(self, arguments)
- Takes arguments and returns a dict of those parts of speech
For example, if it takes ['singularNoun', 'pluralNoun']
It return a dict with two entries: singularNoun and pluralNoun
Each entry is a list of every singular noun and plural noun respectively
:param arguments: a list of part of speech arguments
:return: a dictionary of lists with an entry for each argument
Data descriptors defined here:
- __dict__
- dictionary for instance variables (if defined)
- __weakref__
- list of weak references to the object (if defined)
|


IPTABLES-XML(8) IPTABLES-XML(8) NAME iptables-xml — Convert iptables-save format to XML SYNOPSIS iptables-xml [-c] [-v] DESCRIPTION iptables-xml is used to convert the output of iptables-save into an eas‐ ily manipulatable XML format to STDOUT. Use I/O-redirection provided by your shell to write to a file. -c, --combine combine consecutive rules with the same matches but different tar‐ gets. iptables does not currently support more than one target per match, so this simulates that by collecting the targets from con‐ secutive iptables rules into one action tag, but only when the rule matches are identical. Terminating actions like RETURN, DROP, ACCEPT and QUEUE are not combined with subsequent targets. -v, --verbose Output xml comments containing the iptables line from which the XML is derived iptables-xml does a mechanistic conversion to a very expressive xml for‐ mat; the only semantic considerations are for -g and -j targets in order to discriminate between <call> <goto> and <nane-of-target> as it helps xml processing scripts if they can tell the difference between a target like SNAT and another chain. Some sample output is: <iptables-rules>
 <chain name="PREROUTING" policy="ACCEPT" packet-count="63436" byte- count="7137573"> <rule> <conditions> <match>
tcp
 </match> <tcp> <sport>8443</sport> </tcp> </conditions> <actions> <call> <check_ip/> </call> <ACCEPT/> </actions> </rule> </chain>
 </iptables-rules> Conversion from XML to iptables-save format may be done using the ipta‐ bles.xslt script and xsltproc, or a custom program using libxsltproc or similar; in this fashion: xsltproc iptables.xslt my-iptables.xml | iptables-restore BUGS None known as of iptables-1.3.7 release AUTHOR Sam Liddicott<EMAIL_ADDRESS>SEE ALSO iptables-save(8), iptables-restore(8), iptables(8) Jul 16, 2007 IPTABLES-XML(8)


Get
Webbed
Show the world what you do
Proudly have your business
the web!
Proudly have your business
the web!
Get Started
Suitable for:
Business & e-commerce websites, Religious pages, Blogs,
Event management services,
NGO's and Campus Organisations...
Business & e-commerce websites, Religious pages, Blogs,
Event management services,
NGO's and Campus Organisations...
Get Started
close


While open source is encouraged at Zalando, it is a small number of contributors who drives the majority of all open source contributions. Just 17 Zalando employees are responsible for 50% of all commits made, and 80% of all open sourced Zalando code is contributed by 50 employees.


Make your Firefox your own
It’s easier than ever to personalize Firefox and make it work the way
you do.
No other browser gives you so much choice and flexibility.
Designed to
be redesigned
Get fast and easy access to the features you use most in the new menu. Open the “Customize” panel to add, move or remove any button you want. Keep your favorite features — add-ons, private browsing, Sync and more — one quick click away.
 Choose from thousands of themes and dress up your browser with a single click.
Learn more
Add-ons
NextAdd-ons are like apps that you install to add features to Firefox. They let you compare prices, check the weather, listen to music, send a tweet and more.
- Read the latest news & blogs
- Manage your downloads
- Watch videos & view photos
Learn more
Awesome Bar
NextThe Awesome Bar learns as you browse to make your version of Firefox unique. Find and return to your favorite sites without having to remember a URL.
See what it can do for youKeep your Firefox in Sync
Access your bookmarks, history, passwords and more from any device to
make Firefox your own wherever you use it.
Get help with Sync


HOW IT WORKS
Create your own shirts and more in our online design studio.
Design Online
We've made it super easy to create your custom shirts with our Design Studio. Choose from thousands of original clipart and fonts or upload your own images.
Expertly Printed
Once you've designed your shirt you can leave the rest to us. We're experts at our trade and stand behind each and every shirt that leaves our facility.
Delivered To You
You've got too much to do to be worried about your t-shirts. We ship them directly to your door so you can use that time elsewhere.
WHY US
T-Shirt Experts
Today, we've perfected our process and are printing millions of shirts a year - each custom designed by you.
Amazing Service
Expect awesome service. Whether we’re printing custom tees, answering design questions or helping find shirts within your budget, our goal is to make you happy. Simple as that.
Unbelievably Fast
Just because our products are custom printed, we don't think you should wait weeks to get your order. In stock digital prints are out the door within 24 hours!
Our Promise
Customize with confidence, knowing the t-shirt you design will be the one that arrives on your doorstep. If it’s not absolutely perfect, we'll make it right.
SELECT YOUR SHIRT
Áo sơ mi nam
200.000 VND
Áo sơ mi nam
200.000 VND
Áo sơ mi nam
200.000 VND
Áo sơ mi nam
200.000 VND
Áo sơ mi nam
200.000 VND
Áo sơ mi nam
200.000 VND
Áo sơ mi nam
200.000 VND
Áo sơ mi nam
200.000 VND
Áo sơ mi nam
200.000 VND
Áo sơ mi nam
200.000 VND
Áo sơ mi nam
200.000 VND
Áo sơ mi nam
200.000 VND


I am a graduate in electrical engineering from Concordia University. I have studied in various subfields of electrical engineering such as electronics, digital systems design (VHDL), power electronics, digital signal processing, computer architecture, antennas, etc. I also have experience in programmimg languages such as C++, Java, HTML, etc.
I am a person who loves to learn and improve myself in all aspects. I love helping others and sharing my knowledge.
BEng in Electrical Engineering, 2018
Concordia University
Responsibilities include:
A bank system that uses boost serialization to store client information.
A system to guide the visually impaired on city streets