Mutation Testing - Voxxed Days Cluj-Napoca 2017

Nov 22, 20170 likes208 views

Mutation testing involves making small changes to code to test whether tests can detect the changes, like changing a + b to a - b. Running mutation testing on a Calculator class that returns the sum of inputs initially generated 1 test but did not kill any mutants. After adding a test with specific inputs, mutation testing was run again and generated 1 test that killed 1 mutant, achieving 100% coverage. The document discusses using mutation testing to improve test quality and ensure tests can detect small code changes or faults.

Mutation Testing - Voxxed Days Cluj-Napoca 2017

public class Calculator {
public int sum(int a, int b) {
return a + b;
}
}

@Test
public void
force100PercentCoverage() {
calculator.sum(0, 0);
}

public class Calculator {
public int sum(int a, int b) {
return a + b;
}
}
@Test
public
void force100PercentCoverage() {
calculator.sum(0, 0);
}

> MathMutator
>> Generated 1 Killed 0 (0%)
> KILLED 0 SURVIVED 1
> TIMED_OUT 0 NON_VIABLE 0
> MEMORY_ERROR 0 NOT_STARTED 0
> STARTED 0 RUN_ERROR 0
> NO_COVERAGE 0

$@Test public void Should_ReturnSum_When_SummingTwoValues() { // given int a = 1; int b = 2; // when int result = calculator.sum(a, b); // then assertThat(result).isEqualTo(3); }$

> MathMutator
>> Generated 1 Killed 1 (100%)
> KILLED 1 SURVIVED 0
> TIMED_OUT 0 NON_VIABLE 0
> MEMORY_ERROR 0 NOT_STARTED 0
> STARTED 0 RUN_ERROR 0
> NO_COVERAGE 0

if (a >= 100) {
throw new IllegalArgumentException();
}
if (a < 100) {
fooBar();
}

This document summarizes the evolution of Redux action creators from plain objects to functions that return action objects, and then to functions that return functions that dispatch actions. It discusses how middleware like Redux-Thunk and dependency injection allow async logic and testing of action creators. Redux-Saga is introduced as providing a cleaner way to write complex asynchronous action creators using generator functions. Key benefits of Redux-Saga include easy testing and ability to create daemon processes using patterns like takeLatest and takeEvery.

The redux saga beginsDaniel Franz

The document discusses refactoring an asynchronous Redux application from using Redux Thunk to Redux Saga. It begins by showing an example of an asynchronous action using Redux Thunk, which involves chaining callbacks. It then introduces Redux Saga as an alternative that uses generator functions to manage asynchronous logic in a cleaner way. The document shows how the same asynchronous action can be rewritten using Redux Saga effects like put(), call(), and takeEvery() within generator functions. Overall, the key points are that Redux Saga encapsulates side effects, has a more readable syntax than Redux Thunk, and makes asynchronous workflows easier to test.

Sql server ___________session_20(ddl triggers)Ehtisham Ali

The document discusses different types of triggers in SQL Server including: - DDL triggers that fire on database events like create, alter, and drop operations. - INSTEAD OF triggers that intercept DML operations like DELETE and allow modifying or replacing the action. - Nested triggers where one trigger firing can initiate another trigger. - Disabling triggers on a specific table or for all triggers.

React. Redux. Real world.Rost Galkin

This document discusses React, Redux, and real-world applications. It covers topics like universal rendering, testing Redux reducers, connecting React components to Redux, using immutable data structures with Redux, performing calculations with Redux and Reselect for memoization, asynchronous actions with thunk and saga middleware, isolating Redux state for reusable components, and comparing Redux architecture to ELM.

Amazing threesome, rrr... React. Redux. Real world / Ростислав Галкин (Babo)Ontico

"Все гениальное просто" — таким бы мог быть слоган Redux, одной из имплементаций FLUX-архитектуры, которой 31 мая исполняется ровно год. И вот уже практически год, как мы приняли решение использовать Redux в наших проектах. Это был осознанный риск, о котором мы ничуть не пожалели. За этот год мы научились писать тестируемый код, избегать мутаций и применять методы оптимизации для выбранного стека. Также нам пришлось написать собственные решения для инкапсуляции состояния при написании переиспользуемых компонент и для работы с формами произвольной глубины вложенности, а также мы написали свою сетку для отображения бесконечного числа элементов. Кроме этого, на больших нагрузках мы столкнулись с проблемами производительности рендеринга на сервере в изоморфном приложении и с успехом их решили. Обо всем этом я расскажу в своем докладе, поделюсь тем опытом и ощущениями, которые мне лично удалось получить за время работы с React и Redux.

C++ TUTORIAL 10Farhan Ab Rahman

Bindings: the zen of montageKris Kowal

Using Redux-Saga for Handling Side EffectsGlobalLogic Ukraine

In this presentation speaker considered theoretical basics of using the redux-saga library, which was created for facilitating the organization of the so-called “side effects” (for example, asynchronous operations). The event participants obtained practical tips on using saga in real-life projects. This presentation by Igor Nesterenko (Lead Software Engineer, Consultant, GlobalLogic, Kharkiv) was delivered at GlobalLogic Kharkiv JS TechTalk #2 on August 17, 2018.

Redux saga: managing your side effects. Also: generators in es6Ignacio Martín

The document summarizes a presentation on Redux Sagas given at a React Native meetup in Munich in May 2017. It introduces generators and how they enable asynchronous logic to be written in a synchronous style. It provides examples of using generators to increment a value each time a new value is passed in and shows how generators can be used in a loop. The purpose of Redux Sagas is to manage asynchronous side effects in Redux applications using generator functions.

C++ TUTORIAL 7Farhan Ab Rahman

This document contains C++ code examples using numerical methods like Newton-Raphson, successive approximation, and secant methods to find the real roots of various equations. It includes 6 questions/problems with sample code to find roots of equations like x^4 - 11x = 8, e^x - 3x^2 = 0, x^3 - 2x - 3 = 0, and sin(x) + 3cos(x) = 2. For each problem, the code provided the numerical method used, input/output examples, and calculations to iteratively approximate the root to within a set tolerance.

C++ TUTORIAL 9Farhan Ab Rahman

What they don't tell you about JavaScriptRaphael Cruzeiro

The document describes methods for getting quadrants of a quadtree data structure: - The southWest method returns a new quadtree representing the southwestern quadrant, with origins and sizes set accordingly. - The southEast method similarly returns a new quadtree for the southeastern quadrant, with origins and sizes of that region. - Both methods take the existing quadtree as an argument and return a new subtree quadtree representing the specified quadrant region.

The Ring programming language version 1.8 book - Part 73 of 202Mahmoud Samir Fayed

C++ TUTORIAL 6Farhan Ab Rahman

This document contains C++ code to find roots of equations using the bisection method. It includes 4 questions: 1) Finds the root of x3 – 4x – 8.95 = 0 between 2 and 3 to 3 decimal places. 2) Finds the root of ex – 3x = 0 using bisection up to a specified number of iterations. 3) Defines a bisection function to find the root of f(x) = x6 – x – 1 = 0 within 0.001 accuracy. 4) Defines a bisection function to find the smallest positive root of a cubic equation ax3+bx2+cx+d=0 within an error tolerance of 10-6.

