General support queries. User Guides: https://support.komodoplatform.com/ Support staff: Angelina#6231 gcharang#6833. If you want to ask JL777 a question, use the #ask-jl777 channel.
Desktop App for SuperNET DAPPs. Contribute to VerusCoin/Agama development by creating an account on GitHub.
Malong01009-Jun-19 08:18 AM
How long will it take to receive my kmd after claiming it?
I am talking about the funds sweeped from agama on june 5th
farl09-Jun-19 08:21 AM
Below 7777 KMD they expect around 15 june
Hansie09-Jun-19 11:05 AM
Sorry for maybe asking a dumb question, but when typing in my seed in the Agma Verus v0.5.7 on MacOS, the last character is not accepted. I cannot use the wallet to send a small transaction to my new address. Is there any solution to this?
Hansie09-Jun-19 11:12 AM
Or can I use the sweep function to send kmd from my old wallet to my new one?
polycryptoblog09-Jun-19 11:13 AM
Try typing seed in notepad and copying it over
Hansie09-Jun-19 11:18 AM
Thanks, I tried that but it did not work. I just fixed the problem by downloading the v0.6.0-13 version
almasya09-Jun-19 11:49 AM
Great job! Return KMD received! Support answered instantly, thanks. With you, I first used the discord.))
smk762 - dracocanis ominator09-Jun-19 11:54 AM
Great to hear @almasya Glad we could help!
DigitalPunk09-Jun-19 12:02 PM
Guys , I logged a support ticket yesterday via the Komodo website. I did not receive a reference number or anything like that. What is the General response time and how do you follow up on the support request?
polycryptoblog09-Jun-19 12:09 PM
@DigitalPunk was your support request in regards to the incident or for another issue?
SHossain09-Jun-19 12:11 PM
@DigitalPunk we have your ticket. since you botched up your natural refund process, you have to wait a bit until we finish up with normal refunds. don't worry. please just be patient.
Fabio Ferreira09-Jun-19 12:12 PM
Wanna say thanks to the BEST TEAM in the Crypto Space , all coins are back...HODLL KOMODO !!
2
DigitalPunk09-Jun-19 12:13 PM
@SHossain Thanks and understood
SHossain09-Jun-19 12:14 PM
we are working as hard and as fast as we can
thanks for understanding
DigitalPunk09-Jun-19 12:17 PM
@SHossain been having issues trying to move my last bit of ETH from KMD Agama to Verus Agama address. Any idea of known issues ?
SHossain09-Jun-19 12:18 PM
i used Verus Agama to move my ETH(edited)
DigitalPunk09-Jun-19 12:19 PM
Ok I’m trying to send it there from my compromised Agama wallet but the transaction hangs and then fails. No TX is provided...
Malong01009-Jun-19 12:43 PM
Where do i have to enter my old private key? It was not required until now?
So I sent discord ID, adress (old and new from verus agama, and amount) what are the next steps?
Cryptoon09-Jun-19 12:56 PM
now that the vast majority of addresses have been claimed, i can reveal the three step process that will be used for processing refunds.
1. a special transaction will be send to your compromised address. it will be for a fraction of a KMD
2. you need to send 0.0001 (or more) from the compromised address to the destination address you specified
3. IF and only IF, your address has no disputes, or contradictory claim info, and the proper destination address receives the special payment, a refund tx will be made. PLEASE do not ask when these refund tx will be made, i am working as fast as i can, so it will happen when it happens.
what do you need to do?
if your claim amount matches the current batches size range check to see if you got the special transaction. Then make sure you only send it to the address you claimed. after that, just wait. i will announce status of each batch.
if you didnt get a special tx, that means your address is under dispute or you filed too many claims or it is the wrong size. PLEASE wait until we process all the problem free cases first. They will be done AFTER the easy cases are done.
So once you see a small tx come in on your old address, use that small amount and send it to your new address so you can prove you owned the old wallet and want it to go to the new wallet.
@Malong010
RNI09-Jun-19 12:59 PM
I got my coins back Awesome!
1
1
Zedon09-Jun-19 01:12 PM
Same here...thanks
2
2
DigitalPunk09-Jun-19 01:18 PM
@SHossain Error API.apiEthereumsend is the error message I get when trying to send ETH from compromised Agama to Verus Agama address . Any suggestions ?
@SHossain so to confirm I extract the ETH privkey for my os and would then be able to use any ETH address to send my ETH to new Verus address?
SHossain09-Jun-19 01:29 PM
send ETH to your own secure ETH address
wherever that might be
DigitalPunk09-Jun-19 01:30 PM
@SHossain Thanks again
kp09-Jun-19 01:40 PM
if i want to change my receive address for my KMD claim (my own addr instead of binance deposit), can i just fill in the form again?
Gordon Komodo09-Jun-19 01:42 PM
yes, @kp just fill the form again(edited)
kp09-Jun-19 01:43 PM
thanks @Gordon Komodo
1
SHossain09-Jun-19 01:49 PM
if you already submitted a claim and you got verification tx sent out to your original address, submitting another claim with new refund address will not fix that instantly. you will have to wait.(edited)
Gordon Komodo09-Jun-19 01:50 PM
@kp
SHossain09-Jun-19 01:52 PM
when you want to change your refund address, your claim will be disputed for further verification and will be processed at the end of all normal refund
Esp09-Jun-19 01:57 PM
kmd was deposited into my wallet
Thanks to the kmd team
2
Schlammvieh09-Jun-19 01:57 PM
Received my money too - awesome work. If there is a donation address for the team please let me know - that’s the least you deserve...
Gordon Komodo09-Jun-19 01:58 PM
@Esp@Schlammvieh if you have twitter , please share that on your twitter thanks!(edited)
Schlammvieh09-Jun-19 01:59 PM
Will do!
kp09-Jun-19 02:02 PM
@SHossain the thing is, i entered my binance deposit address as refund address (i was early using the old form). now binance has closed deposits, so i cant even send the 0.0001 to that refund address to prove it. is there anything else i can do to get my kmd earlier than after everyone else?
Pwnz09-Jun-19 02:04 PM
Think everyone wants it earlier than everyone(edited)
SHossain09-Jun-19 02:04 PM
you can send to that Binance address, it will be visible to explorer. once verified, rest of the funds will go there. when binance resumes operation, you can get your funds back
@kp ^^
or, if you don't do that, it may take longer for you to get back funds if you resubmit claim with different address
the choice is yours
kp09-Jun-19 02:05 PM
i will have to wait until binance opens up deposits
as i dont have the deposit address, since its currently suspended
SHossain09-Jun-19 02:05 PM
did you not put a refund address already?
kp09-Jun-19 02:06 PM
i did, but can i see the form?
i thought its not accessible for me now?
SHossain09-Jun-19 02:06 PM
was it a binance address?
kp09-Jun-19 02:06 PM
yeah
and now deposits are suspended so i cant see the address
kmd was deposited into my wallet
Thanks to the kmd team
Buy only kmd
5
1
PD09-Jun-19 02:22 PM
In an earlier thread we were told to uninstall Amaga versions. Now they are saying we need the transaction ID, private keys, etc and to receive a transaction. Where are these transactions being sent if we already uninstalled the Agama? How do we retrieve the private keys ifs it uninstalled?
I recieved all my safeguarded coins back! Thank you for protecting them from the hacking community
2
1
@SHossain Prohashing can't pay in KMD because they claim that all the exchanges (Binance, Bittrex, and HitBTC) have the Komodocoin wallets locked. Is that true? Can you guys do anything to convince them to unlock them?
PD09-Jun-19 03:05 PM
@PHBA2061 i went with the komodo ocean option. I sent them my receiving address for that wallet. But now they want address of wallets i don't have installed anymore. Am i looking at this he wrong way?
spudboy99909-Jun-19 03:06 PM
@PD Use your compromized public key and associated WIF or seed in Verus wallet to send the confirmation amount to your new wallet
PD09-Jun-19 03:07 PM
Ok that info i still have
SHossain09-Jun-19 03:07 PM
@spudboy999 exchanges will resume wirhtdrawals and deposit when the time is right.
spudboy99909-Jun-19 03:07 PM
@SHossain Ok thank you for the update.
I use my Scyrpt miners on Prohashing but have them pay me in Komodo, because its the coin I think has the best future!
1
1
Duat_Yurtold09-Jun-19 03:09 PM
The new address submitted had to be from a Verus Agama address? If it was a different wallet we don't get refund?
spudboy99909-Jun-19 03:10 PM
@Duat_Yurtold It can be from any wallet that isn't compromised. You need to send the confirmation amount from your old public key to a new public key to get your safeguarded coins back
SHossain09-Jun-19 03:10 PM
it can be any KMD address
even Ledger
Herbi09-Jun-19 03:12 PM
i received my funds too!!! I initially believed that I would never become anything back. Because of the great tech you build and the trustworthy of your team i will defenetly stay a long time holder of KMD. THANKs a lot!
2
2
1
1
Duat_Yurtold09-Jun-19 03:13 PM
@spudboy999 I filled out the form with all requested info but used Coinomi wallet because I alreadt had it set up and was on break at work when I saw the announcement. Also used my discord ID but haven't seen funds or been contacted about an error with my claim. Not sure if I did something wrong but noone has told me so
SHossain09-Jun-19 03:14 PM
if anyone not doing any false claim, they will receive their funds back
joe20109-Jun-19 03:15 PM
Just got my KMD back, thanks!! @SHossain
Duat_Yurtold09-Jun-19 03:17 PM
@SHossain is it still ongoing then? I saw a post I thought to mean the reimbursements were done
joe20109-Jun-19 03:18 PM
@Duat_Yurtold from what I understand they have reimbursed about 20% of the claims so far
SHossain09-Jun-19 03:18 PM
claim and refund process are open
Duat_Yurtold09-Jun-19 03:18 PM
Ok I'll just wait for now. Thanks
grizzlehkitteh09-Jun-19 03:46 PM
Received my claim. Thanks for the help, and for keeping our funds safu!
4
4
WK09-Jun-19 04:16 PM
Hi. I haven't received a refund yet. Did I do something wrong? Can anyone please help me.form felt and sent.address entered by Bitpanda. The quantity is under 7777 KMD.
Yassin09-Jun-19 04:26 PM
you are follow instruction?
The Big Wan09-Jun-19 04:28 PM
The verus wallet can't connect for me, I was just wondering if there's a place where I can view if assets in a komodo wallet were moved.
WK09-Jun-19 04:34 PM
Yes I have followed everything. entered new address and sent dust.in the Explorer is still a U. What have I done wrong?
l777cToday at 5:05 PM
KMD first, assets will take longer as it is almost as much work as KMD for each assetchain
the number of addresses doesnt matter
what matters is if you did the proper steps and didnt submit conflicting data
i get daily claims data
i will process daily
not setup for assets yet
@jl777c you can check @WK
WK09-Jun-19 04:37 PM
Dust has not arrived but bitpanda must send at least 0.1 KMD. Is that my mistake? How do I get out of this situation?
jl777c09-Jun-19 04:38 PM
if dust is still unspent 'U' in the explorer, send ALL funds from old address to new address
WK09-Jun-19 04:46 PM
Dust I got to old address. Then I sent dust to the new address. The new address is Bitpanda address. Nothing arrived. Explorer shows U. Does nothing mean arrived? I also have an address at Guarda. If I now make form for Guarda? Or better not?


