-
Notifications
You must be signed in to change notification settings - Fork 0
first commit #4
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Open
Sla-als
wants to merge
2
commits into
master
Choose a base branch
from
lesson05.1
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
first commit #4
Changes from all commits
Commits
Show all changes
2 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,87 @@ | ||
| package GeekBrains; | ||
|
|
||
| import org.w3c.dom.ls.LSOutput; | ||
|
|
||
| public class Main { | ||
|
|
||
| static final int SIZE = 10_000_000; | ||
| static final int HALF = SIZE/2; | ||
|
|
||
|
|
||
| public static void main(String[] args) { | ||
| mhetodOne(); | ||
| mhetodTwo(); | ||
| } | ||
|
|
||
|
|
||
| static void mhetodOne(){ | ||
| float[] arr = new float [SIZE]; | ||
| for (int i = 0; i < arr.length; i++) { | ||
| arr[i]=1; | ||
| } | ||
| long a = System.currentTimeMillis(); | ||
| for (int j = 0; j < arr.length;j++) { | ||
| arr[j] = (float)(arr[j] * Math.sin(0.2f + j / 5) * Math.cos(0.2f + j / 5) * Math.cos(0.4f + j / 2)); | ||
| } | ||
| System.out.println(System.currentTimeMillis() - a); | ||
|
|
||
| } | ||
|
|
||
|
|
||
| // Второй разбивает массив на два массива, | ||
| // в двух потоках высчитывает новые значения | ||
| // и потом склеивает эти массивы обратно в один. | ||
|
|
||
|
|
||
| //System.arraycopy(массив-источник, откуда начинаем брать данные из массива-источника, массив-назначение, откуда начинаем записывать данные в массив-назначение, сколько ячеек копируем) | ||
| static void mhetodTwo(){ | ||
| long a = System.currentTimeMillis(); | ||
| // 1 поток из первой половин | ||
| new Thread(new MyRunnableClass()).start(); | ||
| // 2 поток из второй половины | ||
| new Thread(new MyRunnableClassTwo()).start(); | ||
| System.out.println(System.currentTimeMillis() - a); | ||
| } | ||
|
|
||
| static class MyRunnableClass implements Runnable { | ||
| @Override | ||
| public void run() { | ||
|
|
||
|
|
||
| float[] arr = new float [SIZE]; | ||
| float[] arrHalf = new float [HALF]; | ||
| System.arraycopy(arr,0,arrHalf,0, arr.length/2); | ||
| for (int i = 0; i < arrHalf.length; i++) { | ||
| arr[i]=1; | ||
| } | ||
|
|
||
| for (int j = 0; j < arrHalf.length;j++) { | ||
| arr[j] = (float)(arr[j] * Math.sin(0.2f + j / 5) * Math.cos(0.2f + j / 5) * Math.cos(0.4f + j / 2)); | ||
| } | ||
| System.arraycopy(arrHalf,0,arr,0, arrHalf.length); | ||
| } | ||
| } | ||
|
|
||
| static class MyRunnableClassTwo implements Runnable { | ||
|
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. MyRunnableClassTwo похож на MyRunnableClass. Отличие только в индексах для копирования (откуда и куда). Можно в один объединить |
||
|
|
||
| @Override | ||
| public void run() { | ||
| float[] arr = new float [SIZE]; | ||
| float[] arrHalfTwo = new float [HALF]; | ||
|
|
||
| System.arraycopy(arr,arr.length/2,arrHalfTwo,0, arr.length/2); | ||
| for (int i = 0; i < arrHalfTwo.length; i++) { | ||
| arr[i]=1; | ||
| } | ||
|
|
||
| for (int j = 0; j < arrHalfTwo.length;j++) { | ||
| arr[j] = (float)(arr[j] * Math.sin(0.2f + j / 5) * Math.cos(0.2f + j / 5) * Math.cos(0.4f + j / 2)); | ||
| } | ||
|
|
||
| System.arraycopy(arrHalfTwo,0,arr,arrHalfTwo.length/2+1, arrHalfTwo.length); | ||
| } | ||
| } | ||
| } | ||
|
|
||
|
|
||
|
|
||
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Эти потоки еще нужно подождать, вызвав join()