กลุ่ม6Witita Khamsook

The document discusses various functions in VB.NET and C/C++. It covers functions related to procedures, modules, parameters, and passing arguments by value vs reference. It also summarizes common mathematical functions like pow(), logical functions for characters, and string handling functions such as strlen(), strcmp(), strcpy(), and strcat(). Functions are demonstrated with code examples and header file inclusions.

The Ring programming language version 1.9 book - Part 65 of 210Mahmoud Samir Fayed

Utspencari buku

This document contains Java code that simulates rolling dice multiple times. It prompts the user to enter the number of rolls, uses a random number generator to simulate each roll, counts the frequency of each result, and displays the results. It generates random numbers between 1-6 to represent each roll of a die, counts the occurrences of each number, and outputs the total rolls and frequency of each result.

The Ring programming language version 1.5.3 book - Part 65 of 184Mahmoud Samir Fayed

The Ring programming language version 1.5.3 book - Part 70 of 184Mahmoud Samir Fayed

JavaScript Futures—ES2017 and BeyondJeff Strauss

JavaScript keeps on expanding. As adoption of the extensive new features from ES6 has spread and projects have adapted, the language has continued to evolve under the guidance of Ecma TC39. Over the past two years, another handful of constructs entered the ECMAScript specification. And there are nearly two dozen more proposals on the cusp of being added. One thing is certain: the JavaScript community is not slowing down! How can we determine when it is “safe” to use a new feature? Investigate the new and proposed language features of JavaScript. Understand the TC39 review process. And most of all, become empowered to prepare for what lies ahead.

