text stringlengths 0 30.5k | title stringclasses 1
value | embeddings listlengths 768 768 |
|---|---|---|
line, and off you go | [
0.5723495483398438,
-0.03151850402355194,
0.28209027647972107,
0.11588819324970245,
0.1900942325592041,
-0.07430396229028702,
0.2959345877170563,
0.7971219420433044,
-0.31976228952407837,
0.18638190627098083,
-0.06625209003686905,
0.15237975120544434,
-0.16171404719352722,
0.35445222258567... | |
I use the commercial version of Jalopy for my Java projects but it doesn't work on Groovy files. IntelliJ has a serviceable formatter but I don't like requiring a particular IDE.
Try "BUSL"
==========
**2022-10-26 NOTE:** HISTORIC. "BUSL" seems to be dead. [Last archived webpage is from 2020](https://web.archive.org/w... | [
0.05999373644590378,
-0.04525576904416084,
0.48193666338920593,
-0.1070045679807663,
-0.18545889854431152,
-0.32775238156318665,
0.4860941171646118,
0.5318120121955872,
-0.3143284022808075,
-0.9969910979270935,
-0.12765954434871674,
0.30293622612953186,
-0.2201501578092575,
0.2284363210201... | |
When running an old MFC application in Visual Studio's debugger I've seen a lot of warnings in the Output window like the following:
> Warning: skipping non-radio button in group.
I understand that in MFC you put radio buttons in groups to indicate which sets of radio buttons go together. If I remember correctly you ... | [
0.36692342162132263,
0.19413524866104126,
-0.154355987906456,
-0.1388813704252243,
-0.27620503306388855,
-0.3579954504966736,
0.44543468952178955,
-0.7472991347312927,
-0.25317859649658203,
-0.23726360499858856,
0.10782121866941452,
0.7188242673873901,
-0.5634800791740417,
-0.2231681346893... | |
"group" property of all
non-radio button controls to true to
avoid this, or should you just set
it for the first control after the
last radio button?
2. Is there an easy way to figure
out what controls or dialogs have this problem?
I could open each dialog and
fiddle with it until the warning
pops up. This application ... | [
0.09669993817806244,
0.10401873290538788,
0.24022921919822693,
0.1715967357158661,
-0.3324199318885803,
-0.22074446082115173,
0.6189275979995728,
-0.3226585388183594,
-0.2478802353143692,
-0.2568674385547638,
0.2472766786813736,
0.7690516710281372,
-0.49578556418418884,
-0.1375299096107483... | |
and last radio buttons in the group. A control with the `WS_GROUP` style set marks the start of a group.
To fix this, use the dialog editor to change the tab order and make sure that all the radio buttons are numbered sequentially. Another way to do this would be to open the .rc file in a text editor and change the or... | [
-0.029653066769242287,
0.2459545135498047,
0.32663440704345703,
-0.13302096724510193,
-0.339002788066864,
-0.04156607389450073,
0.2768798768520355,
-0.4261344075202942,
-0.2441534698009491,
-0.37526506185531616,
-0.06643056869506836,
0.6316171884536743,
-0.3090131878852844,
0.2000974714756... | |
Ok I followed the steps for setting up ruby and rails on my Vista machine and I am having a problem connecting to the database.
Contents of `database.yml`
--------------------------
```
development:
adapter: sqlserver
database: APPS_SETUP
Host: WindowsVT06\SQLEXPRESS
Username: se
Password: paswd
```
Run `... | [
0.05506698042154312,
0.3701135814189911,
0.3465093672275543,
-0.04984413832426071,
-0.08350957930088043,
-0.14646358788013458,
0.5577960014343262,
-0.26137131452560425,
0.000993688590824604,
-0.9751511812210083,
-0.048265065997838974,
0.612796425819397,
-0.37275630235671997,
0.205475181341... | |
activerecord-sqlserver-adapter gem from --source=<http://gems.rubyonrails.org>
Still not working.
I have verified that I can connect to the database by logging into SQL Management Studio with the credentials.
---
**rake db:migrate --trace**
---
```
PS C:\Inetpub\wwwroot\myapp> rake db:migrate --trace
(in C:/Inetp... | [
-0.07488217204809189,
0.06178873032331467,
0.8787356019020081,
-0.1744512915611267,
-0.028664154931902885,
0.15003018081188202,
0.5452433824539185,
-0.9721699953079224,
0.04113468527793884,
-0.597464919090271,
-0.030788900330662727,
0.9730958938598633,
-0.39223793148994446,
-0.032370623201... | |
so you want to run "gem install deprecated" to grab and install the latest version. Good luck. | [
0.7319768071174622,
0.09728351980447769,
-0.47993898391723633,
0.2245401293039322,
0.1438322812318802,
-0.5660684704780579,
0.4168719947338104,
0.36897480487823486,
-0.06489817798137665,
-0.1683153659105301,
0.22269946336746216,
0.9467530846595764,
0.14333344995975494,
-0.06215288117527962... | |
The [`FILETIME` structure](http://msdn.microsoft.com/en-us/library/ms724284(VS.85).aspx) counts from January 1 1601 (presumably the start of that day) according to the Microsoft documentation, but does this include leap seconds?
The question shouldn't be if `FILETIME` includes leap seconds.
It should be:
> Do the pe... | [
-0.19870631396770477,
-0.42836546897888184,
0.5764763951301575,
0.04591350257396698,
0.07819216698408127,
-0.2383512258529663,
0.1185101792216301,
0.13180184364318848,
-0.6294328570365906,
-0.20112420618534088,
0.08251500129699707,
0.2867622673511505,
0.05233890935778618,
0.438651651144027... | |
`FILETIME` is wrong.
---
Finally, rather than relying on logic, we can determine by direct experimental observation, the answer to the posters question:
```pascal
var
systemTime: TSystemTime;
fileTime: TFileTime;
begin
//Construct a system-time for the 12/31/2008 11:59:59 pm
ZeroMemory(@systemTime, S... | [
-0.18470020592212677,
0.054969511926174164,
0.7545380592346191,
0.08228084444999695,
0.008842924609780312,
0.09874971956014633,
0.14196623861789703,
-0.18844568729400635,
-0.30435770750045776,
-0.6758204698562622,
-0.16103161871433258,
0.33214542269706726,
-0.03232680633664131,
0.229137301... | |
//There was a leap second 12/31/2008 11:59:60 pm
//Add one second to our filetime to reach the leap second
filetime.dwLowDateTime := fileTime.dwLowDateTime+10000000; //10,000,000 * 100ns = 1s
//Convert the filetime, sitting on a leap second, to a displayable system time
FileTimeToSystemTime(fileTime, {... | [
0.05260108783841133,
-0.25689834356307983,
0.8502940535545349,
0.2383432388305664,
0.17713302373886108,
0.2643005847930908,
0.3910045623779297,
-0.03286685794591904,
-0.5520887970924377,
-0.6435844302177429,
0.15915948152542114,
0.21501712501049042,
0.11022072285413742,
0.24670377373695374... | |
to screw up programmers. | [
0.5313724279403687,
0.37030982971191406,
-0.6790335774421692,
0.38761696219444275,
-0.33900097012519836,
-0.3611011505126953,
0.09611020237207413,
0.38503459095954895,
0.12522642314434052,
-0.2963569164276123,
-0.038361262530088425,
0.6137669086456299,
-0.647806704044342,
-0.06809367239475... | |
I've never used CI tools before, but from what I've read, I'm not sure it would provide any benefit to a solo developer that isn't writing code every day.
First - what benefits does CI provide to any project?
Second - who should use CI? Does it benefit all developers?
The basic concept of CI is that you have a system... | [
0.831990659236908,
-0.07596153765916824,
-0.35763314366340637,
0.5458789467811584,
0.14353695511817932,
-0.23863360285758972,
-0.10053321719169617,
-0.02146768383681774,
0.049679871648550034,
-0.7968209981918335,
0.16976527869701385,
0.5895695686340332,
-0.04477699473500252,
0.090556837618... | |
broken the build.
This means either:
**A**. They committed code that prevents compilation, which would screw any one up
**B**. They committed code that broke some tests, which either means they introduced a bug that needs to be fixed, or the tests need to be updated to reflect the change in the code.
If you are ... | [
0.9205673336982727,
0.37043505907058716,
-0.3443314731121063,
0.3630062937736511,
0.10271627455949783,
-0.12972182035446167,
0.44262760877609253,
-0.14633692800998688,
-0.4895504415035248,
-0.3020647168159485,
-0.045079171657562256,
0.43402791023254395,
-0.2019069939851761,
0.1929994821548... | |
for you.
As a solo programmer, it mainly comes down to discipline. Using CI is a useful skill to have, but you want to avoid developing any bad habits that wouldn't translate to a team environment. | [
0.8189107775688171,
-0.16131950914859772,
-0.462114542722702,
0.5801425576210022,
-0.0055394284427165985,
-0.6301056146621704,
0.19741123914718628,
-0.06443741172552109,
-0.37760642170906067,
-0.2932583689689636,
-0.27001649141311646,
0.47392359375953674,
-0.038704078644514084,
-0.27247324... | |
I've got a dictionary, something like
```
Dictionary<Foo,String> fooDict
```
I step through everything in the dictionary, e.g.
```
foreach (Foo foo in fooDict.Keys)
MessageBox.show(fooDict[foo]);
```
It does that in the order the foos were added to the dictionary, so the first item added is the first foo retu... | [
0.20747782289981842,
0.260377436876297,
0.3516313433647156,
-0.2580423057079315,
0.16756954789161682,
0.0333615317940712,
0.26334238052368164,
0.08813460916280746,
-0.09497886151075363,
-0.53719162940979,
-0.015259550884366035,
0.5419983267784119,
-0.1169491708278656,
0.16754195094108582,
... | |
list or an array. It's meant to look up a value by the key, and any ability to iterate values is just a convenience but the order is not behavior you should depend on. | [
0.41899803280830383,
-0.31260451674461365,
0.032607827335596085,
0.20742635428905487,
-0.01736949011683464,
0.027302835136651993,
-0.23155543208122253,
-0.1284237802028656,
-0.4886099100112915,
-0.4514976739883423,
-0.1222831979393959,
0.35814812779426575,
-0.32402750849723816,
0.051138162... | |
I got a program that writes some data to a file using a method like the one below.
```
public void ExportToFile(string filename)
{
using(FileStream fstream = new FileStream(filename,FileMode.Create))
using (TextWriter writer = new StreamWriter(fstream))
{
// try catch block for write permissio... | [
0.2276170700788498,
0.016498476266860962,
0.5061511397361755,
-0.12681621313095093,
0.2664623558521271,
-0.016149703413248062,
0.5421969890594482,
-0.02827715501189232,
-0.21216776967048645,
-0.6889010071754456,
-0.016615310683846474,
0.5725539326667786,
-0.4243718981742859,
0.187889009714... | |
System.IO.FileStream.Init(String path, FileMode mode, FileAccess access,
> nt32 rights, Boolean useRights, FileShare share, Int32 bufferSize, FileOptions
> ptions, SECURITY\_ATTRIBUTES secAttrs, String msgPath, Boolean bFromProxy)
> at System.IO.FileStream..ctor(String path, FileMode mode, FileAccess access
> FileS... | [
-0.002729373285546899,
-0.17722377181053162,
0.3993839919567108,
0.25550511479377747,
0.30664920806884766,
0.01882580667734146,
0.18431949615478516,
-0.2398652881383896,
-0.32212385535240173,
-0.5307238101959229,
-0.13985900580883026,
0.42844003438949585,
-0.2278708666563034,
0.29656529426... | |
new FileIOPermission(FileIOPermissionAccess.Write, filename);
permissionSet.AddPermission(writePermission);
if (permissionSet.IsSubsetOf(AppDomain.CurrentDomain.PermissionSet))
{
using (FileStream fstream = new FileStream(filename, FileMode.Create))
using (TextWriter writer = new StreamWrit... | [
0.01568623073399067,
-0.5301992297172546,
0.899063766002655,
-0.11463957279920578,
0.3862464129924774,
-0.0599927119910717,
0.3995015323162079,
-0.38084444403648376,
-0.16491732001304626,
-0.6492947340011597,
-0.3615904450416565,
0.5549347996711731,
-0.359517902135849,
0.22438932955265045,... | |
{
//perform some recovery action here
}
}
```
As far as getting those permission, you are going to have to ask the user to do that for you somehow. If you could programatically do this, then we would all be in trouble ;) | [
0.3996828496456146,
0.38394689559936523,
0.10529126971960068,
0.2469012290239334,
0.3752620816230774,
-0.2974904477596283,
0.43022921681404114,
-0.0640580952167511,
-0.07791639119386673,
-0.5063384175300598,
-0.33514413237571716,
0.6113771796226501,
-0.13892720639705658,
0.0331898741424083... | |
When I try to compile the newest version of Clisp on Ubuntu 8.04 I always get this error after running configure:
```
Configure findings:
FFI: no (user requested: default)
readline: yes (user requested: yes)
libsigsegv: no, consider installing GNU libsigsegv
./configure: libsigsegv was not detected, thus some... | [
-0.28877466917037964,
0.345878541469574,
0.6173194646835327,
-0.06875849515199661,
-0.05072155222296715,
-0.4381977319717407,
0.47284144163131714,
-0.19443969428539276,
-0.2152726650238037,
-0.7082484364509583,
-0.3165624737739563,
0.7118933796882629,
-0.536105751991272,
-0.085902810096740... | |
--with-unicode --with-module=i18n --with-module=gdbm --with-module=pcre --with-module=readline --with-module=regexp
If you insist on building without libsigsegv, please pass
--ignore-absence-of-libsigsegv
to this script:
./configure --ignore-absence-of-libsigsegv --with-readline --with-unicode --with-module=i18n --... | [
0.3275253176689148,
0.14674121141433716,
0.5156933665275574,
0.30933302640914917,
0.0018359271343797445,
-0.3455885648727417,
-0.08162344247102737,
-0.15911218523979187,
-0.262223482131958,
-0.5264760851860046,
-0.24455857276916504,
0.475826621055603,
-0.5969244837760925,
-0.07656213641166... | |
my notes from compiling CLISP on Ubuntu in the past, hope this helps:
```
sudo apt-get install libsigsegv-dev libreadline5-dev
# as of 7.10, Ubuntu's libffcall1-dev is broken and I had to get it from CVS
# and make sure CLISP didn't use Ubuntu's version.
sudo apt-get remove libffcall1-dev libffcall1
cvs -z3 -d:pserve... | [
-0.14885923266410828,
0.24444548785686493,
0.6850003600120544,
-0.005109620746225119,
-0.23404769599437714,
-0.2586575746536255,
0.5555940270423889,
-0.15383858978748322,
-0.06184936687350273,
-0.7441627383232117,
-0.421398401260376,
0.6650243997573853,
-0.4075227975845337,
0.2926732897758... | |
I would like to be able to say things like
**cd [.fred]** and have my default directory go there,
and my prompt change to indicate the full path to my current location.
Here's my setup:
You need 2 files (typed below) : godir.com and prompt.com in your sys$login
You may define a symbole
```
CD == "@sys$login:godir.... | [
-0.10250815004110336,
0.03788241371512413,
0.5782414078712463,
0.1355794072151184,
0.012834875844419003,
0.2632412314414978,
0.460723340511322,
-0.10178250074386597,
-0.04433358088135719,
-1.24916410446167,
-0.33076825737953186,
0.2663344442844391,
-0.39804959297180176,
-0.1980151236057281... | |
noeud = f$trnlnm("SYS$NODE") - "::"
$ if noeud .eqs. "HQSVYC" then noeud = "¥"
$!
$ noeud = noeud - "MQO"
$ def_dir = f$directory()
$ def_dir = f$extract(1,f$length(def_dir)-2,def_dir)
$boucle:
$ i = f$locate(".",def_dir)
$ if i .eq. f$length(def_dir) then goto fin_boucle
$ d... | [
-0.43447253108024597,
-0.14519159495830536,
0.6543695330619812,
-0.14150546491146088,
0.25379639863967896,
0.22946985065937042,
-0.20438504219055176,
-0.14444124698638916,
0.005945299752056599,
-0.42144355177879333,
-0.5134344696998596,
0.596748948097229,
-0.13381066918373108,
0.1232361048... | |
= "''noeud' ''def_dir' " + "''car_prompt'"
$ temp = "''noeud'" -
+ " ''def_dir' " -
+ "''f$logical(""environnement"")'" -
+ "''car_prompt'"
$! temp = "''noeud'" -
$! + "''def_dir'" -
$! + "''f$logical(""environnement"")'" -
$! | [
-0.22156916558742523,
0.14918479323387146,
0.2514074742794037,
0.10768484324216843,
0.42987632751464844,
0.11524956673383713,
-0.051671434193849564,
-0.11808888614177704,
0.004929846152663231,
-0.518179714679718,
-0.9213440418243408,
0.7166371941566467,
-0.08188294619321823,
-0.61037474870... | |
+ "''car_prompt'"
$ set prompt="''temp' "
$!
$! PROMPT.COM
$!
```
Here's godir.com
```
$!
$! GODIR.COM
$!
$ set noon
$ set_prompt = "@sys$login:prompt.com"
$ if f$type(TAB_DIR_N) .nes. "" then goto 10$
$ goto 20$
$ INIT:
$ temp2 = "INIT"
$ CLEAR:
$ temp = 0
$
$ INIT2:
$ ... | [
-0.026299292221665382,
0.04520176351070404,
0.6362072229385376,
-0.07534231245517731,
0.12700141966342926,
0.20343495905399323,
0.14993347227573395,
0.02911667712032795,
0.1280622035264969,
-0.5357722640037537,
-0.4415147304534912,
0.9645707011222839,
-0.3353401720523834,
-0.04471542686223... | |
then goto INIT3
$ delete/symb/glo TAB_DIR_'temp'
$ goto INIT2
$
$ INIT3:
$ P1 = ""
$ if temp2 .eqs. "INIT" then goto 20$
$ delete/symb/glo TAB_DIR_N
$ delete/symb/glo TAB_DIR_P
$ delete/symb/glo TAB_DIR_I
$ exit
$
$ 20$:
$ TAB_DIR_N == 1
$ TAB_DIR_P == 1
$ ... | [
-0.6195301413536072,
-0.14135251939296722,
0.5610078573226929,
-0.11387057602405548,
-0.1277754306793213,
0.2604270577430725,
-0.018427668139338493,
-0.18909887969493866,
-0.1735125631093979,
-0.21922872960567474,
-0.4602177143096924,
0.7314580082893372,
-0.4498884081840515,
-0.02068681269... | |
1
$ if "''car_prompt'" .eqs. "" then car_prompt == ">"
$ TAB_DIR_1 == f$parse(f$dir(),,,"device")+f$dir()
$ 10$:
$ if P1 .eqs. "" then goto LIST
$ if P1 .eqs. "?" then goto SHOW
$ if P1 .eqs. "." then P1 = "[]"
$ if P1 .eqs. "^" then goto SET_CUR
$ if (P1 .eqs. "<") .or. (P1 .... | [
-0.13326461613178253,
0.014873676002025604,
0.48810529708862305,
-0.22876249253749847,
0.027399344369769096,
0.2026117742061615,
0.0006987355882301927,
-0.30733609199523926,
-0.09319563210010529,
-0.2471429407596588,
-0.36790356040000916,
0.7602895498275757,
-0.4719373881816864,
0.03831613... | |
(P1 .eqs. "..") then P1 = "[-]"
$ if (P1 .eqs. "*") .or. (P1 .eqs. "0") then goto HOME
$ if (P1 .eqs. "P") .or. (P1 .eqs. "p") then goto PREVIOUS
$ if (P1 .eqs. "H") .or. (P1 .eqs. "h") then goto HELP
$ if (P1 .eqs. "S") .or. (P1 .eqs. "s") then goto SET_PROMPT
$ if (P1 .eqs. "G") .or. (P1... | [
-0.3312630355358124,
0.16258206963539124,
0.565545916557312,
-0.2367655485868454,
0.23978854715824127,
0.47401949763298035,
0.3885084092617035,
-0.15553121268749237,
-0.032936494797468185,
-0.7058987021446228,
-0.38892292976379395,
0.7753793001174927,
-0.09869243949651718,
-0.1388482153415... | |
temp2 = ""
$ if (P1 .eqs. "~INIT") .or. (P1 .eqs. "~init") then goto INIT
$ if (P1 .eqs. "~CLEAR") .or. (P1 .eqs. "~clear") then goto CLEAR
$
$! *** Specification par un numero
$ temp = f$extract(0,1,P1)
$ if temp .eqs. "-" then goto DELETE
$ temp2 = ""
$boucle_reculer:
$ if t... | [
-0.266253262758255,
-0.28124597668647766,
0.5379050970077515,
-0.05375959351658821,
0.13832320272922516,
0.18736037611961365,
0.26732006669044495,
-0.2985388934612274,
0.0022941429633647203,
-0.11940928548574448,
-0.663516104221344,
0.7616698145866394,
-0.19725005328655243,
-0.137383714318... | |
temp2 = temp2 + "-."
$ P1 = P1 - "\"
$ temp = f$extract(0,1,P1)
$ goto boucle_reculer
$!
$fin_reculer:
$ P1 = temp2 + P1
$ if (P1 .lts. "0") .or. (P1 .gts. "9") then goto SPEC
$ temp = f$integer("''P1'")
$ if temp .eq. 0 then goto HOME
$ if (temp .lt. 1) .or. (temp .gt. T... | [
-0.0625741109251976,
-0.12039729952812195,
0.8648239970207214,
-0.3563205599784851,
0.10585405677556992,
0.21214750409126282,
0.16251547634601593,
-0.33724695444107056,
-0.23793213069438934,
-0.1811804473400116,
-0.2622000575065613,
0.7982960343360901,
-0.1296195685863495,
0.08170354366302... | |
goto ERR
$ TAB_DIR_P == TAB_DIR_I
$ TAB_DIR_I == temp
$ goto SET2
$
$ SPEC:
$! *** Specification relative de directory
$
$ temp = f$parse("[.''P1']","missing.mis")
$ DD = f$extract(0,f$locate("]",temp)+1,temp)
$ if DD .nes. "" then goto SET1
$
$! *** Specification de direct... | [
-0.43996959924697876,
-0.26720350980758667,
0.5430331230163574,
-0.023633498698472977,
-0.1080714762210846,
0.07710488140583038,
0.18404999375343323,
-0.33647647500038147,
0.02798440307378769,
-0.1824253499507904,
-0.4312862753868103,
0.8085311651229858,
-0.1344684213399887,
-0.07926144450... | |
if DD .nes. "" then goto SET1
$
$ temp = f$parse("[''P1']","sys$login:missing.mis")
$ DD = f$extract(0,f$locate("]",temp)+1,temp)
$ if DD .nes. "" then goto SET1
$
$! *** Specification exacte de directory
$
$ temp = f$parse(P1,"missing.mis")
$ if f$locate("]"+P1,temp) .ne. f$length(te... | [
-0.35095155239105225,
-0.28041303157806396,
0.6049677729606628,
-0.13829678297042847,
0.3360588848590851,
0.14991672337055206,
0.1690072864294052,
-0.42512112855911255,
-0.18553857505321503,
-0.44496768712997437,
-0.611353874206543,
0.8143113255500793,
-0.2803373336791992,
-0.1247530952095... | |
if DD .eqs. TAB_DIR_'TAB_DIR_I' then goto SHOW
$ if DD .eqs. TAB_DIR_'TAB_DIR_I' then goto SET2
$ if DD .nes. "" then goto SET1
$
$ temp = f$parse(P1,"sys$login:missing.mis")
$ if f$locate("]"+P1,temp) .ne. f$length(temp) then goto ERR
$ if f$locate(".][",temp) .ne. f$length(temp) then tem... | [
-0.10408443957567215,
0.001856331480666995,
0.6063986420631409,
-0.2462320178747177,
0.06392615288496017,
0.297398179769516,
0.2795572876930237,
-0.4157099425792694,
-0.21667471528053284,
-0.6247835755348206,
-0.5761939883232117,
0.6170556545257568,
-0.18900345265865326,
0.1423332691192627... | |
if DD .eqs. TAB_DIR_'TAB_DIR_I' then goto SET2
$ if DD .nes. "" then goto SET1
$
$ goto ERR
$
$ HOME:
$ DD = "SYS$LOGIN"
$
$ SET1:
$ Set On
$ On error then goto ERR1
$ set message/nofac/noid/nosever/notext
$ Set def 'DD'
$ dir/output=nl:
$ set message/fac/id/sever/t... | [
-0.08914179354906082,
-0.05944162979722023,
0.64093416929245,
-0.30909815430641174,
0.03178650140762329,
0.0181349478662014,
0.33076930046081543,
-0.31236132979393005,
-0.09740445762872696,
-0.5565037131309509,
-0.4165186583995819,
0.7822248339653015,
-0.4296322464942932,
-0.08007213473320... | |
f$parse(f$dir()) - ".;"
$ if temp .nes. "" then goto SET1F
$ ERR1:
$ set message/fac/id/sever/text
$ temp = TAB_DIR_'TAB_DIR_I'
$ Set def 'temp'
$ goto ERR
$ SET1F:
$ I = 0
$ LOOP1:
$ I = I + 1
$ if temp .eqs. TAB_DIR_'I' then goto FOUND
$ if I .lt. TAB_DIR_N then g... | [
-0.09080972522497177,
-0.062341902405023575,
0.5521610975265503,
-0.300989031791687,
0.24370227754116058,
-0.03373691067099571,
0.42742908000946045,
-0.3788536489009857,
-0.06748683750629425,
-0.3395072817802429,
-0.3578881621360779,
0.6187648773193359,
-0.546507716178894,
-0.1374377757310... | |
TAB_DIR_N == TAB_DIR_N + 1
$ TAB_DIR_P == TAB_DIR_I
$ TAB_DIR_I == TAB_DIR_N
$ TAB_DIR_'TAB_DIR_I' == temp
$ goto SHOW
$
$ FOUND:
$ TAB_DIR_P == TAB_DIR_I
$ TAB_DIR_I == I
$ goto SET2
$
$ SET_PROMPT:
$ car_prompt == "''P2'"
$ set_prompt
$ exit
$
$ PREVIOUS:
$ | [
-0.30436089634895325,
0.16832156479358673,
0.5484260320663452,
-0.1164148822426796,
-0.23917342722415924,
0.23882341384887695,
-0.10389342904090881,
-0.21293695271015167,
-0.16169239580631256,
-0.09847868978977203,
-0.2283593863248825,
0.5658156275749207,
-0.1561947911977768,
0.11464795470... | |
temp = TAB_DIR_P
$ TAB_DIR_P == TAB_DIR_I
$ TAB_DIR_I == temp
$
$ SET_CUR:
$ SET2:
$ DD = TAB_DIR_'TAB_DIR_I'
$ set def 'DD'
$
$ SHOW:
$ temp = TAB_DIR_'TAB_DIR_I'
$ ws " ''TAB_DIR_I' * ''temp'"
$ set_prompt
$ exit
$
$ LIST:
$ I = 0
$ LOOP2:
$ I = I | [
-0.17965152859687805,
-0.03145211562514305,
0.554436981678009,
-0.18225610256195068,
-0.3612319827079773,
0.26615479588508606,
0.30437880754470825,
-0.28041309118270874,
-0.20234616100788116,
-0.4172218143939972,
-0.23983962833881378,
0.48680421710014343,
-0.5009299516677856,
-0.1245699971... | |
+ 1
$ temp = TAB_DIR_'I'
$ if I .eq. TAB_DIR_I then goto L_CUR
$ if I .eq. TAB_DIR_P then GOTO L_PRE
$ ws " ''I' = ''temp'"
$ goto F_LOOP2
$ L_CUR:
$ ws " ''I' * ''temp'"
$ goto F_LOOP2
$ L_PRE:
$ ws " ''I' + ''temp'"
$
$ F_LOOP2:
$ if I | [
-0.0793837159872055,
-0.1650370955467224,
0.5502539277076721,
-0.3948187232017517,
-0.23090554773807526,
0.13055767118930817,
0.277650386095047,
-0.47433745861053467,
-0.13596393167972565,
-0.24658767879009247,
-0.2971309423446655,
0.441964715719223,
-0.7299606204032898,
-0.317871242761611... | |
.lt. TAB_DIR_N then goto LOOP2
$ set_prompt
$
$ exit
$
$ DELETE:
$ P1 = P1 - "-"
$ temp2 = f$integer("''P1'")
$ DEL_1:
$ temp = f$integer("''P1'")
$ if (temp .lt. 1) .or. (temp .gt. TAB_DIR_N) then goto ERR
$ if temp .eq. TAB_DIR_I then goto ERR
$ if temp .lt. TAB_DIR_I t... | [
-0.4955155551433563,
-0.35996511578559875,
0.5559527277946472,
-0.17731577157974243,
-0.09321493655443192,
0.15494245290756226,
0.28969475626945496,
-0.15415488183498383,
-0.2550947666168213,
-0.3834074139595032,
-0.42173802852630615,
0.7914813160896301,
-0.4177771508693695,
0.012905497103... | |
if temp .eq. TAB_DIR_P then TAB_DIR_P == TAB_DIR_I
$ if temp .lt. TAB_DIR_P then TAB_DIR_P == TAB_DIR_P - 1
$ LOOP3:
$ if temp .eq. TAB_DIR_N then goto F_LOOP3
$ temp3 = temp + 1
$ TAB_DIR_'temp' == TAB_DIR_'temp3'
$ temp = temp + 1
$ goto LOOP3
$ F_LOOP3:
$ delete/symb/glo tab... | [
-0.11804477125406265,
-0.05968759208917618,
0.3150899410247803,
-0.09999644011259079,
-0.191764697432518,
0.3744301199913025,
0.19630178809165955,
-0.41734299063682556,
-0.25789615511894226,
-0.3289428949356079,
-0.4632527232170105,
0.4357023537158966,
-0.5905547142028809,
-0.0017520821420... | |
if P2 .eqs. "" then goto FIN_DEL
$ temp2 = temp2 + 1
$ if temp2 .le. f$integer("''P2'") then goto DEL_1
$ FIN_DEL:
$ goto LIST
$
$ ERR:
$ ws "*** ERREUR ***"
$ exit
$
$ HELP:
$ ws " H Show this menu"
$ ws " null | [
-0.3487957715988159,
-0.25395044684410095,
0.62143874168396,
-0.17695850133895874,
0.11611820757389069,
0.07699554413557053,
0.020447853952646255,
-0.05950005725026131,
-0.5123008489608765,
-0.5102566480636597,
-0.41674184799194336,
0.7096729278564453,
-0.29897341132164,
-0.012313594110310... | |
Show a list of directories"
$ ws " ? Show current directory"
$ ws " < or [-] or"
$ ws " > or .. Remonte d'un niveau de directory"
$ ws " * ou 0 Return to SYS$LOGIN"
$ ws " P Last directory "
$ | [
-0.12473404407501221,
-0.0912979394197464,
0.4807852804660797,
0.17820554971694946,
0.3634164333343506,
0.008133425377309322,
0.03679893910884857,
0.15148049592971802,
-0.14890842139720917,
-0.4187442362308502,
-0.7605763077735901,
0.4170454442501068,
-0.31708645820617676,
-0.0212004780769... | |
ws " . ou [] Set cureent directory"
$ ws " ^ Return to next directory"
$ ws " x Set def to number x"
$ ws " -x Remove the number x"
$ ws " -x y Remove from | [
0.12134262919425964,
0.14321988821029663,
0.5571081638336182,
-0.1565556675195694,
0.1622631996870041,
0.16574010252952576,
0.2874053120613098,
-0.2519947290420532,
0.15371719002723694,
-0.5408324003219604,
-0.36809319257736206,
0.6778260469436646,
-0.6064878702163696,
0.3143309950828552,
... | |
x to y"
$ ws " ddd Set def to [ddd] or [.ddd] or ddd:"
$ ws " \ddd Set def to [-.ddd]"
$ ws " S "">>"" Modify prompt for >>"
$ ws " ~INIT Initialize to current directory "
$ ws " | [
0.03863651305437088,
-0.2504938542842865,
0.6059269905090332,
-0.1762462705373764,
0.08879747986793518,
-0.08179862052202225,
0.18246398866176605,
-0.0601760670542717,
0.20314423739910126,
-0.7251375913619995,
-0.5669598579406738,
0.5625285506248474,
-0.11777837574481964,
0.090434335172176... | |
(and delete all others references)"
$ ws " ~CLEAR Remove all references
$ ws ""
$
$ exit
$
$ SET_PROMPT_GRAPHIC:
$ temp = "''P2'"
$ i=0
$ car_prompt == ""
$ GRAPH_BOUCLE:
$ t=f$extract(i,1,temp)
$ if (t .eqs. "e") .or. (t .eqs. "E") then t="ESC"
$ if (t .eqs. "g... | [
-0.056134968996047974,
0.13458797335624695,
0.7551220059394836,
0.05337679386138916,
0.1892535239458084,
0.4083191752433777,
0.33117032051086426,
-0.06257865577936172,
-0.15095455944538116,
-0.3965853750705719,
-0.5667869448661804,
0.5280743837356567,
-0.46194902062416077,
0.11147602647542... | |
.eqs. "G") then t="ESC(0"
$ V° (} .L-_. "N") .-_. (} .L-_. "H") }NL+ }="ESC(B"
$ car_prompt == car_prompt + t
$ i = i+1
$ if i .lts. f$length(temp) then goto GRAPH_BOUCLE
$
$ set_prompt
$ exit
``` | [
0.012972764670848846,
-0.2062455415725708,
0.6709355115890503,
0.13609525561332703,
-0.08674440532922745,
0.13994340598583221,
0.2946031987667084,
-0.017496632412075996,
-0.36671119928359985,
-0.565874457359314,
-0.2839924991130829,
0.4259965121746063,
-0.449690580368042,
0.064390487968921... | |
We have created a control that needs to persist data via the ViewState property of the Control class. Our class subclasses control strictly to get access to the ViewState property (it's protected on the Page object). We are adding the control to Page.Controls in OnInit, and then attempt to set the ViewState property in... | [
0.04076148942112923,
-0.21649052202701569,
0.4872118830680847,
0.5497139692306519,
0.20943999290466309,
-0.10905090719461441,
0.08442273736000061,
-0.050424974411726,
-0.11250565946102142,
-0.4966738224029541,
-0.12473517656326294,
0.4308936297893524,
-0.36099156737327576,
0.33691868185997... | |
Page directly. Unfortunately this is too high up the controls hierarchy to participate in the Forms ViewState Handling. If you add the control onto the actual ASPNet Form's Controls collection somewhere then it will successfully participate in LoadViewStateRecursive and SaveViewStateRecursive. | [
0.12666229903697968,
-0.5797863602638245,
0.8293691873550415,
0.36788028478622437,
-0.09356926381587982,
-0.3538011908531189,
0.1426900178194046,
-0.26819610595703125,
-0.06768584251403809,
-0.6496128439903259,
-0.2654930055141449,
0.3257216215133667,
-0.2598600685596466,
-0.09135498106479... | |
In certain cases, I can't seem to get components to receive events.
[edit]
To clarify, the example code is just for demonstration sake, what I was really asking was if there was a central location that a listener could be added, to which one can reliably dispatch events to and from arbitrary objects.
I ended up usi... | [
0.02529238909482956,
-0.2660856544971466,
-0.045466843992471695,
0.30071669816970825,
-0.24245688319206238,
-0.14891447126865387,
-0.08365929126739502,
-0.027565738186240196,
-0.23577429354190826,
-0.5025628805160522,
-0.35802772641181946,
0.15025858581066132,
-0.34663307666778564,
0.12852... | |
version="1.0" encoding="utf-8"?>
<mx:Application xmlns:mx="http://www.adobe.com/2006/mxml"
layout="absolute"
initialize="init()">
<mx:Script>
<![CDATA[
import mx.controls.Menu;
import mx.managers.PopUpManager;
// Add listeners
public function init():void
{
... | [
-0.04724475368857384,
-0.16448397934436798,
0.5690509676933289,
-0.26379823684692383,
0.0031240535899996758,
0.1659219115972519,
0.48627614974975586,
-0.5000079274177551,
0.15525028109550476,
-0.6164512038230896,
-0.41056814789772034,
0.6271886229515076,
-0.4057294428348541,
0.118202894926... | |
}
// Handle the no pop button event
public function noPop(event:Event):void
{
dispatchEvent(new Event("child"));
}
// Handle the pop up
public function popUp(event:Event):void
{
var | [
-0.022507812827825546,
-0.37828946113586426,
0.519482433795929,
0.016282113268971443,
0.4048389494419098,
0.47148486971855164,
-0.2853477895259857,
0.32135650515556335,
-0.34702423214912415,
-0.35527417063713074,
-0.5477996468544006,
0.4117060899734497,
-0.3913014531135559,
0.3119144439697... | |
menu:Menu = new Menu();
var btnMenu:Button = new Button();
btnMenu.label = "stepchild";
menu.addChild(btnMenu);
PopUpManager.addPopUp(menu, this);
// neither of these work...
this.callLater(btnMenu.dispatchEvent, [new Event("stepchild", true)]); | [
-0.3454130291938782,
-0.49077150225639343,
0.5334111452102661,
-0.3114042580127716,
0.3854405879974365,
0.38421952724456787,
0.3785245716571808,
-0.4986864924430847,
-0.25507843494415283,
-0.6520368456840515,
-0.5486616492271423,
0.5552566051483154,
-0.332105427980423,
0.1614569127559662,
... | |
btnMenu.dispatchEvent(new Event("stepchild", true));
}
// Event handlers
public function handleChild(event:Event):void
{
trace("I handled child");
}
public function handleStepchild(event:Event):void {
trace("I handled stepchild");
}
... | [
0.18261653184890747,
-0.36478009819984436,
0.2384217530488968,
-0.03502265736460686,
0.23072108626365662,
0.4247657358646393,
0.4496265947818756,
-0.6020824313163757,
-0.2560303509235382,
-0.40628454089164734,
-0.0055084144696593285,
0.38085755705833435,
-0.2262800931930542,
0.104543887078... | |
<mx:Button label="NoPop" id="btnNoPop" click="noPop(event)"/>
<mx:Button label="PopUp" id="btnPop" click="popUp(event)"/>
</mx:VBox>
</mx:Application>
```
**I can think of work-arounds, but it seems like there ought to be some central event bus...**
Am I missing something?
Above is correct.
You are dispatching ... | [
0.2102149873971939,
-0.008188401348888874,
0.3720846176147461,
0.09162004292011261,
0.052114829421043396,
0.2276102751493454,
0.582980751991272,
-0.2614413797855377,
-0.39524519443511963,
-0.6291002035140991,
-0.5218399167060852,
0.9921103119850159,
-0.3924808204174042,
-0.1311204433441162... | |
My DBA requires all database access to be done through trusted domain account. This can be done if you set the web.config . This requires the user to login or to be on the domain for IE pass the credentials through. I want to impersonate a user by using code. I am using the code found in this knowledgebase article:
<h... | [
0.5246488451957703,
0.46463295817375183,
0.4415814280509949,
-0.12340190261602402,
-0.06724898517131805,
-0.40273386240005493,
0.6920900344848633,
-0.0045888968743383884,
0.12791281938552856,
-0.6451357007026672,
0.11208096146583557,
0.23208282887935638,
-0.36198973655700684,
0.39914378523... | |
make a call to the database I have to run the impersonate code.
If IIS can impersonate a domain user for all pages, then why can I not impersonate a user while using code?
It seems to be something with thread context switching. I have tried setting the alwaysFlowImpersonatingPolicy in the Aspnet.config file and it d... | [
0.12153255939483643,
0.11368231475353241,
0.25957053899765015,
0.022574063390493393,
0.01255712565034628,
-0.07905274629592896,
0.32734450697898865,
0.23194439709186554,
-0.16723264753818512,
-0.4774077832698822,
0.05520162731409073,
0.18171338737010956,
-0.6189393401145935,
0.448745191097... | |
the effect of impersonation and thus the token as soon as you are done with the operation(s) for which it was needed. The story is no different with IIS or ASP.NET. Each request is usually handled by a distinct thread so you will have to make each thread impersonate the user.
> This means every time I make a call to
>... | [
0.06485189497470856,
-0.057464610785245895,
0.3010719120502472,
0.12551400065422058,
-0.31225645542144775,
-0.02408875897526741,
0.3581230044364929,
0.043993741273880005,
-0.21631157398223877,
-0.46525612473487854,
0.0056903185322880745,
0.15961869060993195,
-0.5188130140304565,
0.27405148... | |
it any differently and so it may only be a perceived illusion. It cannot impersonate a user for all pages unless all pages are being served by the same thread and where the impersonated token has never been reverted as each page is served.
> It seems to be something with thread
> context switching.
Not really. Unles... | [
0.22050055861473083,
-0.059193845838308334,
0.6918348670005798,
0.2673330307006836,
-0.1117076724767685,
-0.08692093193531036,
0.27353933453559875,
0.3402561843395233,
-0.31416118144989014,
-0.5697619318962097,
0.037217289209365845,
0.161869615316391,
-0.45150551199913025,
0.15096595883369... | |
during the processing of a single request. If you want that the work done by a secondary (worker) thread continues to occur under the impersonation context of the primary one then you need to make sure the secondary thread borrows the impersonation token. In .NET Framework 1.1, you would have to take great care and man... | [
0.19853012263774872,
-0.3471180200576782,
0.3315439522266388,
0.009278565645217896,
-0.12891532480716705,
0.0033056004904210567,
0.2854866683483124,
-0.12155676633119583,
-0.36119264364242554,
-0.37895268201828003,
-0.34957829117774963,
0.30681243538856506,
-0.3620358109474182,
-0.06985665... | |
I have an immutable class with some private fields that are set during the constructor execution. I want to unit test this constructor but I'm not sure the "best practice" in this case.
**Simple Example**
This class is defined in Assembly1:
```
public class Class2Test
{
private readonly string _StringProperty;
... | [
0.1540347933769226,
0.1403578817844391,
0.12151842564344406,
-0.10177545249462128,
0.18896497786045074,
0.02494935318827629,
0.3867937922477722,
-0.2982856333255768,
0.044286031275987625,
-0.9182091951370239,
-0.14497363567352295,
0.6355432868003845,
-0.39910343289375305,
-0.10516157001256... | |
x = new Class2Test();
//what do I assert to validate that the field was set properly?
}
}
```
**EDIT 1**: I have answered this question with a potential solution but I'm not sure if it's the "right way to go". So if you think you have a better idea please post it.
This example isn't really worth testing,... | [
0.42752963304519653,
0.05349452421069145,
-0.08846918493509293,
0.011948483996093273,
-0.3236716389656067,
-0.3847917318344116,
0.3704374432563782,
-0.13868185877799988,
0.046930376440286636,
-0.6262550354003906,
-0.05620875954627991,
0.5793642997741699,
-0.48827970027923584,
-0.0888484492... | |
2**: Looks like I made the sample a little to simple. I have updated it with a more reasonable situation.
Nothing, unless you are using that field. You don't want over-specification via tests. In other words, there is no need to test that the assignment operator works.
If you are using that field in a method or someth... | [
0.17873670160770416,
-0.24691453576087952,
-0.03349682316184044,
-0.024401413276791573,
-0.01967938058078289,
-0.2946385145187378,
0.583557665348053,
-0.35378149151802063,
0.013944191858172417,
-0.5671918392181396,
-0.18299584090709686,
0.7841436266899109,
-0.6282850503921509,
-0.245450153... | |
unit test has now become an integration test because it depends on the successful operation of more than one class. Write a class that handles configuration values. WebConfigSettingsReader could be the name, and it should encapsulate the `ConfigurationManager.AppSettings` call. Pass an instance of that SettingsReader c... | [
0.16574497520923615,
-0.27044686675071716,
0.029226303100585938,
0.15670014917850494,
0.0037681926041841507,
0.023883191868662834,
0.17317180335521698,
-0.22075051069259644,
0.11065875738859177,
-0.8488405346870422,
0.005921388044953346,
0.6387493014335632,
-0.2483026683330536,
0.114263296... | |
I have the following program:
```
~/test> cat test.cc
int main()
{
int i = 3;
int j = __sync_add_and_fetch(&i, 1);
return 0;
}
```
I'm compiling this program using GCC 4.2.2 on Linux running on a multi-cpu 64-bit Intel machine:
```
~/test> uname --all
Linux doom 2.6.9-67.ELsmp #1 SMP Wed Nov 7 13:56:44 EST 20... | [
0.14335133135318756,
0.41438135504722595,
0.3559207618236542,
-0.03239075839519501,
0.09024234861135483,
-0.19856314361095428,
0.5565866231918335,
-0.31381750106811523,
-0.030602553859353065,
-0.6591320633888245,
-0.0028635563794523478,
0.6023080945014954,
-0.40732842683792114,
0.451437354... | |
32-bit processor, I do need a 32-bit executable so I can link with some 32-bit libraries.
My 2 questions are:
1. Why do I get a link error when I compile in 32-bit mode?
2. Is there some way to get the program to compile and link, while still being able to link with a 32-bit library?
From the [GCC page on Atomic Buil... | [
0.15677201747894287,
0.24125704169273376,
0.08711344003677368,
0.23185501992702484,
0.012462843209505081,
-0.1766408085823059,
0.32888293266296387,
-0.18613213300704956,
-0.09064511209726334,
-0.686254620552063,
-0.057971011847257614,
0.5804428458213806,
-0.6349562406539917,
-0.11088743805... | |
external function will carry the same
> name as the builtin, with an
> additional suffix `\_n' where n is the
> size of the data type.
Judging from your compiler output, which refers to `__sync_add_and_fetch_4`, this is what's happening. For some reason, GCC is not generating the external function properly.
This i... | [
-0.17513057589530945,
0.20559532940387726,
0.1949424147605896,
-0.2029724270105362,
-0.2305038422346115,
0.06967076659202576,
0.16744191944599152,
-0.074344702064991,
-0.13497915863990784,
-0.4656650424003601,
0.052731554955244064,
0.7672389149665833,
-0.5170350670814514,
0.234621539711952... | |
specific architecture for your chip family (Xeon, Core 2, etc.) via -mcpu and see if that works.
If not, you'll have to figure out why GCC isn't including the appropriate function that it should be generating. | [
0.3520640730857849,
0.1068376898765564,
0.41947829723358154,
0.2106742411851883,
0.031489185988903046,
-0.1621408462524414,
-0.20155206322669983,
-0.15484581887722015,
-0.22351780533790588,
-0.651033341884613,
-0.3505592942237854,
0.3722517490386963,
-0.16048568487167358,
0.063846826553344... | |
On Sql Server 2000, is there a way to find out the date and time when a stored procedure was last executed?
Not without logging or tracing, I'm afraid | [
0.1547883301973343,
0.24794726073741913,
0.16573303937911987,
0.14911195635795593,
0.162514328956604,
-0.6128427982330322,
-0.02902509644627571,
0.28221985697746277,
-0.38252004981040955,
-0.2941415309906006,
0.42123401165008545,
0.4011366665363312,
-0.13103671371936798,
0.1093601435422897... | |
I would like to create data visualizations in desktop apps, using frameworks, languages and libraries that help with this kind of task. Visualizations should be interactive: clickable, draggable, customizable, animated...
What I would like to create is something similar to the examples seen here: <http://www.visualcom... | [
0.2785053849220276,
0.03764377906918526,
0.3980346620082855,
0.11502508074045181,
-0.2071700394153595,
0.2605808675289154,
-0.15737643837928772,
0.264854371547699,
-0.3148922026157379,
-0.5841274261474609,
-0.021974686533212662,
0.25878283381462097,
-0.037010353058576584,
-0.01393075659871... | |
apps with access to local files or as desktop apps) are possibilities, post any good links to examples, tutorials, how-tos, etc. that you know of.
What are the learning curves and complexity for the different options? Which one would you choose and why? Which one have you already worked with and how was your experienc... | [
0.5030307173728943,
-0.02997150458395481,
0.23732584714889526,
0.6450961232185364,
0.06746582686901093,
0.21866776049137115,
0.039318472146987915,
0.16090887784957886,
-0.5470016002655029,
-0.9223706722259521,
-0.07570949196815491,
0.27516281604766846,
-0.22615358233451843,
-0.085839122533... | |
for web applications versus desktop applications.
Put simply, it's the display of data in a way that visually tells the story of the data. It's most useful in cases where the volume of data is such that tabular display isn't effective. Trends, outliers, and abnormal occurrences can sometimes only be seen when data is... | [
0.754615068435669,
0.22877533733844757,
0.17766377329826355,
0.07748942077159882,
0.16652615368366241,
-0.05777400732040405,
0.011601419188082218,
-0.02452618069946766,
-0.3401213586330414,
-0.5629507899284363,
-0.2170591652393341,
0.33892738819122314,
-0.08939936012029648,
0.1916737407445... | |
IBM AlphaWorks
[Processing](http://www.processing.org) - A visual "sketching" language based on Java
[Visualizing Data](https://rads.stackoverflow.com/amzn/click/com/0596514557) - An O'Reilly book by Ben Fry, one of the co-creators of Processing
Beyond that, I think specifics would depend on what you want to accompl... | [
0.19361937046051025,
0.12561319768428802,
-0.20695491135120392,
-0.24987974762916565,
0.13248854875564575,
0.4293875992298126,
-0.08100857585668564,
-0.28350764513015747,
0.04884564131498337,
-0.3331034183502197,
-0.12259949743747711,
0.09508325159549713,
-0.8143548965454102,
-0.5695537328... | |
I'm not that up on VB.NET, the application I'm working on was not written by myself.
It works fine through the IDE but once I run it from the exe it gives me the above error.
Any clues?
This is really hacking me off!
Afaik, the only way this could occur if you are compiling under debugging settings. You *should* b... | [
0.6163758635520935,
0.03145768493413925,
0.2298596054315567,
0.07772458344697952,
0.1687140166759491,
-0.19118711352348328,
0.4749809503555298,
0.06950628757476807,
-0.30266717076301575,
-0.9156107306480408,
-0.14204426109790802,
0.4226955771446228,
-0.30863460898399353,
0.3997776210308075... | |
out of everything.
6. Build > Rebuild Solution.
Source: [p2p.wrox.com](http://p2p.wrox.com/topic.asp?TOPIC_ID=7712) | [
0.15162386000156403,
-0.22375422716140747,
-0.033128272742033005,
0.038164906203746796,
-0.12236783653497696,
0.2269916832447052,
0.7766319513320923,
-0.17129753530025482,
-0.4741272032260895,
-0.4897233247756958,
-0.41560864448547363,
0.17135551571846008,
-0.19630466401576996,
0.084540441... | |
What's the performance penalty on defining classes in an aspx/ascx codebehind rather than compiling them into a dll beforehand? I know that this isn't a best practice and that there are numerous problems with this (e.g. difficult to unit test, code is not reusable, etc.), but it does come in very handy when you're deal... | [
0.3441901206970215,
-0.0178714320063591,
-0.01700327917933464,
0.13857439160346985,
0.016711529344320297,
-0.15508337318897247,
0.3254113495349884,
-0.1206725537776947,
-0.2741397023200989,
-0.566872239112854,
-0.2515121102333069,
0.7661771178245544,
-0.27810952067375183,
0.020992854610085... | |
then that DLL is kept around. So basically the first time you load the page there will be a short delay, but afterwards the speed should be the same as with precompiled classes. | [
0.1994236409664154,
-0.33702200651168823,
0.34048065543174744,
0.22860538959503174,
-0.19683794677257538,
-0.4101766347885132,
0.15520331263542175,
-0.013473139144480228,
-0.17438021302223206,
-0.7424322366714478,
-0.2941327393054962,
0.4909653663635254,
-0.002703313250094652,
0.1073542833... | |
Is it at the state where it is actually useful and can do more than rename classes?
CDT (C/C++ Development Tools - eclipse project) 5.0 has a bunch of new refactorings
```
* Declare Method
* Extract Baseclass
* Extract Constant
* Extract Method
* Extract Subclass
* Hide Method
* Implement Method
* Move Field / Method
... | [
0.1272292137145996,
-0.08053098618984222,
0.46445122361183167,
-0.07918839156627655,
-0.21689830720424652,
-0.4260541796684265,
-0.09566911309957504,
-0.18726904690265656,
-0.22626365721225739,
-0.4454940855503082,
-0.26510411500930786,
0.6414675712585449,
-0.5064554214477539,
-0.172677949... | |
When coding, what in your experience is a better approach?
1. Break the problem down into small enough pieces and then implement each piece.
2. Break the problem down, but then implement using a top-down approach.
3. Any other?
Here's what I do:
Understand the domain first. Understand the problem to be solved. Make ... | [
0.6924620270729065,
-0.021826544776558876,
-0.18858949840068817,
0.19751664996147156,
-0.030365658923983574,
0.0472661592066288,
0.101588673889637,
-0.0467144213616848,
-0.08593182265758514,
-0.6264588832855225,
-0.05985148996114731,
0.6072911024093628,
-0.22804510593414307,
-0.20351937413... | |
the point is that it will shake out into components that can be designed.
At that point, I write tests for the yet-to-be written classes and then flesh out the classes to pass those tests.
I use a test-first approach and build working, tested components. That is what works for me. When the component interfaces are kn... | [
0.5638563632965088,
0.0032616581302136183,
-0.016539273783564568,
0.12024760246276855,
0.05694957822561264,
0.032012321054935455,
0.05869970843195915,
-0.22680814564228058,
0.27112632989883423,
-0.6149139404296875,
0.15293146669864655,
0.7076798677444458,
-0.08781646192073822,
-0.378179490... | |
Could you guys recommend some affordable SQL modeling tool which supports SQL Server, PostgreSQL and MySQL? I'm looking into up to $300 per license range. One tool per answer, please!
Thanks!
This site has a run down of some of the tools available: <http://www.databaseanswers.com/modelling_tools.htm>.
I tried Dezign ... | [
0.471455842256546,
-0.03088441491127014,
0.08245083689689636,
0.4462238550186157,
0.10216572135686874,
0.035383954644203186,
0.024591943249106407,
0.2763982117176056,
-0.06145694479346275,
-0.744884192943573,
0.521811842918396,
0.5392026901245117,
-0.04938919097185135,
0.13859902322292328,... | |
because I don't have any budget for tools but I would have if I did. If you need multiple licenses, the 5 and 10 packs offer a significant discount over the single-license fee. | [
0.7588331699371338,
0.040241360664367676,
-0.0727880448102951,
0.0858890563249588,
0.275782972574234,
-0.32586419582366943,
-0.04677080363035202,
-0.330120325088501,
-0.1870143860578537,
-0.22242224216461182,
0.5098874568939209,
0.4302867650985718,
0.021739160642027855,
-0.4274154901504516... | |
I have a table that has redundant data and I'm trying to identify all rows that have duplicate sub-rows (for lack of a better word). By sub-rows I mean considering `COL1` and `COL2` only.
So let's say I have something like this:
```
COL1 COL2 COL3
---------------------
aa 111 blah_x
aa 111 blah... | [
0.04653068259358406,
0.6277696490287781,
0.7153304815292358,
-0.1211891919374466,
-0.25497493147850037,
0.36925071477890015,
-0.04681021720170975,
-0.06519126892089844,
-0.6804429292678833,
-0.39846479892730713,
0.025899270549416542,
0.40616434812545776,
-0.6087281107902527,
-0.13632854819... | |
bb 112 blah_d
cc 112 blah_w
cc 113 blah_p
```
I need a SQL query that returns this:
```
COL1 COL2 COL3
---------------------
aa 111 blah_x
aa 111 blah_j
bb 112 blah_d
bb 112 blah_d
```
Does this work for you?
```
select t.* from table t
left join ( selec... | [
0.11465121805667877,
0.5208556056022644,
0.7033093571662903,
-0.17836207151412964,
-0.16317839920520782,
0.3245824873447418,
-0.18170066177845,
-0.2740558683872223,
-0.4660167694091797,
-0.19660702347755432,
0.010336538776755333,
0.33150774240493774,
-0.6772860884666443,
-0.291308969259262... | |
count from table group by col1, col2 ) c on t.col1=c.col1 and t.col2=c.col2
where c.count > 1
``` | [
-0.29664817452430725,
0.23510149121284485,
0.83583003282547,
-0.3097216486930847,
0.0008740230114199221,
0.04029586911201477,
-0.23506391048431396,
-0.49169325828552246,
-0.38247430324554443,
-0.25867193937301636,
-0.44880256056785583,
0.3294849395751953,
-0.27635717391967773,
0.0894389674... | |
I have a backroundrb scheduled task that takes quite a long time to run. However it seems that the process is ending after only 2.5 minutes.
My background.yml file:
```
:schedules:
:named_worker:
:task_name:
:trigger_args: 0 0 12 * * * *
:data: input_data
```
I have zero activity on the server whe... | [
0.529461145401001,
0.3140121400356293,
0.4388938546180725,
-0.13123174011707306,
0.16265642642974854,
-0.1897222101688385,
0.6258090138435364,
0.2928462326526642,
-0.596653163433075,
-0.5626769065856934,
0.19588340818881989,
0.45032575726509094,
0.05642975494265556,
0.15884268283843994,
... | |
the problem.
Because backgroundrb operates in the background, it can be quite hard to monitor/debug.
Here are some ideas I use:
1. Write a unit test to test the worker code itself and make sure there are no problems there
2. Put "puts" statements at multiple points in the code so you can at least see some responses w... | [
0.3285585939884186,
-0.008911347016692162,
0.058191753923892975,
0.16441141068935394,
0.008666577748954296,
0.03689389303326607,
0.5403442978858948,
-0.3042977452278137,
-0.21898770332336426,
-0.5226799249649048,
-0.06297282129526138,
0.32208308577537537,
-0.33810654282569885,
-0.152254849... | |
I am creating an HTTP handler that listens for calls to a specific file type, and handles it accordingly. My HTTP Handler listens for .bcn files, then writes a cookie to the user's computer and sends back an image... this will be used in advertising banners so that the user is tagged as seeing the banner, and we can th... | [
0.857339084148407,
0.13855835795402527,
0.3662528693675995,
-0.11654051393270493,
-0.17501996457576752,
-0.2423594444990158,
0.11512471735477448,
-0.12365775555372238,
-0.07690545171499252,
-0.5903403759002686,
0.19881494343280792,
0.44487011432647705,
-0.3840283453464508,
0.07620504498481... | |
get access to it to write the cookie.
Is there a way around this, or do i need to revert back to just using a standard aspx page to do this?
Thanks heaps..
Greg
You can access the Response object from the HttpContext object passed to the ProcessRequest method from IHttpHandler. This is the same object exposed by Pag... | [
0.33804407715797424,
0.006556118838489056,
0.4023115932941437,
0.2726590633392334,
-0.5506952404975891,
-0.14086303114891052,
0.47990500926971436,
-0.03832101449370384,
-0.2220209687948227,
-0.721370279788971,
0.02194935269653797,
0.37857916951179504,
-0.12762850522994995,
0.18752878904342... | |
If I have a Range object--for example, let's say it refers to cell `A1` on a worksheet called `Book1`. So I know that calling `Address()` will get me a simple local reference: `$A$1`. I know it can also be called as `Address(External:=True)` to get a reference including the workbook name and worksheet name: `[Book1]She... | [
0.2728825509548187,
0.45216724276542664,
0.3197689950466156,
-0.300269216299057,
0.10352324694395065,
-0.12569399178028107,
0.16828589141368866,
-0.30656662583351135,
-0.057279087603092194,
-0.3145827054977417,
-0.1370009332895279,
0.5606213808059692,
-0.3057498335838318,
0.170503333210945... | |
get `Sheet1!$A$1`?
Only way I can think of is to concatenate the worksheet name with the cell reference, as follows:
```
Dim cell As Range
Dim cellAddress As String
Set cell = ThisWorkbook.Worksheets(1).Cells(1, 1)
cellAddress = cell.Parent.Name & "!" & cell.Address(External:=False)
```
EDIT:
Modify last line to :
... | [
0.0395071879029274,
0.20626644790172577,
0.6750728487968445,
-0.18639454245567322,
0.07664047181606293,
-0.10998742282390594,
0.16247141361236572,
-0.4482693076133728,
-0.044754866510629654,
-0.5830634236335754,
-0.23829558491706848,
0.2714333236217499,
-0.29935547709465027,
0.038015317171... | |
I have a number of code value tables that contain a code and a description with a Long id.
I now want to create an entry for an Account Type that references a number of codes, so I have something like this:
```
insert into account_type_standard (account_type_Standard_id,
tax_status_id, recipient_id)
( select account_... | [
0.29048287868499756,
0.2966915965080261,
0.20614123344421387,
-0.07204941660165787,
0.15039673447608948,
0.12876300513744354,
-0.07252850383520126,
-0.395160436630249,
-0.16166560351848602,
-0.5015823841094971,
-0.07076958566904068,
0.5381291508674622,
-0.046938128769397736,
0.113689221441... | |
a row doesn't get inserted into my table.
I've tried using NVL on the ? and on the r.recipient\_id.
I've tried to force an outer join on the r.recipient\_code = ? by adding (+), but it's not an explicit join, so Oracle still didn't add another row.
Anyone know of a way of doing this?
I can obviously modify the sta... | [
-0.14279167354106903,
0.28409844636917114,
0.4432426393032074,
-0.21525689959526062,
-0.11975601315498352,
0.36131051182746887,
-0.10741178691387177,
-0.1546015590429306,
-0.10371784120798111,
-0.5565255880355835,
0.08587861061096191,
0.5017809271812439,
-0.3346196711063385,
0.351116597652... | |
in that case because you have explicitly told Oracle you only want data if that criteria on that table matches. In that scenario, the outter join is rendered useless.
A work-around
```
INSERT INTO account_type_standard
(account_type_Standard_id, tax_status_id, recipient_id)
VALUES(
(SELECT account_type_standar... | [
0.12366369366645813,
0.08139338344335556,
0.2166740894317627,
0.09412176162004471,
0.07628747075796127,
0.19882461428642273,
-0.07483285665512085,
-0.5178942680358887,
-0.0894337147474289,
-0.47374996542930603,
-0.2044256627559662,
0.5473307371139526,
-0.13892102241516113,
0.12594959139823... | |
comment,
```
(SELECT account_type_standard_seq.nextval FROM DUAL),
```
can be just
```
account_type_standard_seq.nextval,
``` | [
-0.05765708535909653,
0.0172349251806736,
0.21011389791965485,
0.14580397307872772,
0.016075147315859795,
-0.047287438064813614,
-0.057633452117443085,
0.32109102606773376,
-0.23304922878742218,
-0.6051263213157654,
-0.3120197355747223,
0.4597618877887726,
-0.34081318974494934,
0.030612174... | |
Trying to install the RMagick gem is failing with an error about being unable to find ImageMagick libraries, even though I'm sure they are installed.
The pertinent output from gem install rmagick is:
```
checking for InitializeMagick() in -lMagick... no
checking for InitializeMagick() in -lMagickCore... no
checking f... | [
0.21958351135253906,
0.21489474177360535,
0.35957860946655273,
-0.3157607316970825,
-0.2923954427242279,
-0.015223473310470581,
0.6163719296455383,
-0.5659258961677551,
-0.06838260591030121,
-0.532589316368103,
-0.27571675181388855,
0.9511961936950684,
-0.44934824109077454,
-0.186132445931... | |
-lfreetype -lz -L/usr/local/lib -L/usr/local/lib -lMagickCore -lruby-static - lMagick -ldl -lcrypt -lm -lc"
ld: fatal: library -lMagick: not found
ld: fatal: File processing errors. No output written to conftest
```
This is on Solaris 10 x86 with ImageMagick version 6.4.3 and RMagick version 2.6.0
If I need to... | [
-0.04739147052168846,
-0.14269638061523438,
0.8786064982414246,
0.1486038714647293,
0.039338432252407074,
-0.19563132524490356,
0.3265213668346405,
-0.08166762441396713,
0.0543106310069561,
-0.8035281896591187,
-0.1289946287870407,
0.6402368545532227,
-0.6580794453620911,
-0.37062045931816... | |
drwxr-xr-x 5 root root 512 Sep 24 23:09 ImageMagick-6.4.3/
-rw-r--r-- 1 root root 10808764 Sep 25 02:09 libMagickCore.a
-rwxr-xr-x 1 root root 1440 Sep 25 02:09 libMagickCore.la*
-rw-r--r-- 1 root root 2327072 Sep 25 02:09 libMagickWand.a
-rwxr-xr-x 1 root root 1472 Sep 25 02:09 libMagickWand.la*
``... | [
0.31340423226356506,
0.4696638286113739,
0.4733755886554718,
-0.006228678394109011,
-0.6313183903694153,
0.14777792990207672,
0.7658714056015015,
-0.24429523944854736,
-0.33514460921287537,
-0.45667773485183716,
-0.2057500034570694,
0.7709910869598389,
-0.3505234718322754,
0.22885665297508... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.