text stringlengths 0 30.5k | title stringclasses 1
value | embeddings listlengths 768 768 |
|---|---|---|
of chars, however - you may want to special-case strings to be individual elements instead of flattening them, depending on your use case.
Does that help? | [
0.10165312886238098,
-0.170236736536026,
-0.09846417605876923,
0.04370710253715515,
-0.1672123521566391,
0.21099047362804413,
0.15561363101005554,
0.14380040764808655,
-0.2605782747268677,
-0.23993900418281555,
-0.18864567577838898,
0.2742401361465454,
-0.13305819034576416,
-0.021983455866... | |
I work on a small web team where I am the only .NET developer currently using Visual Studio 2008 Professional to build and maintain a few web applications. I am about to start training another member of our team so we purchased him a copy of Visual Studio 2008 Professional. I've looked into Visual Source Safe, but I'm ... | [
0.5160390734672546,
0.469002366065979,
-0.006370102986693382,
0.17573674023151398,
0.2181205004453659,
-0.2761562466621399,
-0.01649545505642891,
0.06772879511117935,
0.020236290991306305,
-0.4917617440223694,
0.23937161266803741,
0.6379819512367249,
0.026778671890497208,
0.023964541032910... | |
options for a source control system?
(Forgive me if the answer exists in another thread.)
[Subversion](http://subversion.tigris.org/) has good integration with Visual Studio 2008 through [VisualSVN](http://www.visualsvn.com/) and [Ankh](http://ankhsvn.open.collab.net/).
SourceSafe is dangerous. You're right that a f... | [
0.041487861424684525,
-0.35392996668815613,
-0.013857260346412659,
0.3166998624801636,
-0.12406252324581146,
-0.3174438774585724,
0.20666839182376862,
0.09944777935743332,
-0.3282650411128998,
-0.578696072101593,
-0.06964565068483353,
0.5838056802749634,
-0.250621497631073,
-0.103874310851... | |
When do you think we can expect the full release version of ASP.NET MVC?
***EDIT (16/Jul/2009)***
Updating to ensure this page contains the most recent details.
ASP.NET MVC is now fully released ***<http://www.asp.net/mvc/>***.
---
***EDIT (28/Jan/2009)***
ASP.NET MVC 1.0 RC Now Available.... final next month ([Fr... | [
0.3021467924118042,
-0.15945802628993988,
0.8018242716789246,
-0.18273970484733582,
-0.29382047057151794,
-0.15340764820575714,
0.26231399178504944,
-0.050159793347120285,
-0.5804612040519714,
-0.30599749088287354,
-0.10559799522161484,
0.6334214806556702,
-0.026460548862814903,
-0.0299870... | |
confusion around
> MVC as a few people expected ASP.NET
> MVC to ship in SP1. This is probably
> because MVC was included in 3.5
> "Extensions Preview." However, the
> plan was always to ship in Q4CY08.
>
>
> *(That date is marketing speak, I've
> just learned. I tell people what Eilon
> told me - it'll ship i... | [
-0.029901579022407532,
-0.30900368094444275,
1.3247766494750977,
-0.008991871029138565,
-0.0997997298836708,
-0.3018018305301666,
0.18836510181427002,
0.3385344445705414,
-0.6725197434425354,
-0.5901703238487244,
-0.1394505798816681,
0.15609093010425568,
-0.15142501890659332,
0.27402660250... | |
Duke
> Nukem Forever ships. | [
0.10306832194328308,
0.12795482575893402,
0.2563316524028778,
0.366006076335907,
-0.08274142444133759,
-0.09643159061670303,
-0.20116396248340607,
0.3295339345932007,
-0.3102945387363434,
-0.36786380410194397,
-0.06110663712024689,
0.5022888779640198,
-0.004914405290037394,
0.4762318730354... | |
I can select all the distinct values in a column in the following ways:
* `SELECT DISTINCT column_name FROM table_name;`
* `SELECT column_name FROM table_name GROUP BY column_name;`
But how do I get the row count from that query? Is a subquery required?
You can use the `DISTINCT` keyword within the [`COUNT`](http://t... | [
-0.1900877058506012,
0.4133317172527313,
0.4482267498970032,
-0.055685676634311676,
-0.19481517374515533,
0.23783646523952484,
0.034901730716228485,
-0.2710353136062622,
0.07872413098812103,
-0.3999154269695282,
0.17862308025360107,
0.35396304726600647,
-0.12389812618494034,
0.354929417371... | |
What I would like is be able to generate a simple report that is the output of svn log for a certain date range. Specifically, all the changes since 'yesterday'.
Is there an easy way to accomplish this in Subversion besides grep-ing the svn log output for the timestamp?
Example:
```
svn -v log -d 2008-9-23:2008-9:2... | [
0.08989701420068741,
-0.22252348065376282,
0.8343960046768188,
0.007365317549556494,
-0.372738242149353,
-0.17594873905181885,
0.1903025060892105,
-0.15228375792503357,
-0.4605615437030792,
-0.45632174611091614,
-0.12267488986253738,
0.5597820281982422,
0.06793584674596786,
0.2268317490816... | |
Say that I write an article or document about a certain topic, but the content is meant for readers with certain prior knowledge about the topic. To help people who don't have the "required" background information, I would like to add a note to the top of the page with an explanation and possibly a link to some referen... | [
0.8971815705299377,
0.544014573097229,
0.05395292490720749,
0.1300778090953827,
-0.06778623908758163,
-0.6159014701843262,
0.21011042594909668,
0.7122614979743958,
-0.07516765594482422,
-0.4009978473186493,
-0.11571506410837173,
0.3331716060638428,
0.03771163895726204,
0.27373597025871277,... | |
please see the official web site.*
>
>
>
> The Best Product in the World ...
Now, I don't want the note to show up in Google search engine results, only the title and the content that follows the note. Is there any way I can achieve this?
Also, is it possible to do this without direct control over the entire HTML... | [
0.4847232401371002,
0.12069949507713318,
0.5320420861244202,
0.005266398657113314,
-0.013136022724211216,
-0.5225374102592468,
0.4387209713459015,
0.24939705431461334,
0.1270701289176941,
-0.8188528418540955,
-0.25682708621025085,
0.251309335231781,
-0.06899607926607132,
0.0472076646983623... | |
they don't provide access to edit the HTML meta tags directly.
You can build that portion of the content dynamically using Javascript.
For example:
```
<html>
<body>
<div id="dynContent">
</div>
Rest of the content here.
</body>
<script language='javascript' type='text/javascript'>
var dyn = document.getEle... | [
0.43844106793403625,
0.008138800971210003,
0.43748003244400024,
0.13110941648483276,
-0.1787954568862915,
-0.27517080307006836,
0.21460244059562683,
0.05131002888083458,
-0.3984113931655884,
-0.683176577091217,
-0.047436270862817764,
0.6204060316085815,
-0.2155953347682953,
0.0277613084763... | |
I'm working on database designs for a project management system as personal project and I've hit a snag.
I want to implement a ticket system and I want the tickets to look like the [tickets in Trac](http://trac.edgewall.org/ticket/6436). What structure would I use to replicate this system? (I have not had any success ... | [
0.39632123708724976,
-0.2193899303674698,
0.26889634132385254,
0.5239766240119934,
0.07953859865665436,
-0.27029868960380554,
0.05661711469292641,
0.1374112367630005,
-0.19243362545967102,
-0.9296826720237732,
0.5382813811302185,
0.12471373379230499,
-0.3030239939689636,
0.3918370306491852... | |
feature like this using a serialized array in a text field. I do not want to implement that as a solution ever again.
**Edit: I'm looking only for database structures. Triggers/Callbacks are not really a problem.**
I have implemented pure record change data using a "thin" design:
```
RecordID Table Column OldValu... | [
-0.03998050093650818,
-0.010686131194233894,
0.5246912837028503,
-0.0747358575463295,
0.10086698085069656,
-0.20498152077198029,
0.04343521222472191,
0.020399855449795723,
-0.4138837456703186,
-0.9113104343414307,
0.16091491281986237,
0.6821329593658447,
-0.31833526492118835,
0.00551784830... | |
"Table" and "Column" columns can speed up queries and filters. But if you are going to be viewing the change log online frequently at a Table or object level, you may want to design something flatter.
**EDIT**: several people have rightly pointed out that with this solution you could not pull together a change set. I ... | [
-0.058301497250795364,
-0.0014336361782625318,
0.7770665287971497,
-0.0012721166713163257,
0.1443677842617035,
-0.2663396894931793,
-0.08393917232751846,
-0.23321568965911865,
-0.4526015520095825,
-0.8951833844184875,
0.0576070100069046,
0.533859372138977,
-0.2767869234085083,
0.2258037030... | |
TransactionID
-------- ----- ------ -------- -------- -------------
TRANSACTION LOG TABLE:
TransactionID UserID TransactionDate
------------- ------ ---------------
``` | [
-0.7532631754875183,
0.02605188824236393,
0.5113722681999207,
0.14177078008651733,
0.08798301219940186,
-0.2888454496860504,
0.017351584509015083,
0.047934990376234055,
-0.36911237239837646,
-0.9286166429519653,
-0.28981807827949524,
0.4773709774017334,
-0.23341546952724457,
0.197827979922... | |
i am working on a simple web app which has a user model and role model (among others), and an admin section that contains many controllers. i would like to use a before\_filter to check that the user of the user in the session has a 'can\_access\_admin' flag.
i have this code in the application.rb:
def check\_role
@... | [
0.1597680300474167,
0.2875536382198334,
0.4887416362762451,
-0.09598255157470703,
0.21448469161987305,
-0.1482962965965271,
0.2425912320613861,
-0.2500132620334625,
0.07035400718450546,
-1.0489031076431274,
-0.07053334265947342,
0.5336678624153137,
-0.20434018969535828,
0.2995844781398773,... | |
try to view the list action i get this error:
undefined method 'role' for user...
anyone know what i have to do to get the role association to be recognized in the application.rb? (note that the associations are configured correctly and the @user.role is working fine everywhere else i've tried to use it)
just a guess... | [
0.32819947600364685,
-0.06795595586299896,
0.33458638191223145,
-0.11561988294124603,
-0.213463693857193,
0.027171719819307327,
0.2942020297050476,
-0.5181333422660828,
-0.25495439767837524,
-0.5546457171440125,
0.4267159700393677,
0.6928495764732361,
-0.40104740858078003,
0.04470106214284... | |
Is there any way to view the activity log for the integrate SourceSafe inside Visual Studio 2005 Pro? I'd like to be able to quickly see the results of any Get Latest Version, Check In and Checkout actions, and I can't find a way to get that information without having to open the VSS client.
The output window (View - O... | [
0.34566086530685425,
-0.08671849220991135,
0.29509103298187256,
0.03733803331851959,
-0.3629630208015442,
-0.22485525906085968,
0.19546949863433838,
0.1265437752008438,
-0.15835145115852356,
-0.5048591494560242,
0.2931884825229645,
0.7847374081611633,
-0.08375705778598785,
0.01184099446982... | |
I'm trying to test if a given default constraint exists. I don't want to use the sysobjects table, but the more standard INFORMATION\_SCHEMA.
I've used this to check for tables and primary key constraints before, but I don't see default constraints anywhere.
Are they not there? (I'm using MS SQL Server 2000).
EDIT: ... | [
-0.12204920500516891,
-0.10175222158432007,
0.020875273272395134,
0.06392175704240799,
0.13645608723163605,
-0.057814884930849075,
-0.0037446243222802877,
0.07099573314189911,
-0.36992835998535156,
-0.7142436504364014,
-0.1326214075088501,
0.6692973375320435,
-0.4722561240196228,
-0.051327... | |
should use the object catalog views (sys.\*) instead of system table views, which are deprecated in SQL Server 2005 and later.
Below is pretty much the same as @user186476's answer. It returns the name of the default value constraint for a given column. (For non-SQL Server users, you need the name of the default in or... | [
-0.14775463938713074,
0.0023112534545361996,
0.4377296566963196,
0.00242958078160882,
-0.046740930527448654,
-0.10676969587802887,
0.2426682859659195,
0.026103727519512177,
-0.2607041001319885,
-0.45636871457099915,
-0.06377420574426651,
0.5086264610290527,
-0.4910842776298523,
0.021285843... | |
default_constraints.name
FROM
sys.all_columns
INNER JOIN
sys.tables
ON all_columns.object_id = tables.object_id
INNER JOIN
sys.schemas
ON tables.schema_id = schemas.schema_id
INNER JOIN
sys.default_constraints
ON all_columns.default_object_id = defaul... | [
-0.37466222047805786,
0.28097400069236755,
0.11110569536685944,
-0.2050536721944809,
0.012364148162305355,
0.31455132365226746,
0.047423895448446274,
-0.458930641412735,
-0.3972502648830414,
-0.6415804624557495,
-0.4931076467037201,
0.12620161473751068,
-0.5437039732933044,
0.0919611304998... | |
AND all_columns.name = 'columnname'
``` | [
-0.1918591558933258,
0.7693029046058655,
0.4009428322315216,
-0.21446029841899872,
0.1023620069026947,
-0.2542187571525574,
-0.08744027465581894,
0.153652161359787,
-0.29351451992988586,
-0.4110938608646393,
-0.27663367986679077,
0.27821359038352966,
-0.4845523238182068,
0.1481149494647979... | |
I have a multi-user ASP.NET app running against SQL Server and want to have StoredProcA create a #temptable temp table - not a table variable - to insert some data, then branch to StoredProcB, StoredProcC, and StoredProcD to manipulate the data in #temptable per business rules.
The web app uses connection pooling whe... | [
0.35515904426574707,
0.0035161415580660105,
0.34288233518600464,
0.11740922927856445,
0.2020534723997116,
-0.0019481094786897302,
-0.09858938306570053,
-0.1551344096660614,
-0.4153972566127777,
-0.2973267138004303,
0.02481698989868164,
0.4503413736820221,
-0.307153582572937,
0.193670794367... | |
[drops any temporary tables](https://stackoverflow.com/questions/596365/what-does-sp-reset-connection-do) that the connection owns. | [
-0.1417773962020874,
0.0530780628323555,
0.8268908262252808,
0.05902102217078209,
0.42358049750328064,
-0.22408664226531982,
-0.06848494708538055,
0.0839521586894989,
-1.0636265277862549,
-0.040146343410015106,
-0.13186244666576385,
0.16870523989200592,
-0.07872296124696732,
0.110026612877... | |
I inherited an application where display:none was used to control conditional display of input elements based the values of other input elements.
The way this was handled is by running some pretty ugly code to evaluate field values and reset the display property in the during page load. Every time.
Isn't there a bett... | [
0.220929354429245,
0.1318880170583725,
0.09276668727397919,
-0.1133338212966919,
-0.2255469411611557,
-0.25286924839019775,
0.08894610404968262,
-0.25788986682891846,
-0.35882967710494995,
-0.4700532555580139,
0.04316980764269829,
0.5786908268928528,
-0.3138466775417328,
0.1935205757617950... | |
The problem/comic in question: <http://xkcd.com/287/>
I'm not sure this is the best way to do it, but here's what I've come up with so far. I'm using CFML, but it should be readable by anyone.
```
<cffunction name="testCombo" return... | [
-0.16380468010902405,
-0.07172205299139023,
0.7218359112739563,
0.20795854926109314,
0.0003022315795533359,
0.036567602306604385,
0.07740429043769836,
-0.4402158558368683,
-0.22842185199260712,
-0.4846212565898895,
-0.23090527951717377,
0.7826982736587524,
-0.5059185028076172,
-0.497013688... | |
= listAppend(arguments.currentCombo, arguments.apps[a].name) />
<cfset arguments.currentTotal = arguments.currentTotal + arguments.apps[a].cost />
<cfif arguments.currentTotal eq 15.05>
<!--- print current combo --->
<cfoutput><strong>#arguments.currentCombo# = 15.05</strong></cf... | [
-0.20310527086257935,
-0.13926368951797485,
0.975848376750946,
-0.3788895308971405,
0.10177674889564514,
0.3608790338039398,
0.3262409567832947,
-0.6059291958808899,
-0.43403154611587524,
-0.402397483587265,
-0.5216146111488342,
0.6986164450645447,
-0.523947536945343,
-0.07996688038110733,... | |
/>
<cfreturn false />
<cfelse>
<!--- less than 15.05 --->
<cfoutput>#arguments.currentCombo# < 15.05 (traversing)</cfoutput><br />
<cfset found = testCombo(arguments.currentCombo, arguments.currentTotal, arguments.apps) />
</cfif>
</cfloop>
</cffunctio... | [
0.15711617469787598,
0.1898384392261505,
0.3131796717643738,
-0.0539294071495533,
-0.02922876365482807,
0.582252562046051,
0.04952903836965561,
-0.09225738793611526,
-0.43416112661361694,
-0.536862850189209,
-0.24778282642364502,
0.3549322485923767,
0.04574089124798775,
-0.1438631862401962... | |
salad", cost=3.35} />
<cfset hw = {name="hot wings", cost=3.55} />
<cfset ms = {name="moz sticks", cost=4.20} />
<cfset sp = {name="sampler plate", cost=5.80} />
<cfset apps = [ mf, ff, ss, hw, ms, sp ] />
<cfloop from="1" to="6" index="b">
<cfoutput>#testCombo(apps[b].name, apps[b].cost, apps)#</cfoutput>
</cfloo... | [
0.10977987200021744,
-0.014591509476304054,
0.2448568493127823,
-0.10772672295570374,
0.03798353672027588,
0.8833651542663574,
0.2389003187417984,
-0.09407898783683777,
-0.5602473020553589,
-0.634442925453186,
0.19098670780658722,
0.3835299611091614,
0.04947572201490402,
-0.409298539161682... | |
small data set, but that the amount of work to solve it grows at a rate greater than polynomial, i.e. there is no O(n^x) algorithm.
If the time complexity is O(n!), as in (I believe) the two problems mentioned above, that is in NP. | [
-0.5821312069892883,
0.007143810391426086,
0.13223211467266083,
0.09630797058343887,
0.2263249009847641,
-0.004712874069809914,
0.15014177560806274,
-0.21159444749355316,
-0.3760104477405548,
-0.726822018623352,
-0.616627037525177,
0.3389756381511688,
-0.20137180387973785,
-0.1217852979898... | |
I have a micro-mini-search engine that highlights the search terms in my rails app. The search ignores accents and the highlight is case insensitive. Almost perfect.
But, for instance if I have a record with the text "pão de queijo" and searches for "pao de queijo" the record **is** returned but the iext **is not** hig... | [
-0.10494684427976608,
0.3120121359825134,
0.37230661511421204,
0.10645649582147598,
-0.27155056595802307,
0.11021627485752106,
0.22255326807498932,
0.045377425849437714,
-0.07738613337278366,
-0.5997294783592224,
0.16555063426494598,
0.3695134222507477,
-0.03292487934231758,
-0.32478767633... | |
+text+ by inserting it into
# a <tt>:highlighter</tt> string. The highlighter can be specialized by passing <tt>:highlighter</tt>
# as a single-quoted string with \1 where the phrase is to be inserted (defaults to
# '<strong class="highlight">\1</strong>')
#
# ==== Examples
# highlight('You searched for: ... | [
-0.0935635194182396,
-0.2935086190700531,
0.6380509734153748,
-0.0228781308978796,
-0.6583002805709839,
0.23844486474990845,
0.24383249878883362,
-0.1315920650959015,
-0.2669264078140259,
-0.14743037521839142,
-0.44676223397254944,
0.32034528255462646,
-0.466417133808136,
-0.24786007404327... | |
['for', 'rails'], :highlighter => '<em>\1</em>')
# # => You searched <em>for</em>: <em>rails</em>
#
# highlight('You searched for: rails', 'rails', :highlighter => '<a href="search?q=\1">\1</a>')
# # => You searched for: <a href="search?q=rails">rails</a>
#
# highlight('Šumné dievčatá', ['šumňe', 'd... | [
-0.020948339253664017,
-0.41137242317199707,
0.32876503467559814,
-0.021860817447304726,
-0.2636363208293915,
0.4402332007884979,
0.15075351297855377,
-0.43893423676490784,
-0.5262516736984253,
-0.5376052856445312,
-0.23616960644721985,
0.255925714969635,
-0.3203020691871643,
-0.0754166021... | |
href="search?q=\1">\1</a>') # => You searched for: <a href="search?q=rails">rails</a>
def highlight(text, phrases, *args)
options = args.extract_options!
unless args.empty?
options[:highlighter] = args[0] || '<strong class="highlight">\1</strong>'
end
options.reverse_merge!(:highlighter => '... | [
-0.2734007239341736,
-0.17067119479179382,
0.5949881672859192,
-0.23829443752765656,
-0.2950758635997772,
0.2850220203399658,
0.5454515814781189,
-0.6399142146110535,
-0.29527804255485535,
-0.385503351688385,
-0.34067991375923157,
0.27868032455444336,
-0.41320863366127014,
0.03248683363199... | |
haystack = haystack.mb_chars.normalize(:kd)
match = match.mb_chars.normalize(:kd).gsub(/[^\x00-\x7F]+/n, '').gsub(/\w/, '\0[^\x00-\x7F]*')
end
highlighted = haystack.gsub(/(#{match})(?!(?:[^<]*?)(?:["'])[^<>]*>)/i, options[:highlighter])
highlighted = highlighted.mb_chars.normalize(:kc) if opt... | [
-0.24843274056911469,
-0.0747712254524231,
0.4976959228515625,
0.07603100687265396,
-0.025885505601763725,
0.3228732645511627,
0.3263658583164215,
0.0023083877749741077,
-0.11581922322511673,
-0.24457909166812897,
-0.27526912093162537,
0.4121100604534149,
-0.5889390110969543,
0.29870441555... | |
I need help understanding some C++ operator overload statements. The class is declared like this:
```
template <class key_t, class ipdc_t>
class ipdc_map_template_t : public ipdc_lockable_t
{
...
typedef map<key_t,
ipdc_t*,
less<key_t>> map_t;
...
```
The creator of the class has... | [
-0.5113058090209961,
-0.026727207005023956,
0.20893380045890808,
-0.0012307435972616076,
0.07964080572128296,
-0.013885368593037128,
-0.11036968231201172,
-0.309050977230072,
-0.08243481814861298,
-0.6155786514282227,
-0.17715394496917725,
0.5339447855949402,
-0.25607016682624817,
0.090389... | |
{}
iterator(const iterator & it)
: map_t::iterator(
*static_cast<const map_t::iterator *>(&it)) {}
operator key_t() {return ((this->operator*()).first);} // I don't understand this.
operator ipdc_t*() const {return ((this->operator*()).second);} // or this.
};
```
And begin... | [
-0.46511000394821167,
-0.1599561721086502,
0.6245014667510986,
-0.12745432555675507,
0.3220245838165283,
-0.032737601548433304,
-0.04997977986931801,
-0.5190659165382385,
-0.14628271758556366,
-0.563610315322876,
-0.38839295506477356,
0.7038443684577942,
-0.1977742314338684,
0.114062972366... | |
key and the value?
```
ipdc_map_template_t::iterator iter;
for( iter = my_instance.begin();
iter != my_instance.end();
++iter )
{
key_t my_key = ??????;
ipdc_t *my_value = ??????;
}
```
These are typecast operators, so you can do this:
```
{
key_t key = iter;
... | [
-0.22047726809978485,
-0.09638544917106628,
0.4471952021121979,
-0.11963073909282684,
0.15727631747722626,
-0.13327381014823914,
0.08004436641931534,
-0.2686019241809845,
-0.14636807143688202,
-0.474578320980072,
-0.3357851803302765,
0.7182564735412598,
-0.2519076466560364,
0.2844580113887... | |
still use the original accessors (which I find more readable):
```
{
key_t key = (*iter).first;
ipdc_t *val = (*iter).second;
// or, equivalently
key_t key = iter->first;
ipdc_t *val = iter->second;
}
``` | [
-0.08122354745864868,
-0.15902705490589142,
0.3399496376514435,
-0.039381008595228195,
0.308975487947464,
-0.1380697339773178,
0.04518457129597664,
-0.09612669795751572,
-0.37389814853668213,
-0.5598672032356262,
-0.4497183859348297,
0.568425714969635,
0.06879691034555435,
0.36026036739349... | |
Is there a way to force a Samba process to close a given file without killing it?
Samba opens a process for each client connection, and sometimes I see it holds open files far longer than needed. Usually i just kill the process, and the (windows) client will reopen it the next time it access the share; but sometimes i... | [
0.14605695009231567,
0.02259339950978756,
0.1247156485915184,
0.0428616888821125,
-0.16518503427505493,
0.010761985555291176,
0.08580613881349564,
-0.06185632571578026,
-0.8170881867408752,
-0.4070826768875122,
0.20281973481178284,
0.2823323905467987,
-0.4206266701221466,
0.107031270861625... | |
mention i've found of something similar. It seems to be a problem on the win32 client, something that microsoft servers have a workaround for; but Samba doesn't. I wish the `net rpc file close <fileid>` command worked, I'll keep trying to find out why. I'm accepting LuckyLindy's answer, even if it didn't solve the prob... | [
0.10289906710386276,
0.3250962793827057,
-0.01888727955520153,
0.14635615050792694,
0.003852700814604759,
0.013492835685610771,
0.11236412823200226,
0.41342467069625854,
-0.4215039014816284,
-0.6045961380004883,
0.26348260045051575,
0.3681394159793854,
-0.23768135905265808,
0.1116374880075... | |
(i.e. `lsof|grep -i <file_name>`)
* Try to open that file from the offending computer, or see if a process is hiding in task manager that we can close
* If no luck, have the user exit any important network programs
* Kill the user's Samba process from linux (i.e. `kill -9 <pid>`)
I wish there was a better way! | [
0.19119131565093994,
-0.05078256130218506,
0.09360256046056747,
0.04711536690592766,
-0.02006957307457924,
-0.16070236265659332,
0.469052791595459,
0.2117745280265808,
-0.5181884765625,
-0.902774453163147,
0.036304354667663574,
0.3544400930404663,
-0.4597834646701813,
0.12591177225112915,
... | |
Say I have the following XML...
```
<root>
<base>
<tent key="1" color="red"/>
<tent key="2" color="yellow"/>
<tent key="3" color="blue"/>
</base>
<bucket>
<tent key="1"/>
<tent key="3"/>
</bucket>
</root>
```
...what would the XPath be that returns that the "bucket" contains "red" and "bl... | [
0.3978159427642822,
0.3630349934101105,
0.5982429385185242,
-0.2156343013048172,
-0.06247647851705551,
-0.07628511637449265,
-0.07406772673130035,
-0.6433749198913574,
0.08516381680965424,
-0.771312415599823,
-0.2888854146003723,
0.40832191705703735,
-0.26991957426071167,
0.275092750787735... | |
I want to attach an xslt stylesheet to an XML document that I build with XMLBuilder. This is done with a Processing Instruction that looks like
```
<?xml-stylesheet type='text/xsl' href='/stylesheets/style.xslt' ?>
```
Normally, I'd use the `instruct!` method, but `:xml-stylesheet` is not a valid Ruby symbol.
XMLBu... | [
0.3966246247291565,
0.029813377186655998,
0.49257543683052063,
0.23159563541412354,
0.009745711460709572,
-0.21754926443099976,
-0.03099171631038189,
-0.3325602114200592,
0.1374131739139557,
-0.601691484451294,
-0.017597630620002747,
0.5200228691101074,
-0.48024696111679077,
-0.03699503839... | |
The scroll lock button seems to be a reminder of the good old green terminal days. Does anyone still use it? Should the 101 button keyboard become the 100 button keyboard?
I use it all the time on Unix terminals. It is quite handy when something catches my eye when I'm tailing a log file. | [
-0.06047183275222778,
0.12698790431022644,
0.553254246711731,
-0.006176779046654701,
0.5335218906402588,
-0.23003634810447693,
-0.060669928789138794,
0.6515330672264099,
-0.47848549485206604,
-0.5089205503463745,
0.1270347684621811,
0.29204970598220825,
0.05181529372930527,
0.1396758258342... | |
Basically I want to know how to set center alignment for a cell using VBScript...
I've been googling it and can't seem to find anything that helps.
```
Set excel = CreateObject("Excel.Application")
excel.Workbooks.Add() ' create blank workbook
Set workbook = excel.Workbooks(1)
' set A1 to be centered.
workbook.Shee... | [
0.3860589265823364,
0.21675913035869598,
0.4132498800754547,
-0.1339857280254364,
0.07640733569860458,
0.012244406156241894,
-0.03332936763763428,
-0.4205929636955261,
0.00975081231445074,
-0.8357241153717041,
0.08236276358366013,
0.5260956883430481,
-0.5691230297088623,
-0.157540962100029... | |
I have a class that processes a 2 xml files and produces a text file.
I would like to write a bunch of unit / integration tests that can individually pass or fail for this class that do the following:
1. For input A and B, generate the output.
2. Compare the contents of the generated file to the contents expected ou... | [
0.2809343636035919,
-0.010854757390916348,
-0.11465690284967422,
0.13187776505947113,
-0.1129700168967247,
0.048516109585762024,
0.280201256275177,
-0.38088545203208923,
0.1996447741985321,
-0.7409912347793579,
0.21392624080181122,
0.46519893407821655,
-0.18046310544013977,
-0.024210125207... | |
this sort of testing, or do people tend to write zillions of TestX() functions?**
**Is there a better way to coax text-file differences from NUnit?** Should I embed a textfile diff algorithm?
---
```
class ReportGenerator
{
string Generate(string inputPathA, string inputPathB)
{
//do stuff
}
}
`... | [
0.376701682806015,
-0.27712225914001465,
0.29035741090774536,
0.21144460141658783,
-0.29693248867988586,
-0.023203983902931213,
0.39388325810432434,
-0.4269394278526306,
0.3789186179637909,
-0.5388986468315125,
0.06910309940576553,
0.8305312991142273,
-0.16572809219360352,
0.06562063097953... | |
using (StreamReader rs2 = File.OpenText(pathToActualResult))
{
string actualContents = rs2.ReadToEnd();
string expectedContents = rs1.ReadToEnd();
//this | [
0.04799043387174606,
-0.5547663569450378,
0.6898135542869568,
0.07899405807256699,
0.2570028603076935,
0.1806807667016983,
0.34021204710006714,
-0.2375437170267105,
0.08292176574468613,
-0.5654556751251221,
0.030261680483818054,
0.712375819683075,
-0.2036840170621872,
-0.05666997283697128,... | |
works, but the output could be a LOT more useful.
Assert.AreEqual(expectedContents, actualContents);
}
}
}
static TestGenerate(string pathToInputA, string pathToInputB, string pathToExpectedResult)
{
ReportGenerator obj = new ReportGenerator();
... | [
-0.04109311103820801,
-0.2966339588165283,
0.35905927419662476,
-0.10122976452112198,
0.010869585908949375,
0.11911533772945404,
0.580929696559906,
-0.5526652932167053,
0.20333218574523926,
-0.7291561961174011,
-0.05007772892713547,
0.7265464067459106,
-0.24277952313423157,
-0.049360580742... | |
Diff(pathToExpectedResult, pathToResult);
}
[Test]
public void TestX()
{
TestGenerate("x1.xml", "x2.xml", "x-expected.txt");
}
[Test]
public void TestY()
{
TestGenerate("y1.xml", "y2.xml", "y-expected.txt");
}
//etc...
}
```
---
Update
------
... | [
0.5092872977256775,
-0.2802391052246094,
0.334412157535553,
-0.1065530851483345,
-0.1486063152551651,
-0.048349544405937195,
0.4747517704963684,
-0.1701665222644806,
0.567176342010498,
-0.6473498940467834,
-0.21773973107337952,
0.6941233277320862,
-0.4757072627544403,
0.05245784670114517,
... | |
it to produce more readable failures.
As for the multiple tests with different data, use the NUnit RowTest extension:
```
using NUnit.Framework.Extensions;
[RowTest]
[Row("x1.xml", "x2.xml", "x-expected.xml")]
[Row("y1.xml", "y2.xml", "y-expected.xml")]
public void TestGenerate(string pathToInputA, string pathToInput... | [
0.30593737959861755,
-0.06515401601791382,
0.02226797677576542,
0.06359969824552536,
-0.2033143937587738,
0.28973492980003357,
0.580329179763794,
-0.3930378556251526,
0.416536808013916,
-0.6179780960083008,
0.07393273711204529,
0.6080646514892578,
-0.2354973554611206,
0.30871808528900146,
... | |
I've seen a few COM controls which wrap the Gecko rendering engine ([GeckoFX](http://code.google.com/p/geckofx/), as well as the control shipped by Mozilla - [mozctlx.dll](https://stackoverflow.com/questions/26147/is-it-possible-to-embed-gecko-or-webkit-in-a-cnet-win-form-just-like-a-webview)). Is there a wrapper for W... | [
0.4249842166900635,
-0.11132830381393433,
0.14558665454387665,
0.3354893922805786,
-0.11069554835557938,
-0.14468903839588165,
0.015318367630243301,
0.11492364853620529,
-0.260538786649704,
-0.5229785442352295,
-0.049802035093307495,
0.6523665189743042,
-0.10230932384729385,
0.072170376777... | |
I wonder if They can work perfectly together...
Yes VS'08 and VS'05 will work nicely when installed on the same machine.
Now, if only they made the .NET 2.0 support in VS'08 use the same solution/project file version number as VS'05 so you could easily move back and forth VS versions with the same project without modi... | [
0.31533554196357727,
0.026527024805545807,
0.287124365568161,
0.36487841606140137,
-0.09393914043903351,
-0.13897313177585602,
0.23618322610855103,
0.10818735510110855,
0.028222138062119484,
-0.8416555523872375,
0.15053878724575043,
0.6507510542869568,
0.10009615868330002,
0.28237077593803... | |
What factors indicate that a project's solution should not be coded in a dynamic language?
Speed is typically the primary answer. Though this is becoming less of an issue these days. | [
-0.10998141765594482,
-0.03006710670888424,
0.09865039587020874,
0.33390310406684875,
0.040619682520627975,
0.15444745123386383,
0.3065112829208374,
0.018958626314997673,
-0.30116674304008484,
-0.7549448609352112,
-0.7468841075897217,
0.4693768620491028,
-0.2235310822725296,
-0.36016151309... | |
Out of order execution in CPUs means that a CPU can reorder instructions to gain better performance and it means the CPU is having to do some very nifty bookkeeping and such. There are other processor approaches too, such as hyper-threading.
Some fancy compilers understand the (un)interrelatedness of instructions to a... | [
-0.002864031819626689,
0.17398031055927277,
-0.05291324853897095,
0.18696044385433197,
-0.2073323130607605,
0.10166346281766891,
0.3257367014884949,
0.16304968297481537,
-0.29608702659606934,
-0.4519316256046295,
-0.11664211750030518,
0.10587096959352493,
-0.523093044757843,
0.169342860579... | |
there a straight-forward way to get my the body of my 'for' loop for this highly-parallel task to be interleaved so that two (or more) iterations are being done together? (This is slightly different from 'loop unwinding' as I understand it.)
My task is a 'virtual machine' running through a set of instructions, which I... | [
0.2893454134464264,
-0.2809108793735504,
0.3339364528656006,
-0.08564263582229614,
0.022232526913285255,
0.1379198133945465,
0.43765896558761597,
-0.32011178135871887,
-0.28139767050743103,
-0.2449483424425125,
-0.017433417961001396,
0.48112788796424866,
-0.23436006903648376,
0.32281109690... | |
}
}
}
```
So the execution trail might look like this:
```
data(1) insn(0) parse
data(1) insn(0) eval
data(1) insn(1) parse
...
data(2) insn(1) eval
data(2) insn(2) parse
data(2) insn(2) eval
```
Now, what I'd like is to be able to do two (or more) iterations explicitly in parallel:
```
data(1) insn(0) parse
da... | [
0.04304678365588188,
0.145182266831398,
0.08584997057914734,
0.03203323110938072,
0.012576512061059475,
0.2810927927494049,
0.2788178622722626,
-0.3689187467098236,
-0.4905637800693512,
-0.3042854964733124,
0.06945773214101791,
0.5719566941261292,
-0.37805506587028503,
-0.11431216448545456... | |
ops in registers and then writing results back. Each step is several thousand instructions long. So if I can intermingle the two steps for two iterations at once, the processor will hopefully have something to do whilst the cache misses of the parse step are occurring...
Is there some c++ template madness to get this ... | [
0.391330748796463,
-0.011265547946095467,
0.06865721940994263,
0.11267121136188507,
0.20431512594223022,
0.2974531352519989,
0.04816244915127754,
-0.11377881467342377,
-0.6224521398544312,
-0.6621202230453491,
0.2756292223930359,
0.5543689131736755,
-0.3297375440597534,
-0.4120225608348846... | |
for this kind of thing?
It sounds like you ran into the same problem chip designers face: Executing a single instruction takes a lot of effort, but it involves a bunch of different steps that can be strung together in an [execution pipeline](http://en.wikipedia.org/wiki/Pipeline_(computing)). (It is easier to execute t... | [
0.7741554975509644,
-0.24249684810638428,
-0.29936784505844116,
0.41334637999534607,
0.15009990334510803,
0.19189971685409546,
-0.10270441323518753,
-0.18270359933376312,
-0.5460623502731323,
-0.448091059923172,
0.17790445685386658,
0.2996680736541748,
-0.3407216966152191,
0.16922739148139... | |
between them. In either case, you'll have to be very careful with how you share data between threads and make sure to handle the case where one instruction affects the result of the following instruction. Even though you only have one core and only one thread can be running at any given time, your operating system shou... | [
0.48951175808906555,
-0.04622228443622589,
0.09513264894485474,
0.4878174066543579,
0.3385116457939148,
-0.09839044511318207,
0.09081611782312393,
0.11466515064239502,
-0.4818991422653198,
-0.6169719696044922,
0.05243229493498802,
0.4426164925098419,
-0.1628534197807312,
-0.002465063706040... | |
sense to consider the problem the way you're looking at it. Regardless, it's an interesting problem to consider.) | [
0.11128845810890198,
0.1576048880815506,
-0.08377555757761002,
0.24030573666095734,
-0.13290703296661377,
0.4894990622997284,
0.4504888653755188,
-0.13581721484661102,
-0.15840288996696472,
-0.5695173740386963,
0.19568060338497162,
0.6713377237319946,
-0.24158789217472076,
-0.1608737856149... | |
This code works (C# 3)
```
double d;
if(d == (double)(int)d) ...;
```
1. Is there a better way to do this?
2. For extraneous reasons I want to avoid the double cast so; what nice ways exist other than this? (even if they aren't as good)
*Note:* Several people pointed out the (important) point that == is often probl... | [
0.2514522969722748,
0.3459516763687134,
0.17900000512599945,
-0.12993715703487396,
0.02692684344947338,
-0.25178074836730957,
0.47875460982322693,
-0.3956635594367981,
-0.24240408837795258,
-0.4058826267719269,
-0.03815873712301254,
0.5230324864387512,
-0.12553253769874573,
-0.137817770242... | |
Hopefully you're aware that you have to be very careful when doing this kind of thing; floats/doubles will very easily accumulate miniscule errors that make exact comparisons (like this one) fail for no obvious reason. | [
0.8090157508850098,
0.044827692210674286,
0.03680325299501419,
0.48794540762901306,
0.11300090700387955,
-0.19491279125213623,
0.12311079353094101,
0.1123623177409172,
-0.249805748462677,
-0.555336058139801,
0.4707989990711212,
0.30964672565460205,
-0.0380956269800663,
-0.2008417844772339,... | |
I have the following code that shows either a bug or a misunderstanding on my part.
I sent the same list, but modified over an ObjectOutputStream. Once as [0] and other as [1]. But when I read it, I get [0] twice. I think this is caused by the fact that I am sending over the same object and ObjectOutputStream must be ... | [
0.2777915894985199,
0.2512612044811249,
0.20037077367305756,
-0.24075689911842346,
0.24961400032043457,
0.06676677614450455,
0.42984986305236816,
0.09187323600053787,
-0.37791553139686584,
-0.7080256342887878,
-0.046443596482276917,
0.37449726462364197,
-0.7897831797599792,
0.4048793315887... | |
t1 = new Thread(new Runnable() {
public void run() {
try {
ServerSocket ss = new ServerSocket(12344);
Socket s= ss.accept(); | [
0.39399510622024536,
-0.4711637496948242,
0.30974987149238586,
-0.21161700785160065,
0.3449273407459259,
0.1403190791606903,
0.7274059057235718,
-0.030869442969560623,
-0.1474612057209015,
-0.6453316807746887,
-0.38976311683654785,
0.23582690954208374,
-0.5068439841270447,
0.51416021585464... | |
ObjectOutputStream oos = new ObjectOutputStream(s.getOutputStream());
List same = new ArrayList();
same.add(0);
oos.writeObject(same);
same.clear(); | [
-0.09151862561702728,
-0.3532508909702301,
0.5868587493896484,
-0.5090522170066833,
0.16172756254673004,
0.09348516166210175,
0.36346229910850525,
-0.20142412185668945,
-0.2649807333946228,
-0.7341496348381042,
-0.2495870292186737,
0.3636976182460785,
-0.48585572838783264,
0.01066604256629... | |
same.add(1);
oos.writeObject(same);
} catch(Exception e) {
e.printStackTrace();
}
} | [
0.11046435683965683,
-0.28918054699897766,
0.06829708814620972,
-0.47515204548835754,
0.45760834217071533,
0.010017096996307373,
0.23388969898223877,
-0.25063982605934143,
-0.30448117852211,
-0.40852436423301697,
-0.15333984792232513,
0.37041619420051575,
-0.5421370267868042,
-0.1098703742... | |
});
t1.start();
Socket s = new Socket("localhost", 12344);
ObjectInputStream ois = new ObjectInputStream(s.getInputStream());
// outputs [0] as expected
System.out.println(ois.readObject());
// outputs [0], but expected [1]
System.out.println(ois.readObject());... | [
-0.13788998126983643,
-0.38908931612968445,
0.6245207786560059,
-0.20412129163742065,
0.13337036967277527,
0.23760534822940826,
0.233382448554039,
-0.07738827168941498,
-0.2074635922908783,
-0.7032230496406555,
-0.20312350988388062,
0.419664591550827,
-0.4140531122684479,
0.128865346312522... | |
object which is sent twice will not give two objects on the other end, you will only get one. And sending the same object twice separately will give you the same instance twice (each with the same data - which is what you're seeing).
See the reset() method if you want to reset the graph. | [
0.15261659026145935,
-0.34029561281204224,
0.08813158422708511,
0.1331314742565155,
-0.3054139316082001,
0.20884031057357788,
0.44901663064956665,
0.08477786183357239,
-0.7250404357910156,
-0.9041991829872131,
0.124210886657238,
0.42455506324768066,
-0.6523604393005371,
0.09536069631576538... | |
I'm looking for books or online resources that go in detail over programming techniques for high performance computing using C++.
practically all HPC code I've heard of is either for solving sytems of linear equations or FFT's. Heres some links to start you off at least in the libraries used:
* [BLAS](http://en.wikipe... | [
-0.1074654683470726,
0.04264693707227707,
0.22697851061820984,
-0.05533543601632118,
-0.05153171345591545,
0.21889695525169373,
-0.13380488753318787,
-0.22543834149837494,
-0.7324926853179932,
-0.48163238167762756,
-0.14830653369426727,
0.21843181550502777,
-0.37580353021621704,
-0.2436499... | |
- Communications library for distributed systems.
* [PETSc](http://mcs.anl.gov/petsc) - Scalable nonlinear and linear solvers (user-extensible, interface to much above) | [
0.11524766683578491,
-0.23941843211650848,
0.2407217174768448,
0.289789617061615,
0.09097681194543839,
0.09930858761072159,
0.03459467738866806,
-0.0283848624676466,
-0.4453812837600708,
-0.4439440071582794,
-0.3312375247478485,
0.19756655395030975,
-0.03281395882368088,
0.0638970881700515... | |
What is the most efficient way to get the default constructor (i.e. instance constructor with no parameters) of a System.Type?
I was thinking something along the lines of the code below but it seems like there should be a simplier more efficient way to do it.
```
Type type = typeof(FooBar)
BindingFlags flags = Bindin... | [
-0.1193591058254242,
0.0614621601998806,
0.5599637031555176,
-0.0866815447807312,
-0.00794061366468668,
-0.09713515639305115,
0.3919691741466522,
-0.3450610935688019,
-0.17658936977386475,
-0.6683831810951233,
-0.0990063026547432,
0.5686526894569397,
-0.5978971719741821,
0.1700015962123870... | |
I am making extensive use of `boost:shared_ptr` in my code. In fact, most of the objects that are allocated on the heap are held by a `shared_ptr`. Unfortunately this means that I can't pass `this` into any function that takes a `shared_ptr`. Consider this code:
```
void bar(boost::shared_ptr<Foo> pFoo)
{
...
}
v... | [
0.17483429610729218,
0.2130451649427414,
0.2691228985786438,
-0.3105916976928711,
0.10932433605194092,
-0.06650357693433762,
0.18343499302864075,
-0.14281517267227173,
-0.044013530015945435,
-0.5329242944717407,
-0.013482575304806232,
0.4900802671909332,
-0.3831111788749695,
0.384837180376... | |
me to my question: Is there any standard pattern for getting a copy of the existing shared pointer you know exists from inside a method on one of those objects? Is using intrusive reference counting my only option here?
You can derive from [enable\_shared\_from\_this](http://www.boost.org/doc/libs/1_36_0/libs/smart_ptr... | [
0.27147331833839417,
0.06034240871667862,
0.4426775574684143,
-0.22484293580055237,
0.004231647588312626,
0.029751088470220566,
0.04370676726102829,
-0.27835676074028015,
0.07024398446083069,
-0.6097282767295837,
-0.03268390893936157,
0.5452150106430054,
-0.4196169972419739,
0.087633378803... | |
shared_ptr<Y> q = p->f();
assert(p == q);
assert(!(p < q || q < p)); // p and q must share ownership
}
```
It's a good idea when spawning threads from a member function to boost::bind to a shared\_from\_this() instead of this. It will ensure that the object is not released. | [
0.14525452256202698,
-0.24521736800670624,
0.12775292992591858,
0.010157296434044838,
-0.03232192620635033,
-0.3540501296520233,
0.0622284859418869,
-0.26697149872779846,
-0.03972354531288147,
-0.3405574560165405,
-0.11513032764196396,
0.5191171765327454,
-0.22874729335308075,
0.6637994647... | |
Sometimes when using eclipse it loses references to the JRE.
i.e. It cannot find classes like Object or Arraylist.
Some projects report a problem while others don't and they both use the same JRE.
I have found that if you switch the installed JRE to another and then back again to the one you want to use, it will the... | [
0.2585887014865875,
-0.08488979190587997,
-0.07102449238300323,
0.07629101723432541,
-0.36865201592445374,
-0.379293829202652,
0.3887268006801605,
0.08352776616811752,
-0.3027975261211395,
-0.6966041922569275,
0.18052618205547333,
0.6516268253326416,
-0.5026306509971619,
0.0676219165325164... | |
wasn't helping. I realised that it is clearly a classloader issue of some kind, so what I did was to open the ".classpath" file of each project in the editor and manually move the JRE reference classpathentry line to be the first entry in the file, in the hope that it would load the JRE before any other classes which m... | [
0.16599266231060028,
-0.28820276260375977,
0.1845913678407669,
-0.032794129103422165,
-0.09479563683271408,
-0.11888594180345535,
0.3604968786239624,
0.055729806423187256,
0.03713199868798256,
-0.7247971296310425,
-0.08593570441007614,
0.6164257526397705,
-0.3327524960041046,
0.19323208928... | |
to disable the ".\* Resources" filter to be able to open the ".classpath" file. | [
0.1364920437335968,
-0.427370548248291,
-0.26787787675857544,
0.12858344614505768,
0.42217642068862915,
-0.25140732526779175,
0.6392425298690796,
0.20387683808803558,
-0.1495772898197174,
-0.788863480091095,
-0.32163822650909424,
0.5901319980621338,
-0.3636479079723358,
0.01164548564702272... | |
I have a method lets say:
```
private static String drawCellValue(
int maxCellLength, String cellValue, String align) { }
```
and as you can notice, I have a parameter called align. Inside this method I'm going to have some if condition on whether the value is a 'left' or 'right'.. setting the parameter as Strin... | [
0.11940890550613403,
-0.0953679159283638,
0.5897422432899475,
-0.03582073003053665,
-0.053765811026096344,
-0.22633209824562073,
-0.011911364272236824,
-0.11947739124298096,
0.1105094775557518,
-0.4106215536594391,
0.3251568675041199,
0.44910237193107605,
-0.3427286148071289,
0.34396293759... | |
it. First, how to associate true/false with left/right ? (Ok, I can use comments but I still find it dirty) and secondly, I might decide to add a new value, like 'justify', so if I have more than 2 possible values, Boolean type is definitely not possible to use.
Any ideas?
This should do it:
```
private enum Alignmen... | [
0.25985994935035706,
-0.45551174879074097,
0.43744879961013794,
0.18991619348526,
0.016965195536613464,
-0.16309361159801483,
0.06559818238019943,
-0.22102199494838715,
0.13123752176761627,
-0.4424968659877777,
0.10427148640155792,
0.7546761631965637,
-0.21531032025814056,
0.01078107208013... | |
Is there a way to call an EJB that is served through WebSphere (iiop://host:port/ejbName) from a vanilla JRE (like Sun). A lot of people have been telling me that this type of architecture relies in a homogenous environment. Thoughts?
Although it’s possible, I wouldn’t recommend it because you’re asking for troubles us... | [
0.3576369285583496,
0.2633286118507385,
0.06114891916513443,
-0.023940229788422585,
-0.1534547060728073,
-0.14100190997123718,
-0.0006248770514503121,
0.2840745449066162,
-0.24972684681415558,
-0.6648037433624268,
0.13616059720516205,
0.3926478922367096,
-0.316649854183197,
0.2683627605438... | |
Is there such a thing as unit test generation? If so...
...does it work well?
...What are the auto generation solutions that are available for .NET?
...are there examples of using a technology like this?
...is this only good for certain types of applications, or could it be used to replace all manually written uni... | [
0.2817096710205078,
-0.26975736021995544,
0.13579541444778442,
0.16225171089172363,
-0.22750794887542725,
0.033789392560720444,
-0.26335132122039795,
0.0021036616526544094,
0.02504521608352661,
-0.7976021766662598,
-0.28836217522621155,
0.3899897336959839,
-0.026071641594171524,
-0.0366485... | |
Enterprise Edition. It supports emitting tests in MSTest, MSTest V2, NUnit, and xUnit format and it is extensible so you can use it with other unit test frameworks.
But be aware of the following caveats:
* Supports only C# code that targets the .NET Framework.
* Does not support x64 configurations.
* Available in Vis... | [
0.11863642185926437,
-0.03656485676765442,
0.1612633317708969,
0.07895628362894058,
-0.14224247634410858,
-0.25783416628837585,
0.29426974058151245,
-0.024284282699227333,
0.05384943634271622,
-0.7007691860198975,
-0.27238792181015015,
0.4534204304218292,
-0.3540803790092468,
-0.2441094517... | |
Where I work we have a little bit of a dilemma... I work on a small team developing an application for internal use. We recently just received a new PM to the project. She would like to have access to our database and our sourcecode (stored in svn). Our previous PM did not see a need, nor want, to have access to any of... | [
0.8609907627105713,
0.42303889989852905,
0.019403556361794472,
-0.08382273465394974,
0.367642343044281,
-0.006297375541180372,
-0.03884231299161911,
-0.2629830241203308,
-0.3300733268260956,
-0.06234335899353027,
0.1910099983215332,
0.17452196776866913,
0.3202040195465088,
0.54329496622085... | |
have access to one or both, what kind of access?
I have thought on this for a bit and at first I did not want the PM/BA in my sandbox, but I have since went the other way in thinking what harm could it do? Am I incorrect?
Is this end a battle worth fighting?
Give her access. Make her check it out of source control ... | [
0.6046668887138367,
-0.03644777089357376,
0.14178675413131714,
0.327481210231781,
0.28493398427963257,
-0.10396146029233932,
0.16282585263252258,
-0.0981304720044136,
-0.15595300495624542,
-0.27816277742385864,
0.1515938639640808,
0.5581854581832886,
0.07544219493865967,
0.2654459774494171... | |
well... she probably would have found a way to do that anyway. | [
0.39284610748291016,
0.233713299036026,
-0.10381302982568741,
0.08733463287353516,
0.10177275538444519,
0.048028185963630676,
0.21710647642612457,
-0.02494117058813572,
-0.2001493275165558,
0.1801781952381134,
0.3011842668056488,
0.23967857658863068,
0.2775873839855194,
0.22372303903102875... | |
I have DocumentRoot /var/www/test in my .htaccess file. This is causing the apache server to give me a 500 internal server error.
The error log file shows:
alert] [client 127.0.0.1] /var/www/.htaccess: DocumentRoot not allowed here
AllowOveride All is set in my conf file.
Any idea why this is happening?
The [Documen... | [
0.323832631111145,
0.16479219496250153,
0.5647727251052856,
-0.0927637591958046,
0.19841480255126953,
-0.5778884291648865,
0.6655535101890564,
-0.26686105132102966,
-0.05587843060493469,
-0.5195859670639038,
-0.17308281362056732,
0.576460599899292,
-0.1356402039527893,
0.369002103805542,
... | |
A legacy embedded system is implemented using a cooperative multi-tasking scheduler.
The system essentially works along the following lines:
* Task A does work
* When Task A is done, it yields the processor.
* Task B gets the processor and does work.
* Task B yields
...
* Task n yields
* Task A gets scheduled and... | [
0.19483862817287445,
-0.1899137794971466,
0.2369929850101471,
0.04032124578952789,
0.21109840273857117,
0.21329955756664276,
-0.07817051559686661,
-0.2194359451532364,
-0.2443956583738327,
-0.5827681422233582,
-0.26381751894950867,
0.5173627734184265,
-0.11193190515041351,
0.11026064306497... | |
OS, it is possible to implement this type of cooperative multi-tasking.
Simply put all the tasks at the **same** priority.
In your code, where you do your *yield*, simply insert a 'taskDelay(0);'
Note that you have to make sure the kernel time slicing is disabled (kernelTimeSlice(0)).
All tasks at the same priori... | [
-0.38977766036987305,
-0.4394600987434387,
0.23014424741268158,
0.24096083641052246,
-0.017480412498116493,
0.09573357552289963,
0.10982593894004822,
0.1416921317577362,
-0.3673597276210785,
-0.9055714011192322,
-0.19688381254673004,
0.5264415144920349,
-0.46829792857170105,
0.044615183025... | |
I've heard that the automotive industry has something called MISRA C.
What are the relevant standards for other high reliability/availability/security industries, such as
* Space
* Aircraft
* Banking/financial
* Automotive
* Medical
* Defense/Military
* ???
-Adam
Check out the Goddard Space Flight Center and its [co... | [
0.8590236902236938,
0.5875710248947144,
-0.04626351222395897,
0.326953649520874,
0.3719787001609802,
-0.2838713228702545,
-0.18784838914871216,
-0.20893678069114685,
-0.2975744307041168,
-0.12777818739414215,
-0.214894101023674,
0.41953203082084656,
-0.003993920050561428,
0.210087239742279... | |
I need a compact representation of an array of booleans, does Python have a builtin bitfield type or will I need to find an alternate solution?
[Bitarray](http://pypi.python.org/pypi/bitarray/) was the best answer I found, when I recently had a similar need. It's a C extension (so much faster than BitVector, which is p... | [
0.041837822645902634,
-0.16208429634571075,
0.23626317083835602,
0.07515457272529602,
-0.1196332797408104,
0.19247393310070038,
0.011957582086324692,
-0.13979269564151764,
-0.1378801017999649,
-0.38653308153152466,
-0.04371628537774086,
0.4164847433567047,
-0.16924810409545898,
-0.05220354... | |
I've create a WinForms control that inherits from System.Windows.Forms.UserControl...I've got some custom events on the control that I would like the consumer of my control to be able to see. I'm unable to actually get my events to show up in the Events tab of the Properties window during design time. This means the on... | [
-0.03720960393548012,
-0.028344862163066864,
0.44919702410697937,
0.17360830307006836,
0.2263093888759613,
-0.1924968808889389,
0.15117503702640533,
-0.10675846040248871,
-0.029744300991296768,
-0.73502516746521,
0.026985054835677147,
0.48566505312919617,
-0.06526101380586624,
0.1203402429... | |
I know the event will show up using Intellisense but it would be great if it could show in the properties window too.
Make sure your events are exposed as public. For example...
```
[Browsable(true)]
public event EventHandler MyCustomEvent;
``` | [
0.22518591582775116,
-0.10225570201873779,
0.0775323361158371,
0.31739550828933716,
0.08611803501844406,
-0.8607218861579895,
0.29680487513542175,
0.28377529978752136,
-0.14685527980327606,
-0.8856484889984131,
-0.14385153353214264,
0.6648896336555481,
0.11278917640447617,
0.23758581280708... | |
I have a series of ASCII flat files coming in from a mainframe to be processed by a C# application. A new feed has been introduced with a Packed Decimal (COMP-3) field, which needs to be converted to a numerical value.
The files are being transferred via FTP, using ASCII transfer mode. I am concerned that the binary f... | [
0.5450936555862427,
-0.019646406173706055,
0.4669344127178192,
0.22128865122795105,
0.2071637064218521,
0.11451282352209091,
-0.6280133128166199,
0.1127634271979332,
-0.18146702647209167,
-0.5495452880859375,
-0.22164784371852875,
0.3530416488647461,
-0.15113268792629242,
0.187723487615585... | |
around this part (i.e. a stream of some sort), but the business will give me pushback.
The requirement read "Convert from HEX to ASCII", but clearly that didn't yield the correct values. Any help would be appreciated; it need not be language-specific as long as you can explain the logic of the conversion process.
Firs... | [
0.2684098184108734,
-0.016410058364272118,
0.2421140819787979,
0.29189783334732056,
-0.0787031501531601,
-0.09691742807626724,
0.15082937479019165,
0.2992376685142517,
0.1510884016752243,
-0.39408257603645325,
-0.4680624008178711,
0.17694388329982758,
-0.20150084793567657,
0.08591757714748... | |
that it will occur rarely and unexpectedly.
The best solution is to change the transfer mode to BIN. This is appropriate since the data you are transferring is binary. If it is not possible to use the correct FTP transfer mode, you can undo the ASCII mode damage in code. All you have to do is convert \r\n pairs back t... | [
0.18574300408363342,
0.041667480021715164,
0.16932986676692963,
0.008074195124208927,
0.18006785213947296,
-0.01961631141602993,
0.09725210070610046,
-0.15335188806056976,
-0.2923722267150879,
-0.6678735017776489,
-0.18171493709087372,
0.6684895753860474,
-0.3619351089000702,
0.21261571347... | |
BASIC. See below for a VB.NET port of this code.
Since you're dealing with COMP-3 values, the file format you're reading almost surely has fixed record sizes with fixed field lengths. If I were you, I would get my hands of a file format specification before you go any further with this. You should be using a BinaryRea... | [
0.3568056523799896,
0.08517976105213165,
-0.32461968064308167,
0.2785175144672394,
-0.023551559075713158,
-0.08517526835203171,
0.0363750234246254,
-0.0010390999959781766,
-0.2735229730606079,
-0.4593568742275238,
0.04024855047464371,
0.7661423087120056,
-0.37126657366752625,
0.14506766200... | |
to a COMP-3 file. If this doesn't work, I would refer back to the original MS sample code for guidance, or to references in the other answers to this question.
```
Imports Microsoft.VisualBasic
Module Module1
'Sample COMP-3 conversion code
'Adapted from http://support.microsoft.com/kb/65323
'This code has not been t... | [
0.12695617973804474,
0.1899641752243042,
0.3362490236759186,
-0.12105238437652588,
-0.08368116617202759,
0.5001481771469116,
0.28014057874679565,
-0.471800297498703,
0.06486772745847702,
-0.2797907590866089,
-0.17636413872241974,
0.503010630607605,
-0.17359359562397003,
-0.0070250420831143... | |
Digit%, E%, Decimal%, FileName$
'Clear the screen, get the filename and the amount of decimal places
'desired for each number, and open the file for sequential input:
FileName$ = InputBox("Enter the COBOL data file name: ")
Decimal% = InputBox("Enter the number of decimal places desired: ")
FileOp... | [
-0.023293424397706985,
0.1744905561208725,
0.6639163494110107,
-0.3403377830982208,
0.20320196449756622,
0.07711047679185867,
0.06171569228172302,
0.10651163756847382,
0.014768684282898903,
-0.37496984004974365,
-0.4482354521751404,
0.3134108781814575,
-0.42065513134002686,
0.0193418748676... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.