API design ensuring backward compatibility -

-


API design ensuring backward compatibility -

are there best practices maintain in mind while designing api's ensures backward compatibility , new version releases. links articles/blogs appreciated.

you should check out presentation api design. it's google , pretty good. addresses backward compatibility , new releases.

how design api , why matters

api design backwards-compatibility

Comments

Post a Comment

Popular posts from this blog

delphi - blogger via idHTTP : error 400 bad request -

-
delphi - blogger via idHTTP : error 400 bad request - i'm trying post blogger using idhttp component, however, i'm getting "http/1.0 400 bad request" error. procedure tform1.button1click(sender: tobject); var request,response,req : tstringlist; auth,blogid : string; begin blogid := '00000000000000000000000'; request := tstringlist.create; response := tstringlist.create; req := tstringlist.create; idhttp1.request.connection := 'keep-alive'; idhttp1.request.contenttype := 'application/x-www-form-urlencoded'; idssliohandlersocket1.ssloptions.method := sslvsslv23; request.clear(); request.values['accounttype'] := 'google'; request.values['email'] := 'xxx@gmail.com'; request.values['passwd'] := 'yyy'; request.values['service'] := 'blogger'; response.text :=idhttp1.post('https://www.google.com/accounts/clientlogin',request); auth := resp...
Read more

content management system - How to allow only English submissions on Pligg CMS -

-
content management system - How to allow only English submissions on Pligg CMS - i have got client requirement using pligg cms social bookmarking. getting lot of manual spam entries in multiple languages. pligg has setting or plugin can allow english language entries. if 1 can suggest alternative pligg help. thanks in advance. i utilize spam trigger module (included pligg) , add together next 1 of trigger configuration fields settings page. À Á Â Ã Ä Å Æ Ā Ą Ă Ç Ć Č Ĉ Ċ Ď Đ È É Ê Ë Ē Ę Ě Ĕ Ė Ĝ Ğ Ġ Ģ Ĥ Ħ Ì Í Î Ï Ī Ĩ Ĭ Į İ IJ Ĵ Ķ Ľ Ĺ Ļ Ŀ Ł Ñ Ń Ň Ņ Ŋ Ò Ó Ô Õ Ö Ø Ō Ő Ŏ Œ Ŕ Ř Ŗ Ś Ş Ŝ Ș Š Ť Ţ Ŧ Ț Ù Ú Û Ü Ū Ů Ű Ŭ Ũ Ų Ŵ Ŷ Ÿ Ý Ź Ż Ž à á â ã ä ā ą ă å æ ç ć č ĉ ċ ď đ è é ê ë ē ę ě ĕ ė ƒ ĝ ğ ġ ģ ĥ ħ ì í î ï ī ĩ ĭ į ı ij ĵ ķ ĸ ł ľ ĺ ļ ŀ ñ ń ň ņ ʼn ŋ ò ó ô õ ö ø ō ő ŏ œ ŕ ř ŗ ś š ş ť ţ ù ú û ü ū ů ű ŭ ũ ų ụ ŵ ÿ ý ŷ ż ź ž ß ſ Α Ά Ἀ Ἁ Ἂ Ἃ Ἄ Ἅ Ἆ Ἇ ᾈ ᾉ ᾊ ᾋ ᾌ ᾍ ᾎ ᾏ Ᾰ Ᾱ Ὰ Ά ᾼ Β Γ Δ Ε Έ Ἐ Ἑ Ἒ Ἓ Ἔ Ἕ Έ Ὲ Ζ Η Ή Ἠ Ἡ Ἢ Ἣ Ἤ Ἥ Ἦ Ἧ ᾘ ᾙ ᾚ ᾛ ᾜ ᾝ ᾞ ᾟ Ὴ Ή ῌ Θ Ι Ί Ϊ Ἰ Ἱ Ἲ Ἳ Ἴ Ἵ Ἶ Ἷ Ῐ Ῑ Ὶ Ί Κ Λ Μ Ν Ξ ...
Read more

c++ - Is it possible to apply breadth-first search algorithm of boost library to matrix? -

-
c++ - Is it possible to apply breadth-first search algorithm of boost library to matrix? - my task find shortest way in matrix 1 point other. possible move in such direction (up, down, left, right). 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 1 f 0 0 1 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 s 0 1 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 s - start point f - destination place (finish) 0 - free cells (we can move through them) 1 - "walls" (we can't move through them) it obvious breadth first search solves problem in optimal way. know boost library supplies algorithm, haven't boost before. how can breadth first search in case using boost? understood, breadth first search algorithm of boost intended graphs. guess isn't thought convert matrix graph m*n vertices , m*(n -1) + (m-1)*n edges. can apply breadth first search algorithm matrix (without converting graph), or improve implement own function breadth first search? (apologies in advance length...
Read more