Dem\u0259k olar ki h\u0259mi\u015f\u0259 OYP-dan (Obyekt Y\u00f6n\u00fcml\u00fc Proqramla\u015fd\u0131rma) istifad\u0259 ed\u0259n proqram\u00e7\u0131 m\u00fcsahib\u0259l\u0259rind\u0259 n\u0259inki OYP haqq\u0131nda, h\u0259m\u00e7inin SOLID prinsipl\u0259ri haqq\u0131nda soru\u015furlar. Bu prinsipl\u0259ri keyfiyy\u0259tli kod yazmaq \u00fc\u00e7\u00fcn bilm\u0259k \u00e7ox vacibdir. Ona g\u00f6r\u0259 bu m\u0259qal\u0259d\u0259 sizl\u0259r\u0259 SOL\u0130D prinsipl\u0259rini asan formada izah etm\u0259y\u0259 \u00e7al\u0131\u015facam.<\/p>\n\n\n\n

Obyekt Y\u00f6n\u00fcml\u00fc Proqramla\u015fd\u0131rma proqram\u00e7\u0131lara imkan yarad\u0131b ki, onlar bir birin\u0259 ox\u015far mahiyy\u0259tl\u0259ri (entity) bir birin\u0259 ba\u011flaya bilsinl\u0259r. Amma OYP-nin istifad\u0259si keyfiyy\u0259tli kod bazas\u0131n\u0131 t\u0259min etmir.<\/p>\n\n\n\n

Qar\u0131\u015f\u0131q, ayd\u0131n olmayan v\u0259 \u00e7\u0259tin saxlan\u0131lan kod h\u0259tta OYP il\u0259 d\u0259 yaz\u0131la bil\u0259r.<\/p>\n\n\n\n

Keyfiyy\u0259tli proqramlar haqq\u0131nda yazan m\u0259\u015fhur kitab m\u00fc\u0259llifi Robert Martin (uncle Bob) 5 \u0259sas OYP prinsipini yaratm\u0131\u015fd\u0131. Bu prinsipl\u0259r SOLID kimi adland\u0131r\u0131l\u0131blar.<\/p>\n\n\n\n

S<\/strong> – Single Responsibility Principle
O<\/strong> – Open-Closed Principle
L<\/strong> – Liskov Substitution Principle
I<\/strong> – Interface Segregation Principle
D<\/strong> – Dependency Inversion Principle<\/p>\n\n\n\n

\u0130lk bax\u0131\u015fdan b\u00fct\u00fcn bu s\u00f6zl\u0259r \u00e7\u0259tin v\u0259 qar\u0131\u015f\u0131q g\u00f6r\u00fcn\u00fcr, amma \u0259slind\u0259 bel\u0259 deyil.<\/p>\n\n\n\n

Keyfiyy\u0259tli, yax\u015f\u0131 kod n\u0259dir?<\/h3>\n\n\n\n

M\u0259nim fikirimc\u0259, bir \u00e7ox kod bazas\u0131n\u0131n hiss\u0259sini asanl\u0131qla d\u0259yi\u015fib ba\u015fqa t\u0259r\u0259fini s\u0131nd\u0131rmam\u0131s\u0131n\u0131zsa, dem\u0259li kodunuz keyfiyy\u0259tlidir.
Koda yeni funksionall\u0131\u011f\u0131n \u0259lav\u0259 etm\u0259 s\u00fcr\u0259ti ill\u0259r boyu eynidirs\u0259, dem\u0259li kodunuz \u00e7ox yax\u015f\u0131 yaz\u0131l\u0131b.
Kodun yax\u015f\u0131 qalmas\u0131 \u00fc\u00e7\u00fcn, proqram modullar\u0131n aras\u0131ndaki qo\u015fulmalar\u0131 minimuma azaltmal\u0131y\u0131q.

G\u0259lin SOLID prinsipl\u0259rin\u0259 bir bir baxaq:<\/p>\n\n\n\n

Single Responsibility Principle<\/h2>\n\n\n\n

