text
stringlengths
0
30.5k
title
stringclasses
1 value
embeddings
listlengths
768
768
@failcom='exit 1'; \ for f in x $$MAKEFLAGS; do \ case $$f in \ *=* | --[!k]*);; \ *k*) failcom='fail=yes';; \ esac; \ done; \ dot_seen=no; \ target=`echo $@ | sed s/-recursive//`; \ list='$(SUBDIRS)'; for subdir in $$list; do \ echo "Making $$target in $$subdir"; \...
[ 0.0008176177507266402, -0.26264217495918274, 0.1532500684261322, -0.35501763224601746, 0.18268230557441711, 0.14850011467933655, 0.7500154972076416, -0.4032919108867645, -0.04059668257832527, -0.2935083210468292, -0.6097561717033386, 0.29157769680023193, -0.3777899146080017, -0.06182953342...
= "."; then \ dot_seen=yes; \ local_target="$$target-am"; \ else \ local_target="$$target"; \ fi; \ (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done; \ if test "$$dot_seen" = "no"; then \ $(MAKE) $(AM_MAKEFLAGS) "$$target-a...
[ -0.0033426822628825903, 0.029192669317126274, 0.6188985705375671, -0.4868162274360657, 0.3742305338382721, 0.1534327119588852, 0.5696567296981812, -0.4307599365711212, -0.08949649333953857, -0.5061352252960205, -0.5845853090286255, 0.6883053779602051, -0.31666243076324463, -0.1775909662246...
@failcom='exit 1'; \ for f in x $$MAKEFLAGS; do \ case $$f in \ *=* | --[!k]*);; \ *k*) failcom='fail=yes';; \ esac; \ done; \ dot_seen=no; \ case "$@" in \ distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \ *) list='$(SUBDIRS)' ;; \ esac; \ rev...
[ -0.20809881389141083, -0.236840158700943, 0.6610760688781738, -0.34843096137046814, 0.4113299548625946, -0.004577436950057745, 0.7593945264816284, -0.14590081572532654, 0.0012493653921410441, -0.4671691358089447, -0.70416659116745, 0.6659669280052185, -0.3949791193008423, 0.138537287712097...
subdir in $$list; do \ if test "$$subdir" = "."; then :; else \ rev="$$subdir $$rev"; \ fi; \ done; \ rev="$$rev ."; \ target=`echo $@ | sed s/-recursive//`; \ for subdir in $$rev; do \ echo "Making $$target in $$subdir"; \ if test "$$subdir" = "."; then \ local_t...
[ -0.06604588031768799, -0.10333160310983658, 0.3191356360912323, -0.6074737310409546, 0.16947296261787415, 0.26146596670150757, 0.6228876709938049, -0.5802625417709351, -0.08653917908668518, -0.26064613461494446, -0.6024017333984375, 0.5560491681098938, -0.34040969610214233, -0.087859965860...
else \ local_target="$$target"; \ fi; \ (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done && test -z "$$fail" tags-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \ ...
[ -0.09569334983825684, -0.16586676239967346, 0.434984415769577, -0.4971906840801239, 0.33892741799354553, 0.10756242275238037, 0.7025676965713501, -0.6663267612457275, -0.02046296000480652, -0.3300773501396179, -0.6778932213783264, 0.6877676844596863, -0.5006785988807678, -0.283272892236709...
(cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; n...
[ 0.25545206665992737, -0.02993011102080345, 0.46635711193084717, -0.5108975172042847, 0.04184398427605629, -0.2744535803794861, 0.60212641954422, -0.9057881236076355, -0.04347318410873413, -0.12386777997016907, -0.47657981514930725, 0.4532157778739929, -0.6052096486091614, -0.11039108037948...
mkid -fID $$unique tags: TAGS TAGS: tags-recursive $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) tags=; \ here=`pwd`; \ if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \ include_option=--etags-include; \ empty_fix=.; \ else \ include_option=...
[ -0.08958065509796143, -0.5200594067573547, 0.9189212918281555, -0.31704649329185486, 0.035938654094934464, -0.05174349620938301, 0.17467372119426727, -0.9078401327133179, -0.14011093974113464, -0.5010266304016113, -0.2960078716278076, 0.26456311345100403, -0.6612330675125122, -0.0986035615...
else \ test ! -f $$subdir/TAGS || \ tags="$$tags $$include_option=$$here/$$subdir/TAGS"; \ fi; \ done; \ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $...
[ 0.3024912476539612, -0.14939776062965393, 0.14356353878974915, -0.5028898119926453, 0.14006845653057098, -0.10908845067024231, 0.6058349609375, -0.7461796402931213, -0.032391536980867386, -0.16040939092636108, -0.3521147668361664, 0.3247275948524475, -0.6562206745147705, -0.143497720360755...
END { if (nonempty) { for (i in files) print i; }; }'`; \ if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$tags $$unique; \ fi ctags: CTAGS CTAGS: ctags-recursive $(HEADERS) $(SOURCE...
[ -0.1524447202682495, 0.13303358852863312, 0.5508807301521301, -0.1928315907716751, 0.18390750885009766, -0.260149747133255, 0.0405835285782814, -0.6212079524993896, -0.2508510649204254, -0.39726725220680237, -0.5763461589813232, 0.4973507821559906, -0.5875653624534607, -0.14619478583335876...
unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ test -z "$(CTAGS_ARGS)$$tags$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAG...
[ 0.03749062865972519, 0.26319485902786255, 0.3050698935985565, -0.349035382270813, -0.02755804918706417, 0.0004163531993981451, 0.3455440402030945, -0.7463580369949341, -0.19711077213287354, -0.26654326915740967, -0.30224478244781494, 0.2250903695821762, -0.5196284651756287, 0.0410503335297...
here=`$(am__cd) $(top_builddir) && pwd` \ && cd $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) $$here distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags distdir: $(DISTFILES) $(am__remove_distdir) test -d $(distdir) || mkdir $(distdir) @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\...
[ -0.12186887860298157, 0.11734314262866974, 0.5442010760307312, -0.4143448770046234, 0.06692510843276978, -0.038112882524728775, 0.45784661173820496, -0.9302562475204468, -0.1972958743572235, -0.2384333312511444, -0.448067843914032, 0.31529706716537476, -0.4965144097805023, -0.0446169115602...
-e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else ...
[ -0.11306621879339218, -0.12423452734947205, 0.7838338017463684, -0.18912403285503387, 0.30383214354515076, 0.21233469247817993, 0.3564234673976898, -0.7611181735992432, -0.17689260840415955, -0.5623213648796082, -0.6266571283340454, 0.45670369267463684, -0.33981603384017944, 0.163111269474...
if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -pR $(srcdir)/$$file $(distdir)$$dir || exit 1; \ fi; \ cp -pR $$d/$$file $(distdir)$$dir || exit 1; \ else \ test -f $(di...
[ -0.2534852623939514, 0.03523969277739525, 0.32775914669036865, -0.3880631625652313, 0.18476083874702454, 0.22158052027225494, 0.4010140299797058, -0.47098180651664734, 0.052707552909851074, -0.21892137825489044, -0.4035272002220154, 0.25822120904922485, -0.38093337416648865, 0.227672487497...
\ || cp -p $$d/$$file $(distdir)/$$file \ || exit 1; \ fi; \ done list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ test -d "$(distdir)/$$subdir" \ || $(MKDIR_P) "$(distdir)/$$subdir" \ || exit 1; \
[ -0.4413616955280304, 0.0019217050867155194, 0.6759443283081055, -0.4032061994075775, 0.3927159011363983, 0.32608160376548767, 0.24431940913200378, -0.3718276619911194, -0.2807529866695404, -0.21748171746730804, -0.6328176259994507, 0.20309828221797943, -0.2804532051086426, 0.22408288717269...
distdir=`$(am__cd) $(distdir) && pwd`; \ top_distdir=`$(am__cd) $(top_distdir) && pwd`; \ (cd $$subdir && \ $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$$top_distdir" \ distdir="$$distdir/$$subdir" \ am__remove_distdir=: \ am__skip_length_check=: \ ...
[ -0.6733049750328064, 0.2878391146659851, 0.5194710493087769, -0.4626898169517517, 0.1508062779903412, 0.0564526803791523, 0.34061264991760254, -0.6414076089859009, -0.13751563429832458, -0.17785322666168213, -0.7759361267089844, 0.5480411052703857, -0.2462979555130005, -0.16159139573574066...
|| exit 1; \ fi; \ done -find $(distdir) -type d ! -perm -777 -exec chmod a+rwx {} \; -o \ ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \ ! -type d ! -perm -400 -exec chmod a+r {} \; -o \ ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \ ||
[ -0.23675960302352905, 0.13894395530223846, 0.8173999190330505, -0.11085254698991776, 0.33856168389320374, 0.008876202628016472, 0.22750960290431976, -0.18558292090892792, -0.15635129809379578, -0.42857974767684937, -0.5751239061355591, 0.6630481481552124, -0.3577510118484497, 0.15829344093...
chmod -R a+r $(distdir) dist-gzip: distdir tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__remove_distdir) dist-bzip2: distdir tardir=$(distdir) && $(am__tar) | bzip2 -9 -c >$(distdir).tar.bz2 $(am__remove_distdir) dist-lzma: distdir tardir=$(distdir) && $(am__t...
[ -0.6707800626754761, 0.43539705872535706, 0.5407620668411255, -0.4298757314682007, 0.10073376446962357, 0.48496928811073303, 0.2616775631904602, -0.5186734795570374, 0.003913064021617174, -0.18833474814891815, -0.7510284185409546, 0.8583588600158691, -0.41441500186920166, -0.05605177208781...
dist-all: distdir tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__remove_distdir) # This target untars the dist file and tries a VPATH configuration. Then # it guarantees that the distribution is self-contained by making another # tarfile. distcheck: dist case '$(DIST_A...
[ -0.24045060575008392, -0.02295769192278385, 0.4467715620994568, -0.2624194622039795, 0.07383649796247482, 0.09999649226665497, 0.3170835077762604, -0.34331458806991577, -0.04546438530087471, -0.316302090883255, -0.5671554803848267, 0.8482369780540466, -0.5964890122413635, 0.208281949162483...
*.tar.Z*) \ uncompress -c $(distdir).tar.Z | $(am__untar) ;;\ *.shar.gz*) \ GZIP=$(GZIP_ENV) gunzip -c $(distdir).shar.gz | unshar ;;\ *.zip*) \ unzip $(distdir).zip ;;\ esac chmod -R a-w $(distdir); chmod a+w $(distdir) mkdir $(distdir)/_build mkdir $(distdir)/_inst chmod ...
[ -0.14909760653972626, 0.08435869216918945, 0.4550342261791229, -0.3972919285297394, 0.3101447820663452, 0.2844087779521942, 0.45128387212753296, -0.6475266218185425, -0.16767466068267822, -0.3035072386264801, -0.5808927416801453, 0.8437025547027588, -0.460083544254303, 0.07261265814304352,...
cd $(distdir)/_build \ && ../configure --srcdir=.. --prefix="$$dc_install_base" \ $(DISTCHECK_CONFIGURE_FLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) dvi \ && $(MAKE) $(AM_MAKEFLAGS) check \ && $(MAKE) $(AM_MAKEFLAGS) install \ && $(MAKE) $(AM_MAKEFLAGS) in...
[ 0.3997611701488495, 0.43135449290275574, 0.786476194858551, -0.4272462725639343, 0.428202748298645, -0.18975068628787994, 0.3086952567100525, -0.9132723212242126, -0.035265929996967316, -0.2329879105091095, -0.6076675653457642, 0.8308790922164917, -0.3505189120769501, -0.14438557624816895,...
distuninstallcheck \ && chmod -R a-w "$$dc_install_base" \ && ({ \ (cd ../.. && umask 077 && mkdir "$$dc_destdir") \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \ && $(MAKE) $(AM_MAKEFLAGS...
[ -0.14640310406684875, -0.1282687932252884, 0.7165788412094116, -0.17495155334472656, 0.03321453183889389, 0.14965468645095825, 0.4502193331718445, -0.6131337285041809, -0.044122762978076935, -0.4599553942680359, -0.46707987785339355, 0.8633570075035095, -0.19916459918022156, -0.07943819463...
distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \ } || { rm -rf "$$dc_destdir"; exit 1; }) \ && rm -rf "$$dc_destdir" \ && $(MAKE) $(AM_MAKEFLAGS) dist \ && rm -rf $(DIST_ARCHIVES) \ && $(MAKE) $(AM_MAKEFLAGS) distcleancheck $(am__remove_distdir) @(echo "$(distdir) ar...
[ -0.05471145734190941, 0.03554932400584221, 0.4771905243396759, -0.3854086697101593, 0.2787802219390869, 0.0969226062297821, 0.5410288572311401, -0.8361269235610962, -0.13557109236717224, -0.3715709149837494, -0.5915580987930298, 0.4304622411727905, -0.25458672642707825, 0.26356053352355957...
sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x' distuninstallcheck: @cd $(distuninstallcheck_dir) \ && test `$(distuninstallcheck_listfiles) | wc -l` -le 1 \ || { echo "ERROR: files left after uninstall:" ; \ if test -n "$(DESTDIR)"; then \ echo " (check DESTDIR support)"; ...
[ -0.09887630492448807, 0.033409763127565384, 0.33846670389175415, -0.23143695294857025, 0.07759133726358414, 0.1337306797504425, 0.5198753476142883, -0.6245560646057129, 0.21396221220493317, -0.5777149200439453, -0.5777218341827393, 0.605419933795929, -0.37558573484420776, 0.067832022905349...
$(distuninstallcheck_listfiles) ; \ exit 1; } >&2 distcleancheck: distclean @if test '$(srcdir)' = . ; then \ echo "ERROR: distcleancheck can only run from a VPATH build" ; \ exit 1 ; \ fi @test `$(distcleancheck_listfiles) | wc -l` -eq 0 \ || { echo "ERROR: files left in build...
[ 0.11609822511672974, 0.1373603790998459, 0.5740476250648499, -0.4622175395488739, 0.25599008798599243, 0.09975509345531464, 0.7672585248947144, -0.45884931087493896, 0.06563636660575867, -0.2706909477710724, -0.3791097104549408, 0.729901134967804, -0.27901583909988403, 0.15630298852920532,...
$(distcleancheck_listfiles) ; \ exit 1; } >&2 check-am: all-am check: check-recursive all-am: Makefile $(DATA) installdirs: installdirs-recursive installdirs-am: for dir in "$(DESTDIR)$(pkgconfigdir)"; do \ test -z "$$dir" || $(MKDIR_P) "$$dir"; \ done install: install-recursive install-exec: i...
[ 0.03735838085412979, 0.3492724299430847, 0.46863290667533875, -0.4957374930381775, 0.41251686215400696, 0.06191033869981766, 0.5867433547973633, -0.770001232624054, 0.12122367322444916, -0.423676997423172, -0.6205861568450928, 1.1537177562713623, -0.14199601113796234, -0.35698816180229187,...
echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install mostlyclean-generic: clean-generic: distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require specia...
[ 0.23312440514564514, 0.2928714156150818, 0.27247607707977295, -0.28989866375923157, -0.09235377609729767, -0.030069081112742424, 0.47896867990493774, -0.8521236777305603, -0.0031906485091894865, -0.21808993816375732, -0.6243019104003906, 0.8672676682472229, -0.20782595872879028, -0.2310439...
uninstall-pkgconfigDATA .MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) install-am \ install-strip .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \ all all-am am--refresh check check-am clean clean-generic \ clean-libtool ctags ctags-recursive dist dist-all dist-bzip2 \ dis...
[ -0.03777467831969261, -0.005037149414420128, 0.5235059857368469, -0.04006817936897278, -0.09967979788780212, 0.08052410930395126, 0.35298752784729004, -0.619924008846283, -0.15187416970729828, -0.7958836555480957, -0.6925042867660522, 0.8090394139289856, -0.4216707646846771, -0.12228153645...
install-pkgconfigDATA install-ps install-ps-am install-strip \ installcheck installcheck-am installdirs installdirs-am \ maintainer-clean maintainer-clean-generic mostlyclean \ mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ tags tags-recursive uninstall uninstall-am \ uninstall-pkgcon...
[ 0.16623403131961823, 0.08164165914058685, 0.7421907186508179, -0.06380897015333176, 0.2720530331134796, -0.40075984597206116, 0.5604465007781982, -0.1820632964372635, -0.27891507744789124, -0.717576265335083, -0.6395299434661865, 0.506068229675293, -0.2901240289211273, -0.2980872690677643,...
self-signed certificate, even if you tell Chrome to add an exception for it so that the page loads, no resources from that page will be cached, and subsequent requests will not have an If-Modified-Since header.
[ 0.16674290597438812, 0.11554687470197678, 0.3789527714252472, -0.0950271412730217, -0.02897661179304123, -0.5817103981971741, 0.47125568985939026, -0.02911100722849369, -0.32008054852485657, -0.33406952023506165, -0.24196766316890717, 0.28139832615852356, -0.05448923632502556, -0.065932855...
I'm trying to change the font color of the text on my back button in my `UINavigationControllerBar`: ``` [[UIBarButtonItem appearance] setTitleColor:[UIColor redColor] forState:UIControlStateNormal]; ``` I get this error: ```none [_UIBarItemAppearance setTitleColor:forState:]: unrecognized selector sent to instance...
[ -0.2083199918270111, 0.05154842883348465, 0.6225876808166504, -0.3318632245063782, -0.0550852008163929, 0.5208798050880432, 0.5168679356575012, -0.12844546139240265, -0.09262356162071228, -0.8248593807220459, -0.19909188151359558, 0.7010121941566467, -0.2757212221622467, -0.223815336823463...
For representing a length or count variable, is it better to use **signed** or **unsigned** integers? It seems to me that C++ STL tends to prefer *unsigned* (`std::size_t`, like in [std::vector::size()](https://learn.microsoft.com/en-us/cpp/standard-library/vector-class?view=vs-2019#size), instead C# [BCL](https://en....
[ 0.19720378518104553, -0.02837018296122551, 0.31902891397476196, 0.03947512432932854, -0.3399323523044586, 0.13747276365756989, 0.01382291316986084, -0.46554484963417053, -0.39433199167251587, -0.32692593336105347, -0.052378129214048386, 0.37759602069854736, -0.2467179149389267, -0.13842949...
have a 4 GB vector, not just a 2 GB one. (the OS might not allow you to use all 4 GB, but the language itself doesn't want to get in your way) In .NET, unsigned integers aren't CLS-compliant. You can use them (in some .NET languages), but it limits portability and compatibility. So for the base class library, they onl...
[ 0.275011271238327, -0.11059427261352539, 0.2694706320762634, 0.12109526246786118, -0.12529322504997253, -0.28217998147010803, 0.17930202186107635, -0.04394742473959923, -0.5583436489105225, -0.5523236393928528, -0.02808241732418537, 0.5553521513938904, -0.3728158175945282, -0.1936798393726...
it easier to detect underflow. Suppose you're computing an array index, and because of some bad input, or perhaps a logic error in your program, you end up trying to access index `-1`. With a signed integer, that is easy to detect. With unsigned, it would wrap around and become `UINT_MAX`. That makes it much harder to...
[ 0.21692264080047607, -0.0873551294207573, 0.30445975065231323, -0.02540113963186741, -0.18211008608341217, -0.1471937596797943, 0.11329065263271332, -0.10455190390348434, -0.3629761338233948, -0.5657157897949219, 0.03335439786314964, 0.5577667951583862, -0.3447437286376953, -0.252044081687...
work, and sometimes, signed may enable your code to detect errors more robustly.
[ 0.8543908596038818, 0.3052830398082733, -0.19898056983947754, 0.20018348097801208, 0.23862552642822266, -0.19603167474269867, 0.35650375485420227, -0.1447150707244873, -0.3986782431602478, -0.6277164816856384, -0.3768768310546875, 0.6439007520675659, 0.27390363812446594, -0.384883642196655...
My query is quite simple: ``` select a.ID, a.adres, a.place, a.postalcode from COMPANIES a, COMPANIES b where a.Postcode = b.Postcode and a.Adres = b.Adres and ( select COUNT(COMPANYID) from USERS where COMPANYID=a.ID )>( select COUNT(COMPANYID) from USERS where COMPANYID=b.ID ) ``` Databas...
[ 0.13033269345760345, 0.46653562784194946, 0.09791142493486404, 0.050996046513319016, 0.05860373377799988, 0.18062743544578552, -0.2262783646583557, -0.15700946748256683, -0.20775635540485382, -0.3129238486289978, 0.03653666377067566, 0.3741649091243744, -0.43210965394973755, 0.372949063777...
id's of the doubles) Right now it's taking a lot of time to complete. I was wondering if if could be done faster Try this version. It should be only a little faster. The `COUNT` is quite slow. I've added `a.ID <> b.ID` to avoid few cases earlier. ``` select a.ID, a.adres, a.place, a.postalcode from COMPANIES a INN...
[ 0.402276873588562, 0.37550362944602966, 0.6145979762077332, -0.18223930895328522, -0.019517775624990463, 0.31835323572158813, -0.11342271417379379, -0.63704514503479, -0.1434875875711441, -0.6335054039955139, 0.0642821341753006, 0.31297025084495544, -0.5464204549789429, -0.0343298427760601...
...` is a preferred SQL construct to join tables. It may be faster too.
[ 0.2611760199069977, 0.24831834435462952, 0.12951834499835968, 0.21461138129234314, -0.34720268845558167, -0.35028916597366333, 0.11189833283424377, 0.05456208437681198, -0.10647905617952347, -0.5927711725234985, -0.12661699950695038, 0.16524052619934082, -0.31353503465652466, 0.09176046401...
I have gotten a code from php.net. <http://php.net/manual/en/book.mcrypt.php> Problem is when you encrypt something, the next time the ecrypted one isn't the same as the first one. I need to get the exact same hash using sha512 or sha256. I also need to decrypt it because the function will be used for encrypting custo...
[ 0.30624330043792725, 0.21744979918003082, 0.3230392038822174, 0.12260299921035767, -0.09868703037500381, -0.0561087466776371, 0.4019377529621124, 0.09705134481191635, -0.16177332401275635, -0.46154049038887024, 0.2860458493232727, 0.29939237236976624, 0.0953136682510376, 0.2034921497106552...
a list of unused values and applying them in turn at the places where duplicates were found. Tempting as it may be to use a C++ `List`, if speed is of the essence a simple C array is the most efficient. This program show the principle. ``` #include <iostream> #include <cstring> using namespace std; int main() { ...
[ 0.01612807810306549, 0.15849807858467102, 0.36493101716041565, -0.1923564076423645, 0.38881438970565796, 0.33839499950408936, 0.26561814546585083, -0.49234551191329956, -0.5023534297943115, -0.3378410339355469, -0.2574699819087982, 0.4027862846851349, -0.598951518535614, -0.064641326665878...
indices of duplicate data for (int i = 0; i < N; i++) { if (tally[data[i]]++) { dup_indices[ndups++] = i; } } // Replace each duplicate with the next value having a zero count int t = 0; for (int i = 0; i < ndups; i++) { while (tally[t]) t++; data[dup_indices[i]] = t++; } for (int ...
[ 0.1450837403535843, 0.10796421766281128, 0.2373379021883011, 0.13748222589492798, 0.02066987007856369, 0.39062488079071045, 0.15427322685718536, -0.3402128219604492, -0.2628200948238373, -0.5823709964752197, 0.07981123775243759, 0.34362491965293884, -0.6145533323287964, 0.23707953095436096...
return 0; } ``` **output** ``` 10 4 5 7 0 9 1 2 8 3 6 ```
[ -0.1802091896533966, 0.4630752205848694, 0.1747080385684967, -0.3137229084968567, 0.1567876785993576, 0.16290611028671265, 0.26005876064300537, -0.12034466862678528, 0.14760403335094452, -0.3307822048664093, -0.4911389946937561, 0.5946704745292664, -0.26924023032188416, 0.12790769338607788...
The problem of how to handle dates in JSON is one of the more troublesome issues that may arise when directly calling ASP.NET AJAX web services and page methods. Unlike every other data type in the language, JavaScript offers no declarative method for expressing a Date. Consequently, embedding them within JSON requires...
[ 0.15584370493888855, 0.26268652081489563, 0.13288895785808563, 0.0808069035410881, -0.32631081342697144, -0.2621428370475769, 0.26037734746932983, 0.12904350459575653, -0.10140843689441681, -0.556262195110321, -0.14869306981563568, 0.1716657131910324, -0.21981534361839294, -0.3136789202690...
are literals? To illustrate, these are literals for several other data types: ``` // String 'foo'; // Number 3.14; // Boolean true; // Array [1, 2, 3, 5, 7]; // Object { pi: 3.14, phi: 1.62 }; ``` Unfortunately, when it comes to dates, the lack of a literal means that the only way to create one is by explicitly ...
[ 0.38903704285621643, 0.13188008964061737, 0.5876291394233704, -0.06750857084989548, -0.15294811129570007, -0.04365263879299164, 0.20329613983631134, -0.09285631030797958, -0.07702939957380295, -0.16440539062023163, -0.12064602226018906, 0.30506038665771484, -0.2887987494468689, 0.239508181...
is a problem, Can Somebody Suggest a Solution. Consider why you want to send a DateTime to the client-side to begin with. Most often, you’re displaying a string representation of it and have no need for the proper JavaScript Date object. What’s more, if you end up with a JavaScript Date object, you’ll probably use addi...
[ 0.25553861260414124, 0.06090361997485161, 0.12560229003429413, 0.12473925948143005, 0.031492121517658234, -0.14140786230564117, -0.05549708753824234, 0.3401988744735718, -0.32460859417915344, -0.6130316853523254, -0.09390855580568314, 0.4979715943336487, -0.3892297148704529, 0.029586039483...
it, I suggest simply returning a formatted string. For example, ``` [System.Web.Script.Services.ScriptService] public class DateService : System.Web.Services.WebService { [WebMethod] public string GetDate() { return new DateTime(2009, 4, 26).ToLongDateString(); } } ``` Now, calling the service will return this JSON:...
[ 0.19196709990501404, -0.16194920241832733, 0.7464142441749573, -0.12041571736335754, -0.011722298339009285, -0.13167360424995422, 0.16932854056358337, 0.1595984548330307, -0.18311850726604462, -0.5323073267936707, -0.17226538062095642, 0.40172114968299866, -0.11831054091453552, 0.339392423...
MongoDB has support for atomic updates. I.e. I can be sure that when a document is updated no other update will overwrite my previous change. My question relates to the combination of query and update statement, and is best illustrated by the example shown below. ``` db.foo.update( { state : 1, players: { $size: 2 } }...
[ -0.054262008517980576, -0.16184459626674652, 0.1564301997423172, -0.20614854991436005, 0.041086405515670776, -0.14174297451972961, 0.17847444117069244, -0.23301218450069427, -0.4372399151325226, -0.5230045914649963, 0.2332751452922821, 0.8403045535087585, -0.5680757761001587, 0.08770665526...
statement, is it possible that two simultaneous updates both push a player onto the same document, because at the time of reading the document its players $size is 2? I.e. does the atomicity span across the query and update part of the update statement or not? **Edit** More in-depth sequence of events: Consider firin...
[ -0.1821526288986206, -0.045481834560632706, 0.28368473052978516, -0.2026856541633606, 0.008978205733001232, 0.16772694885730743, 0.23199886083602905, -0.6171057820320129, -0.5152055025100708, -0.19460269808769226, -0.08665160089731216, 0.5522282123565674, -0.4532286822795868, -0.1227462738...
player in document #1. 4. U2 pushes a new player in document #1. The end result is that document #1 contains one more player than expected, because both U1 and U2 were under the impression that document #1 contains only two players. I've asked this question on the mongodb-user group. <http://groups.google.com/group/mo...
[ -0.5266253352165222, -0.11532063782215118, 0.4524247646331787, -0.10936451703310013, 0.0035556484945118427, -0.1319577395915985, -0.11168777197599411, -0.4623473286628723, -0.5953447818756104, -0.6794866323471069, 0.027558190748095512, 0.584346354007721, -0.5887501239776611, 0.209310501813...
I used `android:inputType = "phone"` to take phone number as input, but if i give six digits it takes otherwise force close and fires the error that > "NumberFormat exception not valid int value" Actually i'm trying to convert that value to integer through: ``` phone = Integer.parseInt(phoneNumber.getText().toStrin...
[ 0.376391738653183, 0.30214211344718933, 0.2821110785007477, -0.2139786183834076, 0.2519374191761017, 0.27949994802474976, 0.20032982528209686, -0.4212260842323303, -0.048612501472234726, -0.41667553782463074, 0.06685886532068253, 1.0884811878204346, -0.1883712261915207, -0.0435427054762840...
I can't add android sdk to eclipse.I download android sdk and i can't see anything in red circle area on picture which is below. ![enter image description here](https://i.stack.imgur.com/ufK5s.png) Install the ADT from the Site, just give .zip file name to Work With: Option. And ya it is done. ![enter image descript...
[ 0.6014585494995117, 0.2021247297525406, 0.39150387048721313, -0.22893865406513214, -0.32320788502693176, -0.16904182732105255, 0.44264668226242065, -0.26599690318107605, -0.05243499577045441, -0.8825290203094482, -0.13376688957214355, 0.7228997349739075, -0.25368303060531616, 0.01714703440...
My problem is, that I want to make a rule for splitting a list to several lists, containing only 3 items from the original, in order. For example: ``` /*original list:*/ Fruits=[apple,banana,orange,pear, lemon, melon] ?-Split(Fruits). /*results:*/ [apple,banana,orange]; [banana,orange,pear]; [orange,pear,lemon]; ...
[ -0.13782887160778046, 0.08019473403692245, 0.10659299790859222, -0.23815582692623138, 0.15367212891578674, 0.20765139162540436, 0.10069125890731812, -0.21901915967464447, -0.43321049213409424, -0.5880613327026367, -0.21740348637104034, 0.3027374744415283, -0.3201257586479187, 0.07707317918...
I have a file: ``` AA BB CC DD BB CC DD AA BB CC DDA AA CC DD AA BB ``` This command prints the line: ``` $ awk '{if($3=="DD") print}' file BB CC DD AA ``` I want this condition to write to the array. This command does not work: ``` $ awk '{if($3=="DD") split($0, a, RS); print a[1]}' file BB CC DD AA BB CC DD...
[ 0.6441910862922668, 0.157480850815773, 0.43160557746887207, -0.13191500306129456, -0.37399327754974365, 0.06795018911361694, 0.4781632125377655, -0.2734856605529785, 0.0228818841278553, -0.6454728841781616, 0.22744743525981903, 0.49020397663116455, -0.4530666768550873, 0.3258216083049774, ...
UITableViewDataSource call [`tableView:canMoveRowAtIndexPath:`](http://developer.apple.com/library/ios/documentation/uikit/reference/UITableViewDataSource_Protocol/Reference/Reference.html#//apple_ref/doc/uid/TP40006941-CH3-SW30) Like this: ``` - (BOOL)tableView:(UITableView *)tableView canMoveRowAtIndexPath:(NSIndex...
[ -0.2194773256778717, 0.020868118852376938, 0.6532709002494812, -0.17095714807510376, -0.018776308745145798, -0.07337164878845215, 0.1767200380563736, -0.35611701011657715, -0.1394859254360199, -0.7238508462905884, -0.20611579716205597, 0.1832282990217209, -0.1572328805923462, 0.01909439265...
i need to make a layout that is scrollable, holds a listview that is not scrollable(full height of the content). So when i scroll the content above the listview is showed, and the full listview is displayed. Is this possible in android? It doesn't matter which generator you use as long as the grammar describes the lan...
[ 0.43136292695999146, 0.037022240459918976, 0.383839875459671, -0.13570763170719147, -0.10035250335931778, 0.1520904302597046, 0.14900921285152435, -0.0892212986946106, -0.07928434759378433, -0.8944475650787354, -0.17081253230571747, 0.6734609007835388, -0.1235789880156517, -0.2554723024368...
I m trying to show Autocomplete results. Here is the data that my script returns when I query it using a GET request For example when I query it "fb" It returns me the following data ``` "fb" "fbi" "fbi most wanted" "fbi jobs" "fb banners" "fbook" "fb covers" "fbanners" "fbisd" "fbop" ``` Here's the co...
[ 0.19365879893302917, -0.04428102448582649, 0.5295237302780151, -0.1430591493844986, 0.008726518601179123, 0.11773556470870972, 0.37106114625930786, -0.029624853283166885, -0.029175806790590286, -0.7033315896987915, -0.377811074256897, 0.86753249168396, -0.5848250389099121, -0.3773204982280...
url: "q.php", dataType: "json", data: { "q" : request.term }, success: function( data ) {
[ -0.24738846719264984, -0.031200794503092766, 0.4852792024612427, 0.16004832088947296, -0.08198827505111694, 0.25910666584968567, 0.2718696594238281, 0.1793554127216339, 0.0639198049902916, -0.10655461251735687, -0.4972244203090668, 0.503578245639801, 0.07901483029127121, 0.3624950349330902...
response(data[1]) } }); }, minLength: 2 }); ``` It doesnt show me any result. Can anyone tell me where am I going wrong here! You have to pass the types of your Java function too. Writing it like this works: ``` package XXXXX.client; import com.google.gwt.core.client....
[ -0.23643454909324646, -0.12041361629962921, 0.3794513940811157, -0.11773544549942017, -0.11925607174634933, 0.03231671079993248, 0.5460381507873535, -0.4066719710826874, 0.04781338945031166, -0.6512851715087891, -0.145346537232399, 0.34418344497680664, -0.3599889576435089, -0.0249005071818...
public void onModuleLoad() { drawJSChart(); } public String getNameToShow() { return "Chart number 1"; } public native void drawJSChart() /*-{ try { //First create a script where to paste the jsData var scriptID = this
[ 0.09887789189815521, -0.4120877683162689, 0.486819863319397, -0.15587157011032104, 0.11255564540624619, 0.18046128749847412, 0.3425489366054535, 0.02384745143353939, -0.03162427991628647, -0.8823928236961365, -0.07813658565282822, 0.46410149335861206, -0.49663376808166504, -0.0172833949327...
.@XXXXX.client._24_TestJSNIMethodCallback::getNameToShow()(); $wnd.alert(scriptID); //Some code } catch (e) { console.error(e.message); } }-*/; } ```
[ 0.10907378792762756, -0.03519042581319809, 0.21600276231765747, -0.08954358100891113, 0.2650671601295471, -0.11324376612901688, 0.5986152291297913, -0.13434180617332458, 0.016573959961533546, -0.7688969969749451, -0.31370678544044495, 0.5369487404823303, -0.3183254897594452, 0.252995908260...
I have SQL Server 2008 R2 and one of my tables has a date field. When an insert from my ASP.NET page happens, the date is automatically inserted by setting the default field value to `getdate()`. However, this adds the date in the format `YYYY-MM-DD HH:MM:SS.0000000`. I really only need the time up to seconds and not t...
[ -0.05077977851033211, 0.0021168128587305546, 0.5924235582351685, -0.05369897186756134, -0.09891145676374435, -0.20233021676540375, 0.06215507537126541, 0.03141692280769348, -0.19238407909870148, -0.5810461640357971, 0.039175670593976974, 0.4218370020389557, -0.011597426608204842, 0.2112562...
Is possible with Hibernate do this? ```sql select A.something, B.something, C.something, D.something , E.* from A LEFT OUTER JOIN B on A.id = B.id_fk LEFT OUTER JOIN C ON B.id = C.id_fk LEFT OUTER JOIN D ON C.id = D.id_fk LEFT OUTER JOIN E ON A.abc = E.abc; ``` This query w...
[ 0.13170434534549713, 0.0449739471077919, 0.4648929536342621, -0.10280553251504898, -0.13242565095424652, -0.03931000083684921, 0.5790567398071289, -0.43678584694862366, -0.02928372286260128, -0.6322231888771057, -0.2467591017484665, 0.259976863861084, -0.3536053001880646, -0.00663972087204...
line 1 ``` you don't need the "\*". hibernate is turning objects , \* is meaningless as its for pointing the columns in SQL. When you want the E , it turns the E object. > SELECT E FROM E this is the HQL for `SELECT * FROM E` even "FROM E" works , when you're calling session.createQuery() .
[ 0.08648859709501266, -0.10114672034978867, 0.4860750734806061, -0.07933912426233292, -0.27252763509750366, -0.31421834230422974, 0.13496793806552887, 0.09435952454805374, 0.0011983186705037951, -0.46217915415763855, -0.2824184000492096, 0.24645167589187622, -0.5038266181945801, 0.058115039...
I am using `Asp.Net/C#` and `Visual Studio 2008` to build an application.Right now I want to create a login page for my application , I would like to ask you guys , what would be the best approach to it.Should I go with `Forms Authentication in Asp.Net` or Should I try looking at `Ajax Login` with `Asp.Net`.Which would...
[ 0.6455134749412537, 0.23021212220191956, 0.234765887260437, 0.25277385115623474, -0.08488982170820236, -0.37216314673423767, 0.04560499265789986, 0.1039397120475769, -0.2523028254508972, -0.8272205591201782, 0.2804976999759674, 0.3848312199115753, 0.22209422290325165, -0.12479373067617416,...
advantages of it. ``` 1) users do not have to be member of a domain-based network to have access to your application. 2) Web applications, particularly commercial sites where customers order products, want to have access to user information. Forms authentication makes these types of applications easier to create. 3) ...
[ 0.14922451972961426, 0.03351861238479614, 0.4817620813846588, 0.18113134801387787, 0.18990576267242432, -0.5674061179161072, -0.1994127780199051, -0.47791990637779236, -0.06324335932731628, -0.8864794969558716, 0.040465306490659714, 0.7931206226348877, 0.007099411450326443, -0.228768706321...
authentication mode in Web.config to Forms. 2.Create a Web form to collect logon information. 3.Create a file or database to store user names and passwords. 4.Write code to add new users to the user file or database. 5.Write code to authenticate users against the user file or database. ``` Hope this info is helpful t...
[ 0.14904849231243134, 0.07804382592439651, 0.6019595861434937, -0.0478079579770565, -0.006375891622155905, -0.5037515759468079, 0.49082088470458984, -0.49201783537864685, 0.041312236338853836, -0.358812153339386, -0.09247596561908722, 0.4459003806114197, -0.24725332856178284, -0.41443085670...
Consider: ``` <?php define('my_const', 100); echo <<<MYECHO <p>The value of my_const is {my_const}.</p> MYECHO; ?> ``` If I put a variable inside the braces, it prints out. But not the constant. How can I do it? Use [sprintf()](http://php.net/manual/en/function.sprintf.php) ``` define('my_const', 100); ...
[ -0.029180951416492462, 0.14986716210842133, 0.2103397101163864, -0.4998767077922821, -0.04127340018749237, 0.43694064021110535, 0.3321441113948822, -0.37228381633758545, 0.02542148344218731, -0.37084415555000305, -0.10730449110269547, 0.4149630665779114, -0.5188246965408325, -0.27707880735...
``` class C{ static int f1(int i) { System.out.print(i + ","); return 0; } public static void main (String[] args) { int i = 0; i = i++ + f1(i); System.out.print(i); } } ``` how come the answer is 1,0. Please explain. ``` i = i++ + f1(i); ``` first i is incre...
[ -0.11577698588371277, 0.2404840737581253, 0.3041597008705139, -0.31281888484954834, 0.14074409008026123, 0.18627874553203583, 0.17628559470176697, -0.22126446664333344, -0.19992148876190186, -0.2992177903652191, -0.6017976403236389, 0.5995554327964783, -0.540622353553772, 0.277688235044479...
**i ,** which prints **1 ,** and returns 0 which stores in **i** of main method by calculating **0 + 0** and you print it in main so the output becomes **1, 0**
[ -0.36995452642440796, 0.0006812950596213341, 0.34539660811424255, 0.0018937146523967385, 0.019560163840651512, 0.3517841100692749, 0.0982372984290123, -0.27002137899398804, 0.005673495586961508, -0.3125923275947571, -0.1008894294500351, 0.13224315643310547, -0.24977318942546844, 0.20698879...
I have the following three arrays and need to create a new two-dimensional array where the keys match. ``` Array ( [0] => Item 0 [1] => Item 1 [2] => Item 2 [3] => Item 3 Array ( [0] => £35.00 [1] => £60.00 [2] => £24.00 [3] => £79.00 ) Array ( [0] => 2 [1] => 1 [2] => 1 ...
[ -0.21348263323307037, 0.22444021701812744, 0.8375793695449829, -0.4445786774158478, -0.28247255086898804, 0.4526292681694031, 0.3653397560119629, -0.8600351214408875, -0.38052383065223694, -0.5177029371261597, -0.07788761705160141, 0.5432894229888916, -0.20577047765254974, 0.45321238040924...
= Array( Array("Item 0", "£35.00" , 2), Array("Item 1", "£60.00" , 1), Array("Item 2", "£24.00" , 1), Array("Item 3", "£79.00" , 1) ); ``` I've tried using array\_merge, array\_merge\_recursive, array\_combine, $array1+$array2+$array3 but none of them seem to do w...
[ 0.31840643286705017, 0.2856685519218445, 0.48505473136901855, -0.4666077792644501, -0.10650885850191116, 0.4642582833766937, 0.461753249168396, -0.558323085308075, -0.08083563297986984, -0.3327490985393524, -0.24090303480625153, 0.35224711894989014, -0.27402153611183167, 0.0300862547010183...
are the same length, you can use [`array_map`*­Docs*](http://php.net/array_map) with `null` as callback ``` print_r(array_map(null, $array1, $array2, $array3 )); ```
[ 0.13684840500354767, -0.0653231143951416, 0.34783363342285156, -0.45296046137809753, -0.12171808630228043, -0.08691244572401047, 0.038682881742715836, -0.4037918448448181, -0.46734073758125305, -0.3789782226085663, -0.18056099116802216, 0.5459902882575989, -0.3219238221645355, -0.063794769...
I have an scroll view in my app that works well in my emulator but not working in android device..... my app developed with `minsdkversion:8`...I deployed my app in **android 2.2** My layout is below ``` <?xml version="1.0" encoding="utf-8"?> <ScrollView xmlns:android="http://schemas.android.com/apk/res/android" a...
[ -0.141209676861763, 0.09138394892215729, 0.7759193181991577, -0.2993434965610504, 0.016975026577711105, 0.4275214374065399, 0.1662663221359253, -0.432931512594223, 0.012957535684108734, -0.7424333691596985, -0.15330111980438232, 0.42549991607666016, 0.16197912395000458, 0.03638530150055885...
android:layout_height="wrap_content" android:layout_width="wrap_content" android:text="Ok1" android:ems="5"> </Button> </LinearLayout> </ScrollView> ``` Plz give a solution..Thanks > ``` > <xsl:if test=".[foo or @bar]"> > something > </xsl:if> > > ``` **In XSLT 1.0 this is syntacticall...
[ -0.5178254246711731, 0.10635082423686981, 0.6880707740783691, -0.27735409140586853, 0.19573348760604858, 0.45577868819236755, 0.3461909294128418, -0.5468299388885498, 0.15313144028186798, -0.844175398349762, -0.43730396032333374, 0.40240341424942017, -0.3592568337917328, -0.171815901994705...
attribute named `bar` (or both). Otherwise this expression evaluates to `false()`. Therefore, the above code snippet means: *If either of these conditions is true: the current node has a child element named `foo` or the current node has an attribute named `bar` -- then output the string "something"*
[ 0.12812188267707825, 0.20328131318092346, 0.21042802929878235, -0.4447271525859833, 0.2757468819618225, 0.10483404248952866, 0.21250371634960175, 0.05793263018131256, 0.04298112541437149, -0.3129505515098572, -0.25173553824424744, 0.3155842423439026, -0.15638467669487, 0.37439650297164917,...
I'm using md5 to encrypt the user's password in my database, and I want them to get their password back when they forget by sending them email. The problem is I don't know how to write PHP code to recover it back. Any answer, or appropriate link would be very much appreciated. Thanks.. This cannot be done1 MD5 is a [...
[ -0.05482711270451546, 0.07986006885766983, 0.19457146525382996, -0.12475836277008057, -0.22938553988933563, -0.2692375183105469, 0.3553903102874756, -0.07997433096170425, -0.380937397480011, -0.5075367093086243, -0.09679382294416428, 0.3985758423805237, -0.21105127036571503, 0.378939539194...
*original one*. This is what "cracking" a password does - it finds one such input that, when hashed, results in the particular output. (And I will provide no more help down this road.)
[ -0.05101059377193451, 0.013285382650792599, -0.061984796077013016, 0.2541047930717468, 0.24600186944007874, -0.13485369086265564, 0.07382877916097641, 0.17891809344291687, -0.1385193169116974, -0.41029608249664307, -0.3298678696155548, 0.37747105956077576, -0.15401682257652283, 0.179807156...
I'm looking for a Java library to create block diagrams, which might look as in the picture: ![enter image description here](https://i.stack.imgur.com/BjykE.png) So far I couldn't find a satisfying solution. I would be thankful for any suggestions. There's a [Java API for GraphViz](http://www.loria.fr/~szathmar/off/...
[ 0.35466012358665466, -0.12951365113258362, 0.5415067076683044, 0.1910736858844757, -0.15895964205265045, 0.10606718808412552, 0.19872039556503296, 0.13364411890506744, -0.6101936101913452, -0.6511405110359192, 0.18191610276699066, 0.21440929174423218, -0.08781924843788147, 0.21844910085201...
I want to achieve such an interface using WPF groupbox control ![enter image description here](https://i.stack.imgur.com/WIXO5.png) Is there a way to achieve such an interface with WPF groupbox control? Dataphor's D4 is said to be pretty close (sole major error being the introduction of a null-like construct that the...
[ 0.541888415813446, -0.22324451804161072, 0.3155510723590851, -0.10869912058115005, -0.1584852635860443, -0.12226760387420654, 0.23603525757789612, -0.34887802600860596, -0.16135065257549286, -0.3651718497276306, 0.022371189668774605, 0.3084181547164917, -0.20372267067432404, -0.05538679659...
As disgussed in [.NET Reflection set private property](https://stackoverflow.com/questions/1778405/net-reflection-set-private-property) one can set a property with a private setter. But when the property is defined in a base class, System.ArgumentException is thrown : "Property set method not found". An example can be...
[ 0.2824068069458008, -0.5121968388557434, 0.2132299393415451, 0.051874082535505295, 0.11424234509468079, -0.018172452226281166, 0.10063605010509491, -0.34514379501342773, -0.12157566845417023, -0.36915233731269836, -0.2807767987251282, 0.34852153062820435, -0.1940474808216095, 0.50829392671...
null); Console.WriteLine(p.ModifiedOn); } } ``` Does anyone know a way to tackle this situation? **Edit:** The example given is a simple illustration of the problem. In the real world scenario, I do not know if the property is defined in a base class, or defined in the base of the base class. I had a sim...
[ 0.26094764471054077, -0.33768516778945923, 0.08725332468748093, 0.011208674870431423, 0.23210115730762482, -0.1379137635231018, 0.17746877670288086, -0.293546199798584, -0.07026543468236923, -0.5929988026618958, 0.04494062066078186, 0.45394062995910645, -0.12193063646554947, 0.371497929096...
: Test { } static class Program { static void Main() { Derived p = new Derived (); PropertyInfo property = p.GetType().GetProperty("ModifiedOn"); PropertyInfo goodProperty = property.DeclaringType.GetProperty("ModifiedOn"); goodProperty.SetValue(p, DateTime.Today, null); ...
[ 0.3000301420688629, -0.2546970248222351, 0.12808635830879211, -0.14114902913570404, 0.1704111248254776, 0.12730315327644348, 0.4840134084224701, -0.4009452760219574, 0.17272555828094482, -0.37267541885375977, -0.48057448863983154, 0.3769097924232483, -0.21820969879627228, 0.564319610595703...
I have a Java socket server program listening on a specific port. When receiving data from GPS Trackers (TCP/IP): 1. treate data 2. insert data into a small database I want to make this program work robustly during a long period... how ? (web services, .. ?) Thanks. I had a similar problem where my private property ...
[ 0.5014764070510864, -0.18018700182437897, 0.025392528623342514, -0.10441891849040985, 0.202186718583107, -0.05008001625537872, 0.4896339476108551, -0.2122894674539566, 0.16504907608032227, -0.60444575548172, 0.07157913595438004, 0.4151603579521179, -0.33100423216819763, 0.3945721387863159,...
Derived p = new Derived (); PropertyInfo property = p.GetType().GetProperty("ModifiedOn"); PropertyInfo goodProperty = property.DeclaringType.GetProperty("ModifiedOn"); goodProperty.SetValue(p, DateTime.Today, null); Console.WriteLine(p.ModifiedOn); } } ```
[ 0.08371409773826599, -0.27045223116874695, 0.5904352068901062, -0.2839832305908203, 0.34621766209602356, 0.07883694767951965, 0.22429028153419495, -0.6748118996620178, 0.14220747351646423, -0.39623069763183594, -0.45493438839912415, 0.5696089267730713, -0.12019690871238708, 0.4657034575939...
I am reading `javascript` web application and the author is using following code: ``` mod.load = function(func){ $($.proxy(func, this)); }; ``` Can someone help me to understand why returning function from `jQuery.proxy` is inside `jQuery` wrapper. Is this the same as: ``` mod.load = function(func){ var t...
[ 0.19854217767715454, 0.11988186091184616, 0.3277128338813782, -0.14650331437587738, -0.269023060798645, -0.12641176581382751, 0.1973111778497696, -0.24129152297973633, -0.13076794147491455, -0.7486048936843872, -0.22114895284175873, 0.4371664822101593, -0.36345067620277405, 0.1747448742389...
i have made a installer with installshield 2008 . main problem is , while installation through setup.exe , command prompt appears several time in this procedure. for convenience of end user i need to remove command prompt during installation. i read in previous threads i can call my batch file through a vbscript as a...
[ 0.1338270902633667, 0.1533598154783249, 0.5015354156494141, -0.22302937507629395, -0.19479285180568695, -0.12939555943012238, 0.4428461790084839, -0.022122783586382866, -0.03306084871292114, -0.8727821111679077, 0.15011414885520935, 0.6815383434295654, -0.4892056882381439, 0.31663087010383...
how can i include this vbsript in installshield or , an They are not the same but they have the same effect. Your second example executes the returned function directly while jQuery(function) binds it to the onload like `$(document).ready()`. mod.load probably *is* the onload however, so this makes no difference. S...
[ 0.4775957465171814, -0.3504634499549866, 0.44463977217674255, 0.028593221679329872, -0.14217256009578705, -0.36870893836021423, 0.03382100164890289, -0.4125482738018036, -0.13142657279968262, -0.5594537854194641, -0.039715468883514404, 0.7091575860977173, -0.27861636877059937, 0.0632572025...
I'm trying to embed a font, the problem is that it is just displayed in Firefox but not with Internet Explorer. ``` @font-face { font-family: capture_it; src: url('fonts/Capture_it.eot'); src: local('Comfortaa_it'), url('fonts/Capture_it.ttf') format('truetype'); } ``` Any help is very appreciated. Thanks, en...
[ 0.1782151311635971, 0.3748694360256195, 0.5433906316757202, -0.23600628972053528, -0.21323218941688538, 0.055974140763282776, 0.23320363461971283, -0.15576352179050446, 0.050999801605939865, -0.988125741481781, -0.14457914233207703, 0.6139558553695679, -0.3456723392009735, -0.1212046891450...
url('webfont.ttf') format('truetype'), /* Safari, Android, iOS */ url('webfont.svg#svgFontName') format('svg'); /* Legacy iOS */ } ```
[ 0.3844093978404999, 0.20899976789951324, 0.7059475779533386, -0.06362226605415344, 0.11054328829050064, -0.09912347048521042, 0.11949831247329712, 0.24292489886283875, -0.23734736442565918, -0.45846256613731384, -0.7048060297966003, 0.42544320225715637, -0.4008709192276001, 0.1804162561893...
How i can port this set of code in wp7 ``` -(NSString *) timeSincePosted:(NSString *)ad_date { if (!ad_date || ([ad_date compare:@""] == NSOrderedSame) || ([ad_date rangeOfString:@"-"].location == NSNotFound)) return @""; // date format //2010-04-22, 5:27PM EDT NSDateFormatter *dateFormatter_CL = [[[NSDateFormat...
[ -0.005397111177444458, -0.10898289829492569, 0.7088755369186401, -0.20579946041107178, 0.4448971152305603, 0.3743671178817749, 0.4237228333950043, -0.38720738887786865, -0.21815043687820435, -1.0005558729171753, -0.16591158509254456, 0.46613746881484985, -0.0452582873404026, 0.273958206176...
stringWithString:@"1 hr"]; if (deltaHr < 24) return [NSString stringWithFormat:@"%d hrs", deltaHr]; if (deltaDay < 2) return [NSString stringWithString:@"1 day ago"]; return [NSString stringWithFormat:@"%d days ago", deltaDay]; } ``` The Objective C code first parses date and time from a string and then turns it into ...
[ -0.016205713152885437, -0.007055258844047785, 0.3811561167240143, -0.2157842218875885, 0.22487111389636993, 0.14246635138988495, 0.18104016780853271, -0.217735156416893, -0.07926804572343826, -0.4229018986225128, -0.04413226991891861, 0.5057162642478943, -0.32275983691215515, 0.13957248628...
For example: I have an implementation (say doSomething()) in Base class. I want all the Derived classes to use only this implementation, and not to override the base class implementation. How can I force this behavior in C++? If you only want to implement it in the base class, then don't declare it `virtual`, and ...
[ 0.27725937962532043, -0.17701518535614014, 0.26066407561302185, -0.2660105228424072, 0.012030651792883873, -0.38614511489868164, 0.2975793778896332, -0.23067013919353485, -0.23108050227165222, -0.42184263467788696, -0.20059506595134735, 0.8135695457458496, -0.4928276538848877, 0.1942330300...
^^^^^ ``` In C++03 and earlier, you can't; that's why it was added to C++11.
[ 0.09623369574546814, 0.3120127022266388, 0.3435996174812317, -0.1600533425807953, 0.004839986562728882, -0.5834226012229919, 0.23343463242053986, 0.2079324871301651, -0.12357135117053986, -0.31779104471206665, -0.49568745493888855, 0.6740853786468506, -0.27247360348701477, -0.0810573101043...
What is a correct way to update model when view changed. Is it need to do in a view or in some other place like controller or so? for example I have a model (model1) and some view (View1) associated with this model. I need to update model when I change some fields on the view. Which is correct way to do that? Also, ...
[ -0.06701162457466125, -0.36968326568603516, 0.29946818947792053, 0.4092670977115631, 0.023882921785116196, 0.12085793912410736, -0.13581497967243195, -0.27525436878204346, -0.43750596046447754, -0.5328052043914795, 0.2248205542564392, 0.574974000453949, -0.13915586471557617, 0.204057306051...
how it should be done? There is interesting approach of MVC theory, applied to MVC... Look here for more explaination what is controller in Backbone <http://lostechies.com/derickbailey/2011/12/23/backbone-js-is-not-an-mvc-framework/> written by @derick-bailey In general summary, Bailey says that there are no contr...
[ 0.2541198432445526, -0.2263997495174408, 0.18519775569438934, 0.1776304692029953, 0.09142805635929108, -0.30236560106277466, 0.14351852238178253, -0.2249380201101303, -0.6283302307128906, -0.34823212027549744, 0.20627140998840332, 0.24999457597732544, -0.27977263927459717, 0.40948563814163...
model3]; And when View1 changes model1, then model1 triggers an event to View2.collection, which you can listen.
[ -0.19601275026798248, -0.4665083885192871, 0.2372189611196518, 0.06378369778394699, 0.10786755383014679, 0.12272871285676956, 0.14926643669605255, -0.3696203827857971, -0.4469744563102722, -0.4571446180343628, -0.022248325869441032, 0.5162244439125061, -0.46065863966941833, 0.2756857275962...
I've been trying to get gmaps4rails working for hours. I think it's the load order, I even tried cloning a demo app using rails 3.2 and ruby 1.9.3-- still showing a blank map with no markers. My JSON is correct from the model. Project: <https://github.com/apneadiving/Google-Maps-for-Rails> **-- application.html.erb ...
[ 0.19059240818023682, 0.09790614247322083, 0.3886927366256714, 0.21067887544631958, -0.16978269815444946, 0.2232511192560196, 0.48212483525276184, -0.3278388977050781, -0.17701098322868347, -0.9317673444747925, -0.13741303980350494, 0.8131020665168762, -0.15594065189361572, -0.2689966857433...
require twitter/bootstrap //= require gmaps4rails/gmaps4rails.base //= require gmaps4rails/gmaps4rails.googlemaps //= require_tree . ``` **-- user.rb** acts\_as\_gmappable def gmaps4rails\_address "#{self.address}, #{self.city}" end **-- schema** ``` create_table "users", :force => true do |t| t.string ...
[ 0.11504513025283813, -0.1435408592224121, 0.8754726052284241, 0.24901248514652252, 0.13216286897659302, -0.022226380184292793, 0.5717280507087708, -0.531125009059906, -0.1202264055609703, -0.7315917015075684, -0.45223742723464966, 0.46385350823402405, -0.5203145742416382, -0.16363257169723...
|format| format.html # index.html.erb format.json { render json: @users } end ``` end \**-- my view \** ``` <%= gmaps4rails(@json) %> <%= @json %> ``` \**-- my json printed from the view \** ``` [{"lat":37.7381599,"lng":-122.3803166},{"lat":37.5121003,"lng":-122.2009814},{"lat":33.9964092,"lng":-118.4725106}...
[ 0.25548210740089417, 0.2197825163602829, 0.15855127573013306, -0.013665974140167236, 0.24157539010047913, 0.02188529632985592, 0.3197043836116791, -0.12543587386608124, -0.12192367762327194, -0.665953516960144, -0.24648872017860413, 0.6764909625053406, 0.1662125438451767, -0.20044441521167...
i am writing code for login application. can anyone help me how to parse a json string? my code is ``` -(void)connectionDidFinishLoading:(NSURLConnection *)connection { NSString *loginStatus = [[NSString alloc] initWithBytes: [webData mutableBytes] length:[webData length] encoding:NSUTF8StringEncoding]; SBJs...
[ 0.12193501740694046, 0.29960691928863525, 0.37498408555984497, -0.22671520709991455, 0.09618712961673737, 0.13942496478557587, 0.7703341841697693, -0.16919033229351044, -0.04074273258447647, -0.7230044007301331, -0.3321129083633423, 0.40361958742141724, -0.4377104341983795, -0.011580453254...
{ age = 12; name = Jerry; }; 2 = { age = 16; name = Bob; }; } ```
[ 0.22417056560516357, 0.2890886664390564, 0.1751888245344162, -0.3080140948295593, 0.43248307704925537, 0.08534473925828934, 0.6079506278038025, 0.019099785014986992, -0.3674273192882538, -0.06623237580060959, -0.3605044186115265, 0.3493458926677704, -0.305897057056427, 0.4131624698638916, ...