MetaTrader 5
Experts
지표
스크립트
라이브러리
보관함당사 팬 페이지에 가입하십시오
MQL5 MetaTrader 5용 소스 코드 라이브러리 - 3
라이브러리는 특정 기능을 포함하는 작은 하위 프로그램으로, 새로운 응용 프로그램을 개발하는 데 사용될 수 있습니다. 일단 작성되고 철저히 점검되면, 사용자는 라이브러리를 통해 새로운 MQL5 응용 프로그램의 개발 속도를 높일 수 있습니다. 예시 중 하나는 여러 수치 분석 함수를 포함하는 ALGLIB 라이브러리입니다.
MetaEditor에서 거래전략 개발 시 라이브러리 소스 코드를 다운로드하여 사용할 수 있습니다. 그것들은 MetaTrader 5에서는 독립적으로 실행할 수 없습니다.
Adds the ability to automatically export the transaction history after running the Expert in the strategy Tester.
from the logistic regression Article, I welcome all the thoughts on how we can build multiple dynamic Logistic Regression
Sorts the values in the first dimension of a multidimensional numeric array in the ascending order.
정규식은 빠르고 유연한 텍스트 처리를 위한 공식적인 언어를 제공합니다. 각 정규식은 정규식 엔진이 소스 텍스트에서 일치 항목을 찾으려고 하는 패턴(마스크)입니다． 패턴은 하나 이상의 character literals, operators, constructs으로 구성됩니다.
fuzzy 모델 개발을 위한 라이브러리인 FuzzyNet library C#으로 작성되었습니다. MQL5로 변환하는 동안 Mamdani-type 시스템을 위한 8개의 멤버십 기능과 4개의 defuzzification 방법이 라이브러리에 추가되었습니다.
This EA demonstrates creating and saving a graphic chart using data from the MT5 Strategy Tester.
Simple class for getting the number of microseconds (µs) elapsed since January 1, 1970
Extend of CFile class to work with the .set extension file which terminal will produce when the Input/Optimisation is saved.
This Function will retrieve the Assets next Opening Time and Closing Times, either following the current time or following a given time.
This class loads a licensing file by reading 64bit encrypted account data from a license file into an account array for the purpose of licensing. The Class is initialised with a Filename, a Master Key (m_hkey -> can be a secret key of your choice) and whether the file needs to be saved in the common folders or not.
hybrid sorting algorithm that provides both fast average performance and (asymptotically) optimal worst-case performance
gnome sort is based on the technique used by the dutch garden gnome
a simple sorting algorithm that people use to manually sort cards in a bridge hand
an efficient, general-purpose sorting algorithm
a highly efficient sorting algorithm, based on partitioning of array of data into smaller arrays
represent an operation to be performed on the elements of an object structure. visitor lets you define a new operation without changing the classes of the elements on which it operates
define the skeleton of an algorithm in an operation, deferring some steps to subclasses. template method lets subclasses redefine certain steps of an algorithm without changing the algorithm's structure
define a family of algorithms, encapsulate each one, and make them interchangeable. strategy lets the algorithm vary independently from clients that use it
allow an object to alter its behavior when its internal state changes. the object will appear to change its class
An (optional) include file to enhance error code handling experience.
define a one-to-many dependency between objects so that when one object changes state, all its dependents are notified and updated automatically
define a one-to-many dependency between objects so that when one object changes state, all its dependents are notified and updated automatically
without violating encapsulation, capture and externalize an object's internal state so that the object can be restored to this state later
Define an object that encapsulates how a set of objects interact mediator promotes loose coupling by keeping objects from referring to each other explicitly, and it lets you vary their interaction independently
Provide a way to access the elements of an aggregate object sequentially without exposing its underlying representation
Given a language, define a represention for its grammar along with an interpreter that uses the representation to interpret sentences in the language