Klass yaln\u0131z bir tap\u015f\u0131r\u0131qa m\u0259suliyy\u0259t da\u015f\u0131mal\u0131d\u0131r. \u018fg\u0259r bir klass bir ne\u00e7\u0259 bir birin\u0259 aid olmayan tap\u015f\u0131r\u0131qlar\u0131 yerin\u0259 yetir\u0259rs\u0259, onu varis (inherit) ed\u0259n klasslar bir birin\u0259 b\u0259rk ba\u011flanacaqlar.
V\u0259 bu varis olunan klasslardan birind\u0259 d\u0259yi\u015fiklik etdikd\u0259 ba\u015fqalar\u0131nda da etm\u0259li olacay\u0131q. Bu is\u0259 o dem\u0259kdir ki, kodun keyfiyy\u0259ti pisl\u0259\u015fdi.
Bu m\u0259qal\u0259d\u0259 b\u00fct\u00fcn m\u0259s\u0259l\u0259l\u0259r abstrakt olacaq, kodsuz.

G\u0259lin bir misala baxaq:<\/p>\n\n\n\n

Bizim Computer adl\u0131 klass\u0131m\u0131z var, hansi ki \u00f6z daxilind\u0259 bir ne\u00e7\u0259 funksiya (method) saxlayir<\/p>\n\n\n\n

<\/figure><\/div>\n\n\n\n

Bu klass n\u0259tic\u0259d\u0259 \u00e7ox b\u00f6y\u00fck klassa b\u00f6y\u00fcy\u0259 bil\u0259r, hans\u0131 ki \u00f6z daxilind\u0259 \u00e7ox sayl\u0131 m\u00fcxt\u0259lif metodlar saxlayacaq. Ba\u015fqa s\u00f6zl\u0259, biz Single Responsiblity prinsipini kobud \u015f\u0259kild\u0259 pozmu\u015f oluruq.

Bu problemi nec\u0259 h\u0259ll ed\u0259 bil\u0259rik?<\/p>\n\n\n\n

Biz Computer klass\u0131n\u0131 bir ne\u00e7\u0259 klassa b\u00f6l\u0259 bil\u0259rik:<\/p>\n\n\n\n

<\/figure><\/div>\n\n\n\n

Bel\u0259likl\u0259, h\u0259r klass\u0131n ayr\u0131 m\u0259suliyy\u0259ti var, v\u0259 funksiyalar\u0131 rahat, he\u00e7n\u0259 s\u0131nd\u0131rmadan d\u0259yi\u015fm\u0259k olar.<\/p>\n\n\n\n

Open-Closed Principle<\/h2>\n\n\n\n