Clojure functions examplesJackson dos Santos Olveira

The document provides examples of common Clojure functions like odd?, even?, dotimes, and defines functions for calculating car taxes based on speed and depositing, withdrawing, and assessing balances from bank accounts. It also includes tests for the car tax and bank functions to validate their outputs. The examples demonstrate how Clojure handles basic operations and conditionals, and the tests show how to validate functions in Clojure.

tsCHEN Qingjun

C++ TUTORIAL 3Farhan Ab Rahman

This document contains code snippets and explanations for 5 questions on structured programming in C++. Question 1 involves writing a program to determine if a number is odd or even. Question 2 prints a multiplication table as a lower triangular matrix using different loop structures. Question 3 solves quadratic equations. Question 4 finds the mean of N numbers using various loops. Question 5 calculates the sum of even and odd numbers up to N using different loops. The document provides the code and output for each question using different loop structures like for, while, and do-while loops.

ヘルスケアサービスを実現する最新技術〜HealthKit・GCP + Goの活用〜DeNA

10CSL67 CG LAB PROGRAM 7Vanishree Arun

10CSL67 CG LAB PROGRAM 8Vanishree Arun

Tech Talk - Immutable Data StructureDi Fan

Java весна 2013 лекция 5Technopark

The document contains code snippets from Java classes and methods. It defines classes for unit testing like simpleTest with setup and test methods. It also contains a Math class with methods to calculate sum and division. Further code shows testing of the Math class and use of annotations for parameter checking. The document also includes code for web driver initialization and login testing. It defines methods for avatar actions and contains a run loop with timing checks. Code for memory monitoring is also present.

Week 5준성 조

The document discusses functions in C programming. It begins by defining a basic sum function that takes in two integer parameters and returns their sum. It then shows an example of calling the sum function from main and printing the returned value. Next, it discusses using math library functions by including the math header file and linking to the math library. It provides examples of functions that take in real number parameters and outputs values with a specified number of decimal places, such as a function to find the greatest common divisor of two numbers. Finally, it discusses representing numbers as continued fractions and creating a function to output the coefficients of a continued fraction.

JavaCro'14 - JCalc Calculations in Java with open source API – Davor SauerHUJAK - Hrvatska udruga Java korisnika / Croatian Java User Association

During different calculations with decimal numbers in Java we come to problem with using primitive data types and their precision. Especially when we work with a double and we come across of losing precision. Another solution is to use BigDecimal, but still we have a problem of easy writing formula. JCalc open source API provides easy writing formula in Java and maintaining precision offered by the BigDecimal. This talk will cover basic JCalc usage and functionalities of API.

More Related Content

What's hot (19)

Redux saga: managing your side effects. Also: generators in es6Ignacio Martín

C++ TUTORIAL 7Farhan Ab Rahman

C++ TUTORIAL 9Farhan Ab Rahman

What they don't tell you about JavaScriptRaphael Cruzeiro

The Ring programming language version 1.8 book - Part 73 of 202Mahmoud Samir Fayed

C++ TUTORIAL 6Farhan Ab Rahman

กลุ่ม6Witita Khamsook

The Ring programming language version 1.9 book - Part 65 of 210Mahmoud Samir Fayed

Utspencari buku

The Ring programming language version 1.5.3 book - Part 65 of 184Mahmoud Samir Fayed

The Ring programming language version 1.5.3 book - Part 70 of 184Mahmoud Samir Fayed

JavaScript Futures—ES2017 and BeyondJeff Strauss

Clojure functions examplesJackson dos Santos Olveira

tsCHEN Qingjun

C++ TUTORIAL 3Farhan Ab Rahman

ヘルスケアサービスを実現する最新技術〜HealthKit・GCP + Goの活用〜DeNA

10CSL67 CG LAB PROGRAM 7Vanishree Arun

10CSL67 CG LAB PROGRAM 8Vanishree Arun

Tech Talk - Immutable Data StructureDi Fan

