Limited-edition Jonas Brothers Coors Light six-packs now available in Tampa via goPuff
by WFTS Digital StaffTAMPA, Fla. — The Limited-edition bottles of Coors Light featuring a customized label from the Jonas Brothers are now available in Tampa.
In October, Joe, Kevin, and Nick announced they were brewing a special batch after being invited by Coors to its brewery in Golden while in Colorado on their Happiness Begins tour.
RECOMMENDED: ALDI offering beer, wine delivery to your home
The brothers’ have been fans of the beer for years. From Joe Jonas having custom-made Coors Light bottles at his wedding in France to Kevin Jonas making a cameo with Coors Light in the band's "Only Human" video.
"The limited edition Coors Light brewed with the Jonas Brothers is still the same refreshing Coors Light but what makes it truly special is that Nick, Kevin, and Joe played a part in brewing it and creating a custom bottle to celebrate the partnership," Coors Light said in a release.
You can buy the limited-edition Jonas Brothers Coors Light six-packs exclusively via goPuff’s site or iOS / Android app.


| Window {webdriver} | R Documentation |
A browser window
w <- s$getWindow() wlist <- s$getAllWindows() w$close() w$isActive() w$switchTo() w$maximize() w$getSize() w$setSize(width, height) w$getPosition() w$setPosition(x, y)
A Session
object.
A Window
object.
A list of Window
objects.
Integer scalar, requested width of the window.
Integer scalar, requested height of the window.
Integer scalar, requested horizontal window position.
Integer scalar, requested vertical window position.
The getWindow
method of a Session
object
returns the current browser window as a Window
object.
The getAllWindows
method returns a list of window objects,
all browser windows.
w$close()
closes the window.
w$isActive()
returns TRUE
if the window is active,
FALSE
otherwise.
w$switchTo
makes the window active.
w$maximize
maximizes the window. Currently it sets it to
a fixed size.
w$getSize
returns the size of the window, in a list with
elementh width
and height
, both integers.
w$setSize
sets the size of the window.
w$getPosition
returns the position of the window on the
screen. Phantom.js being headless, it always returns
list(x = 0, y = 0)
, and it is included to have a complete
impelementation of the WebDriver standard.
w$setPosition(x, y)
sets the position of the window on the
screen. Phantom.js being headless, it has no effect, and it is included
to have a complete implementation of the WebDriver standard.


Release notes for Kendo UI v2013.3.1324
Framework
DataSource
What's new
- Parse date literals with timezone offset
Globalization
What's new
- Update the Czech culture script
- Parse date literals with timezone offset
Web
What's fixed
- Kendo UI Popup position is not calculated correctly in IE11 when Favorites bar is docked
- Kendo UI Popup position is not calculated correctly in Google Chrome when page is zoomed
Editor
What's fixed
- Formatting tool dropdown items are unreadable with dark themes
Grid
What's new
- Add localizable tooltip to the pager [...] button
ListView
What's new
- Add localizable tooltip to the pager [...] button
PanelBar
What's fixed
- Empty template content triggers Ajax load even without URL
Scheduler
What's fixed
- Occurrences with hourly frequency are not positioned correctly
- Edit form delete button is not hidden if destroy is disabled
TreeView
What's fixed
- Changes to ObservableArray elements within dataItems are handled as nodes
DataViz
Chart
What's fixed
- A JavaScript error can occur when binding chart series with MVVM
StockChart
What's new
- Navigator plot detail can now be controlled by setting navigator.categoryAxis.maxDateGroups
What's fixed
- The visual selection does not correspond to the selected date range
Mobile
What's fixed
- Loading animation does not block the other content in the view, when flat skin is set
- In Android 4.0.3 Cordova app is clipped when loaded from cache (icon).
PHP Wrappers


Jukebox
Warning: This is work in progress. These demos are not finished yet, although they might give you an idea of how to use the Jukebox. Stay tuned for updates.
Global volume
Additional controls
stop()
pause()
resume()


{% extends 'base/layout.html' %} {% load staticfiles %} {% block content %}
Already Have An Account? Login.
Go to Home Page