Path-to-RegExp
Turn an Express-style path string such as /user/:name
into a regular expression.
Note: This is a legacy branch. You should upgrade to 1.x
.
Usage
javascript
var pathToRegexp = require('path-to-regexp');
pathToRegexp(path, keys, options)
- path A string in the express format, an array of such strings, or a regular expression
- keys An array to be populated with the keys present in the url. Once the function completes, this will be an array of strings.
- options
- options.sensitive Defaults to false, set this to true to make routes case sensitive
- options.strict Defaults to false, set this to true to make the trailing slash matter.
- options.end Defaults to true, set this to false to only match the prefix of the URL.
javascript
var keys = [];
var exp = pathToRegexp('/foo/:bar', keys);
//keys = ['bar']
//exp = /^\/foo\/(?:([^\/]+?))\/?$/i
Live Demo
You can see a live demo of this library in use at express-route-tester.
License
MIT


I'm a Computer Science student at Federal Center for Technological Education of Rio de Janeiro. Furthermore, I love programming, and I like not only build Web projects but also go deep into data structures, competitive programming (getting started) and Artificial Intelligence. I've built this website to conclude the Front-End Web UI Frameworks and Tools: Bootstrap 4 course on Coursera by Jogesh Muppala, this is part of the Full Stack Web Development with React Specialization that I've attended. This Website is built using Bootstrap Library integrated with Sass in order to perform customizations. At this moment, beyond studying personal projects and attending lessons in my B.S, I'm also doing a scientific research through my University. You can reach me on social media through the Github, Facebook, Instagram or Linkedln links that I've put on the footer the pages. Thank you! Felipe Curcio


Vendor Name:
Product Category:
FULL Name:
Job Title:
Main Phone:
Work Phone:
Mobile:
Fax:
Main Mail:
CC Mail:
Address Ship From:
Address Bill From:
Remark:
[[${vendor.remark}]]
Submit
Close


Toggle navigation
Golang Malaysia
Home
Posts
Contributing
project
Poll for 2016 August's meetup
Aug 10, 2016
project
Poll for 2016 August's meetup
Please enable JavaScript to view the
comments powered by Disqus.
comments powered by
Disqus