Redux saga: managing your side effects. Also: generators in es6Ignacio Martín

C++ TUTORIAL 7Farhan Ab Rahman

C++ TUTORIAL 9Farhan Ab Rahman

What they don't tell you about JavaScriptRaphael Cruzeiro

The Ring programming language version 1.8 book - Part 73 of 202Mahmoud Samir Fayed

C++ TUTORIAL 6Farhan Ab Rahman

กลุ่ม6Witita Khamsook

The Ring programming language version 1.9 book - Part 65 of 210Mahmoud Samir Fayed

Utspencari buku

The Ring programming language version 1.5.3 book - Part 65 of 184Mahmoud Samir Fayed

The Ring programming language version 1.5.3 book - Part 70 of 184Mahmoud Samir Fayed

JavaScript Futures—ES2017 and BeyondJeff Strauss

Clojure functions examplesJackson dos Santos Olveira

tsCHEN Qingjun

C++ TUTORIAL 3Farhan Ab Rahman

ヘルスケアサービスを実現する最新技術〜HealthKit・GCP + Goの活用〜DeNA

10CSL67 CG LAB PROGRAM 7Vanishree Arun

10CSL67 CG LAB PROGRAM 8Vanishree Arun

Tech Talk - Immutable Data StructureDi Fan

Similar to Mutation Testing - Voxxed Days Cluj-Napoca 2017 (6)

Java весна 2013 лекция 5Technopark

Week 5준성 조

JavaCro'14 - JCalc Calculations in Java with open source API – Davor SauerHUJAK - Hrvatska udruga Java korisnika / Croatian Java User Association

JCalc:Calculations in java with open source APIDavor Sauer

I dont know what is wrong with this roulette program I cant seem.pdfarchanaemporium

I don\'t know what is wrong with this roulette program I can\'t seem to get it to run. Game Class: public class Game { public static void main(String[] args) { Table table = new Table(); BinBuilder bb = new BinBuilder(); Outcome black = new Outcome(\"Black\", 35); Bet bet = new Bet(10, black); table.placeBet(bet); Bin bin = bb.wheel.get(8); System.out.println(bin.toString()); System.out.println(table.bets.toString()); System.out.println(black.toString()); ListIterator i = table.bets.listIterator(); Iterator b = bin.outcomes.iterator(); while(i.hasNext()) { System.out.println(i.next().outcome.name.toString()); while(b.hasNext()){ System.out.println(b.next().name.toString()); if(i.next().outcome.equals(b.next())){ System.out.println(\"Win!\"); } else{ System.out.println(\"Win :/\"); } } } } } Player Class public class Player { public Table table; public Outcome black; public Bet bet; public Player(Table table) { table = new Table(); black = new Outcome(\"Black\", 1); } void placeBets() { Bet bet = new Bet(100, black); table.placeBet(bet); } void win(Bet bet) { System.out.println(\"You\'ve won: \" + bet.winAmount()); } void lose(Bet bet) { System.out.println(\"You lost!\" + bet.loseAmount() + \":/\"); } } Outcome class public class Outcome implements Comparable { public String name; public int odds; public Outcome(String name, int odds){ this.name = name; this.odds = odds; } public int winAmount(int amount){ return amount*this.odds; } public boolean equals(Outcome other){ return (this.name.equals(other.name)); } public String toString() { Object[] values= { name, new Integer(odds) }; String msgTempl= \"{0} ({1}:1)\"; return MessageFormat.format( msgTempl, values ); } @Override public int compareTo(E arg0) { if(this.equals(arg0)){ return 0; } return 1; } } Table Class public class Table { public int limit = 1000; public LinkedList bets; public Table() { bets = new LinkedList(); } public boolean isValid(Bet bet) { int sum = 0; for(Bet bett: bets) { sum += bett.amountBet; } return (sum>limit); } public void placeBet(Bet bet) { bets.add(bet); } ListIterator iterator() { return bets.listIterator(); } } Wheel Class public class Wheel extends TreeSet { Vector bins; NonRandom rng; Set all_outcomes; Wheel(NonRandom rng){ this.rng = rng; rng = new NonRandom(); all_outcomes = new TreeSet(); bins = new Vector(38); for (int i=0; i<38; i++){ bins.add(i, new Bin()); } } Bin next(){ int rand = rng.next(38); return bins.elementAt(rand); } Bin get(int bin){ return bins.elementAt(bin); } public Outcome getOutcome( String name ){ TreeSet result= new TreeSet(); for( Iterator i = all_outcomes.iterator(); i.hasNext(); ) { Outcome oc= i.next(); if( oc.name.contains(name) ) {result.add( oc );} } return result.first(); } public void addOutcome(int bin, Outcome outcome) { all_outcomes.add(outcome); this.bins.elementAt(bin).add(outcome); } } Bet Class public class Bet { public int amountBet; public Outcome outcome; public Bet(int amount, Outcome outcome) { this.outcome = o.