• Klass geni\u015fl\u0259nm\u0259 \u00fc\u00e7\u00fcn a\u00e7\u0131q, d\u0259yi\u015fdirilm\u0259 \u00fc\u00e7\u00fcn ba\u011fl\u0131 olmal\u0131d\u0131r;<\/li>
• Bu prinsip proqram komponentl\u0259rinin yenid\u0259n istifad\u0259 edilm\u0259sini t\u0259min edir;<\/li>
• Klasslar\u0131n m\u0259suliyy\u0259tini ay\u0131randa, siz onu o c\u00fcr etm\u0259lisiniz ki, klass\u0131n davran\u0131\u015f\u0131 (funksionall\u0131\u011f\u0131) geni\u015fl\u0259ndiril\u0259 bilsin.<\/li><\/ul>\n\n\n\n

  Misal \u00fc\u00e7\u00fcn, varislik (inheritance) yaradaq:<\/p>\n\n\n\n

  <\/figure><\/div>\n\n\n\n

  H\u0259r Computer klass\u0131n alt klass\u0131nda biz x\u00fcsusi, \u00f6z\u00fcn\u0259 m\u0259hsus metodlar\u0131 yaza bil\u0259rik.<\/p>\n\n\n\n

  Liskov Substitution Principle<\/h2>\n\n\n\n

  Barbara Liskov prinsipini misalla ba\u015fa salma\u011fa \u00e7al\u0131\u015facam<\/p>\n\n\n\n

  <\/figure><\/div>\n\n\n\n

  G\u00f6rd\u00fcy\u00fcn\u00fcz kimi, Pinqvin v\u0259 \u00d6rd\u0259k klasslar\u0131n h\u0259r ikisi Qu\u015f (Bird) interface-ind\u0259n varis olunurlar v\u0259 h\u0259r ikisi o interface-in Fly funksiyas\u0131n\u0131 icra edirl\u0259r.<\/p>\n\n\n\n

  Amma pinqvinl\u0259r u\u00e7ma\u011f\u0131 bacarm\u0131r, ona g\u00f6r\u0259, \u015fablonu (interface-i) planlayaraq, biz Barbara Liskov prinsipini pozmu\u015f oldu\u011f.<\/p>\n\n\n\n

  N\u00f6vb\u0259ti prinsipd\u0259 m\u0259n bu problemin nec\u0259 h\u0259ll olunmas\u0131 haqq\u0131nda dey\u0259c\u0259m.<\/p>\n\n\n\n

  Interface Segregation Principle<\/h2>\n\n\n\n

  \u00c7oxlu spesifik, x\u00fcsusi interface saxlamaq, \u00e7ox az sayl\u0131 v\u0259 \u00fcmuml\u0259\u015fdirici interface-lardan yax\u015f\u0131d\u0131r.
  Bu prinsip h\u0259tta klass\u0131n m\u0259suliyy\u0259tini Barbara Liskov prinsipini pozmadan b\u00f6l\u0259 bilir.
  G\u0259lin misala baxaq:<\/p>\n\n\n\n

  <\/figure><\/div>\n\n\n\n

  \u0130ndi is\u0259, biz bilirik ki, qu\u015flar iki kateqoriyaya b\u00f6l\u00fcn\u00fcr, – u\u00e7an v\u0259 u\u00e7mayan qu\u015f n\u00f6vl\u0259rin\u0259.
  V\u0259 bu n\u00f6vl\u0259ri yaradaraq, Bird interface-\u0131ndan varis edirik, daha sonra is\u0259, pinqvin v\u0259 \u00f6rd\u0259yi d\u0259 onlardan varis edirik.<\/p>\n\n\n\n

  Dependency Inversion Principle<\/h2>\n\n\n\n

  • Abstraksiyalar x\u0131rdal\u0131qlardan as\u0131l\u0131 olmamal\u0131d\u0131rlar, – \u0259ksin\u0259, x\u0131rdal\u0131qlar abstraksiyalardan as\u0131l\u0131 olmal\u0131d\u0131rlar<\/li><\/ul>\n\n\n\n

    Prinsipin \u0259sas m\u0259qs\u0259di – proqram komponentl\u0259rin aras\u0131nda olan qo\u015fulmalar\u0131n minimuma q\u0259d\u0259r azad\u0131lmas\u0131d\u0131r.<\/p>\n\n\n\n

    H\u0259r yerd\u0259, bir klass obirsi klassdan istifad\u0259 edirs\u0259, bu qo\u015fulman\u0131 interface say\u0259sind\u0259 edin, birba\u015fa yox.<\/p>\n\n\n\n

    Bu prinsipin t\u0259dbiqi proqram\u0131n\u0131zdaki t\u0259nziml\u0259m\u0259l\u0259rinin say\u0131n\u0131 azaldacaq.<\/p>\n","protected":false},"excerpt":{"rendered":"

    Dem\u0259k olar ki h\u0259mi\u015f\u0259 OYP-dan (Obyekt Y\u00f6n\u00fcml\u00fc Proqramla\u015fd\u0131rma) istifad\u0259 ed\u0259n proqram\u00e7\u0131 m\u00fcsahib\u0259l\u0259rind\u0259 n\u0259inki OYP haqq\u0131nda, h\u0259m\u00e7inin SOLID prinsipl\u0259ri haqq\u0131nda soru\u015furlar. […]<\/p>\n","protected":false},"author":1,"featured_media":343,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[],"tags":[],"class_list":["post-349","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry"],"yoast_head":"\n