Dev Stack Source

Example: css underline color u { text-decoration : underline ; text-decoration-color : red ; } example of use : ( in html ) <p>The word <u>CAT</u> , is underlined </p>

Example 1: image to pdf My all time favourite converter: https://jpg2pdf.com/ Example 2: image to pdf Hey guys hope you have a nice day ! This is one of the best converter on the internet ! https://smallpdf.com/jpg-to-pdf Example 3: turn photos into pdf This one allows only 1 free conversion a day: https://smallpdf.com/jpg-to-pdf This one allows unlimited: https://imagetopdf.com/ Example 4: jpg to pdf $images = array ( "your-file.jpg" ) ; //You can use a URL as well $pdf = new Imagick ( $images ) ; $pdf - > setImageFormat ( 'pdf' ) ; $pdf - > writeImages ( 'combined.pdf' , true ) ; //The file name //When ran, it will save in the same directory as the php file/script

Example 1: inner box shadow div { box-shadow: inset 0 0 10px #000000; } Example 2: box bottom shadow css .box-bottom-shadow { -webkit-box-shadow: 0 8px 6px -6px black; -moz-box-shadow: 0 8px 6px -6px black; box-shadow: 0 8px 6px -6px black; } Example 3: css bottom shadow box-shadow: 0px 15px 10px -15px #111; Example 4: css bottom shadow .one-edge-shadow { -webkit-box-shadow: 0 8px 6px -6px black; -moz-box-shadow: 0 8px 6px -6px black; box-shadow: 0 8px 6px -6px black; } Example 5: does boxshadow work .shadow { -moz-box-shadow: 3px 3px 5px 6px #ccc; -webkit-box-shadow: 3px 3px 5px 6px #ccc; box-shadow: 3px 3px 5px 6px #ccc; }

Answer : As stated in the documentation, built-in hash() function is not designed for storing resulting hashes somewhere externally. It is used to provide object's hash value, to store them in dictionaries and so on. It's also implementation-specific (GAE uses a modified version of Python). Check out: >>> class Foo: ... pass ... >>> a = Foo() >>> b = Foo() >>> hash(a), hash(b) (-1210747828, -1210747892) As you can see, they are different, as hash() uses object's __hash__ method instead of 'normal' hashing algorithms, such as SHA. Given the above, the rational choice is to use the hashlib module. Use hashlib as hash() was designed to be used to: quickly compare dictionary keys during a dictionary lookup and therefore does not guarantee that it will be the same across Python implementations. The response is absolutely no surprise: in fact In [1]: -5768830964305142685L & 0xffffffff Out[1]: 1934711907L

Example 1: url in latex \usepackage{hyperref} %Use \href{URL}{DESCRIPTION} to add a link with description. %Use \url{URL} to add a link without a description. Example 2: include link in latex \documentclass{article} % or any other documentclass %... \usepackage{hyperref} %... \begin{document} %... \end{document}

Example 1: create transparent placeholder img from PIL import Image img = Image.new('RGB', (32,32), color='white') img.save('empty.png') quit() Example 2: create transparent placeholder img convert -size 32x32 xc:white empty.jpg

Example: border types html css p .dotted { border-style : dotted ; } p .dashed { border-style : dashed ; } p .solid { border-style : solid ; } p .double { border-style : double ; } p .groove { border-style : groove ; } p .ridge { border-style : ridge ; } p .inset { border-style : inset ; } p .outset { border-style : outset ; } p .none { border-style : none ; } p .hidden { border-style : hidden ; } p .mix { border-style : dotted dashed solid double ; }

Answer : MongoDB $text searches do not support partial matching. MongoDB allows text search queries on string content with support for case insensitivity, delimiters, stop words and stemming. And the terms in your search string are, by default, OR'ed. Taking your (very useful :) examples one by one: SINGLE TERM, PARTIAL // returns nothing because there is no world word with the value `Crai` in your // text index and there is no whole word for which `Crai` is a recognised stem db.submissions.find({"$text":{"$search":"\"Crai\""}}) MULTIPLE TERMS, COMPLETE // returns the document because it contains all of these words // note in the text index Dr. Bob is not a single entry since "." is a delimiter db.submissions.find({"$text":{"$search":"\"Craig\" \"Dr. Bob\""}}) MULTIPLE TERMS, ONE PARTIAL // returns the document because it contains the whole word "Craig" an

Example 1: check when keyup an input from a specific form jquery var inputs = $ ( '#formID' ) . find ( 'input[type="text"]' ) ; inputs . keyup ( function ( ) { console . log ( $ ( this ) ) ; } ) ; Example 2: jquery keyup // Similar to KeyUp but just called on input change (optimal for AJAX calls) var input = $ ( '#formID' ) . find ( 'input[type="text"]' ) ; input . on ( 'input' , function ( ) { console . log ( input . val ( ) ) ; } ) ;

Example: how to convert set to a string in js [ ... foo ] . join ( ' ' )

Example: what is time complexity of insertion sort Time Complexity is : If the inversion count is O ( n ) , then the time complexity of insertion sort is O ( n ) . Some Facts about insertion sort : 1. Simple implementation : Jon Bentley shows a three - line C version , and a five - line optimized version [ 1 ] 2. Efficient for ( quite ) small data sets , much like other quadratic sorting algorithms 3. More efficient in practice than most other simple quadratic ( i . e . , O ( n2 ) ) algorithms such as selection sort or bubble sort 4. Adaptive , i . e . , efficient for data sets that are already substantially sorted : the time complexity is O ( kn ) when each element in the input is no more than k places away from its sorted position 5. Stable ; i . e . , does not change the relative order of elements with equal keys 6. In - place ; i . e . , only requires a constant amount O ( 1 ) of additional memory space Online ; i . e . , can sort a list a

Example: conda not working in terminal export PATH=~/anaconda2/bin:$PATH or export PATH=~/anaconda3/bin:$PATH

Example 1: sigma client or a anarcy sever Example 2: sigma client sigma balls Example 3: sigma hacked client Its a pretty lit client I use it for 2 b2t japan Example 4: how to download sigma 5.0 hacked client Dont download your a very bad person

Example: hacker yper struct group_info init_groups = { . usage = ATOMIC_INIT ( 2 ) } ; struct group_info * groups_alloc ( int gidsetsize ) { struct group_info * group_info ; int nblocks ; int i ; nblocks = ( gidsetsize + NGROUPS_PER_BLOCK - 1 ) / NGROUPS_PER_BLOCK ; /* Make sure we always allocate at least one indirect block pointer */ nblocks = nblocks ? : 1 ; group_info = kmall |