{% endmacro %}
{% macro collection_list(collections) %}
{# by default, we have all collections associated with user group of this analysis in the table #}
{% if collections.editable %}
You have permission to edit this record.
{% endif %}
Use Ctrl-click (or ⌘-click) on the ID column to select multiple collections.
{% for heading in collections.headings %}
{{ heading }}
{% endfor %}
{% for heading in collections.headings %}
{% endfor %}
{% for row in collections.rows %}
{% for key in collections.headings %}
{% if row.values[key].href is not none %}


I have been playing squash for the last 4 years.
I began playing squash with Highfield Squash Club and played there for 3 years.
When I was doing the Leaving Cert I took a break from Squash for a year to focus on my studies.
When I came to UCC I joined the UCC Squash Club and I have been playing since.
I am also the First Year Rep for the Club and organised the flights to Amsterdam for the club trip
I started swimming at a very young age and have always loved the water.
I have gone through all the levels of Irish Water Safety and completed my PoolGuard Qualification in September 2017
I currently teach Water Safety in Brookfield and hope to continue with this for the next few years


Notes and summaries for subjects
Save time by focussing on what matters. Study summaries, study guides, and class notes written by fellow students and quickly learn the essentials
Save time by focussing on what matters. Study summaries, study guides, and class notes written by fellow students and quickly learn the essentials


Hello ! Answer service is Up.
Do a POST request to
/shopping/understander/walmart
to have a analysis for statements related to walmart shopping business
eg.
{
"text" : "get me green chairs for adults that have price lesser than three hundred usd rating greater than 4 preference of five length of 5 width of 16 with two day shipping "
}
Note: Every input should be in word form and not symbols or numbers as this service is used to understand text that
comes from voice to text conversion


Tolko shuts B.C. divisions for two weeks over holidays
Head office to close from Dec. 23-27; two weeks’ downtime runs Dec. 21-Jan. 6
by Morning Star StaffIt won’t be a Merry Christmas for several local lumber giants.
Following a thorough examination of all contributing factors including log costs, market conditions, and cumulative policy burden, Tolko announced Thursday, Nov. 14, that its BC Operations will be taking two weeks’ downtime from Dec. 21 – Jan. 6 during the holiday season.
The last day of production will be Friday, Dec. 20, 2019.
In addition, Tolko’s Vernon head office will be closed the week of Dec. 23–27. Staffing levels at all B.C. Operations will be restricted to essential services during this period.
READ MORE: Tolko mill in Kelowna to permanently close in 2020
This downtime is a result of low prices and high log costs in B.C.
“This downtime will reduce output by approximately 21 Mmfbm (million board feet) of lumber production and 10 mmsft (million square feet) of panel production,” Tolko vice-president of Solid Wood Troy Connolly said.
Pino Pucci, vice-president, Tolko marketing and sales, continued to assure customers that Tolko’s marketing and sales team “will continue to support our customers and do our best to minimize any impacts. Our customers are understanding of current market conditions and aware of our ongoing commitment to serve them.”


#include "coverage_path.h"
Go to the source code of this file.
Functions | |
| bool | generate_path (geometry_msgs::Point start, const vector< geometry_msgs::Point > *roi=nullptr) |
| Generate an optimal coverage path for a given area. More... | |
| bool | generate_path_callback (const cpswarm_msgs::PathGenerationGoal::ConstPtr &goal, GenerationAction *as) |
| Callback to execute the action server that generates the path. More... | |
| bool | get_waypoint (cpswarm_msgs::GetWaypoint::Request &req, cpswarm_msgs::GetWaypoint::Response &res) |
| Callback function to get the current waypoint of the path. More... | |
| int | main (int argc, char **argv) |
| A ROS node that computes the optimal paths for area coverage with a swarm of CPSs. More... | |
| void | swarm_state_callback (const cpswarm_msgs::ArrayOfStates::ConstPtr &msg) |
| Callback function to receive the states of the other CPSs. More... | |
| bool generate_path | ( | geometry_msgs::Point | start, |
| const vector< geometry_msgs::Point > * | roi = nullptr |
||
| ) |
Generate an optimal coverage path for a given area.
| start | The starting position of the path. |
| roi | Pointer to a ROI to cover. Optional, if not given mission area is covered. |
Definition at line 55 of file coverage_path.cpp.
| bool generate_path_callback | ( | const cpswarm_msgs::PathGenerationGoal::ConstPtr & | goal, |
| GenerationAction * | as | ||
| ) |
Callback to execute the action server that generates the path.
| goal | An empty action server goal. |
| as | The action server object. |
Definition at line 125 of file coverage_path.cpp.
| bool get_waypoint | ( | cpswarm_msgs::GetWaypoint::Request & | req, |
| cpswarm_msgs::GetWaypoint::Response & | res | ||
| ) |
Callback function to get the current waypoint of the path.
| req | Empty get waypoint request. |
| res | The current waypoint. |
Definition at line 150 of file coverage_path.cpp.
| int main | ( | int | argc, |
| char ** | argv | ||
| ) |
A ROS node that computes the optimal paths for area coverage with a swarm of CPSs.
| argc | Number of command line arguments. |
| argv | Array of command line arguments. |
Definition at line 180 of file coverage_path.cpp.
| void swarm_state_callback | ( | const cpswarm_msgs::ArrayOfStates::ConstPtr & | msg | ) |
Callback function to receive the states of the other CPSs.
| msg | UUIDs and states of the other CPSs. |
Definition at line 7 of file coverage_path.cpp.


|
NATS C Client with JetStream and Streaming support
3.7.0-beta
The nats.io C Client, Supported by Synadia Communications Inc.
|
Typedefs | |
| typedef void(* | natsMsgHandler) (natsConnection *nc, natsSubscription *sub, natsMsg *msg, void *closure) |
| Callback used to deliver messages to the application. | |
| typedef void(* | natsConnectionHandler) (natsConnection *nc, void *closure) |
| Callback used to notify the user of asynchronous connection events. | |
| typedef void(* | natsErrHandler) (natsConnection *nc, natsSubscription *subscription, natsStatus err, void *closure) |
| Callback used to notify the user of errors encountered while processing inbound messages. | |
| typedef natsStatus(* | natsEvLoop_Attach) (void **userData, void *loop, natsConnection *nc, natsSock socket) |
| Attach this connection to the external event loop. | |
| typedef natsStatus(* | natsEvLoop_ReadAddRemove) (void *userData, bool add) |
| Read event needs to be added or removed. | |
| typedef natsStatus(* | natsEvLoop_WriteAddRemove) (void *userData, bool add) |
| Write event needs to be added or removed. | |
| typedef natsStatus(* | natsEvLoop_Detach) (void *userData) |
| Detach from the event loop. | |
| typedef natsStatus(* | natsUserJWTHandler) (char **userJWT, char **customErrTxt, void *closure) |
| Callback used to fetch and return account signed user JWT. | |
| typedef natsStatus(* | natsSignatureHandler) (char **customErrTxt, unsigned char **signature, int *signatureLength, const char *nonce, void *closure) |
| Callback used to sign a nonce sent by the server. | |
| typedef const char *(* | natsTokenHandler) (void *closure) |
| Callback used to build a token on connections and reconnections. | |
| typedef void(* | natsOnCompleteCB) (void *closure) |
| Callback used to notify that an object lifecycle is complete. | |
| typedef int64_t(* | natsCustomReconnectDelayHandler) (natsConnection *nc, int attempts, void *closure) |
| Callback used to specify how long to wait between reconnects. | |
| typedef void(* | jsPubAckErrHandler) (jsCtx *js, jsPubAckErr *pae, void *closure) |
| Callback used to process asynchronous publish errors from JetStream. | |
| typedef void(* | jsPubAckHandler) (jsCtx *js, natsMsg *msg, jsPubAck *pa, jsPubAckErr *pae, void *closure) |
| Callback used to process asynchronous publish responses from JetStream. | |
| typedef void(* | stanPubAckHandler) (const char *guid, const char *error, void *closure) |
| Callback used to notify of an asynchronous publish result. | |
| typedef void(* | stanMsgHandler) (stanConnection *sc, stanSubscription *sub, const char *channel, stanMsg *msg, void *closure) |
| Callback used to deliver messages to the application. | |
| typedef void(* | stanConnectionLostHandler) (stanConnection *sc, const char *errorTxt, void *closure) |
| Callback used to notify the user of the permanent loss of the connection. | |
NATS Callbacks.
| typedef void(* natsMsgHandler) (natsConnection *nc, natsSubscription *sub, natsMsg *msg, void *closure) |
This is the callback that one provides when creating an asynchronous subscription. The library will invoke this callback for each message arriving through the subscription's connection.
| typedef void(* natsConnectionHandler) (natsConnection *nc, void *closure) |
This callback is used for asynchronous events such as disconnected and closed connections.
| typedef void(* natsErrHandler) (natsConnection *nc, natsSubscription *subscription, natsStatus err, void *closure) |
This callback is used to process asynchronous errors encountered while processing inbound messages, such as NATS_SLOW_CONSUMER.
| typedef natsStatus(* natsEvLoop_Attach) (void **userData, void *loop, natsConnection *nc, natsSock socket) |
After a connection has (re)connected, this callback is invoked. It should perform the necessary work to start polling the given socket for READ events.
| userData | location where the adapter implementation will store the object it created and that will later be passed to all other callbacks. If *userData is not NULL , this means that this is a reconnect event. |
| loop | the event loop (as a generic void*) this connection is being attached to. |
| nc | the connection being attached to the event loop. |
| socket | the socket to poll for read/write events. |
| typedef natsStatus(* natsEvLoop_ReadAddRemove) (void *userData, bool add) |
The NATS
library will invoke this callback to indicate if the event loop should start (add is
true) or stop (
addis
false`) polling for read events on the socket.
| userData | the pointer to an user object created in natsEvLoop_Attach. |
| add | true if the event library should start polling, false otherwise. |
| typedef natsStatus(* natsEvLoop_WriteAddRemove) (void *userData, bool add) |
The NATS
library will invoke this callback to indicate if the event loop should start (add is
true) or stop (
addis
false`) polling for write events on the socket.
| userData | the pointer to an user object created in natsEvLoop_Attach. |
| add | true if the event library should start polling, false otherwise. |
| typedef natsStatus(* natsEvLoop_Detach) (void *userData) |
The NATS
library will invoke this callback to indicate that the connection no longer needs to be attached to the event loop. User can cleanup some state.
| userData | the pointer to an user object created in natsEvLoop_Attach. |
| typedef natsStatus(* natsUserJWTHandler) (char **userJWT, char **customErrTxt, void *closure) |
This handler is invoked when connecting and reconnecting. It should return the user JWT that will be sent to the server.
The user JWT is returned as a string that is allocated by the user and is freed by the library after the handler is invoked.
If the user is unable to return the JWT, a status other than NATS_OK
should be returned (we recommend NATS_ERR
). A custom error message can be returned through customErrTxt
. The user must allocate the memory for this error message and the library will free it after the invocation of the handler.
userJWT
after each invocation of this handler.| typedef natsStatus(* natsSignatureHandler) (char **customErrTxt, unsigned char **signature, int *signatureLength, const char *nonce, void *closure) |
This handler is invoked when connecting and reconnecting. It should sign the given nonce
and return a raw signature through signature
and specify how many characters the signature has using signatureLength
.
The memory pointed by signature
must be allocated by the user and will be freed by the library after each invocation of this handler.
If the user is unable to sign, a status other than NATS_OK
(we recommend NATS_ERR
) should be returned. A custom error message can be returned through customErrTxt
. The user must allocate the memory for this error message and the library will free it after the invocation of this handler.
The library will base64 encode this raw signature and send that to the server.
signature
after each invocation of this handler.| typedef const char *(* natsTokenHandler) (void *closure) |
This is the function that one provides to build a different token at each reconnect.
| typedef void(* natsOnCompleteCB) (void *closure) |
Currently used for asynchronous natsSubscription objects. When set, this callback will be invoked after the subscription is closed and the message handler has returned.
| typedef int64_t(* natsCustomReconnectDelayHandler) (natsConnection *nc, int attempts, void *closure) |
This callback is used to get from the user the desired delay the library should pause before attempting to reconnect again. Note that this is invoked after the library tried the whole list of URLs and failed to reconnect.
| nc | the pointer to the natsConnection invoking this handler. |
| attempts | the number of times the library tried the whole list of server URLs. |
| closure | an optional pointer to a user defined object that was specified when registering the callback. |
| typedef void(* jsPubAckErrHandler) (jsCtx *js, jsPubAckErr *pae, void *closure) |
Callback used to process asynchronous publish errors from JetStream js_PublishAsync and js_PublishMsgAsync calls. The provided jsPubAckErr object gives the user access to the encountered error along with the original message sent to the server for possible restransmitting.
Msg
field from the jsPubAckErr object).| js | the pointer to the jsCtx object. |
| pae | the pointer to the jsPubAckErr object. |
| closure | an optional pointer to a user defined object that was specified when registering the callback. |
| typedef void(* jsPubAckHandler) (jsCtx *js, natsMsg *msg, jsPubAck *pa, jsPubAckErr *pae, void *closure) |
Callback used to process asynchronous publish responses (positive and negatives) from JetStream js_PublishAsync and js_PublishMsgAsync calls. The provided jsPubAck or jsPubAckErr objects give the user access to the successful acknowledgment from the server or the encountered error along with the original message sent to the server for possible restransmitting.
NULL
. So it is recommended to always call natsMsg_Destroy at the end of the function.| js | the pointer to the jsCtx object. |
| msg | the pointer to the original published natsMsg. |
| pa | the pointer to the jsPubAck object. |
| pae | the pointer to the jsPubAckErr object. |
| closure | an optional pointer to a user defined object that was specified when registering the callback. |
| typedef void(* stanPubAckHandler) (const char *guid, const char *error, void *closure) |
This is used for asynchronous publishing to provide status of the acknowledgment. The function will be passed the GUID and any error state. No error means the message was successfully received by NATS Streaming.
| typedef void(* stanMsgHandler) (stanConnection *sc, stanSubscription *sub, const char *channel, stanMsg *msg, void *closure) |
This is the callback that one provides when creating an asynchronous subscription. The library will invoke this callback for each message arriving through the subscription's connection.
| typedef void(* stanConnectionLostHandler) (stanConnection *sc, const char *errorTxt, void *closure) |
This callback is used to notify the user that the connection to the Streaming server is permanently lost.