|
Dreamachine
1.0.0
flashy lights thing
|
Class that stores state and functions for interacting with SSD1306 OLED displays. More...
#include <Adafruit_SSD1306.h>
Public Member Functions | |
| Adafruit_SSD1306 (uint8_t w, uint8_t h, TwoWire *twi=&Wire, int8_t rst_pin=-1, uint32_t clkDuring=400000UL, uint32_t clkAfter=100000UL) | |
| Constructor for I2C-interfaced SSD1306 displays. More... | |
| Adafruit_SSD1306 (uint8_t w, uint8_t h, int8_t mosi_pin, int8_t sclk_pin, int8_t dc_pin, int8_t rst_pin, int8_t cs_pin) | |
| Constructor for SPI SSD1306 displays, using software (bitbang) SPI. More... | |
| Adafruit_SSD1306 (uint8_t w, uint8_t h, SPIClass *spi, int8_t dc_pin, int8_t rst_pin, int8_t cs_pin, uint32_t bitrate=8000000UL) | |
| Constructor for SPI SSD1306 displays, using native hardware SPI. More... | |
| Adafruit_SSD1306 (int8_t mosi_pin, int8_t sclk_pin, int8_t dc_pin, int8_t rst_pin, int8_t cs_pin) | |
| DEPRECATED constructor for SPI SSD1306 displays, using software (bitbang) SPI. Provided for older code to maintain compatibility with the current library. Screen size is determined by enabling one of the SSD1306_* size defines in Adafruit_SSD1306.h. New code should NOT use this. More... | |
| Adafruit_SSD1306 (int8_t dc_pin, int8_t rst_pin, int8_t cs_pin) | |
| DEPRECATED constructor for SPI SSD1306 displays, using native hardware SPI. Provided for older code to maintain compatibility with the current library. Screen size is determined by enabling one of the SSD1306_* size defines in Adafruit_SSD1306.h. New code should NOT use this. Only the primary SPI bus is supported, and bitrate is fixed at 8 MHz. More... | |
| Adafruit_SSD1306 (int8_t rst_pin=-1) | |
| DEPRECATED constructor for I2C SSD1306 displays. Provided for older code to maintain compatibility with the current library. Screen size is determined by enabling one of the SSD1306_* size defines in Adafruit_SSD1306.h. New code should NOT use this. Only the primary I2C bus is supported. More... | |
| ~Adafruit_SSD1306 (void) | |
| Destructor for Adafruit_SSD1306 object. More... | |
| bool | begin (uint8_t switchvcc=SSD1306_SWITCHCAPVCC, uint8_t i2caddr=0, bool reset=true, bool periphBegin=true) |
| Allocate RAM for image buffer, initialize peripherals and pins. More... | |
| void | display (void) |
| Push data currently in RAM to SSD1306 display. More... | |
| void | clearDisplay (void) |
| Clear contents of display buffer (set all pixels to off). More... | |
| void | invertDisplay (bool i) |
| Enable or disable display invert mode (white-on-black vs black-on-white). More... | |
| void | dim (bool dim) |
| Dim the display. More... | |
| void | drawPixel (int16_t x, int16_t y, uint16_t color) |
| Set/clear/invert a single pixel. This is also invoked by the Adafruit_GFX library in generating many higher-level graphics primitives. More... | |
| virtual void | drawFastHLine (int16_t x, int16_t y, int16_t w, uint16_t color) |
| Draw a horizontal line. This is also invoked by the Adafruit_GFX library in generating many higher-level graphics primitives. More... | |
| virtual void | drawFastVLine (int16_t x, int16_t y, int16_t h, uint16_t color) |
| Draw a vertical line. This is also invoked by the Adafruit_GFX library in generating many higher-level graphics primitives. More... | |
| void | startscrollright (uint8_t start, uint8_t stop) |
| Activate a right-handed scroll for all or part of the display. More... | |
| void | startscrollleft (uint8_t start, uint8_t stop) |
| Activate a left-handed scroll for all or part of the display. More... | |
| void | startscrolldiagright (uint8_t start, uint8_t stop) |
| Activate a diagonal scroll for all or part of the display. More... | |
| void | startscrolldiagleft (uint8_t start, uint8_t stop) |
| Activate alternate diagonal scroll for all or part of the display. More... | |
| void | stopscroll (void) |
| Cease a previously-begun scrolling action. More... | |
| void | ssd1306_command (uint8_t c) |
| Issue a single low-level command directly to the SSD1306 display, bypassing the library. More... | |
| bool | getPixel (int16_t x, int16_t y) |
| Return color of a single pixel in display buffer. More... | |
| uint8_t * | getBuffer (void) |
| Get base address of display buffer for direct reading or writing. More... | |
Protected Member Functions | |
| void | SPIwrite (uint8_t d) __attribute__((always_inline)) |
| Write a single byte to the SPI port. More... | |
| void | drawFastHLineInternal (int16_t x, int16_t y, int16_t w, uint16_t color) |
| Draw a horizontal line with a width and color. Used by public methods drawFastHLine,drawFastVLine. More... | |
| void | drawFastVLineInternal (int16_t x, int16_t y, int16_t h, uint16_t color) |
| Draw a vertical line with a width and color. Used by public method drawFastHLine,drawFastVLine. More... | |
| void | ssd1306_command1 (uint8_t c) |
| Issue single command to SSD1306, using I2C or hard/soft SPI as needed. Because command calls are often grouped, SPI transaction and selection must be started/ended in calling function for efficiency. This is a protected function, not exposed (see ssd1306_command() instead). More... | |
| void | ssd1306_commandList (const uint8_t *c, uint8_t n) |
| Issue list of commands to SSD1306, same rules as above re: transactions. This is a protected function, not exposed. More... | |
Protected Attributes | |
| SPIClass * | spi |
| TwoWire * | wire |
| uint8_t * | buffer |
| int8_t | i2caddr |
| I2C address initialized when begin method is called. More... | |
| int8_t | vccstate |
| VCC selection, set by begin method. More... | |
| int8_t | page_end |
| not used More... | |
| int8_t | mosiPin |
| int8_t | clkPin |
| (Clock Pin) set when using SPI set during construction. More... | |
| int8_t | dcPin |
| (Data Pin) set when using SPI set during construction. More... | |
| int8_t | csPin |
| (Chip Select Pin) set when using SPI set during construction. More... | |
| int8_t | rstPin |
| Display reset pin assignment. Set during construction. More... | |
| uint8_t | contrast |
| normal contrast setting for this device More... | |
Class that stores state and functions for interacting with SSD1306 OLED displays.
Definition at line 109 of file Adafruit_SSD1306.h.
| Adafruit_SSD1306::Adafruit_SSD1306 | ( | uint8_t | w, |
| uint8_t | h, | ||
| TwoWire * | twi = &Wire , |
||
| int8_t | rst_pin = -1 , |
||
| uint32_t | clkDuring = 400000UL , |
||
| uint32_t | clkAfter = 100000UL |
||
| ) |
Constructor for I2C-interfaced SSD1306 displays.
| w | Display width in pixels |
| h | Display height in pixels |
| twi | Pointer to an existing TwoWire instance (e.g. &Wire, the microcontroller's primary I2C bus). |
| rst_pin | Reset pin (using Arduino pin numbering), or -1 if not used (some displays might be wired to share the microcontroller's reset pin). |
| clkDuring | Speed (in Hz) for Wire transmissions in SSD1306 library calls. Defaults to 400000 (400 KHz), a known 'safe' value for most microcontrollers, and meets the SSD1306 datasheet spec. Some systems can operate I2C faster (800 KHz for ESP32, 1 MHz for many other 32-bit MCUs), and some (perhaps not all) SSD1306's can work with this – so it's optionally be specified here and is not a default behavior. (Ignored if using pre-1.5.7 Arduino software, which operates I2C at a fixed 100 KHz.) |
| clkAfter | Speed (in Hz) for Wire transmissions following SSD1306 library calls. Defaults to 100000 (100 KHz), the default Arduino Wire speed. This is done rather than leaving it at the 'during' speed because other devices on the I2C bus might not be compatible with the faster rate. (Ignored if using pre-1.5.7 Arduino software, which operates I2C at a fixed 100 KHz.) |
Definition at line 147 of file Adafruit_SSD1306.cpp.
| Adafruit_SSD1306::Adafruit_SSD1306 | ( | uint8_t | w, |
| uint8_t | h, | ||
| int8_t | mosi_pin, | ||
| int8_t | sclk_pin, | ||
| int8_t | dc_pin, | ||
| int8_t | rst_pin, | ||
| int8_t | cs_pin | ||
| ) |
Constructor for SPI SSD1306 displays, using software (bitbang) SPI.
| w | Display width in pixels |
| h | Display height in pixels |
| mosi_pin | MOSI (master out, slave in) pin (using Arduino pin numbering). This transfers serial data from microcontroller to display. |
| sclk_pin | SCLK (serial clock) pin (using Arduino pin numbering). This clocks each bit from MOSI. |
| dc_pin | Data/command pin (using Arduino pin numbering), selects whether display is receiving commands (low) or data (high). |
| rst_pin | Reset pin (using Arduino pin numbering), or -1 if not used (some displays might be wired to share the microcontroller's reset pin). |
| cs_pin | Chip-select pin (using Arduino pin numbering) for sharing the bus with other devices. Active low. |
Definition at line 186 of file Adafruit_SSD1306.cpp.
| Adafruit_SSD1306::Adafruit_SSD1306 | ( | uint8_t | w, |
| uint8_t | h, | ||
| SPIClass * | spi_ptr, | ||
| int8_t | dc_pin, | ||
| int8_t | rst_pin, | ||
| int8_t | cs_pin, | ||
| uint32_t | bitrate = 8000000UL |
||
| ) |
Constructor for SPI SSD1306 displays, using native hardware SPI.
| w | Display width in pixels |
| h | Display height in pixels |
| spi_ptr | Pointer to an existing SPIClass instance (e.g. &SPI, the microcontroller's primary SPI bus). |
| dc_pin | Data/command pin (using Arduino pin numbering), selects whether display is receiving commands (low) or data (high). |
| rst_pin | Reset pin (using Arduino pin numbering), or -1 if not used (some displays might be wired to share the microcontroller's reset pin). |
| cs_pin | Chip-select pin (using Arduino pin numbering) for sharing the bus with other devices. Active low. |
| bitrate | SPI clock rate for transfers to this display. Default if unspecified is 8000000UL (8 MHz). |
Definition at line 219 of file Adafruit_SSD1306.cpp.
| Adafruit_SSD1306::Adafruit_SSD1306 | ( | int8_t | mosi_pin, |
| int8_t | sclk_pin, | ||
| int8_t | dc_pin, | ||
| int8_t | rst_pin, | ||
| int8_t | cs_pin | ||
| ) |
DEPRECATED constructor for SPI SSD1306 displays, using software (bitbang) SPI. Provided for older code to maintain compatibility with the current library. Screen size is determined by enabling one of the SSD1306_* size defines in Adafruit_SSD1306.h. New code should NOT use this.
| mosi_pin | MOSI (master out, slave in) pin (using Arduino pin numbering). This transfers serial data from microcontroller to display. |
| sclk_pin | SCLK (serial clock) pin (using Arduino pin numbering). This clocks each bit from MOSI. |
| dc_pin | Data/command pin (using Arduino pin numbering), selects whether display is receiving commands (low) or data (high). |
| rst_pin | Reset pin (using Arduino pin numbering), or -1 if not used (some displays might be wired to share the microcontroller's reset pin). |
| cs_pin | Chip-select pin (using Arduino pin numbering) for sharing the bus with other devices. Active low. |
Definition at line 257 of file Adafruit_SSD1306.cpp.
| Adafruit_SSD1306::Adafruit_SSD1306 | ( | int8_t | dc_pin, |
| int8_t | rst_pin, | ||
| int8_t | cs_pin | ||
| ) |
DEPRECATED constructor for SPI SSD1306 displays, using native hardware SPI. Provided for older code to maintain compatibility with the current library. Screen size is determined by enabling one of the SSD1306_* size defines in Adafruit_SSD1306.h. New code should NOT use this. Only the primary SPI bus is supported, and bitrate is fixed at 8 MHz.
| dc_pin | Data/command pin (using Arduino pin numbering), selects whether display is receiving commands (low) or data (high). |
| rst_pin | Reset pin (using Arduino pin numbering), or -1 if not used (some displays might be wired to share the microcontroller's reset pin). |
| cs_pin | Chip-select pin (using Arduino pin numbering) for sharing the bus with other devices. Active low. |
Definition at line 284 of file Adafruit_SSD1306.cpp.
| Adafruit_SSD1306::Adafruit_SSD1306 | ( | int8_t | rst_pin = -1 | ) |
DEPRECATED constructor for I2C SSD1306 displays. Provided for older code to maintain compatibility with the current library. Screen size is determined by enabling one of the SSD1306_* size defines in Adafruit_SSD1306.h. New code should NOT use this. Only the primary I2C bus is supported.
| rst_pin | Reset pin (using Arduino pin numbering), or -1 if not used (some displays might be wired to share the microcontroller's reset pin). |
Definition at line 308 of file Adafruit_SSD1306.cpp.
| Adafruit_SSD1306::~Adafruit_SSD1306 | ( | void | ) |
Destructor for Adafruit_SSD1306 object.
Definition at line 316 of file Adafruit_SSD1306.cpp.
| bool Adafruit_SSD1306::begin | ( | uint8_t | vcs = SSD1306_SWITCHCAPVCC , |
| uint8_t | addr = 0 , |
||
| bool | reset = true , |
||
| bool | periphBegin = true |
||
| ) |
Allocate RAM for image buffer, initialize peripherals and pins.
| vcs | VCC selection. Pass SSD1306_SWITCHCAPVCC to generate the display voltage (step up) from the 3.3V source, or SSD1306_EXTERNALVCC otherwise. Most situations with Adafruit SSD1306 breakouts will want SSD1306_SWITCHCAPVCC. |
| addr | I2C address of corresponding SSD1306 display (or pass 0 to use default of 0x3C for 128x32 display, 0x3D for all others). SPI displays (hardware or software) do not use addresses, but this argument is still required (pass 0 or any value really, it will simply be ignored). Default if unspecified is 0. |
| reset | If true, and if the reset pin passed to the constructor is valid, a hard reset will be performed before initializing the display. If using multiple SSD1306 displays on the same bus, and if they all share the same reset pin, you should only pass true on the first display being initialized, false on all others, else the already-initialized displays would be reset. Default if unspecified is true. |
| periphBegin | If true, and if a hardware peripheral is being used (I2C or SPI, but not software SPI), call that peripheral's begin() function, else (false) it has already been done in one's sketch code. Cases where false might be used include multiple displays or other devices sharing a common bus, or situations on some platforms where a nonstandard begin() function is available (e.g. a TwoWire interface on non-default pins, as can be done on the ESP8266 and perhaps others). |
Definition at line 488 of file Adafruit_SSD1306.cpp.
| void Adafruit_SSD1306::clearDisplay | ( | void | ) |
Clear contents of display buffer (set all pixels to off).
Definition at line 697 of file Adafruit_SSD1306.cpp.
| void Adafruit_SSD1306::dim | ( | bool | dim | ) |
Dim the display.
| dim | true to enable lower brightness mode, false for full brightness. |
Definition at line 1241 of file Adafruit_SSD1306.cpp.
| void Adafruit_SSD1306::display | ( | void | ) |
Push data currently in RAM to SSD1306 display.
Definition at line 1043 of file Adafruit_SSD1306.cpp.
|
virtual |
Draw a horizontal line. This is also invoked by the Adafruit_GFX library in generating many higher-level graphics primitives.
| x | Leftmost column – 0 at left to (screen width - 1) at right. |
| y | Row of display – 0 at top to (screen height -1) at bottom. |
| w | Width of line, in pixels. |
| color | Line color, one of: SSD1306_BLACK, SSD1306_WHITE or SSD1306_INVERSE. |
Definition at line 718 of file Adafruit_SSD1306.cpp.
|
protected |
Draw a horizontal line with a width and color. Used by public methods drawFastHLine,drawFastVLine.
| x | Leftmost column – 0 at left to (screen width - 1) at right. |
| y | Row of display – 0 at top to (screen height -1) at bottom. |
| w | Width of line, in pixels. |
| color | Line color, one of: SSD1306_BLACK, SSD1306_WHITE or SSD1306_INVERSE. |
Definition at line 769 of file Adafruit_SSD1306.cpp.
|
virtual |
Draw a vertical line. This is also invoked by the Adafruit_GFX library in generating many higher-level graphics primitives.
| x | Column of display – 0 at left to (screen width -1) at right. |
| y | Topmost row – 0 at top to (screen height - 1) at bottom. |
| h | Height of line, in pixels. |
| color | Line color, one of: SSD1306_BLACK, SSD1306_WHITE or SSD1306_INVERSE. |
Definition at line 829 of file Adafruit_SSD1306.cpp.
|
protected |
Draw a vertical line with a width and color. Used by public method drawFastHLine,drawFastVLine.
| x | Leftmost column – 0 at left to (screen width - 1) at right. |
| __y | Row of display – 0 at top to (screen height -1) at bottom. |
| __h | height of the line in pixels |
| color | Line color, one of: SSD1306_BLACK, SSD1306_WHITE or SSD1306_INVERSE. |
Definition at line 879 of file Adafruit_SSD1306.cpp.
| void Adafruit_SSD1306::drawPixel | ( | int16_t | x, |
| int16_t | y, | ||
| uint16_t | color | ||
| ) |
Set/clear/invert a single pixel. This is also invoked by the Adafruit_GFX library in generating many higher-level graphics primitives.
| x | Column of display – 0 at left to (screen width - 1) at right. |
| y | Row of display – 0 at top to (screen height -1) at bottom. |
| color | Pixel color, one of: SSD1306_BLACK, SSD1306_WHITE or SSD1306_INVERSE. |
Definition at line 655 of file Adafruit_SSD1306.cpp.
| uint8_t * Adafruit_SSD1306::getBuffer | ( | void | ) |
Get base address of display buffer for direct reading or writing.
Definition at line 1032 of file Adafruit_SSD1306.cpp.
| bool Adafruit_SSD1306::getPixel | ( | int16_t | x, |
| int16_t | y | ||
| ) |
Return color of a single pixel in display buffer.
| x | Column of display – 0 at left to (screen width - 1) at right. |
| y | Row of display – 0 at top to (screen height -1) at bottom. |
Definition at line 1002 of file Adafruit_SSD1306.cpp.
| void Adafruit_SSD1306::invertDisplay | ( | bool | i | ) |
Enable or disable display invert mode (white-on-black vs black-on-white).
| i | If true, switch to invert mode (black-on-white), else normal mode (white-on-black). |
Definition at line 1226 of file Adafruit_SSD1306.cpp.
|
inlineprotected |
Write a single byte to the SPI port.
| d | Data byte to be written. |
Definition at line 339 of file Adafruit_SSD1306.cpp.
| void Adafruit_SSD1306::ssd1306_command | ( | uint8_t | c | ) |
Issue a single low-level command directly to the SSD1306 display, bypassing the library.
| c | Command to issue (0x00 to 0xFF, see datasheet). |
Definition at line 444 of file Adafruit_SSD1306.cpp.
|
protected |
Issue single command to SSD1306, using I2C or hard/soft SPI as needed. Because command calls are often grouped, SPI transaction and selection must be started/ended in calling function for efficiency. This is a protected function, not exposed (see ssd1306_command() instead).
@param c the command character to send to the display. Refer to ssd1306 data sheet for commands
Definition at line 377 of file Adafruit_SSD1306.cpp.
|
protected |
Issue list of commands to SSD1306, same rules as above re: transactions. This is a protected function, not exposed.
| c | pointer to list of commands |
| n | number of commands in the list |
Definition at line 405 of file Adafruit_SSD1306.cpp.
| void Adafruit_SSD1306::startscrolldiagleft | ( | uint8_t | start, |
| uint8_t | stop | ||
| ) |
Activate alternate diagonal scroll for all or part of the display.
| start | First row. |
| stop | Last row. |
Definition at line 1182 of file Adafruit_SSD1306.cpp.
| void Adafruit_SSD1306::startscrolldiagright | ( | uint8_t | start, |
| uint8_t | stop | ||
| ) |
Activate a diagonal scroll for all or part of the display.
| start | First row. |
| stop | Last row. |
Definition at line 1155 of file Adafruit_SSD1306.cpp.
| void Adafruit_SSD1306::startscrollleft | ( | uint8_t | start, |
| uint8_t | stop | ||
| ) |
Activate a left-handed scroll for all or part of the display.
| start | First row. |
| stop | Last row. |
Definition at line 1131 of file Adafruit_SSD1306.cpp.
| void Adafruit_SSD1306::startscrollright | ( | uint8_t | start, |
| uint8_t | stop | ||
| ) |
Activate a right-handed scroll for all or part of the display.
| start | First row. |
| stop | Last row. |
Definition at line 1107 of file Adafruit_SSD1306.cpp.
| void Adafruit_SSD1306::stopscroll | ( | void | ) |
Cease a previously-begun scrolling action.
Definition at line 1204 of file Adafruit_SSD1306.cpp.
|
protected |
Buffer data used for display buffer. Allocated when begin method is called.
Definition at line 158 of file Adafruit_SSD1306.h.
|
protected |
(Clock Pin) set when using SPI set during construction.
Definition at line 165 of file Adafruit_SSD1306.h.
|
protected |
normal contrast setting for this device
Definition at line 179 of file Adafruit_SSD1306.h.
|
protected |
(Chip Select Pin) set when using SPI set during construction.
Definition at line 168 of file Adafruit_SSD1306.h.
|
protected |
(Data Pin) set when using SPI set during construction.
Definition at line 166 of file Adafruit_SSD1306.h.
|
protected |
I2C address initialized when begin method is called.
Definition at line 160 of file Adafruit_SSD1306.h.
|
protected |
(Master Out Slave In) set when using SPI set during construction.
Definition at line 163 of file Adafruit_SSD1306.h.
|
protected |
not used
Definition at line 162 of file Adafruit_SSD1306.h.
|
protected |
Display reset pin assignment. Set during construction.
Definition at line 169 of file Adafruit_SSD1306.h.
|
protected |
Initialized during construction when using SPI. See SPI.cpp, SPI.h
Definition at line 154 of file Adafruit_SSD1306.h.
|
protected |
VCC selection, set by begin method.
Definition at line 161 of file Adafruit_SSD1306.h.
|
protected |
Initialized during construction when using I2C. See Wire.cpp, Wire.h
Definition at line 156 of file Adafruit_SSD1306.h.


About Me:
Hello, my name is Mark Raudenbush. I am a web developer based out of Westminster, CO. I have skills in HTML, CSS and Javascript. I have been working in the information technology space for about 20 years and have recently decided to add Web development to my skill set. When I am not programming I'm probably hanging out with my girlfriend and her 10 year old son and 8 year old daughter.
Web Development skills
- HTML
- CSS
- Javascript
Work:
***Click on images to see applications


About Us
Honest Scribbles works to help you get your novel/short story reviewed by real readers. A one of a kind reviewing platform designed for new writers who are struggling with getting their stories published.
Facing rejections is challenging, specially when you can't figure out where's the fault in your stars.
- Pick from a vast number of readers, from any age group, from veteran readers to newbies of the reading world, as per your need.
- Get all your queries answered in one go.
- 100% secure reviewing process.
Services
Sci-Fi
If you are creating the next Frankenstein or a tangled time looped story, we have perfect readers for you.
Fantasy
If it's a magical world with strange creatures, or an urban new society ditchy politics and lots and lots of imagination, with one strong and hated antagonist, it will surely spark some fire in our readers as well, give it a try
Romance
Nothing is more heart-wrenching than an astounding love story. But is it up to the mark? Are your words reaching to the depths of your reader's heart? There's only one way to find out.
Self-help
If it's a tale about finding the hidden purpose of the universe, you gotta test out your theory on our readers first!
Horror
Nothing burns more calories than a freshly baked horror story. But is it worth the time? Or do the spine-chilling twists of the story need refinement? Well, scare our readers to find out for yourself.
Anything else
If your story falls in none of the categories or is a mixture of all of them, we still have you covered with our wide network of readers.
Why choose us?
Our large network of readers and overall hassle free reviewing process makes us the perfect choice for your unpublished masterpiece. After all, not everyone is blessed with great reader friends.
Writing is one thing and getting published is other.
We at Honest Scribbles understand this and thus all our efforts are directed at giving you the best advice we can. All our readers are basically a fraction of your future audience. They will be among the ones to go out and buy your masterpiece. Thus, getting their opinion before hand is probably the best thing for your book.
Quality of Review
A large community of book-lovers ready at your disposal. These are the people who've read a lot of books, thus their verdict is basically the popular opinion of the book reading crowd.
Personalized Review
You decide the number of readers you want to read your work. You decide which part they should read or what characters or plot they should focus on. You decide the things they should answer for you.
Security
We ask our readers to sign a 'Non Disclosure Agreement' and send you a copy as well. Thus, in no way, anyone gets to steal your future stardom.
 Want to utilize your hobby of reading? Then fill in this small form and be a part of our reviewing team. Few selection loops and you'd be a proud reviewer helping new writers while earning yourself a little extra cash.
How the process works?
You will be asked to fill up a simple form, stating the genre, word count and other necessary details of your book along with your specifications for the reviewer (ex. age, minimum number of books read. etc.). We will filter out the reviewers and the ones matching your needs would be informed. Upon a update on their availabilty and pricing demands, we'd inform you about all the reviewers available. You then, can pick one or multiple of them by glossing over their reading-details that we'll be sending along.
Once everything is finalized, an agreement would be forged between you and Honest Scribbles. Also, the reviewer would sign a non-disclosure agreement, that would protect your work. The reviewer would submit the review, which would only be available to you. Note that no where in the process, the reviewer would be in possesion of your work. Also, the NDA agreement signed by the reviewer would forbid him/her from taking any piece of material and using it in future.
How the pricing works?
We provide freedom to all the reviewers to pick their own pricing index (usually done on a word count basis). Thus, the cost of getting reviewed varies from reviewer to reviewer.
But an estimated cost for getting a novel of 50k words reviewed ranges from INR750 to INR3000.
You always have a choice over picking the reviewer. There would be no external influence on your decision from our side.
Team
Yuvi Dhelawat
Ashwin Goyal
Anmol Chaddha
Categories
Pick your category and get started
p0.5 to 5/word
p1 to 5/word
p1 to 5/word
Frequently Asked Questions
-
Will my work be secure?
Yes, absolutely. The reviewer would sign an agreement which will legally forbid him/her from using your creation.
-
How can I trust my reviewer?
You will receive all the information there is available with us, which will include the number of books they've read, their favourite authors, and few paragraphs worth of their opinion on best and worst of books they've read.
-
How can I trust that I will recieve a review?
You would be asked to pay only after the reviewer has generated a review. Thus, ensuring that the end-deal on both sides is met.
-
As a reader, how can I get started?
Fill in the reader form given above. You'd be asked a few questions about your reading habits. Our team will take a look at it and intimate you, whether you are selected or not. After selection, you'd receive regular updates about reviewing opportunities.
-
As a reader, how much will I be paid?
You get to decide the price of your review. You can change it each time for a new reviewing opportunity.
-
I don't see my question listed, what should I do?
Write us a query at<EMAIL_ADDRESS>and we'd make sure to reach back with an answer.


Script moses
Moses: A utility-belt library for functional programming in Lua.
Functions
| each (list, f[, ...]) | Calls function f on each key-value of a given collection. |
| forEach (list, f[, ...]) | Alias for each. |
| map (list, f[, ...]) | Maps function f on each key-value of a given collection. |
| collect (list, f[, ...]) | Alias for map. |
| reduce (list, f[, state]) | Reduces an entire collection. |
| inject (list, f[, state]) | Alias for reduce. |
| foldl (list, f[, state]) | Alias for reduce. |
| reduceRight (list, f[, state]) | Reduces an entire collection. |
| injectr (list, f[, state]) | Alias for reduceRight. |
| foldr (list, f[, state]) | Alias for reduceRight. |
| mapReduce (list, f[, state]) | Reduces a collection while saving intermediate states. |
| mapr (list, f[, state]) | Alias for mapReduce. |
| mapReduceRight (list, f[, state]) | Reduces a collection while saving intermediate states. |
| maprr (list, f[, state]) | Alias for mapReduceRight. |
| include (list, item) | Looks for an object in a collection. |
| any (list, item) | Alias for include. |
| some (list, item) | Alias for include. |
| detect (list, item) | Looks for an object index in a collection. |
| find (list, item) | Alias for detect. |
| where (list, item) | Alias for detect. |
| select (list, f[, ...]) | Selects and extracts objects passing an iterator test. |
| filter (list, f[, ...]) | Alias for select. |
| reject (list, f[, ...]) | Clones a collection, rejecting objects passing an iterator test. |
| discard (list, f[, ...]) | Alias for reject. |
| all (list, f[, ...]) | Tests if all objects in a collection passes an iterator test. |
| every (list, f[, ...]) | Alias for all. |
| invoke (list, method[, ...]) | Invokes a method on each object in a collection. |
| pluck (list, a) | Extracts property-values from a collection of objects. |
| max (list[, iter[, ...]]) | Returns the maximum value in a collection. |
| min (list[, iter[, ...]]) | Returns the minimum value in a collection. |
| shuffle (list[, seed]) | Returns a shuffled copy of a given collection. |
| same (a, b) | Tests if two collections are the same. |
| sort (list[, comp]) | Sorts a collection. |
| toArray ([...]) | Converts a list of var_args to a collection. |
| groupBy (list, iter[, ...]) | Splits a collection into subsets. |
| countBy (list, iter[, ...]) | Groups objects in a collection and counts them. |
| size ([...]) | Counts the number of values in a collection. |
| containsKeys (list, other) | Checks if all the keys of other object exists in a list . |
| sameKeys (listA, listB) | Checks if both given lists have the same keys. |
| reverse (array) | Reverses values in a given array. |
| selectWhile (array, f[, ...]) | Collects values from a given array. |
| takeWhile (array, f[, ...]) | Alias for selectWhile. |
| dropWhile (array, f[, ...]) | Collects values from a given array. |
| rejectWhile (array, f[, ...]) | Alias for dropWhile. |
| sortedIndex (array, the[, comp[, sort]]) | Returns the index at which a value should be inserted. |
| indexOf (array, the) | Returns the index of the given value in an array. |
| lastIndexOf (array, the) | Returns the last occurence index of a given value. |
| add (array, ...) | Adds all passed-in values at the top of an array. |
| push (array, ...) | Pushes all passed-in values at the end of an array. |
| pop (array) | Removes and returns the value at the top of a given array. |
| shift (array) | Alias for pop. |
| unshift (array) | Removes and returns the value at the end of a given array. |
| removeRange (array[, start[, finish]]) | Trims all values indexed within the range [start,finish] . |
| rmRange (array[, start[, finish]]) | Alias for removeRange. |
| slice (array[, start[, finish]]) | Slices values indexed within [start,finish] range. |
| first (array[, n]) | Returns the first N values in an array. |
| head (array[, n]) | Alias for first. |
| take (array[, n]) | Alias for first. |
| initial (array[, n]) | Returns all values in an array excluding the last N values. |
| last (array[, n]) | Returns the last N values in an array. |
| rest (array[, index]) | Trims all values before index. |
| tail (array[, index]) | Alias for rest. |
| compact (array) | Trims all falsy values. |
| flatten (array[, shallow]) | Flattens a nested array. |
| difference (array, ...) | Returns values from an array not present in all passed-in args. |
| without (array, ...) | Alias for difference. |
| uniq (array[, isSorted[, iter[, ...]]]) | Produces a duplicate-free version of a given array. |
| unique (array[, isSorted[, iter[, ...]]]) | Alias for uniq. |
| union (...) | Returns the duplicate-free union of all passed in arrays. |
| intersection (array, ...) | Returns the intersection of all passed-in arrays. |
| zip (...) | Merges values of each of the passed-in arrays in subsets. |
| append (array, other) | Clones array and appends other to the result. |
| range (...) | Produce a flexible list of numbers. |
| count (...) | Alias for range. |
| invert (array) | Inverts key-value pairs. |
| mirror (array) | Alias for invert. |
| concat (array[, sep[, i[, j]]]) | Concatenates values in a given array. |
| join (array[, sep[, i[, j]]]) | Alias for concat. |
| identity (value) | Returns the passed-in value. |
| once (f) | Returns a version of f that runs only once. |
| memoize (f[, hash]) | Memoizes a given function by caching the computed result. |
| cache (f[, hash]) | Alias for memoize. |
| after (f, count) | Returns a version of f that runs on the count-th call. |
| compose (...) | Composes functions. |
| wrap (f, wrapper) | Wraps f inside of the wrapper function. |
| times (n, iter, ...) | Runs iter function n times. |
| bind (f, v) | Binds v to be the first argument to function f . |
| bindn (f, ...) | Binds ... to be the N-first arguments to function f . |
| uniqueId ([template[, ...]]) | Generates a unique Id (unique for the current session). |
| uId ([template[, ...]]) | Alias for uniqueId. |
| keys (obj) | Returns the names of the object properties. |
| values (obj) | Returns the values of the object properties. |
| pairs (obj) | Returns an array of obj key-values pairs |
| extend (destObj, ...) | Extends an object properties. |
| functions (obj[, output]) | Returns a sorted list of all methods names found in an object. |
| methods (obj[, output]) | Alias for functions. |
| clone (obj[, shallow]) | Clones a given object properties. |
| has (obj, key) | Checks if a given object implements a property. |
| pick (obj, ...) | Return a filtered copy of the object. |
| choose (obj, ...) | Alias for pick. |
| omit (obj, ...) | Return a filtered copy of the object. |
| drop (obj, ...) | Alias for omit. |
| template (obj, template) | Fills nil properties in an object with the given template object. |
| defaults (obj, template) | Alias for template. |
| isEqual (objA, objB[, useMt]) | Performs an equality test between two objects. |
| result (obj, method[, ...]) | Invokes an object method. |
| isObject (obj) | Checks if the given arg is an object (i.e a Lua table). |
| isCallable (obj) | Checks if the given arg is an callable. |
| isArray (obj) | Checks if the given arg is an array. |
| isEmpty (obj) | Checks if the given is empty. |
| isString (obj) | Checks if the given arg is a string. |
| isFunction (obj) | Checks if the given arg is a function. |
| isNil (obj) | Checks if the given arg is nil. |
| isFinite (obj) | Checks if the given arg is a finite number. |
| isNumber (obj) | Checks if the given arg is a number. |
| isNaN (obj) | Checks if the given arg is NaN (see Not-A-Number). |
| isBoolean (obj) | Checks if the given arg is a boolean. |
| import () | Imports all library functions in the global environment. |
| mixin () | Alias for import. |
Functions
- each (list, f[, ...])
-
Calls function
f
on each key-value of a given collection.
Aliased as forEach.Parameters:
- list table a collection
- f
function
an iterator function, prototyped as
f(key,value,...)
- ...
var_arg
Optional extra-args to be passed to function
f
see also:
- forEach (list, f[, ...])
-
Alias for each.
Parameters:
- list
- f
- ...
- map (list, f[, ...])
-
Maps function
f
on each key-value of a given collection. Collects and returns the outputs.
Aliased as collect.Parameters:
- list table a collection
- f
function
an iterator function, prototyped as
f(key,value,...)
- ...
var_arg
Optional extra-args to be passed to function
f
Returns:
-
table
a table of results
see also:
- collect (list, f[, ...])
-
Alias for map.
Parameters:
- list
- f
- ...
- reduce (list, f[, state])
-
Reduces an entire collection. Folds from left to right to a single value,
with respect to a given iterator and an initial state.
The given function takes a state and a value, and returns a new state.
Aliased as inject, foldl.Parameters:
- list table a collection
- f
function
an iterator function, prototyped as
f(state,value)
- state state an initial state of reduction. Defaults to the first value in the list.
Returns:
-
state
state a final state of reduction
see also:
- inject (list, f[, state])
-
Alias for reduce.
Parameters:
- list
- f
- state
- foldl (list, f[, state])
-
Alias for reduce.
Parameters:
- list
- f
- state
- reduceRight (list, f[, state])
-
Reduces an entire collection. Folds from right to left to a single value,
with respect to a given iterator and an initial state.
The given function takes a state and a value, and returns a new state.
Aliased as injectr, foldr.Parameters:
- list table a collection
- f
function
an iterator function, prototyped as
f(state,value)
- state state an initial state of reduction. Defaults to the last value in the list.
Returns:
-
state
state a final state of reduction
see also:
- injectr (list, f[, state])
-
Alias for reduceRight.
Parameters:
- list
- f
- state
- foldr (list, f[, state])
-
Alias for reduceRight.
Parameters:
- list
- f
- state
- mapReduce (list, f[, state])
-
Reduces a collection while saving intermediate states.
Folds the collection from left to right to a single value,
with respect to a given iterator and an initial state.
The given function takes a state and a value, and returns a new state.
The function returns an array of intermediate states.
Aliased as maprParameters:
- list table a collection
- f
function
an iterator function, prototyped as
f(state,value)
- state state an initial state of reduction. Defaults to the last value in the list.
Returns:
-
table
an array of states
see also:
- mapr (list, f[, state])
-
Alias for mapReduce.
Parameters:
- list
- f
- state
- mapReduceRight (list, f[, state])
-
Reduces a collection while saving intermediate states. It proceeds in reverse order,
folding the collection from right to left to a single value,
with respect to a given iterator and an initial state.
The given function takes a state and a value, and returns a new state.
The function returns an array of intermediate states.
Aliased as maprrParameters:
- list table a collection
- f
function
an iterator function, prototyped as
f(state,value)
- state state an initial state of reduction. Defaults to the last value in the list.
Returns:
-
table
an array of states
see also:
- maprr (list, f[, state])
-
Alias for mapReduceRight.
Parameters:
- list
- f
- state
- include (list, item)
-
Looks for an object in a collection.
Aliased as any, someParameters:
- list table a collection
- item object a value to be searched
Returns:
-
boolean
a boolean : true when found, false otherwise
see also:
- any (list, item)
-
Alias for include.
Parameters:
- list
- item
- some (list, item)
-
Alias for include.
Parameters:
- list
- item
- detect (list, item)
-
Looks for an object index in a collection.
Aliased as where, findParameters:
- list table a collection
- item object a value to be searched
Returns:
-
key
the object key or nil
see also:
- find (list, item)
-
Alias for detect.
Parameters:
- list
- item
- where (list, item)
-
Alias for detect.
Parameters:
- list
- item
- select (list, f[, ...])
-
Selects and extracts objects passing an iterator test.
Aliased as filterParameters:
- list table a collection
- f
function
an iterator function, prototyped as
f(key,value,...)
- ...
var_arg
Optional extra-args to be passed to function
f
Returns:
-
table
the selected objects
see also:
- filter (list, f[, ...])
-
Alias for select.
Parameters:
- list
- f
- ...
- reject (list, f[, ...])
-
Clones a collection, rejecting objects passing an iterator test.
Aliased as discardParameters:
- list table a collection
- f
function
an iterator function, prototyped as
f(key,value,...)
- ...
var_arg
Optional extra-args to be passed to function
f
Returns:
-
table
the remaining objects
see also:
- discard (list, f[, ...])
-
Alias for reject.
Parameters:
- list
- f
- ...
- all (list, f[, ...])
-
Tests if all objects in a collection passes an iterator test.
Aliased as everyParameters:
- list table a collection
- f
function
an iterator function, prototyped as
f(key,value,...)
- ...
var_arg
Optional extra-args to be passed to function
f
Returns:
-
boolean
true or false
see also:
- every (list, f[, ...])
-
Alias for all.
Parameters:
- list
- f
- ...
- invoke (list, method[, ...])
-
Invokes a method on each object in a collection.
Parameters:
- list table a collection
- method
function
a function, prototyped as
f(object,...)
- ...
var_arg
Optional extra-args to be passed to function
method
Returns:
-
table
an array of results
- pluck (list, a)
-
Extracts property-values from a collection of objects.
Parameters:
Returns:
-
table
an array of values for the specified property
- max (list[, iter[, ...]])
-
Returns the maximum value in a collection. If an iterator is passed, it will
be used to extract the property value by which all objects will be ranked.
Parameters:
- list table a collection
- iter
function
an iterator function, prototyped as
iter(value,...)
, defaults to identity - ...
var_arg
Optional extra-args to be passed to function
iter
Returns:
-
value
the maximum property value found
- min (list[, iter[, ...]])
-
Returns the minimum value in a collection. If an iterator is passed, it will
be used to extract the property value by which all objects will be ranked.
Parameters:
- list table a collection
- iter
function
an iterator function, prototyped as
iter(value,...)
, defaults to identity - ...
var_arg
Optional extra-args to be passed to function
iter
Returns:
-
value
the minimum property value found
- shuffle (list[, seed])
-
Returns a shuffled copy of a given collection. If a seed is provided, it will
be used to init the random number generator.
Parameters:
- list table a collection
- seed number a seed
Returns:
-
table
a shuffled copy of the given collection
- same (a, b)
-
Tests if two collections are the same. I.e, they feature the same objects, but not
necessarily at the same keys
Parameters:
Returns:
-
boolean
true or false
- sort (list[, comp])
-
Sorts a collection. If a comparison function is given, it will be used to sort objects
Parameters:
- list table a collection
- comp
function
a comparison function prototyped as
comp(a,b)
, defaults to < operator.
Returns:
-
table
the given list, sorted.
- toArray ([...])
-
Converts a list of var_args to a collection.
Parameters:
- ... var_arg Optional variable number of arguments
Returns:
-
table
an array of all passed-in args
- groupBy (list, iter[, ...])
-
Splits a collection into subsets. Each subset feature objects grouped by the result of passing it through an iterator.
If iterator is a string instead of a function, groups by the property named by iterator on each of the values.
Parameters:
- list table a collection
- iter
function
an iterator function, prototyped as
iter(key,value,...)
- ...
var_arg
Optional extra-args to be passed to function
iter
Returns:
-
table
a new collection with items grouped by subsets
- countBy (list, iter[, ...])
-
Groups objects in a collection and counts them.
Parameters:
- list table a collection
- iter
function
an iterator function, prototyped as
iter(key,value,...)
- ...
var_arg
Optional extra-args to be passed to function
iter
Returns:
-
table
a new collection with subsets names and count
- size ([...])
-
Counts the number of values in a collection. If being passed more than one args
it will return the number of passed-in args.
Parameters:
- ... var_arg Optional variable number of arguments
Returns:
-
number
a size
- containsKeys (list, other)
-
Checks if all the keys of
other
object exists in alist
. It does not compares values. The test is not commutative, i.elist
may contains keys not existing inother
.Parameters:
Returns:
-
boolean
true or false
- sameKeys (listA, listB)
-
Checks if both given lists have the same keys. It does not compares values.
Parameters:
Returns:
-
boolean
true or false
- reverse (array)
-
Reverses values in a given array. The passed-in array should not be sparse.
Parameters:
- array table an array
Returns:
-
table
a copy of the given array, reversed
- selectWhile (array, f[, ...])
-
Collects values from a given array. The passed-in array should not be sparse.
This function collects values as long as they satisfy a given predicate.
Therefore, it returns on the first false test.
Aliased as takeWhileParameters:
- array table an array
- f
function
an iterator function prototyped as
f(key,value,...)
- ...
var_arg
Optional extra-args to be passed to function
f
Returns:
-
table
a new table containing the first truthy values collected
see also:
- takeWhile (array, f[, ...])
-
Alias for selectWhile.
Parameters:
- array
- f
- ...
- dropWhile (array, f[, ...])
-
Collects values from a given array. The passed-in array should not be sparse.
This function collects values as soon as they do not satisfy a given predicate.
Therefore it returns on the first true test.
Aliased as rejectWhileParameters:
- array table an array
- f
function
an iterator function prototyped as
f(key,value,...)
- ...
var_arg
Optional extra-args to be passed to function
f
Returns:
-
table
a new table containing the first falsy values collected
see also:
- rejectWhile (array, f[, ...])
-
Alias for dropWhile.
Parameters:
- array
- f
- ...
- sortedIndex (array, the[, comp[, sort]])
-
Returns the index at which a value should be inserted. This returned index is determined so that it maintains the sort.
If a comparison function is passed, it will be used to determine the sort ranking of each
value, including the passed-in value.
Parameters:
- array table an array
- the value value to be inserted
- comp
function
an comparison function prototyped as
f(a,b)
, defaults to < operator - sort boolean whether or not to sort the passed-in array
Returns:
-
index
the index at which the passed-in value should be inserted
- indexOf (array, the)
-
Returns the index of the given value in an array. If the passed-in value exists
more than once in the array, it will return the index of the first occurence.
Parameters:
- array table an array
- the value value to be searched
Returns:
-
index
the index of the passed-in value or nil
- lastIndexOf (array, the)
-
Returns the last occurence index of a given value.
Parameters:
- array table an array
- the value value to be searched
Returns:
-
index
the index of the last occurence of the passed-in value or nil
- add (array, ...)
-
Adds all passed-in values at the top of an array. The latter args will come the
first in the given array.
Parameters:
- array table an array
- ... var_arg a variable number of arguments
Returns:
-
table
the passed-in array
- push (array, ...)
-
Pushes all passed-in values at the end of an array.
Parameters:
- array table an array
- ... var_arg a variable number of arguments
Returns:
-
table
the passed-in array
- pop (array)
-
Removes and returns the value at the top of a given array.
Aliased as shiftParameters:
- array table an array
Returns:
-
value
the popped value
see also:
- shift (array)
-
Alias for pop.
Parameters:
- array
- unshift (array)
-
Removes and returns the value at the end of a given array.
Parameters:
- array table an array
Returns:
-
value
the popped value
- removeRange (array[, start[, finish]])
-
Trims all values indexed within the range
[start,finish]
.
Aliased as rmRangeParameters:
- array table an array
- start index the lower bound index, defaults to the first index in the array.
- finish index the upper bound index, defaults to the array length.
Returns:
-
table
the passed-in array
see also:
- rmRange (array[, start[, finish]])
-
Alias for removeRange.
Parameters:
- array
- start
- finish
- slice (array[, start[, finish]])
-
Slices values indexed within
[start,finish]
range.Parameters:
- array table an array
- start index the lower bound index, defaults to the first index in the array.
- finish index the upper bound index, defaults to the array length.
Returns:
-
table
a new array
- first (array[, n])
-
Returns the first N values in an array.
Aliased as head, takeParameters:
- array table an array
- n number the number of values to be collected, defaults to 1.
Returns:
-
table
a new array
see also:
- head (array[, n])
-
Alias for first.
Parameters:
- array
- n
- take (array[, n])
-
Alias for first.
Parameters:
- array
- n
- initial (array[, n])
-
Returns all values in an array excluding the last N values.
Parameters:
- array table an array
- n number the number of values to be left, defaults to the array length.
Returns:
-
table
a new array
- last (array[, n])
-
Returns the last N values in an array.
Parameters:
- array table an array
- n number the number of values to be collected, defaults to the array length.
Returns:
-
table
a new array
- rest (array[, index])
-
Trims all values before index.
Aliased as tailParameters:
- array table an array
- index index an index, defaults to 1
Returns:
-
table
a new array
see also:
- tail (array[, index])
-
Alias for rest.
Parameters:
- array
- index
- compact (array)
-
Trims all falsy values.
Parameters:
- array table an array
Returns:
-
table
a new array
- flatten (array[, shallow])
-
Flattens a nested array. Passing
shallow
will only flatten at the first single level.Parameters:
- array table an array
- shallow boolean specifies the flattening depth
Returns:
-
table
a new array, flattened
- difference (array, ...)
-
Returns values from an array not present in all passed-in args.
Aliased as withoutParameters:
- array table an array
- ... var_arg a variable number of arguments
Returns:
-
table
a new array
see also:
- without (array, ...)
-
Alias for difference.
Parameters:
- array
- ...
- uniq (array[, isSorted[, iter[, ...]]])
-
Produces a duplicate-free version of a given array. Passing
isSorted
will provide a much faster version, but will produce the desired result if the array is properly sorted. Ifiter
is passed, it will be used to compute new values based on a transformation.
Aliased as uniqueParameters:
- array table an array
- isSorted
boolean
whether or not the passed-in array is already sorted, defaults to
false
- iter
function
an iterator function prototyped as
iter(key,value,...)
- ...
var_arg
Optional extra-args to be passed to
iter
function
Returns:
-
table
a new array
see also:
- unique (array[, isSorted[, iter[, ...]]])
-
Alias for uniq.
Parameters:
- array
- isSorted
- iter
- ...
- union (...)
-
Returns the duplicate-free union of all passed in arrays.
Parameters:
- ... var_arg a variable number of arrays arguments
Returns:
-
table
a new array
- intersection (array, ...)
-
Returns the intersection of all passed-in arrays.
Each value in the result is present in each of the passed-in arrays.
Parameters:
- array table an array
- ... var_arg a variable number of array arguments
Returns:
-
table
a new array
- zip (...)
-
Merges values of each of the passed-in arrays in subsets.
Only values at the same position in the initial array are merged.
Parameters:
- ... var_arg a variable number of array arguments
Returns:
-
table
a new array
- append (array, other)
-
Clones
array
and appendsother
to the result.Parameters:
Returns:
-
table
a new array
- range (...)
-
Produce a flexible list of numbers. If one positive value is passed, will count from 0 to that value,
with a default step of 1. If two values were passed, will count from the first one to the second one, with the
same default step of 1. A third passed value will be considered a step value.
Aliased as countParameters:
- ... var_arg a variable list of numbers
Returns:
-
table
a new array of numbers
see also:
- count (...)
-
Alias for range.
Parameters:
- ...
- invert (array)
-
Inverts
key-value
pairs. Keys becomes values, while values becomes keys.
Aliased as mirrorParameters:
- array table a given array
Returns:
-
table
a new array
see also:
- mirror (array)
-
Alias for invert.
Parameters:
- array
- concat (array[, sep[, i[, j]]])
-
Concatenates values in a given array. Handles booleans as well. If
sep
string is passed, it will be used as a separator. Optionali
andj
will only concatenate values within[i,j]
range.
Aliased as joinParameters:
- array table a given array
- sep
string
a separator string, defaults to
''
. - i number the starting index, defaults to 1.
- j number the final index, defaults to the array length.
Returns:
-
string
a string
see also:
- join (array[, sep[, i[, j]]])
-
Alias for concat.
Parameters:
- array
- sep
- i
- j
- identity (value)
-
Returns the passed-in value. Used internally as a default iterator.
Parameters:
- value arg a value
Returns:
-
arg
the passed-in value
- once (f)
-
Returns a version of
f
that runs only once. Successive calls will makef
keep yielding the same answer, no matter what the passed-in arguments are. Can be used to init variables as well.Parameters:
- f function a function
Returns:
-
function
a new function
- memoize (f[, hash])
-
Memoizes a given function by caching the computed result.
Useful for speeding up slow-running functions. If function
hash
is passed, it will be used to compute unique keys from args passed tohash
for results caching.
Aliased as cacheParameters:
- f function a function
- hash function a hash function, defaults to identity
Returns:
-
function
a new function
see also:
- cache (f[, hash])
-
Alias for memoize.
Parameters:
- f
- hash
- after (f, count)
-
Returns a version of
f
that runs on thecount-th
call. Useful when dealing with asynchronous tasks.Parameters:
- f function a function
- count
number
the number of calls before
f
answers
Returns:
-
function
a new function
- compose (...)
-
Composes functions. Each passed-in function consumes the return value of the function that follows.
In math terms, composing the functions
f
,g
, andh
producesf(g(h(...)))
.Parameters:
- ... var_arg a variable number of functions
Returns:
-
function
a new function
- wrap (f, wrapper)
-
Wraps
f
inside of thewrapper
function. It passesf
as the first argument towrapper
. This allows the wrapper to execute code before and afterf
runs, adjust the arguments, and execute it conditionally.Parameters:
- f
function
a function to be wrapped, prototyped as
f(...)
- wrapper
function
a wrapper function, prototyped as
wrapper(f,...)
Returns:
-
function
a new function
- f
function
a function to be wrapped, prototyped as
- times (n, iter, ...)
-
Runs
iter
functionn
times. Collects the results of each run and returns them in an array.Parameters:
- n
number
the number of times
iter
should be called - iter
function
an iterator function, prototyped as
iter(i,...)
- ...
var_arg
extra-args to be passed to
iter
function
Returns:
-
table
an array of results
- n
number
the number of times
- bind (f, v)
-
Binds
v
to be the first argument to functionf
. As a result, callingf(...)
will result tof(v,...)
.Parameters:
- f function a function
- v arg an argument
Returns:
-
function
a function, prototyped as
f(v,...)
- bindn (f, ...)
-
Binds
...
to be the N-first arguments to functionf
. As a result, callingf(a1,a2,...,aN)
will result tof(...,a1,a2,...,aN)
.Parameters:
- f function a function
- ... var_arg a variable numer of arguments
Returns:
-
function
a function, prototyped as
f(v,...)
- uniqueId ([template[, ...]])
-
Generates a unique Id (unique for the current session). If given a sring template
will use this template for output formatting. Otherwise, if template is a function,
will compute an output running
template(id,...)
.
Aliased as uId.Parameters:
- template string or function either a string or a function
- ... var_arg a variable numer of arguments to be passed to template , in case it is a function.
Returns:
-
id
a formatted Id
see also:
- uId ([template[, ...]])
-
Alias for uniqueId.
Parameters:
- template
- ...
- keys (obj)
-
Returns the names of the object properties.
Parameters:
- obj table an object
Returns:
-
table
an array
- values (obj)
-
Returns the values of the object properties.
Parameters:
- obj table an object
Returns:
-
table
an array
- pairs (obj)
-
Returns an array of
obj
key-values pairsParameters:
- obj table an object
Returns:
-
table
an array
- extend (destObj, ...)
-
Extends an object properties. It copies all of the properties of extra passed-in objects
over to the destination object, and returns the destination object.
The last object in
...
will override properties of the same name in the previous oneParameters:
- destObj table a destination object
- ... var_arg a variable number of array arguments
Returns:
-
table
the destination object extended
- functions (obj[, output])
-
Returns a sorted list of all methods names found in an object. If the given object
has a metatable implementing an
__index
field pointing to another table, will also recurse on this table. Ifoutput
is provided, will export results in this table.
Aliased as methods.Parameters:
Returns:
-
table
an array of methods names
see also:
- methods (obj[, output])
-
Alias for functions.
Parameters:
- obj
- output
- clone (obj[, shallow])
-
Clones a given object properties. If
shallow
is passed will also clone nested array properties.Parameters:
- obj table an object
- shallow boolean whether or not nested array-properties should be cloned, defaults to false.
Returns:
-
table
a clone of the passed-in object
- has (obj, key)
-
Checks if a given object implements a property.
Parameters:
- obj table an object
- key key a key property to be checked
Returns:
-
boolean
true or false
- pick (obj, ...)
-
Return a filtered copy of the object. The returned object will only have
the whitelisted properties.
Aliased as choose.Parameters:
- obj table an object
- ... var_arg a variable number of string keys
Returns:
-
table
the filtered object
see also:
- choose (obj, ...)
-
Alias for pick.
Parameters:
- obj
- ...
- omit (obj, ...)
-
Return a filtered copy of the object. The returned object will not have
the blacklisted properties.
Aliased as drop.Parameters:
- obj table an object
- ... var_arg a variable number of string keys
Returns:
-
table
the filtered object
see also:
- drop (obj, ...)
-
Alias for omit.
Parameters:
- obj
- ...
- template (obj, template)
-
Fills nil properties in an object with the given template object. Pre-existing
properties will be preserved.
Aliased as defaults.Parameters:
Returns:
-
table
the passed-in object filled
see also:
- defaults (obj, template)
-
Alias for template.
Parameters:
- obj
- template
- isEqual (objA, objB[, useMt])
-
Performs an equality test between two objects.
Can compare strings, functions (by reference), nil, booleans. Compares tables by reference or by component-values.
Comparing objects, if
useMt
is passed, the equality operator==
will be used if one of the given objects has a metatable implementingmt.__eq
Parameters:
- objA table an object
- objB table another object
- useMt
boolean
whether or not
mt.__eq
should be used, defaults to false.
Returns:
-
boolean
true or false
- result (obj, method[, ...])
-
Invokes an object method. It passes the object itself as the first argument. if
method
is not callable, will returnobj[method]
.Parameters:
- obj table an object
- method
string
a string key to index in object
obj
. - ...
var_arg
Optional extra-args to be passed to
method
Returns:
-
value
the returned value of
method(obj,...)
call - isObject (obj)
-
Checks if the given arg is an object (i.e a Lua table).
Parameters:
- obj object an object
Returns:
-
boolean
true or false
- isCallable (obj)
-
Checks if the given arg is an callable. Assumes
obj
is callable if it is either a function or a table having a metatable implementing__call
metamethod.Parameters:
- obj object an object
Returns:
-
boolean
true or false
- isArray (obj)
-
Checks if the given arg is an array. Assumes
obj
is an array if is a table with integer numbers as indexes.Parameters:
- obj object an object
Returns:
-
boolean
true or false
- isEmpty (obj)
-
Checks if the given is empty. If
obj
is a string, will return true if#obj==0
. Otherwise, ifobj
is a table, will return whether or not this table is empty.Parameters:
- obj object an object
Returns:
-
boolean
true or false
- isString (obj)
-
Checks if the given arg is a string.
Parameters:
- obj object an object
Returns:
-
boolean
true or false
- isFunction (obj)
-
Checks if the given arg is a function.
Parameters:
- obj object an object
Returns:
-
boolean
true or false
- isNil (obj)
-
Checks if the given arg is nil.
Parameters:
- obj object an object
Returns:
-
boolean
true or false
- isFinite (obj)
-
Checks if the given arg is a finite number.
Parameters:
- obj object a number
Returns:
-
boolean
true or false
- isNumber (obj)
-
Checks if the given arg is a number.
Parameters:
- obj object a number
Returns:
-
boolean
true or false
- isNaN (obj)
-
Checks if the given arg is NaN (see Not-A-Number).
Parameters:
- obj object a number
Returns:
-
boolean
true or false
- isBoolean (obj)
-
Checks if the given arg is a boolean.
Parameters:
- obj object a boolean
Returns:
-
boolean
true or false
- import ()
-
Imports all library functions in the global environment.
Aliased as mixinsee also:
- mixin ()
- Alias for import.


PPIRL
Publications
Software
User Study
Debriefing
Committees
About Us
Acknowledgements
User Study
https://ppirlnew.herokuapp.com/?mode=&sampling=&id=
https://ppirl-ustudy1.herokuapp.com/?mode=&sampling=&id=
https://ppirl-ustudy1-g.herokuapp.com/?mode=&sampling=&id=
https://ppirl-ustudy1-p.herokuapp.com/?mode=&sampling=&id=


--- layout: presentation title: "Event Driven Serverless - DevOps Meetup" --- Event Driven Adventures in Serverless Lansing DevOps Meetup November 5th, 2019 Brendon Thiede DevOps Platform Engineer Minimalist Penny Pincher This is not a talk about why you should start using serverless... Optimizations CAP Theorem Consistency Availability Partition Tolerance DERP Theorem Debugability Expenses Redundancy Performance Serverless Optimizations Hardware Utilization Bare metal Virtual Machines Containers Functions Cost Per CPU time unit Per memory usage I/O Serverless Options Lambda Cloud Functions Azure Functions OpenWhisk Cloudflare Workers Knative Minimum Requirements Distributed Tracing API gateway/routing management Cost analysis Eventing Push vs Pull Event Triggers HTTP Message Queue Database Change File Change Timer Patterns for Eventing CQRS Event Sourcing Actor Model (Akka) Messaging Concepts Peek/Pull Retries/TTLs Dead Letter Queue Use Cases File Conversion Approvals Alerting Traffic Spikes CI/CD Predictions Better management tools Behind the scenes transformation Open standards for eventing References Serverless Framework Azure Durable Functions DevOps Meetup - Azure Functions
Lansing DevOps Meetup November 5th, 2019


[gecode-users] Limiting some combinations of variables
Pascal Francq (Mailing lists)
mailing-list at francq.info
Thu Jun 6 19:13:16 CEST 2013
Hi,
I have a question regarding how to avoid some combinations of variables
to test. I give here a simple example:
1. I have four IntVar a,b,c and d.
2. I want to allow a=2*b=2*c only if a==1 and d==0.
If have try to encode this constraint with a code that looks like:
BoolVar tmp;
tmp=expr(home,(a!=1)&&(a==2*b)&&(a==2*c)&&(d==0));
rel(home,!tmp);
But it seems that it does not try the only combination allowed.
Is this the correct way ?
Thanks.
--
Dr. Pascal Francq
Belgium
More information about the users
mailing list


Connor's Blog
Home
About
Blog
Portfolio
Social Media
Contact
Search
Welcome to My Blog!
First Post!
GITty Up!
CSS Positioning Explained by a Dingus


Binomial || Poisson || Set Conf Levels
This page computes exact (Poisson-based)confidence intervals around event rates, and calculates the significance of the difference between two event rates.
By default, it calculates symmetrical 95% confidence intervals, but you can change the "tail areas" to anything you'd like.
The formulas used in this web page are also available as Excel macros, which you can download in the file: confint.xls (44k long).
Note: Before using this page for the first time, make sure you read the JavaStat user interface guidelines for important information about interacting with JavaStat pages.
Enter the observed numerator and denominator counts, then click the Compute button:
Numerator:
Denominator:
Proportion:
Exact Confidence Interval:
to
Enter the number of observed number of events, then click the Compute button:
Observed Events:
Normally you will not need to change anything in this section. People usually use symmetrical 95% confidence intervals, which correspond to a 2.5% probability in each tail. If you want a different confidence level, you can replace the 95 with your preferred level, then click the Compute button. The program will split the tail area evenly between the Lower and Upper tails.
If you want asymmetrical limits, you can change the % Area numbers in the Lower Tail and Upper Tail cells shown below, then click the Compute button. The program will adjust the Confidence Level level accordingly.
Confidence Level:
% Area in Upper Tail:
% Area in Lower Tail:
Note: A special situation arises when the observed count falls at one or the other end of the range of possible values (such as an observed count of zero). In that case, one of the confidence limits must equal the observed count, so there is no "tail area" on that side of the confidence interval. All of the tail area must therefore be allocated to the other side of the interval, rather than split up between the two tails. Effective June 19, 2004, this page applies this adjustment automatically.
So be aware of the following special actions this page will take:
If the Poisson observed event count is zero, or if the Binomial numerator is zero, this page will return a lower confidence limit of 0, and will, in effect, double what you have specified as the Upper Tail probability.
If the Binomial numerator is equal to the denominator, this page will return an upper confidence limit of 1, and will, in effect, double what you have specified as the Lower Tail probability.
The easiest thing to remember is: For ordinary 95% confidence limits, just leave the Tail Areas exactly as they are, and don't worry about it.
Reference: CJ Clopper and ES Pearson, "The use of confidence or fiducial limits illustrated in the case of the binomial." Biometrika 26:404-413, 1934.


TODO
title: 'Free “as in free speech” or why I don’t by Apple’s products' author: David Bruant layout: post permalink: /?p=270 categories:
- Uncategorized
I read the RudeBaguette‘s article about the silence since the Applidium’s hack and it reminded me the core ideals I care about and what I fight for.
The article
Some folks “hacks” Siri, figured a way to use it in a way Apple hasn’t intended it for and advertised it on their blog. It creates a buzz, some people see potential (use Siri as a remote control, to turn off your car and lock it…).
Then, suddenly, no one talks about it anymore. The blog posts with reverse engineering details disappears. And no press cover anymore.
The article suggests a conspiracy as a conclusion.
Apple’s world
Apple Terms Of Services:
“Apple grants you a personal, non-exclusive, non-transferable, limited license to use the Software as provided to you by Apple as a part of the Service and in accordance with these TOS; provided that you do not (and do not permit anyone else to) copy, modify, create a derivative work of, reverse engineer, decompile, or otherwise attempt to discover the source code (unless expressly permitted or required by law), sell, lease, sublicense, assign, grant a security interest in or otherwise transfer any right in the Software.” (emphasis added)
No reverse engineering? No decompiling? No granting of a security interest? That’s a lot of restriction! Probably too restrictive to make Applidium’s reverse-engineering legal by Apple’s terms.
Legal terms and conspiracy
I’m not a legal expert in any fashion, but Stéphane Distinguin declining to comment, the press stopping to cover Applidium’s hack may just be the effect of Apple applying its terms of services, it’s legal rights. A conspiracy? I don’t see any conspiracy. Just a company claiming its rights.
 Idealists? Naive? Maybe.
Apple does not allow you to do what you want with what you buy. If you buy an Apple device knowing that on purpose, that’s your choice. If you buy an Apple device and think there is a conspiracy whenever they remind you that you’re not allowed to do what you want with you’re device, you’re just fooling yourself.
Some choices of my own
As it turns out, I don’t buy Apple products. Because I want to be in control of my own life. I want to be able to hack my device to use it as a remote control (I don’t have a TV) or to turn my car off and lock it (I don’t have a car) and not being told by the company who I bought it from that I am not allowed to. I believe in Creative Commons content that people will be able to share for the purpose of education. I believe in projects like Mozilla’s Boot2Gecko with which I’m sure I’m never going to be told that I can’t do what I want. I believe in free software so that I don’t get fucked later on and am never in doubt of a conspiracy of any sort.


Project Presentation: Which Puppy Are You?
Created by: Natalie Khaled, Hannah Arstingstall, Megan Moore, and Jason Basden
reveal.js
simpler than other frameworks, user friendly
What does it do?
Using JSON & a dog API service to retrieve a certain type of puppy based on your quiz answers


Our mission
Save lives
Use robotics to create solutions that can have a direct impact on people's lives.
Compete
Participate and stand out in robotics competitions around the world.
Train future engineers
Push our members to develop multiple new engineering skills.


Akan names are derived from Ghanian culture. Frequently in Ghana, children are given their first name as a 'day name' which corresponds to the day in the week they were born. Here are Ghanian day names.
Akan Naming Tool
Akan names are derived from Ghanian culture. Frequently in Ghana, children are given their first name as a 'day name' which corresponds to the day in the week they were born. Here are Ghanian day names.


Artificial Intelligence(AI) is the term to describe the capability of computer software / computer-controlled robots to perform tasks that are normally think about when talking about sentient being or tasks that can be considered intelligence if performed by organic beings. The field of study regarding AIs is very broad, with many subset and applications, one of which is machine learning. Machine learning is the field of study of computer algorisms that find and analyze pattens and relationships from a set of data and from which, concludes a possible outcome from those data. When compare to natural intelligence, AI excels at being a very fast learner that can absorbs a very large amount of data and to classify them according to their attributes. AIs although have a very high development cost, its operation cost can be very consistent and inexpensive once installed in a computer. The best advantage of AIs so far is that it can be very easy for the duplication and documentary of knowledge, and AIs can store those knowledges permanently, unlike natural intelligence which can only store information for a limited amount of time, takes a lot of resources and time to duplicate and sometimes the knowledges that is duplicated can be incomplete. As of now, the field has developed to the point of AIs can have many applications on human life such as
- Image recognition: the systems can understand differentiate visual inputs thanks to deep structured learning and development is the field of computer vision. This application already having an impact on many fields of work: the police use facial recognition software to compare the characteristic of a suspected individual to the existing database and draw the conclusion based on the similarity between the two.
Figure: Facial recognition system
Source: Adapted from [4]
- Expert systems: those are systems that try to mimic human by focus on a certain domain. Currently, expert systems can act as support to decision maker by suggesting course of actions and possible effect that action can make if taken or if the situation demands, take the action by itself.
- Gaming: for a long time, AI is an essential part of rigid rule-based games such as chess or different ways of playing the game of cards as bots to act as the adversary. For this purpose, the AI can come up with many possible positions and can adapt to the player’s styles after every match by the method of try and false. The technology of AI and its subset of machine learning is also useful in shooting game, especially FPS or strategy game, where the AI can constantly adapt to the player’s playstyle and devise effective countermeasures
As for the close future, the likeliest possible for the field of AI is to further improve upon existing capabilities, such as makes the gaming bot better adapts to the player and make it better realize the actions that is designed to misinform the bot and make it learn the wrong things. As for the next few years will see AI further integrate into society, taking roles is management, analyze the effects that cab be afflicted before any decision is made and operating industrial machineries.
. Of course, the increasingly clear involvement of AI will have profound impact many facets of society. In the field of stock exchange, AI is already used for high-speed transaction by analyzing a very large amount of data and the decide to trade at the optimal price with the speed and accuracy far surpass any human agency. In terms of healthcare, AI can be used to diagnose diseases based on the finding possible symptoms, and prodded adequate treatment from those findings. In business and industries, AI can be used to manage resources and databases, operate heavy machinery with great accuracy for manufacture or to operate in hazardous area such as nuclear reactor maintenance. AI can also act as customer service or being advisor. And in places such as Japan, they even turn AI into human’s companion, amlost completely replace the need for a spouse. But with this new possibility that AI brings there also arose many questions, especially about the issue of jobs and the future of many services. Whole fields of work will see mayor restructure and massive layoffs, which will hit especially hard on blue-collar jobs in fields such as manufacture, mining, agriculture, logging, janitor, … .These jobs employs hundreds of millions of people, even billions of people, the vast majority of whom are paid very low and is not financially able to learn new skills that can get them a new job and government-subsidized learning center are often underfunded and often teach unusable skills. The service sector will also have to perform massive layoffs as robots controlled by AI can perform almost any task that is currently performed by human staff, it does not need wage, does not form unions, and does not flinch when a Karen comes and makes a tantrum in the shop. However, AI can also open new opportunities and create new jobs, as works such as coding in high demand. AI can also create new opportunities in entrepreneur, as people has the means to set up effective business by themselves.
Figure: Gatebox's hologram assistant
Source: Adapted from [5]
. To me personally, AI is something that will be much needed both short and long terms. For my project idea’s game, utilizing artificial intelligence will be a very big help with both gameplay and the ability to keep player replaying after finishing the game. The AI will adapt to the player’s playing style and adapt accordingly. This is to ensure challenging gameplay as every time the player come back to the area, the ships become stronger and the boss becomes more and more tactical in its movement overtime. As for the long run, with the fact that I am studying about Information technology, the field of Artificial Intelligence will become the backbone of many project that I will be involved into in the future. For my family, AI will be something that will help them improve their work efficiency, better save their money, and improve their standard of living by being an advisor, a companion who helps them access modern technology. Its vast database can help my brother improve his study by analyze his personality and give him extra lectures that enhance his talents and help mitigate his shortcoming.
The AI controls the enemy bots will adapt to the player after every round to change strategy
AI can be a great help with work and education
Virtual reality (VR) is the result of using computer science to create an environment that can be either similar or different from the world that we are currently living in. With VR, one can create a totally immersive environment by using an application programming interface that supports VR devices, such as WebVR. To make VR fully immersive, all senses must be under the control of the system, and to feed data from the virtual world to the user, who is still staying in the realm of the real, special VR gears are needed. The most basic, which is the most iconic when talking about virtual technology is the head-mounted display. It creates the feeling of virtual stimulation by generate two images and display those images from two different perspectives while also enhance that experience by incorporating features such as head-tracking. Along with the famous headset, there are also wire gloves, a 3D mouse, motion controller, and optical sensors to further enhance the experience. There are also VR cameras that can be used to create VR 360 interactive photography, but with low resolutions or in compressed format.
Augmented reality is the result of using computer systems to augment real-world scenery include extra information, sound, or filter, and allow real-time interaction between the user and the system, while the user still maintains a presence in the real world, with most scenes unaffected and not under control by the system. AR works by register objects from the real world in the scene, then insert the enhancement graphic, audio, or other senses and then track them with the 3D objects and change them in real-time, depending on the user’s action. Augmented reality systems need three main components to function properly: a display, a tracking system, and a computing device. Luckily, all three of them are already integrated into the average smartphone that a person normally owns, with the phone’s cameras act as both the display and serve the purpose of tracking while the phone’s computational power is enough to fill the role of being the AR system’s computation device.
Figure: HUDWAY's head-up display
Source: Adapted from [6]
Both AR and VR have the enormous capability in a wide range of fields from military to entertainment, training, medical, ...
In the entertainment industry, cinemas have been using this technology for a long time, notably with the service of 3D cinema. Videogames with VR compatibility has seen an explosion of number and interest since the 2010s, with a new generation of commercial headsets released by HTC, Oculus, and Sony that makes VR becomes cheaper and more accessible to the mass. The idea of events hosted in the virtual realm has been in consideration for a long time. Thanks to the outbreak, this idea has become a way for events to be hosted without causing any health and safety hazards
VR technology also has the potential for usage in the medical industry. Medical schools can train their students using simulated VR programs for high-risk operations such as surgeries without risking the lives of patients in the hand of inexperienced students.
Due to its nature of creating an immersive environment, virtual reality can have a big impact on education and training. Courses that used to be very expensive like engineering or very dangerous such as parachuting, or combat drill can now become cheaper thanks to the fact that students can interact with 3D objects and it will react accordingly that is similar to field practice.
For entertainment, broadcasts and TV shows have been using AR to display extra information, regarding the show that is on air. The videogame industry also implements AR, creating games that let the user experience digital gameplay play layered with real-world elements. An example of this is Niantic’s release called Pokémon Go, which became one of the biggest hits in the world in 2016.
Screenshot: A Fox Sport commetary
Source: Adapted from [7]
In both the defense sector and in civilian industries, augmented reality is used in the form of the HUD (Head-Up Display) ever since the 1950s. This technology is integrated into aircraft, ships, automobiles, … to help the user better control their vehicles.
Screenshot: F/A 18's HUD in BF3
Source: Adapted from [8]
. As AR/VR further integrate into society, it will certainly leave a big impact on human life in many fields. One such field is medicine. AR/VR can help improve medical service quality by improving the student’s training and enhance services. A medical student can train with performing operations using VR systems and have information and can contact other doctors on their display for real-time discussion during operation. Another field that will see a big impact from this technology is the film industry. With VR, filmmakers will have greater flexibility in filmmaking. The director can choose to shoot a scene from all angles, instead of choosing only one. Viewers can also have this flexibility in choosing an angle to watch the movie. For AR, film directors can use their talent to the fullest to create VFX that resembles reality and to see the pre-rendered version of what they are doing. Although AR/VR can have a very positive impact on a human’s standard of life, it will also cause new problems. One of which is that just like the Internet, once these technologies are fully integrated and institutionalized, there arose a question: Is what appears in front of me the truth? And if so, who is there to guarantee it as such? Especially with the modern world with certain private companies having an almost monopoly on the Internet, have enormous lobby power against politicians, and can dodge regulations, what regulation will be needed to ensure that the market of AR/VR won’t share the same fate?
.  On the short term, AR/VR can be implemented to my project idea, if it’s chosen for assignment 3, as a form of extra stage or as a separate game mode. This will give the project’s result a nice extra gig to kill time. The use of VR/AR in training will further implement in many fields, especially during the current situation. On the long run, when the price for devices drop to the point of mass adaptability, things like car’s counters can have AR technology built in as it will make navigation much easier. If possible then I would like to replace the prospect of marry my fiancée with having VR spouse, as it will be extremely efficient, especially when talking about long term planning. It won’t cheat on you, won’t bring drama to your life, and it certainly won’t try to file for divorce to the biased family court and split your property and childcare right after cheating against you.
As I have stated back in Assignment 1, with the expected skills and capability acquired throughout my time studying in RMIT, being a developer is the choice that best suits that criteria. It let me earn enough to pay the bills and allow me to build a career and can work abroad. A developer is, according to techopedia: “an individual that builds and create software and applications. He or she writes, debugs and executes the source code of a software application” [9]. The work of a developer can be classified into different categories, based on the type of software and the role of the developer.
A developer’s workday usually starts by checking mails for updates and communication between members and between departments. Their work is mainly about software and programs. And as such, a large part of their daily work revolves around coding and debugging. They can work as freelancers hired by clients or work in corporations in projects both large and small. Besides coding, he also has to work effectively in a group. For that, He has to go to meetings for discussions about the situation and the project’s path. They also frequently check their repositories on services such as GitHub and code review, so that codes with errors don’t get to the production phase. Besides interaction with their peers or with their clients, they also interact with the corporation’s department in the form of surveys. These surveys either be daily or happens once a year. In the modern workplace, in the West at least can have a very flexible workplace, with they can spend their time working either in the office or at home. However, due to the outbreak and the subsequent lockdown, working in the office has become a safety hazard and such, most of their work is done at home. The most challenging part of becoming a developer is to effectively cooperate with people as a group to produce results that can satisfy the requirements without being heavily affected by internal friction and delays.
created with
Website Builder Software .


|
Apache Mesos
|
Represents a connection to an HTTP server. More...
#include <http.hpp>
Public Member Functions | |
| Connection ()=delete | |
| Future< Response > | send (const Request &request, bool streamedResponse=false) |
| Sends a request to the server. More... | |
| Future< Nothing > | disconnect () |
| Disconnects from the server. More... | |
| Future< Nothing > | disconnected () |
| Returns a future that is satisfied when a disconnection occurs. More... | |
| bool | operator== (const Connection &c) const |
| bool | operator!= (const Connection &c) const |
Friends | |
| Future< Connection > | connect (const network::Address &address, Scheme scheme) |
| Future< Connection > | connect (const URL &) |
Represents a connection to an HTTP server.
Pipelining will be used when there are multiple requests in-flight.
TODO(bmahler): This does not prevent pipelining with HTTP/1.0.
|
delete |
Returns a future that is satisfied when a disconnection occurs.
|
inline |
|
inline |
| Future<Response> process::http::Connection::send | ( | const Request & | request, |
| bool | streamedResponse = false |
||
| ) |
Sends a request to the server.
If there are additional requests in flight, pipelining will occur. If 'streamedResponse' is set, the response body will be of type 'PIPE'. Note that if the request or response has a 'Connection: close' header, the connection will close after the response completes.
|
friend |
|
friend |


Welcome to my GitHub Page.
I will edit all this eventually.
Current Projects
| Project | Repository Link | GitHub.io Link |
|---|---|---|
| Tabbed Subpanels for SuiteCRM | https://github.com/blasher?tab=repositories | https://blasher.github.io/tabbed_subpanels/ |
Support or Contact
Having trouble with this page? Email me at<EMAIL_ADDRESS>and I’ll help you sort it out.


Welcome to the Quiz for 3rd Graders! The purpose of this quiz is to test your ability to pass the third grade. Each time you answer a question correctly, your score increases by 1. If you answer
incorrectly, you lose 30 seconds off the clock. Good luck!