text stringlengths 0 30.5k | title stringclasses 1
value | embeddings listlengths 768 768 |
|---|---|---|
I'm looking to implement an ESB and wanted to get thoughts related to "how" my web services might change (WCF) or -- how my client apps that consume these services might "need to be revised" (-- other than a new service ref to the ESB path --)
The device I'm working with specifically is the "WebSphere DataPower XML Se... | [
-0.062468353658914566,
-0.06684427708387375,
0.6271017789840698,
-0.0379631482064724,
0.19246123731136322,
-0.3274526000022888,
0.1842522919178009,
0.005297986324876547,
-0.15492187440395355,
-0.7745969891548157,
-0.15626847743988037,
0.43921613693237305,
-0.12156004458665848,
-0.163670644... | |
I have always used the agile [Feature Driven Development](http://en.wikipedia.org/wiki/Feature_Driven_Development) process for developing software. What does everyone else use, and why do you prefer it? I prefer FDD because that's what I started with fresh out of college. In college, everything was very free-form and m... | [
0.6123950481414795,
0.39227294921875,
0.036740221083164215,
-0.143173485994339,
-0.0411185659468174,
0.13443449139595032,
0.05752141773700714,
0.5605385303497314,
0.014821925200521946,
-0.7697562575340271,
-0.005569192115217447,
0.9887905716896057,
0.10933846235275269,
0.08655606210231781,... | |
It is a subset of AGILE techniques and it is behavioural requirements driven. The ICONIX process aims to be as low-celebration as possible having as little documentation as possible - in order to allow you to easily keep it up-to-date (this is a big difference from other AGILE processes, for example XP practitioners of... | [
0.3389267325401306,
-0.10005287826061249,
0.43422356247901917,
0.1117633506655693,
-0.23224198818206787,
-0.20040671527385712,
-0.0061568752862513065,
-0.2791738510131836,
-0.22461718320846558,
-0.5005529522895813,
-0.2897350788116455,
0.7348206043243408,
-0.15617066621780396,
-0.369108378... | |
throw-away robustness diagram for each use
case, just to understand relations
between your classes
5. Draw a
Sequence Diagram for each use case
6. Model your test-cases on the use cases
7. Implement
8. Test
At each step you review your work as a whole updating your domain model (it's impossible to get it right first t... | [
0.2504671514034271,
0.21443313360214233,
-0.26520419120788574,
0.09016171097755432,
-0.09171412885189056,
-0.040990784764289856,
0.263182133436203,
-0.5115106105804443,
0.16865259408950806,
-0.6923023462295532,
0.0069235689006745815,
0.5004194974899292,
0.1329115778207779,
0.13779368996620... | |
add a feature, you add a new use case and follow the whole process.
Resources:
[Iconix process website](http://iconixprocess.com/)
[Iconix Software Engineering website](http://www.iconixsw.com/)
Books References:
[AGILE Development with ICONIX Process](https://rads.stackoverflow.com/amzn/click/com/1590594649) | [
0.3261469900608063,
0.08584341406822205,
0.07207056134939194,
-0.06235344707965851,
0.09796658158302307,
0.026074213907122612,
0.20284615457057953,
-0.3922666013240814,
-0.30890902876853943,
-0.5041723251342773,
-0.3932132124900818,
0.6569380164146423,
-0.014379159547388554,
-0.28741696476... | |
I hear logarithms mentioned quite a lot in the programming context. They seem to be the solution to many problems and yet I can't seem to find a real-world way of making use of them. I've read the [Wikipedia entry](http://en.wikipedia.org/wiki/Logarithms) and that, quite frankly, leaves me none the wiser.
**So, where ... | [
0.5362469553947449,
0.4652255177497864,
0.10953794419765472,
0.30352982878685,
0.2789858281612396,
0.1819005012512207,
0.013395356014370918,
0.37528637051582336,
-0.6085048913955688,
-0.5781354904174805,
0.11353987455368042,
0.41450223326683044,
0.3339838981628418,
0.3020192086696625,
0.... | |
to buy a new laptop?
1000 × 1.024x = 2000
1.024x = 2
x = log 1.024 2 = 29.23 years | [
0.3455803096294403,
0.13793858885765076,
0.3525271415710449,
0.389265239238739,
0.3840142488479614,
0.34061169624328613,
0.2862066328525543,
0.03888219967484474,
-0.2363743931055069,
-0.09456829726696014,
0.19278158247470856,
0.3483062982559204,
0.30085062980651855,
0.1302015334367752,
-... | |
I'm looking for some programming guides to C# GUI design. I come from the Java camp (where I can happily hand-code Swing/AWT GUIs) and thus don't have a clue where to start :(
Also, what difference (if any) is there between the Windows Presentation Foundation and WinForms?
Chris Sells seems to be 'dah man' with regard... | [
0.22199507057666779,
0.2892601490020752,
0.4622418284416199,
-0.014251013286411762,
-0.21105700731277466,
0.23210516571998596,
0.01908334717154503,
0.13008607923984528,
-0.3498280644416809,
-0.5127054452896118,
0.024810008704662323,
0.6485757827758789,
0.232666477560997,
0.1025680750608444... | |
I want to detect users' screen size and pass this into a charting application (Chart Director by <http://www.advsofteng.com>) to control how big an image to display.
I have to use ASP, but I can only think to use JavaScript to detect screen-size and then pass this into the server-side script. Is there an easier way?
... | [
0.40917301177978516,
-0.0602651908993721,
0.6076832413673401,
-0.06159064918756485,
-0.289852499961853,
-0.01935114897787571,
-0.10540639609098434,
0.002222467679530382,
-0.28219422698020935,
-1.066807508468628,
0.39522749185562134,
0.3828200399875641,
-0.05922969430685043,
0.0211488138884... | |
Yesterday, I asked [this](https://stackoverflow.com/questions/119107/how-do-i-generate-a-list-of-n-unique-random-numbers-in-ruby) question and never really got an answer I was really happy with. I really would like to know how to generate a list of N unique random numbers using a functional language such as Ruby withou... | [
0.12159813940525055,
-0.00903281755745411,
0.08859488368034363,
-0.09163090586662292,
-0.162536159157753,
-0.023473680019378662,
0.3259074091911316,
-0.42358794808387756,
-0.3216814398765564,
-0.31619271636009216,
-0.12718239426612854,
0.2422073632478714,
-0.5940351486206055,
0.20787610113... | |
select q;
}
private static IEnumerable GetRandomNumbers(int max)
{
Random r = new Random();
while (true)
{
yield return r.Next(max); | [
-0.078553207218647,
-0.620715320110321,
0.32036128640174866,
-0.23219673335552216,
0.339520126581192,
0.13103103637695312,
0.23471024632453918,
-0.4809478521347046,
0.19818316400051117,
-0.46284839510917664,
-0.2728695869445801,
0.6436353325843811,
-0.14760500192642212,
0.14998625218868256... | |
}
}
```
Can you translate my LINQ to Ruby? Python? Any other functional programming language?
**Note:** Please try not to use too many loops and conditionals - otherwise the solution is trivial. Also, I'd rather see a solution where you don't have to generate an array much bigger than N so you can then just ... | [
0.28912484645843506,
0.2713753879070282,
0.08597898483276367,
-0.2567201554775238,
-0.06073805317282677,
0.0742560625076294,
0.202424556016922,
0.17046278715133667,
-0.10997577011585236,
-0.4863678514957428,
-0.05285912752151489,
0.49328622221946716,
-0.5239464044570923,
-0.117155194282531... | |
as many pointed out, could leave me with an empty list. I've changed the order in which those methods are called to reflect what I meant in the first place.
**Apology:**
I've been told this post came across as rather snobbish. I wasn't trying to imply that LINQ is better than Ruby/Python; or that my solution is muc... | [
0.28925397992134094,
0.1983678638935089,
0.03358883783221245,
-0.18216748535633087,
-0.6087550520896912,
-0.23367613554000854,
0.7787785530090332,
0.2819376289844513,
-0.3975715935230255,
-0.3101191222667694,
-0.301070898771286,
0.3576367199420929,
-0.04674505442380905,
-0.0314134024083614... | |
(0...100).entries.sort\_by{rand}[0...5]
**EDIT:**
and In Ruby 1.9 you can do this:
```
Array(0..100).sample(5)
``` | [
0.0658930242061615,
0.08408448100090027,
0.054979536682367325,
-0.21740296483039856,
-0.21300239861011505,
-0.005862450692802668,
0.4263702630996704,
-0.4920005798339844,
-0.032007843255996704,
-0.429330438375473,
-0.07407771795988083,
0.2896379232406616,
-0.3758481442928314,
0.00802867114... | |
At present it seems that VS2008 still isn't supported either in the 5.1.5 release or in the STLPort CVS repository. If someone has already done this work then it would be useful to share, if possible :)
Likewise it would be useful to know about the changes required for a VS2005 or 2008 x64 build.
[Seems so](http://blo... | [
0.4266318082809448,
-0.13154466450214386,
0.043946269899606705,
-0.09968698769807816,
0.08658558875322342,
-0.16675271093845367,
0.3882843554019928,
0.13925468921661377,
-0.3513857424259186,
-0.3078262507915497,
-0.012727135792374611,
0.399027943611145,
-0.09426378458738327,
0.524376809597... | |
I have a table in a MSSQL database that looks like this:
```
Timestamp (datetime)
Message (varchar(20))
```
Once a day, a particular process inserts the current time and the message 'Started' when it starts. When it is finished it inserts the current time and the message 'Finished'.
What is a good query or set of s... | [
0.26837942004203796,
0.07417000830173492,
0.21387451887130737,
-0.03625951334834099,
0.008479557000100613,
0.1388259083032608,
0.12686893343925476,
0.09925195574760437,
-0.38035738468170166,
-0.6512202024459839,
-0.029494285583496094,
-0.06307610869407654,
0.060009777545928955,
0.464022934... | |
error if the data is invalid, for example there are two 'Started' messages, or there is a 'Finished' without a 'Started'.
```
Select Count(Message) As Status
From Process_monitor
Where TimeStamp >= '20080923'
And TimeStamp < '20080924'
And (Message = 'Started' or Message = 'Finished')
```
You could m... | [
-0.20707915723323822,
0.20797207951545715,
0.057447146624326706,
-0.09224525839090347,
0.15554235875606537,
0.27543967962265015,
0.38767004013061523,
-0.0026489077135920525,
-0.6354830861091614,
-0.6223489046096802,
-0.06501122564077377,
0.29057854413986206,
-0.1469319611787796,
0.30038678... | |
1 And SumFinished = 0 Then 'Started'
When SumStarted = 1 And SumFinished = 1 Then 'Finished'
When SumStarted > 1 Then 'Multiple Starts'
When SumFinished > 1 Then 'Multiple Finish'
When SumFinished > 0 And SumStarted = 0 Then 'Finish Without Start' | [
-0.17827948927879333,
0.06976962089538574,
0.07411343604326248,
-0.22402262687683105,
-0.335674911737442,
0.4266326129436493,
0.3236592411994934,
-0.6157582998275757,
-0.48171237111091614,
-0.4006214141845703,
-0.27175551652908325,
0.32413187623023987,
-0.08609708398580551,
0.1206384673714... | |
End As StatusMessage
From (
Select Sum(Case When Message = 'Started' Then 1 Else 0 End) As SumStarted,
Sum(Case When Message = 'Finished' Then 1 Else 0 End) As SumFinished
From Process_monitor
Where TimeStamp >= '20080923' | [
-0.30635958909988403,
-0.2892622947692871,
0.6424722075462341,
-0.2083808034658432,
0.148520827293396,
0.2123529464006424,
0.24531537294387817,
-0.27766329050064087,
-0.3941591680049896,
-0.4370877742767334,
-0.09727710485458374,
0.3007468581199646,
0.0013358269352465868,
0.387187838554382... | |
And TimeStamp < '20080924'
And (Message = 'Started' or Message = 'Finished')
) As AliasName
``` | [
-0.26670458912849426,
0.040872976183891296,
0.5179604887962341,
-0.060078855603933334,
0.23861882090568542,
-0.10398765653371811,
0.4122963547706604,
0.17954301834106445,
-0.19352057576179504,
-0.5014172792434692,
-0.23191386461257935,
0.461026668548584,
0.09739513695240021,
0.429032683372... | |
Management wants us to switch to Infragistics. But my boss says that any 3rd party is destined to fail, and at that point there won't be anything we can do about it.
Is he right, is he wrong? I don't know.
What are your opinions, is it better to use something developed inside the company, or do you prefer something ... | [
0.48458132147789,
0.07313524931669235,
0.1525677740573883,
0.5108292698860168,
0.12112853676080704,
-0.13519640266895294,
0.18187910318374634,
0.10937848687171936,
-0.11235934495925903,
-0.47473716735839844,
0.2225423902273178,
0.8925780057907104,
-0.1500472128391266,
0.09580553323030472,
... | |
should be able to make any necessary changes to the components to keep them running well in your environment.
The Krypton Suite of controls from Component Factory does just this. Phil offers the source code for the entire suite for an amazing price (currently less than $400). I have used the Krypton Suite in my develo... | [
0.6472393274307251,
0.1931246817111969,
0.41410818696022034,
0.529263973236084,
-0.013822846114635468,
-0.26637691259384155,
-0.19923554360866547,
0.1939927637577057,
0.06740035861730576,
-0.15378232300281525,
0.013327181339263916,
0.24840602278709412,
0.05746830254793167,
0.29394423961639... | |
support forums and provides you a direct link to the development path of the software. | [
0.6131334900856018,
0.13103243708610535,
-0.022916825488209724,
0.36309999227523804,
-0.10934247821569443,
-0.312253475189209,
0.11244167387485504,
0.1959315836429596,
-0.0758281722664833,
-0.3074401915073395,
-0.4448707401752472,
0.48569604754447937,
0.46461254358291626,
0.118471957743167... | |
In order to create the proper queries I need to be able to run a query against the same datasource that the report is using. How do I get that information **programatically**? Preferably the connection string or pieces of data used to build the connection string.
```
DataSourceDefinition dataSourceDefinition
= rep... | [
0.07661629468202591,
0.2848002016544342,
0.5353596210479736,
0.30005985498428345,
0.17215417325496674,
-0.2309160828590393,
0.26556819677352905,
-0.24567800760269165,
-0.1628817319869995,
-0.6953041553497314,
-0.14759187400341034,
0.5001693367958069,
0.06286774575710297,
0.1946245282888412... | |
I'm using Team Foundation Build but we aren't yet using TFS for problem tracking, so I would like to disable the work item creation on a failed build. Is there any way to do this? I tried commenting out the work item info in the TFSBuild.proj file for the build type but that didn't do the trick.
Try adding this inside ... | [
0.5144146680831909,
0.04328303411602974,
-0.14598803222179413,
-0.04461532458662987,
0.2269560694694519,
-0.2957642376422882,
0.3942646384239197,
-0.27521899342536926,
-0.12376727163791656,
-0.7990850210189819,
0.03278140351176262,
0.4502418041229248,
-0.2381398230791092,
-0.18847075104713... | |
DependsOnTargets="$(CoreCreateWorkItemDependsOn)">
<PropertyGroup>
<WorkItemTitle>$(WorkItemTitle) $(BuildNumber)</WorkItemTitle>
<BuildLogText>$(BuildlogText) <a href='file:///$(DropLocation)\$(BuildNumber)\BuildLog.txt'>$(DropLocation)\$(BuildNumber)\BuildLog.txt</a >.</BuildLogText>
... | [
0.5377967357635498,
0.05429796501994133,
0.6698925495147705,
-0.37949296832084656,
0.27320656180381775,
0.3082929253578186,
0.14433984458446503,
-0.5817247033119202,
0.024177812039852142,
-0.6270024180412292,
-0.010036985389888287,
0.9171175360679626,
-0.3467737138271332,
-0.19407215714454... | |
TeamProject="$(TeamProject)"
Title="$(WorkItemTitle)"
WorkItemFieldValues="$(WorkItemFieldValues)"
WorkItemType="$(WorkItemType)"
ContinueOnError="true" />
</Target>
```
You can override any of this functionality in your own build script, but Microsoft provide the handy Skip... | [
0.24673905968666077,
-0.29361864924430847,
0.05566839873790741,
-0.15994231402873993,
0.2861124873161316,
-0.3840937912464142,
0.6067519187927246,
-0.08745292574167252,
-0.11687775701284409,
-0.43343329429626465,
-0.4600813686847687,
0.5833035707473755,
-0.3252491056919098,
-0.311433315277... | |
So I have a large 2d array that i serialize, but when I attempt to unserialize the array it just throws the same error to the point of nearly crashing Firefox.
The error is:
```
Warning: unserialize() [function.unserialize]: Node no longer exists in /var/www/dev/wc_paul/inc/analyzerTester.php on line 24
```
I would... | [
0.21839639544487,
0.26705875992774963,
0.2770540714263916,
-0.04158730059862137,
0.0071741086430847645,
-0.251691073179245,
0.5149931907653809,
-0.05399991199374199,
-0.27079346776008606,
-0.6094151139259338,
-0.11437255144119263,
0.37917229533195496,
-0.6680169701576233,
0.350196152925491... | |
array. If it can't be serialized I can accept that I guess... but how should I go about saving it then?
Usually, when you get an error message, you can figure out a great deal by simply searching the web for that very message. For example, when you put [Node no longer exists](http://www.google.co.uk/search?q=Node+no+lo... | [
0.20567454397678375,
-0.03611183539032936,
0.03689729422330856,
0.06793269515037537,
-0.505640983581543,
0.12770472466945648,
-0.04636405408382416,
0.06613209843635559,
-0.8154521584510803,
-0.5062205195426941,
0.5587049722671509,
0.5509089231491089,
-0.6276405453681946,
0.277605801820755,... | |
Within a table cell that is vertical-align:bottom, I have one or two divs. Each div is floated right.
Supposedly, the divs should not align to the bottom, but they do (which I don't understand, but is good).
However, when I have two floated divs in the cell, they align themselves to the same top line.
I want t... | [
0.02590472251176834,
0.026260951533913612,
0.7158340811729431,
-0.2337343990802765,
-0.16891081631183624,
0.05700688064098358,
-0.28162363171577454,
-0.2566714584827423,
-0.22344613075256348,
-0.7633233666419983,
0.0009242105297744274,
0.30769702792167664,
-0.06218656152486801,
-0.10932908... | |
border-collapse: collapse;
> }
> td {
> border:1px solid black;
> vertical-align:bottom;
> }
> .h {
> float:right;
> background: #FFFFCC;
> }
> .ha {
> float:right;
> background: #FFCCFF;
> }
> </style>
>
> <table>
> <tr>
> <td>
> <div class="ha">@</div>
> <div class="h">Title ... | [
-0.05735481530427933,
-0.11375568807125092,
0.7639503479003906,
0.04165751114487648,
0.016565073281526566,
0.10926389694213867,
0.15557178854942322,
-0.4649297595024109,
-0.2757699489593506,
-0.5421448945999146,
-0.3641449511051178,
0.1745695024728775,
-0.15086425840854645,
0.4191512167453... | |
<div class="h">Title Text<br />Line 2<br />Line 3</div>
> </td>
> <td>
> <div class="h">Title Text<br />Line 2</div>
> </td>
> <td>
> <div class="h">Title Text<br />Line 2</div>
> </td>
> <td>
> <div class="h">Title Text<br />Line 2</div>
> </td>
> </tr>
> <... | [
-0.16639579832553864,
-0.0287336278706789,
0.4456287622451782,
-0.18663842976093292,
-0.4001590609550476,
0.1963973343372345,
0.10525063425302505,
-0.5620653629302979,
-0.04863375052809715,
-0.42371866106987,
-0.5576430559158325,
0.3191443681716919,
-0.05836915597319603,
0.2301579862833023... | |
<td>
> <div class="d">123456789</div>
> </td>
> <td>
> <div class="d">123456789</div>
> </td>
> <td>
> <div class="d">123456789</div>
> </td>
> <td>
> <div class="d">123456789</div>
> </td>
> <td>
> <div class="d">123456789</div>
> | [
-0.08672893792390823,
0.005410398356616497,
0.08541999012231827,
-0.07157224416732788,
-0.18621662259101868,
0.2733183801174164,
0.40660810470581055,
-0.48906993865966797,
-0.13255712389945984,
-0.4476170539855957,
-0.3222317099571228,
0.6018856167793274,
-0.08011411875486374,
0.2720861732... | |
</td>
> </tr>
> </table>
>
> ```
Here are the problems:
1. Why does the @ sign sit at the same level as the yellow div?
2. Supposedly vertical-align doesn't apply to block elements (like a floated div) 1. But it does!
3. How can I make the @ sit at the bottom or make it full height of the table cell?
I am test... | [
0.112538181245327,
-0.03243818134069443,
0.7925426363945007,
-0.1941457986831665,
-0.3215538561344147,
-0.03806125372648239,
0.3314839005470276,
-0.3436267375946045,
-0.029025888070464134,
-0.7263948917388916,
-0.020245783030986786,
0.5033177733421326,
-0.2043781727552414,
-0.3021518588066... | |
put them on different lines.
Additionally, the cells can have variable lines of text - therefore, *line-height* will not help.
I never answered the first two questions, so feel free to give your answers below. But I *did* solve the last problem, of how to make it work.
I added a containing div to the two divs inside ... | [
0.30279383063316345,
-0.2380552738904953,
0.5777562260627747,
-0.02181338146328926,
-0.19529736042022705,
0.17060436308383942,
0.15844666957855225,
-0.576581597328186,
0.006447204854339361,
-0.6360428929328918,
0.048837386071681976,
0.2791256010532379,
-0.23048314452171326,
0.0703002586960... | |
<div class="ha">@</div>
> </div>
> </td>
>
> ```
Then I used the following CSS
> ```
> <style type="text/css">
> table {
> border-collapse: collapse;
> }
> td {
> border:1px solid black;
> vertical-align:bottom;
> }
> .t {
> position: relative;
> width:150px;
> }
> .h {
> background: #FFFFCC;
>... | [
0.035061877220869064,
-0.19563895463943481,
0.792314887046814,
0.005050055216997862,
0.07992326468229294,
0.14274834096431732,
0.23637066781520844,
-0.569267988204956,
-0.32821670174598694,
-0.5845094919204712,
-0.3508310914039612,
0.30686599016189575,
-0.04704481363296509,
0.1967692822217... | |
div to be position absolutely relative to it's *parent* the parent must be declared position:relative** | [
-0.3891858160495758,
0.019337410107254982,
0.4644154906272888,
-0.3103002905845642,
-0.46770602464675903,
0.15778115391731262,
0.08060592412948608,
0.19918867945671082,
0.1953987330198288,
-0.32587239146232605,
-0.627044677734375,
0.04322448745369911,
0.17517365515232086,
0.511284768581390... | |
Does anyone have any code examples on how to create controllers that have parameters other than using a Dependency Injection Container?
I see plenty of samples with using containers like StructureMap, but nothing if you wanted to pass in the dependency class yourself.
You can use poor-man's dependency injection:
```... | [
0.3216928541660309,
-0.3437078595161438,
0.0628228709101677,
0.3627361059188843,
0.07953335344791412,
-0.41976144909858704,
-0.18653631210327148,
-0.07793265581130981,
-0.19357843697071075,
-0.5662081837654114,
0.12100958824157715,
0.7898566126823425,
-0.5197058916091919,
0.355966448783874... | |
I want to be able to quickly check whether I both have sudo access and my password is already authenticated. I'm not worried about having sudo access specifically for the operation I'm about to perform, but that would be a nice bonus.
Specifically what I'm trying to use this for is a script that I want to be runnable ... | [
0.2636656165122986,
-0.010495959781110287,
0.25440526008605957,
0.25191208720207214,
-0.12490091472864151,
-0.34787824749946594,
0.34362319111824036,
0.04046488180756569,
-0.1041046604514122,
-0.6671320796012878,
-0.1863785833120346,
0.4737010598182678,
0.11305234581232071,
-0.003172510536... | |
the *root* password (because they might not have sudo access).
My first non-working attempt was to fork off `sudo -S true` with STDIN closed or reading from /dev/null. But that still prompts for the password and waits a couple of seconds.
I've tried several other things, including waiting 0.3sec to see whether it suc... | [
0.019800612702965736,
-0.03966229408979416,
0.252093106508255,
0.04976161941885948,
-0.22145406901836395,
-0.06036442890763283,
0.8951600193977356,
0.30257344245910645,
0.04419545456767082,
-0.7671558856964111,
-0.08247295022010803,
0.30430832505226135,
0.08782936632633209,
0.3633900582790... | |
to a pipe before running `sudo -S true`. I was hoping that would make the password prompt immediately fail, but it still prompts and behaves strangely. I think it might want a terminal.
With newer versions of [`sudo`](http://www.sudo.ws/sudo/sudo.man.html) there's an option for this purpose:
```
sudo -n true
```
I u... | [
0.22934018075466156,
0.062354303896427155,
0.4619462490081787,
-0.13127771019935608,
0.06585446000099182,
-0.13450169563293457,
0.598908007144928,
0.038480084389448166,
0.31032586097717285,
-0.5716578364372253,
-0.05463828146457672,
0.7765296101570129,
-0.06927459686994553,
0.2148493975400... | |
I switched from Perl to Python about a year ago and haven't looked back. There is only *one* idiom that I've ever found I can do more easily in Perl than in Python:
```
if ($var =~ /foo(.+)/) {
# do something with $1
} elsif ($var =~ /bar(.+)/) {
# do something with $1
} elsif ($var =~ /baz(.+)/) {
# do somethin... | [
0.07829029858112335,
0.04892023652791977,
0.6074188351631165,
-0.5904763340950012,
-0.38877394795417786,
0.06771817803382874,
0.17083768546581268,
-0.12046793848276138,
-0.24660788476467133,
-0.287092000246048,
-0.03572617843747139,
0.7431471943855286,
-0.5089634656906128,
0.02438570372760... | |
# do something with m.group(1)
else:
m = re.search(r'baz(.+)', var)
if m:
# do something with m.group(2)
```
Does anyone have an elegant way to reproduce this pattern in Python? I've seen anonymous function dispatch tables used, but those seem kind of unwieldy to me for a small number of regular expre... | [
0.15752241015434265,
-0.027844976633787155,
0.3118813931941986,
-0.23872683942317963,
-0.057034771889448166,
-0.23149441182613373,
0.43509912490844727,
-0.35547277331352234,
-0.2240457832813263,
-0.23934146761894226,
-0.38543808460235596,
0.6654636859893799,
-0.6193799376487732,
-0.3970724... | |
within the body of the condition:
```
if match := re.search(r'foo(.+)', text):
# do something with match.group(1)
elif match := re.search(r'bar(.+)', text):
# do something with match.group(1)
elif match := re.search(r'baz(.+)', text)
# do something with match.group(1)
``` | [
-0.03536760434508324,
0.19724008440971375,
0.3798612654209137,
-0.5150889754295349,
0.028815459460020065,
-0.1959894597530365,
0.19745013117790222,
-0.736466109752655,
0.10862969607114792,
-0.3130579888820648,
-0.4630865156650543,
0.5521079301834106,
-0.6885238885879517,
-0.299213737249374... | |
I have a Java application that monitors a folder for incoming XML files. When a new file is detected I need to test the file that it is not currently being updated and is closed. My thought is to use [File.canWrite()](http://java.sun.com/j2se/1.5.0/docs/api/java/io/File.html#canWrite()) to test this. Is there any issue... | [
0.6213877201080322,
0.24812862277030945,
0.22900867462158203,
-0.12495915591716766,
0.031141085550189018,
-0.5935448408126831,
0.29071319103240967,
-0.00004526694101514295,
-0.22307799756526947,
-0.7389839887619019,
0.0037903254851698875,
0.5700428485870361,
-0.14191438257694244,
0.0537924... | |
all scenarios.
No, canWrite is not suitable for this purpose. In general the file will be writable even if another process is writing.
You need a higher level protocol to coordinate the locking. If you plan to use this code on a single platform, you may be able to use [NIO's FileLock facility](http://java.sun.com/j2se... | [
0.2596784234046936,
0.13902416825294495,
0.34683382511138916,
0.10729655623435974,
0.2729923725128174,
-0.5483372211456299,
0.06358141452074051,
-0.18921658396720886,
-0.2824752926826477,
-0.7090276479721069,
-0.4646804928779602,
0.46493732929229736,
-0.20761585235595703,
0.322343498468399... | |
the rename operation is atomic if the source and destination are the same file system volume. The name change might use a different file extension, or even moving the file from one directory to another (on the same volume).
Since in this case you are working exclusively with XML, looking for a close tag would work, bu... | [
-0.02343173138797283,
0.02483293041586876,
0.500891923904419,
0.09812437742948532,
0.16382361948490143,
-0.2271650731563568,
0.16424697637557983,
-0.051566269248723984,
-0.10400113463401794,
-0.7534809708595276,
-0.5405579805374146,
0.4504292607307434,
-0.15152427554130554,
0.3823056519031... | |
anything yet. If this weren't so, the easiest thing would be to allow the reader to start parsing as soon as the file showed up; it would simply block until the writer closed the file. But the file system doesn't work this way. Every file has an end, even if some process is currently moving it. | [
0.16004861891269684,
-0.09102335572242737,
0.3492356240749359,
0.40909281373023987,
0.08026307821273804,
-0.18071076273918152,
0.04513437673449516,
0.13590902090072632,
-0.2530483901500702,
-0.3590095043182373,
0.14806117117404938,
0.16355736553668976,
-0.020846717059612274,
0.199152454733... | |
How do I find the location of my `site-packages` directory?
There are two types of site-packages directories, *global* and *per user*.
1. **Global** site-packages ("[dist-packages](https://stackoverflow.com/questions/9387928/whats-the-difference-between-dist-packages-and-site-packages)") directories are listed in `sys... | [
0.019363973289728165,
0.06395094841718674,
0.4529154896736145,
-0.08555491268634796,
0.3275991380214691,
-0.17815788090229034,
0.2793145775794983,
-0.09780508279800415,
-0.09479498863220215,
-0.6807072162628174,
-0.3444827198982239,
0.42357221245765686,
-0.0809386670589447,
-0.156783536076... | |
installs your local packages:
```
python -m site --user-site
```
If this points to a non-existing directory check the exit status of Python and see `python -m site --help` for explanations.
*Hint:* Running `pip list --user` or `pip freeze --user` gives you a list of all installed *per user* site-packages.
---
Pr... | [
0.12699614465236664,
0.06672462075948715,
0.38923749327659607,
-0.09181475639343262,
0.33611351251602173,
-0.26980873942375183,
0.13209787011146545,
-0.433880478143692,
-0.28662392497062683,
-0.8633767366409302,
-0.5677314400672913,
0.5757523775100708,
-0.4026487171649933,
-0.2418743818998... | |
$ pip show pytest
Name: pytest
Version: 3.8.2
Summary: pytest: simple powerful testing with Python
Home-page: https://docs.pytest.org/en/latest/
Author: Holger Krekel, Bruno Oliveira, Ronny Pfannschmidt, Floris Bruynooghe, Brianna Laugher, Florian Bruhin and others
Author-email: None
License: MIT license
... | [
0.20136553049087524,
0.07613559067249298,
0.2876338064670563,
0.05836430937051773,
0.15043017268180847,
0.28219830989837646,
0.3478144705295563,
0.04574881121516228,
-0.22334079444408417,
-0.4445846676826477,
-0.4851263463497162,
-0.015441217459738255,
-0.29881542921066284,
-0.256044626235... | |
I hope this is programmer-related question. I'm in the hobby business of C# programming. For my own purposes I need to parse html files and the best idea is..regular expression. As many found out, it's quite time consuming to learn them and thus I'm quite interested if you know about some application that would be able... | [
0.6143142580986023,
0.039114512503147125,
0.08968869596719742,
0.44439640641212463,
-0.15059271454811096,
-0.035917848348617554,
0.08688594400882721,
0.32011884450912476,
-0.22595177590847015,
-0.4522687792778015,
-0.001989710610359907,
0.5144298672676086,
-0.13257013261318207,
-0.14424081... | |
itself, so it might not be as easy as I'd imagine.
Yes there is Roy Osherove wrote exactly what you're looking for - [regulazy](http://files.osherove.com/Regulazy/Regulazy.103.zip) | [
0.0813562199473381,
0.19267456233501434,
0.2516399025917053,
0.09453658759593964,
0.20764918625354767,
-0.055554285645484924,
0.08873327821493149,
0.30140239000320435,
-0.2142050415277481,
-0.5153955221176147,
-0.19082264602184296,
-0.1359831690788269,
-0.5611012578010559,
-0.0399104319512... | |
I used to often find myself coping a piece of code from a website/Word document etc only to discover that when doing Paste I would end up with the desired code plus some extra HTML tags/text, basically extra formatting information.
To get rid of that extra ballast I would paste the text to the Notepad and then copy it... | [
0.4081844389438629,
-0.1179066151380539,
0.3267851769924164,
-0.02738923579454422,
-0.23441752791404724,
0.3161117434501648,
0.3710240423679352,
0.1051090657711029,
-0.06399716436862946,
-0.637656033039093,
0.38915830850601196,
0.7119240164756775,
-0.3066982626914978,
-0.13149243593215942,... | |
do the Paste action without formatting; just pure text.
I find it very handy.
I was wondering what approach would you use yourselves? Are they any better/easier to use tools around?
**Just to summarize the available options:**
**Tools**
* [PureText](http://www.stevemiller.net/puretext/) - free tool for Windows
* Us... | [
0.12312314659357071,
0.20075057446956635,
0.6483603715896606,
-0.3864608108997345,
0.00272443238645792,
0.2948382496833801,
0.04610241949558258,
-0.07882783561944962,
-0.2980988919734955,
-0.39734238386154175,
-0.36222323775291443,
0.8278006911277771,
-0.5393731594085693,
-0.40486344695091... | |
to paste with the "current" format (*Edit* -> *Paste and Match Style*); or `⌘ Command`+`⇧ Shift`+`V` to paste without formatting (by [Kamafeather](https://stackoverflow.com/questions/122404/#comment81395440_122475))
* Paste to Notepad (or other text editor), and then copy from Notepad and paste again
* For single-line ... | [
-0.10964328795671463,
0.17006611824035645,
0.47587108612060547,
-0.017811236903071404,
-0.05881413444876671,
0.23065051436424255,
0.3273650109767914,
0.08802866190671921,
-0.25278961658477783,
-0.8184438347816467,
-0.5820705890655518,
0.5771222114562988,
-0.18954530358314514,
-0.1136873736... | |
I have a method that's about ten lines of code. I want to create more methods that do exactly the same thing, except for a small calculation that's going to change one line of code. This is a perfect application for passing in a function pointer to replace that one line, but Java doesn't have function pointers. What's ... | [
0.21063978970050812,
-0.03743254393339157,
0.09074614197015762,
0.23453034460544586,
-0.19816070795059204,
0.20611365139484406,
0.2474447637796402,
-0.3241063952445984,
-0.3803746998310089,
-0.513924241065979,
0.3075540363788605,
0.2183469533920288,
-0.37912818789482117,
0.0752827674150466... | |
one.
```
interface StringFunction {
int func(String param);
}
```
A method that takes the pointer would just accept `StringFunction` instance like so:
```
public void takingMethod(StringFunction sf) {
int i = sf.func("my string");
// do whatever ...
}
```
And would be called like so:
```
ref.takingMeth... | [
-0.13506650924682617,
-0.3601685166358948,
0.40827247500419617,
-0.23973824083805084,
-0.22576923668384552,
-0.16568422317504883,
-0.07452456653118134,
-0.40287771821022034,
-0.1334872990846634,
-0.4719587564468384,
-0.0695890560746193,
0.5046663880348206,
-0.6499508023262024,
-0.416562974... | |
Right now, we are using Perforce for version control. It has the handy feature of a strictly increasing change number that we can use to refer to builds, eg "you'll get the bugfix if your build is at least 44902".
I'd like to switch over to using a distributed system (probably git) to make it easier to branch and to w... | [
0.36198508739471436,
-0.22164946794509888,
0.4109441339969635,
-0.006945690605789423,
0.12596887350082397,
-0.13127659261226654,
0.28960442543029785,
0.0873434841632843,
-0.37431758642196655,
-0.6121100783348083,
-0.06694695353507996,
0.73216313123703,
-0.19354446232318878,
0.3855219185352... | |
all changes would need to feed into before a build was created.
What's the best way to preserve strictly increasing build ids? The most straightforward way I can think of is to have some sort of post-commit hook that fires off whenever the master repo gets updated, and it registers (the hash of) the new tree object (o... | [
0.510598361492157,
0.06138907000422478,
0.30398446321487427,
-0.08754603564739227,
0.02983679249882698,
-0.10459144413471222,
0.21018245816230774,
-0.26729825139045715,
-0.3650050759315491,
-0.6050307154655457,
0.0924038365483284,
0.6176388263702393,
-0.06829164177179337,
-0.00654724752530... | |
is workable, but I'm wondering if there is an easier, or already-implemented, or standard/"best practice" way of accomplishing this.
I second the suggestion of using `git describe`. Provided that you have a sane versioning policy, and you don't do any crazy stuff with your repository, `git describe` will always be mono... | [
0.08612959086894989,
0.023029750213027,
0.2132495641708374,
0.03610840067267418,
-0.002725921804085374,
-0.3515380322933197,
0.2573425769805908,
-0.21270930767059326,
-0.11056243628263474,
-0.7266761064529419,
-0.30720165371894836,
0.5397160649299622,
-0.39073896408081055,
0.07001825422048... | |
1.2.3-1-gaac161d
git commit --allow-empty -m'Commit Three.'
git describe # => 1.2.3-2-g462715d
git tag -a -m'Tag Two.' 2.0.0
git describe # => 2.0.0
```
The output of `git describe` consists of the following components:
1. The newest tag reachable from the commit you are asking to describe
2. The number of com... | [
0.09762018173933029,
0.18894097208976746,
0.2896040380001068,
-0.09416057169437408,
0.009474429301917553,
-0.13825975358486176,
0.19552291929721832,
-0.55311518907547,
0.22101713716983795,
-0.647614061832428,
-0.2371923178434372,
0.43418025970458984,
-0.4383355677127838,
0.4495344161987304... | |
Is there a generic way, without creating and managing your own CLR host, to take over locating and loading a type if that type is not found?
**The following is just an example. In your rush to be the first answer, don't suggest the new add-in framework or the MEF as a solution to my question.**
An example would be a ... | [
0.46236473321914673,
0.08148690313100815,
0.22240422666072845,
0.15954485535621643,
-0.07197603583335876,
0.03950142487883568,
0.062418874353170395,
0.007265452295541763,
-0.46532779932022095,
-0.4267463684082031,
0.0574001669883728,
0.27021336555480957,
-0.6534925103187561,
0.080335840582... | |
an event I can handle or a component I can provide my own implementation for that will allow me to gracefully handle these situations and provide additional logic for loading these assemblies.
---
As far as I can tell (unless somebody has an example that works) none of the so-far mentioned AppDomain events fire when ... | [
0.00020183926972094923,
0.143912672996521,
0.3928561508655548,
-0.008083269000053406,
-0.15057586133480072,
-0.2639021575450897,
0.5021575689315796,
-0.33869320154190063,
-0.32590124011039734,
-0.7038995623588562,
-0.19106347858905792,
0.6972063779830933,
-0.3522002696990967,
0.08324568718... | |
[.net runtime resolves assemblies](http://msdn.microsoft.com/en-us/library/yx7xezcf.aspx), so it's possible you could define this information in the probing section. | [
0.23143421113491058,
-0.1661585420370102,
0.1699666827917099,
-0.02766338177025318,
0.14438124001026154,
-0.3427431285381317,
0.3633943498134613,
-0.18522444367408752,
-0.3266630172729492,
-0.5578016638755798,
-0.05009907856583595,
-0.08811306208372116,
-0.09139075130224228,
0.180393621325... | |
I'm using a lat/long SRID in my PostGIS database (-4326). I would like to find the nearest points to a given point in an efficient manner. I tried doing an
```
ORDER BY ST_Distance(point, ST_GeomFromText(?,-4326))
```
which gives me ok results in the lower 48 states, but up in Alaska it gives me garbage. Is there... | [
0.1726093590259552,
0.33280763030052185,
0.6758637428283691,
0.15391656756401062,
-0.51430743932724,
-0.21311868727207184,
0.30476340651512146,
-0.0797136053442955,
-0.12011375278234482,
-0.41870564222335815,
0.1299184113740921,
-0.1205652728676796,
-0.2832344174385071,
0.07926338911056519... | |
to a geodesic or geodetic distance... while the two terms have slightly different meanings, they tend to be used interchangably.
Alternatively, you can project the data and use the standard st\_distance function... this is only practical over short distances (using UTM or state plane) or if all distances are relative ... | [
0.16709813475608826,
-0.12196522951126099,
0.664756178855896,
0.3202662765979767,
0.0755871832370758,
0.09395565092563629,
-0.17072001099586487,
-0.1256149560213089,
-0.03886858746409416,
-0.6382551789283752,
-0.33703455328941345,
0.27006301283836365,
0.0034330482594668865,
0.2526522576808... | |
Microsoft has chosen to not release a 64-bit version of Jet, their database driver for Access. Does anyone know of a good alternative?
Here are the specific features that Jet supports that I need:
* Multiple users can connect to database over a network.
* Users can use Windows Explorer to copy the database while it i... | [
0.13881579041481018,
0.24512197077274323,
0.17455145716667175,
0.49535563588142395,
-0.004779234062880278,
-0.2539336085319519,
0.1621510088443756,
0.2702532708644867,
-0.1777932494878769,
-0.6732158064842224,
0.21850484609603882,
0.5591384172439575,
-0.17657127976417542,
0.234910771250724... | |
over a network, it will become corrupted.
* Firebird: Copying a database that is in use can corrupt the original database.
* SQL Server: Files in use are locked and cannot be copied.
* VistaDB: This appears to be .Net specific.
* Compile in 32-bit and use WOW64: There is another dependency that requires us to compile i... | [
0.12709684669971466,
0.30226489901542664,
0.21702341735363007,
0.36042195558547974,
0.0034794651437550783,
-0.4363720118999481,
0.34405192732810974,
0.20859384536743164,
0.009835019707679749,
-0.5722776055335999,
-0.2679978013038635,
0.5215529799461365,
-0.43969419598579407,
0.258289843797... | |
Database Engine 2010 Redistributable](https://www.microsoft.com/en-us/download/details.aspx?id=13255) contains a 64-bit driver, which is able to access recent versions of the Microsoft Access database format. | [
-0.3748544156551361,
0.1435743123292923,
0.25499647855758667,
0.120259128510952,
-0.04128854721784592,
0.14428676664829254,
-0.05506840720772743,
0.0030540265142917633,
-0.09031197428703308,
-0.3668869733810425,
-0.19597259163856506,
0.349780797958374,
-0.38174310326576233,
0.0232612621039... | |
I need your help in determining the best approach for analyzing industry-specific sentences (i.e. movie reviews) for "positive" vs "negative". I've seen libraries such as OpenNLP before, but it's too low-level - it just gives me the basic sentence composition; what I need is a higher-level structure:
- hopefully with w... | [
0.49178850650787354,
0.1155804917216301,
-0.12456800043582916,
0.2564128339290619,
-0.29411330819129944,
-0.14035217463970184,
-0.07778234779834747,
-0.017116094008088112,
0.042728520929813385,
-0.49386852979660034,
-0.015435608103871346,
0.5129076242446899,
-0.13103148341178894,
0.0111582... | |
bit of pre-processing. At least tokenization, sentence boundary detection and part-of-speech tagging. Sometimes, syntactic parsing can be important. Doing it properly is an entire branch of research in computational linguistics, and I wouldn't advise you with coming up with your own solution unless you take your time t... | [
0.013516217470169067,
-0.23342610895633698,
0.15039180219173431,
0.1936158686876297,
-0.47334572672843933,
-0.10278148204088211,
0.3114083707332611,
-0.17152120172977448,
0.024414047598838806,
-0.6508558988571167,
-0.0043450347147881985,
0.4628995656967163,
0.0896247923374176,
-0.423308461... | |
trivial :-).
Googling for the term will probably also give you some resources to work with. If you have any more specific question, just ask, I'm watching the nlp-tag closely ;-) | [
0.3364465534687042,
-0.13137714564800262,
0.21881194412708282,
0.396786093711853,
-0.07285069674253464,
-0.16931113600730896,
0.015572043135762215,
0.2959577441215515,
-0.45337915420532227,
-0.5258909463882446,
-0.18289095163345337,
0.5583235025405884,
-0.2721063792705536,
-0.1278578191995... | |
I need to consume an external web service from my VB6 program. I want to be able to deploy my program without the SOAP toolkit, if possible, but that's not a requirement. I do not have the web service source and I didn't create it. It is a vendor-provided service.
So outside of the SOAP toolkit, what is the best way t... | [
0.5938429236412048,
0.13065382838249207,
0.4514863193035126,
-0.0009905491024255753,
-0.2061329483985901,
0.06163240969181061,
0.10350573807954788,
-0.17485904693603516,
-0.11297941952943802,
-0.6683341264724731,
-0.009204834699630737,
0.909469485282898,
-0.23317143321037292,
0.55745774507... | |
req.Open "GET", url, False
req.send ""
Dim resp As DOMDocument
If req.responseText <> vbNullString Then
Set resp = New DOMDocument60
resp.loadXML req.responseText
Else
Set resp = req.responseXML
End If
Set HttpGetRequest = resp
End Function
``` | [
-0.08205147832632065,
-0.4953629672527313,
1.2874131202697754,
-0.2376789003610611,
-0.13047361373901367,
0.14377546310424805,
0.4944241940975189,
-0.6635814309120178,
-0.18456529080867767,
-0.5152156949043274,
-0.5913219451904297,
0.732704758644104,
-0.37594470381736755,
0.270957767963409... | |
I'm looking for a simple, easy to understand algorithm to alphabetically sort an array of characters in C.
characters in C have numeric values that happen to be in order, so you just treat your characters like integers. the C standard library includes a 'qsort' function. Use that (`man qsort` on a linux-like system). Y... | [
-0.17869308590888977,
0.051652248948812485,
-0.058408480137586594,
0.0851842388510704,
0.030394595116376877,
0.247152641415596,
-0.159269779920578,
0.24554882943630219,
-0.1956193894147873,
-0.6713340282440186,
-0.04268374294042587,
0.27207741141319275,
-0.3625381290912628,
-0.303673356771... | |
I've been too lax with performing DB backups on our internal servers.
Is there a simple command line program that I can use to backup certain databases in SQL Server 2005? Or is there a simple VBScript?
To backup a single database from the command line, use [osql](https://msdn.microsoft.com/en-us/library/ms162806.asp... | [
0.04497234523296356,
0.3389068841934204,
0.318827360868454,
0.025589995086193085,
0.006690433714538813,
-0.36423540115356445,
0.3852609694004059,
-0.06674788892269135,
-0.33860093355178833,
-0.19792142510414124,
-0.11246003955602646,
0.8320165276527405,
-0.11858461052179337,
0.175595372915... | |
Is there a Java package providing funcionality like the .Net System.Data namespace ?
Specificaly the DataSet and Adaptor classes ?
Use [java.util](http://java.sun.com/javase/6/docs/api/java/util/package-summary.html) for the collections.
[java.sql](http://java.sun.com/javase/6/docs/api/java/sql/package-summary.html) fo... | [
0.09024526923894882,
-0.22945334017276764,
-0.1384950876235962,
0.2721695005893707,
-0.006913408171385527,
-0.18257349729537964,
-0.33610913157463074,
-0.2471231371164322,
-0.3558400571346283,
-0.44294390082359314,
-0.270797997713089,
0.4021446108818054,
-0.267961323261261,
-0.227482363581... | |
I have a stored procedure that consists of a single select query used to insert into another table based on some minor math that is done to the arguments in the procedure. Can I generate the plan used for this query by referencing the procedure somehow, or do I have to copy and paste the query and create bind variables... | [
0.29051917791366577,
0.10023531317710876,
0.38036635518074036,
-0.020504124462604523,
0.17917396128177643,
-0.1465332955121994,
0.08825948089361191,
-0.3961789011955261,
-0.11890938133001328,
-0.456600546836853,
0.09221620112657547,
0.2469673603773117,
-0.30152010917663574,
0.2358908653259... | |
dual;
exec your_stored_procedure
alter session set sql_trace = false;
```
Once this has been done, go look in your database's UDUMP directory for a TRC file with "something-unique" in the filename. Format this TRC file with TKPROF, and then open the formatted file and search for the string "right-before-my-sp". The ... | [
0.4351688325405121,
0.024985671043395996,
0.4851320683956146,
0.1318114548921585,
0.022897103801369667,
-0.22778208553791046,
0.320947527885437,
-0.20991674065589905,
-0.4410911798477173,
-0.3525368869304657,
-0.07054697722196579,
0.743665874004364,
-0.12599621713161469,
0.0446731708943843... | |
this. | [
0.01728815957903862,
0.051505666226148605,
0.2631857097148895,
0.1054578498005867,
-0.01595044694840908,
-0.26586660742759705,
-0.0410122387111187,
-0.06551028788089752,
0.10840009897947311,
-0.6747032403945923,
-0.016516197472810745,
-0.007442464120686054,
-0.2810177206993103,
0.302722573... | |
I've seen [Best tools for working with DocBook XML documents](https://stackoverflow.com/questions/55622/best-tools-for-working-with-docbook-xml-documents), but my question is slightly different. Which is the currently recommended formatting toolchain - as opposed to editing tool - for XML DocBook?
In Eric Raymond's ['... | [
-0.13994799554347992,
0.14450322091579437,
0.5085752010345459,
-0.03439577668905258,
-0.07222524285316467,
-0.40382373332977295,
-0.26598864793777466,
-0.07658399641513824,
-0.29558423161506653,
-0.4673895537853241,
-0.23405663669109344,
0.7425068020820618,
-0.12082134187221527,
-0.2754279... | |
best way to go? Are there any alternatives?
I've been doing some manual writing with DocBook, under cygwin, to produce One Page HTML, Many Pages HTML, CHM and PDF.
I installed the following:
1. The [docbook](http://www.docbook.org) stylesheets (xsl) repository.
2. xmllint, to test if the xml is correct.
3. xsltproc, ... | [
0.18445520102977753,
-0.04908863082528114,
0.8183804154396057,
0.311804860830307,
0.11327885836362839,
-0.4037463963031769,
0.09974817931652069,
-0.24491815268993378,
-0.04537123069167137,
-0.6386135220527649,
-0.08886060863733292,
0.5087707042694092,
0.09357841312885284,
-0.34333467483520... | |
cleaned up version of the scripts and the folder structure, please contact me: guscarreno (squiggly/at) googlemail (period/dot) com
I then use a configure.in:
```
AC_INIT(Makefile.in)
FOP=fop.sh
HHC=hhc
XSLTPROC=xsltproc
AC_ARG_WITH(fop, [ --with-fop Where to find Apache FOP],
[
if test "x$withval" != "xno";... | [
-0.019261658191680908,
0.03210422769188881,
0.538693904876709,
0.27575328946113586,
0.21197855472564697,
-0.10990209132432938,
0.6118977665901184,
-0.32562118768692017,
-0.14435704052448273,
-0.612011730670929,
-0.3364487588405609,
0.729674220085144,
-0.3297298550605774,
-0.125374078750610... | |
test "x$withval" != "xno"; then
XSLTPROC="$withval"
fi
]
)
AC_PATH_PROG(XSLTPROC, $XSLTPROC)
AC_SUBST(FOP)
AC_SUBST(HHC)
AC_SUBST(XSLTPROC)
HERE=`pwd`
AC_SUBST(HERE)
AC_OUTPUT(Makefile)
cat > config.nice <<EOT
#!/bin/sh
./configure \
--with-fop='$FOP' \
--with-hhc='$HHC' \
--with-xsltproc='$... | [
0.306009978055954,
0.10693283379077911,
0.3757810592651367,
0.08858934044837952,
0.23262618482112885,
-0.10459966957569122,
0.5469543933868408,
-0.8732556104660034,
0.22816398739814758,
-0.6475948691368103,
-0.17316597700119019,
0.5554328560829163,
-0.2321513593196869,
-0.08692953735589981... | |
.ent
@if [ ! -f entities.ent ] || [ ! cmp entities.ent .ent ]; then mv .ent entities.ent ; fi
@echo -e "Done.\n"
# Build the docs in chm format
chm: chm/htmlhelp.hpp
@echo -e "\n=== Creating CHM\n"
@echo logo.png >> chm/htmlhelp.hhp
@echo arrow.gif >> chm/htmlhelp.hhp
@-cd chm && "$(HHC)" htmlhelp.hhp
@echo -e "Do... | [
0.2884589433670044,
0.3306196630001068,
0.7402267456054688,
-0.08655893802642822,
-0.18041115999221802,
-0.08871804177761078,
0.2696557939052582,
-0.8977206945419312,
-0.104833222925663,
-0.4968150854110718,
-0.36162805557250977,
0.5969781875610352,
-0.4199533462524414,
-0.2831223309040069... | |
entities.ent build/docbook-xsl manual.xml build/pdf.xsl
@echo -e "\n=== Creating input for PDF\n"
@"$(XSLTPROC)" --output ./pdf/manual.fo ./build/pdf.xsl manual.xml
check: manual.xml
@echo -e "\n=== Checking correctness of manual\n"
@xmllint --valid --noout --postvalid manual.xml
@echo -e "Done.\n"
# need to touch th... | [
0.1302395761013031,
0.12476573139429092,
0.4716470241546631,
0.326993465423584,
0.009950281120836735,
-0.3513098657131195,
0.3348630964756012,
-0.4840888977050781,
-0.016140010207891464,
-0.5895830392837524,
-0.033766232430934906,
0.8494296073913574,
-0.20321783423423767,
0.093758203089237... | |
I have a dict, that looks like this:
```
{
'foo': {
'opt1': 1,
'opt2': 2,
},
'foo/bar': {
'opt3': 3,
'opt4': 4,
},
'foo/bar/baz': {
'opt5': 5,
'opt6': 6, | [
0.0952371209859848,
-0.008250238373875618,
0.3952069878578186,
-0.3042907416820526,
0.06304489821195602,
0.468473345041275,
-0.15075796842575073,
0.15020598471164703,
0.3135145306587219,
-0.6158503293991089,
-0.05555597320199013,
0.7422878742218018,
-0.4556984603404999,
-0.2834184467792511... | |
}
}
```
And I need to get it to look like:
```
{
'foo': {
'opt1': 1,
'opt2': 2,
'bar': {
'opt3': 3,
'opt4': 4,
'baz': {
'opt5': | [
0.3243579566478729,
0.058243654668331146,
0.5633424520492554,
-0.464280903339386,
0.33759960532188416,
0.5594585537910461,
-0.07152168452739716,
0.0990426316857338,
0.03348235413432121,
-0.5658458471298218,
-0.18228614330291748,
0.8737471699714661,
-0.4691503643989563,
-0.21357539296150208... | |
5,
'opt6': 6,
}
}
}
}
```
I should point out that there can and will be multiple top-level keys ('foo' in this case). I could probably throw something together to get what i need, but I was hoping that there is a solution that's more efficient.
Like this:
```
d... | [
0.21164795756340027,
0.04499100148677826,
0.22220824658870697,
-0.3084520101547241,
0.2739112377166748,
0.05784071236848831,
0.04345531016588211,
-0.20133474469184875,
-0.20880812406539917,
-0.5271398425102234,
-0.251643568277359,
0.6209977269172668,
-0.5041887164115906,
-0.028379900380969... | |
rv = {}
for key, value in d.iteritems():
node = rv
for part in key.split('/'):
node = node.setdefault(part, {})
node.update(value)
return rv
``` | [
-0.12477658689022064,
-0.21583285927772522,
0.5518320798873901,
-0.1575329750776291,
-0.12320232391357422,
0.270089328289032,
0.3357070982456207,
-0.7178239822387695,
-0.01349471416324377,
-0.23542487621307373,
-0.16918998956680298,
0.6292934417724609,
-0.022341178730130196,
0.308788031339... | |
I have a page in my desktop app, and I've implemented simple grab-and-pan. It works great.
When you are panning in this way and you are release, the page stops dead where you dropped it.
I'd like it to continue slightly with some momentum, and stop eventually. Rather like the 'throw' in the iPhone UI, I guess.
I'm n... | [
0.7629557847976685,
0.13861630856990814,
0.06848529726266861,
0.08486784994602203,
-0.13111412525177002,
0.0261750016361475,
0.0051236506551504135,
0.07066214829683304,
-0.3082657754421234,
-0.291760116815567,
0.04318948835134506,
0.30347487330436707,
-0.07893144339323044,
0.23494504392147... | |
from a windows GUI app). My second assumption is the C language.
*To my knowledge, you cannot direct printf output to the output window in dev studio, not directly anyway.* [emphasis added by OP]
There might be a way but I'm not aware of it. One thing that you could do though would be to direct printf function calls ... | [
0.5718935132026672,
-0.08160491287708282,
0.2924402058124542,
-0.06743354350328445,
-0.1368134319782257,
-0.14783260226249695,
0.36442050337791443,
-0.13568666577339172,
0.07510068267583847,
-0.7822803258895874,
-0.04292567819356918,
1.0035005807876587,
-0.5967065095901489,
-0.154171362519... | |
and the OuputDebugString()
```
void my_printf(const char *format, ...)
{
char buf[2048];
// get the arg list and format it into a string
va_start(arglist, format);
vsprintf_s(buf, 2048, format, arglist);
va_end(arglist);
vprintf_s(buf); // prints to the standard output stream
... | [
0.07045100629329681,
0.0886540561914444,
0.7679131031036377,
-0.393753319978714,
0.09484865516424179,
0.15537738800048828,
0.19487616419792175,
-0.5741513967514038,
-0.3024936318397522,
-0.5869336724281311,
-0.41076743602752686,
0.6873089075088501,
-0.5085541009902954,
0.09504660964012146,... | |
won't work for you. :-) | [
0.7439960837364197,
0.1141885295510292,
0.33735522627830505,
0.1310434192419052,
0.4589637219905853,
0.17468026280403137,
0.19031310081481934,
0.06892726570367813,
0.17740435898303986,
-0.2243010401725769,
-0.1397171914577484,
0.6544147729873657,
-0.30900102853775024,
0.0339595265686512,
... | |
I've got a Sharepoint WebPart which loads a custom User Control. The user control contains a Repeater which in turn contains several LinkButtons.
In the RenderContent call in the Webpart I've got some code to add event handlers:
```
ArrayList nextPages = new ArrayList();
//populate nextPages ....
... | [
0.11211252957582474,
0.017079900950193405,
0.7388730645179749,
-0.0963706225156784,
0.14197222888469696,
0.26205435395240784,
0.26315879821777344,
-0.30886685848236084,
-0.14248977601528168,
-0.7234610915184021,
0.033619899302721024,
0.5343032479286194,
-0.26863589882850647,
0.221315041184... | |
if (oRepeaterControl is RepeaterItem)
{
if (oRepeaterControl.HasControls())
{
foreach (Control oControl in oRepeaterControl.Controls) | [
-0.21549268066883087,
0.15290100872516632,
0.2773522138595581,
-0.0009678767528384924,
0.6822087168693542,
-0.053808484226465225,
-0.12094704806804657,
-0.2664985954761505,
0.12210169434547424,
-0.5151803493499756,
-0.25838372111320496,
0.3631463646888733,
-0.2756139934062958,
0.1280325800... | |
{
if (oControl is LinkButton)
{
((LinkButton)oControl).Click += new EventHandler(PageNavigateButton_Click); | [
-0.300366073846817,
-0.42436808347702026,
0.6414147615432739,
-0.22956737875938416,
0.3407500982284546,
-0.17453116178512573,
0.17636525630950928,
-0.06009351834654808,
-0.2522639334201813,
-0.6805967688560486,
-0.5651614665985107,
0.5173805356025696,
-0.4637610912322998,
0.106908082962036... | |
}
}
}
}
}
```
The function PageNavigateButton\_Click is never called however. I can see it being added as an event handler in the debugger however.
Any ideas? I'm stumped how to do this.
By the time RenderContent() is called, all the registered event | [
0.06183958798646927,
-0.030401309952139854,
0.5934596657752991,
-0.37996333837509155,
0.08152813464403152,
-0.23342952132225037,
0.39189255237579346,
0.46808308362960815,
-0.2217041403055191,
-0.9461770057678223,
-0.30576348304748535,
0.6601536273956299,
-0.21865884959697723,
0.32325416803... | |
handlers have been called by the framework. You need to add the event handlers in an earlier method, like OnLoad():
```
protected override void OnLoad(EventArge e)
{ base.OnLoad(e);
EnsureChildControls();
var linkButtons = from c in AfterPageRepeater.Controls
.Of... | [
0.2456052303314209,
-0.5229101181030273,
0.15869416296482086,
-0.034325581043958664,
0.2650807201862335,
0.01934708096086979,
0.261687695980072,
-0.2718111276626587,
-0.3576885759830475,
-0.3807928264141083,
-0.16902698576450348,
0.5100341439247131,
-0.6084268093109131,
0.2898009419441223,... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.