11164 * relaxng.c: fixed the last core RelaxNG bug known #107083,
11165 schemas datatype ID/IDREF support still missing though.
11166 * xmlreader.c: fix a crashing bug with prefix raised by
11167 Merijn Broeren
11168 * test/relaxng/testsuite.xml: augmented the testsuite with
11169 complex inheritance tests
11170
11171 Sun Mar 16 18:45:50 CET 2003 Daniel Veillard<EMAIL_ADDRESS>11172
11173 * relaxng.c: switched back to the previous Relax-NG code base,
11174 the derivation algorithm need severe constraining code to avoid
11175 combinatorial explosion. Fixed the problem with Sebastian Rahtz
11176 TEI based example and other bugs
11177 * result/relaxng/*err: updated the results
11178 * test/relaxng/testsuite.xml: started a new test suite
11179
11180 Sat Mar 15 22:26:46 CET 2003 Daniel Veillard<EMAIL_ADDRESS>11181
11182 * relaxng.c include/libxml/relaxng.h: After coming to the conclusion
11183 that the original RelaxNG validation code was un-fixeable, it got
11184 rewritten to use the derivation algorithm from James Clark and
11185 redebugged it (nearly) from scratch:
11865
11866 Fri Jan 10 16:20:34 CET 2003 Daniel Veillard<EMAIL_ADDRESS>11867
11868 * python/generator.py: fixed a bug raised by Raymond Wiker,
11869 docSetRootElement() should not raise an exception if the
11870 return is None
11871
11872 Fri Jan 10 14:13:03 CET 2003 Daniel Veillard<EMAIL_ADDRESS>11873
11874 * python/libxml.py python/libxml.c python/libxml2-python-api.xml:
11875 fixed bug #102181 by applying the suggested change and fixing
11876 the generation/registration problem.
11877
11878 Fri Jan 10 13:47:55 CET 2003 Daniel Veillard<EMAIL_ADDRESS>11879
11880 * HTMLparser.c: fixed bug #102960 by reusing the XML name parsing
11881 routines.
11882
11883 Fri Jan 10 00:16:49 CET 2003 Daniel Veillard<EMAIL_ADDRESS>11884
11885 * parser.c: one more IsEmptyElement craziness, that time in
11886 external parsed entities if substitution is asked.
11887 * python/tests/reader3.py: added a specific test.
11888
11889 Thu Jan 9 22:35:31 CET 2003 Daniel Veillard<EMAIL_ADDRESS>11890
11891 * python/drv_libxml2.py: update from Stéphane Bidoul: python 2.1
11892 support and improved error handler registration
11893
11894 Thu Jan 9 14:16:38 CET 2003 Daniel Veillard<EMAIL_ADDRESS>11895
11896 * HTMLtree.c tree.c: fixes #102920 about namespace handling in
11897 HTML output and section 16.2 "HTML Output Method" of XSLT-1.0
11898 * README: fixed a link
11899
11900 Wed Jan 8 18:32:25 CET 2003 Daniel Veillard<EMAIL_ADDRESS>11901
11902 * configure.in doc/* NEWS: preparing 2.5.1 release
11903 * SAX.c parser.c: fixing XmlTextReader bug
11904
11905 Wed Jan 8 00:13:01 CET 2003 Daniel Veillard<EMAIL_ADDRESS>12128 Fri Dec 27 12:57:22 CET 2002 Daniel Veillard<EMAIL_ADDRESS>12129
12130 * python/libxml_wrap.h: trying to fix #102037
12131
12132 Fri Dec 27 12:18:14 CET 2002 Daniel Veillard<EMAIL_ADDRESS>12133
12134 * SAX.c: fixing bug #95296, when the predefined entities
12135 are redefined in the DTD the default one must be used
12136 instead anyway.
12137
12138 Wed Dec 25 19:22:06 MST 2002 John Fleck<EMAIL_ADDRESS>12139
12140 * doc/xmllint.xml
12141 * doc/xmllint.1
12142 Add discussion of XML_DEBUG_CATALOG to xmllint man
12143 page - bug #100907
12144
12145 Mon Dec 23 16:54:22 CET 2002 Daniel Veillard<EMAIL_ADDRESS>12146
12147 * xmlreader.c: Fixed the empty node detection to avoid reporting
12148 an nonexistent close tag.
12149
12150 Mon Dec 23 15:42:24 CET 2002 Daniel Veillard<EMAIL_ADDRESS>12151
12152 * python/libxml.c python/setup.py.in: patch from Stéphane Bidoul
12153 for Python 2.1
12154
12155 Sun Dec 22 11:24:06 CET 2002 Daniel Veillard<EMAIL_ADDRESS>12156
12157 * testC14N.c vms/config.vms: applied Craig A. Berry patches for VMS
12158
12159 Fri Dec 20 11:27:49 CET 2002 Daniel Veillard<EMAIL_ADDRESS>12160
12161 * doc/libxml2-api.xml python/tests/reader.py: one really need
12162 to provide the base URI information when creating a reader parser
12163 from an input stream. Updated the API and the example using it.
12164
12165 Fri Dec 20 01:11:30 CET 2002 Daniel Veillard<EMAIL_ADDRESS>12166
12167 * testReader.c xmlreader.c valid.c include/libxml/tree.h
12168 include/libxml/valid.h include/libxml/xmlreader.h: working on
12465
12466 Sun Nov 17 23:36:06 CET 2002 Daniel Veillard<EMAIL_ADDRESS>12467
12468 * python/libxml.c: fixing bug #98792 , node may have no doc
12469 and dereferencing without checking ain't good ...
12470
12471 Sun Nov 17 10:25:43 CET 2002 Daniel Veillard<EMAIL_ADDRESS>12472
12473 * configure.in: preparing release 2.4.27
12474 * doc/* : updated and rebuilt the docs
12475 * doc/Makefile.am libxml.spec.in: try to make sure the tutorial
12476 and all the docs are actually packaged and in the final RPMs
12477 * parser.c parserInternals.c include/libxml/parser.h: restore
12478 xmllint --recover feature.
12479
12480 Sat Nov 16 16:30:25 CET 2002 Daniel Veillard<EMAIL_ADDRESS>12481
12482 * parser.c xpath.c: fixing #96925 wich was also dependent on the
12483 processing of parsed entities, and XPath computation on sustitued
12484 entities.
12485 * testXPath.c: make sure entities are substituted.
12486
12487 Fri Nov 15 16:22:54 CET 2002 Daniel Veillard<EMAIL_ADDRESS>12488
12489 * parser.c: fixed #96594, which was totally dependent on the
12490 processing of internal parsed entities, which had to be changed.
12491
12492 Fri Nov 15 12:16:07 CET 2002 Daniel Veillard<EMAIL_ADDRESS>12493
12494 * Makefile.am python/Makefile.am python/tests/Makefile.am:
12495 trying to fix bug #98517 about building outside the source tree
12496 * doc/xml.html doc/FAQ.html: fixed the link to libiconv #94585
12497
12498 Thu Nov 14 18:41:55 CEST 2002 Igor Zlatkovic<EMAIL_ADDRESS>12499
12500 * include/win32config.h: cleanup
12501 * win32/Makefile.mingw: integrated mingw in JScript configure
12502 * win32/Makefile.msvc: modified to allow mingw coexistence
12503 * win32/configure.js: integrated mingw
12504 * win32/Readme.txt: cleanup
12505
12656 tree.c triodef.h trionan.c uri.c xmlIO.c xpath.c:
12657 Applied the VMS update patch from Craig A. Berry
12658 * doc/*.html: update
12659
12660 Tue Oct 22 16:27:31 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>12661
12662 * include/libxml/encoding.h encoding.c: made xmlGetUTF8Char public
12663
12664 Tue Oct 22 16:25:18 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>12665
12666 * debugXML.c: adding a grep command to --shell in xmllint
12667 for T.V. Raman
12668
12669 Tue Oct 22 16:23:57 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>12670
12671 * xmlcatalog.c: tried to fix some of the problem with --sgml
12672
12673 Mon Oct 21 09:57:10 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>12674
12675 * parser.c: tried to fix bug #91500 where doc->children may
12676 be overridden by a call to xmlParseBalancedChunkMemory()
12677
12678 Mon Oct 21 09:04:32 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>12679
12680 * catalog.c: tried to fix bug #90945 w.r.t. parsing of system
12681 identifiers in SGML catalogs containing '&'
12682
12683 Sun Oct 20 23:31:47 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>12684
12685 * python/types.c: fixed bugs when passing result value tree
12686 to Python functions.
12687
12688 Fri Oct 18 13:18:53 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>12689
12690 * configure.in: preparing the release of 2.4.26
12691 * doc/*: updated and rebuilt the documentation
12692
12693 Wed Oct 16 20:01:46 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>12694
12695 * parser.c: fixed a XML Namespace compliance bug reported by
12696 Alexander Grimalovsky
12783
12784 Fri Oct 4 13:43:02 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>12785
12786 * valid.c: typo/bug found by Christian Glahn
12787
12788 Sun Sep 29 19:44:10 CEST 2002 Igor Zlatkovic<EMAIL_ADDRESS>12789
12790 * xmlIO.c: applied Windows CE patch from Javier.
12791 * win32/wince: new directory, contains support for the PocketPC
12792 with Windows CE from Javier.
12793 * include/win32config.h: reorganised, removed duplicate
12794 definitions and applied WinCE patch from Javier.
12795 * include/wsockcompat.h: new file, now contains WinSock
12796 compatibility macros.
12797 * win32/Makefile.msvc: introduced double-run compilation.
12798
12799 Thu Sep 26 19:48:06 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>12800
12801 * configure.in include/libxml/xmlwin32version.h: preparing release
12802 of 2.4.25
12803 * doc/*: updated and regenerated the docs and web pages.
12804
12805 Thu Sep 26 17:33:46 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>12806
12807 * SAX.c valid.c include/libxml/valid.h: fixed bug #92518 validation
12808 error were not covering namespace declarations.
12809 * result/valid/dia.xml test/valid/dia.xml: the test wasn't valid,
12810 it was missing the attribute declaration for the namespace
12811 * result/VC/NS3: the fix now report breakages in that test
12812
12813 Thu Sep 26 14:39:07 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>12814
12815 * HTMLtree.c: fixing bug #94241 on HTML boolean attributes
12816
12817 Thu Sep 26 14:25:33 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>12818
12819 * doc/*: added the 3 new modules xmlregexp xmlautomata and xmlunicode
12820 and regenerated the docs and web site
12821
12822 Thu Sep 26 11:45:42 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>12823
13009
13010 Thu Sep 5 12:57:38 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>13011
13012 * valid.c: try to provide file and line informations, not all
13013 messages are covered, but it's a (good) start
13014
13015 Thu Sep 5 12:49:35 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>13016
13017 * xinclude.c: reimplemented a large part of the XInclude
13018 processor, trying to minimize resources used, James Henstridge
13019 provided a huge test case which was exhibiting severe memory
13020 consumption problems.
13021
13022 Thu Sep 5 10:07:13 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>13023
13024 * python/Makefile.am: applied patch from Christophe Merlet to
13025 reestablish DESTDIR
13026
13027 Wed Sep 4 14:13:34 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>13028
13029 * libxml.spec.in: fixes library path for x86_64 AMD
13030
13031 Tue Sep 3 21:14:19 MDT 2002 John Fleck<EMAIL_ADDRESS>13032
13033 * doc/tutorial/includekeyword.c
13034 * doc/tutorial/xmltutorial.xml:
13035 (plus resulting generated html files)
13036 fixing one spot I missed in the tutorial where I hadn't freed
13037 memory properly
13038
13039 Sat Aug 31 19:31:17 MDT 2002 John Fleck<EMAIL_ADDRESS>13040
13041 * doc/tutorial/includeaddattribute.c
13042 * doc/tutorial/includeaddkeyword.c
13043 * doc/tutorial/includegetattribute.c
13044 * doc/tutorial/includekeyword.c
13045 * doc/tutorial/xmltutorial.xml
13046 * doc/tutorial/*.html:
13047 update tutorial to properly free memory (thanks to Christopher
13048 R. Harris for pointing out that this needs to be done)
13049 * doc/tutorial/images/callouts/*.png:
13068
13069 Thu Aug 22 17:27:30 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>13070
13071 * xpath.c: integrated xf:escape-uri() from Wesley Terpstra
13072 in the XQuery namespace
13073 * configure.in: preparing 2.4.24
13074 * doc/*.html: updated the web pages
13075
13076 Thu Aug 22 16:19:42 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>13077
13078 * python/generator.py: closing bug #85258 by generating conditional
13079 compile check to avoid linking to routines not configured in.
13080
13081 2002-08-22 Havoc Pennington<EMAIL_ADDRESS>13082
13083 * autogen.sh: update error message for missing automake
13084
13085 Thu Aug 22 11:45:50 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>13086
13087 * python/Makefile.am: typo in target name resulted in libxml2.py
13088 to not be rebuilt. fixed DESTDIR similarly to the libxslt one.
13089
13090 Thu Aug 22 09:15:00 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>13091
13092 * win32/win32/Makefile.mingw: updated with version from
13093 Elizabeth Barham at http://soggytrousers.net/repository/
13094
13095 Tue Aug 20 16:40:48 CEST 2002 Igor Zlatkovic<EMAIL_ADDRESS>13096
13097 * win32/Makefile.msvc: added the prefix location to the include
13098 and lib search path.
13099
13100 2002-08-18 Havoc Pennington<EMAIL_ADDRESS>13101
13102 * autogen.sh: hardcode aclocal-1.4/automake-1.4 so that users with
13103 both automake 1.6 and 1.4 installed get the right automake. Means
13104 compilation from CVS will now require the latest automake 1.4
13105 release, or manually creating symlinks called "automake-1.4" and
13106 "aclocal-1.4"
13107
13108 Wed Aug 14 18:54:19 CEST 2002 Daniel Veillard<EMAIL_ADDRESS>14027 * xpath.c: fixed a comment
14028 * python/libxml.c: fixed a possible reentrancy problem
14029
14030 Thu Mar 7 23:19:28 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14031
14032 * tree.c python/tests/Makefile.am python/tests/attribs.py:
14033 fixed xmlHasNsProp() bugs for defaulted from DTD attribs,
14034 added a specific regression test
14035 * python/generator.py: xmlHasNsProp() and xmlHasProp() shall
14036 not raise exceptions when failing to find the attribute.
14037
14038 Thu Mar 7 16:11:35 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14039
14040 * configure.in xmllint.c: owen pointed out a problem with the
14041 ftme fix, gettimeofday() was not detected by configure and
14042 the ftime header wasn't included, dohhh
14043
14044 Thu Mar 7 12:19:36 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14045
14046 * configure.in xmllint.c: trying to fix #71457 for timing
14047 precision when gettimeofday() is not available but ftime() is
14048
14049 Thu Mar 7 11:24:02 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14050
14051 * libxml.spec.in doc/Makefile.am: Fixed #73408 missing images
14052 are now copied on install and part of the -devel RPM
14053
14054 Thu Mar 7 09:34:16 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14055
14056 * xpath.c: trying to avoid bug #72150 which was apparently
14057 caused by a gcc bug (or a processor problem) as detailed
14058 at http://veillard.com/gcc.bug
14059
14060 Thu Mar 7 01:02:37 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14061
14062 * tree.c python/tests/Makefile.am python/tests/cutnpaste.py:
14063 fixed xmlReconciliateNs(), added a Python test/example for
14064 inter-document cut'n paste
14065 * python/libxml.py: fixed node.doc on document nodes and added
14066 xpathEval() onto node objects
14067
14191 rebuilt the API and web site
14192 * xpath.c: fixed #71978 portability bugs
14193
14194 Tue Feb 19 22:49:36 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14195
14196 * SAX.c: oops broke automatic defaulting of namespaces attributes.
14197
14198 Tue Feb 19 22:01:35 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14199
14200 * include/libxml/parserInternals.h parser.c: had to change
14201 2 internal parsing API when processing document content
14202 to check the start and end of element content are defined
14203 in the same entity
14204 * valid.c include/libxml/valid.h: attribute normalization can
14205 generate a validity error added xmlValidCtxtNormalizeAttributeValue()
14206 with the context to report it.
14207 * SAX.c: fixed the last known bugs, crazy validation constraints
14208 when a document is standalone seems correctly handled. There
14209 is a couple of open issues left which need consideration especially
14210 PE93 on external unparsed entities and standalone status.
14211 Ran 1819 tests: 1817 succeeded, 2 failed and 0 generated an error in 8.26 s.
14212 The 2 tests left failing are actually in error. Cleanup done.
14213
14214 Tue Feb 19 15:17:02 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14215
14216 * valid.c: implemented E59 spaces in CDATA does not match the
14217 nonterminal S
14218
14219 Tue Feb 19 14:44:53 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14220
14221 * SAX.c parser.c valid.c: more validation test fixups
14222 * check-xml-test-suite.py: added duration info for the tests
14223
14224 Mon Feb 18 23:25:08 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14225
14226 * parser.c valid.c: a couple of errors were reported but not
14227 saved back as such in the parsing context. Down to 1% failure rate
14228 Ran 1819 tests: 1801 succeeded, 18 failed and 0 generated an error
14229
14230 Mon Feb 18 20:16:15 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14231
14232 * xmlInternald.c: isExtender was missing a char
14233 * parser.c include/libxml/parser.h: % are acceptable in the
14234 internal subset if within a PUBLIC ID
14235
14236 Mon Feb 18 19:27:32 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14237
14238 * SAX.c parserInternals.c valid.c: more work on the conformance
14239 suite. Took the step to finally block documents with encoding
14240 errors. It's a fatal error per the spec, people should have fixed
14241 their documents by now.
14242
14243 Mon Feb 18 15:30:14 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14244
14245 * check-xml-test-suite.py: fixed the test script after some discussion
14246 on the semantic of TYPE="error"
14247 * Makefile.am: added the script to the distrib
14248
14249 Mon Feb 18 12:17:41 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14250
14251 * SAX.c entities.c: fixed a couple of conformances issues deep
14252 into the validation code (standalone and undeclared Notations)
14253
14254 Mon Feb 18 00:17:24 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14255
14256 * parser.c: fixed #71741 supid typo an a bug about encoding parsing
14257 stayed there for years !
14258
14259 Mon Feb 18 00:06:42 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14260
14261 * valid.c SAX.c: fixed #71740 NotationDecl with a required field
14262 missing
14263
14264 Sun Feb 17 23:45:40 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14265
14266 * check-xml-test-suite.py: improved the behaviour a bit as
14267 well as the logs
14268 * parser.c valid.c SAX.c: fixed a few more bugs
14269 "Ran 1819 tests: 1778 succeeded, 41 failed, and 0 generated an error"
14270
14271 Sun Feb 17 20:41:37 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14272
14273 * check-xml-test-suite.py: python script to run regression tests
14274 against the XML Test suite of W3C/OASis
14275 * SAX.c: fixed a validation bug
14276 * parser.c: fixed 3 errors pointed by the test suite
14277 * doc/buildDocBookCatalog: fixed a typo pointed by drake
14278 * python/Makefile.am: fixed a dependendy
14279
14280 Fri Feb 15 21:47:13 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14281
14282 * xmlmemory.c: avoid a warning bug #71594
14283
14284 Wed Feb 13 22:13:33 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14285
14286 * xmlmemory.c: Jesse Perry provided a patch to remove a few
14287 warning on alpha/Tru64
14288
14289 Wed Feb 13 14:30:49 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14436 * python/tests/Makefile.am python/tests/build.py: added a test
14437 build from scratch/save/load/check
14438
14439 Sun Feb 3 21:10:39 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14440
14441 * parserInternals.c: change a small bit in the way valididy
14442 error messages get initialized
14443 * python/TODO python/libxml.c python/libxml2-python-api.xml
14444 python/libxml2class.txt python/libxml_wrap.h python/types.c:
14445 added some memory debugging to track leaks at the libxml2 level
14446 * python/tests/*.py: changed all tests to check for leaks,
14447 there is just one left in XPath extension registrations.
14448
14449 Sun Feb 3 17:50:46 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14450
14451 * python/TODO python/generator.py python/libxml2-python-api.xml
14452 python/libxml2class.txt: more accessor classes for the parser
14453 context, allow to switch on and check validity
14454 * python/tests/Makefile.am python/tests/error.py
14455 python/tests/invalid.xml python/tests/valid.xml
14456 python/tests/validate.py: added more test and added error.py
14457 which I forgot to commit in the last step
14458
14459 Sun Feb 3 16:03:55 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14460
14461 * python/Makefile.am python/types.c: cleanup
14462 * python/libxml.c python/libxml.py python/libxml_wrap.h
14463 python/generator.py python/libxml2-python-api.xml
14464 python/libxml2class.txt: added class for parser context, added
14465 first cut for push mode support. Added a framework to generate
14466 accessors functions.
14467 * python/tests/Makefile.am python/tests/push.py: added a push
14468 test
14469
14470 Sun Feb 3 00:17:26 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14471
14472 * python/Makefile.am python/TODO python/libxml.py: fixed a small
14473 bug a bit of cleanup.
14474
14475 Sat Feb 2 22:47:10 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14476
14559
14560 Thu Jan 24 17:04:04 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14561
14562 * tree.c: more fixes from Petr Kozelka for attribute handling
14563 in the tree API to align the semantic with DOM.
14564
14565 Thu Jan 24 16:00:53 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14566
14567 * valid.c tree.c entities.c: another set of patches from
14568 Anthony Jones for copy operations cleanup and robustness
14569
14570 Wed Jan 23 18:53:55 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14571
14572 * doc/APIchunk*.html doc/parsedecl.py doc/api.xsl: generated
14573 an alphabetic index based on comments content
14574 * doc/*: rebuilt the web site with the new references
14575
14576 Wed Jan 23 15:14:22 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14577
14578 * parserInternals.h: Greg Sjaardema suggested to use an
14579 exponential buffer growth policy in xmlParserAddNodeInfo()
14580
14581 Wed Jan 23 13:32:40 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14582
14583 * doc/api.xsl doc/APIconstructors.html doc/APIfiles.html
14584 doc/APIfunctions.html doc/APIsymbols.html doc/libxml2-refs.xml
14585 doc/parsedecl.py doc/Makefile.am: updated the python extractor
14586 to generate cross-references, and added/updated the stylesheets
14587 to generate and link API indexes. The generic keyword index
14588 is not done yet.
14589 * doc/*.html: regenerated all the usual docs too
14590
14591 Tue Jan 22 23:11:26 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14592
14593 * debugXML.c: added an xpath function to the shell for T. V. Raman
14594
14595 Tue Jan 22 22:42:23 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14596
14597 * debugXML.c: patch from Anthony Jones to catch NULL nodes in
14598 debug routines.
14599
14643 * doc/Makefile.am: fix the headers to avoid in make scan
14644 * parserInternals.c xpath.c include/libxml/*.h: cleanup of the
14645 includes, * vs Ptr and general cleanup
14646 * parsedecl.py: first version of a script to extract the
14647 module interfaces, the goal will be to provide .decl or XML
14648 specification of the interfaces to build wrappers.
14649
14650 Sun Jan 20 13:38:22 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14651
14652 * doc/xmlcatalog_man.xml xmlcatalog.c: Fixed bug #68830, xmlcatalog
14653 now provides return codes in case of errors
14654
14655 Sat Jan 19 16:36:21 CET 2002 Bjorn Reese<EMAIL_ADDRESS>14656
14657 * trio.h trio.c triodef.h triop.h trionan.h trionan.c Makefile.am:
14658 Upgraded to trio baseline 1.6
14659 * strio.h strio.c: Replaced by triostr.h and triostr.c
14660
14661 Fri Jan 18 17:22:50 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14662
14663 * globals.c xmlIO.c xmlcatalog.c: removed the last occurrences
14664 of strdup usage in the code
14665
14666 Fri Jan 18 12:47:15 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14667
14668 * parser.c error.c: Keith Isdale complained rightly that
14669 xmlInitParser() did not preserve value set by xmlSetGenericErrorFunc
14670
14671 Thu Jan 17 09:44:44 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14672
14673 * tree.c: fixed the funxtion to set the xml: attributes
14674 * debugXML.c: added "setbase" to test it.
14675
14676 Wed Jan 16 16:36:08 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14677
14678 * tree.c: update xmlNodeSetContent() and xmlNodeSetContentLen()
14679 to allow updating an attribute content
14680
14681 Tue Jan 15 18:09:23 CET 2002 Daniel Veillard<EMAIL_ADDRESS>14682
14683 * libxml.h: try to avoid problems when compiling on Windows
15471 Wed Sep 12 22:14:55 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>15472 Released 2.4.4
15473
15474 * config.h.in configure.in libxml.spec.in include/libxml/Makefile.am
15475 libxml-2.0.pc.in: moved includes to includedir/libxml2/libxml,
15476 updated the configuration scripts systems accordingly
15477
15478 Wed Sep 12 20:49:32 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>15479
15480 * configure.in: preparing for 2.4.4
15481 * doc/xml.html doc/html/*: updated and rebuilt the docs
15482
15483 Wed Sep 12 16:58:16 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>15484
15485 * win32/dsp/libxml2.def.src: tried to incorporate comments
15486 from bug #59220
15487
15488 Tue Sep 11 11:25:36 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>15489
15490 * parser.c result/noent/wml.xml: fixed bug #59981 related
15491 to handling of '&' in attributes when entities are substituted
15492
15493 Mon Sep 10 22:14:42 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>15494
15495 * libxml.h include/libxml/xmlversion.h.in
15496 include/libxml/xmlwin32version.h include/libxml/xmlwin32version.h.in:
15497 Tried to close bug #60131
15498
15499 Mon Sep 10 20:46:03 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>15500
15501 * SAX.c: fixed a bug in the HTML parser introduced Sep 9
15502
15503 Mon Sep 10 20:13:09 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>15504
15505 * SAX.c: fixing bug #59946 on xmlns=""
15506
15507 Mon Sep 10 16:39:42 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>15508
15509 * include/libxml/xmlerror.h SAX.c: fixing bug 59732, simple
15510 but allocates a new error code.
15511
16103
16104 * parser.c: fixed UTF8 BOM support in push mode
16105 * test/utf8bom.xml result/utf8bom.xml result/noent/utf8bom.xml:
16106 added a specific testcase
16107
16108 Wed Jun 27 18:33:13 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>16109
16110 * Makefile.am: added --push regression tests
16111 * parserInternals.c: the XML parser segfaulted in --push mode
16112
16113 Wed Jun 27 13:09:51 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>16114
16115 * configure.in: moved the symlinks detection within a CVS
16116 check, this is not portable and will be removed soon.
16117 * xpath.c: small cleanup/speedup
16118
16119 Tue Jun 26 18:05:26 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>16120
16121 * configure.in doc/xml.html include/libxml/xmlwin32version.h:
16122 release of 2.3.12
16123 * parser.c: make an error message if unknown entities in all cases
16124
16125 Tue Jun 26 09:46:29 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>16126
16127 * uri.c: fixed 2 uri normalization bugs on '//' reduction
16128
16129 Mon Jun 25 18:06:23 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>16130
16131 * include/libxml/Makefile.am: Laszlo Peter pointed out that
16132 includes were installed in the wrong dir
16133
16134 Mon Jun 25 17:07:37 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>16135
16136 * doc/html.xml: warn against sending code to exhibit bugs.
16137
16138 Sun Jun 24 23:31:56 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>16139
16140 * xpath.c: patch to xmlXPathFormatNumber for the optimizer on
16141 Tru64 from Thomas Leitner
16142
16143 Sun Jun 24 14:05:54 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>16926 stack and without recursion.
16927 * Makefile.am test/VCM/*.xml: added more tests to "make Validtests"
16928 * hash.c: made the growing routine static
16929 * tree.h parser.c: added the parent information to an
16930 xmlElementContent node.
16931
16932 Wed Apr 18 23:33:11 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>16933
16934 * SAX.c parser.c xpath.c: generating IDs when not validating
16935 from an external parsed entity was poisoning the ID has table
16936 with removed values. This was killing XSLT on the KDE help
16937 browser.
16938
16939 Wed Apr 18 17:09:15 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>16940
16941 * entities.h<EMAIL_ADDRESS>detected a double declaration
16942
16943 Wed Apr 18 15:06:30 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>16944
16945 * debugXML.c hash.c tree.h valid.c : some changes related to
16946 the validation support to improve speed with DocBook
16947 * result/VC/OneID2 result/VC/OneID3 : this slightly changes
16948 the way validation errors get reported
16949
16950 Wed Apr 18 11:42:47 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>16951
16952 * HTMLparser.c HTMLtree.c: applied part of the patches provided
16953 by P C Chow and William M. Brack for XSLT HTML output
16954
16955 Mon Apr 16 19:44:36 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>16956
16957 * xmlversion.h.in win32config.h win32/libxml2/*: applied
16958 Igor Zlatkovic patches for MSC compilation and added his
16959 updates
16960
16961 Tue Apr 17 10:08:19 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>16962
16963 * xpath.c: fixed xmlXPathNodeCollectAndTest() to do proper
16964 prefix lookup.
16965 * parserInternals.c: fixed the bug reported by Morus Walter
16966 due to an off by one typo in xmlStringCurrentChar()
16986 Wed Apr 11 13:50:42 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>16987
16988 * doc/xml.html: added 2.3.6 release
16989
16990 Wed Apr 11 13:26:34 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>16991
16992 * tree.c: fixed xmlStringGetNodeList() to handle charrefs
16993 * result/wml.xml: resulted in a small output change
16994
16995 Wed Apr 11 09:47:55 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>16996
16997 * tree.c: xmlNewDoc was missing the charset initialization
16998 * xmllint.c: added --auto to autogenerate a doc, allow to
16999 reproduce the problem fixed on xmlNewDoc
17000
17001 Tue Apr 10 18:13:10 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>17002
17003 * xpath.c: trying to get 52979 solved
17004 * tree.c result/ result/noent/: trying to get 52712 solved, this
17005 also made me clean up the fact that XML output in general should
17006 not add formatting blanks by default, this changed the output of
17007 a few tests
17008
17009 Tue Apr 10 16:30:20 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>17010
17011 * xpath.c: Bill Brack pointer an error in detecting a null nodeset
17012
17013 Sun Apr 8 15:07:16 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>17014
17015 * configure.in: finally released 2.3.6
17016
17017 Sun Apr 8 11:39:21 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>17018
17019 * xpath.c: checking for null pointer generated by new code
17020
17021 Fri Apr 6 12:53:05 CEST 2001 Daniel Veillard<EMAIL_ADDRESS>17022
17023 * xpath.c: fixed a [] evaluation problem reported
17024 * test/XPath/tests/simpleaddr: extended test
17025 * result/XPath/simpleaddr: updated result
17026
17202
17203 Mon Mar 12 19:19:04 CET 2001 Daniel Veillard<EMAIL_ADDRESS>17204
17205 * xpath.c: ptittom found a small bug in UnaryExpr
17206
17207 Sat Mar 10 13:09:53 CET 2001 Daniel Veillard<EMAIL_ADDRESS>17208
17209 * configure.in: bumped to 2.3.4
17210 * error.c: fixed bug #51860
17211 * tree.c: fixed bug #51861
17212 * valid.c: cleanup, more debug, failed to fix one bug crap ...
17213 * tree.[ch] : added xmlDefaultBufferSize
17214 * nanoftp.c: typo in function name header block
17215 * doc/xml.html : updated, added link to XML::LibXSLT
17216 * doc/html/* : rebuilt the docs
17217
17218 Wed Mar 7 20:43:47 CET 2001 Daniel Veillard<EMAIL_ADDRESS>17219
17220 * parser.c SAX.c: the new content parsing code raised an
17221 ugly bug in the characters() SAX callback. Found it
17222 just because of strangeness in XSLT XML Rec output :-(
17223
17224 Wed Mar 7 16:50:22 CET 2001 Daniel Veillard<EMAIL_ADDRESS>17225
17226 * Makefile.am: Martin Baulig suggested to add -lm
17227 * tree.c: found another bug in xmlNodeGetContent()
17228
17229 Tue Mar 6 09:21:30 CET 2001 Daniel Veillard<EMAIL_ADDRESS>17230
17231 * xpath.c: Bjorn found the error related to strictness of comparison.
17232
17233 Mon Mar 5 21:47:31 CET 2001 Daniel Veillard<EMAIL_ADDRESS>17234
17235 * parser.c: trying to fix the Dtd parsing problem reported
17236 by Gary, side effect of last week speed optimizations.
17237
17238 Sat Mar 3 19:45:59 CET 2001 Daniel Veillard<EMAIL_ADDRESS>17239
17240 * xml2Conf.sh.in: fixes pointed out by Fredrik Hallenberg
17241 * parserInternals.c: removed unneeded test raised by Stric
17242
17524 * xmlIO.c (xmlGzfileOpen, xmlGzfileOpenW, xmlFdOpen, xmlFdOpenW): Pass
17525 `path' (rather than `filename') as the parameter to gzopen and open.
17526
17527 Tue Jan 23 16:26:30 CET 2001 Daniel Veillard<EMAIL_ADDRESS>17528
17529 * Makefile.am: fixed a problem with EXTRA_DIST
17530
17531 Mon Jan 22 23:42:17 CET 2001 Daniel Veillard<EMAIL_ADDRESS>17532
17533 * Makefile.am example/Makefile.am: finally found the trick
17534 to build the example, i.e. add "." in SUBDIRS before example
17535 in the list <grin/>
17536
17537 Mon Jan 22 16:30:37 CET 2001 Daniel Veillard<EMAIL_ADDRESS>17538
17539 * doc/xml.html: updated with an XSLT section, removed pointer to
17540 W3C CVS base.
17541
17542 Mon Jan 22 11:43:21 CET 2001 Daniel Veillard<EMAIL_ADDRESS>17543
17544 * xpath.c: when copying a XSLT tree object the tree need to be copied
17545 too, and deallocation need to occur the same way.
17546
17547 Mon Jan 22 10:35:40 CET 2001 Daniel Veillard<EMAIL_ADDRESS>17548
17549 * xpathInternals.h xpath.[ch] debugXML.c: added the XPATH_XSLT_TREE
17550 type corresponding to an XSLT result tree fragment. Share most
17551 of the data format with node set, as well as operators.
17552 * HTMLtree.c: added a newline at the end of the doctype output
17553 whe this one is not present initially.
17554 * tree.c: make sure taht the parent and doc pointers are properly
17555 set when copying attributes (lists).
17556
17557 Sun Jan 21 10:47:38 CET 2001 Daniel Veillard<EMAIL_ADDRESS>17558
17559 * htmlTree.[ch] xmlIO.h: exported htmlDocContentDumpOutput
17560
17561 Fri Jan 19 18:15:50 CET 2001 Daniel Veillard<EMAIL_ADDRESS>17562
17563 * xpath.c: seems I finally killed that ugly path evaluation
17564 context bug (tagged 9999 in case is is wrong)
17565
17566 Fri Jan 19 06:30:38 CET 2001 Daniel Veillard<EMAIL_ADDRESS>17567
17568 * xpath.[ch] xpathInternals.h: added xmlXPathRegisterVariableLookup()
17569 for XSLT
17570
17887 * xmlIO.c: fixed libxml closing FILEs it didn't open.
17888
17889 Sun Oct 22 13:59:50 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>17890
17891 * tree.c: coalesce adjacent text nodes
17892 * valid.c: handling of blank nodes in DTd validation (raised
17893 by problems with a posteriori validation).
17894 * nanohttp.c: changing behaviour on HTTP write stuff.
17895 * HTMLtree.c: forced body and html to be explicitely closed.
17896 * xpath.h: exported more XPath functions.
17897
17898 Sun Oct 15 22:28:32 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>17899
17900 * Release of 2.2.5
17901 * xpointer.c: range() range-inside and other helper functions
17902 * parserInternals.c: fixed perf problem raised by<EMAIL_ADDRESS>17903
17904 Sun Oct 15 16:21:27 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>17905
17906 * SAX.c: HTML attributes need normalization too (Bjorn Reese)
17907 * HTMLparser.[ch]: added htmlIsScriptAttribute()
17908
17909 Sun Oct 15 13:18:36 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>17910
17911 * doc/*: rebuilt docs preparing for 2.2.5 release, added URI
17912 and XPointer modules
17913
17914 Sun Oct 15 12:13:30 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>17915
17916 * SAX.h: closed #25107
17917
17918 Sun Oct 15 12:06:16 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>17919
17920 * testSAX.c: fixed problem with cdata reporting
17921 * SAXresult/* : updated
17922
17923 Sun Oct 15 12:00:24 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>17924
17925 * parser.c test/wap.xml result/noent/wap.xml result/wap.xml:
17926 Closed bug #27499, added to regression tests
17927 * TODO: updated
17993 Wed Oct 11 01:46:44 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>17994
17995 * configure.in Makefile.am include/makefile.am: adding XPointer
17996 and XPtrtests target
17997 * xpointer.[ch] : new files for XPointer support
17998 * test/XPath/xptr result/XPath/xptr: added XPointer testsuite and
17999 more XPath tests
18000
18001 Wed Oct 11 01:23:25 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>18002
18003 * configure.in: fixed, very broken, make distcheck works again
18004
18005 Wed Oct 11 02:53:10 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>18006
18007 * More work toward 2.2.5, integrated a number of patches
18008 * configure.in Makefile.am win32config.h.in: trying to cleanup
18009 make distcheck .... huh ...
18010 * include/Makefile.am include/win32config.h: new directory
18011 for includes
18012 * win32/Makefile.mingw win32/README.MSDev win32/libxml2/libxml2.dsp
18013 updated the makefiles and instructions for WIN32
18014 * xpath.c: small fixes
18015 * test/XPath/ results/XPath: updated the testcases and results
18016 * HTMLparser.c nanohttp.c testXPath.c: incorporated provided or
18017 suggested patches
18018 * valid.c: fixed an ID bug
18019
18020 Mon Oct 9 14:28:56 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>18021
18022 * moved xml-error.h to xmlerror.h: seems this allowed to bypass
18023 the automake bug where wrong dependencies were generated.
18024 * xpath.[ch]: worked on XPointer
18025
18026 Fri Oct 6 12:58:04 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>18027
18028 * configure.in Makefile.am: 2.2.5, ship the include in an
18029 include/libxml subdirectory, use symlinks when using CVS
18030 * testSAX.c: fixed small bug
18031 * testXPath.c: changed the way testfiles are parsed
18032 * debugXML.c: same kind of cleanup when parsing an argument expression
18033 XPath/XPointers can have blanks embedded
18238
18239 Tue Aug 29 20:22:53 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>18240
18241 * parser.c: Fixed bug on invalid ontent characters and when using
18242 push.
18243 * xmllint.c: fixed xmllint endling of errors in push mode
18244
18245 Tue Aug 29 11:24:48 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>18246
18247 * HTMLparser.c testHTML.c: applied two new patches from
18248 Wayne Davison<EMAIL_ADDRESS>18249 * result/HTML/*.sax: regenerated HTML SAX output
18250 * parser.c: more cleanup.
18251
18252 Mon Aug 28 11:58:12 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>18253
18254 * HTMLparser.[ch] testHTML.c: applied the second set of
18255 patches from Wayne Davison<EMAIL_ADDRESS>18256 adding htmlEncodeEntities()
18257 * HTMLparser.c: fixed an ignorable white space detection bug
18258 occurring when parsing with SAX only
18259 * result/HTML/*.sax: updated since the output is now HTML
18260 encoded...
18261
18262 Mon Aug 28 00:38:31 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>18263
18264 * HTMLparser.[ch]: applied some of Wayne Davison
18265<EMAIL_ADDRESS>patches
18266
18267 Sun Aug 27 22:14:01 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>18268
18269 * SAX.c tree.c debugXML.c: fixed bogus behaviour when an
18270 undeclared namespace prefix was used, added a warning.
18271 Cleaned up support w.r.t. entities, spilling out a warning
18272 and being pedantic on lookups.
18273 * test/warning/ent9 : added testcase for previous example.
18274 * TODO: updated
18275 * parserInternals.h parser.c: changed the way names are parsed
18276 now allow infinite size and decrease penalty for normal use
18277 * parser.c: Started a big cleanup/check of the parser code,
18278 fixed some of the most tortuous entity code, spotted code
18403 * xmlmemory.c: fixed a stupid bug on the routine to override
18404 allocation functions
18405 * TODO: updated
18406
18407 Fri Jul 14 17:01:14 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>18408
18409 * doc/ regenerated the docs
18410
18411 Fri Jul 14 16:12:20 MEST 2000 Daniel Veillard<EMAIL_ADDRESS>18412
18413 * doc/encoding.html doc/xml.html: added I18N doc
18414 * encoding.[ch] HTMLtree.[ch] parser.c HTMLparser.c: I18N encoding
18415 improvements, both parser and filters, added ASCII & HTML,
18416 fixed the ISO-Latin-1 one
18417 * xmllint.c testHTML.c: added/made visible --encode
18418 * debugXML.c : cleanup
18419 * most .c files: applied patches due to warning on Windows and
18420 when using Sun Pro cc compiler
18421 * xpath.c : cleanup memleaks
18422 * nanoftp.c : added a TESTING preprocessor flag for standalong
18423 compile so that people can report bugs more easily
18424 * nanohttp.c : ditched socklen_t which was a portability mess
18425 and replaced it with unsigned int.
18426 * tree.[ch]: added xmlHasProp()
18427 * TODO: updated
18428 * test/ : added more test for entities, NS, encoding, HTML, wap
18429 * configure.in: preparing for 2.2.0 release
18430
18431 Mon Jul 10 16:17:18 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>18432
18433 * nanoftp.c: fixed the way the control connection is handled
18434 * libxml.spec.in: fixed the dependencies and cleanup
18435
18436 Mon Jul 3 14:37:07 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>18437
18438 * doc/xml.html: changed the xmlsoft.org structure, updated the
18439 examples w.r.t. root and childs
18440
18441 Sun Jul 2 20:51:43 MEST 2000 Daniel Veillard<EMAIL_ADDRESS>18442
18443 * libxml.spec.in: fixed bug #7419, dependencies fouled for libxml-devel
18577 Wed Apr 5 20:36:46 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>18578
18579 * xmllint.c: forgot to commit this too ?
18580
18581 Wed Apr 5 16:22:44 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>18582
18583 * xmlversion.h.in : forgot to commit this previously
18584
18585 Mon Apr 3 21:47:10 CEST 2000 Daniel Veillard<EMAIL_ADDRESS>18586
18587 * configure.in: preparing libxml-2.0.0 version looks Ok so far
18588 * README TODO: updated for release
18589 * uri.c uri.h: added authority parsing/saving
18590 * uri.c testURI.c Makefile.am: moved the testing code to testURI.c
18591 * xmlversion.h.in configure.in nanoftp.[ch] nanohttp.[ch] encoding.h
18592 debugXML.[ch] xpath.[ch] xmlIO.c tester.c testXPath.c testHTML.c
18593 tree.c HTMLtree.c HTMLparser.c tree.c tree.h parser.c
18594 Makefile.am : added compile-time customization of libxml
18595 --with-ftp --with-http --with-html --with-xpath --with-debug
18596 --with-mem-debug
18597 * *.[ch] autoconf.sh : moved to an absolute addressing of includes :
18598 #include <libxml/xxx.h> I hope it won't break too much stuff
18599 and will be manageable in the future...
18600 * xmllint.c Makefile.am libxml.spec.in : renamed tester.c to xmllint.c
18601 and added xmllint to the installed programs
18602 * uri.h: added xmlFreeURI()
18603
18604 Fri Mar 24 14:35:21 CET 2000 Daniel Veillard<EMAIL_ADDRESS>18605
18606 * uri.c uri.h: finished the escaping handling, the base support
18607 and the URI path normalization. Looks good just lacks the
18608 authority content parsing code.
18609 * Makefile.am: added instructions to generate testURI
18610 * TODO: updated
18611 * doc/xml.html, doc/smallfootonly.gif doc/w3c.png: updated,
18612 added links and icons for W3C and Gnome
18613
18614 Mon Mar 20 14:05:26 CET 2000 Daniel Veillard<EMAIL_ADDRESS>18615
18616 * xmlmemory.[ch] : seems I forgot to actually update the files in
18617 the last commit :-)
18618 * doc/xml.html doc/html/* : updated and uploaded the docs
18619
18620 Mon Mar 20 12:33:51 CET 2000 Daniel Veillard<EMAIL_ADDRESS>18621
18622 * test/valid/dtds/xhtml*: removed RCS infos (pain with CVS)
18623 * TODO: updated
18624 * xmlmemory.[ch] : added xmlMemSetup() and xmlMemGet() to override
18625 libxml default allocation function with another set (like gmalloc/
18626 gfree).
18627 * Makefile.am, uri.c, uri.h: added a set of functions to do
18628 exact (literally copied from the RFC 2396 productions) parsing
18629 and handling of URI. Will be needed for XLink, one XML WFC,
18630 XML Base and reused in the nano[ftp/http] modules. Still work
18631 to be done.
18632
18633 Tue Mar 14 20:52:35 CET 2000 Daniel Veillard<EMAIL_ADDRESS>18634
18635 * configure.in, libxml.spec.in : libxml2
18636 * doc/* : updated the doc page, rebuilt the docs
18637
18638 Tue Mar 14 19:11:29 CET 2000 Daniel Veillard<EMAIL_ADDRESS>18639
18640 * all: tagged LIB_XML_1_X
18641 * *.c *.h : updated from W3C CVS tree
18642 * configure.in : 2.0.0-beta
18643 * libxml.spec.in : libxml2 package nam
18644 * result/* : new version of the tests output
18645
18646 Mon Mar 6 09:34:52 CET 2000 Daniel Veillard<EMAIL_ADDRESS>18647
18648 * doc/xml.html, doc/update.html: updated docs, 1.8.7
18671 this is hard. Left a flag for that purpose. Fixed bug #6766
18672 * configure.in: prepared 1.8.7 not released, due to previous
18673 problem
18674
18675 Thu Mar 2 03:03:50 CET 2000 Daniel Veillard<EMAIL_ADDRESS>18676
18677 * doc/xml.html : applied second patch from Paul DuBois
18678
18679 Tue Feb 29 23:55:13 CET 2000 Daniel Veillard<EMAIL_ADDRESS>18680
18681 * doc/xml.html : applied patch from Paul DuBois
18682
18683 Thu Feb 3 16:36:39 CET 2000 Daniel Veillard<EMAIL_ADDRESS>18684
18685 * parser.c HTMLparser.c: do a bit of bufferization in push mode.
18686
18687 Thu Feb 3 15:59:37 CET 2000 Daniel Veillard<EMAIL_ADDRESS>18688
18689 * nanoftp.c nanohttp.c tree.c HTMLtree.[ch] debugXML.c xpath.c: Fixed
18690 compilation warnings on various platforms.
18691 * parser.c: Fixed #5281 validity error callbacks are now deactivated
18692 by default if not validating.
18693
18694 Thu Feb 3 13:46:14 CET 2000 Daniel Veillard<EMAIL_ADDRESS>18695
18696 * nanoftp.c, win32config.h.in: patches to compile on WIN32
18697
18698 Wed Feb 2 22:51:16 CET 2000 Daniel Veillard<EMAIL_ADDRESS>18699
18700 * nanoftp.c: snprintf/sprintf patch courtesy George Katsirelos
18701<EMAIL_ADDRESS>18702
18703 Mon Jan 31 18:58:21 CET 2000 Daniel Veillard<EMAIL_ADDRESS>18704
18705 * nanoftp.c nanohttp.c: Fixed '#' and '?' stripping when
18706 processing URLs
18707
18708 Mon Jan 31 14:25:57 CET 2000 Daniel Veillard<EMAIL_ADDRESS>18709
18710 * nanoftp.[ch]: cleanup, bug fixes, integration in rpmfind, added
18711 xmlNanoFTPUpdateURL for persistent control connections.
19108 * libxml.spec.in: fixed the URL
19109 * doc/xml.html: improved the documentation front-end
19110
19111 Fri Sep 24 01:06:36 CEST 1999 Daniel Veillard<EMAIL_ADDRESS>19112
19113 * nanohttp.c: conditionned references to snprintf with HAVE_SNPRINTF
19114
19115 Fri Sep 24 00:15:58 CEST 1999 Daniel Veillard<EMAIL_ADDRESS>19116
19117 * libxml.spec.in: fixed the alpha compile problem
19118 * parser.[ch]: changed errno to errNo in the parser context :-(
19119 * *.[ch]: changed CHAR to xmlChar to avoid problem on WIN32
19120 * doc/xml.html: changed CHAR to xmlChar
19121 * doc/html/*: recompiled the documentation
19122 * configure.in: 1.7.1
19123
19124 Wed Sep 22 11:40:31 CEST 1999 Daniel Veillard<EMAIL_ADDRESS>19125
19126 * parser.h: modified the parser context struct to regain 1.4.0
19127 binary compatibility
19128 * parser.c, xml-error.h: added errno to the context and defined
19129 a set of errors values with update of errno
19130 * nanohttp.[ch]: minimalist HTTP front-end for fetching remote
19131 DTDs and entities
19132 * *.h, *.c: complete cleanup of the use of config.h and include
19133 protection depending on the current setup.
19134 * overalll debugging, maintenance and bug-fixing on all modules
19135 * updated the documentation
19136 * ready for 1.7.0
19137
19138 Wed Sep 8 22:46:14 CEST 1999 Daniel Veillard<EMAIL_ADDRESS>19139
19140 * HTMLparser.c : cleanup
19141 * SAX.c valid.c valid.h: added ID/IDREF checking
19142 * tree.c tree.h: extended doc structure for refs
19143 * configure.in: 1.6.2
19144 * parser.c: patched bug in SAX user arg call
19145 * parserInternals.h: patched missing close in C++ wrapping
19146 * testXPath.c xpath.c xpath.h: prepared for extensibility,
19147 especially upcoming XPointer implementation.
19148 * doc/xml.html: augmented, typo
19545 Tue Oct 27 17:54:00 EST 1998 Daniel Veillard<EMAIL_ADDRESS>19546
19547 * debugXML.h debugXML.c: added debugging utilities.
19548 * tester.c: added --debug switch.
19549 * tree.c: patched an incorrect node->type assignment.
19550 * parser.c: formatting, ensure that node->doc != NULL in attributes
19551
19552 Tue Oct 27 01:15:39 EST 1998 Daniel Veillard<EMAIL_ADDRESS>19553
19554 * parser.[ch] SAX.c tree.[ch]: large amount of changes to improve
19555 entity support and provide an internal representation close to
19556 DOM one (entity ref nodes, and attribute value as tree). I tried
19557 to preserve the interface but this will surely break some apps
19558 (I have to change rpm2html/rpmfind for example). I had to change
19559 two interfaces, and the generated tree is somewhat different.
19560 * doc/* : started documenting the XML library, the tree and
19561 DOM/Corba. This is a first step.
19562
19563 Sat Oct 24 14:23:51 EDT 1998 Daniel Veillard<EMAIL_ADDRESS>19564
19565 * parser.c: Set up the functions comment block, boring but useful.
19566 * parser.h, SAX.c, parser.c: now attributes are processed through
19567 the SAX interface. The problem is that my SAX interface diverged
19568 quite a bit from the original one, well this is not an official
19569 spec, and translating it from Java to C is hairy anyway...
19570
19571 Tue Oct 20 02:11:21 EDT 1998 Daniel Veillard<EMAIL_ADDRESS>19572
19573 * SAX.c, entities.c, tree.c, encoding.c, error.c: Set up the
19574 functions comment block, boring but useful.
19575
19576 Sun Oct 18 20:40:58 EDT 1998 Daniel Veillard<EMAIL_ADDRESS>19577
19578 * encoding.[ch], Makefile.am: Added the UTF-8, UTF-16 and ISO Latin 1
19579 conversion routines. However they are not yet used to convert the
19580 inputs. The core will run with UTF-8.
19581
19582 Sun Oct 18 15:08:19 EDT 1998 Daniel Veillard<EMAIL_ADDRESS>19583
19584 * tree.c : make sure that the type id is properly set-up when
19585 a new object is allocated, needed for DOM.
19586
19587 Sat Oct 17 02:43:21 EDT 1998 Daniel Veillard<EMAIL_ADDRESS>19588
19589 * tree.h, tree.c: Ok, the main objects in the tree will be native
19590 corba objects, it costs 8 bytes per Node, Attribute and Document
19591 but it simplifies the Corba integration a lot (no extra interface
19592 objects to allocate/free).
19593
19594 Tue Oct 13 21:46:57 EDT 1998 Daniel Veillard<EMAIL_ADDRESS>|


South Asia has almost a population of 2 billion people, made up of different ethnicities, languages and religions. South Asian food as a result is very diverse but with many common herbs and spices used in most of the dishes. Reflecting the diversity of the continent, there are many different street foods and variations of the same street foods. Here are some of the most common and some of my favourite street food dishes.
Chai (tea) is one of the most common drinks in South Asian culture. There are many different types of Chai belonging to different areas of the continent. Kashmiri Chai (also known as Pink Tea or Noon Chai) is the most common Chai in the Kashmir region. Kashmiri Chai is made from a rich blend of spices, sugar, salt, milk and pistachios.
Samosa Chaat is a combination of two common snacks with the addition of extra sauce; Samosas and chaat. This dish has variaitons but it is usually the layering of a Samosa, chickpeas in a creamy sauce, yogurt, tamarind sauce, and various garnishings. The rich blend of flavours come together to make a tantalising snack or starter.
Masala Fish is fish, usually tillapia, marinated in a spicy sauce and fried to perfection. Masala Fish makes a tasty starter on it's own or can be a main with a side of Naan. It can even be turned into a burger!
Gol Guppay, also known as Paani Puri, are fried balls of dough with varying chickpea, potato or onion fillings, and a tamarind or chutney sauce to go into the puri's. This tangy mouth-watering snack is a very common street food throughout India and Pakistan.


Watir 6.4.0.rc1 is now available on RubyGems. This is the performance release you didn’t realize you’ve been waiting for. Please help us test this new code before the official release.
To install:
or in your Gemfile:
Performance!
Watir development over the past year has focused on useful new features and facilitating increased test reliability. For the most part we’ve done a good job of accomplishing this without dramatically affecting performance.
Now that I’m working at Sauce Labs, though, one of our clients approached me to discuss how slow he felt his tests were using Watir. Fortunately, I recently created a basic test suite for my SauceCon presentation that I implemented in both Selenium and Watir to show off Watir syntax. When running locally, the tests written in Watir took about 15% longer than the exact necessary code in straight Selenium. This performance loss is well worth the trade-off of increased reliability of results, readability of code, and decreased time of writing and maintaining code. Unfortunately, when running these tests on Sauce Labs I found that the Watir suite ran significantly more slowly. This will likely be the case for anyone running on a remote grid due to the extra latency for the wire calls.
The changes in this Release Candidate appear to decrease run times by about 10% when run locally, and decrease run times on Sauce Labs by 50% - 66%.
Please try out the new gem on your test suites. We’re interested in finding out about new unexpected exceptions as a result of this change, but feedback on how much it speeds up your tests.
Thanks!
See the Changelog for the complete history of updates.


2.4 : Addition and Subtraction
It's finally here! We finally made it to the part where we add and subtract! For our purposes and for ease, we'll be using two's complement when dealing with negative values. Also, for ease, we will only be adding integers. Integers are numbers without decimals and fractions.
Addition
Addition is handled exactly the same way as in base-10. We go bit by bit, starting with the smallest and working up. So 0 + 0 = 0. 0 + 1 = 1. 1 + 0 = 1. 1 + 1 = 0 and then we carry the one to the next bit. Let's add two 8 bit values together. Let's add 00011101 and 10011010.
| Carry | 1 | 1 | ||||||
|---|---|---|---|---|---|---|---|---|
| Value 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 |
| + Value 2 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 |
| = Result | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 |
So this means 000111012 + 100110102 = 101101112. Let's check our work though. As far as I know, our binary skills are not perfect. We don't know off the top of our heads if this is correct. Let's convert these numbers to base 10 then check. 000111012 is 2910. 100110102 is 15410. 101101112 is 18310. 2910 + 15410 = 18310. Looks like we did a good job!
Subtraction
Subtraction, believe it or not, works just like base-10. You negate the value, then add. Of course, since we're working with base-2, we negate using two's complement. So this time, let's subtract 00011101 from 10011010 First let's negate 00011101.
Now lets add with our table again. 00011101 + 11100011
| Carry | 1 | |||||||
|---|---|---|---|---|---|---|---|---|
| Value 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 |
| + Value 2 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 |
| = Result | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 |
Our result is 01111101. This, in base 10 is 125. If we check our work again 154 - 29 = 125. One thing to notice is the leftmost bit. As you can see 1 + 1 is equal to 0 with a carry of 1. However, we don't have room for a carry! In the next section on overflow, I'll cover this. Right now, let's ignore it.
Overflow
So overflow is one of the many reasons we use twos complement when doing math. I'm going to explain using 4 bit numbers for ease of demonstration. Let's look at our twos complement number.
| MSB | Value | Value | Value |
|---|---|---|---|
| 0 | 1 | 1 | 0 |
So the MSB, as we mentioned earlier in the
Negative Binary Section,
is the most significant bit that tells us if the number is positive or negative.
The other values are values that actually matter when we add and subtract.
So let's do a problem in twos complement.
0110 + 0100 = 1010
6 + 4 = -6
So how did two positive numbers add together to create a negative number?
So while a 4 bit number may have a range of 0-15 unsigned, when we sign the number,
the range is now -8-7.
This is much easier to think of as a wheel.
In this wheel I just counted up one by one in binary. If we consider these to be twos complement numbers, we get the following base ten values.
So when we add or subtract we work our way around the wheel. Once again, lets consider 0110 + 0100. If we start at the 6 position on th circle, we step around four places. We then get to -6. If we keep adding, we'd eventually get a 5 bit number, however, since we're only working in 4 bits, we'd lose those bits.
Practice Problems
What is the 4 bit value you get when you add 0011 and 1010?
What is the 4 bit value you get when you subtract 0011 from 1010? Make sure you check your work!


Organizer
Head of Marketing and Design
Co Organizer
Head of Sponsorship and Finance
Organizing Exceutive
Head of Logistics & Hospitality
Organizing Exceutive
Technical Head
© 2019 Onyemenam Ndubuisi
Subscription Request Successfully placed!
Your Message successfully sent!


Nicole Raph, also known as "Niq", is the wedding, family, and special occasion photographer. She is the owner of You-Nique Photography.
Education:California Art Institute : Applied Photography
Hometown:Sacramento, CA
"We live everyday filling our days with memories, but sometimes we forget those memories. Capturing these moments in photos will make them unforgettable."
Our photographers have a passion for creativity, and are adequately able to change with the times. Our photographers aim to adapt in any ways necessary to meet someone elses photographic expectations. We ensure that we can separate ourselves from other photographers in the industry based on our unique style, and artistry when it comes to our photos. In addition, we plan to seek out other works done by famous photographers to learn and grow as much as possible. We also intend to further our education as much as possible to grow and develop our artistic skills. We intend to tell a visual story, one that our clients will cherish for the rest of their lives.


{% load account_tags documents_tags %}
{% if members %}| Type | Name | Actions | {% for member in members %}|
|---|---|---|---|
|
{{ member.name }} Updated {{ member.modified|date:"N j, Y" }} by {% user_display member.modified_by %} {% if member.shared_ui %}[shared]{% endif %} |
No folders or files
{% endif %}


This is a list of all projects developed on this site. Currently, there is only one.
- One-Dimensional Avalanche Piano Roll
-
This runs avalanches on a one-dimensional lattice (that does not loop around) and
renders them in a piano-roll that shows where they occur in time, the idea being to see if
they might lend themselves to particle analysis.


LOGIN
CART
HAIR ACC
PHONE CASE
WALLET
Iridescent Ball Cap [GOLD PINK]
₩22,800
Damaged Tie-Dye Beanie Dusty Pink
₩29,000
Contrast Stitch Ball Cap Cream
₩36,100
Puppy Talk Phone Case Clear
₩20,900
Logo Phone Case Black
₩16,200
Cordura Folding Wallet [BLACK]
₩23,200


Match Play. 0-0 to 5. Should Red redouble? If, redoubled, should White take?
pips Red=126 White=137
(CorrectAnswer= 0/0, ErrorScore= 0)
The volatility is sky high so Red should definitely redouble. Not redoubling is nearly a blunder.
However, White has plenty of winning chances even if Red makes his 5-pt (note that 11 doesn’t make the full prime) as he has a very effective four-point prime of his own and Red may not be able to escape his rear checkers.
It is easy to be pessimistic as White, but he wins from here nearly a third of the time, so it is an easy take and nearly a double blunder to drop. Of course, Red may win a gammon and the match but that doesn’t mean it is not a take.
However, White has plenty of winning chances even if Red makes his 5-pt (note that 11 doesn’t make the full prime) as he has a very effective four-point prime of his own and Red may not be able to escape his rear checkers.
It is easy to be pessimistic as White, but he wins from here nearly a third of the time, so it is an easy take and nearly a double blunder to drop. Of course, Red may win a gammon and the match but that doesn’t mean it is not a take.
Cube analysis 2-ply cubeless equity +0.600 (Money: +0.541) 0.672 0.271 0.013 - 0.328 0.083 0.004 Cubeful equities: 1. Double, take +0.844 2. Double, pass +1.000 (+0.156) 3. No double +0.764 (-0.080) Proper cube action: Redouble, take


Here come some stunning examples of data visualizations, all built with R. R code of each diagram is available at the source. Enjoy! #beautiful.
UPDATE: I’ve included links to the R source!
Plotting geo maps along with subplots in ggplot2
I like this one by Ilya Kashnitsky:
Similarly, by the same author:
Great work, @ikashnitsky!
Cirlize (Chord) diagrams
Plotting association in a circular form yields aesthetic examples of diagrams, see the following examples
Source: This work is from Zuguang Gu; see his package circlize. He is also the author from the corresponding free online book.
Grey is your best friend
Providing contect to your data is an important principle in data viz. For example, show the overall data when you focus on a subgroup.
Simon Jackson (@drsimonj) gives a great example:
Beautitful scatter plots
Again, Simon Jackson does it:
Maps with grid
Source: See many more examples of nice diagrams at The R Graph Gallery
Clean chloropleth map
An example of a clean chloropleth map, again from The R Graph Gallery
For a different choroplatht example using ggplot
and geom_sf
, check out this post.
Pirate attack
Pirate plots, by Nathaniel Philips, are available by the R package yarrr.
From the documentation on this page:
The pirateplot function creates a pirateplot, a transparent (both literally and figuratively) plot for displaying continuous data as a function of 1, 2, or 3 discrete variables. Unlike traditional plots, like barplots and boxplots, the pirateplot shows both raw data (jittered points), descriptive statistics (line and/or bar), and inferential statistics (95% Bayesian Highest Density Intervals or Confidence Intervals), in one plot. While the default plot shows all these elements, the user can easily customize the transparency of each element using additional arguments. See ?pirateplot or https://CRAN.R-project.org/package=yarrr for more details
Clean R graphs comependium
The Compendium of Clean Graphs in R presents a gallery of, surprise, clean graphs. The graphs are often “simple” in the sense that they do not convey a hell of a lot information, and graph junk is seriously avoied. Many examples are suitable for academia settings.
Survey results with Thomas Rahlf’s book
This example from Thomas Rahlf’s book Data Design with R is nice:
Again suitable for survey results, but somewhat more advanced:
Unfortunately, the R code from Thomas Rahlf’s book is not freely available; however, it is presented in detail in the book.
Heatmap
By Thomas Rahlf again; there are many examples of heat or tile maps, but this is one is particularly nice - although made with base R, no ggplot.
Time series
This one by Thomas Rahlf is nice:
Similarly, and “cleaner”:
)
Cab drivers in NYC
Todd Schneider did a great job in this post where he anylzed 1.1 billion cab drives in NYC. Particularly, the visualization of the “cab density” is appealing:
Source; in this file in his Github repo resides most of the R code.
Enjoy & More
There a many more great data viz examples out there, including those build on R. I find this curation quite nice.


We care about designing Web APIs that developers will love.
How many times did you experienced to integrate APIs?
In computer programming, an application programming interface (API) is a set of subroutine definitions, protocols, and tools for building application software. In general terms, it is a set of clearly defined methods of communication between various software components.
Source: https://en.wikipedia.org/wiki/Application_programming_interfaceRepresentational state transfer (REST) or RESTful web services are a way of providing interoperability between computer systems on the internet.
You have to get the design right, because design communicates how something will be used. The question becomes - what is the design with optimal benefit for the app developer?
The number one principle in pragmatic RESTful design is: keep simple things simple.
The base URL is the most important design affordance of your API. A simple and intuitive base URL design makes using your API easy.
Why are there pull handles on a push door?
Our HTTP verbs are POST, GET, PUT, and DELETE. Think of them as mapping to the acronym, CRUD (Create-Read-Update-Delete).
| Resource | POST create |
GET read |
PUT update |
DELETE delete |
|---|---|---|---|---|
| /dogs | Create a new dog | List dogs | Bulk update dogs | Delete all dogs |
| /dogs/1234 | Error | Show Blacky | If exists update Blacky | Delete Blacky |
The point is that developers probably don't need the chart to understand how the API behaves. They can experiment with and learn the API without the documentation.
Should you choose singular or plural nouns for your resource names? You'll see popular APIs use both. Let's look at a few examples:
| Foursquare | GroupOn | Zappos |
|---|---|---|
| /checkins | /deals | /Product |
Achieving pure abstraction is sometimes a goal of API architects. However, that abstraction is not always meaningful for developers.
Take for example an API that accesses content in various forms - blogs, videos, news articles, and so on.
An API that models everything at the highest level of abstraction - as /items or /assets in our example - loses the opportunity to paint a tangible picture for developers to know what they can do with this API. It is more compelling and useful to see the resources listed as blogs, videos, and news articles.
The level of abstraction depends on your scenario. You also want to expose a manageable number of resources. Aim for concrete naming and to keep the number of resources between 12 and 24.
In summary, an intuitive API uses plural rather than singular nouns, and concrete rather than abstract names.
Resources almost always have relationships to other resources.
Let's look again at the API we modeled in nouns are good, verbs are bad - the API that interacts with our dogs resource.
We're using HTTP verbs to operate on the resources and collections. Our dogs belong to owners. To get all the dogs belonging to a specific owner, or to create a new dog for that owner, do a GET or a POST:
| GET | /owners/5678/dogs |
| POST | /owners/5678/dogs |
It's not uncommon to see people string these together making a URL 5 or 6 levels deep. Remember that once you have the primary key for one level, you usually don't need to include the levels above because you've already got your specific object.
In other words, you shouldn't need too many cases where a URL is deeper
/resource/identifier/resourceMost APIs have intricacies beyond the base level of a resource. Complexities can include many states that can be updated, changed, queried, as well as the attributes associated with a resource.
Make it simple for developers to use the base URL by putting optional states and attributes behind the HTTP question mark. To get all red dogs running in the park:
GET /dogs?color=red&state=running&location=parkIn summary, keep your API intuitive by simplifying the associations between resources, and sweeping parameters and other complexities under the rug of the HTTP question mark.
We software developers, don't always like to think about exceptions and error handling but it is a very important piece of the puzzle for any software developer, and especially for API designers.
Why is good error design especially important for API designers?
From the perspective of the developer consuming your Web API, everything at the other side of that interface is a black box. Errors therefore become a key tool providing context and visibility into how to use an API.
How to think about errors in a pragmatic way with REST?
HTTP Status Code: 200
{"type" : "OauthException", "message":"(#803) Some of the aliases you requested do not exist: foo.bar"}
No matter what happens on a Facebook request, you get back the 200-status code - everything is OK. Many error messages also push down into the HTTP response. Here they also throw an #803 error but with no information about what #803 is or how to react to it.
HTTP Status Code: 401
{"status" : "401", "message":"Authenticate","code": 20003, "more info": "http://www.twilio.com/docs/errors/20003"}
Twilio does a great job aligning errors with HTTP status codes. Like Facebook, they provide a more granular error message but with a link that takes you to the documentation. Community commenting and discussion on the documentation helps to build a body of information and adds context for developers experiencing these errors.
HTTP Status Code: 401
{"code" : 401, "message": "Authentication Required"}
SimpleGeo provides error codes but with no additional value in the payload.
Use HTTP status codes and try to map them cleanly to relevant standard-based codes.
Most API providers use a small subset. For example, the Google GData API uses only 10 status codes; Netflix uses 9, and Digg, only 8.
| 200 | 201 | 304 | 400 | 401 | 403 | 404 | 409 | 410 | 500 |
| 200 | 201 | 304 | 400 | 401 | 403 | 404 | 412 | 500 |
| 200 | 400 | 401 | 403 | 404 | 410 | 500 | 503 |
How many status codes should you use for your API?
There are really only 3 outcomes in the interaction between an app and an API:
We can start by using the following 3 codes. If you need more, add them. But we shouldn't need to go beyond 8.
Additional
In summary, be verbose and use plain language descriptions. Add as many hints as your API team can think of about what's causing an error.
It is highly recommend to add a link in description for more information, like Twilio does.
Versioning is one of the most important considerations when designing your Web API.
Never release an API without a version and make the version mandatory.
API providers handle versioning
| Twilio | /2010-04-01/Accounts/ |
| salesforce.com | /services/data/v20.0/sobjects/Account |
| ?v=1.0 |
Twilio uses a timestamp in the URL (note the European format).
At compilation time, the developer includes the timestamp of the application when the code was compiled. That timestamp goes in all the HTTP requests
Salesforce.com uses v20.0, placed somewhere in the middle of the URL.
We like the use of the v. notation. However, we don't like using the .0 because it implies that the interface might be changing more frequently than it should. The logic behind an interface can change rapidly but the interface itself shouldn't change frequently.
Facebook also uses the v. notation but makes the version an optional parameter.
This is problematic because as soon as Facebook forced the API up to the next version, all the apps that didn't include the version number broke and had to be pulled back and version number added.
Never release an API without a version. Make the version mandatory.
Specify the version with a 'v' prefix. Move it all the way to the left in the URL so that it has the highest scope (e.g. /v1/dogs).
Use a simple ordinal number. Don't use the dot notation like v1.2 because it implies a granularity of versioning that doesn't work well with APIs--it's an interface not an implementation. Stick with v1, v2, and so on.
Maintain at least one version back.
At least one cycle to react before obsoleting a version.
Sometimes that's 6 months; sometimes it’s 2 years. It depends on developers' development platform, application type, and application users. For example, mobile apps take longer to rev’ than Web apps.


Passwordless login, no more credentials databases to be hacked.
Create your digital identity
Signup to web sites without filling a single form
Get recognized! The website automatically authenticates you
Sign up to receive our white paper and learn how you could be protecting your users data today
Sign up to receive our white paper and learn how you could be protecting your users data today
DownloadYour data under Your control. Passparyou creates a personal digital identity in Blockchain's decentralized network that absolutely no one is able to manipulate.
We allow friction-less Login and Sign-up to your favourite sites. No more dull registration procedures or password headaches!
Integration to your website is as simple as sending RESTful requests! We take care of the rest. Clear and exhaustive documentation.
Lorem ipsum dolor sit amet consectetur adipiscing elit un paramesot eger consequat ex sitvalor amet mattis etiam in dui diam bibendum in congue eget vel dolor.
Lorem ipsum dolor sit amet consectetur adipiscing paramesoteger consequat ex sitvalor amet mattis .
Lorem ipsum dolor sit amet consectetur adipiscing paramesoteger consequat ex sitvalor amet mattis .
Lorem ipsum dolor sit amet consectetur adipiscing paramesoteger consequat ex sitvalor amet mattis .
Lorem ipsum dolor sit amet consectetur adipiscing paramesoteger consequat ex sitvalor amet mattis.


Online Order Form
Please fill in the following details:
First name:
Last name:
Address:
City:
State:
Zip:
How would you like to pay for this console?
Mastercard
Visa
American Express
Maestro
Please enter your card number:
Please take care that everything is filled up correctly!


--- layout: default ---
You can subscribe to HEWN, the Hack Education Weekly Monthly Newsletter here. All my writing, whether posted on Hack Education or my personal website, will be sent out via email this way.
Image credits: Bryan Mathers


Next:
Relativistic Kinetic Equation
This note discusses what is runaway problem and how to define and calculate the runaway rate.
Relativistic Kinetic Equation
Runaway problem
Runaway rate
Boundary condition
Collision operator
Effective temperature
Normalization
Numerical results
Steady-state of distribution
Runaway rate
Manuscript
Bibliography
About this document ...
YouJun Hu 2012-12-08


AFC Telford boss Gavin Cowan amazed by ‘wonderful’ Ellis Deeney
by Lewis CoxAFC Telford boss Gavin Cowan heaped praise on ‘re-energised’ Ellis Deeney after the all-action midfielder battled back from a severe bug.
Deeney missed two games through the illness – back-to-back defeats against Boston and Curzon Ashton – but returned to put in a ‘wonderful’ performance, according to Cowan, in the 2-2 draw with high-flying Spennymoor.
The Bucks chief revealed club staff were concerned about the midfielder’s well-being after the 4-1 win over Guiseley exactly a month ago.
“What I would say is the midfield were just awesome,” said Cowan. “Ellis was re-energised. Supporters won’t know this but Ellis has been suffering from three or four weeks with quite a bad bug.
“He probably played a couple of games where he was under the weather but didn’t want to come out because he has that loyalty to his team-mates.
“But he’s back at it and it’s great to have him back to full health and fitness.
“I think the last game he played was Guiseley, where he played well, and afterwards he came in to the physio room and was really struggling.
“Something wasn’t quite right with fatigue, we were concerned for a while. But we got over a couple of weeks and he’s come back all clears. Everybody is happy. Credit to Ellis, he put in quite a wonderful performance.”
Deeney, 28, has made 72 appearances in his two years at Telford, and wore the captain’s armband in place of Shane Sutton against the Moors.


#%hide_minmax_price_begin%#
| This AdLink currently has available #%c_now%# clicks. You can use this form to add clicks to it. |
| Price for 1 click |
Minimal price: #%currency%##%price_min%# |
Maximal price: #%currency%##%price_max%# |
#%hide_minmax_price_end%#
| Add Clicks by Using Funds on Your Account |
| Your current account balance: #%currency%##%funds_balance%#. Purchase new funds |
| Add Clicks & Pay by PayPal or A Credit Card |


Recipe 2.10. Handling a zip File Inside a StringCredit: Indyana Jones ProblemYour program receives a zip file as a string of bytes in memory, and you need to read the information in this zip file. SolutionSolving this kind of problem is exactly what standard library module cStringIO is for: import cStringIO, zipfile class ZipString(ZipFile): def _ _init_ _(self, datastring): ZipFile._ _init_ _(self, cStringIO.StringIO(datastring)) DiscussionI often find myself faced with this taskfor example, zip files coming from BLOB fields in a database or ones received from a network connection. I used to save such binary data to a temporary file, then open the file with the standard library module zipfile. Of course, I had to ensure I deleted the temporary file when I was done. Then I thought of using the standard library module cStringIO for the purpose . . . and never looked back. Module cStringIO lets you wrap a string of bytes so it can be accessed as a file object. You can also do things the other way around, writing into a cStringIO.StringIO instance as if it were a file object, and eventually recovering its contents as a string of bytes. Most Python modules that take file objects don't check whether you're passing an actual filerather, any file-like object will do; the module's code just calls on the object whatever file methods it needs. As long as the object supplies those methods and responds correctly when they're called, everything just works. This demonstrates the awesome power of signature-based polymorphism and hopefully teaches why you should almost never type-test (utter such horrors as if type(x) is y, or even just the lesser horror if isinstance(x, y)) in your own code! A few low-level modules, such as marshal, are unfortunately adamant about using "true" files, but zipfile isn't, and this recipe shows how simple it makes your life! If you are using a version of Python that is different from the mainstream C-coded one, known as "CPython", you may not find module cStringIO in the standard library. The leading c in the name of the module indicates that it's a C-specific module, optimized for speed but not guaranteed to be in the standard library for other compliant Python implementations. Several such alternative implementations include both production-quality ones (such as Jython, which is coded in Java and runs on a JVM) and experimental ones (such as pypy, which is coded in Python and generates machine code, and IronPython, which is coded in C# and runs on Microsoft's .NET CLR). Not to worry: the Python Standard Library always includes module StringIO, which is coded in pure Python (and thus is usable from any compliant implementation of Python), and implements the same functionality as module cStringIO (albeit not quite as fast, at least on the mainstream CPython implementation). You just need to alter your import statement a bit to make sure you get cStringIO when available and StringIO otherwise. For example, this recipe might become: import zipfile try: from cStringIO import StringIO except ImportError: from StringIO import StringIO class ZipString(ZipFile): def _ _init_ _(self, datastring): ZipFile._ _init_ _(self, StringIO(datastring)) With this modification, the recipe becomes useful in Jython, and other, alternative implementations. See AlsoModules zipfile and cStringIO in the Library Reference and Python in a Nutshell; Jython is at http://www.jython.org/; pypy is at http://codespeak.net/pypy/; IronPython is at http://ironpython.com/. |


?6
7
8
9
10
the
New
York
copyright
reserved
botanical
Garden
DAUBENY
HERBARIUM
(FHO)
University
of
Oxford
Flora
of
Grenada
Family:
Fabaceae
Name:
Andira
inermis
(Wright)
Kunth
ex
DC.
Locality:
Grenada,
St.
Andrew,
Grand
Etang,
roadside
near
Grand
Etang.
12°06'N.
61°42'W
Notes:
Tree
7
m
tall.
LEAVES:
US
glossy,
midrib
channelled;
LS
secondaries
not
raised.
FLOWERS:
buds
pale
yellow.
(RHS
colour
code:
Leaf
upper
=l46A,
below=146A)
»York
Botanical
Garden
BOTANICAL
OARDE**
Collector:
Hawthorne,
W.
D.,
Cable,
S.
&
Jules,
D.
Number:
625
Date:
22
June
2001
Distribution:
FHO
1615821
Legend -
Level of confidence that token is an accurately-transcribed word
extremely low
very low
low
undetermined
medium
high
very high


-
Bad Notes on Venture Capital
www.bothsidesofthetable.com
This week. On the phone ... Me: So, you raised venture capital? Him: Yeah. We raised a seed round. About $1 million. Me: At what price? Him: It ...
-
Zenefits’ Leader Is Rattling an Industry, So Why Is He Stressed Out? - ...
www.nytimes.com
Parker Conrad’s start-up, Zenefits, is thought to be one of the fastest-growing companies in recent Silicon Valley history, and his investors and ...
-
Burn Baby Burn – AVC
avc.com
Andy sent me a WSJ piece with Bill Gurley yesterday. I don’t like to link to paid content so here’s a good Business Insider summary of the article ...
-
Stripe: Apple Pay
stripe.com
Stripe is a suite of APIs that powers commerce for businesses of all sizes.
-
The Learning Myth: Why I'll Never Tell My Son He's Smart
www.khanacademy.org
By: Salman Khan Join the #YouCanLearnAnything movement My 5-year-old son has just started reading. Every night, we lie on his bed and he reads a ...
-
On ‘Dark Talent’, MOOCs, Universities, and Startups: An Interview with the ...
a16z.com
We’re bringing together a great group of computer science professors from around the U.S. for talks and discussion as part of our second annual ...
-
OpenGov: The Startup Analyzing $50B in Spending | Andreessen Horowitz
a16z.com
“A billion here, a billion there, and pretty soon you’re talking real money!” — attributed to Fmr. Sen. Everett Dirksen
-
Demystifying Venture Capital Economics, Part 2 - Wealthfront ...
blog.wealthfront.com
Just because a company operates at a loss today doesn’t mean it can’t be profitable in the future. Those unfamiliar with venture capital economics ...
-
Sequoia’s Moritz: Alibaba IPO Signals New Internet Era
blogs.wsj.com
Michael Moritz, the billionaire venture capitalist whose firm quietly invested in Alibaba, says the company's IPO is the beginning of a new era for ...

-
In Silicon Valley, Mergers Must Meet the Toothbrush Test
dealbook.nytimes.com
Companies like Google are employing unorthodox criteria — say, whether a product is used daily, like a toothbrush — to size up their deal targets, ...
-
ESPN's Bill Simmons suspended for Goodell rant; barred from Twitter
www.chicagotribune.com
ESPN analyst Bill Simmons has been suspended for three weeks after he made profane comments about NFL Commissioner Roger Goodell during a podcast.
-
Digital Business Technologies Dominate Gartner 2014 Emerging Technologies ...
www.forbes.com
By Hung LeHong and Jackie Fenn Gartner, Inc. Imagine this: As you leave for work in the morning, your house automatically turns down the heat and ...
-
Talko | Talko is the best way to use your voice to get things done.
www.talko.com
TALK. SHARE. DO. Amazing things can happen when we talk with each other. Thoughts are shared, ideas formed and problems solved. Talko is the best way ...
-
Congratulating Apcera
www.trueventures.com
This morning, Ericsson announced that is has acquired a majority stake in True portfolio company Apcera. This is an incredible partnership for both ...
-
Peter Thiel and David Graeber Debate Technology’s Future
www.nytimes.com
Peter Thiel, the Silicon Valley entrepreneur, debated barriers to technology with the anthropologist David Graeber at a forum in Manhattan.
-
Together, Square Sellers Are the 13th Largest Retailer in the Country - ...
blog.squareup.com
The Official Square Blog is a place for sellers to find valuable tips and insights for running their business, learn from one another's challenges ...
-
A Long, Ugly Year of Depression That's Finally Fading - Rand's Blog
moz.com
Yesterday morning I woke up early to speak at the Business of Software conference in Boston. It was my first time there, and it’s an exceptional ...
-
The Coin Center – AVC
avc.com
We have found that the best way to deal with policy makers and regulators when something new and threatening and dangerous looking comes around is to ...
-
U2 and Apple Are Working On A New Digital Music Format
time.com
The four members of the legendary Irish band tell TIME about another new album in the works—and its secret Apple project that might just save the ...
-
How to Start a Startup
startupclass.samaltman.com
CS183B is a class we’re teaching at Stanford. It’s designed to be a sort of one-class business course for people who want to start startups.
-
UberMILITARY: We Want You | Uber Blog
blog.uber.com
Transitioning from military to civilian life can be challenging, but at Uber we understand that veterans are some of our nation’s most talented and ...
-
Why We Invested in Renovo Motors
www.trueventures.com
Who is crazy enough to take on the car industry? This was the question of the day as numerous spectators, car enthusiasts and automotive reporters ...
-
Peter Thiel: Twitter Executives 'Probably' Smoke Too Much Pot, And That's ...
www.businessinsider.com
"Twitter is hard to evaluate. They have a lot of potential. It's a horribly mismanaged company — probably a lot of pot-smoking going on there."
-
Y Combinator Will Teach A Class On Startups At Stanford This Fall | ...
techcrunch.com
Startup accelerator Y Combinator is an undeniably helpful resource for entrepreneurs looking for mentorship through the tough process of building a ...
-
Bad Managers Talk, Good Managers Write
blog.idonethis.com
One of the most vital skills you can have as a manager is the ability to write. When managers write, they raise accountability, coherence, and ...
-
From Scratch– Jeremy Stoppelman, Co–founder, Yelp
www.fromscratchradio.com
Yelp provides user-generated reviews of local businesses through its website and mobile app. Its contributors provide their opinions on a variety of ...
-
Why Did Docker Catch on Quickly and Why is it so Interesting? | The New ...
thenewstack.io
Docker has rapidly become “the new thing” for computing in 2014. Why did that happen so quickly, and how has a Linux application container become so ...
-
Sun and Wind Alter Global Landscape, Leaving Utilities Behind - NYTimes.com
www.nytimes.com
HELIGOLAND, Germany — Of all the developed nations, few have pushed harder than Germany to find a solution to global warming. And towering symbols of ...


Home
Book Tickets
Track Your Train
More
About Us
Contact Us
Log In / Register
Login
Register
Remember Me
Forgot Password?


phone_forwardedphoneContact Numbers
In times of need you can refer to these phone numbers
to have support. It's always okay to have someone to talk to
Suicide Prevention Lifeline
We can all help prevent suicide. The Lifeline provides 24/7,
free and confidential support for people in distress, prevention and crisis
resources for you or your loved ones, and best practices
for professionals.
phone 1-800-273-8255
Crisis Hotline
Crisis Call Center’s 24-hour crisis line often
serves as the first point of contact for individuals who are seeking
help, support, and information. Crisis can affect anyone at any time.
The need for emotional support or referral assistance is something most
individuals encounter at some point in their lives.
phone<PHONE_NUMBER>
Crisis Text Line
Free, 24/7 support for people in crisis. Every texter
is connected with a Crisis Counselor, a real-life human being trained to
bring texters from a hot moment to a cool calm through active listening
and collaborative problem solving. All of our Crisis Counselors are volunteers,
donating their time to helping people in crisis.
Resource Links
Some possibly useful links to resources
Breathing Exercises
A few links to breathing exercises to try
5 Anti Stress Breathing techniques
4 Breathing Exercises to Reduce Your Stress
Square Breathing Technique Video
Anger Management Information
Some links on anger management
10 tips to tame your temper Mayo Clinic
Mental Health and Anger Management
Please sign in with your google account to access Sunshine Journal


QUESTIONS? CALL:
+963000000000
About Us
Contact Us
ALPHAD
Projects
Pricing
TheTeam
offer!
Projects
Pricing
TheTeam
contact us


This page is under development it gives visualisations of the rankings of PI videos derived from the raw peer ranking data, using a modified Bradley-Terry model.
Each dot represents a video. Click on a dot to see the relevant homepage presentation of the video in the iframe (the inclusion of this content in this page is under development and will be will be improved). The vertical positions of each dot represents (on a log scale) the coefficient for this video in a Bradley-Terry-Zermelo choice model. For further details of the model, see below.
Videos were peer-ranked according to three criteria: relevance, content, presentation. The check boxes allow you to select any subset of these. The dots move vertically towards a maximum likelihood model given the selected peer rankings. A further checkbox allows you to stop (and restart) the simulation.
Energy Stop
The Zermelo-Bradley-Terry distribution is a generative model for a set of binary rankings, first introduced by Zermelo in 1929. In this model, the odds that individuals \(i,j\) are ranked \(i\succ j\) are given by \(\gamma_i/\gamma_j\). Equivalently, \(P(i\succ j) = \frac{\gamma_i}{\gamma_i+\gamma_j}\).
This work was extended by Luce to study rankings. For example, if we take three individuals, \(i,j,k\) then the probability of the ranking \(i\succ j\succ k\) is given by \[ P(i\succ j\succ k) = \frac{\gamma_i}{(\gamma_i+\gamma_j+ \gamma_k)}\cdot\frac{\gamma_j}{(\gamma_i+\gamma_j)}\quad\text{and, more generally,}\quad P(x_1\succ x_2\succ\ldots\succ x_{n-1}\succ x_n) =\prod_{k\lt n}\frac{\gamma_k}{\sum_{i=k}^n\gamma_i},\quad\text{where $\gamma_i$ is the strength of $x_i$,}\] gives the probability of a given ranking of \(n\) individuals.
Here, the individuals are videos, and we have a sample of partial rankings based on three separate criteria: relevance, presentation, and content. We assume that these rankings are drawn from a distribution based on Bradley-Terry parameters.
In total, we have \(132\) videos and \(119\times 3\) rankings. Each marker is given a set of nine videos. These sets are designed to give a multiple cover of the collection of videos, with minimal intersections (a nine-fold cover by design, but a few markers failed to deliver). For each criterion this set is ranked on triage scale, on which the videos are classed as below average (Red), average (Amber), or above average (Green). Markers are required to give a ranking: at least three videos must be ranked Red and at least three Green.
Our distribution includes five factors. \[ P(G\succ A\succ R)\sim \left(\frac{\mathcal{G}}{\mathcal{G+A+R}}\right)^{\lvert G\rvert}\cdot\left(\frac{\mathcal{A}}{\mathcal{A+R}}\right)^{\lvert A\rvert}\cdot \mathcal{G}^{\star}\cdot \mathcal{A}^{\star}\cdot \mathcal{R}^{\star},\\ \text{ where, }\quad\mathcal{G}^{\lvert G\rvert} = \prod_{g\in G}{\gamma_g}\quad \mathcal{A}^{\lvert A\rvert} = \prod_{a\in A}{\gamma_a}\quad \mathcal{R}^{\lvert R\rvert} = \prod_{r\in R}{\gamma_r},\\ \mathcal{G}^{\star} = \prod_{g\in G}\frac{{(\gamma_g\cdot \mathcal{G})^{1/2}}}{(\gamma_g + \mathcal{G})}\quad \mathcal{A}^{\star} = \frac{\mathcal{A}^{\lvert A\rvert}}{\prod_{a\in A} (\gamma_a + \mathcal{A})}\quad \mathcal{R}^{\star} = \prod_{r\in R}\frac{\mathcal{R}}{ (\gamma_r + \mathcal{R})}.\] The first two factors model the ranking as attributing the (geometric) mean strength of the members to each set, and then making judgements that \(g\in G\) dominates both \(\mathcal{A}\) and \(\mathcal{R}\), using this mean strength for each comparison, and similarly, that each \(a\in A\) dominates \(\mathcal{R}\), based on these mean strengths.
The remaining factors express the cohesion of each chosen set of videos. For each set \(X\in \{R, A, G\}\), they correspond to adding an 'observation' that ranks \(x\in X\) both above and below a hypothetical phantom video endowed with the mean strength, \(\mathcal{X}\). We show these in three equivalent forms; the first shows this as the square root of a product of probabilities, the final form is more convenient for the calculations below.
The log-likelihood \(\ell(G\succ A\succ R)\) is given by \[\begin{aligned} \ell(G\succ A\succ R) &= \lvert G\rvert\left(\ln(\mathcal{G}) - \ln(\mathcal{G+A+R})\right) + \lvert A\rvert\left(\ln(\mathcal{A}) -\ln(\mathcal{A+R})\right)\\ &+\sum_{g\in G}\left(\ln(\mathcal{G})-\ln(\gamma_g+\mathcal{G})\right) + \sum_{a\in A}\left(\ln(\mathcal{A})-\ln(\gamma_a+\mathcal{A})\right) + \sum_{r\in R}\left(\ln(\mathcal{R})-\ln(\gamma_r+\mathcal{R})\right) \end{aligned}\] \[\begin{align*}\frac{\partial\ell(G\succ A\succ R)}{\partial \gamma_g}&=\frac{\mathcal{G}}{\gamma_g}\cdot \left(\frac{2}{\mathcal{G}} -\frac{1}{\mathcal{(G+A+R)}}-\frac{1}{\lvert G\rvert}\sum_{x\in G}\frac{1}{(\mathcal{G} + \gamma_{x})}\right) - \frac{1}{\mathcal{G}+\gamma_g}\\ \frac{\partial\ell(G\succ A\succ R)}{\partial \gamma_a} &=\frac{\mathcal{A}}{\gamma_a}\cdot\left(\frac{2}{\mathcal{A}} -\frac{\lvert G\rvert}{\lvert A\rvert\mathcal{(G+A+R)}}-\frac{1}{(\mathcal{A+R})}-\frac{1}{\lvert A\rvert}\sum_{y\in A}\frac{1}{(\mathcal{A} + \gamma_{y})}\right) - \frac{1}{\mathcal{A}+\gamma_a}\\ \frac{\partial\ell(G\succ A\succ R)}{\partial \gamma_r}&= \frac{\mathcal{R}}{\gamma_r}\cdot\left(\frac{1}{\mathcal{R}}-\frac{\lvert G\rvert}{\lvert R\rvert\mathcal{(G+A+R)}} - \frac{\lvert A\rvert}{\lvert R\rvert\mathcal{(A+R)}}-\frac{1}{\lvert R\rvert}\sum_{z\in R}\frac{1}{(\mathcal{R} + \gamma_{z})}\right) - \frac{1}{\mathcal{R}+\gamma_r} \end{align*}\]
Following Zermelo, we use a maximum likelihood approach to assign the strength parameters \(\gamma_i\), for each individual, \(i\).
In the animation above, each node represents one video. The vertical position of each node represents the strength parameter for that video (on a log scale, base 2, so that each unit on the vertical scale represents doubling of odds). The origin represents the geometric average strngth.
The derivatives are applied as forces, which act on the nodes to increase the log likelihood of the model. These forces are simulated to implement a search for maximum likelihood values of the parameters, given all the rankings. A positive force acts to move the node up; a negative force acts downwards.
If we only included the first two factors in our model, gradient ascent would make \(\gamma_r\) tend to zero, for any video \(r\) that is always ranked \(R\). Adding the cohesion factors prevents overfitting for videos \(r\) with no positive, or no negative scores. The energy shown as part of the simulation is the negative log likelihood duer to the first two factors model. It does not include the energy of the phantom rankings used to regularise the model, so you may see an increase in energy when these effects dominate. At this point you can stop the simulation.
You can click on any node to see the comparisons that rank it higher or lower than other videos. These comparisons are represented by arrows; the arrow goes from the higher-ranked video to the lower-ranked. higher-ranked video. For the moment only the rankings for presentation are shown in this way, but all three criteria may be used, individually or in combination to drive the simulation. To replace the links click on another node; to remove them click on thebackground.
You can drag nodes and release them to see how the gradient ascent returns them to their proper position. Hovering over a node shows an anonymised identifier associated with the video. Soon you will be able to click to see further metadata and watch the video.


{% extends "flatpages/base.html" %} {% load i18n %} {% load as_vertical_form from bootstrap %} {% block head_title %} Change Password {% endblock %} {% block content %}
The password reset link was invalid, possibly because it has already been used. Please request a new password reset.
Your password is now changed.


FUSE allows to write file systems
which are processes running in userspace.
A fuse process is launched with a mountpoint
as argument: it is the root path where the FS
will be available. Let's say its /mountpoint here
When launched, the process will fork
fusermount program via libfuse
fusermount is owned by root with setuid bit
The first thing fusermount does is ensure FUSE
driver is in the kernel: lets say its not
FUSE driver is inserted
FUSE filesystem is declared in the VFS
A misc block device is registered
a file appears in /sys to notify there's a new
block device
/proc/misc now contains the minor number for this device.
The major's is misc's (10)
Since a new block device appeared in /sys, udev creates
/dev/fuse (mknod based on misc's major and fuse minor)
/dev/fuse is available. fusermount can now:
Open /dev/fuse and send its fd to the
file system process for it
to comunicate with FUSE driver
mount -t fuse /dev/fuse /mountpoint
After this mount, VFS associates /mountpoint with
FUSE filesystem.
The filesystem in user space can now be used.
Let's say we launch an ls command on a file managed by
FUSE.
This will issue a stat syscall to the VFS.
Which will in turn call the stat implementation
from fuse.
This implementation will call request_send(),
which will add the request to the list
of request structure.
the FS in userspace process, via libfuse,
reads /dev/fuse.
The FUSE in kernel driver callback fuse_dev_read()
is called.
The callback returns commands from the list
of request to libfuse
libfuse calls the the FS in userspace
implementation of stat
The FS returns its result
Then libfuse writes the result to /dev/fuse
This calls fuse_dev_write() which receives
the responses and places them in req->out
request_send() unblocks as there is a response.
it sends its result to the stat implementation
ls process receives the stats generated
by fuse process.


Hi, My Name is Bayizere Christine
Full Stack Software Developer.
A motivated, adaptable, and responsible Javascript and Python developer, seeking a position as Software Developper. I have a methodical, customer-focused approach to work and a strong drive to see projects through to completion.
view project
This an application has a front end side where user go through multiple questions. Then after answering he/she obtain scores immediately.
Quiz Board Projectview project
This an application where I used API to get data from Github database.In case a user seach using username of anyone whith github account he/she is able to get information about his repository, following, followers, and link to github.
github search projectview project
This an application with user interface, where user is able to vote any quote on his/her choise.And this application enable anyone to post quotes and to delete them.
Quotes Votes Projectview project
This an application that enable user to view highlighed news. He/she is able to view articles,and read more about articlse
News Highlightview project
This an application that enable user to post photos, then everyone can comment on photos posted.This application has search by category and search by location functionalities and when user click on photo,he/she find detail about the photo
Galleryview project
Blogs application enable user to signup/login in order to use Blog application, after he/she is of posting blogs and is able to subscribe
Quotes Votes Project


Basic simple-button-grid demo
simple-toolbar demo when always-expanded
simple-toolbar demo constrained by height
Loading simple-toolbar from a config object