10 - Scala. Co-product type (sum type)Roman Brovko

1. The document discusses sum types (coproducts) in type theory, which allow combining multiple types into a single type using constructors like inl and inr. 2. Sum types have formation rules for constructing a sum of two types A and B, and eliminators for pattern matching on a sum. 3. Examples are given of implementing sum types in Haskell, Scala, Java, and using ProvingGround's built-in and custom sum types.

Java весна 2013 лекция 5Technopark

Week 5준성 조

JavaCro'14 - JCalc Calculations in Java with open source API – Davor SauerHUJAK - Hrvatska udruga Java korisnika / Croatian Java User Association

JCalc:Calculations in java with open source APIDavor Sauer

I dont know what is wrong with this roulette program I cant seem.pdfarchanaemporium

10 - Scala. Co-product type (sum type)Roman Brovko

More from Rafał Leszko (20)

Build Your Kubernetes Operator with the Right Tool!Rafał Leszko

The document discusses different tools and frameworks for building Kubernetes operators, including the Operator SDK, Helm, Ansible, Go, KOPF, Java Operator SDK, and using bare programming languages. It provides examples of creating operators using the Operator SDK with Helm, Ansible and Go plugins, and also using the KOPF Python framework. The document highlights the key steps and capabilities of each approach.

Mutation Testing with PITRafał Leszko

This document discusses mutation testing and how it can be used to evaluate test quality. Mutation testing works by artificially inserting bugs called "mutants" into code and seeing if tests can detect the mutations. If tests fail on a mutant, it is considered "killed", otherwise the mutant is said to have "survived". The document demonstrates how to use the PIT mutation testing tool on simple calculator code and a larger codebase. Adoption of mutation testing has increased in recent decades as tools have improved performance. Mutation testing can help find gaps in test coverage and ensure tests are properly evaluating the logic of the code.

Distributed Locking in KubernetesRafał Leszko

The document discusses different approaches to distributed locking in Kubernetes. It begins with an introduction to distributed locking and reasons for using it. It then covers several approaches: single-instance locking using a centralized lock manager like Hazelcast; multi-instance locking across a cluster; RedLock using multiple Redis instances; consensus-based locking; Kubernetes native locking libraries; and fenced locking which uses tokens to prevent lost updates. The document provides code examples for several approaches and discusses tradeoffs around efficiency, correctness, complexity and performance for each.

Architectural patterns for high performance microservices in kubernetesRafał Leszko

Architectural caching patterns for kubernetesRafał Leszko

The document summarizes several common architectural caching patterns for Kubernetes: 1. Embedded caching stores cache data directly within application processes or containers. 2. Client-server caching moves the cache to a separate server or service, accessed by applications via the network. 3. Sidecar caching co-locates an independent caching container alongside application containers to provide low-latency access while separating concerns.

Architectural patterns for caching microservicesRafał Leszko

Mutation testing with PITRafał Leszko

This document discusses mutation testing and how it can be used to evaluate test quality. It begins with an introduction to the speaker and explains that mutation testing works by artificially inserting bugs called "mutants" into code and seeing if tests can detect the changes. The document then demonstrates how to use the PIT mutation testing tool on sample code and discusses how mutation testing can be applied to larger codebases. It addresses common questions and concerns about using mutation testing in practice.

[jLove 2020] Where is my cache architectural patterns for caching microservi...Rafał Leszko

Where is my cache architectural patterns for caching microservices by exampleRafał Leszko

The document discusses various architectural patterns for caching microservices, including embedded caching, embedded distributed caching, client-server caching, cloud caching, sidecar caching, reverse proxy caching, and reverse proxy sidecar caching. It provides examples and pros and cons of each pattern. The presentation concludes with a summary of when each pattern may be best suited based on factors like whether the application is aware of the cache, if it uses containers, the data volume, security restrictions, language agnostic needs, and cloud usage.