Christopher Alexander saw that, "unable to cope with the complicated information [the urban designer] is supposed to organize, he hides his incompetence in a frenzy of artistic individuality...In this atmosphere the designer's greatest gift, his intuitive ability to organize physical form, is being reduced to nothing by the size of the tasks in front of him, and mocked by the efforts of the `artists.' What is worse, in an era that badly needs designers with a synthetic grasp of the organization of the physical world, the real work has to be done by less gifted engineers, because the designers hide their gift in irresponsible pretension to genius."[2] The problem as stated here seems as relevant and novel as it must have seemed then. This passage comes from Notes on the Synthesis of Form, in which Alexander begins to formulate a theory on how designers might begin to use formal logic to solve design problems. Very generally, the theory involves finding the entire set of design problems that must be solved or conditions to be met and determining which are related to each other and in what order to solve them.
Alexander was not the only one to espouse this approach. In Design Thinking (Rowe, 1987), Peter Rowe states that in European design schools of the 1950s and 1960s, "attempts were made to describe the creative problem-solving process at work in design by way of the logical structure of overt activities that appears to take place. In other words, design was regarded as a series of stages characterized by dominant forms of activity, such as analysis, synthesis, evaluation, and so on" (p. 46). Furthermore, these theories usually incorporated an iterative property, to make explicit the process of designing based upon the information at hand and then refining the design by reevaluating the original set of information with respect to previous design solutions. Asimow (1962), Archer (1963-1964) and later Steinitz (1995) proposed variations on this "operational" model of the design process (Figure 2). Schön (1983) focuses less on the operational aspect of the model and more on its iterative properties, as the designer continuously reflects on the work.
These approaches to design were an attempt to solve "ill-defined" design problems. Rowe describes three types of problems, well-defined, ill-defined, and wicked. Well-defined problems, like 2x + 5x2 = 29, have obvious starting and ending points and rules to follow from beginning to end. Ill-defined problems, which Rowe believes encompasses most architecture and urban design problems, usually have desired goals, but the solution which will achieve the goals is unclear as well as the initial conditions. Wicked problems are those for which the goals, starting point and ending point are up for constant debate, like hazardous waste disposal. There is no specific result that can be agreed upon as the best possible solution to the problem.
Figure 2: Operational Models of the Design Process
Archer: Stages of a design process[3]
Asimow: Iconic model of a design process [4]
Steinitz: A Framework for Design as a Verb
Many of the ideas in Design Thinking are worthy of consideration, but Rowe's discussion of operational models and modeling is the most relevant to this work. He starts with Echenique's definition of models, "A model is simply a representation of relevant characteristics of a reality...a means of expressing certain characteristics of an object, or system, that exists, existed, or might exist" (Echenique 1963, p. 1). He then groups models into four categories: descriptive, predictive, explorative and planning. Descriptive models seek to explain what and why something is the way it is and how it works. Rowe would describe Lynch's city imageability concept as a descriptive model. Predictive models are either extrapolative, in that they predict the future based on what can be expected from looking at the past, or conditional, in that changes in inputs result in different outputs. Explorative models are, "designed to allow the discovery, by systematic speculation, of realities other than the one at hand that may be logically possible. Such speculation usually proceeds by exploiting the systematic variation of basic parameters used in a descriptive model" (p. 167).
Figure 3: A Hierarchy of Model Types (Rowe 1987)
The planning model as Rowe defines it builds upon the other three types. In his planning model, descriptive models are required to understand the current state of affairs. Next, different interventions can be evaluated with a predictive model to generate possible solutions. The solutions are then ranked objectively according to their ability to meet stated goals. Explorative models may be used to generate predictive models, ranking schemes, or other decision support tools.
I have avoided allowing the applications developed here to fall into the realm of predictive or planning models because they are intended to be more pure. Those two kinds of models inherently require value judgments that must be made separately as each planning problem is faced. These applications intentionally try only to be descriptive (in the case of the node-finding algorithm) or explorative (the pattern-finding application). Too often the tendency is to create an application that makes decisions, as in Rowe's planning model. This is difficult, and not necessarily wise, as examples from the environmental field show us.
Carl Steinitz's basic theory of design is very similar to Rowe, Archer and Asimow (Figure 2). Although much of the work referenced here is from the 1990s, it refers to ideas that Steinitz has worked with for decades. In fact he says, "In 1990, after almost 25 years of applying GIS to many projects, I came to the realization that there was a common structure to this work, and I wrote a short paper entitled, `A Framework for Theory [applicable to the education of landscape architects]'."[6] This common structure takes the form of "A Framework for Design as a Verb" (Figure 2), where Steinitz illustrates a six-stage method where representation models explain how the landscape should be described, process models explain how it operates, evaluation models explain whether it is working well or not, change models explain how it might be altered, impact models explain what differences these alterations might cause, and decision models help us decide whether and how to act. His feedback loops (shown with arrows) relate these models to one another and shows an iterative pattern where each model can inform others.
Environmental Impact Assessments show how modeling can be abused. It was stated above that a model must start with a decision to choose certain relevant characteristics of a real object or system because it is too difficult to try to model all characteristics. The planning model then ends with a ranking of possible outcomes. These assessments are being conducted throughout the world using the exact same modeling procedure, as if the environmental concerns in, for example, an urban-industrial area like Los Angeles should be ranked the same as those in a mostly rural area like Vermont (where a large part of the economy is eco-tourism). The validity of these techniques has become an issue of general public debate recently as the U.S. Congress has called into question the U.S. Environmental Protection Agency's decision-making techniques. So although the environmental field is very advanced in terms of using GIS as a modeling and decision-making tool, they have perhaps gone too far in relying on analysis to make difficult choices which are as much a product of socio-cultural issues as technical ones. This is not to say that we should not strive to construct good decision making models. I simply want to emphasize that the move from a descriptive model to a planning model is a significant one, and is outside the scope of this work.
The most important descriptive model in the environmental field is presented in Landscape Ecology (Forman and Godron 1986), where the landscape is described generally in terms of structure function and change. Structure refers to the distinct elements that make up the landscape. Function refers to how structures interact. Change is the alteration of structure and function over time. It should be noted that all of these elements change with scale, so that a farm might be a structure at one scale, but at a larger scale, the farm structure becomes the separate structures farmhouse, dirt road, cropland, grazing land, hedgerow, etc. Structure can be more generally described as consisting of patches, which are relatively homogeneous areas, corridors, which are places along which living things travel,[7] and a background matrix, which describes the general landscape characteristics of the place. Edges are created where different landscape structures meet. For people, a residential neighborhood is a patch, while a highway is a corridor. At a larger scale, an apartment building could be a patch, which would then make every sidewalk and road a corridor and every stoop part of an edge. At a smaller scale for migratory birds, the chain of wetlands along the Atlantic coast is a corridor.
The patch-edge-corridor theory is similar to Lynch's district-edge-path, and may not be a coincidence, as Forman mentions Lynch as having "particularly elucidated structure and change in the urban landscape" (p. 29).
The Image of the City (Lynch, 1960) examines "the apparent clarity or `legibility' of the cityscape," and argues that, "a distinctive and legible environment not only offers security but also heightens the potential depth and intensity of human experience." From this starting point he proceeds to develop a theory that in order for a city to be legible, certain elements must be readily identifiable by its inhabitants; these elements are nodes, paths, districts, edges and landmarks. Nodes are transportation junctions or concentrations of activity. Paths are channels along which people (in vehicles or not) customarily travel. Districts are sections of the city that have some common character. Edges are boundaries between areas. Landmarks are points of common reference, like the Empire State Building in New York City, the Citgo sign in Boston, or the Space Needle in Seattle.
Working from this theory, Lynch tells us how a poor city image can be found (through sketch planning and input from residents) and how it can be corrected. The resulting `highly legible' cityscape will then be a much more interesting and satisfying place for people to live and work. In order to define a city's imageability and later correct it, the designer must be able to find the nodes, paths, districts, edges and landmarks as they are perceived by the city's inhabitants. This work show how a geographic information system could begin to support this process by finding nodes. The use of GIS is important here because Lynch's method involves field investigation to find nodes, which limits the area he is able to study to the amount of highly trained human labor he is able to muster behind the effort. My method focuses on strategic use of digital data in order to create an algorithm which find nodes and is field-checked in a small area, but can then be used to find nodes over any area.
Figure 4: The Boston image as derived from sketch maps (Lynch
1960)
A Pattern Language (Alexander 1977), gives a much better analytic framework for urban design than Alexander's previous Notes on the Synthesis of Form, and it has influenced an entire field of inquiry concerned with `shape grammars.' These shape grammars have been explored mainly within the discipline of architecture, but the pattern language also deals with the urban scale. There are 253 `patterns' which descend in scale from the pattern `Independent Regions,' which describes how human civilization on the planet should be organized, to the pattern `Things from your Life,' which talks about what you should hang on the walls of your home.
Alexander believes that a designer may use the framework by deciding which pattern best fits their task, and then use that pattern and a few patterns above and below that main one. As an example, if we were involved in economic development for `blue-collar' workers, we might start with pattern 42, `Industrial Ribbon.' This pattern would tell us that although industry is smelly, noisy, dirty, etc., it must be placed in or near neighborhoods so that people may understand the connection between the things they use in their daily life and the process of making them. Also as a practical consideration, proximity is important so that people do not have to drive to work and spend a great deal of time in travel to and from work. In situations where the industry requires too much land for their placement in the general urban fabric to be practical, they should be placed in an industrial ribbon, which would be near ring roads (pattern 17) and have truck and train access.
Figure 5: Pattern 42, Industrial Ribbon [8]
In planning this industrial ribbon, it would be important to take into careful consideration the idea of work communities (pattern 41), old people everywhere (pattern 40) and housing on hills (pattern 39). Descending in scale, we must consider the university as a marketplace (pattern 43), local town halls (pattern 44) and necklaces of community projects (pattern 45). More patterns may be considered, with each likely to be less important to the project as they get farther removed in scale. So this is a comprehensive guide to urban design, though it's organizing principles are distinct from Lynch's.
The Next American Metropolis (Calthorpe 1993) is an example of the latest trend in urban design, "the new urbanism," which advocates high-density walkable towns with a greater mix of land uses than current zoning policies generally allow, narrow urban streets which allow the street to be used as public space as well as transportation and buildings that relate to that public space instead of to parking lots. Calthorpe has expanded the theory to include a regional design scheme termed "transit-oriented development," (Figure 6) in which these new urban areas (which are designed to be small towns) are connected to each other and to a larger metropolis by public transportation.
These high-density, dispersed small towns are supposed to satisfy the American desire to live in a small town while still having easy access to the city. This type of development pattern is also intended to be ecologically sustainable by concentrating human populations in the least environmentally sensitive areas and encouraging people to use public transportation. As urban planners expand the scope of their work to regional planning, the need for information management and analysis strategies becomes even greater.
Figure 6: Transit-Oriented Development (Calthorpe 1993)
One area of research involves making analytic tools accessible to non-technical planners and the general public. This requires new kinds of interfaces to the information system as well as new kinds of information visualization techniques. Linsey and Raper have experimented with the provision of spatial analysis functions through a graphical user interface (Linsey and Raper 1993). The focus here is on allowing a user to create their own analysis by attaching a graphical front-end to Arc/Info's map display, database query, buffering and spatial intersection functions. Shiffer focuses more on visualization techniques than spatial analysis. His work seeks to create tools that allow the outcomes of complex processes to be better understood by the general public (Shiffer 1995). One example is that instead of debating the possible deleterious effects of airplane noise by explaining the decibel levels of planes, he presents a system that can play back the actual sound an airplane would make and allows it to be varied depending upon the type of plane and the observer's distance from the plane.
Dave and Schmitt (1994) have prototyped an information system that is tailored to the needs of designers, but their definition of urban design in the context of this project is very architectural. They decide that the traditional GIS model is inappropriate for urban design needs and instead use computer aided design (CAD) programs as their base system. This decision reflects their focus on three-dimensional rendering and visualization as opposed to spatial analysis. Although it is true that traditional GISs have weak three-dimensional visualization tools, by using the computer only as a tool to produce pictures of the urban environment, all analysis must still occur in the mind of the designer. This paper will argue that Dave and Schmitt's system, while having focussed applications, ignores the main benefit of using computerized information systems, which will be to create new analytic techniques that a person is able to conceptualize but not execute in their mind.
The National Physical Planning Agency of the Netherlands has been taking an approach to integrating GIS and design similar to the one put forth here (Schuur 1994), with a critical difference. They are working on using GIS for understanding the existing state of the physical world and having designers use thematic maps as base maps to draw on and design potential states of the physical world. GIS is then employed once again to rank and evaluate the potential designs. The critical stage where GIS and design is integrated still involves the intuition and skill of the designer to synthesize GIS information in their head instead of with the help of the computer, which is the same problem Alexander discussed in 1964 in his previously mentioned Notes. Since the designer's contact with the GIS database is still through printed maps, he or she can only see a certain amount of information at one time--with the pattern-finding application presented in this work, I endeavor to enable the designer to take into account more data than can be plotted coherently on paper.
Figure 7: Designing on a GIS base layer (Schuur 1994)
NOTE: some design
elements are exaggerated from the original


NU Book List
Java is a general-purpose computer programming language that is concurrent, class-based, object-oriented,[14] and specifically designed to have as few implementation dependencies as possible.The original and reference implementation Java compilers, virtual machines, and class libraries were originally released by Sun under proprietary licences. As of May 2007, in compliance with the specifications of the Java Community Process, Sun relicensed most of its Java technologies under the GNU General Public License.
Subject Wise Credit
Java is a general-purpose computer programming language that is concurrent, class-based, object-oriented,[14] and specifically designed to have as few implementation dependencies as possible.The original and reference implementation Java compilers, virtual machines, and class libraries were originally released by Sun under proprietary licences. As of May 2007, in compliance with the specifications of the Java Community Process, Sun relicensed most of its Java technologies under the GNU General Public License.


CREOMULSION COUGH MEDICINE ADULT FORMULA- dextromethorphan hydrobromide syrup
Summit Industries, Inc.
Disclaimer: Most OTC drugs are not reviewed and approved by FDA, however they may be marketed if they comply with applicable regulations and policies. FDA has not evaluated whether this product complies.
Do not use if you are now taking prescription monoamine oxidase inhibitor (MAOI)
(certain drugs for depression, psychiatric; or emotional conditions, or Parkinson's disease),
or for 2 weeks after stopping the MAOI drug. If you do not know if your prescription drug contains an MAOI, ask a doctor or a pharmacist before taking this product.
Keep out of reach of children. In case of overdose, get medical help or contact a Poison Control Center right away.
•Do not take more than 6 doses in any 24 period. Use enclosed dose cup.
| Adults and children 12 years and over | 15mL (3tsp) every 4 hours |
| Children 6 years to under 12 years | 7.5mL (1 1/2 tsp) every 4 hours |
| Children 4 years to under 6 years | 3.75mL (3/4tsp) every 4 hours |
| Children under 4 years | do not use |
beechwood creosote, caramel, citric acid, corn syrup, menthol, potassium sorbate, purified water, sodium benzoate, sucrose
Call 8am - 4pm Est. Mon - Thurs 1-800-241-6996
Money Back Guarantee
Guaranteed to give desired results or your money back.
Send carton top, reason for dissatisfaction, sales receipt, lot number, and your phone number to Summit Industries, Inc.
P.O. Box 7329, Marietta, GA 30065
How Creomulsion Cough Medicine Works:
Creomulsion Cough Medicine contains a safe and effective cough suppressant which acts
by temporarily calming the cough control center to relieve coughs.
Its rich, traditional base coats and soothes raw, irritated membranes.
It contains no dyes, no alcohol, and no artificial sweeteners.
For children's coughs due to colds try...
Creomulsion for Children
This popular medicine contains the same safe and effectivecough suppressant as regular Creomulsion but has been specially formulated for children.
Summit Industries, Inc.
P.O. Box 7329
Marietta, GA 30065
creomulsion.com
|
CREOMULSION
COUGH MEDICINE ADULT FORMULA dextromethorphan hydrobromide syrup | ||||||||||||||||||||||
| ||||||||||||||||||||||
| ||||||||||||||||||||||
| ||||||||||||||||||||||
| ||||||||||||||||||||||
|
| Labeler - Summit Industries, Inc. (003279189) |
| Registrant - Summit Industries, Inc. (003279189) |
| Establishment | |||
| Name | Address | ID/FEI | Business Operations |
|---|---|---|---|
| Summit Industries, Inc. | 003279189 | manufacture(12090-0024) |


Implementation of sparse linear discriminant analysis, which is a supervised classification method for multiple classes. Various novel optimization approaches to this problem are implemented including alternating direction method of multipliers (ADMM), proximal gradient (PG) and accelerated proximal gradient (APG) (See Atkins et al. <arXiv:1705.07194>). Functions for performing cross validation are also supplied along with basic prediction and plotting functions. Sparse zero variance discriminant analysis (SZVD) is also included in the package (See Ames and Hong, <arXiv:1401.5492>). See the github wiki for a more extended description.
| Version: | 1.0.0 |
| Depends: | R (≥ 3.2) |
| Imports: | MASS (≥ 7.3.45), rARPACK (≥ 0.10.0), sparseLDA (≥ 0.1.7), ggplot2 (≥ 2.1.0), ggthemes (≥ 3.2.0), grid (≥ 3.2.2), gridExtra (≥ 2.2.1) |
| Published: | 2017-08-24 |
| Author: | Gudmundur Einarsson [aut, cre, trl], Line Clemmensen [aut, ths], Brendan Ames [aut], Summer Atkins [aut] |
| Maintainer: | Gudmundur Einarsson <gumeo140688 at gmail.com> |
| BugReports: | https://github.com/gumeo/accSDA/issues |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| URL: | https://github.com/gumeo/accSDA/wiki |
| NeedsCompilation: | no |
| Citation: | accSDA citation info |
| Materials: | README NEWS |
| CRAN checks: | accSDA results |
| Reference manual: | accSDA.pdf |
| Package source: | accSDA_1.0.0.tar.gz |
| Windows binaries: | r-devel: accSDA_1.0.0.zip, r-release: accSDA_1.0.0.zip, r-oldrel: accSDA_1.0.0.zip |
| OS X binaries: | r-release: accSDA_1.0.0.tgz, r-oldrel: accSDA_1.0.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=accSDA to link to this page.


In the previous two posts we just used the analysis capabilities of Microsoft Roslyn. In other words, we only get information about the code under inspection, we never changed it. In this post we going to change the code through Roslyn.
Before we start we need to highlight that data structures that represent code under inspection in Roslyn APIs are immutable. This means that it cannot be changed after they are created (in order to safely share them between tools). This applies to syntax trees, compilations, symbols, semantic models, and every other data structure in the Roslyn API. Instead of modification, new objects are created based on specified differences to the old ones.
We used SyntaxTree before to create syntax trees from a code snippet. For creating a syntax tree bit-by-bit, you have to compose syntax nodes hierarchically in a bottom-up fashion. To create SyntaxNodes you must use the Syntax class factory methods. For each kind of node, token, or trivia there is a factory method which can be used to create an instance of that type.
In the following example we going to replace a using directive by a new one we create.
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using Roslyn.Compilers;
using Roslyn.Compilers.CSharp;
using Roslyn.Services;
using Roslyn.Services.CSharp;
namespace RoslynDemo4
{
class Program
{
static void Main(string[] args)
{
SyntaxTree tree = SyntaxTree.ParseText(
@"using System;
using System.Collections;
using System.Linq;
using System.Text;
namespace HelloWorld
{
class Program
{
static void Main(string[] args)
{
Console.WriteLine(""Hello, World!"");
}
}
}");
var root = (CompilationUnitSyntax)tree.GetRoot();
// Get the old Using directive [using System.Collections;]
var oldUsing = root.Usings[1];
// Construct the new Using directive
NameSyntax name = Syntax.IdentifierName("System");
name = Syntax.QualifiedName(name, Syntax.IdentifierName("Collections"));
name = Syntax.QualifiedName(name, Syntax.IdentifierName("Generic"));
var newUsing = oldUsing.WithName(name);
// Replace the old Using directive by the new Using directive
root = root.ReplaceNode(oldUsing, newUsing);
SyntaxTree newTree = SyntaxTree.Create(root);
Console.WriteLine(newTree.ToString());
Console.ReadLine();
}
}
}
NameSyntax is the base class for the following names that can appear in C# code:
In our example we constructed a NameSyntax to represent System.Collections.Generic incrementally. Then we used the ReplaceNode method to replace the using System.Collections; directive with the using System.Collections.Generic; directive. We then constructed a new SyntaxTree using the modified root and print it. You should see the modified HelloWorld program:
In a previous post we implemented our SyntaxWalker. Now we going to use the same technique and implement our SyntaxRewriter. Both SyntaxWalker and SyntaxRewriter are subclasses of SyntaxVisitor which recursively visit every node in the syntax tree starting from the passed node. The SyntaxRewriter class can be used to apply a transformation to a specific type of SyntaxNode**.** It is also possible to apply a set of transformations to multiple types of SyntaxNode wherever they appear in a syntax tree. It uses depth-first search algorithm for SyntaxTree traversal.
In the following example we will implement our own SyntaxRewriter which will replace all variable declaration types with the var type. Create a new Console application and add a new class myRewriter to it. Edit the myRewriter.cs to look like:
using System;
using Roslyn.Compilers;
using Roslyn.Compilers.CSharp;
namespace RoslynDemo5
{
class myRewriter : SyntaxRewriter
{
private readonly SemanticModel SemanticModel;
public myRewriter(SemanticModel semanticModel)
{
this.SemanticModel = semanticModel;
}
public override SyntaxNode VisitLocalDeclarationStatement(LocalDeclarationStatementSyntax node)
{
// To avoid the case of multiple variables in a single declaration like the following one
// Type variable1 = expression1,
// variable2 = expression2;
if (node.Declaration.Variables.Count > 1)
{
return node;
}
// To avoid the case of case of a declation without an initializer like the following
// Type variable;
if (node.Declaration.Variables[0].Initializer == null)
{
return node;
}
// Get the first varaible in the declation
VariableDeclaratorSyntax declarator = node.Declaration.Variables.First();
// Get the Type used in the declaration
TypeSyntax variableTypeName = node.Declaration.Type;
// Bind the Type used in the declaration to a Symbol
TypeSymbol variableType = (TypeSymbol)SemanticModel.GetSymbolInfo(variableTypeName).Symbol;
// Get the whole intialization expression
TypeInfo initializerInfo = SemanticModel.GetTypeInfo(declarator.Initializer.Value);
if (variableType == initializerInfo.Type)
{
// Constructing a new Type with the same leading/trailing in the old type to maintain vertical whitespace and indentation
TypeSyntax varTypeName = Syntax.IdentifierName("var").
WithLeadingTrivia(
variableTypeName.GetLeadingTrivia()
).
WithTrailingTrivia(
variableTypeName.GetTrailingTrivia()
);
// Do the replacement and return the new node
return node.ReplaceNode(variableTypeName, varTypeName);
}
else
{
return node;
}
}
}
}
myRewriter class is simply inheriting from SyntaxRewriter class and implments the VisitLocalDeclarationStatment() method. This method is called by the Visit method on SyntaxRewriter, which recursively visits a node and each of its children. The VisitLocalDeclarationStatment method is called on local declaration statements only. It tokes the starting SyntaxNode, if you passed the tree root (as we will do) it will visit the the local declaration statements that exists in the whole program.
Our rewriter takes the semantic model under inspection in the constructor.
In the VisitLocalDeclarationStatment method we check the declaration statement to filter out the cases that are not within our interest. For these cases we return the node unchanged.
For the cases we interested in, we retrieve the variable and the type used for its declaration. Get a symbol for the type and the whole initialization expression.
Then we check that the type used in the declaration is the type used in the initialization to avoid the situations where the declaration may be casting the initializer expression to a base class or interface. Removing the explicit type in these cases would change the semantics of a program.
Then we construct a new TypeSyntax representing the var type with any leading or trailing tivia (white spaces and tabs) to conserve the indentation. Then we replace the node and return the new node.
Let’s go back to our Main method in the Program.cs file. In order to use the myRewriter class, edit the Main method to look like:
static void Main(string[] args)
{
// Create a test Compilation of our current project
Compilation test = CreateTestCompilation();
// Loop on each SyntaxTree in the Compilation
foreach (SyntaxTree sourceTree in test.SyntaxTrees)
{
// Get the tree SemanticModel
SemanticModel model = test.GetSemanticModel(sourceTree);
// intialize myRewriter using the tree SemanticModel
myRewriter rewriter = new myRewriter(model);
// put our rewriter into action
SyntaxNode newSource = rewriter.Visit(sourceTree.GetRoot());
if (newSource != sourceTree.GetRoot())
Console.WriteLine(newSource.GetText().ToString());
Console.ReadLine();
}
}
Here we create a test Compilation using CreateTestCompilation method, which we will add soon. We then loop for each SyntaxTree in this test Compilation. For each SyntaxTree we get the SemanticModel and pass it to our myRewriter constructor. Then we call the Visit() method on the SyntaxTree root. This will cause our VisitLocalDeclarationStatement method to be called and do its syntax transformation task. If the new SyntaxTree is different than the old SyntaxTree, this means that we did syntax modifications and we print the new code.
Now it add the following method to your code inside Program.cs.
private static Compilation CreateTestCompilation()
{
SyntaxTree programTree = SyntaxTree.ParseFile(@"..\..\Program.cs");
SyntaxTree rewriterTree = SyntaxTree.ParseFile(@"..\..\myRewriter.cs");
List sourceTrees = new List();
sourceTrees.Add(programTree);
sourceTrees.Add(rewriterTree);
MetadataReference mscorlib = MetadataReference.CreateAssemblyReference("mscorlib");
MetadataReference roslynCompilers = MetadataReference.CreateAssemblyReference("Roslyn.Compilers");
MetadataReference csCompiler = MetadataReference.CreateAssemblyReference("Roslyn.Compilers.CSharp");
List references = new List();
references.Add(mscorlib);
references.Add(roslynCompilers);
references.Add(csCompiler);
return Compilation.Create("TransformationCS", null, sourceTrees, references);
}
This method basically creates two SyntaxTrees of our project code. Then make a list of the required references for these source code files. Then it sum it all in the factory method Compilation.Create() and return the resulted Compilation object.
When you run the project, you will see a modified version of the Program.cs file. Notice that our myRewriter class replaced the type used in all variables declarations to be of type var.
pressing Enter will bring the modified version of myRewriter.cs file, which have the same kind of change.
We have used the Roslyn Compiler APIs to write our own SyntaxRewriter that searches all files in a C# project for certain syntactic pattern, analyzes the semantics of source code that matches that pattern, and transforms it.
Now you can grab a paper and pencil, and start designing the next big thing in refactoring tools industry :)


John is a waiter. He serves new restaurant customer. He made few clicks on his iPad and switched to other customers while dishes are prepared at the kitchen...
Dishes were fine and customer decided to order something else. John is far from the table and another waiter Alice added item to the order...
All orders are passed through the cashier Bob. He registers payment on his terminal.
Contact us by email or fill out request form


java.lang.Object TextBubble
public class TextBubble
Write a description of class Callout here.
| Constructor Summary | |
|---|---|
TextBubble(java.lang.String text,
int width,
Coordinate loc,
Objective c)
|
| Method Summary | |
|---|---|
void |
drawMe(java.awt.Graphics g)
Draws the TextBubble onto the given Graphics object |
static java.awt.Font |
getFont()
Currently, this will only ever be Arial size 15 as certain other fonts tend to cause lag when loading the FontMetrics object |
| Methods inherited from class |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public TextBubble(java.lang.String text, int width, Coordinate loc, Objective c)
| Method Detail |
|---|
public void drawMe(java.awt.Graphics g)
public static java.awt.Font getFont()


I met a gin soaked, bar-room queen in Memphis,
She tried to take me upstairs for a ride.
She had to heave me right across her shoulder
'Cause I just can't seem to drink you off my mind.
It's the honky tonk women
Gimme, gimme, gimme the honky tonk blues.
I laid a divorcee in New York City,
I had to put up some kind of a fight.
The lady then she covered me in roses,
She blew my nose and then she blew my mind.
It's the honky tonk women
Gimme, gimme, gimme the honky tonk blues.
(Yeah!) It's the honky tonk women.
Gimme, gimme, gimme the honky tonk blues.
(Yeah!) It's the honky tonk women.
Gimme, gimme, gimme the honky tonk blues.


Continuous Integration
Continuous Integration
Retreat Talk 2017
Julian Späth
Content
Continuous Integration
What is CI?
Benefits of CI
Continuous Integration at QBiC
Tools
Dependency Resolvement
Auto-Deployment
Future thoughts
Discussion
Continuous Integration
What is CI?
Using version control with a branching workflow
What is CI?
Using version control with a branching workflow
Automating build and testing of code
Benefits of CI
Automatization
Minimize the manual tasks
Consistency in build and deploy
Workflows between environments
Development - Testing- Production
Enables continuous delivery
Continuous Integration at
Tools
Version Control System
Build Management System
Automation Server
Automated Dependency Resolvement
Automated Dependency Resolvement
https://www.sonatype.com/nexus-repository-sonatype
Auto-Deployment
Auto-Deployment
Future Thoughts
Discussion


petroska
There are no macros links in this template.
There are no template links in this template.
There are no discovery rules in this template.
| Name | Description | Type | Key and additional info |
|---|---|---|---|
| Present Current Demand [Phase A] |
Host Meter Present Demand Current Units =A (Amps)
 | SNMP agent |
cdPresentCurrentDemandL1
Update: 30s
 |
| Line B to Neutral |
Host Meter Voltage Line B to Neutral Units =V (Volts)
 | SNMP agent |
vVbn
Update: 30s
 |
| Peak Current Demand [Phase B] |
-
 | SNMP agent |
cdPeakCurrentDemandL2
Update: 30s
 |
| 3 Phase Load Average |
Host Meter Load Current 3 Phase Average Units =A (Amps)
 | SNMP agent |
lcIAvg
Update: 30s
 |
| Apparent Energy |
-
 | SNMP agent |
eApparentEnergy
Update: 30s
 |
| Apparent power |
Host Meter Apparent Power Units =kVA
 | SNMP agent |
pApparent
Update: 30s
 |
| Serial number |
Host meter 32 bit Serial Number
 | SNMP agent |
midSerialNumber
Update: 3600
 |
| Line A to Line B |
Host Meter Voltage Line A to Line B Units =V (Volts)
 | SNMP agent |
vVab
Update: 30s
 |
| Peak Current Demand [Phase C] |
-
 | SNMP agent |
cdPeakCurrentDemandL3
Update: 30s
 |
| Line C to Neutral |
Host Meter Voltage Line C to Neutral Units =V (Volts)
 | SNMP agent |
vVcn
Update: 30s
 |
| Firmware Version |
Host Meter Firmware Version
 | SNMP agent |
midFirmwareVersion
Update: 3600
 |
| Real power |
Host Meter Real Power Units =kW
 | SNMP agent |
pReal
Update: 30s
 |
| Reactive Energy |
Host Meter Reactive Energy Units =kVARh
 | SNMP agent |
eReactiveEnergy
Update: 30s
 |
| Voltage Line to Neutral 3 Phase Average |
-
 | SNMP agent |
vVlnAvg
Update: 30s
 |
| Device Name |
Host Meter Label plus Nameplate
 | SNMP agent |
midDeviceName
Update: 3600
 |
| Line C to Line A |
Host Meter Voltage Line C to Line A Units =V (Volts)
 | SNMP agent |
vVca
Update: 30s
 |
| Power factor |
Host Meter 3 Phase Total Power Factor
 | SNMP agent |
pfPowerFactorTotal
Update: 30s
 |
| Peak Current Date [Phase A] |
Host Meter Peak Current Demand Date and Time
 | SNMP agent |
cdPeakDateTimeL1
Update: 30s
 |
| Real Energy |
Host Meter Real Energy Units =kWh
 | SNMP agent |
eRealEnergy
Update: 30s
 |
| Peak Current Date [Phase C] |
-
 | SNMP agent |
cdPeakDateTimeL3
Update: 30s
 |
| Line to Line Average Voltage |
Host Meter Voltage Line to Line Average Voltage Units =V (Volts)
 | SNMP agent |
vVllAvg
Update: 30s
 |
| Model Number |
Host Meter Model Number
 | SNMP agent |
midModelNumber
Update: 3600
 |
| Phase A Load |
Host Meter Load Current Phase A Units =A (Amps)
 | SNMP agent |
lcIa
Update: 30s
 |
| Power factor description |
Describes the current power factor Lead/Lag for IEEE mode Cap/Ind for IEC mode
 | SNMP agent |
pfPowerFactorDescription
Update: 3600
 |
| Line B to Line C |
Host Meter Voltage Line B to Line C Units =V (Volts)
 | SNMP agent |
vVbc
Update: 30s
 |
| Phase B Load |
Host Meter Load Current Phase B Units =A (Amps)
 | SNMP agent |
lcIb
Update: 30s
 |
| Frequency |
Host Meter Frequency Units =Hz
 | SNMP agent |
fFrequency
Update: 30s
 |
| Present Current Demand [Phase B] |
-
 | SNMP agent |
cdPresentCurrentDemandL2
Update: 30s
 |
| Reactive power |
Host Meter Reactive Power Units =kVAR
 | SNMP agent |
pReactive
Update: 30s
 |
| Peak Current Date [Phase B] |
-
 | SNMP agent |
cdPeakDateTimeL2
Update: 30s
 |
| Line A to Neutral |
Host Meter Voltage Line A to Neutral Units =V (Volts)
 | SNMP agent |
vVan
Update: 30s
 |
| Phase C Load |
Host Meter Load Current Phase C Units =A (Amps)
 | SNMP agent |
lcIc
Update: 30s
 |
| Present Current Demand [Phase C] |
-
 | SNMP agent |
cdPresentCurrentDemandL3
Update: 30s
 |
| Wiring Type |
Single Phase Line to Neutral 2 Wire 1CT 1PT is ‘10’ Single Phase Line to Line 2 Wire 1CT 1PT is ‘11’ Single Phase 3-Wire 3 wire 2CT 2PT is ‘12’ Three Phase 3 Wire 2CT 2PT is ‘30’ Three Phase 3 Wire 3CT 2PT is ‘31’ Three Phase 3 Wire 1CT 2PT is ‘32’ Three Phase 4 Wire 3CT 3PT is ‘40’ Three Phase 4 Wire 3CT 2PT is ‘42’ Three Phase 4 Wire 1CT 3PT is ‘44’
 | SNMP agent |
swtWiringType
Update: 3600
 |
| Peak Current Demand [Phase A] |
Host Meter Peak Current Demand Units =A (Amps)
 | SNMP agent |
cdPeakCurrentDemandL1
Update: 30s
 |
There are no triggers in this template.
petroska
There are no macros links in this template.
There are no template links in this template.
There are no discovery rules in this template.
| Name | Description | Type | Key and additional info |
|---|---|---|---|
| Present Current Demand [Phase B] |
-
 | SNMP agent |
cdPresentCurrentDemandL2
Update: 30s
 |
| Present Current Demand [Phase A] |
Host Meter Present Demand Current Units =A (Amps)
 | SNMP agent |
cdPresentCurrentDemandL1
Update: 30s
 |
| Peak Current Demand [Phase B] |
-
 | SNMP agent |
cdPeakCurrentDemandL2
Update: 30s
 |
| Wiring Type |
Single Phase Line to Neutral 2 Wire 1CT 1PT is ‘10’ Single Phase Line to Line 2 Wire 1CT 1PT is ‘11’ Single Phase 3-Wire 3 wire 2CT 2PT is ‘12’ Three Phase 3 Wire 2CT 2PT is ‘30’ Three Phase 3 Wire 3CT 2PT is ‘31’ Three Phase 3 Wire 1CT 2PT is ‘32’ Three Phase 4 Wire 3CT 3PT is ‘40’ Three Phase 4 Wire 3CT 2PT is ‘42’ Three Phase 4 Wire 1CT 3PT is ‘44’
 | SNMP agent |
swtWiringType
Update: 3600
 |
| Line A to Line B |
Host Meter Voltage Line A to Line B Units =V (Volts)
 | SNMP agent |
vVab
Update: 30s
 |
| Reactive power |
Host Meter Reactive Power Units =kVAR
 | SNMP agent |
pReactive
Update: 30s
 |
| Peak Current Demand [Phase A] |
Host Meter Peak Current Demand Units =A (Amps)
 | SNMP agent |
cdPeakCurrentDemandL1
Update: 30s
 |
| Apparent power |
Host Meter Apparent Power Units =kVA
 | SNMP agent |
pApparent
Update: 30s
 |
| Present Current Demand [Phase C] |
-
 | SNMP agent |
cdPresentCurrentDemandL3
Update: 30s
 |
| Reactive Energy |
Host Meter Reactive Energy Units =kVARh
 | SNMP agent |
eReactiveEnergy
Update: 30s
 |
| Real Energy |
Host Meter Real Energy Units =kWh
 | SNMP agent |
eRealEnergy
Update: 30s
 |
| Power factor description |
Describes the current power factor Lead/Lag for IEEE mode Cap/Ind for IEC mode
 | SNMP agent |
pfPowerFactorDescription
Update: 3600
 |
| Model Number |
Host Meter Model Number
 | SNMP agent |
midModelNumber
Update: 3600
 |
| Power factor |
Host Meter 3 Phase Total Power Factor
 | SNMP agent |
pfPowerFactorTotal
Update: 30s
 |
| Line to Line Average Voltage |
Host Meter Voltage Line to Line Average Voltage Units =V (Volts)
 | SNMP agent |
vVllAvg
Update: 30s
 |
| Serial number |
Host meter 32 bit Serial Number
 | SNMP agent |
midSerialNumber
Update: 3600
 |
| Line B to Neutral |
Host Meter Voltage Line B to Neutral Units =V (Volts)
 | SNMP agent |
vVbn
Update: 30s
 |
| Peak Current Date [Phase C] |
-
 | SNMP agent |
cdPeakDateTimeL3
Update: 30s
 |
| Phase A Load |
Host Meter Load Current Phase A Units =A (Amps)
 | SNMP agent |
lcIa
Update: 30s
 |
| Line C to Line A |
Host Meter Voltage Line C to Line A Units =V (Volts)
 | SNMP agent |
vVca
Update: 30s
 |
| Frequency |
Host Meter Frequency Units =Hz
 | SNMP agent |
fFrequency
Update: 30s
 |
| Voltage Line to Neutral 3 Phase Average |
-
 | SNMP agent |
vVlnAvg
Update: 30s
 |
| Peak Current Demand [Phase C] |
-
 | SNMP agent |
cdPeakCurrentDemandL3
Update: 30s
 |
| Line C to Neutral |
Host Meter Voltage Line C to Neutral Units =V (Volts)
 | SNMP agent |
vVcn
Update: 30s
 |
| Phase C Load |
Host Meter Load Current Phase C Units =A (Amps)
 | SNMP agent |
lcIc
Update: 30s
 |
| Line B to Line C |
Host Meter Voltage Line B to Line C Units =V (Volts)
 | SNMP agent |
vVbc
Update: 30s
 |
| Phase B Load |
Host Meter Load Current Phase B Units =A (Amps)
 | SNMP agent |
lcIb
Update: 30s
 |
| 3 Phase Load Average |
Host Meter Load Current 3 Phase Average Units =A (Amps)
 | SNMP agent |
lcIAvg
Update: 30s
 |
| Apparent Energy |
-
 | SNMP agent |
eApparentEnergy
Update: 30s
 |
| Firmware Version |
Host Meter Firmware Version
 | SNMP agent |
midFirmwareVersion
Update: 3600
 |
| Line A to Neutral |
Host Meter Voltage Line A to Neutral Units =V (Volts)
 | SNMP agent |
vVan
Update: 30s
 |
| Real power |
Host Meter Real Power Units =kW
 | SNMP agent |
pReal
Update: 30s
 |
| Device Name |
Host Meter Label plus Nameplate
 | SNMP agent |
midDeviceName
Update: 3600
 |
| Peak Current Date [Phase B] |
-
 | SNMP agent |
cdPeakDateTimeL2
Update: 30s
 |
| Peak Current Date [Phase A] |
Host Meter Peak Current Demand Date and Time
 | SNMP agent |
cdPeakDateTimeL1
Update: 30s
 |
There are no triggers in this template.
petroska
There are no macros links in this template.
There are no template links in this template.
There are no discovery rules in this template.
| Name | Description | Type | Key and additional info |
|---|---|---|---|
| Present Current Demand [Phase B] |
-
 | SNMP agent |
cdPresentCurrentDemandL2
Update: 30s
 |
| Present Current Demand [Phase A] |
Host Meter Present Demand Current Units =A (Amps)
 | SNMP agent |
cdPresentCurrentDemandL1
Update: 30s
 |
| Peak Current Demand [Phase B] |
-
 | SNMP agent |
cdPeakCurrentDemandL2
Update: 30s
 |
| Wiring Type |
Single Phase Line to Neutral 2 Wire 1CT 1PT is ‘10’ Single Phase Line to Line 2 Wire 1CT 1PT is ‘11’ Single Phase 3-Wire 3 wire 2CT 2PT is ‘12’ Three Phase 3 Wire 2CT 2PT is ‘30’ Three Phase 3 Wire 3CT 2PT is ‘31’ Three Phase 3 Wire 1CT 2PT is ‘32’ Three Phase 4 Wire 3CT 3PT is ‘40’ Three Phase 4 Wire 3CT 2PT is ‘42’ Three Phase 4 Wire 1CT 3PT is ‘44’
 | SNMP agent |
swtWiringType
Update: 3600
 |
| Line A to Line B |
Host Meter Voltage Line A to Line B Units =V (Volts)
 | SNMP agent |
vVab
Update: 30s
 |
| Reactive power |
Host Meter Reactive Power Units =kVAR
 | SNMP agent |
pReactive
Update: 30s
 |
| Peak Current Demand [Phase A] |
Host Meter Peak Current Demand Units =A (Amps)
 | SNMP agent |
cdPeakCurrentDemandL1
Update: 30s
 |
| Apparent power |
Host Meter Apparent Power Units =kVA
 | SNMP agent |
pApparent
Update: 30s
 |
| Present Current Demand [Phase C] |
-
 | SNMP agent |
cdPresentCurrentDemandL3
Update: 30s
 |
| Reactive Energy |
Host Meter Reactive Energy Units =kVARh
 | SNMP agent |
eReactiveEnergy
Update: 30s
 |
| Real Energy |
Host Meter Real Energy Units =kWh
 | SNMP agent |
eRealEnergy
Update: 30s
 |
| Power factor description |
Describes the current power factor Lead/Lag for IEEE mode Cap/Ind for IEC mode
 | SNMP agent |
pfPowerFactorDescription
Update: 3600
 |
| Model Number |
Host Meter Model Number
 | SNMP agent |
midModelNumber
Update: 3600
 |
| Power factor |
Host Meter 3 Phase Total Power Factor
 | SNMP agent |
pfPowerFactorTotal
Update: 30s
 |
| Line to Line Average Voltage |
Host Meter Voltage Line to Line Average Voltage Units =V (Volts)
 | SNMP agent |
vVllAvg
Update: 30s
 |
| Serial number |
Host meter 32 bit Serial Number
 | SNMP agent |
midSerialNumber
Update: 3600
 |
| Line B to Neutral |
Host Meter Voltage Line B to Neutral Units =V (Volts)
 | SNMP agent |
vVbn
Update: 30s
 |
| Peak Current Date [Phase C] |
-
 | SNMP agent |
cdPeakDateTimeL3
Update: 30s
 |
| Phase A Load |
Host Meter Load Current Phase A Units =A (Amps)
 | SNMP agent |
lcIa
Update: 30s
 |
| Line C to Line A |
Host Meter Voltage Line C to Line A Units =V (Volts)
 | SNMP agent |
vVca
Update: 30s
 |
| Frequency |
Host Meter Frequency Units =Hz
 | SNMP agent |
fFrequency
Update: 30s
 |
| Voltage Line to Neutral 3 Phase Average |
-
 | SNMP agent |
vVlnAvg
Update: 30s
 |
| Peak Current Demand [Phase C] |
-
 | SNMP agent |
cdPeakCurrentDemandL3
Update: 30s
 |
| Line C to Neutral |
Host Meter Voltage Line C to Neutral Units =V (Volts)
 | SNMP agent |
vVcn
Update: 30s
 |
| Phase C Load |
Host Meter Load Current Phase C Units =A (Amps)
 | SNMP agent |
lcIc
Update: 30s
 |
| Line B to Line C |
Host Meter Voltage Line B to Line C Units =V (Volts)
 | SNMP agent |
vVbc
Update: 30s
 |
| Phase B Load |
Host Meter Load Current Phase B Units =A (Amps)
 | SNMP agent |
lcIb
Update: 30s
 |
| 3 Phase Load Average |
Host Meter Load Current 3 Phase Average Units =A (Amps)
 | SNMP agent |
lcIAvg
Update: 30s
 |
| Apparent Energy |
-
 | SNMP agent |
eApparentEnergy
Update: 30s
 |
| Firmware Version |
Host Meter Firmware Version
 | SNMP agent |
midFirmwareVersion
Update: 3600
 |
| Line A to Neutral |
Host Meter Voltage Line A to Neutral Units =V (Volts)
 | SNMP agent |
vVan
Update: 30s
 |
| Real power |
Host Meter Real Power Units =kW
 | SNMP agent |
pReal
Update: 30s
 |
| Device Name |
Host Meter Label plus Nameplate
 | SNMP agent |
midDeviceName
Update: 3600
 |
| Peak Current Date [Phase B] |
-
 | SNMP agent |
cdPeakDateTimeL2
Update: 30s
 |
| Peak Current Date [Phase A] |
Host Meter Peak Current Demand Date and Time
 | SNMP agent |
cdPeakDateTimeL1
Update: 30s
 |
There are no triggers in this template.


{{ partial "head.html" . }}
{{ partial "header.html" . }}
{{ partial "header-news.html" . }}
{{ partial "scripts.html" }}


About Me
Let me tell you a few things...
BIO
I`m 28 years old, from Bulgaria. Currently working, study and addicted to Front End development. I have a excellent time management, problem solving skills and readiness to work in dynamic environment under pressure and great ability to work in tight and aggressive timelines.
Web developer
Front End Developer
Currently work in this field with 10 months experience. Study in the biggest Software University in the country.
Project Manager
Scrum Master
More than 2 years of software project management and projects for optimization of people works. I'm
specialized in Scrum methodology. Daily meetings with international team. Successfully completed
projects with teams of up to 30 people.
Scrum Master.
Jira Expert.
Business Analyst
With more than 2 years of experience in this field. Responsible for the analysis, assessments, and
the quality of the improvements of the company's market leader consisting of more than 2,000
employees. Create forecast model and optimize process.
BPMN Expert.
Certified with SAS Visual Analytics.


Gateway
BOT
05-Jul-18 10:32 AM
[dscrdeql] <AndronicusBass-Founder> But i dont follow afl much. I used to live in rozelle, burwood and parramatta
[dscrdeql] <AndronicusBass-Founder> moved arounnd a few times
[dscrdeql] <jellysmash> Nsw ppl generally follow rugby league
[dscrdeql] <AndronicusBass-Founder> yeah true. however afl has been gaining popularity in the last 10 years I think
[dscrdeql] <jellysmash> Yea definitely
[dscrdeql] <jellysmash> Nsw has GWS now which was created about 5 years again
[dscrdeql] <jellysmash> Greater Western Sydney GWS
[dscrdeql] <AndronicusBass-Founder> Yeah, I remeber talk before then about another team and i think it was going to be parramatta but i guess they decided to bind all of west sydney together for greater support
[dscrdeql] <AndronicusBass-Founder> cant believe its been 5 years already
[dscrdeql] <linkara6669> wow crazy seeing how long the chat was while i was gone lol
[dscrdeql] <linkara6669> good morning yall
[dscrdeql] <AndronicusBass-Founder>
[dscrdeql] <donaldmathers> Hello and good morninf
[dscrdeql] <donaldmathers> Morning*
[dscrdeql] <donaldmathers> !!
[dscrdeql] <donaldmathers> Wish I was off work today
[dscrdeql] <donaldmathers> Don’t we all, right?
[dscrdeql] <jellysmash> @AndronicusBass yea I think it's been 5 years now. GWS are a good team
[dscrdeql] <AndronicusBass-Founder> done really well
[dscrdeql] <jellysmash> I like watching them, but if it's swans vs gws then I go for swans