Architectural caching patterns for kubernetesRafał Leszko

Build your operator with the right toolRafał Leszko

5 levels of high availability from multi instance to hybrid cloudRafał Leszko

The document discusses 5 levels of high availability architecture for applications and services, ranging from single instance up to multi-cloud deployments. It covers Level 0 with a single instance, Level 1 using multiple instances in the same region, Level 2 spanning multiple availability zones, Level 3 across multiple regions, and Level 4 leveraging multiple cloud providers. Each level increases availability at the cost of greater complexity and potential for higher latency.

Where is my cache? Architectural patterns for caching microservices by exampleRafał Leszko

This document discusses various architectural patterns for caching microservices, including embedded caching, embedded distributed caching using Hazelcast, client-server caching with a separate cache server, caching as a cloud service, sidecar caching using a cache container alongside the application container, reverse proxy caching, and reverse proxy sidecar caching. It provides examples of implementing each pattern using technologies like Hazelcast, Spring, and Kubernetes. The presentation concludes with a summary of when each pattern may be best suited based on factors like whether the caching needs to be application-aware, support containers, be language-agnostic, handle large amounts of data, and more.

5 Levels of High Availability: From Multi-instance to Hybrid CloudRafał Leszko

The document discusses 5 levels of high availability for applications and services, from single instance deployments to hybrid cloud. Level 1 involves deploying multiple instances within an availability zone or region. Level 2 adds deployment across availability zones for redundancy if one zone fails. Level 3 spans multiple regions for redundancy if an entire region fails. Level 4 involves deploying across multiple cloud providers. The highest level, Level 5 hybrid cloud, provides redundancy across cloud and on-premises infrastructure. Each level increases availability but also complexity and potential latency. The document analyzes tradeoffs between consistency, latency, and functionality at each level.

Where is my cache architectural patterns for caching microservices by exampleRafał Leszko

This document discusses various architectural patterns for caching microservices, including embedded caching, embedded distributed caching using Hazelcast, client-server caching with a separate cache server, caching as a cloud service, sidecar caching using a cache container alongside the application container, reverse proxy caching, and reverse proxy sidecar caching. The presentation compares the pros and cons of each approach and provides examples of how to implement some of the patterns using Hazelcast and Kubernetes.

Where is my cache architectural patterns for caching microservices by exampleRafał Leszko

The document discusses various architectural patterns for caching microservices, including embedded caching, embedded distributed caching, client-server caching, cloud caching, sidecar caching, reverse proxy caching, and reverse proxy sidecar caching. It provides examples and descriptions of each pattern, discussing pros and cons. The presentation concludes with a summary matrix comparing the different caching patterns based on factors like whether they are application-aware, support containers, are language-agnostic, support large amounts of data, have security restrictions, and can be deployed to the cloud.

Where is my cache? Architectural patterns for caching microservices by exampleRafał Leszko

This document discusses various architectural patterns for caching microservices, including embedded caching, embedded distributed caching, client-server caching, cloud caching, sidecar caching, reverse proxy caching, and reverse proxy sidecar caching. It provides examples of implementing each pattern using technologies like Hazelcast, Spring, and Kubernetes. The presentation compares the pros and cons of each pattern based on factors like whether the cache is application-aware, language agnostic, suitable for containerized environments, able to handle large amounts of data, and subject to security restrictions.

[DevopsDays India 2019] Where is my cache? Architectural patterns for caching...Rafał Leszko

Where is my cache? Architectural patterns for caching microservices by exampleRafał Leszko

Stream Processing in the Cloud - Athens Kubernetes Meetup 16.07.2019Rafał Leszko

This document discusses stream processing using Hazelcast Jet. It begins with an introduction to stream processing and Hazelcast Jet. It then provides examples of word count and Twitter sentiment analysis to demonstrate Jet's capabilities. It discusses how Jet works under the hood and handles infinite streams and windowing. It also covers deploying Jet on Kubernetes and provides use cases like a stock trade aggregator and web crawler. Overall, the document provides an overview of Hazelcast Jet for stream processing and examples of how to use it for various tasks.